About | Contact Us | Register | Login
ProceedingsSeriesJournalsSearchEAI
Energy-Efficient Computing and Networking. First International Conference, E-Energy 2010, Athens, Greece, October 14-15, 2010, Revised Selected Papers

Research Article

Routing and G-Networks to Optimise Energy and Quality of Service in Packet Networks

Download(Requires a free EAI acccount)
509 downloads
Cite
BibTeX Plain Text
  • @INPROCEEDINGS{10.1007/978-3-642-19322-4_18,
        author={Erol Gelenbe and Christina Morfopoulou},
        title={Routing and G-Networks to Optimise Energy and Quality of Service in Packet Networks},
        proceedings={Energy-Efficient Computing and Networking. First International Conference, E-Energy 2010, Athens, Greece, October 14-15, 2010, Revised Selected Papers},
        proceedings_a={E-ENERGY},
        year={2012},
        month={10},
        keywords={Energy Optimisation Wired Networks Packet Routing User QoS Polynomial Time Complexity Optimisation Algorithm},
        doi={10.1007/978-3-642-19322-4_18}
    }
    
  • Erol Gelenbe
    Christina Morfopoulou
    Year: 2012
    Routing and G-Networks to Optimise Energy and Quality of Service in Packet Networks
    E-ENERGY
    Springer
    DOI: 10.1007/978-3-642-19322-4_18
Erol Gelenbe1,*, Christina Morfopoulou1,*
  • 1: Imperial College
*Contact email: e.gelenbe@imperial.ac.uk, c.morfopoulou@imperial.ac.uk

Abstract

We formulate the problem of joint energy and quality of service (QoS) optimisation in packet networks and show how it can be formalised using the control capabilities inherent in G-network theory, which also includes the overhead due to control traffic. Using known energy consumption characteristics of network routers and of network link driver equipment, this approach leads to a polynomial time complexity gradient optimisation algorithm which seeks a judicious balance between the QoS experienced by the users and the overall energy consumption of the network.

Keywords
Energy Optimisation Wired Networks Packet Routing User QoS Polynomial Time Complexity Optimisation Algorithm
Published
2012-10-17
http://dx.doi.org/10.1007/978-3-642-19322-4_18
Copyright © 2010–2025 ICST
EBSCOProQuestDBLPDOAJPortico
EAI Logo

About EAI

  • Who We Are
  • Leadership
  • Research Areas
  • Partners
  • Media Center

Community

  • Membership
  • Conference
  • Recognition
  • Sponsor Us

Publish with EAI

  • Publishing
  • Journals
  • Proceedings
  • Books
  • EUDL