Design of Survivable Networks

Design of Survivable Networks

Author: Mechthild Stoer

Publisher: Springer

Published: 2006-11-15

Total Pages: 203

ISBN-13: 3540475001

DOWNLOAD EBOOK

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 Survivable Networks with Bounded Rings

Design of Survivable Networks with Bounded Rings

Author: B. Fortz

Publisher: Springer Science & Business Media

Published: 2013-11-22

Total Pages: 213

ISBN-13: 1461546699

DOWNLOAD EBOOK

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.


Survivable Networks

Survivable Networks

Author: Ramesh Bhandari

Publisher: Springer Science & Business Media

Published: 1999

Total Pages: 218

ISBN-13: 9780792383819

DOWNLOAD EBOOK

Survivable Networks: Algorithms for Diverse Routing provides algorithms for diverse routing to enhance the survivability of a network. It considers the common mesh-type network and describes in detail the construction of physically disjoint paths algorithms for diverse routing. The algorithms are developed in a systematic manner, starting with shortest path algorithms appropriate for disjoint paths construction. Key features of the algorithms are optimality and simplicity. Although the algorithms have been developed for survivability of communication networks, they are in a generic form, and thus applicable in other scientific and technical disciplines to problems that can be modeled as a network. A notable highlight of this book is the consideration of real-life telecommunication networks in detail. Such networks are described not only by nodes and links, but also by the actual physical elements, called span nodes and spans. The sharing of spans (the actual physical links) by the network (logical) links complicates the network, requiring new algorithms. This book is the first one to provide algorithms for such networks. Survivable Networks: Algorithms for Diverse Routing is a comprehensive work on physically disjoint paths algorithms. It is an invaluable resource and reference for practicing network designers and planners, researchers, professionals, instructors, students, and others working in computer networking, telecommunications, and related fields.


Design of Minimum Cost Survivable Networks

Design of Minimum Cost Survivable Networks

Author: D. J. Kleitman

Publisher:

Published: 1969

Total Pages: 54

ISBN-13:

DOWNLOAD EBOOK

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.


Survivable Network Design Problems with High Connectivity Requirement

Survivable Network Design Problems with High Connectivity Requirement

Author: Ibrahima Diarrassouba

Publisher: LAP Lambert Academic Publishing

Published: 2012

Total Pages: 268

ISBN-13: 9783659240881

DOWNLOAD EBOOK

Network survivability is one of the key issue when designing a network. It has a crucial importance, especially for telecommunication networks, since a very large part of the economical activities uses telecommunication infrastructures. The aim of network engineers is hence to ensure both survivability, by satisfying some connectivity requirements, and quality of service (QoS). In this book, we propose a mathematical analysis of the problem of designing a minimum cost survivable and QoS-constrained network, where a high level of connectivity is required and QoS is guarantied by limiting the number of hop in each traffic path. We present Linear Programming models for the problem in different cases and investigate their polyhedral structure. All along this book, we address both theoretical and algorithmic aspects of the different cases we study, and develop efficient and exact algorithms to solve this network design problem. This book should be useful to practioners in telecommunications and network engineering, and to researchers and students who are interested in studying network design problems.


Design of Modern Communication Networks

Design of Modern Communication Networks

Author: Christofer Larsson

Publisher: Academic Press

Published: 2014-03-05

Total Pages: 463

ISBN-13: 0124076874

DOWNLOAD EBOOK

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.