1. 华南理工大学计算机学院,广州,510640
2. 广东省计算机网络重点实验室,广州,510640
网络首发:2010-02-10,
纸质出版:2010
移动端阅览
马震远 1, 周杰 1, 2, 等. 一种分段测量保证QoS约束的任播通信模型[J]. 西安交通大学学报, 2010,44(2):44-49.
An Anycast Communication Model with QoS Constraints Based on Segmental Measurement[J]. 2010, 44(2): 44-49.
针对现有的任播通信(anycast)模型无法在具有可扩展性的同时提供QoS支持
提出了一种分段测量的任播通信模型(SMA).通过任播通信组成员之间的竞争将最优成员的单播地址存储到相应路由器
由此解决了路由表膨胀问题.同时
提出了一种由分段延迟变化估计总体延迟变化上界的方法
通过组成员和路由器之间的小范围网络参数的测量、分享和估计
支持带QoS约束的任播通信请求.PlanetLab上的实验表明
所提方法的准确性较高.模拟真实Internet结构的网络拓扑仿真证明
SMA不但具有较高的最优组成员发现效率
而且还具有良好的可扩展性和可实现性.
Since the existing anycast communication models can not achieve scalability and provide QoS guarantee simultaneously
an anycast communication model-SMA is proposed based on segmental measurement. The routing table is restricted by the competition among anycast group members
and only one winner can write its unicast address to the related routers. A method to estimate the variation upper bound of end-to-end delay is proposed. The anycast requests with QoS constraint are supported by measuring
sharing and estimating network parameters between routers and anycast members in a small region. Experiments on PlanetLab show that the proposed estimation method is accurate. Simulations in a nearly real Internet topology show that the SMA is efficient in the selection of best members and has good scalability and reliability as well.
LIU Z, HUFFAKER B, FOMENKOV M, et al. Lecture notes in computer science: two days in the life of the DNS anycast root servers [M]. Berlin: Springer, 2007: 125-134.
KATABI D, WROCLAWSKI J. A framework for scalable global IP-anycast(GIA)[J]. SIGCOMM Computer Communication Review, 2001, 31(2): 186-219.
HITESH B, PAUL F. Towards a global IP anycast service [C]∥Proceedings of the SIGCOMM. New York, USA: ACM, 2005: 301-312.
FREEDMAN M J, LAKSHMINARAYANAN K, MAZIRES D. OASIS: anycast for any service [C]∥Proceedings of the 3rd USENIX/ACM Symposium on Networked Systems Design and Implementation. New York, USA: ACM, 2006: 129-142.
WANG G, CHEN Y, SHI L, et al. Proxima: towards lightweight and flexible anycast service [C]∥Proceedings of the INFOCOM Workshops. Piscataway, NJ, USA: IEEE, 2009: 1-2.
马震远, 周杰, 张凌. 基于隧道的全球可扩展 IP-Anycast 实现方法 [J]. 华南理工大学学报(自然科学版), 2008, 36(4): 75-80.
MA Zhenyuan, ZHOU Jie, ZHANG Ling. Tunnel-based approach to scalable global IP-anycast [J]. Journal of South China University of Technology(Natural Science), 2008, 36(4): 75-79.
李陶深, 陈松乔, 陈建二, 等. 一种基于QoS的选播路由算法研究 [J]. 计算机研究与发展, 2008, 45(S1): 415-420.
LI Taoshen, CHEN Songqiao, CHEN Jian'er, et al. Research on adaptive anycast routing algorithm with multiple QoS parameters[J]. Journal of Computer Research and Development, 2008, 45(S1): 415-420.
ZHU Chun, JIN Min. An anycast routing algorithm based on genetic algorithm [J]. WSEAS Trans on Computers, 2009, 8(1): 113-122.
HITESH B, PAUL F, SYLVIA R. A measurement-based deployment proposal for IP anycast [C]∥Proceedings of the 6th ACM SIGCOMM Conference on Internet Measurement. New York, USA: ACM, 2006:231-244.
ITU-T Recommendation.Y.1541 Network performance objectives for IP-based services [S]. Geneva, Switzerland: ITU-T, 2006.
RAMSEY C B. A note on the normal power approximation [J]. ASTIN Bulletin, 1991, 2(1): 147-150.
WONG B, SLIVKINS A, SIRER E G. Meridian: a lightweight network location service without virtual coordinates [C]∥Proceedings of the SIGCOMM. New York, USA: ACM, 2005: 85-96.
University of Oregon. Route views project [EB/OL]. [2008-12-10]. http:∥www.routeviews.org/.
Princeton University. An open platform for developing, deploying, and accessing planetary-scale services [EB/OL]. [2008-12-10]. http:∥www.Planet-Lab.org.
0
浏览量
4
下载量
2
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621