Service-Sensitive Routing in DiffServ/MPLS Networks

SUMMARY This study investigates the problem of unfairness when QoS routing does not consider the mix of traffic classes. Unfairness is mainly caused by routing different traffic flows of the same class through paths with extremely different traffic mixtures, involving various service classes.Next, a new routing scheme— (SSR), which takes the state of traffic mixture of the various service classes into account, is proposed.To determine the QoS route for a flow request, SSR not only considers the available bandwidth and delay of the candidate paths, but also considers the mix of traffic classes on the paths.Additionally, the hybrid granularity routing decision in SSR scheme is scalable and suitable for the and MPLS networks.Extensive simulations show that SSR can effectively reduce the variance of the average of queuing delays, for example by approximately 20% to 35% for a moderate offered load, compared to the shortest path routing.Furthermore, this routing scheme reduces the fractional reward loss and bandwidth blocking probability.

[1]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM '89.

[2]  Peter Steenkiste,et al.  Supporting dynamic inter-class resource sharing: a multi-class QoS routing algorithm , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[3]  Lixia Zhang,et al.  VirtualClock: a new traffic control algorithm for packet-switched networks , 1991, TOCS.

[4]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.

[5]  B. Ohlman,et al.  A Framework for Differentiated Services , 1998 .

[6]  Ariel Orda,et al.  QoS Routing Mechanisms and OSPF Extensions , 1999, RFC.

[7]  George Varghese,et al.  Efficient fair queueing using deficit round robin , 1995, SIGCOMM '95.

[8]  George Swallow,et al.  A framework for multiprotocol label switching , 1999 .

[9]  Lixia Zhang.  VirtualClock: A New Traffic Control Algorithm for Packet-Switched Networks , 1991, ACM Trans. Comput. Syst..

[10]  Roch Guérin,et al.  Implementation and performance measurements of QoS routing extensions to OSPF , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[11]  David L. Black,et al.  Definition of the Differentiated Services Field (DS Field) in the IPv4 and IPv6 Headers , 1998, RFC.

[12]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[13]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .

[14]  A. Orda,et al.  QoS routing mechanisms and OSPF extensions , 1997, GLOBECOM 97. IEEE Global Telecommunications Conference. Conference Record.

[15]  Srinivasan Keshav,et al.  A Framework for Differentiated Services , 1999 .

[16]  Zheng Wang,et al.  An Architecture for Differentiated Services , 1998, RFC.

[17]  Dino Farinacci,et al.  MPLS Label Stack Encoding , 2001, RFC.

[18]  S. Jamaloddin Golestani,et al.  A self-clocked fair queueing scheme for broadband applications , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[19]  Yakov Rekhter,et al.  A Provider Architecture for Differentiated Services and Traffic Engineering (PASTE) , 1998, RFC.