scispace - formally typeset
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

Content maybe subject to copyright    Report

Citations
More filters
Proceedings ArticleDOI

SOM: spiral-fat-tree-based on-demand multicast protocol in a wireless ad-hoc network

TL;DR: The main advantage of spiral-fat-tree is to keep the stability of multicast tree, and the performance study shows that the proposed scheme outperforms the reactive tree-based and mesh-based multicast protocols existing in the ad-hoc network.
Journal ArticleDOI

Solving Multicast Problem in Cloud Networks Using Overlay Routing

TL;DR: A solution which includes a SDN framework and an algorithm to construct a degree-constrained overlay multicast routing tree is proposed which can deal with various multicast groups and it scales well with both group size and cloud size.

Fast Handover using Explicit Multicast for IPv7-based Wireless LAN Networks

Lei Li
TL;DR: This thesis proposes a new Xcast based scheme (X&M) to improve the deficiencies of Mobile IP (v4/v6) and proposes to two-level mobility for wireless LAN based on the study of network mobility.
Proceedings ArticleDOI

SHM: Scalable and Backbone Topology-Aware Hybrid Multicast

TL;DR: This paper proposes a novel hybrid multicast approach named SHM, which combining ALM and IP multicast to achieve ubiquitous multicast delivery and results show that SHM is able to provide more efficient multicast with less maintenance overhead, higher flexibility and reliability.
Book Chapter

TCP/IP on gigabit networks

Stephen Pink
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

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

J. Postel
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.