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 set of destinations is static, and for when it...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριος συγγραφέας: Rosenberg, Eric (Συγγραφέας)
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Boston, MA : Springer US, 2012.
Σειρά:SpringerBriefs in Computer Science,
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 02626nam a22004575i 4500
001 978-1-4614-1873-3
003 DE-He213
005 20151204171229.0
007 cr nn 008mamaa
008 120116s2012 xxu| s |||| 0|eng d
020 |a 9781461418733  |9 978-1-4614-1873-3 
024 7 |a 10.1007/978-1-4614-1873-3  |2 doi 
040 |d GrThAP 
050 4 |a TK5105.5-5105.9 
072 7 |a UKN  |2 bicssc 
072 7 |a COM075000  |2 bisacsh 
082 0 4 |a 004.6  |2 23 
100 1 |a Rosenberg, Eric.  |e author. 
245 1 2 |a A Primer of Multicast Routing  |h [electronic resource] /  |c by Eric Rosenberg. 
264 1 |a Boston, MA :  |b Springer US,  |c 2012. 
300 |a X, 117 p. 58 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a SpringerBriefs in Computer Science,  |x 2191-5768 
505 0 |a 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. 
520 |a 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. 
650 0 |a Computer science. 
650 0 |a Computer communication systems. 
650 0 |a Electrical engineering. 
650 1 4 |a Computer Science. 
650 2 4 |a Computer Communication Networks. 
650 2 4 |a Communications Engineering, Networks. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9781461418726 
830 0 |a SpringerBriefs in Computer Science,  |x 2191-5768 
856 4 0 |u http://dx.doi.org/10.1007/978-1-4614-1873-3  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
950 |a Computer Science (Springer-11645)