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
Proceedings ArticleDOI
A reliable multicast webcast protocol for multimedia collaboration and caching
TL;DR: A webcast design is described that improves upon previous designs by leveraging application level framing (ALF) design methodology and is built upon the Scalable Reliable Multicast (SRM) framework, which is based upon ALF, to create a custom protocol to meet webcast's scalability needs.
Book ChapterDOI
A Scalable and Robust Feedback Mechanism for Adaptive Multimedia Multicast Systems
TL;DR: The efficiency of the proposed feedback mechanism in eliminating the reply implosion problem, its robustness in facing loss es in the network, as well as its responsiveness are illustrated.
Book ChapterDOI
VND-CS: A Variable Neighborhood Descent Algorithm for Core Selection Problem in Multicast Routing Protocol
TL;DR: A new Core Selection CS algorithm based on Variable Neighborhood Descent algorithm, based on a systematic neighborhood changing, is proposed, which selects the core router by considering both cost and delay functions.
Proceedings ArticleDOI
Lossless asynchronous broadcast-with-feedback on the MetaNet architecture
Yoram Ofek,Moti Yung +1 more
TL;DR: Broadcast and broadcast-with-feedback are presented for MetaNet, a novel network architecture which can be viewed as a LAN with an arbitrary topology which is integrated into the routing mechanism such that it can coexist with any traffic pattern.
Journal ArticleDOI
Lazy flooding: a new technique for information dissemination in distributed network systems
TL;DR: A new flooding technique, called Lazy Flooding, is proposed; it significantly cuts down the number of floods and thus improves the data communication network response 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.