Topological design of minimum cost survivable computer communication networks, Bipartite Graph Method
Networking and Internet Architecture
2009-08-10 v1
Abstract
A good computer network is hard to disrupt. It is desired that the computer communication network remains connected even when some of the links or nodes fail. Since the communication links are expensive, one wants to achieve these goals with fewer links. The computer communication network is fault tolerant if it has alternative paths between vertices, the more disjoint paths, the better is the survivability. This paper presents a method for generating k-connected computer communication network with optimal number of links using bipartite graph concept.
Keywords
Cite
@article{arxiv.0908.1033,
title = {Topological design of minimum cost survivable computer communication networks, Bipartite Graph Method},
author = {Kamalesh V. N and S. K. Srivatsa},
journal= {arXiv preprint arXiv:0908.1033},
year = {2009}
}
Comments
5 Pages, International Journal of Computer Science and Information Security, IJCSIS July 2009, ISSN 1947 5500, Impact Factor 0.423