A Primer of Multicast Routing
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 s
- PDF / 3,212,016 Bytes
- 128 Pages / 439.37 x 666.14 pts Page_size
- 15 Downloads / 208 Views
Series Editors Stan Zdonik Peng Ning Shashi Shekhar Jonathan Katz Xindong Wu Lakhmi C. Jain David Padua Xuemin Shen Borko Furht VS Subrahmanian
For further volumes: http://www.springer.com/series/10028
Eric Rosenberg
A Primer of Multicast Routing
Eric Rosenberg AT&T Labs Middletown, NJ, USA [email protected]
ISSN 2191-5768 e-ISSN 2191-5776 ISBN 978-1-4614-1872-6 e-ISBN 978-1-4614-1873-3 DOI 10.1007/978-1-4614-1873-3 Springer New York Dordrecht Heidelberg London Library of Congress Control Number: 2011946218 ¤ The Author 2012 All rights reserved. This work may not be translated or copied in whole or in part without the written permission of the publisher (Springer Science+Business Media, LLC, 233 Spring Street, New York, NY 10013, USA), except for brief excerpts in connection with reviews or scholarly analysis. Use in connection with any form of information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed is forbidden. The use in this publication of trade names, trademarks, service marks, and similar terms, even if they are not identified as such, is not to be taken as an expression of opinion as to whether or not they are subject to proprietary rights. Printed on acid-free paper Springer is part of Springer Science+Business Media (www.springer.com)
Preface This is an introduction to multicast routing, which is the study of methods for routing from one source to many destinations, or from many sources to many destinations. Multicast is increasingly important in telecommunications, for such applications as software distribution, video on demand, and file transfers. The intended audience of this primer includes • telecommunication network designers and architects, • researchers in telecommunications and optimization, • upper class undergraduate students, and graduate students, studying computer science, electrical engineering, or operations research. We assume the reader is familiar with computing a shortest path in a network, e.g, by Dijkstra’s method. No prior knowledge of telecommunications or routing protocols is assumed, although it will undoubtedly make the reading easier. Although a few of the mathematical results are quite deep, they are presented without proof (but with references to the literature), and can be skipped with no loss of understanding of subsequent sections. Both obsolete and currently used methods are examined, in order to prevent researchers from reinventing previously proposed methods, and to provide insight into why some methods did become obsolete. The reference list has over 100 entries. It would not be difficult to find another 100 papers worthy of review or mention. In particular, several areas of multicast are quite active, including wireless multicast, label switched multicast, and aggregated multicast. The selection of papers for this primer naturally reflects both space considerations and the author’s own interests. In addition to the usual journals and conference proceedings, the IETF web site i
Data Loading...
