Skip to main content

DiffServ PBAC Design with Optimization Method

  • Conference paper
IP Operations and Management (IPOM 2007)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 4786))

Included in the following conference series:

  • 415 Accesses

Abstract

Determining the maximum amount of traffic that can be admitted in a DiffServ network is a difficult task. Considering a realistic traffic scenario, the relationship between the traffic load and the queue length distribution of a DiffServ node is very difficult to model. This paper demonstrates how a non-liner programming (NLP) algorithm can be employed to determine the maximum load that can be accepted by a DiffServ node without deriving an analytical model. The NLP algorithm is used to “train” a parameter based admission controller (PBAC) using a specifically designed traffic profile. After training the PBAC for a specific network and specific statistical QoS guarantees, it can be used to provide these guarantees to distinct offered traffic loads. This method was evaluated in a sample scenario where (aggregated on-off) VoIP traffic and (self-similar) data traffic compete for the network resources.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Blake, S., Black, D., Carlson, M., Davies, E., Wang, Z., Weiss, W.: Architecture for differentiated service. IETF RFC 2475 (December 1998)

    Google Scholar 

  2. Breslau, L., Jamin, S., Shenker, S.: Comments on the performance of measurement-based admission control algorithms. INFOCOM 2000 3, 1233–1242 (2000)

    Google Scholar 

  3. Moore, A.W.: An implementation-based comparison of Measurement-Based Admission control algorithms. Journal of High Speed Networks 13, 87–102 (2004)

    Google Scholar 

  4. Siripongwutikorn, P., Banerjee, S.: Per-flow delay performance in traffic aggregates. Proceedings of IEEE Globecom 2002 3, 2634–2638 (2002)

    Google Scholar 

  5. Xu, Y., Guerin, R.: Individual qos versus aggregate qos: A loss performance study. IEEE/ACM Transactions on Networking 13, 370–383 (2005)

    Article  Google Scholar 

  6. Knightly, E.W., Shroff, N.B.: Admission control for Statistical QoS: Theory and Practice. IEEE Network 13, 20–29 (1999)

    Article  Google Scholar 

  7. Spitler, S., Lee, D.C.: Optimization of Call Admission Control for a statistical multiplexer allocating link bandwidth. IEEE Transactions on Automatic Control 48(10), 1830–1836 (2003)

    Article  MathSciNet  Google Scholar 

  8. Cisco Systems. Traffic Analysis for Voice over IP. Cisco Document Server (September 2002)

    Google Scholar 

  9. Norros, I.: On the use of fractional Brownian motion in the theory of connectionless networks. IEEE Journal on Selected Areas in Communications 13(6), 953–962 (1995)

    Article  Google Scholar 

  10. Hosking, J.R.M.: Modeling persistence in hydrological time series using fractional brownian differencing. Water Resources Research 20, 1898–1908 (1984)

    Article  Google Scholar 

  11. Boutremans, C., Iannaccone, G., Diot, C.: Impact of link failures on VoIP performance. In: Proceedings of 12th NOSSDAV workshop, May 2002, pp. 63–71. ACM Press, New York (2002)

    Google Scholar 

  12. Jiang, Y., Yao, Q.: Impact of FIFO aggregation on delay performance of a differentiated services network. In: Kahng, H.-K. (ed.) ICOIN 2003. LNCS, vol. 2662, pp. 948–957. Springer, Heidelberg (2003)

    Google Scholar 

  13. Nelder, J.A., Mead, R., Simplex, A.: Method for Function Minimization. Comput. J. 7, 308–313 (1965)

    MATH  Google Scholar 

  14. Lagarias, J.C., Reeds, J.A., Wright, M.H., Wright, P.E.: Convergence Properties of the Nelder-Mead simplex method in low dimensions. SIAM. J. Optim. 9(1), 112–147 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  15. Guérin, R., Ahmadi, H., Naghshineh, M.: Equivalent capacity and its application to bandwidth allocation in high-speed networks. IEEE Journal on Selected Areas in Communications 9(7), 968–981 (1991)

    Article  Google Scholar 

  16. NS-2. The ns-2 simulator. Available at: http://www.isi.edu/nsnam/ns/

  17. Agha, G.: Actors: A Model of Concurrent Computation in Distributed Systems. MIT Press, Cambridge. Available at: http://hdl.handle.net/1721.1/6952

Download references

Author information

Authors and Affiliations

Authors

Editor information

Deep Medhi José Marcos Nogueira Tom Pfeifer S. Felix Wu

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nabhen, R., Jamhour, E., Penna, M., Fonseca, M., Pujolle, G. (2007). DiffServ PBAC Design with Optimization Method. In: Medhi, D., Nogueira, J.M., Pfeifer, T., Wu, S.F. (eds) IP Operations and Management. IPOM 2007. Lecture Notes in Computer Science, vol 4786. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75853-2_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75853-2_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75852-5

  • Online ISBN: 978-3-540-75853-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics