Simple alternate routing for differentiated services networks

Recent work on differentiated services in the Internet has defined new notions of Quality of Service (QoS) that apply to aggregates of traffic in networks with coarse spatial granularity. Most proposals for differentiated services involve traffic control algorithms for aggregate service levels, packet marking and policing, and preferential treatment of marked packets in the network core. The issue of routing for enhancing aggregate QoS has not received a lot of attention. This study investigates the potential benefit of using alternate routing strategies in support of differentiated services. We propose a traffic control scheme, called Simple Alternate Routing, wherein portions of unmarked packet flows can be assigned to alternate paths through a Service Provider Network (SPN) in response to congestion feedback information. The scheme is simple, requiring only minor changes to the SPN border routers so that alternately routed packets can be tunneled via conventional paths to an intermediate border node and then tunneled from there to the original egress border node. We present distributed algorithms for (1) discovering congestion within the SPN, and (2) allocating traffic to alternate paths that are uncongested. We have implemented the scheme in a packet-level simulation, and we have examined the transient response of the algorithm to perturbations in the nominal traffic levels experienced by the SPN. The experimental study of this paper provides some understanding of the scheme''s ability to adapt in routing packets around congestion. Our results indicate that the alternate routing framework shows promise and warrants further consideration.

[1]  Fred Baker,et al.  Assured Forwarding PHB Group , 1999, RFC.

[2]  Ariel Orda,et al.  Networks with advance reservations: the routing perspective , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[3]  Van Jacobson,et al.  An Expedited Forwarding PHB , 1999, RFC.

[4]  Satish K. Tripathi,et al.  Intradomain QoS routing in IP networks: a feasibility and cost/benefit analysis , 1999, IEEE Netw..

[5]  Gerald R. Ash,et al.  An analytical model for adaptive routing networks , 1993, IEEE Trans. Commun..

[6]  Klara Nahrstedt,et al.  Distributed quality-of-service routing in high-speed networks based on selective probing , 1998, Proceedings 23rd Annual Conference on Local Computer Networks. LCN'98 (Cat. No.98TB100260).

[7]  Scott Shenker,et al.  Specification of Guaranteed Quality of Service , 1997, RFC.

[8]  Anees Shaikh,et al.  Evaluating the overheads of source-directed quality-of-service routing , 1998, Proceedings Sixth International Conference on Network Protocols (Cat. No.98TB100256).

[9]  Ariel Orda,et al.  QoS based routing in networks with inaccurate information: theory and algorithms , 1997, Proceedings of INFOCOM '97.

[10]  Van Jacobson,et al.  A Two-bit Differentiated Services Architecture for the Internet , 1999, RFC.

[11]  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).

[12]  Hussein M. Abdel-Wahab,et al.  An efficient packet service algorithm for high-speed ATM switches , 1998, Comput. Commun..

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

[14]  Raj Jain,et al.  Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks , 1989, Comput. Networks.

[15]  Eric S. Crawley,et al.  A Framework for QoS-based Routing in the Internet , 1998, RFC.

[16]  Srihari Nelakuditi,et al.  Adaptive proportional routing: a localized QoS routing approach , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[17]  D. O. Awduche,et al.  MPLS and traffic engineering in IP networks , 1999, IEEE Commun. Mag..

[18]  Adrian Segall,et al.  QoS routing using alternate paths , 1998, J. High Speed Networks.

[19]  Srinivasan Keshav.  Congestion control in computer networks , 1991 .

[20]  William Allen Simpson,et al.  IP in IP Tunneling , 1995, RFC.

[21]  Walter Willinger,et al.  Self-similarity through high-variability: statistical analysis of Ethernet LAN traffic at the source level , 1997, TNET.

[22]  G. Ash,et al.  Servicing and real-time control of networks with dynamic routing , 1981, The Bell System Technical Journal.

[23]  D. Clark.  Adding service discrimination to the Internet , 1996 .

[24]  Peter Key,et al.  Dynamic Alternative Routing - Modelling and Behaviour , 1988 .

[25]  Douglas S. Reeves,et al.  A distributed algorithm for delay-constrained unicast routing , 1997, Proceedings of INFOCOM '97.

[26]  J. Moy,et al.  OSPF: Anatomy of an Internet Routing Protocol , 1998 .

[27]  R. H. Cardwell,et al.  Design and optimization of networks with dynamic routing , 1981, The Bell System Technical Journal.

[28]  K. K. Ramakrishnan,et al.  A binary feedback scheme for congestion avoidance in computer networks with a connectionless network layer , 1988, SIGCOMM '88.

[29]  Satish K. Tripathi,et al.  Quality of service based routing: a performance perspective , 1998, SIGCOMM '98.

[30]  John Moy.  OSPF Version 2 , 1991, RFC.

[31]  Mark Crovella,et al.  Measuring Bottleneck Link Speed in Packet-Switched Networks , 1996, Perform. Evaluation.

[32]  Klara Nahrstedt,et al.  An overview of quality of service routing for next-generation high-speed networks: problems and solutions , 1998, IEEE Netw..

[33]  Ariel Orda,et al.  QoS routing in networks with inaccurate information: theory and algorithms , 1999, TNET.

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

[35]  Peter Steenkiste,et al.  On path selection for traffic with bandwidth guarantees , 1997, Proceedings 1997 International Conference on Network Protocols.

[36]  David D. Clark,et al.  Explicit allocation of best-effort packet delivery service , 1998, TNET.

[37]  Debasis Mitra,et al.  Comparative evaluations of randomized and dynamic routing strategies for circuit-switched networks , 1991, IEEE Trans. Commun..

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

[39]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[40]  Ariel Orda,et al.  QoS routing: the precomputation perspective , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[41]  David Clark,et al.  An Approach to Service Allocation in the Internet , 1997 .

[42]  Scott Shenker,et al.  Integrated Services in the Internet Architecture : an Overview Status of this Memo , 1994 .

[43]  Klara Nahrstedt,et al.  On finding multi-constrained paths , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[44]  Ariel Orda,et al.  QoS routing in networks with uncertain parameters , 1998, IEEE/ACM Trans. Netw..