Abstract
In a WDM network, routing a request consists in assigning it a route in the physical network and a wavelength. If each request uses at most 1/C of the bandwidth of the wavelength, we will say that the grooming factor is C. That means that on a given edge of the network we can groom (group) at most C requests on the same wavelength. With this constraint the objective can be either to minimize the number of wavelengths (related to the transmission cost) or minimize the number of Add Drop Multiplexer (shortly ADM) used in the network (related to the cost of the nodes). Here we consider the case where the network is a path on N nodes, P N . Thus the routing is unique. For a given grooming factor C minimizing the number of wavelengths is an easy problem, well known and related to the load problem. But minimizing the number of ADM’s is NP-complete for a general set of requests and no results are known. Here we show how to model the problem as a graph partition problem and using tools of design theory we completely solve the case where C = 2 and where we have a static uniform all-to-all traffic (requests being all pairs of vertices).
This work has been partially funded by European projects fet Crescco and COST 293 Graal, and has been done in the crc Corso with France Telecom.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Beauquier, B., Bermond, J.-C., Gargano, L., Hell, P., Pérennes, S., Vaccaro, U.: Graph problems arising from wavelength-routing in all-optical networks. In: IEEE Workshop on Optics and Computer Science, Geneva, Switzerland (April 1997)
Bermond, J.-C., Ceroi, S.: Minimizing SONET ADMs in unidirectional WDM ring with grooming ratio 3. Networks 41(2) (February 2003)
Bermond, J.-C., Colbourn, C.J., Ling, A., Yu, M.-L.: Grooming in unidirectional rings: K 4 − e designs. Discrete Mathematics, Lindner’s Volume 284(1-3), 57–62 (2004)
Bermond, J.-C., Coudert, D.: Traffic grooming in unidirectional WDM ring networks using design theory. In: IEEE ICC, Anchorage, Alaska (May 2003)
Bermond, J.-C., Coudert, D., Muñoz, X.: Traffic grooming in unidirectional WDM ring networks: the all-to-all unitary case. In: IFIP ONDM, February 2003, pp. 1135–1153 (2003)
Chiu, A.L., Modiano, E.H.: Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks. IEEE/OSA Journal of Lightwave Technology 18(1), 2–12 (2000)
Colbourn, C.J., Dinitz, J.H. (eds.): The CRC handbook of Combinatorial designs. CRC Press, Boca Raton (1996)
Coudert, D., Rivano, H.: Lightpath assignment for multifibers WDM optical networks with wavelength translators. In: IEEE Globecom, Taipei, Taiwan (November 2002)
Dor, D., Tarse, M.: Graph decomposition is NP-complete: a complete proof of Holyer’s conjecture. SIAM Journal on Computing 26(4), 1166–1187 (1997)
Dutta, R., Huang, S., Rouskas, N.: On optimal traffic grooming in elemental network topologies. In: Opticomm, Dallas, October 2003, pp. 13–24 (2003)
Dutta, R., Rouskas, N.: A survey of virtual topology design algorithms for wavelength routed optical networks. Optical Networks 1(1), 73–89 (2000)
Dutta, R., Rouskas, N.: On optimal traffic grooming in WDM rings. IEEE Journal of Selected Areas in Communications 20(1), 1–12 (2002)
Dutta, R., Rouskas, N.: Traffic grooming in WDM networks: Past and future. IEEE Network 16(6), 46–56 (2002)
Epstein, L., Levin, A.: Better bounds for minimizing sonet adms. In: Persiano, G., Solis-Oba, R. (eds.) WAOA 2004. LNCS, vol. 3351, pp. 281–294. Springer, Heidelberg (2005)
Gerstel, O., Lin, P., Sasaki, G.: Wavelength assignment in a WDM ring to minimize cost of embedded SONET rings. In: IEEE Infocom, San Francisco, California, pp. 94–101 (1998)
Gerstel, O., Ramaswani, R., Sasaki, G.: Cost-effective traffic grooming in WDM rings. IEEE/ACM Transactions on Networking 8(5), 618–630 (2000)
Goldschmidt, O., Hochbaum, D., Levin, A., Olinick, E.: The SONET edge-partition problem. Networks 41(1), 13–23 (2003)
Holyer, I.: The NP-completeness of some edge-partition problems. SIAM Journal on Computing 10(4), 713–717 (1981)
Hu, J.Q.: Optimal traffic grooming for wavelength-division-multiplexing rings with all-to-all uniform traffic. OSA Journal of Optical Networks 1(1), 32–42 (2002)
Hu, J.Q.: Traffic grooming in wdm ring networks: A linear programming solution. OSA Journal of Optical Networks 1(11), 397–408 (2002)
Lindner, C.C., Rodger, C.A.: Design Theory. CRC Press, Boca Raton (1997), ISBN 0849339863
Modiano, E., Lin, P.: Traffic grooming in WDM networks. IEEE Communications Magazine 39(7), 124–129 (2001)
Shalom, M., Zaks, S.: A 10/7 + ε approximation for minimizing the number of adms in sonet rings. In: IEEE BroadNets, October 2004, pp. 254–262 (2004)
Somani, A.: Survivable traffic grooming in WDM networks. In: Gautam, D.K. (ed.) Broad band optical fiber communications technology – BBOFCT, Jalgaon, India, December 2001, pp. 17–45 (2001); Nirtali Prakashan (invited paper)
Wan, P.-J., Calinescu, G., Liu, L., Frieder, O.: Grooming of arbitrary traffic in SONET/WDM BLSRs. IEEE Journal of Selected Areas in Communications 18(10), 1995–2003 (2000)
Wang, J., Cho, W., Vemuri, V., Mukherjee, B.: Improved approches for cost-effective traffic grooming in WDM ring networks: Ilp formulations and single-hop and multihop connections. IEEE/OSA Journal of Lightwave Technology 19(11), 1645–1653 (2001)
Yuan, X., Fulay, A.: Wavelength assignment to minimize the number of SONET ADMs in WDM rings. In: IEEE ICC, New York (April 2002)
Zhang, X., Qiao, C.: An effective and comprehensive approach for traffic grooming and wavelength assignment in SONET/WDM rings. IEEE/ACM Transactions on Networking 8(5), 608–617 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bermond, JC., Braud, L., Coudert, D. (2005). Traffic Grooming on the Path. In: Pelc, A., Raynal, M. (eds) Structural Information and Communication Complexity. SIROCCO 2005. Lecture Notes in Computer Science, vol 3499. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11429647_5
Download citation
DOI: https://doi.org/10.1007/11429647_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26052-3
Online ISBN: 978-3-540-32073-9
eBook Packages: Computer ScienceComputer Science (R0)