浏览全部资源
扫码关注微信
1. 西安交通大学电子与信息工程学院 西安 710049
2. 西安邮电大学通信与信息工程学院 西安 710061
[ "曲桦,男,博士,西安交通大学教授、博士生导师,主要研究方向为现代通信网和计算机网络体系结构。" ]
[ "赵季红,女,博士,西安交通大学教授、博士生导师,西安邮电大学教授,主要研究方向为宽带通信网、新一代网络的管理与控制。" ]
[ "王丽霞,女,西安交通大学硕士生,主要研究方向为虚拟网络映射、SDN控制器部署。" ]
[ "董士奇,男,西安交通大学硕士生,主要研究方向为虚拟网络映射。" ]
网络出版日期:2014-05,
纸质出版日期:2014-05-15
移动端阅览
曲桦, 赵季红, 王丽霞, 等. 基于路径优先度的VoIP中继选择算法[J]. 电信科学, 2014,30(5):75-80.
Hua Qu, Jihong Zhao, Lixia Wang, et al. A Path-Priority Based Relay Selection Algorithm for VoIP[J]. Telecommunications science, 2014, 30(5): 75-80.
曲桦, 赵季红, 王丽霞, 等. 基于路径优先度的VoIP中继选择算法[J]. 电信科学, 2014,30(5):75-80. DOI: 10.3969/j.issn.1000-0801.2014.05.011.
Hua Qu, Jihong Zhao, Lixia Wang, et al. A Path-Priority Based Relay Selection Algorithm for VoIP[J]. Telecommunications science, 2014, 30(5): 75-80. DOI: 10.3969/j.issn.1000-0801.2014.05.011.
在覆盖网络中为VoIP业务计算端到端路径时,需要保证该路径的时延小于150 ms;由于覆盖网络中反三角现象普遍存在,因此,为了保证VoIP业务时延要求,应用中继技术计算从源节点通过中继节点到目的节点的路径,取代端到端路径,成为覆盖网络提供VoIP业务的关键技术。基于已有中继技术存在的部署难、未考虑路径差异及结果不是最优等问题,提出基于路径优先度的VoIP中继选择算法,该算法首先提出路径优先度的概念,描述时延和默认IP路径的差异性,再基于路径优先度构建中继路由表,在中继路由表中挑选最优中继节点;提出基于路径优先度的两跳中继选择算法进一步减少转发时延。仿真证明所提算法能够减少VoIP业务的传输时延,提升VoIP业务的用户体验。
When routing the end-to-end path in the overlay network for VoIP service
it is necessary to ensure the path delay less than 150 ms. Due to the triangle inequality variations existed generally in the overlay network
the current research focus on building a multi-path routing using relay node selection algorithms instead of the end-to-end path to guarantee the VoIP service delay requirements. But the existed relay algorithms have limitations
such as deployment difficult
ignoring the difference between the paths. A new algorithm-a path-priority based relay selection algorithm for VoIP was proposed. First
the concept of the path priority degrees was introduced to describe the reference delay and the difference with the default IP path. Then a relay table was built and the best node was selected from the table to route the path. The algorithm reduced the delay further through two-hop relay selection algorithm at last. Simulation results show that the proposed method can reduce the transmission delay of VoIP services and enhance the user experience of VoIP.
Ren S , Guo L , Zhang X . ASAP: an AS-aware peer-relay protocol for high quality VoIP . Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (ICDCS 2006) , Lisboa, Portugal , 2006
Amir Y , Danilov C , Goose S , et al . 1-800-overlays: using overlay networks to improve VoIP quality . Proceedings of the International Workshop on Network and Operating Systems Support for Digital Audio and Video , Stevenson, Washington, USA , 2005 : 51 ~ 56
Zheng H , Lua E K , Pias M , et al . Internet routing policies and round-trip-times . Passive and Active Network Measurement , Springer Berlin Heidelberg , 2005 : 236 ~ 250
Lumezanu C , Baden R , Spring N , et al . Triangle inequality variations in the internet . Proceedings of the 9th ACM SIGCOMM Conference on Internet Measurement , Chicago, Illinois, USA , 2009 : 177 ~ 183
Lumezanu C , Baden R , Spring N , et al . Triangle inequality and routing policy violation in the internet . Proceedings of the 10th International Conference on Passive and Active Network Measurement , Seoul, Korea , 2009 : 45 ~ 56
Liu Y , Gu Y , Zhang H , et al . Application level relay for high-bandwidth data transport . Proceedings of GridNets , San Jose, CA, USA , 2004
Wang G , Zhang C , Qiu X , et al . An efficient relay node selection scheme to improve the performance of P2P-based VoIP applications in Chinese internet . Multimedia Tools and Applications , 2013 , 64 ( 3 ): 1 ~ 27
Andersen D , Balakrishnan H , Kaashoek F , et al . Resilient overlay networks . ACM SIGCOMM Computer Communication Review , 2002 , 32 ( 1 )
Fei T , Tao S , Gao L , et al . Light-weight overlay path selection in a peer-to-peer environment . Proceedings of the 25th IEEE International Conference on Computer Communications , Barcelona, Catalunya, Spain , 2006 : 1 ~ 6
Chen Y , Tang L , Li J . Heuristic relay node selection algorithm for one-hop overlay routing . Proceedings of the 28th International Conference on Distributed Computing Systems Workshops , Beijing, China , 2008 : 465 ~ 470
Wang H , Zhang C , Qiu X , et al . MBRS: a meridian-based relay selection algorithm for P2P VoIP . Proceedings of the 3rd IEEE International Conference on Broadband Network and Multimedia Technology(IC-BNMT) , Beijing, China , 2010 : 965 ~ 969
Zhang X , Lei W , Zhang W . Using P2P network to transmit media stream in SIP-based system . Proceedings of the 9th International Conference for Young Computer Scientists , Zhangjiajie, China , 2008 : 362 ~ 367
Baset S A , Schulzrinne H . An analysis of the skype peer-to-peer internet telephony protocol . Proceedings of the 25th IEEE International Conference on Computer Communications , Barcelona, Spain , 2006 : 1 ~ 11
Han J , Watson D , Jahanian F . An experimental study of internet path diversity . IEEE Transactions on Dependable and Secure Computing , 2006 , 3 ( 4 ): 273 ~ 288
Chen Y , Tang L , Li J . Heuristic relay node selection algorithm for one-hop overlay routing . Proceedings of the 28th International Conference on Distributed Computing Systems Workshops , Beijing, China , 2008 : 465 ~ 470
Bui Q D , Jennings A . Relay path selection approaches in peer-to-peer VoIP systems . Proceedings of Australasian Telecommunication Networks and Applications Conference , Adelaide, Australia , 2008 : 361 ~ 366
Network coordinate research at Harvard . http//www.eecs.harvard.edu/~syrah/nc/ http//www.eecs.harvard.edu/~syrah/nc/ , 2014
0
浏览量
320
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构