.png){kind=icon}
返回
Queueing delay guarantees in bandwidth packing
.png){kind=icon}
PRE
AI
DOI：10.1016/S0305-0548(98)00096-3.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper proposes a new formulation for the bandwidth packing problem, assuring maximum service delay in telecommunications networks. The bandwidth packing problem is one of selecting calls, from a list of requests, to be routed in the network. We limit the maximum queueing delay, while maximizing revenues generated from the routed calls. An efficient Lagrangean relaxation based heuristic procedure for finding bounds and solutions to the problem is demonstrated, and computational results from a variety of problem instances are reported. We show that the procedure is both efficient and effective in finding good solutions. (C) 1999 Elsevier Science Ltd. All rights reserved.
Keyword:
bandwidth packing
call routing
queueing-delay
telecommunications networks
Lagrangean relaxation
subgradient search
heuristics
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
