...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE/ACM Transactions on Networking >Shared Risk Link Group (SRLG)-Diverse Path Provisioning Under Hybrid Service Level Agreements in Wavelength-Routed Optical Mesh Networks
【24h】

Shared Risk Link Group (SRLG)-Diverse Path Provisioning Under Hybrid Service Level Agreements in Wavelength-Routed Optical Mesh Networks

机译：波长路由光网状网络中混合服务级别协议下的共享风险链接组（SRLG）-不同路径设置

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The static provisioning problem in wavelength-routed optical networks has been studied for many years. However, service providers are still facing the challenges arising from the special requirements for provisioning services at the optical layer. In this paper, we incorporate some realistic constraints into the static provisioning problem, and formulate it under different network resource availability conditions. We consider three classes of shared risk link group (SRLG)-diverse path protection schemes: dedicated, shared, and unprotected. We associate with each connection request a lightpath length constraint and a revenue value. When the network resources are not sufficient to accommodate all the connection requests, the static provisioning problem is formulated as a revenue maximization problem, whose objective is maximizing the total revenue value. When the network has sufficient resources, the problem becomes a capacity minimization problem with the objective of minimizing the number of used wavelength-links. We provide integer linear programming (ILP) formulations for these problems. Because solving these ILP problems is extremely time consuming, we propose a tabu search heuristic to solve these problems within a reasonable amount of time. We also develop a rerouting optimization heuristic, which is based on previous work. Experimental results are presented to compare the solutions obtained by the tabu search heuristic and the rerouting optimization heuristic. For both problems, the tabu search heuristic outperforms the rerouting optimization heuristic.
机译：波长路由光网络中的静态配置问题已经研究了很多年。但是，服务提供商仍面临着由在光学层上提供服务的特殊要求引起的挑战。在本文中，我们将一些实际约束纳入静态配置问题中，并在不同的网络资源可用性条件下制定。我们考虑三种类型的共享风险链接组（SRLG）-多样化路径保护方案：专用，共享和不受保护。我们与每个连接请求关联一个光路长度约束和一个收入值。当网络资源不足以容纳所有连接请求时，将静态预配问题表述为收益最大化问题，其目的是最大化总收益值。当网络具有足够的资源时，该问题变成容量最小化问题，其目的是最小化所使用的波长链路的数量。我们为这些问题提供了整数线性规划（ILP）公式。因为解决这些ILP问题非常耗时，所以我们提出一种禁忌搜索试探法，以在合理的时间内解决这些问题。我们还基于先前的工作开发了重新路由优化启发式算法。给出实验结果，以比较禁忌搜索启发式算法和重路由优化启发式算法获得的解决方案。对于这两个问题，禁忌搜索启发式算法均优于重路由优化启发式算法。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号