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
Proceedings ArticleDOI
IRLSim: a general purpose packet level network simulator
TL;DR: The architecture of IRLSim is described in detail, its use in the study of a few specific networking problems is presented, and it is argued about its usefuless amongst the variety of other simulators.
Posted Content
Decentralizing Authorities into Scalable Strongest-Link Cothorities.
TL;DR: It is found that cothorities can scale to support over 4000 widely-distributed participants while keeping collective signing latencies to within a few seconds, and embodying "strongest-link" trust aggregated over the collective.
Scalable location management for geographic routing in mobile ad hoc networks
Chunming Qiao,Sumesh J. Philip +1 more
TL;DR: This research introduces a novel location management protocol known as Scalable Location Management (SLALoM), which outlines a scheme for partitioning a given terrain into ordered regions for location management and proposes a novel grid ordering scheme known as Hierarchical Grid location Management (HGRID), which yields only a logarithmic increase in the location update cost with respect to the number of nodes.
Journal ArticleDOI
Supply Chain Management with Online Customer Selection
Adam N. Elmachtoub,Retsef Levi +1 more
TL;DR: Two novel algorithms for online customer selection problems, which are based on repeatedly solving offline subproblems that ignore previously made decisions, are provided, which achieve small constant competitive ratio guarantees.
Proceedings ArticleDOI
Comparison study and evaluation of overlay multicast networks
Yan Zhu,Min-You Wu,Wei Shu +2 more
TL;DR: Four typical implementations of overlay multicast are compared: Scattercast, Narada, overcast and ALMI, and several metrics are compared which are applicable to these projects, including relative delay penalty, normalized resource usage and stress.
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.