Local resource allocation for providing end to end delay guarantees in ATM networks using PGPS scheduling

Ayad, A.S.; Elsayed, Khaled M.; El-Hadidi, Mahmoud T.

doi:10.1109/mascot.1999.805037

Cited by 3 publications

(4 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This paper builds on the work done in [1], [5], and [8] where it was shown that if a call (f) traverses a path of K f PGPS schedulers and has traffic characteristics conforming to a leaky bucket with a maximum burst size of ( σ f ) bits and a long term average rate of ( ρ f ) bps, then an upper bound on the end-to-end delay is guaranteed for each ATM cell from call (f) by reserving a certain service rate at each switch along the call's path. The upper bound ( D f ) is given by:…”

Section: Delay Formulasmentioning

confidence: 99%

“…The next test is to verify that the value of the required end-to-end delay of the incoming call is not less than the minimum end-to-end delay bound that the network can guarantee to the incoming call. This minimum value ( D * f ) is obtained from (1) with each switch along the call's path reserving a service rate equal to its remaining capacity. We define the remaining capacity of a PGPS scheduler (j) prior to the acceptance of call (f) as:…”

Section: Cac Algorithmmentioning

confidence: 99%

“…It can be shown [1] that using the RCP policy in conjunction with the proposed CAC algorithm guarantees the absence of resource-limited schedulers when accepting a new call. Thus, this case is only present with EVEN and CP policies.…”

Section: Resource Division Policiesmentioning

confidence: 99%

See 2 more Smart Citations

Performance Evaluation of Resource Division Policies for PGPS Scheduling in ATM Networks

Ayad

Elsayed

El-Hadidi

2000

Networking 2000 Broadband Communications, High Performance Networking, and Performance of Communication Networks

View full text Add to dashboard Cite

The paper addresses the issue of reserving resources at ATM switches along the path of calls requiring a deterministic bound on end-to-end delay. The switches are assumed to schedule outgoing packets using the Packet-by-Packet Generalized Processor Sharing (PGPS) scheduling discipline. We propose an algorithm for call admission control (CAC), and present the simulation results used to evaluate the performance of the resource division policies used for mapping the end-to-end delay requirement into service rates to be reserved at each switch. The simulation results also show the performance gain when a simple resource-based routing algorithm is used.

show abstract

Section: Delay Formulasmentioning

confidence: 99%

Section: Cac Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

Performance Evaluation of Resource Division Policies for PGPS Scheduling in ATM Networks

Ayad

Elsayed

El-Hadidi

2000

Networking 2000 Broadband Communications, High Performance Networking, and Performance of Communication Networks

View full text Add to dashboard Cite

show abstract

“…Handling the variety in QoS requirements of different applications requires the network to use a mechanism for serving packets from different applications according to their granted QoS level. Many scheduling disciplines have been proposed in the literature to implement such mechanism (see [3,6,7,11,13]). Each scheduling discipline requires algorithms for performing call admission control (CAC) and resource reservation.…”

Section: Introductionmentioning

confidence: 99%

Performance Evaluation of Resource Reservation Policies for Rate-Controlled Earliest-Deadline-First Scheduling in Multi-Service Packet Networks

Elsayed

Ayad

El-Hadidi

2004

Telecommunication Systems

View full text Add to dashboard Cite

Abstract:The paper addresses the issue of reserving resources at packet switches along the path of flows requiring a deterministic bound on end-to-end delay. The switches are assumed to schedule outgoing packets using the RateControlled Earliest-Deadline-First (RC-EDF) scheduling discipline. EDF is known to be an optimal scheduling discipline for deterministic delay services in the single scheduler case. We propose a number of static and dynamic reservation policies for mapping the end-to-end delay requirement of a flow into local delay deadlines to be reserved at each scheduler. These policies are based on non-even resource reservation where the resources reserved depend on the capacities and loading at each node in the network. We define and prove the optimality of a certain non-even policy for the case of a single path network with homogenous static traffic. We present extensive simulation results for different scenarios which show that dynamic non-even resource reservation provides superior performance when compared to simple policies such as even dividing of end-to-end delay among the schedulers.

show abstract

An efficient weight assignment process for GPS servers

Urvoy

Hebuterne²

1st European Conference on Universal Multiservice Networks. ECUMN'2000 (Cat. No.00EX423)

View full text Add to dashboard Cite

The introduction of Quality of Service in high-speed networks requires the use of more complex policy than the simple FIFO policy commonly used on servers today. Among these policies, GPS is the paradigm of a large set of policies aiming at sharing the bandwidth among sources in a very efficient way. Moreover, tight end-to-end delay bounds results are provided in the deterministic and statistical frameworks. However, the weight assignment process commonly used, RPPS, appears to perform poorly and the resulting admission procedure is cumbersome. To fill this gap, we propose a new weight assignment policy, called EBBPS, which captures the QoS requirement of sources. Moreover, the corresponding admission procedure is shown to be scalable, and provides an efficient use of resource capacity.

show abstract

Local resource allocation for providing end to end delay guarantees in ATM networks using PGPS scheduling

Cited by 3 publications

References 6 publications

Performance Evaluation of Resource Division Policies for PGPS Scheduling in ATM Networks

Performance Evaluation of Resource Division Policies for PGPS Scheduling in ATM Networks

Performance Evaluation of Resource Reservation Policies for Rate-Controlled Earliest-Deadline-First Scheduling in Multi-Service Packet Networks

An efficient weight assignment process for GPS servers

Contact Info

Product

Resources

About