Skip to main content

Optimisation-Based Overload Control

  • Conference paper
  • 640 Accesses

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

Abstract

We discuss the design of an overload control protocol from an optimisation perspective. The design process starts with the formulation of a convex optimisation problem. We then construct a distributed algorithm for this problem by applying Lagrangian decomposition. The different components make use of models of their environment to ensure convergence of the algorithm. We show how the constructed algorithm is implemented by GOCAP, an overload control protocol currently undergoing standardisation.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. ETSI TR 182 015: Telecommunications and Internet converged Services and Protocols for Advanced Networking (TISPAN); Next Generation Networks; Architecture for control of processing overload. Technical report, European Telecommunications Standards Institute (2006)

    Google Scholar 

  2. Whitehead, M., Williams, P.: Adaptive network overload controls. BT Technology Journal 20(3) (2002)

    Google Scholar 

  3. Chiang, M., Low, S.H., Luo, Z., Shroff, N.B., Yu, W.: Nonlinear optimization of communication systems. IEEE Journal on Selected Areas in Communications 24(8) (2006)

    Google Scholar 

  4. Stefanov, S.M.: An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint (Article ID 89307). Journal of Applied Mathematics and Decision Sciences 2006 (2006)

    Google Scholar 

  5. Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)

    MATH  Google Scholar 

  6. Walker, N., Wennink, M.: Interactions in transport networks. Electronic Notes in Theoretical Computer Science 141(5), 97–114 (2005)

    Article  Google Scholar 

  7. Kelly, F., Maulloo, A., Tan, D.: Rate control in communication networks: shadow prices, proportional fairness and stability. Journal of the Operational Research Society 49, 237–252 (1998)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Tijani Chahed Bruno Tuffin

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wennink, M., Williams, P., Walker, N., Strulo, B. (2007). Optimisation-Based Overload Control. In: Chahed, T., Tuffin, B. (eds) Network Control and Optimization. NET-COOP 2007. Lecture Notes in Computer Science, vol 4465. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72709-5_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72709-5_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72708-8

  • Online ISBN: 978-3-540-72709-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics