Polling system: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
add {{queueing theory}}
reference to early research
Line 1: Line 1:
In [[queueing theory]], a discipline within the mathematical [[probability theory|theory of probability]], a '''polling system''' or '''polling model''' is a system where a single server visits a set of queues in some order.<ref name="boxma">{{cite doi|10.1007/978-3-642-75079-3_8}}</ref> The model has applications in [[telecommunications]], [[manufacturing]] and [[road traffic management]].
In [[queueing theory]], a discipline within the mathematical [[probability theory|theory of probability]], a '''polling system''' or '''polling model''' is a system where a single server visits a set of queues in some order.<ref name="boxma">{{cite doi|10.1007/978-3-642-75079-3_8}}</ref> The model has applications in [[telecommunications]], [[manufacturing]] and [[road traffic management]]. The term polling system was coined at least at early as 1968.<ref>{{cite doi|10.1038/scientificamerican0868-96}}</ref><ref>{{cite doi|10.1007/3-540-46506-5_18}}</ref>


Typically it is assumed that the server visits the different queues in a cyclic manner.<ref name="boxma" /> Exact results exist for waiting times, marginal queue lengths and joint queue lengths at polling epochs in certain models.<ref>{{cite doi|10.1007/BF01245325}}</ref>
Typically it is assumed that the server visits the different queues in a cyclic manner.<ref name="boxma" /> Exact results exist for waiting times, marginal queue lengths and joint queue lengths at polling epochs in certain models.<ref>{{cite doi|10.1007/BF01245325}}</ref>

Revision as of 15:50, 23 October 2013

In queueing theory, a discipline within the mathematical theory of probability, a polling system or polling model is a system where a single server visits a set of queues in some order.[1] The model has applications in telecommunications, manufacturing and road traffic management. The term polling system was coined at least at early as 1968.[2][3]

Typically it is assumed that the server visits the different queues in a cyclic manner.[1] Exact results exist for waiting times, marginal queue lengths and joint queue lengths at polling epochs in certain models.[4]

References

  1. ^ a b Attention: This template ({{cite doi}}) is deprecated. To cite the publication identified by doi:10.1007/978-3-642-75079-3_8, please use {{cite journal}} (if it was published in a bona fide academic journal, otherwise {{cite report}} with |doi=10.1007/978-3-642-75079-3_8 instead.
  2. ^ Attention: This template ({{cite doi}}) is deprecated. To cite the publication identified by doi:10.1038/scientificamerican0868-96, please use {{cite journal}} (if it was published in a bona fide academic journal, otherwise {{cite report}} with |doi=10.1038/scientificamerican0868-96 instead.
  3. ^ Attention: This template ({{cite doi}}) is deprecated. To cite the publication identified by doi:10.1007/3-540-46506-5_18, please use {{cite journal}} (if it was published in a bona fide academic journal, otherwise {{cite report}} with |doi=10.1007/3-540-46506-5_18 instead.
  4. ^ Attention: This template ({{cite doi}}) is deprecated. To cite the publication identified by doi:10.1007/BF01245325, please use {{cite journal}} (if it was published in a bona fide academic journal, otherwise {{cite report}} with |doi=10.1007/BF01245325 instead.