Informatics and Applications
December 2013, Volume 7, Issue 4, pp 34-43
ABOUT ONE TASK OF OVERLOAD CONTROL
Abstract
The article considers the relatively simple task of congestion control. On the server with a finite number
of places of service and potentially infinite queue, jobs are running, coming from the random flow. Control means
the adoption of the decision on admission or rejection of each newly incoming job. Accumulation of the queue
may result in loss of quality of service, because the period of execution of jobs is limited. At the same time, the
rejection of application causes the loss of income. It is proved that in the case of exponentially distributed service
time and for input flows, described as the renewal process with an arbitrary interarrival time distribution, optimum
is a simple threshold strategy. The dependence of the limiting average income on the threshold value is unimodal.
This circumstance greatly facilitates the search for the optimal integer value of the threshold. Experimental analysis
shows that this dependence has a place for arbitrary distribution of service time and for general type of Markov
modulated input flows.
[+] References (8)
- Konovalov, M.G. 2010. Oplanirovanii potokov v sistemakh
vychislitel’nykh resursov [On task flow planning in computional
resource systems]. Inform. Appl. 4(2):3–12.
- Konovalov, M. 2010. Multiagent model for jobs flows planning
and pricing in distributed computing systems. 2010
Congress (International) on Ultra Modern Telecommunications
and Control Systems and Workshops (ICUMT). ICUMTT,
ICUMT-CS and Associated Workshops Proceedings. CDROM.
IEEE, Catalog Number CFP1063G-CDR. ISBN
978-1-4244-7286-4. Report 1569339397.
- Konovalov, M.G., Yu. E.Malashenko, and I. A. Nazarova.
2011. Job control in heterogeneous computing systems.
J. Comput. Syst. Sc. Int. 50(2):220–37.
- Konovalov, M.G. 2012. Optimizatsiya raboty vychislitel’nogo
kompleksa s pomoshch’yu imitatsionnoy modeli
i adaptivnykh algoritmov [Computer system optimization
using simulation model and adaptive algorithms]. Inform.
Appl. 6(1):37–48.
- Welzl, M. 2005. Network congestion control. NY: Wiley.
- Hong, Y., C. Huang, and J. Yan. 2012. A comparative study
of SIP overload control algorithms. Network and traffic
engineering in emerging distributed computing applications.
Eds. J. Abawajy, M. Pathan, M. Rahman, A.K. Pathan,
and M.M. Deris. IGI Global. 1–20. Available at:
http://arxiv.org/ftp/arxiv/papers/1210/1210.1505.pdf
(accessed November 5, 2013).
- Borovkov, A.A. 2009. Teoriya veroyatnostey [Probability
theory]. 5th ed.M.: Librokom. 656 p.
- Abaev, P.O., Y. V. Gaidamaka, A. V. Pechinkin,
R. V. Razumchik, and S. Ya. Shorgin. 2012. Simulation
of overload control in SIP server networks. ECMS 2012:
26th European Conference onModelling and Simulation Proceedings.
Koblenz, Germany. 533–39.
[+] About this article
Title
ABOUT ONE TASK OF OVERLOAD CONTROL
Journal
Informatics and Applications
December 2013, Volume 7, Issue 4, pp 34-43
Cover Date
2013-12-31
DOI
10.14357/19922264130404
Print ISSN
1992-2264
Publisher
Institute of Informatics Problems, Russian Academy of Sciences
Additional Links
Key words
congestion control; overload control; threshold strategy; job flow
Authors
M.G. Konovalov 
Author Affiliations
Institute of Informatics Problems, Russian Academy of Sciences, Moscow, Russia
|