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

Elsayed, Khaled A.; Saad, Ahmed; El-Hadidi, Mahmoud T.

doi:10.1016/s0140-3664(02)00058-0

Cited by 6 publications

(4 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The paper shows that the problem can be solved optimally for several classes of schedulers (including WFQ), and it may or may not have a convex formulation depending on the scheduler class; the results show instead that unequal rate allocation is necessary, since equal rate allocation may fail at very low network loads. Paper [35] proposes several criteria for resource allocation in WFQ-based networks (equal, capacity-proportional, and remaining capacity proportional) and shows how they perform in conjunction with least-loaded-path-first routing. The result is that ERA reduces the call blocking probability.…”

Section: Related Workmentioning

confidence: 99%

Optimal Joint Path Computation and Rate Allocation for Real-time Traffic

Frangioni

Galli

Stea

2014

The Computer Journal

View full text Add to dashboard Cite

Computing network paths under worst-case delay constraints has been the subject of abundant literature in the past two decades. Assuming Weighted Fair Queueing scheduling at the nodes, this translates to computing paths and reserving rates at each link. The problem is N P-hard in general, even for a single path; hence polynomial-time heuristics have been proposed in the past, that either assume equal rates at each node, or compute the path heuristically and then allocate the rates optimally on the given path. In this paper we show that the above heuristics, albeit finding optimal solutions quite often, can lead to failing of paths at very low loads, and that this could be avoided by solving the problem, i.e., path computation and rate allocation, jointly at optimality. This is possible by modeling the problem as a mixedinteger second-order cone program and solving it optimally in splitsecond times for relatively large networks on commodity hardware; this approach can also be easily turned into a heuristic one, trading a negligible increase in blocking probability for one order of magnitude of computation time. Extensive simulations show that these methods are feasible in today's ISPs networks and they significantly outperform the existing schemes in terms of blocking probability.

show abstract

Section: Related Workmentioning

confidence: 99%

Optimal Joint Path Computation and Rate Allocation for Real-time Traffic

Frangioni

Galli

Stea

2014

The Computer Journal

View full text Add to dashboard Cite

show abstract

“…Consequently, the objective function value can be increased by increasing x s to min l∈L(s) {x l s } without violating any constraint. Note that admission control techniques, e.g., the technique in [6], have to be used to decide wether (11) has a feasible solution or not. Now we make the following observation on problem (11).…”

Section: Deterministic Delay Requirements and Pgpsmentioning

confidence: 99%

NXG01-3: Rate Allocation under Network End-to-End Quality-of-Service Requirements

Saad

Leon-Garcia

2006

IEEE Globecom 2006

View full text Add to dashboard Cite

We address the problem of allocating transmission rates to a set of network sessions with end-to-end bandwidth and delay requirements. We give a unified convex programming formulation that captures both average and probabilistic delay requirements. Moreover, we present a distributed algorithm and establish its convergence to the global optimum of the overall rate allocation problem. In our algorithm, session sources update their rates as to maximize their individual benefit (utility minus bandwidth cost), the network partitions end-to-end delay requirements into local per-link delays, and the links adjust their prices to coordinate the sources' and network's decisions, respectively. This algorithm relies on a network utility maximization approach, and can be viewed as a generalization of TCP and queue management algorithms to handle end-to-end QoS. We also extend our results to deterministic delay requirements when nodes employ Packetlevel Generalized Processor Sharing (PGPS) schedulers. © 1-4244-0357-X/06/$20.00 2006 IEEE This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the IEEE GLOBECOM 2006 proceedings. © 1-4244-0357-X/06/$20.00 2006 IEEE This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the IEEE GLOBECOM 2006 proceedings.

show abstract

“…It is also shown that in general, there is much to be gained from using nonuniform reservation policies. Also, [9] studies the problem of resource allocation and CAC in a network with PGPS scheduling. Various nonuniform resource allocation policies were handled and their qualitative performance compared.…”

Section: Related Workmentioning

confidence: 99%

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

Elsayed

2005

IEEE Trans. Multimedia

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

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

Cited by 6 publications

References 17 publications

Optimal Joint Path Computation and Rate Allocation for Real-time Traffic

Optimal Joint Path Computation and Rate Allocation for Real-time Traffic

NXG01-3: Rate Allocation under Network End-to-End Quality-of-Service Requirements

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

Contact Info

Product

Resources

About