Optimal Call Admission Control under Generalized Processor Sharing Scheduling

Panagakis, Antonis; Stavrakakis, Ioannis

doi:10.1007/3-540-45512-4_32

Cited by 6 publications

(4 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Each session is provided a buffer and the input links are considered to have infinite capacity. This system -referred to as the BETA (BEst Effort Trafiic Aware) aps system in [3], where the optimal CAC scheme for it has been derived -will be referred to as the reference system, and the optimal CAC scheme for this system as the R_CAC (Reference CAC) scheme. The proposed system, which will be referred to as Deeomposition-based Service (DS-) system, is depicted in Figure 2.…”

Section: Decomposition Based Service Schemementioning

confidence: 99%

“…C(t) is an increasing function of time since it preserves a constant value between two consecutive backlog clearing times and C ( b j) < C ( bi) (the proof may be found in [3]). Let W( bj-I> bj ) C( bi-I)( bj -bj-I) be referred to as the Normalized Backlogged Sessions Allocated (NBSA) work.…”

Section: Definitionsmentioning

confidence: 99%

“…Description of the D_CAC scheme Tbe D_CAC scheme pseudocode is provided in Figure 3. It is exactly the same as the R_CAC scheme description in [3] except step B4.0 ofthe description where the Decomposition Function is included.…”

Section: 2mentioning

confidence: 99%

See 2 more Smart Citations

Generalized Processor Sharing Scheduling Enhancement through Session Decomposition

Panagakis¹,

Stavrakakis²

2003

IFIP Advances in Information and Communication Technology

Self Cite

View full text Add to dashboard Cite

In this paper a service discipline, which is based on Generalized Proeessor Sharing (GPS) and aims to improve resouree utilization for deterministic guarantees at a single node is presented. Aeeording to the proposed seheme original sessions are deeomposed into two eomponents whieh are treated as separate sessions by a GPS seheduler; the work assigned to eaeh session eomponents is mapped baek to the original session. A Call Admission Control (CAC) algorithm for the proposed seheme -eapable of ensuring typieally better and never worse resouree utilization eompared to that aehieved by the optimal CAC applied direetly to the sessionsis derived, and some numerical results demonstrating the benefits of the proposed seheme are provided. such a way that the same delay bound is guaranteed to both components of a *

show abstract

Section: Decomposition Based Service Schemementioning

confidence: 99%

Section: Definitionsmentioning

confidence: 99%

See 1 more Smart Citation

Generalized Processor Sharing Scheduling Enhancement through Session Decomposition

Panagakis¹,

Stavrakakis²

2003

IFIP Advances in Information and Communication Technology

Self Cite

View full text Add to dashboard Cite

show abstract

“…E-mail: dnandita@stanford.edu, kuri@cedt.iisc.ernet.in This paper is the result of the merger of two manuscripts submitted by the authors of [15] and [16].…”

Section: Introductionmentioning

confidence: 99%

Optimal Call Admission Control on a Single Link With a GPS Scheduler

Panagakis

Dukkipati

Stavrakakis

et al. 2004

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-In this paper the problem of Call Admission Control (CAC) is considered for leaky bucket constrained sessions with deterministic service guarantees (zero loss and finite delay bound), served by a Generalized Processor Sharing scheduler at a single node in the presence of best effort traffic. Based on an optimization process a CAC algorithm capable of determining the (unique) optimal solution is derived. The derived algorithm is also applicable, under a slight modification, in a system where the best effort traffic is absent and is capable of guaranteeing that if it does not find a solution to the CAC problem, then a solution does not exist. The numerical results indicate that the CAC algorithm can achieve a significant improvement on bandwidth utilization as compared to a (deterministic) effective bandwidth-based CAC scheme.

show abstract