Article ID: | iaor20108530 |
Volume: | 208 |
Issue: | 1 |
Start Page Number: | 37 |
End Page Number: | 45 |
Publication Date: | Jan 2011 |
Journal: | European Journal of Operational Research |
Authors: | Amiri Ali, Barkhi Reza |
Keywords: | telecommunications |
In managing a telecommunications network, decisions need to be made concerning the admission of requests submitted by customers to use the network bandwidth. The classical bandwidth packing problem requires that each request submitted by a customer use network resources to establish a one‐to‐one connection involving one single pair of nodes. We extend the problem to the more practical case where each request submitted by a customer to use the network resources includes a set or combination of calls. This extension suggests that each request requires one‐to‐many or many‐to‐many connections to be established between many communicating node pairs. The extension has applications in many important areas such video conferencing and collaborative computing. The combinatorial nature of the requests makes the admission decision more complex because of bandwidth capacity limitations and call routing difficulties. We develop an integer programming formulation of the problem and propose a procedure that can produce verifiably good feasible solutions to the problem. The results of extensive computational experiments over a wide range of problem structures indicate that the procedure provides verifiably good feasible solutions to the problem within reasonable computational times.