vi曲 Contents 3.4.1 M/M/m:The m-Server Case,135 3.4.2 M/M/o:Infinite-Server Case,138 3.4.3 M/M/m/m:The m-Server Loss System,140 3.5 The M/G/1 System,140 3.5.1 M/G/1 Queues with Vacations,147 3.5.2 Reservations and Polling,150 Single-User System,152 Multiuser System,154 Limited Service Systems,157 3.5.3 Priority Queueing,159 Nonpreemptive Priority,159 Preemptive Resume Priority,161 3.6 Networks of Transmission Lines,163 3.7 Time Reversibility-Burke's Theorem,167 3.8 Networks of Queues-Jackson's Theorem,174 3.9 Summary,180 3.10 Notes,Sources,and Suggested Reading,180 PROBLEMS,182 APPENDIX A:Review of Markov Chain Theory,194 3.A.1 Discrete-Time Markov Chains,194 3.A.2 Detailed Balance Equations,196 3.A.3 Partial Balance Equations,197 3.A.4 Continuous-Time Markov Chains,197 APPENDIX B:Summary of Results,199 Chapter 4 MULTIACCESS COMMUNICATION 205 4.1 Introduction,205viii Contents 3.4.1 MIMIm: The m-Server Case, 135 3.4.2 M/M/oo: Infinite-Server Case, 138 3.4.3 M/M/m/m: The m-Server Loss System, 140 3.5 The M/G/1 System, 140 3.5.1 M/G/1 Queues with Vacations, 147 3.5.2 Reservations and Polling, 150 Single-User System, 152 Multiuser System, 154 Limited Service Systems, 157 3.5.3 Priority Queueing, 159 Nonpreemptive Priority, 159 Preemptive Resume Priority, 161 3.6 Networks of Transmission Lines, 163 3.7 Time Reversibility-Burke's Theorem, 167 3.8 Networks of Queues-Jackson's Theorem, 174 3.9 Summary, 180 3.10 Notes, Sources, and Suggested Reading, 180 PROBLEMS, 182 APPENDIX A: Review of Markov Chain Theory, 194 3.A. 1 Discrete-Time Markov Chains, 194 3.A.2 Detailed Balance Equations, 196 3.A.3 Partial Balance Equations, 197 3.A.4 Continuous-Time Markov Chains, 197 APPENDIX B: Summary of Results, 199 Chapter 4 MULTIACCESS COMMUNICATION 205 4.1 Introduction, 205 ___