Distributed Algorithms for Multicast Routing

Carlos A. S. Oliveira () and Panos M. Pardalos ()
Additional contact information
Carlos A. S. Oliveira: Bloomberg LP
Panos M. Pardalos: University of Florida

Chapter Chapter 5 in Mathematical Aspects of Network Routing Optimization, 2011, pp 57-64 from Springer

Abstract: Abstract In the previous chapters, we discussed sequential algorithms for multicast routing generation. These algorithms have the ability to process information from a network, including nodes participating in a multicast group. With this information, such algorithms provide a complete solution for the problem, which can be used by network operators to determine the routes to be followed to reach each of the destinations.

Date: 2011
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-1-4614-0311-1_5

Ordering information: This item can be ordered from
http://www.springer.com/9781461403111

DOI: 10.1007/978-1-4614-0311-1_5

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().