Skip to main content

Network Clustering for Managing Large Scale Networks

  • Conference paper
Technology Systems and Management

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 145))

  • 1570 Accesses

Abstract

In this paper we present algorithms to intelligently divide the network into smaller sub-networks. We systematically define the problem of finding minimal number of small-size clusters, and present a reduction of this problem to the Minimum Vertex Cover problem. We then use this reduction to present two algorithms that vary in their optimality and execution time. We present extensive experimental evaluation to evaluate the proposed algorithms on different network topologies.

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. Cooperative association for Internet data analysis (CAIDA). the skitter project. Technical report (2001), http://www.caida.org/tools/measurement/skitter/index.html

  2. Barham, P., Isaacs, R., Mortier, R., Narayanan, D.: Magpie: Online modeling and performance-aware systems. In: 9th conference on Hot Topics in Operating Systems, HOTOS 2003, Berkeley, CA, USA (2003)

    Google Scholar 

  3. Bouloutas, A., Gopal, P.: Clustering schemes for network management. In: INFOCOM, pp. 111–120 (1991)

    Google Scholar 

  4. Jamin, S., Jin, C., Kurc, A.R., Raz, D., Shavitt, Y.: Constrained mirror placement on the Internet. In: INFOCOM, pp. 31–40 (2001)

    Google Scholar 

  5. Jeswani, D., Korde, N., Patil, D., Natu, M., Augustine, J.: Probe station selection for robust network monitoring. In: Student Research Symposium, International Conference on High-Performance Computing, Kochi, India (Best Paper Award) (December 2009)

    Google Scholar 

  6. Kumar, R., Kaur, J.: Efficient beacon placement for network tomography. In: Internet Measurement Conference, IMC (2004)

    Google Scholar 

  7. Natu, M., Sethi, A.S.: Probe station placement for robust monitoring of networks. Journal of Network and Systems Management (2007)

    Google Scholar 

  8. Steinder, M., Sethi, A.S.: Multidomain diagnosis of end-to-end service failures in hierarchically routed networks. IEEE Transactions on Parallel and Distributed Systems 8(3) (March 2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Krishnan, S., Maheshwari, R., Birla, P., Natu, M. (2011). Network Clustering for Managing Large Scale Networks. In: Shah, K., Lakshmi Gorty, V.R., Phirke, A. (eds) Technology Systems and Management. Communications in Computer and Information Science, vol 145. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20209-4_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20209-4_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20208-7

  • Online ISBN: 978-3-642-20209-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics