Skip to main content
SpringerLink
Log in

Psu: a novel low-latency constant-degree overlay network

  • Research Article
  • Published:
Frontiers of Computer Science in China Aims and scope Submit manuscript

Abstract

Many structured peer-to-peer (P2P) systems supported by distributed hash table (DHT) schemas have been proposed recently to improve the scalability of distributed virtual application systems. By organizing the peers based on interconnection topologies, existing proposed schemas are purely based on the logical relationship without knowledge of the physical networks. In this paper, we propose a new structured DHT schema, which receives routing information not just from virtual neighbors in P2P overlay network, but also from nearby physical neighbors. The average degree of our model is 5, the diameter is logarithmic. The simulation shows that our model achieves shorter query path length, higher clustering, and better robustness than other overlay networks which have the same level of degree and diameter.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Stoica I, Morris R, Karger D, Kaashoek M F, Balakrishnan H. Chord: a scalable peer-to-peer lookup service for internet applications. In: Proceedings of 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication. 2001, 149–160

  2. Kumar A, Merugu S, Xu J, Zegura E W, Yu X. Ulysses: a robust, low-diameter, low-latency peer-topeer network. European Transactions on Telecommunications, 2004, 15(6): 571–587

    Article  Google Scholar 

  3. Ratnasamy S, Francis P, Handley M, Karp R, Schenker S. A scalable content-addressable network. In: Proceedings of 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. 2001, 161–172

  4. Li D, Lu X, Wu J. FISSIONE: a scalable constant degree and low congestion DHT scheme based on Kautz graphs. In: Proceedings of 24th Annual Joint Conference of the IEEE Computer and Communications Societies. 2005

  5. Xiao W, Parhami B. Cayley graphs as models of deterministic small-world networks. Information Processing Letters, 2006, 97(3): 115–117

    MathSciNet  MATH  Google Scholar 

  6. Naor M, Malkhi D, Ratajczak D. Viceroy: a scalable and dynamic emulation of the butterfly. In: Proceedings of 21st Annual Symposium on Principles of Distributed Computing. 2002, 183–192

  7. Shen H, Xu C Z, Chen G. Cycloid: a constant-degree and lookup-efficient P2P overlay network. Performance Evaluation, 2006, 63(3): 195–216

    Article  Google Scholar 

  8. Kaashoek M F, Karger D R. Koorde: a simple degree-optimal distributed hash table. In: Proceedings of 2nd International Workshop on Peer-to-Peer Systems. 2003, 98–107

  9. Fraigniaud P, Gauron P. D2b: a de bruijn based content-addressable network. Theoretical Computer Science, 2006, 355(1): 65–79

    Article  MathSciNet  MATH  Google Scholar 

  10. Naor M, Wieder U. Novel architectures for P2P applications: the continuous-discrete approach. ACM Transactions on Algorithms, 2007, 3(3): 50–59

    Article  MathSciNet  Google Scholar 

  11. Xiao W, He M, Wei W. Cayleychord: a novel P2P overlay network. In: Proceedings of 2008 IEEE/IPIP International Conference on Embedded and Ubiquitous Computing. 2008, 501–506

  12. Xiao W, Wei W. Ebu: a novel P2P overlay network. In: Proceedings of 1st International Conference on Intelligent Networks and Intelligent Systems. 2008, 178–182

  13. Sun Z, Xiao W. Comnet: a P2P community network. In: Proceedings of 7th International Symposium on Advanced Parallel Processing Technologies. 2007, 271–281

  14. Biggs N. Algebraic Graph Theory. New York: Cambridge University Press, 1993

    Google Scholar 

  15. Wu C H, Hu S Y, Tseng L M. Discovery of physical neighbors for P2P 3D streaming. In: Proceedings of 2009 International Conference on Ultra Modern Telecommunications. 2009

  16. Hsieh M Y, Yang H C, Tseng L M. Finding nearest neighbors in replication-aware CDN-P2P architecture. Journal of Internet Technology, 2005, 6(2): 133–142

    Google Scholar 

  17. Miura H, Yamamoto M. Content routing with network support using passive measurement in content distribution networks. IEICE Transactions on Communications, 2003, E86-B(6): 1805–1811

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Software Engineering, South China University of Technology, Guangzhou, 510641, China

    Lan Li & Wenjun Xiao

  2. School of Software, Nanchang University, Nanchang, 330031, China

    Lan Li

Authors
  1. Lan Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wenjun Xiao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lan Li.

Additional information

Lan Li, received the MS degree in computer science from Nanchang University, Nanchang, China, in 2005. She is a lecturer in Software College, Nanchang University, Nanchang, China. She is currently a PhD candidate in computer science at South China University of Technology, Guangzhou. Her research interests include peer-topeer computing, graph theory, optimization theory, and parallel computing.

Wenjun Xiao received the PhD degree in mathematics from Sichuan University, Chengdu, China, in 1989. He is currently a professor in the School of Software Engineering, South China University of Technology, Guangzhou, China. His research interests include discrete mathematics, parallel and distributed computing, complex networks, and software architecture. He has published more than 60 papers in international conferences and journals, including the IEEE Transactions on Computers and the IEEE Transactions on Parallel and Distributed Systems on these topics since 1985.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, L., Xiao, W. Psu: a novel low-latency constant-degree overlay network. Front. Comput. Sci. China 5, 250–258 (2011). https://doi.org/10.1007/s11704-011-0333-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11704-011-0333-y

Keywords

Search

Navigation