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
System for efficient multicast distribution in a virtual local area network environment
TL;DR: In this paper, a multicast network device (MND) is configured to generate at least one unique multicast (MVLAN) identifier (ID) for each group destination address, including all VLAN designations of the subscribing entities, except for the VLAN designation associated with the entity sourcing the message.
Proceedings ArticleDOI
A new multicasting-based architecture for Internet host mobility
TL;DR: This work investigates a new approach for supporting host mobility using IP multicasting as the sole mechanism for addressing and routing packets to mobile hosts, and shows that it is very effective in supporting seamless mobility for both hando s and interface changes within and across networks.
Proceedings ArticleDOI
Robust emulation of shared memory using dynamic quorum-acknowledged broadcasts
TL;DR: A robust emulation of multi-writer/multireader registers in message-passing systems using dynamic quorum configurations is presented, i.e., on-line replacements of one quorum system consisting of read and write quorums with another such system.
Journal ArticleDOI
Revisiting IP multicast
TL;DR: This paper proposes a new approach to implementing IP multicast that it hopes leads to a reevaluation of this commonly held view that the complexity of multicast routing can only be overcome by restricting the service model (as in single-source) multicast.
Journal ArticleDOI
Metascheduling for continuous media
TL;DR: The CM-resource model, described in this paper, provides a basis for a metascheduler, which uses an economic approach to dividing end-to-end delay, and it allows system components to “work ahead,” improving the performance of nonreal-time workload.
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.