|International Conference on Technology Systems and Management
|Foundation of Computer Science USA
|ICTSM - Number 2
|Authors: Sandhya Krishnan, Richa Maheshwari, Prachi Birla, Maitreya Natu
Sandhya Krishnan, Richa Maheshwari, Prachi Birla, Maitreya Natu . An Approach to Manage Large Scale Networks Using Network Clustering Algorithms. International Conference on Technology Systems and Management. ICTSM, 2 (None 2011), 1-6.
The large size and complexity of today’s networks present many scalability challenges for various tasks such as network monitoring, fault localization, distance estimation, etc. A subset of these problems can be addressed by the divide and conquer approach of dividing the network into smaller manageable networks and building an overall solution over these smaller networks. 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. We have introduced the proposed approach in . This paper presents a more detailed explanation of the proposed approach with more illustrations and examples. This paper also extends the approach multiple clustering criteria.