An Overlay Network Based on Arrangement Graph with Fault Tolerance

  • Ssu-Hsuan LuEmail author
  • Kuan-Ching Li
  • Kuan-Chou Lai
  • Yeh-Ching Chung
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 274)


As people change the habit of using the Internet, network technology has become matured. Unlike client-server, peer-to-peer (P2P) technology increases the convenience of people’s daily life. The routing efficiency of P2P system without centralized server always is an important issue. This paper proposes a virtual peer mechanism of P2P overlay network based on the arrangement graph to make exiting physical peers be agent peers for vacant peers. Each vacant peer is managed by a physical peer who often is its neighbor, and the vacant peer is called virtual peer. Physical peers and virtual peers make the arrangement graph full, and make the number of routing hops can be limited within the diameter of the arrangement graph. From experimental results, this system can keep routing efficiency no matter the number of peers and do not increase system overhead.


Peer-to-Peer overlay network arrangement graph fault tolerance 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Baumgart, I., Heep, B., Krause, S.: OverSim: A Flexible Overlay Network Simulation Framework. In: The Proceedings of 10th IEEE Global Internet Symposium (GI 2007) in conjunction with IEEE INFOCOM 2007, Anchorage, AK, USA, pp. 79–84 (May 2007), doi:10.1109/GI.2007.4301435Google Scholar
  2. 2.
    Day, K., Tripathi, A.: Arrangement graphs: A class of generalized star graphs. Inform. Processing Lett. 42, 235–241 (1992)Google Scholar
  3. 3.
    Haribabu, K., Reddy, D., Hota, C., Yla-Jaaski, A., Tarkoma, S.: Adaptive Lookup for Unstructured Peer-to-Peer Overlays. In: The Proceedings of 3rd International Conference on Communication Systems Software and Middleware and Workshops 2008 (COMSWARE 2008), January 6-10, pp. 776–782 (2008)Google Scholar
  4. 4.
    Jiang, S., Guo, L., Zhang, X.: LightFlood: Minimizing Redundant Messages and Maximizing Scope of Peer-to-Peer Search. The Journal of IEEE Transactions on Parallel and Distributed Systems (TPDS) 19(5), 601–614 (2008)CrossRefGoogle Scholar
  5. 5.
    Frans Kaashoek, M., Karger, D.R.: Koorde: A simple degree-optimal distributed hash table. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, pp. 98–107. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  6. 6.
    Lua, E.K., Crowcroft, J., Pias, M., Sharma, R., Lim, S.: A Survey and Comparison of Peer-to-Peer Overlay Network Schemes. The Journal of IEEE Communications Survey and Tutorial 7(2), 72–93 (Second Quarter, 2005)CrossRefGoogle Scholar
  7. 7.
    Lu, S.-H., Lai, K.-C., Li, K.-C., Chung, Y.-C.: Design and analysis of arrangement graph-based overlay systems for information sharing. In: The Proceedings of the 3rd IEEE International Workshop on Management of Emerging Networks and Services (IEEE MENS 2011) in conjunction with IEEE GLOBECOM 2011, Houston, Texas, USA, pp. 694–698 (2011)Google Scholar
  8. 8.
    Rowstron, A., Druschel, P.: Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  9. 9.
    Stoica, I., Morris, R., Liben-Nowell, D., Karger, D., Frans Kaashoek, M., Dabek, F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. The Journal of IEEE/ACM Transactions on Networking 11(1), 17–32 (2003)CrossRefGoogle Scholar
  10. 10.
  11. 11.

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Ssu-Hsuan Lu
    • 1
    Email author
  • Kuan-Ching Li
    • 2
  • Kuan-Chou Lai
    • 3
  • Yeh-Ching Chung
    • 1
  1. 1.Department of Computer ScienceNational Tsing Hua UniversityHsinchuTaiwan
  2. 2.Department of Computer Science and Information EngineeringProvidence UniversityTaichungTaiwan
  3. 3.Department of Computer ScienceNational Taichung UniversityTaichungTaiwan

Personalised recommendations