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
174 Graph-Theoretic Algorithms for Energy Saving in IP Networks
0 1 2 3 4
0
20
40
60
80
100
Percentage of paths
th
= 99%
th
= 95%
th
= 90%
Figure 6.4: Distribution of the δ parameter in case of ESTOP.
works only on the algebraic connectivity.
As for EAR instead, the distribution of the path length increase is reported
in Fig. 6.5. In this case it is to be noticed that, since we adopted equal weights
on all links, the algorithm assures that a path cannot increase more than 2
hops. This property depends on the second rule introduced in EAR algorithm
and can be intuitively explained considering that this rule guarantees that
the paths of Exporter Routers
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