Traffic Engineering in G-MPLS networks with QoS guarantees

In this paper a new Traffic Engineering (TE) scheme to efficiently route sub-wavelength requests with different QoS requirements is proposed for G-MPLS networks. In most previous studies on TE based on dynamic traffic grooming, the objectives were to minimize the rejection probability by respecting the constraints of the optical node architecture, but without considering service differentiation. In practice, some high-priority (HP) connections can instead be characterized by specific constraints on the maximum tolerable end-to-end delay and packet-loss ratio. The proposed solution consists of a distributed two-stage scheme: each time a new request arrives, an on-line dynamic grooming scheme finds a route which fulfills the QoS requirements. If a HP request is blocked at the ingress router, a preemption algorithm is executed locally in order to create room for this traffic. The proposed preemption mechanism minimizes the network disruption, both in term of number of rerouted low-priority connections and new set-up lightpaths, and the signaling complexity. Extensive simulation experiments are performed to demonstrate the efficiency of our scheme.

[1]  Luís Gouveia,et al.  MPLS over WDM network design with packet level QoS constraints based on ILP models , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[2]  Seung-Woo Seo,et al.  An algorithm for virtual topology design in WDM optical networks under physical constraints , 1999, 1999 IEEE International Conference on Communications (Cat. No. 99CH36311).

[3]  Lou Berger,et al.  Generalized Multi-Protocol Label Switching (GMPLS) Signaling Resource ReserVation Protocol-Traffic Engineering (RSVP-TE) Extensions , 2003, RFC.

[4]  Kireeti Kompella,et al.  OSPF Extensions in Support of Generalized MPLS , 2001 .

[5]  Mauro Brunato,et al.  A Multistart Randomized Greedy Algorithm for Traffic Grooming on Mesh Logical Topologies , 2002, ONDM.

[6]  Gurusamy Mohan,et al.  Differentiated QoS routing in GMPLS-based IP/WDM networks , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[7]  Debasish Datta,et al.  Impact of transmission impairments on the teletraffic performance of wavelength-routed optical networks , 1999 .

[8]  Alpár Jüttner,et al.  Minimizing re-routing in MPLS networks with preemption-aware constraint-based routing , 2002, Comput. Commun..

[9]  Murali S. Kodialam,et al.  Integrated dynamic IP and wavelength routing in IP over WDM networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[10]  Amr Mohamed,et al.  Quality-of-service mechanisms in IP-over-WDM networks , 2002, IEEE Commun. Mag..

[11]  Ayan Banerjee,et al.  Generalized multiprotocol label switching: an overview of routing and management enhancements , 2001, IEEE Commun. Mag..

[12]  Wen-De Zhong,et al.  Connection Establishment of Label Switched Paths in IP/MPLS over Optical Networks , 2004, Photonic Network Communications.

[13]  Ajay D. Kshemkalyani,et al.  Connection preemption: issues, algorithms, and a simulation study , 1997, Proceedings of INFOCOM '97.

[14]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the multiple node case , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[15]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the multiple node case , 1994, TNET.

[16]  Francois Le Faucheur,et al.  Protocol Extensions for Support of Diffserv-aware MPLS Traffic Engineering , 2005, RFC.

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

[18]  Ian F. Akyildiz,et al.  A new preemption policy for DiffServ-aware traffic engineering to minimize rerouting , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.