On the Existence of K5 \setminuse-Designs with Application to Optical Networks

Motivated by the connection between graph decompositions and traffic grooming in optical networks, we continue the investigation of the existence problem for $(K_5 \setminus e)$-designs of order $n$. It is proved that the necessary conditions for the existence of such designs are also sufficient with 3 definite exceptions $(n=9,10,18)$ and 12 possible exceptions with $n=234$ being the largest. This gives a near solution for the long standing problem posed by Bermond et al. in [Ars Combin., 10 (1980), pp. 211-254]. As a consequence, we also give an optimal grooming on $n$ nodes with $C=9$ when such a $(K_5 \setminus e)$-design of order $n$ exists.

[1]  Gennian Ge,et al.  On the existence of resolvable K4 − e designs , 2007 .

[2]  Ori Gerstel,et al.  Wavelength assignment in a WDM ring to minimize cost of embedded SONET rings , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[3]  David Coudert,et al.  Traffic grooming in unidirectional WDM ring networks using design theory , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[4]  Charles J. Colbourn,et al.  Grooming in unidirectional rings: K4-e designs , 2004, Discret. Math..

[5]  Jian Wang,et al.  Improved approaches for cost-effective traffic grooming in WDM ring networks: ILP formulations and single-hop and multihop connections , 2001 .

[6]  George N. Rouskas,et al.  On optimal traffic grooming in WDM rings , 2002, IEEE J. Sel. Areas Commun..

[7]  Rolf S. Rees,et al.  Two new direct product-type constructions for resolvable group-divisible designs , 1993 .

[8]  Ori Gerstel,et al.  Cost-effective traffic grooming in WDM rings , 2000, TNET.

[9]  Eytan Modiano,et al.  Traffic grooming in WDM networks , 2001, IEEE Commun. Mag..

[10]  A.L. Chiu,et al.  Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks , 2000, Journal of Lightwave Technology.

[11]  Hanfried Lenz,et al.  Design theory , 1985 .

[12]  Andries E. Brouwer.  Mutually orthogonal latin squares , 1978 .

[13]  Jian-Qiang Hu,et al.  Optimal traffic grooming for wavelength-division-multiplexing rings with all-to-all uniform traffic , 2002 .

[14]  Peng-Jun Wan,et al.  Grooming of arbitrary traffic in SONET/WDM BLSRs , 2000, IEEE Journal on Selected Areas in Communications.

[15]  David Coudert,et al.  Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming Ratio C = 6 , 2005, SIAM J. Discret. Math..

[16]  Chunming Qiao,et al.  An effective and comprehensive approach for traffic grooming and wavelength assignment in SONET/WDM rings , 2000, TNET.

[17]  George N. Rouskas,et al.  Traffic grooming in WDM networks: past and future , 2002, IEEE Netw..

[18]  Jean-Claude Bermond,et al.  Traffic Grooming in Unidirectional WDM Ring Networks: the all-to-all unitary case , 2003 .

[19]  Jean-Claude Bermond,et al.  Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3 , 2003, Networks.

[20]  Dorit S. Hochbaum,et al.  The SONET edge-partition problem , 2003, Networks.

[21]  Jean-Claude Bermond,et al.  Decomposition of complete graphs into isomorphic subgraphs with five vertices , 1980 .

[22]  Gennian Ge,et al.  Constructions of Quad-Rooted Double Covers , 2005, Graphs Comb..

[23]  Xin Yuan,et al.  Wavelength assignment to minimize the number of SONET ADMs in WDM rings , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).