Towards load adaptive routing based on link critical degree for delay-sensitive traffic in IP networks
Academic paper|更新时间:2024-06-05
|
Towards load adaptive routing based on link critical degree for delay-sensitive traffic in IP networks
Journal of CommunicationsVol. 36, Issue 3, Pages: 254-264(2015)
作者机构:
1. 清华大学 网络科学与网络空间研究院,北京 100084
2. 清华信息科学与技术国家实验室(筹),北京 100084
3. 西安通信学院 信息管理中心,陕西 西安 710106
作者简介:
基金信息:
The National Basic Research Program of China(973 Program)(2012CB315806);The National Natural Science Foundation of China(61170211);The National Natural Science Foundation of China(61202356);The National Natural Science Foundation of China(61161140454);The Specialized Research Fund for the Doctoral Program of Higher Education(20110002110056);Specialized Research Fund for the Doctoral Program of Higher Educa-tion(20130002110058)
Yang YANG, Jia-hai YANG, Hui WANG, et al. Towards load adaptive routing based on link critical degree for delay-sensitive traffic in IP networks[J]. Journal of Communications, 2015, 36(3): 254-264.
DOI:
Yang YANG, Jia-hai YANG, Hui WANG, et al. Towards load adaptive routing based on link critical degree for delay-sensitive traffic in IP networks[J]. Journal of Communications, 2015, 36(3): 254-264. DOI: 10.11959/j.issn.1000-436x.2015082.
Towards load adaptive routing based on link critical degree for delay-sensitive traffic in IP networks
Delay-sensitive traffic requires lower end-to-end delay in IP networks
such as online video
VoIP
video con-ference. Based on the criticality degree of link. A load adaptive routing algorithm (LARA) was presented which could avoid the link to be congested to reduce the end-to-end delay. Firstly
an optimization objective function has been put forward; and then decomposed into several sub-functions by using convex optimization theory; finally
the optimization objective function and sub-functions were transformed into a simple distributed protocol. LARA with ECMP (equal-cost multipath) routing strategy was compared which was widely deployed in the network by using NS2 simulation under CERNET2 topology. By evaluating the feedback delay
packet loss rate and traffic load
the results show that LARA can exhibit good performance and achieve excellent load balance
and meanwhile improve the robustness of the link when using multipath routing technology.
关键词
Keywords
references
Chinese netizens network video application research report in 2013 [EB/OL ] . http://www.cnnic.net.cn/hlwfzyj/hlwxzbg/spbg/201406/t20140609_47180.htm http://www.cnnic.net.cn/hlwfzyj/hlwxzbg/spbg/201406/t20140609_47180.htm .
VOGEL A , KERHERVE B , et al . Distributed multimedia and QoS:a survey [J ] . IEEE Multi-Media , 1995 , 2 ( 2 ): 10 - 19 .
XIAO X , NI L M . Internet QoS: a big picture [J ] . IEEE Network , 1999 , 13 ( 2 ): 8 - 18 .
HE J , REXFORD J . Towards Internet-wide multipath routing [J ] . IEEE Network Magazine, Special Issue on Internet Scalability , 2008 , 22 ( 2 ): 16 - 21 .
KELLY F , VOICE T . Stability of end-to-end algorithms for joint rout-ing and rate control [J ] . ACM SIGCOMM Computer Communication Review , 2005 , 35 ( 2 ): 5 - 12 .
DAMON W , COSTIN R , ADAM G , et al . Design,implementation and evaluation of congestion control for multipath TCP [A ] . Proc of the 8th USENIX Conference [C ] . 2011 . 99 - 112 .
SUCHARA M , XU D H , DOVERSPIKE R , et al . Network architec-ture for joint failure recovery and traffic engineering [J ] . ACM SIG-METRICS Performance Evaluation Review , 2011 , 39 ( 1 ): 97 - 108 .
NGUYEN G T K , AGARWAL R , LIU J D , et al . Slick packets [J ] . Performance Evaluation Review , 2011 , 39 ( 1 ): 205 - 216 .
SUCHARA M , FABRIKANT A , REXFORD J . BGP safety with spu-rious updates [A ] . IEEE INFOCOM [C ] . 2011 . 2966 - 2974 .
HOPPS C . Analysis of an Equal-Cost Multi-Path Algorithm [S ] . RFC 2992 , 2002 .
ZLATOKRILOV H , LEVY H . Packet dispersion and the quality of voice over IP applications in IP networks [A ] . IEEE INFOCOM [C ] . 2004 . 1170 - 1180 .
GALLAGER R . A minimum delay routing algorithm using distributed computation [J ] . IEEE Transactions on Communications , 1977 , 25 ( 1 ): 73 - 85 .
BERTSEKAS D , GAFNI E , GALLAGER R . Second derivative algo-rithms for minimum delay distributed routing in networks [J ] . IEEE Transaction Communications , 1984 , 32 ( 8 ): 911 - 919 .
JAVED U , SUCHARA M , HE J Y , et al . Multipath protocol for de-lay-sensitive traffic [A ] . Proc of the First International Conference of Communication Systems and Networks [C ] . 2009 .
APOSTOLOPOULOS G , WILLIAMS D . QoS Routing Mechanism and OSPF Extensions [S ] . RFC 2676 , 1999 .
KODIALAM M , LAKSHMAN T V . Minimum interference routing with applications to MPLS traffic engineering [A ] . IEEE INFOCOM [C ] . 2000 . 884 - 893 .
PALOMAR D , CHIANG M . A tutorial on decomposition methods for network utility maximization [J ] . IEEE Journal on Selected Areas in Communications , 2006 , 24 ( 8 ): 1439 - 1451 .
UHLIG S , QUOITIN B , LEPROPRE J , et al . providing public intra-domain traffic matrices to the research community [J ] . ACM SIGCOMM Computer Communication Review , 2006 , 36 ( 1 ): 83 - 86 .
HE J , SUCHARA M , BRESLER M . Rethinking Internet traffic man-agement: from multiple decompositions to a practical protocol [A ] . Proc of the ACM CoNEXT [C ] . 2007 . 17 .
WEI X D , CHENG J , LOW H S , et al . FAST TCP:motivation,archi-tecture, algorithms, performance [J ] . Networking, IEEE/ACM Transactions on , 2006 , 14 ( 6 ): 1246 - 1259 .
KURIAN J , SARAC K . A survey on the design, applications, and enhancements of application-layer overlay networks [J ] . ACM Com-puting Surveys , 2010 , 43 ( 1 ): 5 .