No full-text available
To read the full-text of this research,
you can request a copy directly from the authors.
Topological design of minimum cost survivable computer communication networks, Bipartite Graph Method
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. Comment: 5 Pages, International Journal of Computer Science and Information Security, IJCSIS July 2009, ISSN 1947 5500, Impact Factor 0.423
... [ Fig. 1] The Sample network for routing costs I (1,2), (1,3), (1,4), (1,5), (2,3), (2,4), ( 2,5), (3,4), (3,5), (4,5)이다. ...
... [ Fig. 1] The Sample network for routing costs I (1,2), (1,3), (1,4), (1,5), (2,3), (2,4), ( 2,5), (3,4), (3,5), (4,5)이다. ...
... [ Fig. 1] The Sample network for routing costs I (1,2), (1,3), (1,4), (1,5), (2,3), (2,4), ( 2,5), (3,4), (3,5), (4,5)이다. ...
In general, the network survivability means that The user do not know the network faults and the recovery of those. For this, we use the dual(multi) routes between each two nodes. It is important that the each dual routes have efficient costs(or minimum). Even if one route is the minimum cost in case of no fault, another route of dual may be very large cost in case of fault case. Therefore we need the dual routes of each two nodes having the efficient(or minimum) costs. In this paper we find the network design method for the dual routes of each two node having the efficient costs. Although the design method is very simple and heuristic and it may be not useful for some networks, we will use it in various network environment.. Because this design method can be used very easy. A sample design will proof this usefulness.
... We will refer to these problems as k-connectivity of a computer communication network [15]. Few methods for generating k-connected networks are proposed in the literature [2,12,13,14]. Once a potential network N is generated by any one of the existing methods [2,12,13,14] and claims that the connectivity number of the generated network N is k, then a few heuristics exist in literature to verify that the generated network is k connected or not [3,4,5]. All these heuristics [3,4,5] verifies the claim on the connectivity number of the given network. ...
... Few methods for generating k-connected networks are proposed in the literature [2,12,13,14]. Once a potential network N is generated by any one of the existing methods [2,12,13,14] and claims that the connectivity number of the generated network N is k, then a few heuristics exist in literature to verify that the generated network is k connected or not [3,4,5]. All these heuristics [3,4,5] verifies the claim on the connectivity number of the given network. ...
Survivability of a computer communication network is the ability of a network to provide continuous service in the presence of link or node failures. It is an essential and considerable concern in the design of high speed communication network topologies. The connectivity number of a network is the graph theoretical metric to measure survivability of the communication network. Given a network and a positive integer k, few heuristics exist in literature to verify whether the given network is k connected or not. This paper presents a method to compute the connectivity number ? of a given computer communication network.
... Further it also stabilizes the energy of the network. The network should have more disjoint paths for more survivability and fault tolerant [15][16][17]. Based on the study of research of the above papers, we are proposing a multistage energy-efficient cooperative routing (MEECR) scheme for achieving energy efficiency and to enhance the lifetime of network. ...
In the recent years cooperative communication and routing has drawn the attention of the researchers primarily on the energy efficacy aspect in a general wireless networks. The lifetime of the network and energy utilization need to be improved in wireless communication network. The cooperative model has proved to be one of the best techniques for enhancement of network lifetime and also energy balancing among the nodes in wireless networks. In this research article proposes a novel multistage energy efficient cooperative routing technique which enhances the lifetime and energy efficiency. The multistage cooperative model is designed to find the set of neighboring nodes which cooperatively participate for transmission. Later the cost of link matrix is calculated for those set of cooperative nodes. The multistage cooperative routing mechanism is proposed based on multistage cooperative model and optimal link cost to minimize the routing cost. The simulation results of the proposed scheme shows that, it has enhanced energy efficiency and the lifetime of network for various number of performance metrics. The results obtained may be compared with the existing techniques.
... Network remain connected even when links or nodes fails and Communication links are expensive, so we have to design a network with optimal links. In Fault tolerant and survivable networks should have alternative paths between each vertices [24]. ...
In the year 2015 per person is having 3.47 devices that will be around 25 billion devices, In future years 2020 expected devices per person are 6.58 which is around 50 billion devices. From this statistic, we clearly identified a major problem for IoT devices is scalability and survivability. As the number of devices increases, which is nothing but scalability increases, the quality of service (QoS) will be decreased. To increase the QoS we have to design a novel architecture. To address these problems we come up with a trimet graph optimization (TGO) topology. Topology plays an important role in modern wireless technologies like WSN, Ad hoc networks, cyber-physical system and IOT. We have basic topologies like a bus, ring, star, mesh, tree, etc., which are not fulfilling all the requirements of the modern engineering problems. In this paper, we are making a new attempt to bridge the gap between existing topologies and network design problems. We are testing a novel TGO topology which is used to design a survival, simple, cost-effective topology for Wireless sensor networks and IoT. TGO topology was simulated extensively on various scenarios of wireless technologies using Contiki OS and Cooja simulator. Finally, results are compared with the existing topologies.
... However, this cause delays in propagation of data through the nodes. A growing body of literature suggests fundamental problems of topological design in computer technology [30][31][32][33][34]. These problems have been resolved in form of classes of Pascal graph with extreme topological parameters that correspond to the parameters of speed of information transmission, productivity, and security with limitations in costs [35]. ...
Development of energy efficient Wireless Sensor Network (WSN) routing protocol is nowadays
main area of interest amongst researchers. This research is an effort in designing energy
efficient Wireless Sensor Network (WSN) routing protocol under certain parameters
consideration. Research report discusses various existing WSN routing protocols and propose a
new WSN energy efficient routing protocol. Results show a significant improvement in life cycle
of the nodes and enhancement in energy efficiency of WSN. In this paper, an attempt has been
made to design a wireless sensor network involving the extraction of Pascal Graph features.
The standard task involves designing a suitable topology using Pascal Graph. As per the
definition of interconnection network it is equivalent that a suitable graph can represent the
different computer network topologies very efficiently. Different characteristics of Pascal Graph
Topology has been discovered and used in network topology design. Since Pascal Graph gives
better result in terms of finding the dependable and reliable nodes in topology, it has been
considered for network analysis. Moreover, we propose a methodology that involves the Pascal
Graph Topology for wireless sensor network which can analyse and represent the network and
help in routing.
... used in this approach for designing a k- connected network topology is much larger than the optimal number of links which is ((n*k)/2). Kamlesh et al [1] proposed an approach using bipartite graph. Number of links required in this method is k*(n-k) which are near to optimal only when k>n/2. ...
The purpose of designing an optimal and fault tolerant communication network is to achieve a precise performance without any disruption at a minimal cost. A network is said to be k- link fault tolerant (nodes are assumed reliable) if it is able to maintain connectivity in the presence of failures in any set of arbitrarily k links simultaneously. Communication network topology design cost depends on the number of the links used to design a desired fault tolerant communication network and is equal to the sum of the cost of all required links. The main objective of a fault tolerant network design approach is therefore to select the minimum number of low cost links while satisfying the pre-specified fault tolerance/connectivity. It has also been proved that designing a minimum cost communication network topology under the connectivity constraint is a NP hard problem. Several constructive approximation algorithms have be enproposed to design a fault tolerant network topology. But the existing algorithms are not so much effective for selecting minimum number of low cost links to design a computer network topology. In this paper, we have proposed an efficient constructive approximation approach for designing a k – connected network which is survivable in the presence of k-1 links failures in the network. The design cost and number of links required to design such network using proposed approach is less than the existing approaches. Effectiveness of proposed approach is also checked using various examples.
In current technological development on the design of wireless communication network, it is observed that one of the critical issues is dependable network. The dependable network encompasses the properties like availability, reliability and survivability. The wireless networks are more complicated with problems such as allocation of frequencies, service quality and node or link failures. Hence, survivability is one of the significant factors to be considered during the design process. Survivability is attained by achieving fault tolerance. Survivability can be achieved by having high node connectivity (k) in the topological design of network. This chapter presents a symmetric method based on bisection logic (BSA) to generate a k-node connected network structure for maximal connectivity number k and hence highly survivable network structures.
Low transmission delay, high fault tolerance and low design cost are the three main properties of any network which are best described by its topology. Transmission delay can be decreased by restricting the diameter of the network. Very few methods in literature have considered the importance of the diameter of the network to decrease the transmission delay. Fault tolerance in the network depends on the number of disjoint paths between a node pair. Designing a k-connected fault tolerant network subject to connectivity and diameter constraint at minimal cost is a NP hard problem. In this paper, an efficient constructive heuristic algorithm is proposed for designing a k-connected network while optimizing the cost of the network subject to the connectivity and diameter constraints. Diameter of resultant network would be of two links regardless of network size to get the speed comparable to complete connected network at low cost. Effectiveness of the proposed approach is also evaluated using different examples.
Background: One of the key considerations in the topological design of a network is the fault tolerance and survivability of the network topology. A deterministic measure for fault tolerance proposed by computer scientist and researchers is the k-node connectivity number of the network graph. Fault may happen at the physical level or at the software level. Method: A few heuristics and methods are proposed in the literature for the design of k-node connected network topological structures. The methods are analyzed on the parameters such as link optimality, computational efforts, repeated searching of nodes, adopting node numbering techniques, mathematical modelling, generality of the methods etc. Findings: This article portrays the comprehensive study and investigation of existing works and current developments on the design of k-node connected topological design of computer communication network structures, applicable for both wired and wireless network structures. This paper also highlights on the various design methods applicable for specific cases and also compares the existing and current methods, for the design parameters considered. Applications/Improvement: The study concludes by stating that the previous methods and strategies are restricted only to a few network design parameters. However there is no single method which addresses most of the issues, hence there is a scope for future exploration design methods.
In this work the problem of network topology design is considered. It is crucial that network continues to work even if some nodes or links fail. Survivability criterion poses a demand for a certain number of distinct paths between each pair of nodes in the network. Diameter of the network is the maximum number of hops in a path between any two non-adjacent nodes and to bound maximum delay in the network, this criteria is also taken into account. We are presenting an implementation of the algorithm that satisfies criterion of survivability, bounded delay and has minimum cost. Finally we give design examples with the concrete networks.
Along with the development of bandwidth consuming services, fiber optic is being widely used, especially in the metro core networks. Many solutions have been proposed for designing optical network topology. However these solutions neither focus on all-optical network nor fault tolerance issue. This paper proposes a solution for designing physical topology of optical metro core networks with the objective of (i) ensuring traffic requirements between the network nodes, (ii) minimizing fiber cost, and (iii) assuring the network survivability. The numerical results show that the proposed solution satisfies those objectives and save more fiber than existing solutions.
The topological design of a computer communication network assigns the links and link capacities for connecting network nodes within several constraints, with a goal to achieve a specified performance at a minimal cost. A reasonable approach is to generate a potential network topology. This paper presents a spanning tree based method for systematic numbering of nodes in any communication network. When the nodes are numbered in a systematic manner the potential network topology generated will have lesser amount of perturbation before an acceptable network is found.
We consider the problem of designing a network which satisfies a prespecified survivability criterion with minimum cost. The survivability criterion demands that there be at least r_{ij} node disjoint paths between nodes i and j , where (r_{ij}) is a given redundancy requirement matrix. This design problem appears to be at least as difficult as the traveling salesman problem, and present techniques cannot provide a computationally feasible exact solution. A heuristic approach is described, based on recent work on the traveling salesman problem, which leads to a practical design method. Algorithms are described for generating starting networks, for producing local improvements in given networks, and for testing the redundancy of networks at each stage. This leads to networks which are locally optimum with respect to the given transformation. Randomizing the starting solution ensures that the solution space is widely sampled. Two theorems are given which allow great reduction in the amount of computation required to test the redundancy of a network. Finally, some design examples are given.
The link deficit algorithm proposed by Steigletiz, Weiner and Kletman is a heuristic to generate a potential network topology. This heuristic begins by numbering the nodes at random. If the nodes are numbered in a systematic manner, the link deficit algorithm yields a starting network which needs relatively lesser amount of perturbation before an acceptable network is found. Few methods for systematic numbering of nodes in a computer communication network have been proposed in the literature. Earlier we have proposed two graph theory based method for systematic numbering of nodes in a computer communication network. The nodes are numbered based on the eccentricity values. However the nodes having the same eccentricity values will end up in a tie. This article aims at resolving the eccentricity tie.
The goal of the topological design of a Computer Communication Network is to achieve a specified performance at a minimal cost. Unfortunately, the problem is completely intractable. A reasonable approach is to generate a potential network topology. One heuristic for generating a potential network topology is due to Steiglitz, Weiner and Kleitman. This heuristic begins by numbering the nodes at random. This paper presents a systematic method for numbering the nodes. When the nodes are numbered in a systematic manner, the potential network topology generated will need lesser amount of perturbation before an acceptable network is found.
On some aspects of Design of cheapest survivable networks, International journal of computer nal science and network securities
- S Latha
- S K Srivatsa
S.Latha and S.K.Srivatsa, On some aspects of Design of
cheapest survivable networks, International journal of
computer nal science and network securities, Vol. 7, No.
11, 2007, pp. 210-211.
Introduction to Graph Theory, Pearson Education, inc 2 nd Edition
- Douglas B West
Douglas B. West, Introduction to Graph Theory, Pearson
Education, inc 2 nd Edition, (2001).
On the design of minimum cost survivable network topologies, 15 th National conferences on communication
- V Kamalesh
- Srivatsa
Kamalesh V. N and S. K. Srivatsa, On the design of
minimum cost survivable network topologies, 15 th
National conferences on communication, IIT Guwahati,
India, 16-18 th Jan 2009, pp 394-397.
Pertubation techniques for topological optimization of computer networks
- A Lavia
- E G Manning
A. Lavia and E. G. Manning, Pertubation techniques for
topological optimization of computer networks, Proc.
Fourth Data Communication, Symp. (1975), pp.4.16-4.23.
Numbering of nodes in computer communication networks: A brief review
- V Kamalesh
- Srivatsa
Kamalesh V. N and S. K. Srivatsa, Numbering of nodes
in computer communication networks: A brief review.
National Conference on Advanced Network Technologies
and Security Issues, FISAT, Cochin, Kerala, India, 8 th to
10 th August 2007, pp. 278-282.