Grooming node placement in switched multilayer networks~

In switched multilayer optical networks the bandwidth required by a demand is usually less than the capacity of a �� -channel. Thus it is worth multiplexing more demands into a single �� -channel. This process is called traffic grooming. However, it is too expensive and not always necessary to build this functionality into all network nodes. At low network load, having fewer grooming-nodes it is sufficient to attain relatively low blocking probability. In this paper we investigate how to choose a given number of grooming capable nodes in the network to minimize blocking probability (blocking ratio). We introduce a model of an optical network and define the procedure of grooming traffic demands together. We describe three algorithms that choose which nodes to be grooming- capable. The first one is a greedy algorithm the second one is based on topological properties of nodes while the third searches for a minimal covering vertex set in a certain sense. The performance of these algorithms is then investigated. We also study how the number of grooming-enabled nodes influences the fairness of the network, i.e. the equality of provisioning demands with different bandwidth requirements.

[1]  Tibor Cinkler.  Traffic and ? grooming , 2003 .

[2]  Biswanath Mukherjee,et al.  A comprehensive study on next-generation optical grooming switches , 2003, IEEE J. Sel. Areas Commun..

[3]  Imrich Chlamtac,et al.  Lightpath (Wavelength) Routing in Large WDM Networks , 1996, IEEE J. Sel. Areas Commun..

[4]  Biswanath Mukherjee,et al.  Dynamic traffic grooming in WDM mesh networks using a novel graph model , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[5]  Karsten P. Ulland,et al.  Vii. References , 2022 .

[6]  Tibor Cinkler.  Traffic and /spl lambda/ grooming , 2003 .

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

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

[9]  Biswanath Mukherjee,et al.  A Review of Traffic Grooming in WDM Optical Networks: Architectures and Challenges , 2002 .

[10]  Biswanath Mukherjee,et al.  A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks , 2003, TNET.

[11]  George N. Rouskas,et al.  On optimal traffic grooming in WDM rings , 2001, SIGMETRICS '01.

[12]  Arun K. Somani,et al.  Capacity fairness of WDM networks with grooming capabilities , 2000, Other Conferences.

[13]  Biswanath Mukherjee,et al.  Design of WDM mesh networks with sparse grooming capability , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.