Constantly growing demands on higher bandwidth and quality of service in modern communication networks motivate the introduction of fully optical network technologies that can eliminate the bottlenecks of optical to digital signal conversions. Recent advances in elastic optical networks enable fine-grained resource allocation technologies for traffic demands, which introduces the Routing and Spectrum Allocation (RSA) problem. In order to improve network resilience for multiple link failures while avoiding double light-spectrum allocation, we present ExpectAll—a novel approach and a tool for resilience and path/spectrum allocation based on binary decision diagrams (BDDs). Our method efficiently computes and stores all solutions to the RSA problem in the BDD data structure, facilitating optimal and fast failover protection for failure scenarios even with multiple failing links. ExpectAll surpasses the state-of-the-art methods in both the speed of finding a single optimal solution for a currently occurring failure scenario as well as in the preparation time required to precompute all optimal route and spectrum assignments.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

ExpectAll: A BDD Based Approach for Link Failure Resilience in Elastic Optical Networks

  • Gustav S. Bruhns,
  • Martin P. Hansen,
  • Rasmus Hebsgaard,
  • Frederik M. W. Hyldgaard,
  • Jiří Srba

摘要

Constantly growing demands on higher bandwidth and quality of service in modern communication networks motivate the introduction of fully optical network technologies that can eliminate the bottlenecks of optical to digital signal conversions. Recent advances in elastic optical networks enable fine-grained resource allocation technologies for traffic demands, which introduces the Routing and Spectrum Allocation (RSA) problem. In order to improve network resilience for multiple link failures while avoiding double light-spectrum allocation, we present ExpectAll—a novel approach and a tool for resilience and path/spectrum allocation based on binary decision diagrams (BDDs). Our method efficiently computes and stores all solutions to the RSA problem in the BDD data structure, facilitating optimal and fast failover protection for failure scenarios even with multiple failing links. ExpectAll surpasses the state-of-the-art methods in both the speed of finding a single optimal solution for a currently occurring failure scenario as well as in the preparation time required to precompute all optimal route and spectrum assignments.