...
首页> 外文期刊>Computers & operations research >On-line resources allocation for ATM networks with rerouting
【24h】

On-line resources allocation for ATM networks with rerouting

机译:通过重新路由为ATM网络分配在线资源

获取原文
获取原文并翻译 | 示例
           

摘要

This paper presents an application we developed for France Telecom R&D to solve a difficult real-life network problem. The problem takes place in an Asynchronous Transfer Mode (ATM) network administration context and consists in planning demands of connection over a period of 1 year. A new demand is accepted if both bandwidth and Quality of Service (QoS) requirements are satisfied. Demands are not known prior to the assignment and must be performed on-line according to their arrival. Moreover, the acceptance or the reject of a demand must be decided within a given time of 1 min. First, we look for a route satisfying the new demand. In case of failure, we try to reroute some already accepted connections in order to satisfy this new demand. Rerouting has been modelled as a Weighted Constraint Satisfaction Problem (wcsp) and solved by VNS/LDS + CP, a hybrid method well suited for solving wcsps in on-line contexts. Experiments show that our rerouting enables to accept an average of 67% of demands that would be rejected otherwise.
机译:本文介绍了我们为法国电信研发部开发的应用程序,用于解决现实生活中的难题。该问题发生在异步传输模式(ATM)网络管理上下文中,并且涉及计划在1年内进行连接的需求。如果同时满足带宽和服务质量(QoS)要求,则可以接受新的要求。需求在分配之前是未知的,必须根据需求的到来在线进行。此外,必须在1分钟的给定时间内决定接受还是拒绝需求。首先,我们寻找满足新需求的路线。如果出现故障,我们将尝试重新路由一些已经接受的连接,以满足这种新需求。重路由已建模为加权约束满足问题(wcsp),并通过VNS / LDS + CP解决,VNS / LDS + CP是一种非常适合在在线环境中解决wcsps的混合方法。实验表明,我们的重新路由可以平均接受67%的需求,否则这些需求将被拒绝。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号