Springer Traffic Grooming for Optical Networks: Foundations, Techniques and Frontiers

Product Description This book presents the practical motivation, theoretical description, and extant techniques for traffic grooming in optical networks. The description of the various topics of research will be authored by leading researchers in this area, and will contain comprehensive description of related literature for each area. This book is intended to be a definitive reference and text for traffic grooming both for the practitioner in industry and the student in academia. From the Back Cover Traffic Grooming for Optical Networks: Foundations, Techniques and Frontiers covers the principles, technology, practice, and future of traffic grooming in optical networks. Traffic grooming is the name given to a family of optical network design and resource allocation algorithms that can enable cost-efficient use of both network bandwidth and electronic switching. This book provides an authoritative point of reference to traffic grooming developments including Synchronous Optical Network/Synchronous Digital Hierarchy (SONET/SDH) and Generic Framing Procedure (GFP). This book begins by providing appropriate background information and then follows with an in-depth study of a few key issues and challenges. At the same time it brings together a broad range of perspectives from preeminent researchers in both academia and industry. Part one entitled "Foundations" presents enabling technology and standards and also gives a formal introduction to traffic grooming theory. Part two, "Techniques" contains eight chapters that present specific traffic grooming techniques and addresses corresponding fundamental issues. Finally, part three, "Frontiers", examines topics of emerging importance including multidomain considerations, waveband grooming and switching, and all-optical grooming. Traffic Grooming for Optical Networks: Foundations, Techniques and Frontiers is a valuable reference for practicing engineers as well as industry and academic researchers.