RMX: reliable multicast for heterogeneous networks

Chawathe, Yatin; McCanne, Steven; Brewer, Eric

doi:10.1109/infcom.2000.832254

Cited by 135 publications

(84 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Repair proxy can be set up as an exclusive server [1][2][3] or can be designated among adequate receivers [4,5].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Improving inter-destination synchronization in hierarchical reliable multicast

Byun

2008

Telecommun Syst

View full text Add to dashboard Cite

In hierarchical reliable multicast schemes, the number of repair proxies and their locations influence interdestination synchronization. The inter-destination synchronization in multicast environments means the adjustment of the output timing among destinations over the Internet. Improving the inter-destination synchronization is beneficial to collaborative applications such as multi-conference system and multi-playing online game. In this paper, we propose a scheme to find the optimal locations of repair proxies that can improve inter-destination synchronization maximally in heterogeneous network environments. The simulation results show that if repair proxies are placed by the proposed scheme, delivery delay fairness of inter-destination can be improved by 0.05 maximally. In addition, we perform t-Test on the simulation results in order to verify that our optimal placement improves synchronization.

show abstract

“…Repair proxy can be set up as an exclusive server [1][2][3] or can be designated among adequate receivers [4,5].…”

Section: Introductionmentioning

confidence: 99%

“…1 The inter-destination synchronization can be referred to the inter-destination fairness of delivery delay between a source and each destination. The fairness is measured to estimate the diversity of delivery delays between a source and each destination.…”

Section: Introductionmentioning

confidence: 99%

Improving inter-destination synchronization in hierarchical reliable multicast

Byun

2008

Telecommun Syst

View full text Add to dashboard Cite

show abstract

“…Although a tremendous amount of work was done in the area of group communication and multicast protocols, deployment problems have limited the availability of this technology in commercial networks. Few carriers provide a commercial multicast service nowadays, and alternative solutions have emerged such as CDN (content distribution networks [18]) or application-level multicast [19][20][21]. Therefore, it is important to provide tools to properly design, manage and configure multicast networks and protocols.…”

Section: Introductionmentioning

confidence: 99%

A model of periodic acknowledgement

Brandwajn

2003

Performance Evaluation

View full text Add to dashboard Cite

We study a problem abstracted from modeling a multicast protocol. In our model, messages generated by a single source are simultaneously forwarded to a set of receivers where they are independently processed. We assume a state-dependent message arrival rate and memoryless service time distributions. The receivers may process messages at different average rates. Messages processed by all receivers are periodically acknowledged and cleared from the system. Due to finite buffer space, the total number of non-acknowledged messages in the system is limited. Our focus in this paper is on the number of messages cleared at acknowledgement time.The problem under consideration bears resemblance to a fork/join process with heterogeneous servers, used in the study of multiprocessing computer systems. Our model includes the additional features of finite buffer space and delayed periodic departure of completed jobs. Even without these features, the resulting type of queuing model has no known closed-form solution in the general case of more than two servers. Because the arrival processes to the servers are correlated, the model is difficult to decompose. We propose a relatively simple decomposition technique and a fixed-point iteration scheme. In our approach, we consider each receiver (server) in isolation, and we account for the influence of other receivers through the probability that a given number of messages can be cleared at acknowledgement time. We derive elementary differential equations for the number of messages processed by a receiver. These equations involve the conditional probability of the number of messages not yet processed given the number of messages waiting to be cleared. We compute an approximate solution using the conditional probability obtained from a model with exponentially distributed acknowledgement periods. Our numerical results for the average number of messages cleared at acknowledgment time are typically within a few percent of simulation midpoints.

show abstract

“…Studies to date in the area of application layer multicast have been mostly experimental in nature for both end-system multicast [8], [7], [6], [17] and Proxy-Based Multicast [14], [1], [13]. The experimental work that relates most closely to our theoretical work here is the recent work of Chu et al [7] that uses a heuristic called Bandwidth-Latency to build the multicast overlay tree.…”

Section: Related Workmentioning

confidence: 99%

“…One variant, known as End-System Multicast (ESM), forms the overlay out of the very network end-systems that wish to receive the broadcast [8], [7], [6]. These end-systems connect together over unicast channels to form a multicast tree, rooted at the transmission source in which the end-systems are the nodes and the unicast channels are the edges.…”

mentioning

confidence: 99%

A graph theoretic approach to bounding delay in proxy-assisted, end-system multicast

Malouch

Liu

Rubenstein

et al.

IEEE 2002 Tenth IEEE International Workshop on Quality of Service (Cat. No.02EX564)

View full text Add to dashboard Cite

Abstract-End-system multicast provides a low-cost solution to scalably broadcast information to groups of users. However, lastmile bandwidth limitations constrain tree fanouts leading to high end-to-end delivery delays. These delays can be reduced if the network provides forwarding proxies with high fanout capabilities at an additional cost. We use simple graph theoretic network models to explore the problem of building hybrid proxy/end-system application layer multicast trees that meet fixed end-to-end delay bounds. Our goal is to meet a fixed delay bound while minimizing costs associated with the utilization of proxies. We provide an algorithm and formally prove its optimality in a fully-connected overlay network with uniform-length edges. We then adapt this algorithm into a heuristic and evaluate the heuristic for simulated transit-stub networks with variable-delay edges. We compare our heuristic in a proxy-free environment to previously developed heuristics and show that our heuristic typically yields further reductions in the maximum session end-to-end delay.

show abstract

RMX: reliable multicast for heterogeneous networks

Cited by 135 publications

References 23 publications

Improving inter-destination synchronization in hierarchical reliable multicast

Improving inter-destination synchronization in hierarchical reliable multicast

A model of periodic acknowledgement

A graph theoretic approach to bounding delay in proxy-assisted, end-system multicast

Contact Info

Product

Resources

About