Skip to main content
SpringerLink
Log in

Construct Optimal Diameter Network and d-partition Routing Algorithm

  • Conference paper
Book cover Parallel and Distributed Processing and Applications - ISPA 2005 Workshops (ISPA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3759))

  • 587 Accesses

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.

The research of this paper is supported by National Natural Science Fund Project of China (No. 60473082).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. Andersen, D.G.: Resilient Overlay Networks. Master’s thesis, Massachusetts Institute of Technology (2001)

    Google Scholar 

  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. 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. Schoone, A.A., Bodlaender, H.L., van Leeuwen, J.: Diameter Increase Caused by Edge Deletion. Journal of Graph Theory 11, 409–427 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  6. Rucinski, A., Wormald, N.C.: Random graph processes with degree restrictions. Combin. Probab Comput. 1, 169–180 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  7. Erdos, P., Gyarfas, A., Ruszinko, M.: How to decrease the diameter of triangle-free graphs. Combinatorial 18, 493–501 (1998)

    Article  MathSciNet  Google Scholar 

  8. Miller, M., Fris, I.: Minimum Diameter of Diregular Digraphs of Degree 2. Computer Journal 31(1), 71–75 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  9. Bridges, W.G., Toueg, S.: On the impossibility of directed Moore graphs. J. Combinatorial Theory, Series B 29(3), 339–341 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  10. Erdos, P., Renyi, A.: On random graphs I. Math. Debrecen 6, 290–297 (1959)

    MathSciNet  Google Scholar 

  11. Bondy, J.A., Murty, U.S.R.: Graphs Theory with Applications. Macmillan, Basingstoke (1976)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Technology, Tsinghua University, Beijing, 100084, P.R.China

    Qiang Ding, Ke Xu & Hui-shan Liu

Authors
  1. Qiang Ding
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ke Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hui-shan Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. State Key Laboratory for Novel Software Technology, Nanjing University, 210093, Nanjing, China

    Guihai Chen

  2. Dept. of CS, Georgia State University, 30302, Atlanta, GA, USA

    Yi Pan

  3. Department of Computer Science and Engineering, Shanghai Jiao Tong University, 200030, Shanghai, China

    Minyi Guo

  4. Department of Computer Science, University of Virginia,  

    Jian Lu

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ding, Q., Xu, K., Liu, Hs. (2005). Construct Optimal Diameter Network and d-partition Routing Algorithm. In: Chen, G., Pan, Y., Guo, M., Lu, J. (eds) Parallel and Distributed Processing and Applications - ISPA 2005 Workshops. ISPA 2005. Lecture Notes in Computer Science, vol 3759. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11576259_9

Download citation

  • DOI: https://doi.org/10.1007/11576259_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29770-3

  • Online ISBN: 978-3-540-32115-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation