Skip to main content

Probing Based Topology Inference for Large Scale Community Networks

  • Conference paper
Challenges for Next Generation Network Operations and Service Management (APNOMS 2008)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 5297))

Included in the following conference series:

  • 1099 Accesses

Abstract

Traditional research in on-demand topological solutions is gathered around the two main clusters, - wireless ad-hoc networks and fixed overlay networks. Both are very different in nature, but they both deal with the same problem which is to create a topology out of an arbitrary set of nodes. This paper considers the case of an arbitrary set of mixed-technology nodes which are to be joined in a topology based on end-to-end delay measurements among nodes. The core of the proposal is topology inference based on triangular inequality of end-to-end delay which is finalized in form of an algorithm that allows for efficient detection of a logical topology of a network with no initial topology. The algorithm is scalable and could be a practical solution for many scenarios involving community services created on-demand and intended for a short lifespan.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. GT-ITM: Georgia Tech Internetwork Topology Generator, http://www.cc.gatech.edu/fac/Ellen.Zegura/graphs.html

  2. Tang, L., Zhang, H., Li, J., Li, Y.: End-to-End Delay Behavior in the Internet. In: 14th IEEE international Symposium on Modeling, Analysis, and Simulation (MASCOTS), pp. 373–382 (2006)

    Google Scholar 

  3. PlanetLab, http://www.planet-lab.org

  4. Zeitoun, A., Chuah, C.N., Bhattacharrya, S., Diot, C.: An AS-Level Study of Internet Path Delay Characteristics. In: IEEE Globecom (2004)

    Google Scholar 

  5. Dabek, F., Cox, R., Kaashoek, F., Morris, R.: Vivaldi: a decentralized network coordinate system. SIGCOMM Computer Communications Review 34(4), 15–26 (2004)

    Article  Google Scholar 

  6. Wong, B., Slivkins, A., Sirer, E.G.: Meridian: a lightweight network location service without virtual coordinates. In: Conference on Applications, Technologies, Architectures, and Protocols For Computer Communications, pp. 85–96 (2005)

    Google Scholar 

  7. p2psim, http://www.pdos.lcs.mit.edu/p2psim/

  8. Zhang, B., Ng, T.E., Nandi, A., Riedi, R., Druschel, P., Wang, G.: Measurement based analysis, modeling, and synthesis of the internet delay space. In: ACM SIGCOMM Conference on internet Measurement, pp. 85–98 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhanikeev, M., Tanaka, Y., Ogishi, T. (2008). Probing Based Topology Inference for Large Scale Community Networks. In: Ma, Y., Choi, D., Ata, S. (eds) Challenges for Next Generation Network Operations and Service Management. APNOMS 2008. Lecture Notes in Computer Science, vol 5297. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88623-5_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88623-5_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88622-8

  • Online ISBN: 978-3-540-88623-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics