The bandwidth allocation problem in the ATM network model is NP-complete

Information Processing Letters

Volumn 65, Issue 4, 1998, Pages 179-182

  Vedantham, Sundararajan ^a   Iyengar, S S ^a  

^a Louisiana State University   (United States)

Author keywords

ATM; Computational complexity; Genetic algorithms; NP complete

Indexed keywords

BANDWIDTH; COMPUTATIONAL COMPLEXITY; FREQUENCY ALLOCATION; GENETIC ALGORITHMS; MATHEMATICAL MODELS;

BANDWIDTH ALLOCATION PROBLEM; DATA ERROR RATE;

ASYNCHRONOUS TRANSFER MODE;

EID: 0031998589     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00226-9     Document Type: Article

References (3)

1. J.-Y. Le Boudec, The asynchronous transfer mode: A tutorial, Comput. Networks ISDN Systems 24 (1992) 279-310.
2. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
3. A. Hunter, SUGAL User Manual v20, http:// osiris. sund.ac.uk/ahu/sugal/home.html, 1995.