Design of Survivable Networks with Bounded Rings


Book Description

These days, the nature of services and the volume of demand in the telecommu nication industry is changing radically, with the replacement of analog transmis sion and traditional copper cables by digital technology and fiber optic transmis sion equipment. Moreover, we see an increasing competition among providers of telecommunication services, and the development of a broad range of new services for users, combining voice, data, graphics and video. Telecommunication network planning has thus become an important problem area for developing and applying optimization models. Telephone companies have initiated extensive modeling and planning efforts to expand and upgrade their transmission facilities, which are, for most national telecommunication networks, divided in three main levels (see Balakrishnan et al. [5]), namely, l. the long-distance or backbone network that typically connects city pairs through gateway nodes; 2. the inter-office or switching center network within each city, that interconnects switching centers in different subdivisions (clusters of customers) and provides access to the gateway(s) node(s); 1 2 DESIGN OF SURVNABLE NETWORKS WITH BOUNDED RINGS 3. the local access network that connects individual subscribers belonging to a cluster to the corresponding switching center. These three levels differ in several ways including their design criteria. Ideally, the design of a telecommunication network should simultaneously account for these three levels. However, to simplify the planning task, the overall planning problem is decomposed by considering each level separately.




Design of Survivable Networks


Book Description

The problem of designing a cost-efficient network that survives the failure of one or more nodes or edges of the network is critical to modern telecommunications engineering. The method developed in this book is designed to solve such problems to optimality. In particular, a cutting plane approach is described, based on polyhedral combinatorics, that is ableto solve real-world problems of this type in short computation time. These results are of interest for practitioners in the area of communication network design. The book is addressed especially to the combinatorial optimization community, but also to those who want to learn polyhedral methods. In addition, interesting new research problemsare formulated.




Design of Modern Communication Networks


Book Description

Design of Modern Communication Networks focuses on methods and algorithms related to the design of communication networks, using optimization, graph theory, probability theory and simulation techniques. The book discusses the nature and complexity of the network design process, then introduces theoretical concepts, problems and solutions. It demonstrates the design of network topology and traditional loss networks, followed by uncontrolled packet networks, flow-controlled networks, and multiservice networks. Access network design is reviewed, and the book concludes by considering the design of survivable (reliable) networks and various reliability concepts. - A toolbox of algorithms: The book provides practical advice on implementing algorithms, including the programming aspects of combinatorial algorithms. - Extensive solved problems and illustrations: Wherever possible, different solution methods are applied to the same examples to compare performance and verify precision and applicability. - Technology-independent: Solutions are applicable to a wide range of network design problems without relying on particular technologies.




A Study of Deterministic Survivable Networks


Book Description

The idea of survivability introduced as a network parameter has led to so many investigations. Several measures of survivability has been studied. The number of links and/or stations needed to be damaged to disrupt the system is the survivability criterion adapted in the study. The development of analysis procedures for directed, undirected, or mixed networks based on the above criterion and use of the concepts in network flow and graph theory are treated in detail including computer program implementation of the algorithms. Finally a practical design algorithm for minimum-cost survivable network with respect to branch disconnection using a heuristic approach and analysis techniques is described. (Author).




A Study of Deterministic Survivable Networks


Book Description

The idea of survivability introduced as a network parameter has led to so many investigations. Several measures of survivability has been studied. The number of links and/or stations needed to be damaged to disrupt the system is the survivability criterion adapted in the study. The development of analysis procedures for directed, undirected, or mixed networks based on the above criterion and use of the concepts in network flow and graph theory are treated in detail including computer program implementation of the algorithms. Finally a practical design algorithm for minimum-cost survivable network with respect to branch disconnection using a heuristic approach and analysis techniques is described. (Author).




Handbook of Graph Theory


Book Description

The Handbook of Graph Theory is the most comprehensive single-source guide to graph theory ever published. Best-selling authors Jonathan Gross and Jay Yellen assembled an outstanding team of experts to contribute overviews of more than 50 of the most significant topics in graph theory-including those related to algorithmic and optimization approach




Graph Theory Applications in Network Security


Book Description

Project Report from the year 2015 in the subject Computer Science - IT-Security, Central Queensland University (Theory Lab), language: English, abstract: Graph theory has become a very critical component in many applications in the computing field including networking and security. Unfortunately, it is also amongst the most complex topics to understand and apply. In this paper, we review some of the key applications of graph theory in network security. We first cover some algorithmic aspects, then present network coding and its relation to routing. The rapid growth in Global mobile communication networks demands new solutions for existing problems. Such problems include reduced bandwidth in mobile devices and the constant change in their associated network topologies. This creates a need for network algorithms with: 1. least possible communication traffic 2. High speed execution. The two challenges can be overcome by application of graph theory in developing local algorithms (Algorithms that require low rounds of communication). In this paper we explore applications of graph theory in cellular networks with an emphasis on the 'four-color' theorem and network coding and their relevant applications in wireless mobile networks.




On Application of Graph Theory to Networks and Coding Problems Such as Encountered in Communication Systems


Book Description

A summary of research progress by the author and his coworkers on various areas of applied graph theory is presented. The research problems considered during this year can be broadly classified into the following three major areas - (1) Communication networks with particular emphasis in their vulnerability and survivability, (2) Design and analysis of linear and non-linear circuits with particular emphasis on computer aided design, and (3) Topics in pure and applied graph theory. The report contains a brief description of the results obtained in each of these three areas, identifies possible generalizations and further applications, and provides a list of publications containing the detailed research results. (Author).




A Graph-Theoretic Approach to Enterprise Network Dynamics


Book Description

This monograph treats the application of numerous graph-theoretic algorithms to a comprehensive analysis of dynamic enterprise networks. Network dynamics analysis yields valuable information about network performance, efficiency, fault prediction, cost optimization, indicators and warnings. Based on many years of applied research on generic network dynamics, this work covers a number of elegant applications (including many new and experimental results) of traditional graph theory algorithms and techniques to computationally tractable network dynamics analysis to motivate network analysts, practitioners and researchers alike.