Journal ArticleDOI
Multicast routing in datagram internetworks and extended LANs
TLDR
In this paper, the authors specify extensions to two common internetwork routing algorithms (distancevector routing and link-state routing) to support low-delay datagram multicasting beyond a single LAN, and discuss how the use of multicast scope control and hierarchical multicast routing allows the multicast service to scale up to large internetworks.Abstract:
Multicasting, the transmission of a packet to a group of hosts, is an important service for improving the efficiency and robustness of distributed systems and applications. Although multicast capability is available and widely used in local area networks, when those LANs are interconnected by store-and-forward routers, the multicast service is usually not offered across the resulting internetwork. To address this limitation, we specify extensions to two common internetwork routing algorithms—distance-vector routing and link-state routing—to support low-delay datagram multicasting beyond a single LAN. We also describe modifications to the single-spanning-tree routing algorithm commonly used by link-layer bridges, to reduce the costs of multicasting in large extended LANs. Finally, we discuss how the use of multicast scope control and hierarchical multicast routing allows the multicast service to scale up to large internetworks.read more
Citations
More filters
An efficient delay-constrained minimum spanning tree heuristic
TL;DR: This work proposes an efficient heuristic to solve the problem of constructing broadcast trees for real-time traffic with delay constraints in networks with asymmetric link loads as a delay-constrained minimum spanning tree (DCMST) problem in directed networks and proves that this problem is NP-complete.
Proceedings ArticleDOI
Optimal packing of group multicastings
Shiwen Chen,O. Gunluk,B. Yener +2 more
TL;DR: Algorithms, heuristics and lower bounds addressing optimization issues in many-to-many multicasting, and a heuristic for the underlying optimization problem that aims to accommodate multiple multicast groups while avoiding bottlenecks on the links for higher throughput are presented.
Book ChapterDOI
Steiner Tree Based Distributed Multicast Routing in Networks
TL;DR: The problem of routing multicast connections in networks is often viewed as a minimum Steiner tree problem in graphs, with additional constraints raised by the specifics of the communication network environments.
Journal ArticleDOI
Toward integrating IP multicasting in internet network management protocols
Ehab Al-Shaer,Yongning Tang +1 more
TL;DR: This paper presents a highly flexible, efficient and easy-to-integrate framework for integrating IP Multicast in standard SNMP agents that exploits the advantages of IP multicasting without requiring any significant changes or performance overhead in the protocol or the agent architecture.
Journal ArticleDOI
Fair distributed congestion control in multirate multicast networks
TL;DR: A distributed algorithm for computing the maxmin fair rates allocated to various source-destination pairs is proposed, which has a low message exchange overhead, and is guaranteed to converge to the maximum fair rates in finite time.
References
More filters
Book
Dynamic Programming
TL;DR: The more the authors study the information processing aspects of the mind, the more perplexed and impressed they become, and it will be a very long time before they understand these processes sufficiently to reproduce them.
Book
Flows in networks
D. R. Ford,D. R. Fulkerson +1 more
TL;DR: Ford and Fulkerson as mentioned in this paper set the foundation for the study of network flow problems and developed powerful computational tools for solving and analyzing network flow models, and also furthered the understanding of linear programming.
Journal ArticleDOI
Flows in Networks.
TL;DR: The techniques presented by Ford and Fulkerson spurred the development of powerful computational tools for solving and analyzing network flow models, and also furthered the understanding of linear programming.
Book
Data Structures and Algorithms
TL;DR: The basis of this book is the material contained in the first six chapters of the earlier work, The Design and Analysis of Computer Algorithms, and has added material on algorithms for external storage and memory management.
Internet Protocol
TL;DR: Along with TCP, IP represents the heart of the Internet protocols and has two primary responsibilities: providing connectionless, best-effort delivery of datagrams through an internetwork; and providing fragmentation and reassembly of data links to support data links with different maximum transmission unit (MTU) sizes.