| Abstract |
The bandwidth packing problem seeks to select and route a set of calls from a given list, each with a pre-specified requirement for bandwidth, on an undirected communication network such that revenue is maximized. This paper presents a model with queuing delay costs when demand is stochastic, causing congestion. It provides more general model than available in the literature by assuming a general service time distribution on the links. |