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
Journal ArticleDOI
MobiCast: a multicast scheme for wireless networks
Cheng Lin Tan,Stephen Pink +1 more
TL;DR: Measurements show that the proposed multicast scheme, known as MobiCast, is effective in minimizing disruptions to a multicast session due to the handoffs of the mobile group member, as well as reducing packet loss when a mobile host crosses cell boundaries during a multicasts session.
Journal ArticleDOI
A rearrangeable algorithm for the construction of delay-constrained dynamic multicast trees
TL;DR: The simulation results indicate that the CRCDM algorithm provides excellent cost-competitiveness that is better than that provided by the algorithm described by Hong et al., minimizes changes in the multicast tree after each update, and performs favorably even when compared with the unconstrained ARIES heuristic.
Journal ArticleDOI
A preservation-based multicast (RBM) routing protocol for mobile networks: initial route construction phase
TL;DR: This paper focuses on the initial route construction phase, assumed to occur during a static “snapshot” of the dynamic topology, and is therefore applicable to fixed networks as well, e.g. the Internet.
Routing and multicasting strategies in wireless mobile ad hoc networks
Sung-Ju Lee,Mario Gerla +1 more
TL;DR: This study shows that on-demand protocols are better suited for mobile networks because they generate less control overhead and manage the mobility in a more efficient manner and presents the On-Demand Multicast Routing Protocol, a novel multicasting scheme that utilizes a mesh structure.
Proceedings ArticleDOI
Network text editor (NTE): A scalable shared text editor for the MBone
Mark Handley,Jon Crowcroft +1 more
TL;DR: This paper uses IP Multicast, Lightweight Sessions and Application Level Framing design principles to guide the design of a multicast based shared editor, and examines the consequences of taking a loose consistency approach to achieve good performance in the face of network failures and losses.
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.