Admission Control in Networks with Advance Reservations

Lewin-Eytan, Liane; Naor, Joseph; Orda, Ariel

doi:10.1007/s00453-004-1114-1

Cited by 18 publications

(31 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The results show that VBLS performance is close to packet-switching performance which means that file transfers can take advantage of bandwidth that becomes available subsequent to the start of transfers a critical drawback of typical fixed-bandwidth allocation schemes in circuit-switched networks. This paper [8] provides many application domains that exists a need to aggregate information from information repositories distributed around the world. In an effort to better link these resources in a unified manner, middleware researchers put forth the notion of a grid.…”

Section: Iirelated Workmentioning

confidence: 99%

Throughtput Competitive Advance Reservation Using Polynomial Time

Priya¹

2012

IOSRJEN

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 online, polynomial-time algorithms for advance reservation, called BATCH ALL and BATCH LIM. Both algorithms are shown to be throughput-optimal through the derivation of delay bounds for bandwidth augmented networks. The BATCH LIM 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. The propose system called BATCH ALL+ is a simple approach that limits path dispersion, i.e., the newly arrived batch can be combined with the currently running batch if the destination is same, so time consumption is less when compare to BATCH ALL and BATCH LIM.

show abstract

Section: Iirelated Workmentioning

confidence: 99%

Throughtput Competitive Advance Reservation Using Polynomial Time

Priya¹

2012

IOSRJEN

View full text Add to dashboard Cite

show abstract

“…We begin with the unweighted case, and with the following lemma which relies on an observation already made by Lewin-Eytan et al [43]. A rectangle family is said to be triangle-free if there are no three pairwise intersecting rectangles in the family.…”

Section: General Rectangle Graphsmentioning

confidence: 99%

“…There have been several O (lg n) approximation algorithms independently suggested for this problem [2,10,15,40]. Lewin-Eytan et al [43] devised a 4q-approximation algorithm for the problem, where q is the size of the maximum clique in the input graph. Recently, Chalermsook and Chuzhoy [13] were able to break the lg n approximation barrier by devising a sophisticated O (lg lg n) randomized approximation algorithm.…”

Section: − θ(mentioning

confidence: 99%

“…The dual problem of Minimum Rectangle Vertex Cover is the Maximum Rectangle Independent Set problem: Given a family of axis-parallel rectangles in the plane, find a maximum size (or weight) subset of pairwise disjoint rectangles. This problem has been extensively studied in the computational geometry community, and has several applications in data mining [13,40], automated label placement [2,22,26], and in network resource allocation with advance reservation for line topologies [13,43], which also apply to Minimum Vertex Cover in rectangle graphs (see below). Fowler et al [25] showed that Maximum Independent Set in rectangle graphs is NP-hard, implying the NP-hardness of Minimum Vertex Cover in rectangle graphs.…”

Section: − θ(mentioning

confidence: 99%

See 1 more Smart Citation

Minimum Vertex Cover in Rectangle Graphs

Bar-Yehuda

Hermelin

Rawitz

2010

Algorithms – ESA 2010

View full text Add to dashboard Cite

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution and sharing with colleagues.Other uses, including reproduction and distribution, or selling or licensing copies, or posting to personal, institutional or third party websites are prohibited. We consider the Minimum Vertex Cover problem in intersection graphs of axis-parallel rectangles on the plane. We present two algorithms: The first is an EPTAS for non-crossing rectangle families, rectangle families R where R 1 \ R 2 is connected for every pair of rectangles R 1 , R 2 ∈ R. This algorithm extends to intersection graphs of pseudo-disks. The second algorithm achieves a factor of (1.5 + ε) in general rectangle families, for any fixed ε > 0, and works also for the weighted variant of the problem. Both algorithms exploit the plane properties of axis-parallel rectangles in a novel way.

show abstract

“…Ref. [18] proposes an off-line approximation algorithm for accommodating advance reservation of job requests in some specific topologies, e.g., lines and trees. Ref.…”

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

Admission Control in Networks with Advance Reservations

Cited by 18 publications

References 21 publications

Throughtput Competitive Advance Reservation Using Polynomial Time

Throughtput Competitive Advance Reservation Using Polynomial Time

Minimum Vertex Cover in Rectangle Graphs

Throughput-Competitive Advance Reservation With Bounded Path Dispersion

Contact Info

Product

Resources

About