返回
Achieving fast and bandwidth-efficient shared-path protection
DOI:10.1109/JLT.2003.808767.png)
摘要
En 中文
Dynamic provisioning of restorable bandwidth guaranteed paths is a challenge in the design of broad-band transport networks, especially the next-generation optical networks. A common approach is called (failure-independent) path protection, whereby for every mission-critical active path to be established, a link (or node) disjoint backup path (BP) is also to be established. To optimize network resource utilization, shared path protection should be adopted, which often allows a new BP to share the bandwidth allocated to some existing BPs. However, it usually leads the backup paths to use too many links, with zero cost in term of additional backup bandwidth, along its route. It will violate the restoration time guarantee. In this paper, we proposed novel integer linear programming (ILP) formulations by introducing two parameters (epsilon and mu) in both the sharing with complete information (SCI) scheme and the distributed partial information management (DPIM) scheme. Our results show that the proposed ILP formulations can not only improve the network resource utilization effectively, but also keep the BPs as short as possible.
Keyword:
bandwidth sharing
dynamic provisioning
integer linear programming (ILP)
optical network
protection
期刊
IF:
4.8
论文数:
1.7W
被引数:
3.8W
机构
暂无机构信息
引用论文
Dictamnine inhibits pancreatic cancer cell growth and epithelial-mesenchymal transition by blocking the PI3K/AKT signaling pathway
Neoplasma
IF0
Recent Advances in Dual Temperature Responsive Block Copolymers and Their Potential as Biomedical Applications
Polymers
IF0
没有更多内容

