Share Email Print

Proceedings Paper

Algorithms for admission control in broadband communication networks
Author(s): Shuang Deng; Ursula M. Maydell
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

The throughput of virtual connections is negotiable in future broadband integrated services digital networks (B-ISDN). A new problem for admission control in broadband networks, thus, is to decide which calls to accept as well as at which throughput levels. This paper presents an optimization model and its solutions for the admission control and throughput negotiations in B-ISDN. The model is an extension of the knapsack problem, namely the flexible knapsack problem. It differs from the conventional knapsack problems in allowing different packing forms for the objects from the same class. Each packing form is associated with a different set of volume requirements and reward rates. The objective is to maximize the total reward. The decision space in the flexible knapsack problem is not only acceptance and denial, but also includes the choice of the optimal packing form for each accepted object. Three algorithms are provided in this paper to obtain the optimal access control decision for the connection throughput negotiations in B-ISDN.

Paper Details

Date Published: 9 February 1993
PDF: 12 pages
Proc. SPIE 1784, High-Speed Fiber Networks and Channels II, (9 February 1993); doi: 10.1117/12.141085
Show Author Affiliations
Shuang Deng, Univ. of Alberta (Canada)
Ursula M. Maydell, Univ. of Alberta (Canada)

Published in SPIE Proceedings Vol. 1784:
High-Speed Fiber Networks and Channels II
Kadiresan Annamalai, Editor(s)

© SPIE. Terms of Use
Back to Top