HEAVY TRAFFIC ANALYSIS IN QUEUEING SYSTEMS

Show simple item record

dc.contributor.author Benderschi, Olga
dc.date.accessioned 2021-04-28T08:40:02Z
dc.date.available 2021-04-28T08:40:02Z
dc.date.issued 2008
dc.identifier.citation BENDERSCHI, Olga. Heavy traffic analysis in queueing systems. In: Studia Universitatis Moldaviae. Seria Ştiinţe Exacte şi Economice; Matematică. Informatică. Fizică. Economie. Revistă științifică. 2008, nr. 8(18), pp. 38-48. ISSN 1857-2073 en
dc.identifier.issn 1857-2073
dc.identifier.uri http://studiamsu.eu/nr-8-18-2008/
dc.identifier.uri http://dspace.usm.md:8080/xmlui/handle/123456789/4215
dc.description.abstract The traffic intensity is defined in the classical theory of queueing systems as the ratio of the expected service time and the expected interarrival time and is an important measure of the system performance. When the traffic intensity is close but less than one such approximations are called heavy-traffic approximations. Heavy traffic limits for queuing networks are a topic of continuing interest. However, these limits have been rigorously derived only for a few types of systems. The goal of this paper is to describe the heavy-tra¢ c behavior of classical queuing systems. en
dc.language.iso en en
dc.publisher CEP USM en
dc.title HEAVY TRAFFIC ANALYSIS IN QUEUEING SYSTEMS en
dc.type Article en


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account