Topological design of minimum cost survivable computer communication networks, Bipartite Graph Method

Details Topological design of minimum cost survivable computer communication networks, Bipartite Graph Method Topological design of minimum cost survivable computer communication networks, Bipartite Graph Method

2009-08-07

arxiv.org/abs/0908.1033v1

International Journal of Computer Science and Information Security, IJCSIS, Vol. 3, No. 1, July 2009, USA

Computer Science

Networking and Internet Architecture

5 Pages, International Journal of Computer Science and Information Security, IJCSIS July 2009, ISSN 1947 5500, Impact Factor 0

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Topological design of minimum cost survivable computer communication networks, Bipartite Graph Method does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Topological design of minimum cost survivable computer communication networks, Bipartite Graph Method, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Topological design of minimum cost survivable computer communication networks, Bipartite Graph Method will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-153133