GOSPF: An energy efficient implementation of the OSPF routing protocol

被引:6
作者
D'Arienzo, M. [2 ]
Romano, S. P. [1 ]
机构
[1] Univ Napoli Federico II, Dept Elect Engn & Informat Technol, Naples, Italy
[2] Second Univ Napoli, Dipartimento Europei & Mediterranei, Naples, Italy
关键词
Routing protocols; Open shortest path first; Energy efficiency; NETWORK; CONSUMPTION; FLOWS;
D O I
10.1016/j.jnca.2016.07.011
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Energy saving is currently one of the most challenging issues for the Internet research community. Indeed, the exponential growth of applications and services induces a remarkable increase in power consumption and hence calls for novel solutions which are capable to preserve energy of the infrastructures, at the same time maintaining the required Quality of Service guarantees. In this paper we introduce a new mechanism for saving energy through intelligent switch off of network links. The mechanism has been implemented as an extension to the Open Shortest Path First routing protocol. We first show through simulations that our solution is capable to dramatically reduce energy consumption when compared to the standard OSPF implementation. We then illustrate a real-world implementation of the proposed protocol within the Quagga routing software suite. (C) 2016 Elsevier Ltd. All rights reserved.
引用
收藏
页码:110 / 127
页数:18
相关论文
共 23 条
  • [1] Baldi M., 2009, P 1 INT WORKSH GREEN
  • [2] Energy Efficiency in the Future Internet: A Survey of Existing Approaches and Trends in Energy-Aware Fixed Network Infrastructures
    Bolla, Raffaele
    Bruschi, Roberto
    Davoli, Franco
    Cucchietti, Flavio
    [J]. IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2011, 13 (02): : 223 - 244
  • [3] Bolla R, 2009, 2ND ACM SIGCOMM WORKSHOP ON PROGRAMMABLE ROUTERS FOR EXTENSIBLE SERVICES OF TOMORROW - PRESTO 09, P49
  • [4] Chabarek J., 2008, P 27 IEEE C COMP COM
  • [5] Chiaraviglio L, 2009, IEEE ICC, P2298
  • [6] Chiaraviglio L, 2009, 2009 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATION WORKSHOPS, VOLS 1 AND 2, P403
  • [7] Cianfrani A., 2011, P IEEE INFOCOM 2011
  • [8] Cuomo F., 2011, P IEEE INFOCOM 2011
  • [9] Maximum flow problem on dynamic generative network flows with time-varying bounds
    Fathabadi, Hassan Salehi
    Hosseini, Seyed Ahmad
    [J]. APPLIED MATHEMATICAL MODELLING, 2010, 34 (08) : 2136 - 2147
  • [10] Fleischer L., 2002, Integer Programming and Combinatorial Optimization. 9th International IPCO Conference Proceedings (Lecture Notes in Computer Science Vol.2337), P36