Energy efficient online routing of flows with additive constraints

Computer Networks

Volumn 56, Issue 10, 2012, Pages 2368-2382

  Avallone, Stefano ^a   Ventre, Giorgio ^a  

^a UNIVERSITY OF NAPLES FEDERICO II   (Italy)

Author keywords

Energy efficient routing; Online routing; QoS routing

Indexed keywords

AVAILABLE BANDWIDTH; BASIC CONCEPTS; CURRENT STATUS; DEPTH-FIRST SEARCH APPROACHES; ENERGY EFFICIENT; ENERGY EFFICIENT ROUTING; INTERNET INFRASTRUCTURE; LOOK-AHEAD; NODES AND LINKS; ONLINE ROUTING; PATH LENGTH; QOS CONSTRAINTS; QOS ROUTING; ROUTING SCHEME; ROUTING TRAFFIC; SIMULATION STUDIES; SLEEP STATE;

ALGORITHMS; BANDWIDTH; INTERNET SERVICE PROVIDERS; NETWORK ROUTING;

ENERGY EFFICIENCY;

EID: 84862000423     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2012.03.011     Document Type: Article

References (37)

1. An inefficient truth, Global Action Plan, London, UK, December 2007. < http://www.globalactionplan.org.uk >.
2. M. Pickavet, W. Vereecken, S. Demeyer, P. Audenaert, B. Vermeulen, C. Develder, D. Colle, B. Dhoedt, and P. Demesteer Worldwide energy needs for ICT: the rise of power-aware networking Proc. of ANTS 2008 IEEE 1 3
3. SMART 2020 report, Enabling the low Carbon Economy in the information age, The Climate Group, 2008. < http://www.theclimategroup.org >.
4. M. Zhang, C. Yi, B. Liu, B. Zhang, GreenTE: power-aware traffic engineering, in: Proc. of ICNP, 2010, pp. 21-30.
5. J. Guichard, F. Faucheur, and J. Vasseur Definitive MPLS Network Designs 2005 Cisco Press
6. T. Korkmaz, M. Krunz, Multi-constrained optimal path selection, in: Proc. of IEEE INFOCOM, vol. 2, 2001, pp. 834-843.
7. P. Van Mieghem, and F. Kuipers Concepts of exact QoS routing algorithms IEEE/ACM Transactions on Networking 12 5 2004 851 864
8. G. Xue, A. Sen, W. Zhang, J. Tang, and K. Thulasiramam Finding a path subject to many additive QoS constraints IEEE/ACM Transactions on Networking 15 1 2007 201 211
9. T. Korkmaz, and M. Krunz A randomized algorithm for finding a path subject to multiple QoS requirements Computer Networks 36 2001 251 268
10. F. Kuipers, P. Van Mieghem, T. Korkmaz, and M. Krunz An overview of constraint-based path selection algorithms for QoS routing IEEE Communications Magazine 40 12 2002 50 55
11. X. Yuan Heuristics algorithms for multiconstrained quality-of-service routing IEEE/ACM Transactions on Networking 10 2 2002 244 256
12. G. Xue, W. Zhang, J. Tang, and K. Thulasiramam Polynomial time approximation algorithms for multi-constrained QoS routing IEEE/ACM Transactions on Networking 16 3 2008 656 669
13. G. Banerjee, and D. Sidhu Comparative analysis of path computation techniques for MPLS traffic engineering Computer Networks 40 2002 149 165
14. S. Suri, M. Waldvogel, D. Bauer, and P. Warkhede Profile-based routing and traffic engineering Computer Communications 26 2003 351 365
15. K. Kar, M. Kodialam, and T. Lakshman Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications IEEE Journal on Selected Areas in Communications 18 12 2000 2566 2579
16. B. Wang, X. Su, C. Chen, A new bandwidth guaranteed routing algorithm for MPLS traffic engineering, in: Proc. of IEEE International Conference on Communications, ICC 2002, vol. 2, 2002, pp. 1001-1005.
17. G.B. Figueiredo, N.L.S. da Fonseca, J.A.S. Monteiro, A minimum interference routing algorithm, in: Proc. of IEEE International Conference on Communications, ICC 2004, vol. 4, 2004, pp. 1942-1947.
18. S. Avallone On the setting of QoS link weights to provide per-flow QoS guarantees Proc. of ISCC 2007 IEEE Aveiro, Portugal 443 448 10.1109/ISCC.2007. 4381503
19. M. Gupta, and S. Singh Greening of the Internet Proc. of SIGCOMM 2003 ACM 19 26
20. J. Chabarek, J. Sommers, P. Barford, C. Estan, D. Tsiang, and S. Wright Power awareness in network design and routing Proc. of INFOCOM 2008 IEEE 457 465
21. L. Chiaraviglio, M. Mellia, and F. Neri Reducing power consumption in backbone networks Proc. of ICC 2009 IEEE
22. L. Chiaraviglio, M. Mellia, and F. Neri Energy-aware backbone networks: a case-study Proc. of GreenComm 2009 IEEE
23. E. Amaldi, A. Capone, L. Gianoli, and L. Mascetti A MILP-based heuristic for energy-aware traffic engineering with shortest path routing J. Pahl, T. Reiners, S. Vo, Network Optimization Lecture Notes in Computer Science vol. 6701 2011 Springer Berlin/Heidelberg 464 477
24. A. Bianzino, C. Chaudet, F. Larroca, D. Rossi, and J. Rougier Energy-aware routing: a reality check Proc. of the 3rd International Workshop on Green Communications 2010 IEEE
25. A. Bianzino, C. Chaudet, S. Moretti, D. Rossi, J. Rougier, The green-game: striking a balance between QoS and energy saving, in: Proc. of ITC, 2011.
26. A. Cianfrani, V. Eramo, M. Listanti, M. Marazza, and E. Vittorini An energy saving routing algorithm for a green OSPF protocol Proc. of INFOCOM 2010 IEEE 1 5
27. A. Bianzino, L. Chiaraviglio, and M. Mellia GRiDA: a green distributed algorithm for backbone networks Proc. of Online Green Communications Conference 2011 IEEE
28. S. Lee, P. Tseng, and A. Chen Link weight assignment and loop-free routing table update for link state routing protocols in energy-aware internet Future Generation Computer Systems 28 2 2012 437 445
29. E. Gelenbe, T. Mahmoodi, Energy-aware routing in the cognitive packet network, in: ENERGY 2011, The First International Conference on Smart Grids, Green Communications and IT Energy-Aware Technologies, 2011, pp. 7-12.
30. E. Gelenbe, R. Lent, and A. Nunez Self-aware networks and QoS Proceedings of the IEEE 92 9 2004 1478 1489
31. S. Avallone, F. Kuipers, G. Ventre, P. Van Mieghem, Dynamic routing in QoS-aware traffic engineered networks, in: Proceedings of EUNICE 2005, Madrid, 2005, pp. 222-228.
32. A. Goldberg, R. Tarjan, Solving minimum cost flow problem by successive approximation, in: Proc. 19th ACM Symp. Theory Computing, 1987, pp. 7-18.
33. I. Iliadis, D. Bauer, A New Class of Online Minimum-Interference Routing Algorithms, Networking 2002, LNCS, vol. 2345, 2002, pp. 959-971.
34. G. Rétvári, J.J. BírÓ, T. Cinkler, T. Henk, A Precomputation scheme for minimum interference routing: the least-critical-path-first algorithm, in: Proc. of IEEE INFOCOM, vol. 1, 2005, pp. 260-268.
35. G. Liu, K.G. Ramakrishnan, A*Prune: an algorithm for finding k shortest paths subject to multiple constraints, in: Proc. of IEEE INFOCOM, 2001, pp. 743-749.
36. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein Introduction to Algorithms second ed. 2001 McGraw-Hill
37. A. Medina, I. Matta, and J. Byers On the origin of power laws in Internet topology ACM Computer Communications Review 30 2 2000 18 28