Show simple item record

dc.contributor.authorRosenberg, Ericen_US
dc.date.accessioned2017-08-02T02:13:49Z
dc.date.available2017-08-02T02:13:49Z
dc.date.issued2012en_US
dc.identifier.isbn1461418720en_US
dc.identifier.isbn9781461418726en_US
dc.identifier.otherHPU5160353en_US
dc.identifier.urihttps://lib.hpu.edu.vn/handle/123456789/26326
dc.description.abstractWhereas 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.en_US
dc.format.extent128 p.en_US
dc.format.mimetypeapplication/pdfen_US
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.subjectMulticast Routingen_US
dc.subjectBasic algorithmic principlesen_US
dc.subjectMathematical modelsen_US
dc.titleA Primer of Multicast Routingen_US
dc.typeBooken_US
dc.size3,020Kben_US
dc.departmentTechnologyen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record