arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1208.5526cs.NI
收藏

编码路径保护第1部分:共享到编码的有效转换

Coded Path Protection Part 1: Efficient Conversion of Sharing to Coding

Serhat Nazim Avci, and Ender Ayanoglu

摘要:

广域网中的链路故障是常见的,并且会导致重大的数据丢失。基于网格的保护方案提供高容量效率,但是它们是缓慢的并且需要复杂的信令。此外,交叉连接的实时重新配置威胁到它们的传输完整性。另一方面,还有其他一些积极主动的计划。主动性导致更高的恢复速度、更低的信令复杂度和更高的传输完整性。本文介绍了一种基于编码的主动保护方案,编码路径保护(CPP)。在CPP中,主数据的备份流与其他数据流一起编码,从而节省容量。除了建立有效的编码结构的系统方法,本文提出了一个最佳的和简单的容量放置和编码组形成算法。该算法将共享路径保护(SPP)技术的任何解决方案的共享结构转换为具有最小额外容量的编码结构。我们进行了定量和定性的比较,我们的技术与SPP。仿真结果表明,CPP提供了更快的链路故障恢复比SPP,但它会产生边际额外的容量超过SPP。在本文的第1部分中,我们描述了将给定SPP解转换为CPP解的理论和算法。

英文摘要:

Link failures in wide area networks are common and cause significant data losses. Mesh-based protection schemes offer high capacity efficiency but they are slow and require complex signaling. Additionally, real-time reconfigurations of cross-connects threaten their transmission integrity. On the other hand, there are other schemes that are proactive. Proactivity results in higher restoration speed, lower signaling complexity, and higher transmission integrity. This paper introduces a coding-based proactive protection scheme, named Coded Path Protection (CPP). In CPP, a backup stream of the primary data is encoded with other data streams, resulting in capacity savings. In addition to a systematic approach of building valid coding structures, this paper presents an optimal and simple capacity placement and coding group formation algorithm. The algorithm converts the sharing structure of any solution of a Shared Path Protection (SPP) technique into a coding structure with minimum extra capacity. We conducted quantitative and qualitative comparisons of our technique with the SPP. Simulation results confirm that CPP provides faster link failure recovery than SPP while it incurs marginal extra capacity beyond that of SPP. In this Part 1 of the paper, we describe the theory and an algorithm for converting a given SPP solution into a CPP solution.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