+612 9045 4394
 
CHECKOUT
Survivable Networks : Algorithms for Diverse Routing - Ramesh Bhandari

Survivable Networks

Algorithms for Diverse Routing

Hardcover

Published: 30th November 1998
Ships: 7 to 10 business days
7 to 10 business days
RRP $456.99
$316.25
31%
OFF
or 4 easy payments of $79.06 with Learn more

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.

Preface
Introduction
Shortest Path Algorithms
Shortest Pair of Disjoint Paths Algorithms
Maximally Disjoint Paths and Physical Diversity Versus Coast Algorithms
Physically Disjoint Paths in Real-Life Telecommunication Fiber Networks
Maximally Disjoint Paths Algorithms for Arbitrary Network Configurations
K(>2) Disjoint Paths Algorithms
Disjoint Paths: Multiple Sources and Destinations
Further Research
References
Index
Table of Contents provided by Publisher. All Rights Reserved.

ISBN: 9780792383819
ISBN-10: 0792383818
Series: KLUWER INTERNATIONAL SERIES IN ENGINEERING AND COMPUTER SCIENCE
Audience: Professional
Format: Hardcover
Language: English
Number Of Pages: 200
Published: 30th November 1998
Publisher: Springer
Country of Publication: NL
Dimensions (cm): 24.77 x 16.51  x 1.91
Weight (kg): 0.54