skip to main content
article

Granular differentiated queueing services for QoS: structure and cost model

Published:01 April 2005Publication History
Skip Abstract Section

Abstract

One weakness of DiffServ is the lack of granularity for QoS guaranteed services, which makes it difficult to cost-effectively support end-to-end (e2e) QoS according to the e2e situation (e.g., path lengths) of applications. With the conventional packet-level QoS mechanisms for the regulated traffic, i.e., buffer admission control plus output schedulers in general, increasing service granularity may inevitably complicate implementation and/or impact scalability since sophisticated output schedulers seem necessary in this case. In this paper, a new structure, Differentiated Queueing Services (DQS), is discussed to handle the above issue. DQS tries to provide granular and scalable QoS guaranteed services to be selected by users according to their QoS requirements and e2e situation. Its basic idea is to convert packet delay guarantee into packet loss ratio guarantee with either dropping or marking the packets whose e2e delays are perceived unable to be guaranteed. Packets are queued according to their e2e delay requirements so that various delay bounds can be guaranteed without using sophisticated output schedulers while different packet loss ratios are mainly controlled by call admission control (CAC). To this end, the e2e QoS requirement is carried by each packet to avoid storing such information in network units for scalability. On the other hand, differentiated services should also be accomplished with a differentiated cost model for pricing, not only for the profits of both the service provider and the user, but also to prevent good services from being abused. So, a cost model for differentiated QoS services provided by DQS is also discussed with a possible CAC based on the exponentially bounded burstiness traffic.

