Queueing theory with applications to packet telecommunication

Queueing Theory with Applications to Packet Telecommunication

Volumn , Issue , 2005, Pages 1-316

  Daigle, John N ^a  

^a UNIVERSITY OF MISSISSIPPI   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84891420375     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/b99875     Document Type: Book

References (166)

1. Abate, J., and W. Whitt. (1988) Transient Behavior of the M/M/1 Queue via Laplace Transforms. Adv. Appl. Prob. 20:1, 145-178.
2. Abate, J., and W. Whitt. (1989) Calculating Time-Dependent Performance Measures for the M/M/1 Queue. IEEE Trans. on Commun. 37:10, 1102-1104.
3. Abboud, N. E., and J. N. Daigle. (1997) A Little's Result Approach to the Service Constrained Spares Provisioning Problem for Repairable Items. Ops. Res. 45:4, 577-583.
4. Ackroyd, M. H. (1980) Computing the Waiting Time Distribution for the G/G/1 Queue by Signal Processing Methods. IEEE Trans. on Commun. 28:1, 52-58.
5. Akar, N. (2004) Solving the Single Server Queue with State Space Methods and the Matrix Sign Function. Submitted.
6. Akar, N., and E. Arikan. (1996) A Numerically Efficient Method for the MAP/D/1/K Queue via Rational Approximations. Queueing Systems: Theory and Applications (QUESTA) 22, 97-120.
7. Akar, N., N. C. Oguz, and K. Sohraby. (1998a) Matrix-Geometric Solutions of M/G/1-Type Markov Chains: A Unifying Generalized State-Space Approach. IEEE J. Select. Areas in Commun. 16:5, 626-639.
8. Akar, N., N. C. Oguz, and K. Sohraby. (1998b) An Overview of TELPACK. IEEE Communications 36:8, 84-87.
9. Asmussen, S. (2003) Applied Probability and Queues. Springer-Verlag, New York.
10. Anderson, E., Z. Bai, C. Bischof, S. Blackford, J. Demmel, J. Dongarra, J. Du Croz, A. Greenbaum, S. Hammarling, A. McKenney, and D. Sorensen. (1999) LAPACK Users' Guide, 3rd. Ed. Society for Industrial and Applied Mathematics (SIAM), Philidelphia.
11. Bender, P., P. Black, M. Grob, R. Padovani, N. Sindhushyana, and A. Viterbi. (2000) CDMA/HDR: A Bandwidth-Efficient High-Speed Wireless Data Service for Nomadic Users. IEEE Communications 38:7, 70-77.
12. Bertsekas, D., and R. Gallager. (1987) Data Networks. Prentice-Hall, Englewood Cliffs.
13. Beuerman, S. L., and E. J. Coyle. (1987) The Delay Characteristics of CSMA/CD Networks. IEEE Trans. on Commun. 36:5, 553-563.
14. Beuerman, S. L., and E. J. Coyle. (1989) State Space Expansions and the Limiting Behavior of Quasi-Birth and Death Processes. Adv. Appl. Prob. 21:2, 284-314.
15. Bhargava, A., and M. G. Hluchyj. (1990) Frame Losses Due to Buffer Overflows in Fast Packet Networks. Proc. of IEEE INFOCOM'90, 132-139, San Francisco.
16. Blefari-Melazzi, N., J. N. Daigle, and M. Femminella. (2003) Stateless Admission Control for QoS Provisioning to VoIP Traffic in a DiffServ Domain. Proceedings of International Telecommunications Conference: ITC 18, Berlin.
17. Boorstyn, R., A. Burchard, J. Liebeherr, and C. Oottamakorn. (2000) Statistical Service Assurance for Traffic Scheduling Algorithms. IEEE J. Select. Areas Commun. 18:12, 2651-2664.
18. Bruneel, H. (1988) Queueing Behavior of Statistical Multiplexers with Correlated Inputs. IEEE Trans. on Commun. 36:12, 1339-1341.
19. Burke, P. J. (1956) The Output of a Queueing System. Ops. Res. 4, 699-704.
20. Cao, J., and K. Ramanan. (2002) A Poisson Limit for Buffer Overflow Probabilities. Proceedings of IEEE INFOCOM 2002, 2, 994-1003, San Fransico.
21. Chandramouli, Y., M. F. Neuts, and V. Ramaswami. (1989) A Queueing Model for Meteor-Burst Communication Systems. IEEE Trans. on Commun. 37:10, 1024-1030.
22. Chandy, K. M., and C. H. Sauer. (1981) Computer Systems Performance Modelling. Prentice-Hall, Englewood Cliffs.
23. Chen, C.-T. (1999) Linear System Theory and Design, 3rd. Ed. Oxford University Press, New York.
24. Chipalkatti, R., J. F. Kurose, and D. Towsley. (1989) Scheduling Policies for Real-Time and Non-Real-Time Traffic in a Statistical Multiplexer. Proc. IEEE INFOCOM'89, 774-783, Ottawa.
25. Churchill, R. V., and J. W. Brown. (1987) Fourier Series and Boundary Value Problems, 4th. Ed. McGraw-Hill, New York.
26. Çinlar, E. (1975) Introduction to Stochastic Processes. Prentice-Hall, Englewood Cliffs.
27. Cohen, J. W. (1969) The Single Server Queue. Wiley Interscience, New York.
28. Cooper, R. B. (1972) Introduction to Queueing Theory. Macmillan, New York.
29. Cooper, R. B. (1981) Introduction to Queueing Theory, 2nd. Ed. North-Holland, New York. Republished 1990 by CEEPress, The George Washington University, Washington.
30. Cooper, R. B. (1990) Queueing Theory. Stochastic Models: Handbooks of Operations Research and Management Science, Vol. 2. (D. P. Heyman, and M. J. Sobel, eds.) North-Holland, New York, Chapter 10.
31. Cooper, R. B., and S. C. Niu. (1986) Bene's Formula for M/G/1-FIFO Explained by Preemptive-Resume LIFO. J. Appl. Prob. 23:2, 350-54.
32. Coyle, E., and B. Liu. (1985) A Matrix Representation of CSMA/CD Networks. IEEE Trans. on Commun. 33:1, 53-64.
33. Cruz, R. L. (1995) Quality of Service Guarantees in Virtual Circuit Switched Networks. IEEE J. Select. Areas Commun. 13:6, 1048-1056.
34. Daigle, J. N. (1977a) Queueing Analysis of a Packet Switching Node with Markov-Renewal Arrival Process. Proc. IEEE Int. Commun. Conf., 1, 279-283, Chicago.
35. Daigle, J. N. (1977b) Queueing Analysis of a Packet Switching Node in a Data Communication System. Doctoral Dissertation, Columbia University.
36. Daigle, J. N. (1986) Task Oriented Queueing: A Design Tool for Communications Software Design. IEEE Trans. on Commun. 34:12, 250-256.
37. Daigle, J. N. (1989) Queue Length Distributions from Probability Generating Functions via Discrete Fourier Transforms. Ops. Res. Let. 8, 229-236.
38. Daigle, J. N., and J. D. Langford. (1985) Queueing Analysis of a Packet Voice Communication System. Proc. IEEE INFOCOM'85, 18-26. Washington.
39. Daigle, J. N., and J. D. Langford. (1986) Models for Analysis of Packet Voice Communication Systems. IEEE J. of Select. Areas in Commun. 4:6, 847-855.
40. Daigle, J. N., Y. Lee, and M. N. Magalhães. (1990) Discrete Time Queues with Phase Dependent Arrivals. Proc. of IEEE INFOCOM'90, 728-732, San Fransisco.
41. Daigle, J. N., and D. M. Lucantoni. (1990) Queueing Systems Having Phase-Dependent Arrival and Service Rates. First International Workshop on the Numerical Solutions of Markov Chains, 375-395. Raleigh.
42. Daigle, J. N., and M. N. Magalhães. (1991) Transient Behavior of M/M Queues. Queueing Systems and Their Applications (QUESTA) 8, 357-378.
43. Daigle, J. N., and M. N. Magalhães. (2003) Analysis of Packet Networks Having Contention-Based Reservation With Application to GPR. IEEE/ACM Trans. Networking 11:4, 602-615.
44. Daigle, J. N., and R. L. Moose. (1993) Queue Lengths When Service and Arrival Rates are Markov-Modulated with Application to ATM. MITRE Technical Report 9412.
45. Daigle, J. N., and R. L. Moose. (1996) Queue Lengths when Service and Arrival Rates are Markov-Modulated with Application to ATM. IEEE COMSOC Ninth Annual Computer Communications Workshop, Reston.
46. Daigle, J. N., and M. Roughan. (1999) Queue-Length Distributions for Multi-Priority Queueing Systems. Proceedings of IEEE INFOCOM'99, 1, 641-648, New York.
47. Daigle, J. N., and S. Tang. (1991) Numerical Methods for Multiserver Discrete Time Queues with Batch Markovian Arrivals. Communications in Statistics - Stochastic Models 8:4, 665-683.
48. Daigle, J. N., and S. D. Whitehead. (1985) A Balance Equation Approach to Non-Markovian Queueing Systems. University of Rochester W. E. Simon Graduate School of Business Administration Working Paper Series QM-8629.
49. Demmel, J. W. (1997) Applied Numerical Linear Algebra. Society for Industrial and Applied Mathematics (SIAM), Philadelphia.
50. Disney, R. L., and P. C. Kiessler. (1987) Traffic Processes in Queueing Networks: A Markov Renewal Approach. The Johns Hopkins University Press, Baltimore.
51. Disney, R. L., D. C. McNickle, and B. Simon. (1980) The M/G/1 Queue with Instantaneous Feedback. Naval Res. Log. Qrt. 27, 635-644.
52. Doshi, B. T. (1986) Queueing Systems with Vacations - A Survey. Queueing Systems 1:1, 29-66.
53. Doshi, B. T. (1990) Single Server Queues with Vacations. Stochastic Analysis of Computer and Communication Systems. (H. Takagi, ed.) North-Holland, New York, 217-265.
54. Duan, Q., and J. N. Daigle. (2004) Resource Allocation for Statistical QoS Provision in Buffered Crossbar Switch. Accepted for presentation at IEEE International Conference on Communications (ICC-04), Paris.
55. Duan, Q., and J. N. Daigle. (2004) Resource Allocation for Quality of Service Provision in Multistage Buffered Crossbar Switches. Computer Networks Journal in press.
56. Evans, R. V. (1967) Geometric Distributions in Some Two Dimensional Queueing Systems. Ops. Res. 15:5, 830-846.
57. Eun, D. Y., and N. B. Shroff. (2003) Simplification of Network Analysis in Large-Bandwidth Systems. Proceedings of IEEE INFOCOM 2003, 1, 597-607, San Francisco.
58. Feller, W. (1968) An Introduction to Probability Theory and Its Applications I, John Wiley, New York.
59. Feller, W. (1971) An Introduction to Probability Theory and Its Applications II, John Wiley, New York.
60. Fuhrmann, S. W., and R. B. Cooper. (1985) Stochastic Decomposition in the M/G/1 Queue with Generalized Vacations. Ops. Res. 33:5, 1091-1099.
61. Gallager, R. G. (1995) Discrete Stochastic Processes. Kluwer Academic Press, Boston.
62. Gavish, B., and K. Altinkemer. (1990) Backbone Design Tools with Economic Tradeoffs. ORSA Journal on Computing 2:3, 236-251.
63. Gelenbe, E., and G. Pujolle. (1987) Introduction to Queueing Networks. John Wiley, New York.
64. Giffin, W. C. (1978) Queueing: Basic Theory and Applications. Grid, Inc., (Reprinted by Books on Demand, UMI, AnnArbor).
65. Golub, G. H., and C. H. Van Loan. (1996) Matrix Computations, 3rd. Ed. Johns Hopkins, Baltimore.
66. Gordon, J. J. (1990) The Evaluation of Normalizing Constants in Closed Queueing Networks. Ops. Res. 38:5, 863-869.
67. Gordon, W. L., and G. F. Newell. (1967) Closed Queuing Systems with Exponential Servers. Ops. Res. 15:2, 254-265.
68. Grassman, W. F. (1990) Finding Transient Solutions in Markovian Event Systems Through Randomization. First International Workshop on the Numerical Solutions of Markov Chains, 179-211, Raleigh.
69. Green, L., and B. Melamed. (1990) An Anti-PASTA Result for Markovian Systems. Ops. Res. 38:1, 173-175.
70. Hahne, E. L., A. K. Choudhury, and N. F. Maxemchuk. (1990) Improving the Fairness of Distributed Queue-Dual-Bus Networks. Proceedings of IEEE INFOCOM'90, 175-184, San Francisco.
71. Hammond, J. L., and P. J. P. O'Reilly. (1986) Performance Analysis of Local Computer Networks. Addison-Wesley, Reading.
72. Harrison, M. (1985) On Normalizing Constants in Queueing Networks. Ops. Res. 33:2, 464-468.
73. Hewitt, E., and K. Stromberg. (1969) Real and Abstract Analysis. Springer-Verlag, New York.
74. Hogg, R. V., and A. T. Craig. (1965) Introduction to Mathematical Statistics. Macmillan, New York.
75. Hunter, JJ. (1983) Mathematical Techniques of Applied Probability Volume 1, Discrete Time Models: Basic Theory. Academic Press, New York.
76. Iliadis, I., and W. E. Denzel. (1990) Performance of Packet Switches with Input and Output Queueing. Proceedings of IEEE ICC'90, 747-753, Atlanta.
77. Jackson, J. R. (1957) Networks of Waiting Lines. Ops. Res. 5, 518-521.
78. Jackson, J. R. (1963) Jobshop-Like Queueing Systems. Management Science 10, 131-142.
79. Jensen, A. (1953) Markoff Chains as an Aid in the Study of Markoff Processes. Skandinavisk Aktuarietidskrift 36, 87-91.
80. Jewell, W. S. (1967) A Simple Proof of: L = λW. Ops. Res. 15:6, 1109-1116.
81. Jiang, I., and J. S. Meditch. (1990) A Queueing Model for ATM-Based Multi-Media Communication Systems. Proceedings of IEEE ICC'90, 264-267, Atlanta.
82. Keilson, J. (1979) Markov Chain Models - Rarity and Exponentiality. Springer-Verlag, New York.
83. Keilson, J., and L. Servi. (1988) A Distributional Form of Little's Law. Ops. Res. Let. 7:5, 223-227.
84. Keilson, J., and L. Servi. (1989) Blocking Probability for M/G/1 Vacation Systems with Occupancy Level Dependent Schedules. Ops. Res. 37:1, 134-140.
85. Keilson, J., and D. M. G. Wishart. (1965) A Central Limit Theorem for Process Defined on a Finite Markov Chain. Proc. Cam. Phil. Soc. 60, 547-567.
86. Kelly, F. P. (1979) Reversibility and Stochastic Networks. John Wiley, New York.
87. Kleinrock, L. (1975) Queueing Systems: Vol. 1, Theory. John Wiley, New York.
88. Kleinrock, L. (1976) Queueing Systems: Vol. 2, Computer Applications. John Wiley, New York.
89. Kim, H. S., and A. Leon-Garcia. (1990) Performance of Self-Routing ATM Switch under Nonuniform Traffic Pattern. Proceedings of IEEE INFOCOM'90, 140-145, San Francisco.
90. Kim, Y. Y., and S.-Q. Li. (1999) Capturing Important Statistics of a Fading/Shadowing Channel for Network Performance Analysis. IEEE J. Select. Areas Commun. 17:5, 888-901.
91. Kobayashi, H. (1978) Model and Analysis: An Introduction to System Performance Evaluation Methodology. Addison-Wesley, Reading.
92. Lancaster, P. (1966) Lambda Matrices and Vibrating Systems. Pergamon Press Ltd., London.
93. Langford, J. D. (1990) Queueing Delays in Systems Having Batch Arrivals and Setup Times. Doctoral Dissertation, University of Rochester.
94. Latouche, G., and V. Ramaswami. (1999) Introduction to Matrix Analytic Methods in Stochastic Modeling, Society for Industrial and Applied Mathematics (SIAM), Philidelphia.
95. Lau, W.-C, and S.-Q. Li. (1993) Traffic Analysis in Large-Scale High-Speed Integrated Networks: Validation of Nodal Decomposition Approach. Proceedings of IEEE INFOCOM'93, 3, 1320-1329, San Francisco.
96. Lazowska, D. E., J. Zahorjan, G. S. Graham, and K. C. Sevcik. (1984) Quantitative System Performance: Computer System Analysis Using Queueing Network Models. Prentice-Hall, Englewood Cliffs.
97. Lazowska, D. E., J. Zahorjan, and K. C. Sevcik. (1986) Computer System Performance Evaluation Using Queueing Network Models. Ann. Rev. Comput. Sci. 1, 107-137.
98. Le Boudec, J., and P. Thiran. (2001) Network Calculus: a Theory of Deterministic Queueing Systems for the Internet, Springer-Verlag, New York.
99. Lea, C.-T (1990) Design and Evaluation of Unbuffered Self-Routing Networks for Wideband Packet Switching. Proceedings of IEEE INFOCOM'90, 148-156, San Francisco.
100. Leland, W. E., M. Taqqu, W. Willinger, and D. V. Wilson. (1994) On the Self-Similar Nature of Ethernet Traffic. IEEE/ACM Transactions on Networking 2:1, 1-15.
101. Leon-Garcia, A. (1989) Probability and Random Processesfor Electrical Engineering. Addison-Wesley, Reading.
102. Levy, H., and L. Kleinrock. (1986) A Queue with Startup and a Queue with Vacations: Delay Analysis by Decomposition. Ops. Res. 34:3, 426-436.
103. Levy, H., and M. Sidi. (1990) Polling Systems: Applications, Modeling, and Optimization. IEEE Trans. on Commun. 38:10, 1750-1760.
104. Li, S.-Q. (1990) A General Solution Technique for Discrete Queueing Analysis of Multi-Media Traffic on ATM. Proceedings of IEEE INFOCOM'90, 1144-1155, San Francisco.
105. Li, S.-Q., and C.-L. Hwang. (1997) On the Convergence of Traffic Measurement and Queueing Analysis: a Statistical-Matching and Queueing (SMAQ) Tool. IEEE/ACM Transactions on Networking 5:1, 95-110.
106. Li, S.-Q., S. Park, and D. Arifler. (1998) SMAQ: A Measurement-Based Tool for Traffic Modeling and Queueing Analysis Part II: Network Applications. IEEE Communications 36:8, 66-77.
107. Little, J. D. C. (1961) A Proof of the Queuing Formula L - λW. Ops. Res. 9, 383-387.
108. Lucantoni, D. M. (1991) New Results on the Single Server Queue with a Batch Markovian Arrival Process. Stochastic Models 7:1, 1-46.
109. Lucantoni, D. M. (1993) The BMAP/G/1: Queue: A Tutorial. Models and Techniques for Performance Evaluation of Computer and Communications Systems. (L. Donatiello and R. Nelson, eds.) Springer-Verlag, New York, 330-58.
110. Lucantoni, D. M. (1998) Further Transient Analysis of the BMAP/G/1 Queue. Stoch. Mod. 14:1 & 2, 461-478.
111. Lucantoni, D. M., K. S. Meier-Hellstern, and M. F. Neuts. (1990) A Single Server Queue with Server Vacations and a Class of Non-Renewal Arrival Processes. Adv. in Appl. Prob. 22:3, 676-705.
112. Melamed, B., and W. Whitt. (1990) On Arrivals that See Time Averages. Ops. Res. 38:1, 156-172.
113. Mieni, B. (1997) An Improved FFT-Based Version of Ramaswami's Formula. Comm. Statist. Stochastic Models 13, 223-238.
114. Moler, C., and C. F. Van Loan. (1978) Nineteen Dubious Ways to Compute the Exponential of a Matrix. SIAM Review 20:4, 801-835.
115. Neuts, M. F. (1981a) Matrix Geometric Solutions in Stochastic Models. he Johns Hopkins University Press, Baltimore.
116. Neuts, M. F. (1981b) The c-Server Queue with Constant Service Times and a Versatile Markovian Arrival Process. Applied Probability - Computer Science: The Interface 1, 31-67.
117. Neuts, M. F. (1989) Structured Stochastic Matrices of the M/G/1 Type and Their Applications. Marcel-Dekker, New York.
118. Niu, S.-C., and R. B. Cooper. (1993) Transform-Free Results for the M/G/1 Finite-and Related Queues. Mathematics of Operations Research 18, 486-510.
119. Noble, B., and J. W. Daniel. (1977) Applied Linear Algebra. Prentice-Hall, Englewood Cliffs.
120. Nussbaumer, H. J. (1982) Fast Fourier Transforms and Convolution Algorithms. Springer-Verlag, New York.
121. Platzman, L. K., J. C. Ammons, and J. J. Bartholdi, III. (1988) A Simple and Efficient Algorithm to Compute Tail Probabilities from Transforms. Ops. Res. 36:1, 137-144.
122. Press, W. H., B. P. Flanner, S. A. Teukolsky, and W. T. Vetterling. (1988) Numerical Recipes in C - The Art of Scientific Computing. Cambridge University Press, Cambridge.
123. Ramaswami, V., and D. M. Lucantoni. (1985) Stationary Waiting Time Distributions in Queues with Phase-Type Service and in Quasi-Birth Death Processes. Stochastic Models 1:2, 125-134.
124. Ramaswami, V. (1988a) A Stable Recursion for the Steady State Vector in Markov Chains of the M/G/1 Type. Stochastic Models 4, 183-188.
125. Ramaswami, V. (1988b) Nonlinear Matrix Equations in Applied Probability - Solution Techniques and Open Problems. SIAM Rev. 30, 256-263.
126. Ross, S. M. (1983) Stochastic Processes. John Wiley, New York.
127. Ross, S. M. (2003) Introduction to Probability Models, 8th. Ed. Academic Press, New York.
128. Saha, A., and M. D. Wagh. (1990) Performance Analysis of Banyan Networks Based on Buffers of Various Sizes. Proceedings of IEEE INFOCOM'90, 157-164, San Francisco.
129. Schwartz, M. (1987) Telecommunications Networks: Protocols, Modeling and Analysis. Addison-Wesley, Reading.
130. Shanthikumar, J. G. (1984) On a Software Reliability Model: A Review. Microelectronics and Reliability 23, 903-93.
131. Sheng, H.-D., and S.-Q. Li. (1993) Second Order Effect of Binary Sources on Characteristics of Queue and Loss Rate. Proceedings of IEEE INFOCOM'93, 1, 18-27, San Francisco.
132. Sinha, R. (1990) Baseline Document: T1S1 Technical Sub-Committee on Broadband Aspects of ISDN. Joint Report of AT&T, Bellcore, BellSouth Services, GTE-Telops, and Northern Telecom.
133. Spragins, J. D. (1991) Telecommunications: Protocols and Design. Addison-Wesley, Reading.
134. Sriram, K., and D. M. Lucantoni. (1989) Traffic Smoothing Effects of Bit Dropping in a Packet Voice Multiplexer. IEEE Trans. on Commun. 37:7, 703-712.
135. Stallings, W. (1990a) Handbook of Computer-Communications Standards: The Open Systems Interconnection (OSI) Model and OSI-Related Standards. Macmillan, New York.
136. Stallings, W. (1990b) Handbook of Computer-Communications Standards: Local Network Standards. Macmillan, New York.
137. Stallings, W. (1990c) Handbook of Computer-Communications Standards: Department of Defense (DOD) Protocol Standards. Macmillan, New York.
138. Stavrakakis, I. (1990) Analysis of a Statistical Multiplexer under a General Input Traffic Model. Proceedings of IEEE INFOCOM'90, 1220-1225, San Francisco.
139. Stern, T. E. (1979) Approximations of Queue Dynamics and Their Application to Adaptive Routing in Computer Communication Networks. IEEE Trans. on Commun. 27:9, 1331-1335.
140. Stern, T. E. (1983) A Queueing Analysis of Packet Voice. Proc. Global Tele. Conf., 1, 71-76. San Diego.
141. Stewart, W. J. (1990) Numerical Solution of Markov Chains. Marcel-Dekker, New York.
142. Stewart, W. J. (1996) Computations with Markov Chains. (W. J. Stewart ed.) Kluwer Academic Publishers, Boston.
143. Stewart, W. J. (1999) Numerical Solution of Markov Chains. (W. J. Stewart ed.) Editado por Prensas Universitarias de Zaragoza.
144. Stidham, S., Jr. (1974) A Last Word on L = λW. Ops. Res. 22:2, 417-421.
145. Takács, L. (1962) Introduction to the Theory of Queues. Oxford University Press, New York.
146. Takagi, H. (1987a) Queueing Analysis of Vacation Models, Part I: M/G/1 and Part II M/G/1 with Vacations. TRL Report TR87-0032. IBM Tokyo Research Laboratory, Tokyo.
147. Takagi, H. (1987b) Queueing Analysis of Vacation Models, Part III: M/G/1 with Priorities. TRL Report TR87-0038. IBM Tokyo Research Laboratory, Tokyo.
148. Takagi, H. (1990) Queueing Analysis of Polling Models, an Update. Stochastic Analysis of Computer and Communication Systems. (H. Takagi, ed.) North-Holland, New York, 267-318.
149. Tang, S. W. (1995) Discrete-Time Queues with Batch-Markovian Arrival, Ph. D. Dissertation, Virginia Polytechnic Institute and State University.
150. Tanenbaum, A. S. (1988) Computer Networks, 2nd. Ed. Prentice-Hall, Englewood Cliffs.
151. Tijms, H. C. (1986) Stochastic Modeling and Analysis: A Computational Approach. John Wiley, New York.
152. Towsley, D. (1980) The Analysis of a Statistical Multiplexer with Nonindependent Arrivals and Errors. IEEE Trans. Commun., 28, 65-72.
153. Trivedi, K. (1982) Probability and Statistics with Reliability, Queueing, and Computer Science Applications. Prentice-Hall, Englewood Cliffs.
154. Turin, W., and M. Zorzi. (2002) Performance Analysis of Delay-Constrained Communications Over Slow Rayleigh Fading Channels. IEEE Trans. Wireless Commun. 1:4, 801-807.
155. Van Arem, B. (1990) Queueing Models for Slotted Transmission Systems. Ph. D. Dissertation, Twente University.
156. Walrand, J. (1988) An Introduction to Queueing Networks. Prentice-Hall, Englewood Cliffs.
157. Weast, R. C, S. M. Selby, and C. D. Hodgman, eds. (1964) Mathematical Tables from Handbook of Chemistry and Physics, 12th. Ed. The Chemical Rubber Co., Cleveland.
158. Welch, P. D. (1964) On a Generalized M/G/1 Queueing Process in which the First Customer Receives Exceptional Service. Ops. Res. 12, 736-762.
159. Whitt, W. (2002) Stochastic-Process Limits: An Introduction to Stochastic-Process Limits and Their Applications to Queues. Springer-Verlag, New York.
160. Wolff, R. W. (1970) Work Conserving Priorities. J. App. Prob. 7:2, 327-337.
161. Wolff, R. W. (1982) Poisson Arrivals See Time Averages. Ops. Res. 30:2, 223-231.
162. Wolff, R. W. (1989) Stochastic Modeling and the Theory of Queues. Prentice-Hall, Englewood Cliffs.
163. Wolff, R. W. (1990) A Note on PASTA and Anti-PASTA for Continuous-Time Markov Chains. Ops. Res. 38:1, 176-177.
164. Woodside, C. M., and E. D. S. Ho. (1987) Engineering Calculation of the Overflow Probabilities in Buffers with Markov-Interrupted Service. IEEE Trans. on Commun. 35:12, 1272-1277.
165. Wortman, M. A., and R. L. Disney. (1990) Vacation Queues with Markov Schedules. Adv. Appl. Prob. 22, 730-748.
166. Zhang, J., and E. J. Coyle. (1989) Transient Analysis of Quasi-Birth-Death Processes. Commun. Statist., Stochastic Models 5:3, 459-496.