Call admission control in generalized processor sharing schedulers with tight deterministic delay bounds

Barta, Peter I.; Németh, Felicián; Szabó, Rita; Bı́ró, József

doi:10.1016/s0140-3664(02)00107-x

Cited by 10 publications

(5 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As mentioned above, a tight bound is found in [2,14], and [20], for the maximum delay that a leaky-bucket constrained session experiences in a GPS server. The relevant bound is tighter than that found in [17], as it explicitly takes into account that the bandwidth unused by some sessions will be redistributed among the backlogged sessions proportionally to their respective weights φ i .…”

Section: Terminology and Previous Resultsmentioning

confidence: 94%

“…Recently, an expression has been found in [2,14,20], for the tight delay bounds that characterize GPS systems with leaky-bucket constrained input traffic sources, and CAC algorithms have been proposed based on such bounds. Unfortunately, the previous algorithms do not take full advantage of the available information.…”

Section: The Proposed Cac Algorithmmentioning

confidence: 99%

“…In the remainder of this section we propose a CAC algorithm to maximize bandwidth utilization by allocating each session only the portion of the available bandwidth that is strictly needed so as not to exceed a given delay bound. In addition, the proposed CAC algorithm does a straightforward allocation based on systematic calculations, without the need of random search or successive approximations, as is done in [2].…”

Section: The Proposed Cac Algorithmmentioning

confidence: 99%

“…If we compare our algorithm to those presented in [2], the main difference is that the previously proposed algorithms are not based on systematic calculations, but rely instead either on random search techniques or on successive approximations to find a solution, which can be very inefficient or even ineffective, as explained in [15].…”

Section: Our Cac Algorithmmentioning

confidence: 99%

See 3 more Smart Citations

QoS Mechanisms for the MAC Protocol of IEEE 802.11 WLANs

Gallardo¹,

Medina²,

Zhuang

2006

Wireless Netw

View full text Add to dashboard Cite

There are two essential ingredients in order for any telecommunications system to be able to provide Qualityof-Service (QoS) guarantees: connection admission control (CAC) and service differentiation. In wireless local area networks (WLANs), it is essential to carry out these functions at the MAC level. The original version of IEEE 802.11 medium access control (MAC) protocol for WLANs does not include either function. The IEEE 802.11e draft standard includes new features to facilitate and promote the provision of QoS guarantees, but no specific mechanisms are defined in the protocol to avoid over saturating the medium (via CAC) or to decide how to assign the available resources (via service differentiation through scheduling). This paper introduces specific mechanisms for both admission control and service differentiation into the IEEE 802.11 MAC protocol. The main contributions of this work are 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.

show abstract

Section: Terminology and Previous Resultsmentioning

confidence: 94%

Section: The Proposed Cac Algorithmmentioning

confidence: 99%

Section: The Proposed Cac Algorithmmentioning

confidence: 99%

Section: Our Cac Algorithmmentioning

confidence: 99%

See 2 more Smart Citations

QoS Mechanisms for the MAC Protocol of IEEE 802.11 WLANs

Gallardo¹,

Medina²,

Zhuang

2006

Wireless Netw

View full text Add to dashboard Cite

show abstract

“…By the mid1980s, processor sharing had been a key topic in QoS research particularly because of the limited CPU power (O'Donovan 1974; Barta et al 2003). With the advent of the Internet era and the constantly improving CPU capacities, QoS of computer networks became a more urgent research issue.…”

Section: Relevant Literaturementioning

confidence: 99%

Usage-based dynamic pricing of Web services for optimizing resource allocation

Lin

Ramanathan

Zhao

2005

ISeB

View full text Add to dashboard Cite

Web services technology is becoming an important technological trend in Web application development and integration. Based on open standards, such as SOAP, WSDL, and UDDI, Web services allow Webbased applications to communicate with each other through standardized XML messaging and to form loosely coupled distributed systems. Although the open feature of Web services benefits service providers in servicing consumers, the unlimited computing resources access of Web services to network bandwidth, storage throughput, and CPU time may lead to overexploitation of the resources when applications based on the Web services technology are widely accepted. Therefore, it is critical to optimize the operation of Web services, subject to the QoS requirements of service requests, to assure the total benefits of the service providers and the service consumers. This paper proposes a usage-based dynamic pricing approach to optimizing resource allocation of Web services in the principle of economics, and reports on a pilot implementation demonstrating the technical feasibility of the proposed approach.

show abstract

Analysis of virtual-time complexity in weighted fair queuing

Alnuweiri

Tayyar

2005

Computer Communications

View full text Add to dashboard Cite

Call admission control in generalized processor sharing schedulers with tight deterministic delay bounds

Cited by 10 publications

References 26 publications

QoS Mechanisms for the MAC Protocol of IEEE 802.11 WLANs

QoS Mechanisms for the MAC Protocol of IEEE 802.11 WLANs

Usage-based dynamic pricing of Web services for optimizing resource allocation

Analysis of virtual-time complexity in weighted fair queuing

Contact Info

Product

Resources

About