Latest revision as of 14:36, 21 January 2021

Abstract

Admission control in wired networks has been traditionally used as a way to control traffic congestion and guarantee quality of service. Here, we propose an admission control mechanism which aims to keep the power consumption at the lowest possible level by restricting the more energy-demanding users. This work relies on the fact that power consumption of networking devices, and of the network as a whole, is not proportional to the carried traffic, as would be the ideal case [1]. As a result some operating regions may be more efficient than others and “jumps” may arise in power consumption when new traffic is added in the network. The proposed mechanism aims to keep power consumption in the lowest possible power consumption level, hopping to the next level only when necessary.

Original document

The different versions of the original document can be found in:

• http://roar.uel.ac.uk/1760/1/sakellari-iscis2012.pdf

• http://www.springerlink.com/index/pdf/10.1007/978-1-4471-4594-3_7,

http://dx.doi.org/10.1007/978-1-4471-4594-3_7

• https://link.springer.com/chapter/10.1007/978-1-4471-4594-3_7,

https://core.ac.uk/display/76947182,

https://www.scipedia.com/public/Sakellari_et_al_2012a,

https://repository.uel.ac.uk/item/85y76,

http://eprints.mdx.ac.uk/15860,

https://kclpure.kcl.ac.uk/portal/en/publications/using-energy-criteria-to-admit-flows-in-a-wired-network(a60f311e-195e-446c-aaf7-2f148ab07977)/export.html,

https://dblp.uni-trier.de/db/conf/iscis/iscis2012.html#SakellariMMG12,

https://rd.springer.com/chapter/10.1007%2F978-1-4471-4594-3_7,

http://www.ctr.kcl.ac.uk/toktam/files/eaac.pdf,

https://academic.microsoft.com/#/detail/1531829123