编码路径保护第2部分：设计、实现和性能
Coded Path Protection Part 2: Design, Implementation, and Performance
摘要：
在本文的第1部分中，我们介绍了一种基于编码的主动网络保护方案，称为编码路径保护（CPP）。在CPP中，主数据的备份流与其他数据流一起编码，从而节省容量。除了是一个系统的方法，建立有效的编码结构，CPP是一个最佳的和简单的容量放置和编码组形成算法。它将共享路径保护（SPP）技术的任何解决方案的共享结构转换为具有最小额外容量的编码结构。在本文的第2部分中，我们描述了我们的算法的实现，使用非线性规划（ILP），它的定时和同步要求，以及在网络中的实现问题。我们目前的仿真结果证实，CPP提供更快的链路故障恢复比SPP，而它会产生边际额外的能力超过SPP。
英文摘要：
In Part 1 of this paper, we introduced a coding-based proactive network 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 being a systematic approach of building valid coding structures, CPP is an optimal and simple capacity placement and coding group formation algorithm. It converts the sharing structure of any solution of a Shared Path Protection (SPP) technique into a coding structure with minimum extra capacity. In this Part 2 of the paper, we describe the implementation of our algorithm using Integer Linear Programming (ILP), its timing and synchronization requirements, and implementation issues in networks. We present simulation results which confirm that CPP provides faster link failure recovery than SPP while it incurs marginal extra capacity beyond that of SPP.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
