Survivable Networks

Algorithms for Diverse Routing
1999
ISBN: 978-0-7923-8381-9
Verlag: Springer US

Buch, Englisch, Band 477, 200 Seiten, Format (B × H): 160 mm x 241 mm, Gewicht: 1060 g

Reihe: The Springer International Series in Engineering and Computer Science

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.
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.

Zielgruppe

Research

Autoren/Hrsg.

Bhandari, Ramesh

Fachgebiete

• Mathematik | Informatik EDV | Informatik Technische Informatik Externe Speicher & Peripheriegeräte
• Mathematik | Informatik EDV | Informatik Computerkommunikation & -vernetzung
• Technische Wissenschaften Elektronik | Nachrichtentechnik Elektronik Mikroprozessoren
• Mathematik | Informatik EDV | Informatik Technische Informatik Netzwerk-Hardware

Inhaltsverzeichnis

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.