From relative to observable proportional differentiation in OBS networks

ABSTRACT

This paper addresses the provision of proportional differentiated services to an arbitrary number of traffic classes in terms of the class packet loss probability measured between the ingress node and the egress node of an OBS network. Our solution relies on a key idea: OBS networks consist of bufferless nodes and can therefore be regarded as a whole like a one-hop bufferless subnetwork characterized by a collection of loss probabilities computable with simple, approximate circuit switching models. Consequently, we believe it is possible to attain packet loss proportionality merely using a simple stochastic algorithm to assemble two classes of bursts, provided there exists some form of internal relative differentiation such that one of the burst classes has a much lower loss probability than the other. In order to evaluate the algorithm accuracy in attaining the proportionality, we present an analytical study of two idealized scenarios (a single link and a multi-node symmetrical network), including the effect caused by the flow dynamics of the traffic received at the ingress nodes. Our results show that, despite its simplicity, this approach is able to provide the desired proportionality over a wide range of operating conditions.

REFERENCES

• 1: S. Blake, D. Black, M. E. Davies, Z. Wang, W. Weiss. An Architecture for Differentiated Services. RFC 2475, dec. 1998.
• 2: C. Dovrolis, P. Ramanathan. A Case for Relative Differentiated Services and the Proportional Differentiation Model. IEEE Network Mag., vol. 13(5), pp. 26--34, sep. 1999.
• 3: Constantinos Dovrolis , Dimitrios Stiliadis , Parameswaran Ramanathan, Proportional differentiated services: delay differentiation and packet scheduling, IEEE/ACM Transactions on Networking (TON), v.10 n.1, p.12-26, February 2002 [doi>10.1109/90.986503]
• 4: Y. Chen, C. Qiao. Proportional differentiation: A scalable QoS approach. IEEE Communications Mag., jun. 2003, pp. 52--58.
• 5: Y. Chen, M. Handi, D. H. K. Tsang. Proportional QoS over OBS networks. Proc. Globecom 2001, pp. 1510--1514.
• 6: H. C. Cankaya, S. Charcranoon, T. S. El-Bawab. A preemptive scheduling technique for OBS networks with service differentiation. Proc. Globecom 2003, pp. 2704--2708.
• 7: C.-W. Tan, M. Gurusamy, J. C.-S. Lui. Achieving proportional loss differentiation using probabilistic preemptive burst segmentation in optical burst switching WDM networks. Proc. Globecom 2004, pp. 1754--1758.
• 8: V. M. Vokkarane, J. P. Jue. Prioritized burst segmentation and composite burst-assembly techniques for QoS support in optical burst-switched networks. IEEE J. on Select. Areas in Comm., vol. 21, pp. 1198--1209, sep. 2003.
• 9: M. Yoo, C. Qiao, S. Dixit. QoS performance of optical burst switching in IP-over-WDM networks. IEEE J. on Select. Areas in Comm., vol. 18, pp. 2062--2071, oct. 2000.
• 10: F. Farahmand, J. Jue. Supporting QoS with look-ahead window contention resolution in optical burst switched networks. Proc. Globecom 2003, pp. 2699--2703.
• 11: M. Handley, S. Floyd, J. Padhye and J. Widmer. TCP Friendly Rate Control (TFRC): Protocol Specification. RFC 3448, Jan. 2003.
• 12: Jitendra Padhye , Victor Firoiu , Donald F. Towsley , James F. Kurose, Modeling TCP Reno performance: a simple model and its empirical validation, IEEE/ACM Transactions on Networking (TON), v.8 n.2, p.133-145, April 2000 [doi>10.1109/90.842137]
• 13: A. Detti and M. Listanti, Impact of Segments Aggregation on TCP Reno Flows in Optical Burst Switching Networks, Proceedings of INFOCOMM, vol. 3, pp. 1803--1812, 2002.
• 14: M. Izal and J. Aracil,On the Influence of Self-similarity on Optical Burst Switching Traffic, Proceedings of GLOBECOM, vol. 3, pp. 17--21, 2002.
• 15: Z. Rosberg, H. Vu, M. Zukerman, J. White Blocking Probabilities of Optical Burst Switching Networks Based on Reduced Load Fixed Point Approximations. Proc. IEEE Infocom 2003.
• 16: Keith W. Ross , Peter J. Hancock, Multiservice Loss Models for Broadband Telecommunication Networks, Springer-Verlag New York, Inc., Secaucus, NJ, 1995
• 17: H. L. Vu and M. Zukerman,Blocking Probability for Priority Classes in Optical Burst Switching Networks, IEEE Communications Letters, vol. 6, num. 5, pp. 214--216, May. 2002.
• 18: K. Dolzer, C. Gauger, J. Späth and S. Bodamer, Evaluation of Reservation Mechanisms for Optical Burst Switching, AEÜ Int. J. Electron. Commun., vol. 55, num. 1

INDEX TERMS

Primary Classification:
  G. Mathematics of Computing
  G.3 PROBABILITY AND STATISTICS
      Subjects: Queueing theory

Additional Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design
          Subjects: Network communications

General Terms:
Algorithms

Keywords:
optical burst switching, proportional differentiation