THE BANDWIDTH ALLOCATION PROBLEM IN THE ATM NETWORK MODEL IS NP-COMPLETE

Authors
VEDANTHAM S IYENGAR SS
Citation
S. Vedantham et Ss. Iyengar, THE BANDWIDTH ALLOCATION PROBLEM IN THE ATM NETWORK MODEL IS NP-COMPLETE, Information processing letters, 65(4), 1998, pp. 179-182
Citations number
3
Categorie Soggetti
Computer Science Information Systems","Computer Science Information Systems
Journal title
Information processing letters → ACNP
ISSN journal
00200190
Volume
65
Issue
4
Year of publication
1998
Pages
179 - 182
Database
ISI
SICI code
0020-0190(1998)65:4<179:TBAPIT>2.0.ZU;2-Y
Abstract
We show that the Bandwidth Allocation Problem in the ATM network model is NP-complete. Based on that inference we suggest using the Genetic Algorithm technique to select a subset of calls from the set of incomi ng call requests for transmission, so that the available network bandw idth is utilized effectively, thus maximizing the revenue generated wh ile preserving the promised QoS. (C) 1998 Elsevier Science B.V.