On the resource efficiency of virtual concatenation in SDH/SONET mesh transport networks bearing protected scheduled connections

Journal of Lightwave Technology

Volumn 23, Issue 10, 2005, Pages 3012-3023

  Kuri, Josué ^a   Gagnaire, Maurice ^a   Puech, Nicolas ^a  

^a INSTITUT TELECOM   (France)

Author keywords

Network optimization; Scheduled connections; Synchronous Digital Hierarchy (SDH) Synchronous Optical Network (SONET); Virtual concatenation (VCAT)

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; FIBER OPTIC NETWORKS; HEURISTIC METHODS; MATHEMATICAL MODELS; RESOURCE ALLOCATION; SIMULATED ANNEALING;

SCHEDULED CONNECTIONS; SYNCHRONOUS DIGITAL HIERARCHY (SDH); SYNCHRONOUS OPTICAL NETWORK (SON); VIRTUAL CONCATENATION;

OPTICAL COMMUNICATION;

EID: 27844461550     PISSN: 07338724     EISSN: None     Source Type: Journal    
DOI: 10.1109/JLT.2005.856246     Document Type: Article

References (25)

1. ITU-T, Recommendation G.707, Network Node Interface for the Synchronous Digital Hierarchy (SDH), Oct. 2000.
2. ITU-T, Recommendation G.707, Recommendation G.7041/1303, Genetic Framing Procedure (GFP), Oct. 2001.
3. ITU-T, Recommendation G.707, Recommendation G.872, Architecture of Optical Transport Networks, Nov. 2001.
4. ITU-T, Recommendation G.707, Recommendation G.7042/1305, Link Capacity Adjustment Scheme (LCAS) for Virtual Concatenated Signals, Feb. 2004.
5. J. Kuri, N. Puech, M. Gagnaire, and E. Dotaro, "Routing and wavelenph assignment of scheduled lightpath demands in a WDM optical transport network," in Proc. Int. Conf. Optical Communications and Networks (ICOCN), Singapore. New York: IEEE Commun. Soc., Nov. 2002, pp. 270-273.
6. J. Kuri, N. Puech, M. Gagnaire, and E. Dotaro, "Routing foreseeable lightpath demands using a tabu search meta-heuristic," in Proc. IEEE Global Telecommunications (GLOBECOM), Taipei, Taiwan. New York: IEEE Commun. Soc., Nov. 2002, pp. 2803-2807.
7. J. Kuri, N. Puech, M. Gagnaire, E. Dotaro, and R. Douville, "Routing and wavelength assignment of scheduled lightpath demands," IEEE J. Sel. Areas Commun., vol. 21, no. 8, pp. 1231-1240, Oct. 2003.
8. J. Kuri, N. Puech, and M. Gagnaire, "Diverse routing of scheduled light-path demands in an optical transport network," in Proc. Design Reliable Communications Networks (DRCN), Banff, AB, Canada. New York: IEEE Communi. Soc., Oct. 2003, pp. 69-76.
9. J. Kuri, "Optimization problems in WDM optical transport networks with scheduled lightpath demands," Ph.D. thesis, Ecole Nationale Supérieure des Télécommunications, Paris, France, Sep. 2003.
10. K. Papagiannaki, N. Taft, and A. Lakhina, "A distributed approach to measure IP traffic matrices," in Proc. Association Computing Machinery Special Interest Group Data Communication (ACM SIGCOMM) Internet Measurement Conf., Taormina, Italy, Oct. 2004, pp. 161-174.
11. Abilene Backbone Network, Advanced Networking for Research and Education. [Online]. Available: http://abilene.internet2.edu/
12. P. Barford and D. Plonka, "Characteristics of network traffic flow anomalies," in Proc. Association for Computing Machinery Special Interest Group on Data Communication (ACM SIG COMM) Internet Measurement Workshop, San Francisco, CA, Nov. 2001, pp. 69-73.
13. J. Jung, B. Krishnamurthy, and M. Ravinovitch, "Flash crowds and denial of service attacks: Characterization and implications for CDNs and web sites," in Proc. 11th World Wide Web Conf., Honolulu, HI, May 2002, pp. 293-304.
14. M. Koubàa, N. Puech, and M. Gagnaire, "Routing and wavelength assignment of scheduled and random lightpath demands," in Proc. 1st IFIP Int. Conf. Wireless and Optical Communications Networks. Muscat, Oman: IFIP, Jun. 2004, pp. 16-19.
15. M. Koubàa, N. Puech, and M. Gagnaire, "Routing and wavelength assignment for scheduled and random lightpath demands: Bifurcated versus non-bifurcated routing," in Proc. IFIP Optical Networks & Technologies Conf. (OpNeTec). Pisa, Italy: IFIP, Oct, 2004, pp. 137-144.
16. W. D. Grover, Mesh-Based Survivable Networks. Upper Saddle River, NJ: Prentice-Hall, 2003.
17. T. Li, B. Wang, C. Xin, and X. Zhang, "On survivable service provisioning in WDM optical networks under a scheduled traffic model," in Proc. IEEE Global Telecommunications (GLOBECOM), Saint Luis, MO, Nov. 2005.
18. D. Eppstein, "Finding the k shortest paths," SIAM J. Comput., vol. 28, no. 2, pp. 652-673, 1998.
19. Z. Tuza, "Graph colorings with local constraints - A survey," Discuss. Math., vol. 17, no. 2, pp. 161-228, 1997.
20. D. Matula, G. Marble, and I. Isaacson, "Graph colouring algorithms," in Graph Theory and Computing, R. Read, Ed. New York: Academic, 1972, pp. 109-122.
21. R. Murphey, P. Pardalos, and M. Resende, "Frequency assignment problems," AT&T Research, Tech. Rep. TR 98.16.1, 1999.
22. R. Murphey, P. Pardalos, and M. Resende, Handbook of Combinatorial Optimization. Boston, MA: Kluwer, 1999.
23. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, "Optimization by simulated annealing," Science, vol. 220, no. 4598, pp. 671-680, May 1983.
24. GÉANT, Pan-European Research and Education Network. [Online]. Available: http://www.dante.net/geant/
25. C. Fraleigh, F. Tobagi, and C. Diot, "Provisioning IP backbone networks to support latency sensitive traffic," in Proc. IEEE Information Communications (INFOCOM), San Francisco, CA, Mar. 2003, pp. 375-385.