Full Text:
<2636>
CLC number: TP393
On-line Access: 2024-08-27
Received: 2023-10-17
Revision Accepted: 2024-05-08
Crosschecked: 0000-00-00
Cited: 2
Clicked: 4985
Super-proximity routing in structured peer-to-peer overlay networks
| |||||||||||||
WU Zeng-de, RAO Wei-xiong, MA Fan-yuan. Super-proximity routing in structured peer-to-peer overlay networks[J]. Journal of Zhejiang University Science A, 2004, 5(1): 16-21.
@article{title="Super-proximity routing in structured peer-to-peer overlay networks",
author="WU Zeng-de, RAO Wei-xiong, MA Fan-yuan",
journal="Journal of Zhejiang University Science A",
volume="5",
number="1",
pages="16-21",
year="2004",
publisher="Zhejiang University Press & Springer",
doi="10.1631/jzus.2004.0016"
}
%0 Journal Article
%T Super-proximity routing in structured peer-to-peer overlay networks
%A WU Zeng-de
%A RAO Wei-xiong
%A MA Fan-yuan
%J Journal of Zhejiang University SCIENCE A
%V 5
%N 1
%P 16-21
%@ 1869-1951
%D 2004
%I Zhejiang University Press & Springer
%DOI 10.1631/jzus.2004.0016
TY - JOUR
T1 - Super-proximity routing in structured peer-to-peer overlay networks
A1 - WU Zeng-de
A1 - RAO Wei-xiong
A1 - MA Fan-yuan
J0 - Journal of Zhejiang University Science A
VL - 5
IS - 1
SP - 16
EP - 21
%@ 1869-1951
Y1 - 2004
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/jzus.2004.0016
Abstract: Peer-to-Peer systems are emerging as one of the most popular internet applications. Structured Peer-to-Peer overlay networks use identifier based routing algorithms to allow robustness, load balancing, and distributed lookup needed in this environment. However, identifier based routing that is independent of internet topology tends to be of low efficiency. Aimed at improving the routing efficiency, the super-proximity routing algorithms presented in this paper combine internet topology and overlay routing table in choosing the next hop. Experimental results showed that the algorithms greatly improve the efficiency of Peer-to-Peer routing.
[1] Castro, M., Druschel, P., Charlie, Y. and Rowstron, A., 2002. Exploiting Network Proximity in Distributed Hash Tables. Proc. of the International Workshop on Future Directions in Distributed Computing. Bertinoro, Italy, p.60-63.
[2] Cheng, S., 2002. Optional and responsive fine-grain locking in Internet-based collaborative systems. IEEE Transactions on Parallel and Distributed Systems, 13(9):994-1008.
[3] Krishnamurthy, B., Wang, J. and Xie, Y.L., 2001. Early Measurements of A Cluster-based Architecture for P2P Systems. Proc. of the 1st ACM SIGCOMM Internet Measurement Workshop. San Francisco, USA, p.105-109.
[4] Rao, W.X., Wu, Z.D. and Ma, F.Y., 2002. MtreeCast: A New Application Level Mutlicast. Proc. of International Workshop on Grid and Cooperative Computing. Sanya, China, p.45-56.
[5] Ratnasamy, S., Shenker, S. and Stoica, I., 2002. Routing Algorithms for DHTs: Some Open Questions. Proc. of International Workshop on Peer-to-Peer Systems. Cambridge, MA, USA, p.45-52.
[6] Stoica, I., Morris, R., Karger, D. and Kaashoek, M., 2001. Chord: a scalable peer-to-peer lookup service for Internet applications. Computer Communication Review, 31(4):149-160.
[7] Wu, Z.D., Rao, W.X. and Ma, F.Y., 2002. Efficient Topology-Aware Routing in Peer-to-Peer Network. Proc. of International Workshop on Grid and Cooperative computing. Sanya, China, p.172-185.
[8] Wu, Z.D., Rao, W.X. and Ma, F.Y, 2003. DEBIZ: A Decentralized Lookup Service for E-commerce, Accepted by Proc. of APWeb'2003, Lecture Notes on Computer, Springer-Verlag, Xi'an, China.
[9] Yang, B. and Hector G.M., 2003. Designing A Super-Peer Network. Proc. of 19th International Conference on Data Engineering. IEEE, Bangalore, India.
[10] Zhao, B., Duan, Y., Huang, L., Joseph, A. and Kubiatowicz, J., 2002. Brocade: Landmark Routing on Overlay Networks. Electronic Proc. of the International Workshop on Peer-to-Peer Systems. Cambridge, MA, USA, p.34-44.
[11] Zegura, E., Calvert, K. and Bhattacharjee, S, 1996. How to Model An Internetwork. Proc. of IEEE Infocom '96. San Francisco, CA, p.594-602.
Open peer comments: Debate/Discuss/Question/Opinion
<1>