The undirected optical indices of complete m-ary trees

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 $\phi:R\to\{1,2,\ldots,k\}$, such that $\phi(P)\neq\phi(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.

[1]  Olivier Togni,et al.  All-to-all wavelength-routing in all-optical compound networks , 2001, Discret. Math..

[2]  Marie-Claude Heydemann,et al.  On forwarding indices of networks , 1989, Discret. Appl. Math..

[3]  Ivan P. Kaminow,et al.  A Precompetitive Consortium on Wide-band All Optical Networks , 1993 .

[4]  Lata Narayanan,et al.  All-to-All Optical Routing in Chordal Rings of Degree 4 , 2001, Algorithmica.

[5]  Wing Shing Wong,et al.  The Global Packing Number of a Fat-Tree Network , 2017, IEEE Transactions on Information Theory.

[6]  Fuji Zhang,et al.  Expanding and forwarding parameters of product graphs , 2004, Discret. Appl. Math..

[7]  Heiko Schröder,et al.  Optical All-to-All Communication for Some Product Graphs , 1997, SOFSEM.

[8]  H. Yap.  Total Colourings of Graphs , 1996 .

[9]  Adrian Kosowski.  Forwarding and optical indices of a graph , 2009, Discret. Appl. Math..

[10]  Stéphane Pérennes,et al.  All-to-all routing and coloring in weighted trees of rings , 1999, SPAA '99.

[11]  Meirun Chen,et al.  On f-fault tolerant arc-forwarding and optical indices of all-optical folded hypercubes , 2009, Inf. Process. Lett..

[12]  Sanming Zhou,et al.  Forwarding and optical indices of 4-regular circulant networks , 2014, J. Discrete Algorithms.

[13]  Stéphane Pérennes,et al.  Efficient collective communication in optical networks , 1996, Theor. Comput. Sci..

[14]  L. Gargano.  Colouring all directed paths in a symmetric tree with applications to WDM routing , 1997 .

[15]  Adel A. M. Saleh,et al.  All-Optical Networking—Evolution, Benefits, Challenges, and Future Vision , 2012, Proceedings of the IEEE.

[16]  P. Hell,et al.  Graph Problems Arising from Wavelength-Routing in All-Optical Networks , 2004 .

[17]  Bruno Beauquier,et al.  All-to-all communication for some wavelength-routed all-optical networks , 1999, Networks.

[18]  Wing Shing Wong,et al.  The Global Packing Number for an Optical Network , 2015, ArXiv.

[19]  Jun-Ming Xu,et al.  The Forwarding Indices of Graphs -- a Survey , 2012, ArXiv.

[20]  Gordon T. Wilfong.  Minimum Wavelength in an All-Optical Ring Network , 1996, ISAAC.

[21]  Long Li,et al.  A novel approach for all-to-all routing in all-optical hypersquare torus network , 2016, Conf. Computing Frontiers.

[22]  Patrick Solé,et al.  Expanding and Forwarding , 1995, Discret. Appl. Math..