首页> 外文期刊>Computer networks >Partial spatial protection for provisioning differentiated reliability in FSTR-based Metro Ethernet networks
【24h】

Partial spatial protection for provisioning differentiated reliability in FSTR-based Metro Ethernet networks

机译:部分空间保护,用于在基于FSTR的城域以太网中提供差异化​​的可靠性

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

摘要

Fast Spanning Tree Reconnection (FSTR) is a newly proposed restoration method by us to handle link failures in Metro Ethernet networks. Compared with other methods existing in the literature, FSTR has the advantages of lower signaling overhead, faster recovery and lesser rerouted traffic. However, FSTR.lacks its own mechanism to support differentiated reliability (DiR), which is required by voice and data services, as well as a variety of emerging multimedia applications such as video conferencing and online gaming. In DiR, a traffic request is guaranteed a minimum reliability/protection degree in the event of a link failure, according to clients' requirements. Unnecessary redundant/backup network resources are thus eliminated in DiR and, as a result, the blocking probability of traffic requests decreases, compared to that in full protection where 100% reliability is guaranteed for all traffic requests. In this work, we propose to use partial spatial protection (PSP) mechanism at the spanning tree layer to provision DiR in FSTR-based Metro Ethernet networks. The basic idea of PSP to provide DiR is that a traffic request is protected using backup bandwidth against failure of only a subset of the links on its route, according to the specified reliability requirement. To the best of our knowledge, this is the first work on the problem of PSP at the spanning tree level, a layer unique to Ethernet where traffic requests are required to be mapped onto different trees and the protection mechanisms usually involve tree restoration/reconstruction. We formulate the optimal PSP problem in FSTR-based Metro Ethernet networks as a mixed integer linear programming (MILP) model. We develop a heuristic algorithm to reduce the computational complexity in implementing PSP. The heuristic algorithm is designed based on a known 1/2-approximation approach to the Knapsack problem. We describe the recovery operations of PSP in the event of a link failure. The numerical results demonstrate that the proposed PSP solution can significantly reduce the blocking probability of traffic requests in an FSTR-based Metro Ethernet network, compared to full protection.
机译:快速生成树重新连接(FSTR)是我们新提出的一种还原方法,用于处理城域以太网中的链路故障。与文献中现有的其他方法相比,FSTR具有较低的信令开销,更快的恢复速度和更少的重新路由流量的优点。但是,FSTR。缺少其自己的机制来支持语音和数据服务以及视频会议和在线游戏等各种新兴多媒体应用所需的差异化可靠性(DiR)。在DiR中,根据客户的要求,在链路发生故障时,保证流量请求的最低可靠性/保护度。因此,与完全保护(为所有流量请求保证100%可靠性)的完全保护相比,在DiR中消除了不必要的冗余/备份网络资源,从而减少了流量请求的阻塞概率。在这项工作中,我们建议在生成树层使用部分空间保护(PSP)机制在基于FSTR的城域以太网中提供DiR。提供DiR的PSP的基本思想是,根据指定的可靠性要求,使用备份带宽保护流量请求,以防止其路由上的仅一部分链路故障。据我们所知,这是生成树级别PSP问题的第一项工作,这是以太网特有的层,在该层中,流量请求需要映射到不同的树上,并且保护机制通常涉及树的恢复/重建。我们将基于FSTR的城域以太网中的最佳PSP问题公式化为混合整数线性规划(MILP)模型。我们开发了一种启发式算法来减少实现PSP的计算复杂性。启发式算法是基于已知的1/2逼近背包问题设计的。我们描述了链路故障时PSP的恢复操作。数值结果表明,与全面保护相比,提出的PSP解决方案可以显着降低基于FSTR的城域以太网中流量请求的阻塞概率。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号