度请求图有界的单向WDM环中的业务疏导
Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph
摘要：
流量疏导是光网络中的一个主要问题。它指的是将低速率信号分组到更高速率的流中，以降低设备成本。在SONET WDM网络中，该成本主要由电子终端（即ADM）的数量给出。我们考虑的情况下，拓扑结构是一个单向环。在图论术语中，这种情况下的流量疏导问题在于将请求图的边划分为具有最大边数的子图，同时最小化分解的顶点总数。我们考虑的情况下，请求图有界的最大程度$Δ$，我们的目标是设计一个网络能够支持任何请求图满足度约束。文献中现有的理论模型要严格得多，不允许这种适应性。我们将问题形式化，并解决了$Δ=2$（对于$C$的所有值）和$Δ= 3$（除了C=4的情况）的情况。我们还提供了一般情况下的下限和上界。
英文摘要：
Traffic grooming is a major issue in optical networks. It refers to grouping low rate signals into higher speed streams, in order to reduce the equipment cost. In SONET WDM networks, this cost is mostly given by the number of electronic terminations, namely ADMs. We consider the case when the topology is a unidirectional ring. In graph-theoretical terms, the traffic grooming problem in this case consists in partitioning the edges of a request graph into subgraphs with a maximum number of edges, while minimizing the total number of vertices of the decomposition. We consider the case when the request graph has bounded maximum degree $Δ$, and our aim is to design a network being able to support any request graph satisfying the degree constraints. The existing theoretical models in the literature are much more rigid, and do not allow such adaptability. We formalize the problem, and solve the cases $Δ=2$ (for all values of $C$) and $Δ= 3$ (except the case C=4). We also provide lower and upper bounds for the general case.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
