Advertisement

Construct Optimal Diameter Network and d-partition Routing Algorithm

  • Qiang Ding
  • Ke Xu
  • Hui-shan Liu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3759)

Abstract

This paper studies the topological structure of network using graph-theoretical properties and proposes a topology constructionmethod of regular directed graphs (or digraphs). The diameter of the topological digraph is ⌈logdn⌉. In this paper, we also propose a routing algorithm based thistopological structure and find its complexity is O(⌈logdn⌉).This algorithm has a smaller diameter and easier to construct than the existing algorithms, which can be used of downloading files and defending worms in structured peer-to-peer systems.

Keywords

Distribute Hash Table Topology Graph Neighbor Vertex Source Vertex Route Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Braynard, R., Kostic, D., Rodriguez, A.: Opus: an Overlay Peer Utility Service. In: 5th International Conference on Open Architectures and Network Programming (2002)Google Scholar
  2. 2.
    Andersen, D.G.: Resilient Overlay Networks. Master’s thesis, Massachusetts Institute of Technology (2001)Google Scholar
  3. 3.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M.F.: Chord: A scalable peer-to-peer lookup service for internet applications. In: SIGCOMM, San Diego, CA, pp. 149–160 (2001)Google Scholar
  4. 4.
    Zhao, B.Y., Kubiatowicz, J.D.: Tapestry: An infrastructure for fault-tolerant wide area location and routing. Univ. California, Berkeley, CA, Tech. Rep. CSD-01-1141 (2001)Google Scholar
  5. 5.
    Schoone, A.A., Bodlaender, H.L., van Leeuwen, J.: Diameter Increase Caused by Edge Deletion. Journal of Graph Theory 11, 409–427 (1987)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Rucinski, A., Wormald, N.C.: Random graph processes with degree restrictions. Combin. Probab Comput. 1, 169–180 (1992)zbMATHMathSciNetCrossRefGoogle Scholar
  7. 7.
    Erdos, P., Gyarfas, A., Ruszinko, M.: How to decrease the diameter of triangle-free graphs. Combinatorial 18, 493–501 (1998)CrossRefMathSciNetGoogle Scholar
  8. 8.
    Miller, M., Fris, I.: Minimum Diameter of Diregular Digraphs of Degree 2. Computer Journal 31(1), 71–75 (1988)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Bridges, W.G., Toueg, S.: On the impossibility of directed Moore graphs. J. Combinatorial Theory, Series B 29(3), 339–341 (1980)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Erdos, P., Renyi, A.: On random graphs I. Math. Debrecen 6, 290–297 (1959)MathSciNetGoogle Scholar
  11. 11.
    Bondy, J.A., Murty, U.S.R.: Graphs Theory with Applications. Macmillan, Basingstoke (1976)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Qiang Ding
    • 1
  • Ke Xu
    • 1
  • Hui-shan Liu
    • 1
  1. 1.Department of Computer Science and TechnologyTsinghua UniversityBeijingP.R.China

Personalised recommendations