Proceedings Article10.1109/INFCOM.2001.916738
Optimal call admission control in generalized processor sharing (GPS) schedulers
D. Nandita,Joy Kuri,H.S. Jamadagni +2 more
- 22 Apr 2001
- Vol. 1, pp 468-477
24
TL;DR: This work proposes an optimal connection admission control (CAC) algorithm for a GPS scheduler, for leaky-bucket constrained connections with deterministic delay guarantees, and shows that the optimal CAC results in a higher network utilization than the existing CACs.
read more
Abstract: Generalized processor sharing (GPS) is an idealized fluid discipline with a number of desirable properties. Its packetized version PGPS is considered to be a good choice is a packet scheduling discipline to guarantee quality-of-service in IP and ATM networks. The existing connection admission control (CAC) frameworks for GPS result in a conservative resource allocation. We propose an optimal CAC algorithm for a GPS scheduler, for leaky-bucket constrained connections with deterministic delay guarantees. Our numerical results show that the optimal CAC results in a higher network utilization than the existing CACs.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Rate control protocol (rcp): congestion control to make flows complete quickly
Nick McKeown,Nandita Dukkipati +1 more
- 01 Jan 2008
TL;DR: It is shown that with typical Internet flow sizes, existing (TCP Sack) and newly proposed (XCP) congestion control algorithms make flows last much longer than necessary—often by one or two orders of magnitude.
134
Patent
Arbiter for an input buffered communication switch
Meenaradchagan Vishnu
- 19 Jul 2002
TL;DR: In this paper, an arbiter for a switch maintains a pair of counters for each flow of traffic at each input port: one counter (also called "first counter") to indicate an ideal transfer of traffic, and another counter(also called ''second counter" ) to indicate the actual transfer.
37
QoS mechanisms for the MAC protocol of IEEE 802.11 WLANs
TL;DR: Specific mechanisms for both admission control and service differentiation into the IEEE 802.11 MAC protocol are introduced, including a novel CAC algorithm for leaky-bucket constrained traffic streams, an original frame scheduling mechanism referred to as DM-SCFQ, and a simulation study of the performance of a WLAN including these features.
16
Optimal call admission control on a single link with a GPS scheduler
TL;DR: 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.
Call admission control in generalized processor sharing schedulers with tight deterministic delay bounds
TL;DR: This paper proposes an algorithm for tight individual session delay bound computation and several CAC algorithms for session resource assignment in a bandwidth-delay decoupled GPS system.
11
References
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case
Abhay Parekh,Robert G. Gallager +1 more
TL;DR: Worst-case bounds on delay and backlog are derived for leaky bucket constrained sessions in arbitrary topology networks of generalized processor sharing (GPS) servers and the effectiveness of PGPS in guaranteeing worst-case session delay is demonstrated under certain assignments.
Analysis and simulation of a fair queueing algorithm
Alan J. Demers,Srinivasan Keshav,Scott Shenker +2 more
- 01 Aug 1989
TL;DR: It is found that fair queueing provides several important advantages over the usual first-come-first-serve queueing algorithm: fair allocation of bandwidth, lower delay for sources using less than their full share of bandwidth and protection from ill-behaved sources.
Analysis and simulation of a fair queueing algorithm
TL;DR: In this article, a fair gateway queueing algorithm based on an earlier suggestion by Nagle is proposed to control congestion in datagram networks, based on the idea of fair queueing.
2.7K
A calculus for network delay. I. Network elements in isolation
TL;DR: A calculus is developed for obtaining bounds on delay and buffering requirements in a communication network operating in a packet switched mode under a fixed routing strategy, and burstiness constraints satisfied by the traffic that exits the element are derived.
2.1K
A generalized processor sharing approach to flow control in integrated services networks-the multiple node case
Abhay Parekh,Robert G. Gallager +1 more
- 01 May 1992
TL;DR: The authors propose the use of a packet service discipline at the nodes of the network that is based on a multiplex scheme called generalized processor sharing (GPS) that is combined with leaky bucket rate admission control to provide flexible, efficient and fair use of the links.