Results 1 - 10
of
66
Bayeux: An architecture for scalable and fault-tolerant wide-area data dissemination
, 2001
"... The demand for streaming multimedia applications is growing at an incredible rate. In this paper, we propose Bayeux, an efficient application-level multicast system that scales to arbitrarily large receiver groups while tolerating failures in routers and network links. Bayeux also includes specific ..."
Abstract
-
Cited by 363 (11 self)
- Add to MetaCart
The demand for streaming multimedia applications is growing at an incredible rate. In this paper, we propose Bayeux, an efficient application-level multicast system that scales to arbitrarily large receiver groups while tolerating failures in routers and network links. Bayeux also includes specific mechanisms for load-balancing across replicate root nodes and more efficient bandwidth consumption. Our simulation results indicate that Bayeux maintains these properties while keeping transmission overhead low. To achieve these properties, Bayeux leverages the architecture of Tapestry, a fault-tolerant, wide-area overlay routing and location network.
IP Multicast Channels: Express Support for Large-scale Single-source Applications
, 1999
"... In the IP multicast model, a set of hosts can be aggregated into a group of hosts with one address, to which any host can send. However, Internet TV, distance learning, file distribution and other emerging large-scale multicast applications strain the current realization of this model, which lacks a ..."
Abstract
-
Cited by 172 (4 self)
- Add to MetaCart
In the IP multicast model, a set of hosts can be aggregated into a group of hosts with one address, to which any host can send. However, Internet TV, distance learning, file distribution and other emerging large-scale multicast applications strain the current realization of this model, which lacks a basis for charging, lacks access control, and is difficult to scale. This paper proposes an extension to IP multicast to support the channel model of multicast and describes a specific realization called EXPlicitly REquested SingleSource (EXPRESS) multicast. In this model, a multicast channel has exactly one explicitly designated source, and zero or more channel subscribers. A single protocol supports both channel subscription and efficient collection of channel information such as subscriber count. We argue that EXPRESS addresses the aforementioned problems, justifying this multicast service model in the Internet.
Geocasting in Mobile Ad Hoc Networks: Location-Based Multicast Algorithms
, 1998
"... This paper addresses the problem of geocasting in mobile ad hoc network (MANET) environments. Geocasting is a variant of the conventional multicasting problem. For multicasting, conventional protocols define a multicast group as a collection of hosts which register to a multicast group address. Howe ..."
Abstract
-
Cited by 123 (3 self)
- Add to MetaCart
This paper addresses the problem of geocasting in mobile ad hoc network (MANET) environments. Geocasting is a variant of the conventional multicasting problem. For multicasting, conventional protocols define a multicast group as a collection of hosts which register to a multicast group address. However, for geocasting, the group consists of the set of all nodes within a specified geographical region. Hosts within the specified region at a given time form the geocast group at that time. We present two different algorithms for delivering packets to such a group, and present simulation results. 1 Introduction When an application must send the same information to more than one destination, multicasting is often used, because it is much more advantageous than multiple unicasts in terms of the communication costs. Cost considerations are all the more important for a mobile ad hoc network (MANET) consisting of mobile hosts that communicate with each other over wireless links, in the absence ...
AMRoute: Adhoc Multicast Routing Protocol
, 1999
"... The Adhoc Multicast Routing Protocol (AMRoute) presents a novel approach for robust IP Multicast in mobile adhoc networks by exploiting user-multicast trees and dynamic logical cores. It creates a bidirectional, shared tree for data distribution using only group senders and receivers as tree nodes. ..."
Abstract
-
Cited by 110 (0 self)
- Add to MetaCart
The Adhoc Multicast Routing Protocol (AMRoute) presents a novel approach for robust IP Multicast in mobile adhoc networks by exploiting user-multicast trees and dynamic logical cores. It creates a bidirectional, shared tree for data distribution using only group senders and receivers as tree nodes. Unicast tunnels are used as tree links to connect neighbors on the user-multicast tree.Thus, AMRoute does not need to be supported by network nodes that are not interested/capable of multicast, and group state cost is incurred only by group senders and receivers. Also, the use of tunnels as tree links implies that tree structure does not need to change even in case of a dynamic network topology, which reduces the signaling traffic and packet loss. Thus AMRoute does not need to track network dynamics; the underlying unicast protocol is solely responsible for this function. AMRoute does not require a specific unicast routing protocol; therefore, it can operate seamlessly over separate dom...
Adaptive demand-driven multicast routing in multi-hop wireless ad hoc networks
, 2001
"... The use of on-demand techniques in routing protocols for multihop wireless ad hoc networks has been shown to have significant advantages in terms of reducing the routing protocol’s overhead and improving its ability to react quickly to topology changes in the network. A number of on-demand multicast ..."
Abstract
-
Cited by 90 (2 self)
- Add to MetaCart
The use of on-demand techniques in routing protocols for multihop wireless ad hoc networks has been shown to have significant advantages in terms of reducing the routing protocol’s overhead and improving its ability to react quickly to topology changes in the network. A number of on-demand multicast routing protocols have been proposed, but each also relies on significant periodic (non-on-demand) behavior within portions of the protocol. This paper presents the design and initial evaluation of the Adaptive Demand-Driven Multicast Routing protocol (ADMR), a new ondemand ad hoc network multicast routing protocol that attempts to reduce as much as possible any non-on-demand components within the protocol. Multicast routing state is dynamically established and maintained only for active groups and only in nodes located between multicast senders and receivers. Each multicast data packet is forwarded along the shortest-delay path with multicast forwarding state, from the sender to the receivers, and receivers dynamically adapt to the sending pattern of senders in order to efficiently balance overhead and maintenance of the multicast routing state as nodes in the network move or as wireless transmission conditions in the network change. We describe the operation of the ADMR protocol and present an initial evaluation of its performance based on detailed simulation in ad hoc networks of 50 mobile nodes. We show that ADMR achieves packet delivery ratios within 1 % of a floodingbased protocol, while incurring half to a quarter of the overhead. 1.
REUNITE: A Recursive Unicast Approach to Multicast
- IN PROCEEDINGS OF IEEE INFOCOM’00, TEL AVIV
, 1999
"... We propose a new multicast protocol called REUNITE. The key idea of REUNITE is to use recursive unicast trees to implement multicast service. REUNITE does not use class D IP addresses. Instead, both group identification and data forwarding are based on unicast IP addresses. Compared with existing IP ..."
Abstract
-
Cited by 85 (2 self)
- Add to MetaCart
We propose a new multicast protocol called REUNITE. The key idea of REUNITE is to use recursive unicast trees to implement multicast service. REUNITE does not use class D IP addresses. Instead, both group identification and data forwarding are based on unicast IP addresses. Compared with existing IP multicast protocols, REUNITE has several unique properties. First, only routers that are acting as multicast tree branching points for a group need to keep multicast forwarding state of the group. All other non-branching-point routers simply forward data packets by unicast routing. In addition, REUNITE can be incrementally deployed in the sense that it works even if only a subset of the routers implement the protocol. Furthermore, REUNITE supports load balancing and graceful degradation such that when a router does not have resources (forwarding table entry, buffer space, processing power) to support additional multicast groups, the branching can be automatically migrated to other less load...
Key management for large dynamic groups: One-way function trees and amortized initialization
, 2000
"... ..."
Internet telephony: Architecture and protocols – an IETF perspective
- Computer Networks and ISDN Systems
, 1999
"... Internet telephony offers the opportunity to design a global multimedia communications system that may eventually replace the existing telephony infrastructure. We describe the upper-layer protocol components that are specific to Internet telephony services: the Real-Time Transport Protocol (RTP) to ..."
Abstract
-
Cited by 57 (20 self)
- Add to MetaCart
Internet telephony offers the opportunity to design a global multimedia communications system that may eventually replace the existing telephony infrastructure. We describe the upper-layer protocol components that are specific to Internet telephony services: the Real-Time Transport Protocol (RTP) to carry voice and video data, and the Session Initiation Protocol (SIP) for signaling. We also mention some complementary protocols, including the Real Time Streaming Protocol (RTSP) for control of streaming media, and the Wide Area Service Discovery Protocol (WASRV) for location of telephony gateways. 1
Forwarding State Reduction for Sparse Mode Multicast Communication
- Proceedings of IEEE INFOCOM
, 1998
"... Reducing forwarding state overhead of multicast routing protocols is an important issue towards a scalabile global multicast solution. In this paper, we propose a new approach, Dynamic Tunnel Multicast, which utilizes dynamically established tunnels on unbranched links of a multicast distribution tr ..."
Abstract
-
Cited by 31 (0 self)
- Add to MetaCart
Reducing forwarding state overhead of multicast routing protocols is an important issue towards a scalabile global multicast solution. In this paper, we propose a new approach, Dynamic Tunnel Multicast, which utilizes dynamically established tunnels on unbranched links of a multicast distribution tree to eliminate unnecessary multicast forwarding states. Analysis and simulation results show promising reduction in the state overhead of sparse mode multicast routing protocols. Keywords--- Multicast, Routing, State reduction, Dynamic tunnel. I. Introduction Multicast service can deliver packets to a set of destinations identified by a multicast group, rather than a single destination. The IP multicast model [3], established in 1988 by Stephen Deering, is an effort to provide multicast service over the Internet. In this model, neither the senders nor the receivers need to know the location of each other, and the membership can evolve dynamically. It is the responsibility of multicast rou...
An Agent-based Architecture for Advance Reservations
- Proceedings of the IEEE Conference on Computer Networks
, 1997
"... We propose an architecture where clients can make advance reservations through agents. For each routing domain in the network there will be an agent responsible for admission control on behalf of the routers in the domain. Requests involving several routing domains are forwarded for admission contro ..."
Abstract
-
Cited by 25 (5 self)
- Add to MetaCart
We propose an architecture where clients can make advance reservations through agents. For each routing domain in the network there will be an agent responsible for admission control on behalf of the routers in the domain. Requests involving several routing domains are forwarded for admission control with agents along the path for the requested service. Agents maintain hard reservation state using a reliable protocol for agent intercommunication. Agents start allocating resources for advance reservations in the routers by setting up forwarding state shortly before resources are needed for packet forwarding. Resources are made available for advance reservations by means of rejecting further immediate requests and ultimately by preempting some immediate reservations. We have shown that the risk of preemption can be kept very low. Thus, agents can set up packet classifiers and schedulers in their routers, allowing routers to get on with their main task, packet forwarding. 1 Introduction ...

