Skip to Main Content
Green Communications and Networking
book

Green Communications and Networking

by F. Richard Yu, Xi Zhang, Victor C.M. Leung
April 2016
Intermediate to advanced content levelIntermediate to advanced
399 pages
11h 49m
English
CRC Press
Content preview from Green Communications and Networking
164 Graph-Theoretic Algorithms for Energy Saving in IP Networks
6.2 ESACON Algorithm
A first GES algorithm described in this chapter is ESACON (Energy Saving
based on Algebraic CONnectivity) [3]. It models the Internet topology (i.e.,
the topology of an autonomous system in IP) with an undirected graph G =
(N, E), where N is the set of routers and E is the set of bidirectional links
connecting these routers.
ESACON is composed of two main steps:
1. the creation of an ordered list of links, denoted as L;
2. the identification of a set of links to be switched off, denoted as SL.
The pseudo-code in Algorithm 3 describes these two steps. As for step
1, the
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Green Networking and Communications

Green Networking and Communications

Shafiullah Khan, Jaime Lloret Mauri
Green Communications

Green Communications

Jinsong Wu, Sundeep Rangan, Honggang Zhang

Publisher Resources

ISBN: 9781439899144