Delay, jitter and threshold crossing in ATM systems with dispersed messages

Performance Evaluation

Volumn 29, Issue 2, 1997, Pages 85-104

  Cidon, Israel ^a,b,c   Khamisy, Asad ^a,b   Sidi, Moshe ^a,c,d  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b SUN MICROSYSTEMS   (United States)

^c IBM T J WATSON RESEARCH CENTER   (United States)

^d Department of Electrical Engineering and Computer Science   (United States)

Author keywords

ATM; Delay; Discrete time queues; Dispersed messages; Jitter

Indexed keywords

ALGORITHMS; CALCULATIONS; COMPUTER SIMULATION; PACKET NETWORKS; PROBABILITY;

CONSECUTIVE CELLS; DELAY; DISPERSED MESSAGES; JITTER; THRESHOLD CROSSING;

ASYNCHRONOUS TRANSFER MODE;

EID: 0031103148     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0166-5316(96)00006-5     Document Type: Article

References (24)

1. R.G. Addie and M. Zukerman, An approximation for performance evaluation of stationary single server queues, in: Proc. INFOCOM'93 (1993) 835-842.
2. L.V. Ahlfors, Complex Analysis, 3rd ed. (McGraw-Hill, New York, 1979).
3. E. Altman and A. Jean-Marie, The loss process of messages in an M/M/1/K queue, in: Proc. INFOCOM'94 (1994) 1191-1198.
4. E. Altman and A. Jean-Marie, The distribution of delays of dispersed messages in an M/M/1 queue, in: Proc. INFOCOM'95 (1995) 338-344.
5. ATM Forum, ATM User-Network Interface (UNI) Specification, Version 3.1 (Prentice-Hall, Englewood Cliffs, NJ, 1995).
6. D. Bertsekas and R. Gallager, Data Networks (Prentice-Hall, Englewood Cliffs, NJ, 1987).
7. F. Baccelli, A.M. Makowski and A. Shwartz, The Fork-Join queue and related systems with synchronization constraints: Stochastic ordering and computable bounds, Adv. in Appl. Probab.
8. C.S. Chang, Stability, Queue length and delay of deterministic and stochastic queueing networks, IEEE Trans. Autom. Control 39 (5) (1994) 913-931.
9. J.-Y. Cochennec et al., Asynchronous time-division networks: Terminal synchronization for video and sound signals, in: Proc. GLOBECOM'85 (1985) 791-794.
10. J.W. Cohen, Single server queues with restricted accessibility, J. Engrg. Math. 3 (4) (1969).
11. D. Comer, Internetworking with TCP/IP, Principles, Protocols, and Architectures (Prentice-Hall, Englewood Cliffs, NJ, 1988).
12. I. Cidon, A. Khamisy and M. Sidi, Analysis of packet loss processes in high-speed networks, IEEE Trans. Inform. Theory 39 (1) (J 1993) 98-108.
13. I. Cidon, A. Khamisy and M. Sidi, On queueing delays of dispersed messages, Queueing Systems Theory Appl. 15 (1994) 325-346.
14. B. Doshi and H. Heffes, Overload performance of several processor queueing disciplines for the M/M/1 queue, IEEE Trans. Comm. 34 (6) (1986).
15. J.D. Esary, F. Proschan and D.W. Walkup, Association of random variables, with applications, Ann. Math. Statist. 38 (1967) 1466-1474.
16. B.V. Gnedenko and I.N. Kovalenko, Fundamentals of Queueing Theory (Birkhauser, Boston, 1989).
17. S. Halfin, Batch delays versus customer delays, Bell Sys. Tech. J. 62 (1983).
18. P.A. Humblet, A. Bhargava and M.G. Hluchyj, Ballot theorems applied to the transient analysis of nD/D/1 queues, IEEE/ACM Trans. Networking 1 (1) (1993) 81-95.
19. G. Karlsson and M. Vetterli, Packet video and its integration into network architecture, IEEE JSAC 7 (5) (1989) 739-751.
20. L. Kleinrock, Queueing Systems, Vol. 1-2 (Wiley, New York, 1975).
21. M.R. Leadbetter, G. Lindgren and H. Rootzen, Extremes and Related Properties of Random Sequences and Processes (Springer, Berlin, 1983).
22. R. Nelson and A.N. Tantawi, Approximate analysis of fork/join synchronization in parallel queues, IEEE Trans. Comput. C-37 (1988) 739-743.
23. R. Rom and M. Sidi, Multiple Access Protocols; Performance and Analysis (Springer, Berlin, 1990).
24. N. Shacham and P. Mckenney, Packet recovery in high-speed networks using coding and buffer management, in: Proc INFOCOM'90 (1990) 124-131.