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
The use of multicast delivery to provide a scalable and interactive video-on-demand service
TL;DR: This work considers a VoD system that uses multicast delivery to service multiple customers with a single set of resources and describes a framework and mechanisms by which such interactive functions can be incorporated into a multicasts delivery VoD System.
Proceedings ArticleDOI
Achieving scalability and expressiveness in an Internet-scale event notification service
TL;DR: S.IENA's data model for notifications, the covering relations that formally define the semantics of the data model, the distributed architectures the authors have studied for the service's implementation, and the processing strategies developed to exploit the covering Relations for optimizing the routing of notifications are described.
Journal ArticleDOI
Implementing declarative overlays
TL;DR: P2, a system that uses a declarative logic language to express overlay networks in a highly compact and reusable form, is implemented and its promising trade-off point between specification complexity and performance is shown.
Journal ArticleDOI
Probabilistic reliable dissemination in large-scale systems
TL;DR: This paper provides a theoretical analysis of gossip-based protocols which relates their reliability to key system parameters (the system size, failure rates, and number of gossip targets) and shows how reliability can be maintained while alleviating drawback.
Patent
Location discovery in a data network
TL;DR: In this paper, a method for location discovery in a data network includes receiving, at a first device, connection information from a neighboring network device and determining a physical location of the first device based on the connection information.
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.