使用预交叉连接路径的快速光层网格保护
Fast optical layer mesh protection using pre-cross-connected trails
摘要:
传统的光网络是基于SONET环,但由于环是众所周知的使用带宽效率低,有很多研究共享网状保护,这承诺显着的带宽节省。不幸的是,大多数共享网状网保护方案不能保证故障流量将在SONET标准规定的50 ms时间范围内恢复。一个值得注意的例外是Grover和Stamatelakis的p-循环方案。然而,我们认为p-循环有一定的局限性,例如,没有简单的方法使P-循环适应基于路径的保护方案,并且P-循环似乎更适合于静态业务而不是动态业务。在本文中,我们表明,快速恢复时间的关键是不是一个环形拓扑本身,而是能够预先交叉连接保护路径。这就产生了预交叉连接路径或PXT的概念,它是一种比环更灵活的结构,并且容易适应基于路径和基于链路的方案以及静态和动态业务。PXT保护方案实现了快速的恢复速度,我们的模拟,这是经过精心挑选的使用实验设计理论的想法,表明PXT保护方案的带宽效率与传统的共享网格保护方案。
英文摘要:
Conventional optical networks are based on SONET rings, but since rings are known to use bandwidth inefficiently, there has been much research into shared mesh protection, which promises significant bandwidth savings. Unfortunately, most shared mesh protection schemes cannot guarantee that failed traffic will be restored within the 50 ms timeframe that SONET standards specify. A notable exception is the p-cycle scheme of Grover and Stamatelakis. We argue, however, that p-cycles have certain limitations, e.g., there is no easy way to adapt p-cycles to a path-based protection scheme, and p-cycles seem more suited to static traffic than to dynamic traffic. In this paper we show that the key to fast restoration times is not a ring-like topology per se, but rather the ability to pre-cross-connect protection paths. This leads to the concept of a pre-cross-connected trail or PXT, which is a structure that is more flexible than rings and that adapts readily to both path-based and link-based schemes and to both static and dynamic traffic. The PXT protection scheme achieves fast restoration speeds, and our simulations, which have been carefully chosen using ideas from experimental design theory, show that the bandwidth efficiency of the PXT protection scheme is comparable to that of conventional shared mesh protection schemes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。