Results 11 - 20
of
534
A quantitative comparison of graph-based models for internet topology
- IEEE/ACM TRANSACTIONS ON NETWORKING
, 1997
"... Graphs are commonly used to model the topological structure of internetworks, to study problems ranging from routing to resource reservation. A variety of graphs are found in the literature, including fixed topologies such as rings or stars, "well-known" topologies such as the ARPAnet, and ..."
Abstract
-
Cited by 265 (3 self)
- Add to MetaCart
Graphs are commonly used to model the topological structure of internetworks, to study problems ranging from routing to resource reservation. A variety of graphs are found in the literature, including fixed topologies such as rings or stars, "well-known" topologies such as the ARPAnet, and randomly generated topologies. While many researchers rely upon graphs for analytic and simulation studies, there has been little analysis of the implications of using a particular model, or how the graph generation method may a ect the results of such studies. Further, the selection of one generation method over another is often arbitrary, since the differences and similarities between methods are not well understood. This paper considers the problem of generating and selecting graph models that reflect the properties of real internetworks. We review generation methods in common use, and also propose several new methods. We consider a set of metrics that characterize the graphs produced by a method, and we quantify similarities and differences amongst several generation methods with respect to these metrics. We also consider the effect of the graph model in the context of a speciffic problem, namely multicast routing.
On-Demand Multicast Routing Protocol
, 2002
"... This paper presents a novel multicast routing protocol for mobile ad hoc wireless networks. The protocol, termed ODMRP (On-Demand Multicast Routing Protocol), is a mesh-based, rather than a conventional treebased, multicast scheme and uses a forwarding group concept (only a subset of nodes forwards ..."
Abstract
-
Cited by 257 (22 self)
- Add to MetaCart
This paper presents a novel multicast routing protocol for mobile ad hoc wireless networks. The protocol, termed ODMRP (On-Demand Multicast Routing Protocol), is a mesh-based, rather than a conventional treebased, multicast scheme and uses a forwarding group concept (only a subset of nodes forwards the multicast packets via scoped flooding). It applies on-demand procedures to dynamically build routes and maintain multicast group membership. ODMRP is well suited for ad hoc wireless networks with mobile hosts where bandwidth is limited, topology changes frequently, and power is constrained. We evaluate ODMRP's scalability and performance via simulation.
The Core-Assisted Mesh Protocol
"... The Core-Assisted Mesh Protocol (CAMP) is introduced for multicast routing in ad-hoc networks. CAMP generalizes the notion of core-based trees introduced for internet multicasting into multicast meshes that have much richer connectivity than trees. A shared multicast mesh is defined for each multica ..."
Abstract
-
Cited by 226 (4 self)
- Add to MetaCart
The Core-Assisted Mesh Protocol (CAMP) is introduced for multicast routing in ad-hoc networks. CAMP generalizes the notion of core-based trees introduced for internet multicasting into multicast meshes that have much richer connectivity than trees. A shared multicast mesh is defined for each multicast group; the main goal of using such meshes is to maintain the connectivity of multicast groups even while network routers move frequently. CAMP consists of the maintenance of multicast meshes and loop-free packet forwarding over such meshes. Within the multicast mesh of a group, packets from any source in the group are forwarded along the reverse shortest path to the source, just as in traditional multicast protocols based on source-based trees. CAMP guarantees that, within a finite time, every receiver of a multicast group has a reverse shortest path to each source of the multicast group. Multicast packets for a group are forwarded along the shortest paths from sources to receivers defined within the group's mesh. CAMP uses cores only to limit the traffic needed for a router to join a multicast group; the failure of cores does not stop packet forwarding or the process of maintaining the multicast meshes.
A Performance Comparison Study of Ad Hoc Wireless Multicast Protocols
, 2000
"... In this paper we investigate the performance of multicast routing protocols in wireless mobile ad hoc networks. An ad hoc network is composed of mobile nodes without the presence of a wired support infrastructure. In this environment, routing/multicasting protocols are faced with the challenge of pr ..."
Abstract
-
Cited by 197 (16 self)
- Add to MetaCart
(Show Context)
In this paper we investigate the performance of multicast routing protocols in wireless mobile ad hoc networks. An ad hoc network is composed of mobile nodes without the presence of a wired support infrastructure. In this environment, routing/multicasting protocols are faced with the challenge of producing multihop routes under host mobility and bandwidth constraints. In recent years, a number of new multicast protocols of different styles have been proposed for ad hoc networks. However, systematic performance evaluations and comparative analysis of these protocols in a common realistic environment has not yet been performed. In this study, we simulate a set of representative wireless ad hoc multicast protocols and evaluate them in various network scenarios. The relative strengths, weaknesses, and applicability of each multicast protocol to diverse situations are studied and discussed.
On-Demand Multicast Routing Protocol in Multihop Wireless Mobile Networks
, 2001
"... This paper presents the On-Demand Multicast Routing Protocol (ODMRP) for wireless mobile ad ..."
Abstract
-
Cited by 189 (13 self)
- Add to MetaCart
(Show Context)
This paper presents the On-Demand Multicast Routing Protocol (ODMRP) for wireless mobile ad
Resilient Peer-to-Peer Streaming
- IN PROC. OF IEEE ICNP
, 2003
"... We consider the problem of distributing "five" streaming media content to a potentially large and highly dynamic population of hosts. Peer-to-peer content distribution is attractive in this setting because the bandwidth available to serve content scales with demand. A key challenge, howeve ..."
Abstract
-
Cited by 182 (4 self)
- Add to MetaCart
(Show Context)
We consider the problem of distributing "five" streaming media content to a potentially large and highly dynamic population of hosts. Peer-to-peer content distribution is attractive in this setting because the bandwidth available to serve content scales with demand. A key challenge, however, is making content distribution robust to peer transience. Our approach to providing robustness is to introduce redundancy, both in network paths and in data. We use multiple, diverse distribution trees to provide redundancy in network paths and multiple description coding (MDC) to provide redundancy in data. We present
Layered Video Multicast with Retransmissions (LVMR): Evaluation of Hierarchical Rate Control
, 1997
"... Layered Video Multicast with Retransmissions (LVMR) is a system for distributing video using layered coding over the Internet. The two key contributions of the system are: (1) improving the quality of reception within each layer by retransmitting lost packets given an upper bound on recovery time ..."
Abstract
-
Cited by 177 (12 self)
- Add to MetaCart
Layered Video Multicast with Retransmissions (LVMR) is a system for distributing video using layered coding over the Internet. The two key contributions of the system are: (1) improving the quality of reception within each layer by retransmitting lost packets given an upper bound on recovery time and applying an adaptive playback point scheme to help achieve more successful retransmission, and (2) adapting to network congestion and heterogeneity using hierarchical rate control mechanism. This paper concentrates on the rate control aspects of LVMR. In contrast to the existing sender-based and receiver-based rate control in which the entire information about network congestion is either available at the sender (in sender-based approach) or replicated at the receivers (in receiver-based approach), the hierarchical rate control mechanism distributes the information between the sender, receivers, and some agents in the network in such a way that each entity maintains only the info...
A Better Model for Generating Test Networks
, 1996
"... Much of the work on routing algorithms, particularly for multicast, which has been done in the past has used fairly simple models to generate the topological graph which represents the nodes in the network. Some such random graphs bear little resemblance to data communication networks which are actu ..."
Abstract
-
Cited by 177 (1 self)
- Add to MetaCart
Much of the work on routing algorithms, particularly for multicast, which has been done in the past has used fairly simple models to generate the topological graph which represents the nodes in the network. Some such random graphs bear little resemblance to data communication networks which are actually deployed. This paper proposes a more realistic model for such random networks and describes various scenarios which can be more accurately represented. The approach described here can be developed to provide more refined models in the future, and the source code of an implementation is freely available. 1.0 INTRODUCTION One of the major areas of interest in recent routing research has been how to route multicast packets in a connection-oriented network such as an IP network, and similarly, how to set up multicast connections in a connection-oriented network, such as an ATM network. Many algorithms have been described in the literature. Some produce an optimal solution [Karp72] but many...
An Evaluation of Scalable Application-Level Multicast Built Using Peer-to-Peer Overlays
- In Infocom’03
, 2003
"... Structured peer-erg163 overlay networks such as CAN, Chord, Pastry, and Tapestry can be used to implement Internet-g683 application-3 vel multicast. There are two general approaches to accomplishingthis: tree buildingand flooding. This paper evaluates these two approaches usingtwo different types of ..."
Abstract
-
Cited by 166 (14 self)
- Add to MetaCart
(Show Context)
Structured peer-erg163 overlay networks such as CAN, Chord, Pastry, and Tapestry can be used to implement Internet-g683 application-3 vel multicast. There are two general approaches to accomplishingthis: tree buildingand flooding. This paper evaluates these two approaches usingtwo different types of structured overlay: 1) overlays which use a form of generalized hypercube routing, e.g., Chord, Pastry and Tapestry, and 2) overlays which use a numerical distance metric to route through a Cartesian hyper-erg15 e.g., CAN. Pastry and CAN are chosen as the representatives of each type of overlay. To the best of our knowledge, this paper reports the firstheadto -d- comparison ofCAN-B91g versus Pastry-gZ4B overlay networks, usingmulticast communication workloads runningon an identical simulation infrastructure. The two approaches to multicast are independent of overlay network choice, and we provide a comparison of floodingversus tree-2696 multicast on both overlays. Results show that the tree-2613 approach consistently outperforms the floodingapproach. Finally, for treebased multicast, we show that Pastry provides better performance than CAN.
Protocol independent multicast-sparse mode (PIM-SM): Protocol specification
, 1998
"... This memo defines an Experimental Protocol for the Internet community. This memo does not specify an Internet standard of any kind. Discussion and suggestions for improvement are requested. Distribution of this memo is unlimited. Acknowledgements The author list has been reordered to reflect the inv ..."
Abstract
-
Cited by 163 (13 self)
- Add to MetaCart
(Show Context)
This memo defines an Experimental Protocol for the Internet community. This memo does not specify an Internet standard of any kind. Discussion and suggestions for improvement are requested. Distribution of this memo is unlimited. Acknowledgements The author list has been reordered to reflect the involvement in detailed editorial work on this specification document. The first four authors are the primary editors and are listed alphabetically. The rest of the authors, also listed alphabetically, participated in all aspects of the architectural and detailed design but managed to get away without hacking the latex! Estrin, et. al. Experimental [Page 1] RFC 2117 PIM-SM June 1997 Introduction This document describes a protocol for efficiently routing to multicast groups that may span wide-area (and inter-domain) internets. We refer to the approach as Protocol Independent Multicast--Sparse Mode (PIM-SM) because it is not dependent on any particular unicast routing protocol, and because it is designed to support sparse groups as defined in [1][2]. This document describes the protocol details. For the motivation behind the design and a description of the architecture, see [1][2]. Section 2 summarizes PIM-SM operation. It describes the protocol from a network perspective, in particular, how the participating routers interact to create and maintain the multicast distribution tree. Section 3 describes PIM-SM operations from the perspective of a single router implementing the protocol; this section constitutes the main body of the protocol specification. It is organized according to PIM-SM message type; for each message type we describe its contents, its generation, and its processing. Sections 3.8 and 3.9 summarize the timers and flags referred to throughout this document. Sectio...
