Resource division policies for EDF scheduling in ATM networks

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

doi:10.1109/iscc.2001.935383

Cited by 2 publications

(6 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This work is an extension of the work presented by the author and other collaborators in [2]. In [2], the nonuniform RC-EDF resource reservation policies are proposed and their performance is evaluated for simple network models with fixed or random routing.…”

Section: Related Workmentioning

confidence: 99%

“…We would like to stress here the fact that our focus in this paper is to provide means for realistic resource reservation policies and routing algorithms. More theoretical treatment of the resource reservation policies for RC-EDF could be found in a related work [2] in which the nonuniform RC-EDF resource reservation policies are first proposed and their performance is assessed. In this work, we show that the proposed resource reservation and routing algorithms increase the probability of accepting new connections significantly when compared with the uniform resource reservation and shortest-path routing for both uniform and nonuniform traffic under light to moderate network loading conditions.…”

Section: A Contributions Of the Papermentioning

confidence: 99%

“…In [2], the nonuniform RC-EDF resource reservation policies are proposed and their performance is evaluated for simple network models with fixed or random routing. A mathematical expression is derived to express the achievable gain for a policy called the optimal static policy over the uniform allocation policy in a simple single path network of .…”

Section: Related Workmentioning

confidence: 99%

“…The analysis in [12] assumes the use of a preemptive EDF scheduler which is equivalent to the use of negligible packet transmission time (which is typical in the case of networks with small packet size and high speed links, e.g., ATM networks). For negligible packet transmission time, [12] defines the function as (2) where is the data rate of the link serving the EDF scheduler in bits per second, is the set of connections passing through the scheduler, is the delay bound reserved for connection in seconds, and , in bits, is the traffic-constraint function on the traffic arrivals from connection up to time . In [12], it is shown that the necessary and sufficient schedulability condition of an EDF scheduler is equivalent to verifying that…”

Section: A the Edf Schedulability Conditions For Token-bucket Shapedmentioning

confidence: 99%

See 3 more Smart Citations

A framework for end-to-end deterministic-delay service provisioning in multiservice packet networks

Elsayed

2005

IEEE Trans. Multimedia

Self Cite

View full text Add to dashboard Cite

The problem of providing end-to-end delay guarantees for deterministic-delay services in multiservice packet networks is addressed through a combination of dynamic resource reservation and routing. Our model is based on using rate-controlled earliest-deadline-first (RC-EDF) for providing hard bounds on end-to-end delays. With RC-EDF, a certain delay bound has to be allocated for a connection at each node in the selected path. The most commonly used resource reservation policy is uniform allocation which is based on dividing the end-to-end delay bound equally among the nodes in the selected path. This simple allocation policy could lead to nonuniform resource loading and subsequently lead to high blocking rates. Moreover, the most commonly used routing method is shortest-path first routing which is known to lead to network hotspots. We propose a set of dynamic nonuniform resource reservation policies and dynamic routing methods. One of the routing methods is the well-known widest-shortest path method and the other is a dynamic routing method that adaptively adjusts link costs and uses a similar algorithm to shortest-path routing (e.g., Dijkstra's algorithm). We show that for both uniform and nonuniform traffic loading of some example network topologies that the combination of the proposed resource reservation policies and dynamic routing can lead to significant reduction in the connection blocking ratio in all loading conditions except for excessively high loads.Index Terms-Call admission control, deterministic delay bounds, quality of service routing, rate-controlled earliest-deadline first scheduling, resource reservation.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: A Contributions Of the Papermentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: A the Edf Schedulability Conditions For Token-bucket Shapedmentioning

confidence: 99%

See 2 more Smart Citations

A framework for end-to-end deterministic-delay service provisioning in multiservice packet networks

Elsayed

2005

IEEE Trans. Multimedia

Self Cite

View full text Add to dashboard Cite

show abstract

“…In [14], the problem of resource allocation and CAC for EDF scheduling is discussed. Various non-uniform resource allocation policies were handled and their qualitative performance compared.…”

Section: Introductionmentioning

confidence: 99%

Performance evaluation of resource reservation and call admission policies for deterministic services in PGPS-based packet networks

Elsayed

Saad

El-Hadidi

2002

Computer Communications

View full text Add to dashboard Cite

Abstract.We address the issue of reserving resources at packet 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 a number of resource reservation policies that are used to map the end-to-end delay requirement into a local rate to be reserved at each switch. The proposed reservation policies are the uniform reservation (EVEN) policy, the capacity proportional (CP) policy, and the remaining capacity proportional (RCP) policy. We present extensive simulation results to evaluate the performance of these resource allocation policies for various topologies and traffic characteristics. We also propose a resource-based routing algorithm and show the performance gain when it is used.

show abstract

Resource division policies for EDF scheduling in ATM networks

Cited by 2 publications

References 5 publications

A framework for end-to-end deterministic-delay service provisioning in multiservice packet networks

A framework for end-to-end deterministic-delay service provisioning in multiservice packet networks

Performance evaluation of resource reservation and call admission policies for deterministic services in PGPS-based packet networks

Contact Info

Product

Resources

About