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
Dissertation
Admission control and routing: theory and practice
TL;DR: This thesis develops several non-greedy algorithms that out-perform greedy admission control algorithms that have already had a direct influence on the algorithms used in several commercial networks.
Proceedings ArticleDOI
Efficient setup for multicast connections using tree-caching
D.S.C. Kheong,Gang Feng +1 more
TL;DR: Through simulations, it is found that the proposed tree-caching strategy perform well and can significantly reduce the computation complexity for setting up multicast connections.
Configuration Challenges for Smart Spaces
TL;DR: It is argued that automatic configuration and resource discovery remains an important unsolved problem in smart-space deployment.
Proceedings ArticleDOI
Multicast routing tree for sequenced packet transmission in software-defined networks
TL;DR: Simulation results show that the SPSPT can save at least 10% of the multicast time for sequenced packet transmission, and it is proved that a routing path with less path cost does not correspond to less time cost when it is used to transmit multiple packets sequentially.
Journal Article
Constructing Delay-Bounded Multicast Trees in Computer Networks.
TL;DR: A distributed protocol for constructing delay-bounded minimum-cost multicast trees in computer networks that uses O(d∗n) messages that has lower message complexity than previous protocols, where d is the average nodal degree.
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.