.png){kind=icon}
返回
The multi-hour bandwidth packing problem
.png){kind=icon}
PRE
AI
DOI：10.1016/S0305-0548(99)00004-0.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We study the multi-hour bandwidth packing problem arising from telecommunications networks. The problem consists of selecting calls from a list of requests with time varying traffic conditions to be routed on an are-capacitated network in order to maximize profit. 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 and allows the traffic requirements of the calls to vary over the busy-hours of the day. Failure to consider all possible routes and to allow traffic requirements to vary over the busy-hours would lead to significant revenue loss, excessive costs and/or inferior quality of service to users. The integer programming model for the problem is presented. A solution procedure based on the Lagrangean relaxation technique is developed. The results of extensive computational experiments over a wide range of problem structures indicate that the procedure is both efficient and effective.
Keyword:
telecommunications networks
bandwidth packing
time-varying traffic
Lagrangean relaxation
heuristics
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
