Survivable Networks: Algorithms for Diverse Routing

by Ramesh Bhandari

Overview

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.

Product Details

ISBN-13:	9780792383819
Publisher:	Springer US
Publication date:	11/30/1998
Series:	The Springer International Series in Engineering and Computer Science , #477
Edition description:	1999
Pages:	200
Product dimensions:	6.40(w) x 9.40(h) x 0.90(d)

Table of Contents

Preface. 1. Introduction. 2. Shortest Path Algorithms. 3. Shortest Pair of Disjoint Paths Algorithms. 4. Maximally Disjoint Paths and Physical Diversity Versus Coast Algorithms. 5. Physically Disjoint Paths in Real-Life Telecommunication Fiber Networks. 6. Maximally Disjoint Paths Algorithms for Arbitrary Network Configurations. 7. K(>2) Disjoint Paths Algorithms. 8. Disjoint Paths: Multiple Sources and Destinations. Further Research. References. Index.

Editorial Reviews

Explains some methods for developing routes through a network that reduces or eliminates the risk of losing data due to a fiber span cut or node failure as networks become more glass than metal and the intolerance of such loss by customers grows as they have more and more services to choose from. Considers the common mesh-type network and describes in detail the construction of physically disjoint paths algorithms for diverse routing, starting with those for the shortest path. The algorithms are in a generic form, so though they were developed for a communications network, they could be applied to other problems that can be modeled as a network. Annotation c. Book News, Inc., Portland, OR (booknews.com)

Booknews