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
Interconnecting Federated Clouds by Using Publish-Subscribe Service
TL;DR: This paper proposes an interconnection solution for Cloud federations based on publish/subscribe services and discusses some fundamental concerns needed to satisfy the inter-Cloud communication requirements in terms of reliability and availability.
Journal ArticleDOI
The multicast packing problem
TL;DR: Algorithms, heuristics and lower bounds for an optimal sharing of network resources among several multicast groups that coexist in the network are presented and it is shown that the maximum congestion obtained by the heuristic method is quite close to the constructive lower bounds.
Proceedings ArticleDOI
Sharing the “cost” of multicast trees: an axiomatic analysis
TL;DR: This paper considers an axiomatic approach to the issue of cost allocation in the context of multicast flows, analyzing the implications of different distributive notions on the resulting allocations and investigating the family of allocation schemes such mechanisms can support.
Patent
Transparent redirection of resource requests
TL;DR: In this article, a plurality of repeater servers form a shared content delivery network (CDN) to serve resources to clients on behalf of plurality of content providers, and a CDN server is identified in the domain associated with the shared CDN to serve the second resource to the client.
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.