Method of analysis for discrete-time buffers with randomly interrupted arrival stream

Access Full Text

Method of analysis for discrete-time buffers with randomly interrupted arrival stream

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IEE Proceedings E (Computers and Digital Techniques) — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© The Institution of Electrical Engineers
Published

The paper considers a discrete buffered system with infinite waiting room, one single output channel and synchronous transmission of messages from the buffer. The arrival stream of messages to the buffer is assumed to be interrupted at random time points for random length time intervals. The arrival interruptions represent a decrease in the mean arrival intensity as compared to a buffer system without arrival interruptions. They also cause the need for a whole new method of analysis, which is presented here. Time is divided into two types of time intervals: ‘A-times’, during which arrivals are possible, and ‘B-times’, during which the arrival stream is interrupted. Both types of intervals are expressed in clock time periods and may have arbitrary probability distributions, provided their probability generating functions are rational functions of the variable z. Under these circumstances, expressions are derived for the probability generating functions of the number of messages in the buffer at various time instants. These expressions contain a finite number of unknown parameters, which can only be determined by solving a generally transcendent equation for its roots. As an example of the method, the special case is treated where both A-times and B-times are geometrically distributed; explicit expressions for the probability generating functions of the buffer occupancy are obtained for this special case.

Inspec keywords: queueing theory; discrete time systems

Other keywords: probability generating functions; synchronous transmission; A-times; randomly interrupted arrival stream; discrete-time buffers; B-times; arrival interruptions; infinite waiting room; probability distributions; rational functions

Subjects: Discrete control systems; Queueing theory

References

    1. 1)
      • H.B. Kekre , C.L. Saxena . Finite buffer behavior with Poisson arrivals and random server interruptions. IEEE Trans. , 470 - 474
    2. 2)
      • J. Hsu . Buffer behavior with Poisson arrival and geometric output processes. IEEE Trans. , 1940 - 1941
    3. 3)
      • H.B. Kekre , C.L. Saxena , M. Khalid . Buffer behavior for mixed arrivals and single server with random interruptions. IEEE Trans. , 59 - 64
    4. 4)
      • A. Kuczura . The interrupted Poisson process as an overflow process. Bell Syst. Tech. J. , 437 - 448
    5. 5)
      • H. Heffes . Analysis of first-come first-served queuing systems with peaked inputs. Bell Syst. Tech. J. , 1215 - 1228
    6. 6)
      • W. Chu . Buffer behavior for Poisson arrivals and multiple synchronous constant outputs. IEEE Trans. , 530 - 534
    7. 7)
      • H. Bruneel . Analysis of an infinite buffer system with random server interruptions. Comput. & Oper. Res.
    8. 8)
      • H. Bruneel . Analysis of buffer behaviour for an integrated voice-data system. Electron. Lett. , 72 - 74
    9. 9)
      • H.B. Kekre , M. Khalid . Buffer design in a closed form with hybrid input and random server interruptions. IEE Proc. F, Commun., Radar & Signal Process. , 6 , 448 - 455
    10. 10)
      • S. Neal . The equivalent group method for estimating the capacity of partial-access service systems which carry overflow traffic. Bell Syst. Tech. J. , 777 - 783
    11. 11)
      • H. Bruneel . Buffers with stochastic output interruptions. Electron. Lett. , 735 - 737
    12. 12)
      • H.B. Kekre , M. Khalid . Single server queueing model for data multiplexing in analog speech. Comput. & Oper. Res. , 119 - 129
    13. 13)
      • H. Bruneel . A general model for the behaviour of infinite buffers with periodic service opportunities. Eur. J. Oper. Res. , 98 - 106
    14. 14)
      • N.D. Georganas . Buffer behavior with Poisson arrivals and bulk geometric service. IEEE Trans. , 938 - 940
    15. 15)
      • W.W. Chu . Buffer behavior for batch Poisson arrivals and single constant output. IEEE Trans. , 613 - 618
    16. 16)
      • H. Heffes . On the output of a GI/M/N queuing system with interrupted Poisson input. Oper. Res. , 530 - 542
    17. 17)
      • H. Kobayashi , A.G. Konheim . Queueing models for computer communications system analysis. IEEE Trans. , 2 - 29
    18. 18)
      • H. Bruneel . On the behavior of buffers with random server interruptions. Performance Eval. , 165 - 175
    19. 19)
      • K. Bharath-kumar . Discrete-time queueing systems and their networks. IEEE Trans. , 260 - 263
    20. 20)
      • L. Kleinrock . (1975) , Queueing systems, Vol.1: theory.
    21. 21)
      • T.S. Heines . Buffer behavior in computer communication systems. IEEE Trans. , 573 - 576
    22. 22)
      • N. Janakiraman , B. Pagurek , J.E. Neilson . Multiplexing low-speed buffered data terminals. IEEE Trans. , 1838 - 1843
    23. 23)
      • H. Bruneel . Comments on “Discrete-time queueing systems and their networks”. IEEE Trans. , 461 - 463
http://iet.metastore.ingenta.com/content/journals/10.1049/ip-e.1984.0036
Loading

Related content

content/journals/10.1049/ip-e.1984.0036
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading