完全$m$ -叉树的无向光学指数
The Undirected Optical Indices of Complete $m$-ary Trees
摘要:
路由和波长分配问题源于对采用波分复用(WDM)的光网络中的最优波长分配的研究。考虑一个由连通的单图$G$表示的光网络。$G$中的全对全路由$R$是连接$G$的所有顶点对的路径集合。$G$的无向光学指数是保证映射$ϕ:R\to\{1,2,\ldots,k\}$存在的最小整数$k$,使得如果$P$和$P'$在所有可能的路由$R$上具有公共边,则$ϕ(P)\neqϕ(P')$。$G$的无向光索引的自然下界是(无向)边缘转发索引,其被定义为所有可能的全对全路由上的最大边缘负载的最小值。本文首先给出了完全$m$ -叉树的光学指数的精确值,然后研究了无向光学指数和边转发指数之间的差距。
英文摘要:
The routing and wavelength assignment problem arises from the investigation of optimal wavelength allocation in an optical network that employs Wavelength Division Multiplexing (WDM). Consider an optical network that is represented by a connected, simple graph $G$. An all-to-all routing $R$ in $G$ is a set of paths connecting all pairs of vertices of $G$. The undirected optical index of $G$ is the minimum integer $k$ to guarantee the existence of a mapping $ϕ:R\to\{1,2,\ldots,k\}$, such that $ϕ(P)\neqϕ(P')$ if $P$ and $P'$ have common edge(s), over all possible routings $R$. A natural lower bound of the undirected optical index of $G$ is the (undirected) edge-forwarding index, which is defined to be the minimum of the maximum edge-load over all possible all-to-all routings. In this paper, we first derive the exact value of the optical index of the complete $m$-ary trees, and then investigate the gap between undirected optical and edge-forwarding indices.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。