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

Malouch, Naceur; Liu, Zhen; Rubenstein, Dan; Sahu, Sambit

doi:10.1109/iwqos.2002.1006579

Cited by 29 publications

(23 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We also compare these results with the delay achieved by the algorithm in [27], which builds a MinSum-delay multicast tree with bounded degrees-the closest work in the literature to our MinSum algorithms, to the best of our knowledge. We run a binary search to find the best degree bound value for this algorithm, though in our running time measurements presented shortly we only measure the time taken by one run of the algorithm (not the multiple times done in the binary search).…”

Section: B Resultsmentioning

confidence: 99%

“…Ito et al [28] analyzed several forms of the multicast tree problem, and showed that it is NP-Complete to find various forms of degreebounded trees, such as one with minimum total distance or one with minimum distance to the farthest receiver. Heuristic algorithms for constructing degree-bounded multicast trees [14], [27] and degreebounded minimum-diameter spanning trees [24], [29] have been proposed. However, it is not clear how these degree bounds are selected in practice; for instance, a fixed bound of 10 is used in [29].…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Minimum-delay overlay multicast

Mokhtarian

Jacobsen

2013

2013 Proceedings IEEE INFOCOM

View full text Add to dashboard Cite

Delivering delay-sensitive data to a group of receivers with minimum latency is a fundamental problem for various applications. In this paper, we study multicast routing with minimum end-to-end delay to the receivers. The delay to each receiver in a multicast tree consist of the time that the data spends in overlay links as well as the latency incurred at each overlay node, which has to send out a piece of data several times over a finite-capacity network connection. The latter portion of the delay, which is proportional to the degree of nodes in the tree, can be a significant portion of the total delay as we show in the paper. Yet, it is often ignored or only partially addressed by previous multicast algorithms. We formulate the actual delay to the receivers in a multicast tree and consider minimizing the average and the maximum delay in the tree. We show the NP-hardness of these problems and prove that they cannot be approximated in polynomial time to within any reasonable approximation ratio.We then propose a number of efficient algorithms that heuristically build a multicast tree in which the average or the maximum delay is minimized. These algorithms together cover a wide range of overlay sizes and both versions of our problem. The effectiveness of our algorithms is demonstrated through comprehensive experiments on different real-world datasets and using various overlay network models.The results confirm that our algorithms can achieve much lower delays (up to 60% less) and up to orders of magnitude faster running times (hence supporting larger scales) than previous minimum-delay multicast approaches.

show abstract

Section: B Resultsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Minimum-delay overlay multicast

Mokhtarian

Jacobsen

2013

2013 Proceedings IEEE INFOCOM

View full text Add to dashboard Cite

show abstract

“…The end-to-end delay can be reduced by the employment of a node with a higher degree in the overlay multicast tree [8]. Thus, to satisfy the end-to-end delay bound, we consider the employment of the multicast service nodes (MSNs) which allow relatively high processing performance by covering all the disconnected nodes.…”

Section: Note Inmentioning

confidence: 99%

“…Recent topics related to overlay multicast includes [1,2,3,4,5,6,7,8,11] as an alternative to IP multicast. Overlay multicast uses the Internet as a low level infrastructure to provide multicast service to end hosts.…”

Section: Introductionmentioning

confidence: 99%

“…When a multicast node fails, rapid multicast tree recovery is essential to distribute multicast data to disconnected nodes. However, many researchers have focused their attention mainly on constructing the initial overlay multicast tree [1,2,3,4,5,6,8,11]. In this paper, we are interested in solving the tree rearrangement problem by establishing new connections for the multicast members when a multicast node failure occurs.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Multicast tree rearrangement to recover node failures in overlay multicast networks

Cho

Lee

2006

Computers & Operations Research

View full text Add to dashboard Cite

Overlay multicast makes use of the Internet as a low level infrastructure to provide multicast service to end hosts. The strategy of overlay multicast slides over most of the basic deployment issues associated with IP multicast, such as end-to-end reliability, flow and congestion control, and assignment of an unique address for each multicasting group.Since each multicast member is responsible for forwarding multicast packets, overlay multicast protocols suffer from multicast node failures. To cope with node failures in the overlay multicast networks, the employment of multicast service nodes (MSNs) is considered which allows relatively high processing performance to cover the disconnected nodes. We are interested in minimizing the cost of both the MSNs and additional links when a node failure occurs.Overlay multicast tree rearrangement to connect multicast members is discussed and formulated as a binary integer programming problem. The tree rearrangement problem is solved by a heuristic based on the Lagrangean relaxation. The performance of the proposed algorithm is investigated by carrying out experiments in 50 and 100 node problems. The employment of MSNs is illustrated to be dependent on the end-to-end delay bound in overlay networks and the degree constraint of member nodes.1

show abstract

Scheduling Uplink Bandwidth in Application-Layer Multicast Trees

Srinivasan

Zegura

2005

NETWORKING 2005. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile A

View full text Add to dashboard Cite

Many applications can benefit from the use of multicast to distribute content efficiently. Due to the limited deployment of network-layer multicast, several application-layer multicast schemes have been proposed. In these schemes, the nodes in the multicast tree are end systems which are typically connected to the network by a single access link. Transmissions to the children of a node in the multicast tree have to share this single uplink, a factor largely ignored by previous work.In this work, we examine the effect of access link scheduling on the latency of content delivery in a multicast tree. Specifically, we examine the general case where multiple packets (comprising a block of data) are sent to each child in turn. We provide an analytical relation to compute the latency at a node in the multicast tree and show the relationship to the packet size and block size used to transfer data. We propose heuristics for tree construction which take link serialization into account. We evaluate this effect using simulations and show that using larger block sizes to transfer data can reduce the average finish time of the nodes in the multicast tree at the expense of slightly increased variance.

show abstract

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

Cited by 29 publications

References 20 publications

Minimum-delay overlay multicast

Minimum-delay overlay multicast

Multicast tree rearrangement to recover node failures in overlay multicast networks

Scheduling Uplink Bandwidth in Application-Layer Multicast Trees

Contact Info

Product

Resources

About