Survivable Networks: Algorithms for Diverse Routing

From the Publisher: Survivable Networks: Algorithms for Diverse Routingprovides algorithms for diverse routing to enhance the survivabilityof a network. It considers the common mesh-type network and describesin detail the construction of physically disjoint paths algorithms fordiverse routing. The algorithms are developed in a systematic manner,starting with shortest path algorithms appropriate for disjoint pathsconstruction. Key features of the algorithms are optimality andsimplicity. Although the algorithms have been developed forsurvivability of communication networks, they are in a generic form,and thus applicable in other scientific and technical disciplines toproblems that can be modeled as a network. A notable highlight of this book is the consideration of real-lifetelecommunication networks in detail. Such networks are described notonly by nodes and links, but also by the actual physical elements,called span nodes and spans. The sharing of spans (the actual physicallinks) by the network (logical) links complicates the network,requiring new algorithms. This book is the first one to providealgorithms for such networks. Survivable Networks: Algorithms for Diverse Routing is acomprehensive work on physically disjoint paths algorithms. It is aninvaluable resource and reference for practicing network designers andplanners, researchers, professionals, instructors, students, andothers working in computer networking, telecommunications, and relatedfields.