References

  1. E.W. Knightly and N.B. Shroff, "Admission control for statistical QoS: theory and practice," IEEE Network Mag., pp. 20--29, Mar./Apr. 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. H. Zhang, "Service disciplines for guaranteed performance service in packet-switching networks," Proc. The IEEE, vol. 83, no. 10, pp. 1374--1396, Oct. 1995.]]Google ScholarGoogle ScholarCross RefCross Ref
  3. V. Jacobson, K. Nichols, and K. Poduri, "An expedited forwarding PHB," IETF RFC 2598, Jun. 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. B. Davie, A. Charny, J.C.R. Bennett, K. Benson, J.Y. Le Boudec, W. Courtney, S. Davari, V. Firoiu, and D. Stiliadis, "An expedited forwarding (PHB) per-hop behavior," IETF RFC 3246, Mar. 2002.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. A. Charny, J.C.R. Bennett, K. Benson, J.Y. Le Boudec, A. Chiu, W. Courtney, S. Davari, V. Firoiu, C. Kalmanek, and K.K. Ramakr-ishnan, "Supplemental information for the new definition of the EF PHB (expedited forwarding per-hop behavior)," IETF RFC 3247, Mar. 2002.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. J. Heinanen, F. Baker, W. Weiss, and J. Wroclawaski, "Assured forwarding PHB group," IETF RFC 2597, Jun. 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. N. Benameur, S.B. Fredj, S. Oueslati-Boulahia, and J.W. Roberts, "Quality of service and flow level admission control in the Internet," Computer Net., vol. 40, pp. 57--71, 2002.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. I. Foster, C. Kesselman, and S. Tuecke, "The anatomy of the grid: enabling scalable virtual organizations," Int. J. Supercomputer Applicatins, no. 3, pp. 200--222, Jan. 2001.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, and W. Weiss, "An architecture for differentiated dervices," IETF RFC 2475, Dec. 1998.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. I. Stoica and H. Zhang, "Providing guaranteed services without per flow management," in Proc. ACM SIGCOMM, Cambridge MA, USA, Sep. 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Z.L. Zhang, Z.H. Duan, L.X. Gao, and Y.W.-T. Hou, "Decoupling QoS control from core routers: a novel bandwidth broker architecture for scalable support of guaranteed services," in Proc. ACM SIGCOMM, Stockholm, Sweden, Aug. 2000.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Y.M. Jiang, "LBFA: a stateless approach to scalable support of end-to-end per-flow service guarantees," in submission of INFOCOM'04, Jul. 2003.]]Google ScholarGoogle Scholar
  13. R. Guérin, S. Kamat, V. Peris, and R. Rajan, "Scalable QoS provision through buffer management," in Proc. ACM SIGCOMM, Vancouver, Canada, Sep. 1998.]]Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. C. Dovrolis, D. Stiliadis, and P. Ramanathan, "Proportional differen-tiated services: delay differentiation and packet scheduling," in Proc. ACM SIGCOMM, Cambridge MA, USA, Sep. 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. J. Roberts and S. Oueslati-Boulahia, "Quality of service by flow-aware networking," Phil Trans. R. Soc. Lond, vol. A (2000) 358, no. 1773, pp. 2197--2207, 2000.]]Google ScholarGoogle Scholar
  16. V. Firoiu, X.H. Zhang, and Y. Gao, "Best effort differentiated services: trade-off service differentiation for elastic applications," in Proc. IEEE Int. Conf. Telecom., Zagreb, Croatia, Jun. 2001.]]Google ScholarGoogle Scholar
  17. P. Hurley, K. Mourad, J.Y. Le Boudec, and P. Thiran, "ABE: providing a low-delay service within best effort," IEEE Network Mag., vol. 15, no. 3, pp. 60--69, May 2001.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Y.N.-E. Liu and W. Wong, "Deadline based channel scheduling," in Proc. IEEE Globecom, San Antonio TX, USA, Nov. 2001, vol. 4, pp. 2358--2362.]]Google ScholarGoogle Scholar
  19. Z.L. Zhang, Z.H. Duan, and Y.W.-T. Hou, "Fundamental trade-offs in aggregate scheduling," in Proc. IEEE Int. Conf. Net. Protocols, University of Minnesota, USA, Nov. 2001, vol. 4, pp. 129--137.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. B. Braden, D. Clark, J. Crowcroft, B. Davie, S. Deering, D. Estrin, S. Floyd, V. Jacobson, G. Minshall, C. Partridge, L. Peterson, K.K. Ramakrishnan, S. Shenker, J. Wroclawski, and L.X. Zhang, "Rec- ommendations on queue management and congestion avoidance in the Internet," IETF RFC 2309, Apr. 1998.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. M.A. Weiss, Data Structures and Algorithm Analysis in C, The Benjamin/Cummings Publishing Company, Inc., 1992.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. J. Liebeherr and D. Wrege, "Design and analysis of a high-performance packet multiplexer for multiservice networks with delay guarantees," Tech. Rep. CS-94-29, University of Virginia, 1994.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. L. Kleinrock, Queueing Systems, volume II: Computer Applications, John Wiley & Sons, 1975.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. L. Georgiadis, R. Guerin, V. Peris, and K.N. Sivarajan, "Efficient net-work QoS provisioning based on per node traffic shaping," ACM/IEEE Trans. Networking, vol. 4, no. 4, pp. 482--501, Aug. 1996.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. R. Guérin and V. Peris, "Quality-of-service in packet networks: basic mechanisms and directions," Computer Net., vol. 31, no. 3, pp. 169--189, Feb. 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. A.W. Berger and W. Whitt, "Extending the effective bandwidth concept to networks with priority classes," IEEE Commun. Mag., vol. 36, no. 8, pp. 78--83, Aug. 1998.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. A.W. Berger and W. Whitt, "Effective bandwidths with priorities," ACM/IEEE Trans. Networking, vol. 6, no. 4, pp. 447--460, Aug. 1998.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. A.I. Elwalid and D. Mitra, "Analysis approximation and admission control of a multi-service multiplexing system with priorities," in Proc. IEEE INFOCOM, Boston, USA, Apr. 1995, pp. 463--472.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. H.L. Vu and M. Zukerman, "Blocking probability for priorityclasses in optical burst switching networks," IEEE Commun. Let., vol. 6, no. 5, pp. 214--216, May 2002.]]Google ScholarGoogle ScholarCross RefCross Ref
  30. P.B. Key, "Resource pricing for differentiated services," http://research.microsoft.com/~peterkey/Papers/KIVSpbkey.pdf, Feb. 2001.]]Google ScholarGoogle Scholar
  31. P. Marbach, "Pricing differentiated services networks: bursty traffic," in Proc. IEEE INFOCOM, Anchorage Alaska, USA, Apr. 2001, vol. 2, pp. 650--658.]]Google ScholarGoogle ScholarCross RefCross Ref
  32. C.A. Courcoubetis and A. Dimakis, "Providing bandwidth guarantees over a best-effort network: call-admission and pricing," in Proc. IEEE INFOCOM, Anchorage Alaska, USA, Apr. 2001, vol. 1, pp. 459--467.]]Google ScholarGoogle ScholarCross RefCross Ref
  33. D. Mitra, K.G. Ramakrishnan, and Q. Wang, "Combined economic modeling and traffic engineering: joint optimization of pricing and routing in multi-service networks," in Proc. ITC-17, Salvador da Bahia, Brazil, Dec. 2002.]]Google ScholarGoogle Scholar
  34. S. Jordan and H. Jiang, "Connection establishment in high speed networks," IEEE J. Selected Areas Commun., vol. 13, no. 7, pp. 1150--1161, Sep. 1995.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. H. Jiang and S. Jordan, "A pricing model for high speed networks with guaranteed quality of service," in Proc. IEEE INFOCOM, San Fransisco, USA, Mar. 1996, vol. 2, pp. 888--895.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. X. Wang and H. Schulzrinne, "Pricing network resoruce for adaptive applications in a differentiated services network," in Proc. IEEE INFOCOM, Anchorage Alaska, USA, Apr. 2001, vol. 2, pp. 943--952.]]Google ScholarGoogle Scholar
  37. L.A. DaSilva, "Pricing for QoS-enabled networks: a survey," IEEE Commun. Surveys & Tutorials (online), Jan. 2000, DaSilva.pdf.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. O. Yaron and M. Sidi, "Performance and stability of communicatio networks via robust exponential bounds," ACM/IEEE Trans. Networking, vol. 1, no. 3, pp. 372--385, Jun. 1993.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. H. Michiel and K. Laevens, "Teletraffic engineering in a broadband era," Proc. The IEEE, vol. 85, no. 12, pp. 2007--2033, Dec. 1997.]]Google ScholarGoogle ScholarCross RefCross Ref
  40. E. Biton and A. Orda, "QoS provision with EDF scheduling, stochastic burtiness and stochastic guarantees," in Proc. ITC-18, Berlin, Germany, Aug./Sep. 2003, vol. 5b, pp. 1061--1070.]]Google ScholarGoogle Scholar
  41. E. Biton and A. Orda, "QoS provision with EDF scheduling, stochastic burtiness and stochastic guarantees (extented version)," http://comnet.technion.ac.il/~berez/BO03.pdf.]]Google ScholarGoogle Scholar
  42. D. Anick, D. Mitra, and M.M. Sondhi, "Stochastic theory of a data-handling system with multiple sources," Bell Syst. Tech. J., vol. 16, no. 8, pp. 1871--1894, Oct. 1982.]]Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Granular differentiated queueing services for QoS: structure and cost model

              Recommendations

              Comments

              Login options

              Check if you have access through your login credentials or your institution to get full access on this article.

              Sign in

              Full Access

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader