An online throughput-competitive algorithm for multicast routing and admission control

Goel, Ashish; Henzinger, Monika; Plotkin, Serge

doi:10.1016/j.jalgor.2004.11.001

Cited by 8 publications

(8 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In particular, the work of [17,18] presents the theoretical models for online unicast routing. In the multicast domain, the work of [19] investigate the case of receivers within a multicast session arriving in batch, and the work in [20] presents a solution for receivers arriving separately. In the past, we have extended the multi-commodity flow theory to maximize the throughput of overlay multicasting [21].…”

Section: Related Workmentioning

confidence: 99%

Maximizing Resilient Throughput in Peer-to-Peer Network

Liu¹,

Fan²,

Cao³

et al. 2011

View full text Add to dashboard Cite

A unique challenge in P2P network is that the peer dynamics (departure or failure) cause unavoidable disruption to the downstream peers. While many works have been dedicated to consider fault resilience in peer selection, little understanding is achieved regarding the solvability and solution complexity of this problem from the optimization perspective. To this end, we propose an optimization framework based on the generalized flow theory. Key concepts introduced by this framework include resilience factor, resilience index, and generalized throughput, which collectively model the peer resilience in a probabilistic measure. Under this framework, we divide the domain of optimal peer selection along several dimensions including network topology, overlay organization, and the definition of resilience factor and generalized flow. Within each subproblem, we focus on studying the problem complexity and finding optimal solutions. Simulation study is also performed to evaluate the effectiveness of our model and performance of the proposed algorithms.

show abstract

Section: Related Workmentioning

confidence: 99%

Maximizing Resilient Throughput in Peer-to-Peer Network

Liu¹,

Fan²,

Cao³

et al. 2011

View full text Add to dashboard Cite

show abstract

“…A competitive routing scheme in terms of the number of failed routes in the setting of ad-hoc networks is presented in [24]. A competitive algorithm for admission control and routing in a multicasting setting is presented in [25].…”

Section: Related Workmentioning

confidence: 99%

Throughput-Competitive Advance Reservation With Bounded Path Dispersion

Cohen

Fazlollahi

Starobinski

2011

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-In response to the high throughput needs of grid and cloud computing applications, several production networks have recently started to support advance reservation of dedicated circuits. An important open problem within this context is to devise advance reservation algorithms that can provide provable throughput performance guarantees, independently of the specific network topology and arrival pattern of reservation requests. In this paper, we first show that the throughput performance of greedy approaches, which return the earliest possible completion time for each incoming request, can be arbitrarily worse than optimal. Next, we introduce two new on-line, polynomialtime algorithms for advance reservation, called BatchAll and BatchLim. Both algorithms are shown to be throughput-optimal through the derivation of delay bounds for 1 + ε bandwidth augmented networks. The BatchLim algorithm has the advantage of returning the completion time of a connection immediately as a request is placed, but at the expense of looser delay performance than BatchAll. We then propose a simple approach that limits path dispersion, i.e., the number of parallel paths used by the algorithms, while provably bounding the maximum reduction factor in the transmission throughput. We prove that the number of paths needed to approximate any flow is quite small and never exceeds the total number of edges in the network. Through simulation for various topologies and traffic parameters, we show that the proposed algorithms achieve reasonable delay performance, even at request arrival rates close to capacity bounds, and that three to five parallel paths are sufficient to achieve near-optimal performance.

show abstract

“…In particular, the work of [19,20] present the theoretical models for online unicast routing. In the multicast domain, the work of [21] investigate the case of receivers within a multicast session arriving in batch, and the work in [22] presents a solution for receivers arriving separately.…”

Section: Optimization-based Routingmentioning

confidence: 99%

Optimizing P2P streaming throughput under peer churning

2008

View full text Add to dashboard Cite

High-throughput P2P streaming relies on peer selection, the strategy a peer uses to select other peer(s) as its parent(s) of streaming. Although this problem has been thoroughly investigated in the classical optimization framework under static settings, it still remains unaddressed as how to sustain throughput competitive to the optimum under highly dynamic peer churning. To accommodate such peer dynamics, we extend the classical optimization framework and propose a distributed online peer selection algorithm. This basic algorithm is further extended to a variety of settings commonly seen in operational P2P networks, such as multiparent streaming, admission control, delay constraint, etc. We prove approximation bound of our algorithm to the optimal throughput. Through evaluation under different topological setups and peer churning sequences, we show that our solution can consistently deliver competitive throughput, which greatly outperforms its theoretical bound.

show abstract

An online throughput-competitive algorithm for multicast routing and admission control

Cited by 8 publications

References 27 publications

Maximizing Resilient Throughput in Peer-to-Peer Network

Maximizing Resilient Throughput in Peer-to-Peer Network

Throughput-Competitive Advance Reservation With Bounded Path Dispersion

Optimizing P2P streaming throughput under peer churning

Contact Info

Product

Resources

About