双向WDM环网中的业务疏导
Traffic Grooming in Bidirectional WDM Ring Networks
摘要：
本文研究了在对称最短路径路由和全对全酉请求下WDM双向环网中ADM（分插复用器）的最小化问题。我们精确地制定的问题，在图的分解，和状态的所有值的梳理因子$C$和$N$，环的大小的一般下限。我们首先详尽地研究了C=1，$C = 2$，和C=3的情况下，提供改进的下界，几个无限的家庭，以及渐近最优的建设和近似的最佳建设。然后，我们研究$C>3$的情况下，特别关注的情况下$C = k(k+1)/2$的一些$k \geq 1$。利用某些组合设计的存在性，给出了$N$的几个同余类的最优分解.我们的结论与单向和双向WDM环的费用函数的比较。
英文摘要：
We study the minimization of ADMs (Add-Drop Multiplexers) in optical WDM bidirectional rings considering symmetric shortest path routing and all-to-all unitary requests. We precisely formulate the problem in terms of graph decompositions, and state a general lower bound for all the values of the grooming factor $C$ and $N$, the size of the ring. We first study exhaustively the cases C=1, $C = 2$, and C=3, providing improved lower bounds, optimal constructions for several infinite families, as well as asymptotically optimal constructions and approximations. We then study the case $C>3$, focusing specifically on the case $C = k(k+1)/2$ for some $k \geq 1$. We give optimal decompositions for several congruence classes of $N$ using the existence of some combinatorial designs. We conclude with a comparison of the cost functions in unidirectional and bidirectional WDM rings.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
