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
Patent
Content delivery network using edge-of-network servers for providing content delivery to a set of participating content providers
TL;DR: In this paper is a network architecture that supports hosting and content distribution on a truly global scale, allowing a Content Provider to replicate and serve its most popular content at an unlimited number of points throughout the world.
Proceedings ArticleDOI
Approximating optimal multicast trees in wireless multihop networks
TL;DR: It is shown that in multi-hop wireless mesh networks, a Steiner tree is no longer offering the lowest bandwidth consumption, so the problem is re-formulated in terms of minimizing the number of transmissions and heuristics to approximate such trees are proposed.
Proceedings ArticleDOI
A comparison of known classes of reliable multicast protocols
TL;DR: The maximum attainable throughput by the known classes of reliable multicast protocols is analyzed and it is shown that tree-based protocol constitute the most scalable class of all reliable multicasts protocols proposed to date.
Journal ArticleDOI
Scattercast: an adaptable broadcast distribution framework
TL;DR: This paper argues that an application-customizable hybrid overlay is well suited to meet challenges of scalable broadcasting, and proposes an architecture called scattercast that relies on a network of strategically located agents called ScatterCast proXies or SCXs that builds a customizable transport framework that provides adaptability.
Patent
Small group multicast in a computer network
TL;DR: In this article, a data structure is stored in memory of a router, the router located along a path between a source end station and a plurality of destination end stations in a multicast distribution tree.
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.