[1] Chen Dongfeng, Yang Shoubao, Peng Xiaoyan,. TaChord: a Chord system using topology-aware routingand super peers [J]. Journal of Southeast University (English Edition), 2004, 20 (3): 273-278. [doi:10.3969/j.issn.1003-7985.2004.03.003]
Copy
TaChord: a Chord system using topology-aware routingand super peers(
)
TaChord: 利用拓扑相关路由算法 和超级节点的Chord系统
)Journal of Southeast University (English Edition)[ISSN:1003-7985/CN:32-1325/N]
- Volumn:
- 20
- Issue:
- 2004 3
- Page:
- 273-278
- Research Field:
- Other Disciplines
- Publishing date:
- 2004-09-30
Info
- Title:
- TaChord: a Chord system using topology-aware routingand super peers
- TaChord: 利用拓扑相关路由算法 和超级节点的Chord系统
- Author(s):
- Chen Dongfeng; Yang Shoubao; Peng Xiaoyan
- Department of Computer Science and Technology, University of Science and Technology of China, Hefei 230026, China
- Keywords:
- peer-to-peer network; topology-aware routing; super peer; Chord
- PACS:
- G237.5;H315.9
- DOI:
- 10.3969/j.issn.1003-7985.2004.03.003
- Abstract:
- Due to minimum consideration of an actual network topology, the existing peer-to-peer(P2P)overlay networks, such as CAN, Chord, Pastry and Tapestry, will lead to high latency and low efficiency. In TaChord, a topology-aware routing approach in P2P overlays and an improved design in Chord are presented. TaChord and other algorithms are evaluated by physical hops, interdomain-adjusted latency, and aggregate bandwidth used per message. Experimental results demonstrate that TaChord has the drastic improvement in routing performance where average physical hop is half that of chord, and the impact of cache management strategies in the TaChord overlay cannot be neglected.
- 由于未考虑实际网络拓扑结构, 当前结构化对等网络系统存在高延迟低效率的毛病. 本文提出一种与实际网络拓扑结构相关的路由方法, 并开发出一种基于Chord的TaChord系统. 在仿真系统中, 用物理跳数、域间延迟和每个消息占用的带宽来衡量TaChord和其他系统的路由性能. 仿真结果表明, TaChord系统的路由性能有了极大的提高, 如平均物理跳数是Chord的一半, 并且不同路由缓存管理策略对TaChord的路由性能能产生重要的影响.
References:
[1] The Gnutella protocol specification v0. 4[EB/OL].http: //www.clip2.com. 2003-06.
[2] Clarke Ian, Sandberg Oskar, Wiley Brandon, et al. Freenet: a distributed anonymous information storage and retrieval system[EB/OL]. http:// freenet.sourceforge.net. 2003-06.
[3] Zhao Ben Y, Kubiatowicz John. Tapestry: an infrastructure for fault-tolerant wide-area location and routing[R]. Computer Science Division University of California, UCB/CSD-01-1141, 2001.
[4] Rowston Antony, Druschel Peter. Pastry: scalable, decentralized object location and routing for large scale peer-to-peer systems [R]. Cambridge: Microsoft Research Ltd, 2001.
[5] Stoica Ion, Morris Robert, Karger David, et al. Chord: a scalable peer-to-peer lookup service for internet applications[A]. In: ACM Sigcomm[C]. 2001. 2-10.
[6] Ratnasamy S, Francis P, Handley M, et al. A scalable content-addressable network [A]. In: ACM Sigcomm [C]. 2001. 1-3.
[7] Zhao Ben Y, Duan Yitao, Huang Ling, et al. Brocade: landmark routing on overlay networks[A]. In: Electronic Proceedings for the 1st International Workshop on Peer-to-Peer Systems(IPTP’ 02)[C]. Cambridge, 2002. 2-5.
[8] Yang Beverly, Garcia-Molina Hector. Designing a super-peer network[A]. In: 19th International Conference on Data Engineering, IEEE Computer Society[C]. Bangalore, 2003. 3-6.
[9] Tsuchiya P F. The landmark hierarchy: a new hierarchy for routing in very large networks [J]. Computer Communication Review, 1988, 18(4): 35-42.
[10] Crespo Arturo, Molina Hector Garcia. Routing indices for peer-to-peer systems [A]. In: Proceedings of the 22nd International Conference on Distributed Computing Systems(ICDCS’02)[C]. Vienna, Austria, 2002. 23-34.
[11] Lee Craig A, Coe Eric, Michel B Scott, et al. Using topology-aware communication services in grid environments [A]. In: Proceedings of the 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid(CCGRID03)[C]. Tokyo, 2003. 1-6.
[12] BRITE, a network topology generator[EB/OL].http: //www.cs.bu.edu/brite/. 2003-06-02.
Memo
- Memo:
- Biographies: Chen Dongfeng(1979—), male, graduate; Yang Shoubao(corresponding author), male, professor, syang@ustc.edu.cn.