Queueing delay guarantees in bandwidth packing

DOI10.1016/S0305-0548(98)00096-3zbMath0957.90032OpenAlexW2093847782MaRDI QIDQ1304527

Ali Amiri, Erik Rolland, Reza Barkhi

Publication date: 22 September 1999

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(98)00096-3

zbMATH Keywords

Lagrangean relaxationqueueing delaybandwidth packingcall routingtelecommunications networkssubgradient search heuristics

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Queues and service in operations research (90B22)

Related Items (8)

A cutting plane approach to combinatorial bandwidth packing problem with queuing delays ⋮ Bandwidth packing problem with queueing delays: modelling and exact solution approach ⋮ Fractional 0-1 programming: applications and algorithms ⋮ The invisible‐hand heuristic for origin‐destination integer multicommodity network flows ⋮ Using submodularity in solving the robust bandwidth packing problem with queuing delay guarantees ⋮ The combinatorial bandwidth packing problem ⋮ Bandwidth packing with priority classes ⋮ The selection and scheduling of telecommunication calls with time windows

This page was built for publication: Queueing delay guarantees in bandwidth packing