Whereas unicast routing determines a path from one source node to one destination node, multicast routing determines a path from one source to many destinations, or from many sources to many destinations. We survey multicast routing methods for when the set of destinations is static, and for when it is dynamic. While most of the methods we review are tree based, some non-tree methods are also discussed. We survey results on the shape of multicast trees, delay constrained multicast routing, aggregation of multicast traffic, inter-domain multicast, and multicast virtual private networks. We focus on basic algorithmic principles, and mathematical models, rather than implementation level protocol details. Many historically important methods, even if not currently used, are reviewed to give perspective on the evolution of multicast routing.
Reviews / Votes
From the reviews:
"Rosenberg provides an overview of multicast routing, a technique that is very useful yet not easily deployable on a large scale in today's networks. . The book includes a list of acronyms and an extensive set of references. . Therefore, the readers most likely to benefit from it are . multicast researchers, routing specialists, network developers, and graduate students interested in the topic." (Rita Puzmanova, ACM Computing Reviews, January, 2013)
"The overall plan of the book is excellent, starting with a basic overview of what multicast is (and does), including why multicast is more efficient than unicast for multiple receiver traffic streams, and the difference between broadcasting by flooding and the general concept of multicast. Eric builds on this foundation with a chapter on the various types of multicast trees (shared, source, and redundant), along with the accompanying math...If you need a refresher, or you're looking for a good solid overview of the entire multicast space, you'd be hard pressed to find a better book that this one." (Russ White, Packet Pushers, May, 2013)
Series
Edition
Language
Place of publication
Target group
Professional and scholarly
Professional/practitioner
Illustrations
5 s/w Tabellen, 58 Abbildungen
X, 117 p. 58 illus.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 8 mm
Weight
ISBN-13
978-1-4614-1872-6 (9781461418726)
DOI
10.1007/978-1-4614-1873-3
Schweitzer Classification
Eric Rosenberg has taught undergraduate and graduate courses in modelling and optimization at Princeton University, New Jersey Institute of Technology, and Rutgers University. He recently retired from AT&T Labs in Middletown, New Jersey, and has joined the faculty of Georgian Court University in Lakewood, New Jersey.
He received a B.A. in Mathematics from Oberlin College and a Ph.D. in Operations Research from Stanford University, and has authored or co-authored 19 patents and has published in the areas of convex analysis and nonlinearly constrained optimization, computer aided design of integrated circuits and printed wire boards, telecommunications network design and routing, and fractal dimensions of networks.
Dr. Rosenberg is the author of A Primer of Multicast Routing, and A Survey of Fractal Dimensionsof Networks, both published by Springer.
New research and applications relating to fractal dimensions of networks can be sent to Dr. Rosenberg at FractalDimensionsOfNetworks@gmail.com.
What is Multicast Routing?.- Basic Concepts in Tree Based Methods.- Dynamic Routing Methods.- Other Multicast Routing Methods.- Inter-domain and Two-level Multicast.- Aggregate Multicast Trees.- Multicast Virtual Private Networks.- References.
