Abstract
This paper deals with the multi-hour bandwidth packing problem in telecommunication networks. The problem consists of selecting calls from a list of requests with time varying traffic conditions to be routed on an arc-capacitated network in order to maximize profit. Response time to users is considered by specifying an upper limit on the queueing delay in the network. The paper represents a significant improvement over previous research by presenting a unified model of the problem that considers all possible paths for each call, allows the traffic requirements of the calls to vary over the busy-hours of the day and integrates quality of service to users. A mathematical programming formulation for the problem is presented. A Lagrangean relaxation based heuristic solution procedure is developed. The results of extensive computational experiments over a wide range of problem structures indicate that the procedure is both efficient and effective.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
