By Topic

Threshold control policies for bandwidth allocation problem in communication networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ephremides, Anthony ; Maryland Univ., College Park, MD, USA ; Traganitis, A. ; Shih-Tsung Yang

It has been known that in control problems of queueing systems optimal policies are often of the “switch”-form or “threshold”-type. The use of queueing models in communication networks leads naturally to problems of bandwidth allocation that can be similarly modeled and solved in terms of easy-to-implement threshold control policies. In this paper we discuss in detail two bandwidth allocation problems that are amenable to this approach. The first concerns a simple server-activation problem in which the servers offer deterministic service times, thus modeling more accurately packet-switched systems, and the second involves the integration of voice and data at a single multiplexing node that uses a switch-function for voice admission control. The latter problem was actually studied in a real experimental setting over the NASA Advanced Communication Technology Satellite (ACTS)

Published in:

Global Telecommunications Conference, 1996. GLOBECOM '96. 'Communications: The Key to Global Prosperity

Date of Conference:

18-22 Nov 1996