A distributed energy-aware routing algorithm in software-defined networks
View/Open
Artículo principal (346,8Kb) (Restricted access)
Request copy
Què és aquest botó?
Aquest botó permet demanar una còpia d'un document restringit a l'autor. Es mostra quan:
- Disposem del correu electrònic de l'autor
- El document té una mida inferior a 20 Mb
- Es tracta d'un document d'accés restringit per decisió de l'autor o d'un document d'accés restringit per política de l'editorial
Cita com:
hdl:2117/116052
Document typeConference report
Defense date2016
Rights accessRestricted access - publisher's policy
All rights reserved. This work is protected by the corresponding intellectual and industrial
property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public
communication or transformation of this work are prohibited without permission of the copyright holder
Abstract
In this paper we address the issue of designing a novel distributed routing algorithm that optimizes the power consumption in large scale software-defined networks (SDN) with multiple domains. The solution proposed, called DEAR (distributed energy-aware routing), tackle the problem of minimizing the number of links that can be used to satisfy a given traffic demand under performance constraints such as control traffic delay and link utilization.
CitationFernández-Fernández, A., Cervelló-Pastor, C., Ochoa-Aday, L. A distributed energy-aware routing algorithm in software-defined networks. A: International Conference on Practical Applications of Agents and Multi-Agent Systems International Conference. "Trends in practical applications of scalable multi-agent systems, the PAAMS collection". 2016, p. 369-373.
ISBN978-3-319-40158-4
Publisher versionhttp://link.springer.com/chapter/10.1007%2F978-3-319-40159-1_32
Files | Description | Size | Format | View |
---|---|---|---|---|
A DEAR Algorithm in SDN.pdf | Artículo principal | 346,8Kb | Restricted access |