Low-power multicast routing algorithm in green Internet

Jin-hong ZHANG; Xing-wei WANG; Min HUANG

doi:10.3969/j.issn.1000-436x.2014.z1.026

您当前的位置：

首页 >

文章列表页 >

Low-power multicast routing algorithm in green Internet

IPv6 Next generation Internet technology | 更新时间：2024-06-05

- Low-power multicast routing algorithm in green Internet
- Journal on Communications Vol. 35, Issue Z1, Pages: 134-140(2014)
- 作者机构：
  
  东北大学信息科学与工程学院，辽宁沈阳 110819
- 作者简介：
- 基金信息：
  
  The National Science Foundation for Distinguished Young Scholars of China(71325002);The Specialized Research Fund of the Doctoral Program of Higher Education of China for the Priority Development Areas(20120042130003);The Special Found from the Central Col-legiate Basic Scientific Research Bursary(N120104001)
- DOI：10.3969/j.issn.1000-436x.2014.z1.026
  CLC： TP393
- Online First：2014-10，
  
  Published：25 October 2014
- 稿件说明：
移动端阅览
Jin-hong ZHANG, Xing-wei WANG, Min HUANG. Low-power multicast routing algorithm in green Internet[J]. Journal on Communications, 2014, 35(Z1): 134-140.
DOI：

Jin-hong ZHANG, Xing-wei WANG, Min HUANG. Low-power multicast routing algorithm in green Internet[J]. Journal on Communications, 2014, 35(Z1): 134-140. DOI： 10.3969/j.issn.1000-436x.2014.z1.026.

摘要

摘要：基于路径节点驱动策略，提出了一种绿色互联网中的一对多组播路由算法，充分利用路径节点共享路径，生成低功耗最短路径树，提高用户QoS满意度。基于CERNET2拓扑仿真实现了该算法，通过与现有的能量感知启发式路由算法在网络功耗、路由成功率和运行时间等方面的性能对比，表明本文提出的算法具有更好的性能。

Abstract

A path node-driven strategy based one-to-many multicast routing algorithm in green Internet (GIOMR) is proposed to generate a low-power shortest path tree

fully making use of the path node sharing paths and meanwhile improving user’s QoS satisfaction degree.The GIOMR is implemented over CERNET2 topology by simulation.It has been shown that GIOMR has better performance on the network power consumption

the success rate of routing and the running time than efficient heuristics for energy-aware routing (EHER) algorithm.

关键词

Keywords

references

http://www.china-nengyuan.com/news/17680.html http://www.china-nengyuan.com/news/17680.html [EB/OL ] . 2013 .

ZHANG B X , MOUFTAH H T . A destination-driven shortest path tree algorithm [A ] . Communications,ICC 2002 [C ] . 2002 . 2258 - 2262 .

王涛 , 李伟生 . 低代价最短路径树的快速算法 [J ] . 软件学报 , 2004 , 15 ( 5 ): 660 - 665 .

WANG T , LI W S . A fast low-cost shortest path tree algorithm [J ] . Journal of Software , 2004 , 15 ( 5 ): 660 - 665 .

FUJINOKI H , CHRISTENSEN K J . The new shortest best path tree (SBPT) algorithm for dynamic multicast trees [A ] . Local Computer Networks [C ] . 1999 . 204 - 211 .

周灵 , 王建新 . 路径节点驱动的低代价最短路径树算法 [J ] . 计算机研究与发展 , 2011 , 48 ( 5 ): 721 - 728 .

ZHOU L , WAGN J X . Path nodes-driven least-cost shortest path tree algorithm [J ] . Journal of Computer Research and Development , 2011 , 48 ( 5 ): 721 - 728 .

WANG W , HOU W G , GUO L , et al . Energy saving and cost reduction in multi-granularity green optical networks [J ] . Computer Networks , 2011 , 55 ( 3 ): 676 - 688 .

WANG X W , CHENG H , HUANG M . Multi-robot navigation based QoS routing in self-organizing networks [J ] . Engineering Applications of Artificial Intelligence , 2013 , 26 ( 1 ): 262 - 272 .

http://www.cernet.com/aboutus/internet2_tp.htm http://www.cernet.com/aboutus/internet2_tp.htm [EB/OL ] . 2014 .

LIN G , SOH S , CHIN K W , et al . Efficient heuristics for energy-aware routing in networks with bundled Links [J ] . Computer Networks , 2013 , 57 ( 8 ): 1774 - 1788 .

Views

596

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Energy efficient data transmission on the internet

Related Author

Guo-qiang ZHANG

Sen LIN

Zhen LIU

Tao LIN

Guo-qing ZHANG

You-ping LI

Related Institution

School of Computer Science and Technology,Nanjing Normal University

Institute of Computing Technology, Chinese Academy of Sciences

School of Computer and Information Technology, Beijing Jiaotong University

Institute of Acoustics,Chinese Academy of Sciences

China Academy of Engineering Physics

AI问答

⁰