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
Book ChapterDOI
Hierarchical multicast tree algorithms for application layer mesh networks
Weijia Jia,Wanqing Tu,Jie Wu +2 more
TL;DR: The extended simulation results indicate that the application layer multicast that is constructed by the proposed algorithms is efficient in terms of routing delay and link utilizations as compared with other well-known existing multicast solutions.
Proceedings ArticleDOI
Comparison of two middleware data dissemination services in a wide-area distributed system
TL;DR: An experimental comparison of two middleware data dissemination services: a distributed object based service, and a message based service is provided, which highlights the tradeoffs between ease of implementation and performance for a data streaming middleware service.
Journal ArticleDOI
Approximating k-hop minimum spanning trees in Euclidean metrics
Sören Laue,Domagoj Matijevic +1 more
TL;DR: In this article, the authors presented a polynomial-time approximation algorithm for the minimum-cost k-hop spanning tree (k-hop MST) problem for the plane.
Posted Content
The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree
TL;DR: In this paper, the authors considered the Steiner tree problem over a dynamic set of terminals, where the changes applied to the terminal set are either terminal additions (incremental scenario), terminal removals (decremental scenario) or both (fully dynamic scenario).
Journal ArticleDOI
Analysis of Performance of Dynamic Multicast Routing Algorithms
Jaihyung Cho,James Breen +1 more
TL;DR: In this article, three new dynamic multicast routing algorithms based on the greedy tree technique are proposed; Source Optimised Tree, Topology Based Tree and Minimum Diameter Tree, and a simulation analysis is presented showing various performance aspects of the algorithms, in which a comparison is made with the greedy and core based tree techniques.
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.