Logo BSU

Please use this identifier to cite or link to this item: https://elib.bsu.by/handle/123456789/9610
Full metadata record
DC FieldValueLanguage
dc.contributor.authorZiółkowski, Marcin-
dc.date.accessioned2012-05-22T08:58:50Z-
dc.date.available2012-05-22T08:58:50Z-
dc.date.issued2011-
dc.identifier.citationМеждународный конгресс по информатике: информационные системы и технологии: материалы международного научного конгресса 31 окт. – 3 нояб. 2011 г. : в 2 ч. Ч. 2. – Минск: БГУ, 2011. – C. 71-74.ru
dc.identifier.isbn978-985-518-564-3-
dc.identifier.urihttp://elib.bsu.by/handle/123456789/9610-
dc.descriptionСекция 6. Оптимизация и надежность информационных системru
dc.description.abstractIn this paper analytic model of server servicing requests of many users is presented. Every user can dispose of computer system having its own characteristics and can be represented by classical queue but in fact users are dependent because they are connected via common memory space which is limited. Analogous models can represent mail or ftp servers and can be used to calculate needed server storage size ([1, 2]). In this research stationary distribution function of number of requests and stationary refusal probability for every user was obtained. It contains also review of some special cases.ru
dc.language.isoruru
dc.publisherБГУru
dc.subjectЭБ БГУ::ЕСТЕСТВЕННЫЕ И ТОЧНЫЕ НАУКИ::Математикаru
dc.titleStochastic server model with limited storage sizeru
dc.typeArticleru
Appears in Collections:2011. Международный конгресс по информатике : информационные системы и технологии. Часть 2.

Files in This Item:
File Description SizeFormat 
14 Marcin Ziółkowski.pdf423,07 kBAdobe PDFView/Open
Show simple item record Google Scholar



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.