Analysis of a finite-Buffer Polling System with Exhaustive Service Based on Virtual Buffering

This paper presents an exact analysis of a general asymmetric polling system which has a finite-capacity buffer and exhaustive service discipline at each station. To analyze the system we consider a model system in which each station is assumed to have a temporary virtual buffer with infinite capacity attached to the real buffer, while the server is unavailable. It is introduced to store all the messages which are to be lost due to the limitation of the real buffer capacity during the vacation period. At the instant when the server visits a station, using the marginal queue length distribution of the station including the virtual buffer, the intervisit time distribution of the station is derived. The system behavior using the relationship between performance measures and the intervisit time distribution is then investigated.
Publisher
IEEE-Inst Electrical Electronics Engineers Inc
Issue Date
1994-12
Language
ENG
Keywords

SINGLE BUFFERS; PERFORMANCE ANALYSIS

Citation

IEEE TRANSACTIONS ON COMMUNICATIONS, v.42, no.12, pp.3144 - 3149

ISSN
0090-6778
URI
http://hdl.handle.net/10203/58503
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
  • Hit : 127
  • Download : 0
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 11 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0