The Bandwidth Allocation Problem in the ATM network model is NP-complete

DOI10.1016/S0020-0190(98)00226-9MaRDI QIDQ293234zbMATH OpenOpenAlexFDO

Authors Sundararajan Vedantham, S. S. Iyengar

Publication date 9 June 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL http://www.sciencedirect.com/science/article/pii/S0020019098002269?np=y

zbMATH Keywords

computational complexitygenetic algorithmsNP-completeATM

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Network design and communication in computer systems (68M10)

Recommendations

• Dynamic bandwidth allocation to virtual paths in ATM networks
• The combinatorial bandwidth packing problem
• Bandwidth allocation and call admission control in ATM networks
• Bandwidth allocation in ATM networks
• Bandwidth allocation and QoS routing for heterogeneous networks

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• The Asynchronous Transfer Mode: a tutorial

Cited in

(1)

• Bandwidth contrained NP-complete problems

This page was built for publication: The Bandwidth Allocation Problem in the ATM network model is NP-complete

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293234)