## Introduction to Stochastic NetworksIn a stochastic network, such as those in computer/telecommunications and manufacturing, discrete units move among a network of stations where they are processed or served. Randomness may occur in the servicing and routing of units, and there may be queueing for services. This book describes several basic stochastic network processes, beginning with Jackson networks and ending with spatial queueing systems in which units, such as cellular phones, move in a space or region where they are served. The focus is on network processes that have tractable (closed-form) expressions for the equilibrium probability distribution of the numbers of units at the stations. These distributions yield network performance parameters such as expectations of throughputs, delays, costs, and travel times. The book is intended for graduate students and researchers in engineering, science and mathematics interested in the basics of stochastic networks that have been developed over the last twenty years. Assuming a graduate course in stochastic processes without measure theory, the emphasis is on multi-dimensional Markov processes. There is also some self-contained material on point processes involving real analysis. The book also contains rather complete introductions to reversible Markov processes, Palm probabilities for stationary systems, Little laws for queueing systems and space-time Poisson processes. This material is used in describing reversible networks, waiting times at stations, travel times and space-time flows in networks. Richard Serfozo received the Ph.D. degree in Industrial Engineering and Management Sciences at Northwestern University in 1969 and is currently Professor of Industrial and Systems Engineering at Georgia Institute of Technology. Prior to that he held positions in the Boeing Company, Syracuse University, and Bell Laboratories. He has held |

### ´Ù¸¥ »ç¶÷µéÀÇ ÀÇ°ß - ¼Æò ¾²±â

¼ÆòÀ» Ã£À» ¼ö ¾ø½À´Ï´Ù.

### ¸ñÂ÷

II | 1 |

III | 7 |

IV | 9 |

V | 12 |

VI | 14 |

VII | 18 |

VIII | 19 |

IX | 20 |

LIX | 153 |

LXI | 155 |

LXII | 157 |

LXIII | 161 |

LXIV | 166 |

LXV | 171 |

LXVI | 172 |

LXVII | 174 |

X | 24 |

XI | 26 |

XII | 30 |

XIII | 32 |

XIV | 35 |

XV | 39 |

XVI | 42 |

XVII | 44 |

XIX | 47 |

XX | 50 |

XXI | 53 |

XXII | 55 |

XXIII | 58 |

XXIV | 61 |

XXV | 64 |

XXVI | 68 |

XXVII | 71 |

XXVIII | 73 |

XXIX | 74 |

XXX | 79 |

XXXI | 81 |

XXXII | 82 |

XXXIII | 85 |

XXXIV | 87 |

XXXV | 90 |

XXXVI | 91 |

XXXVII | 93 |

XXXVIII | 96 |

XXXIX | 97 |

XL | 99 |

XLII | 102 |

XLIII | 104 |

XLIV | 109 |

XLV | 112 |

XLVI | 115 |

XLVII | 120 |

XLVIII | 122 |

XLIX | 127 |

L | 131 |

LI | 133 |

LII | 135 |

LIII | 136 |

LIV | 139 |

LV | 141 |

LVI | 143 |

LVII | 145 |

LVIII | 149 |

LXVIII | 179 |

LXIX | 180 |

LXX | 181 |

LXXI | 184 |

LXXII | 187 |

LXXIII | 191 |

LXXIV | 193 |

LXXV | 195 |

LXXVI | 199 |

LXXVII | 201 |

LXXVIII | 204 |

LXXIX | 205 |

LXXX | 206 |

LXXXI | 207 |

LXXXII | 210 |

LXXXIII | 212 |

LXXXIV | 215 |

LXXXV | 219 |

LXXXVI | 221 |

LXXXVII | 224 |

LXXXVIII | 225 |

LXXXIX | 227 |

XC | 228 |

XCI | 230 |

XCII | 232 |

XCIII | 233 |

XCIV | 238 |

XCV | 242 |

XCVI | 246 |

XCVII | 249 |

XCVIII | 255 |

XCIX | 257 |

C | 259 |

CI | 261 |

CII | 263 |

CIII | 264 |

CIV | 265 |

CV | 269 |

CVI | 273 |

CVII | 278 |

CVIII | 281 |

CIX | 284 |

287 | |

CXI | 289 |

297 | |

### ±âÅ¸ ÃâÆÇº» - ¸ðµÎ º¸±â

### ÀÚÁÖ ³ª¿À´Â ´Ü¾î ¹× ±¸¹®

arrival rate assume assumptions average number balance equations batch birth-death process chapter compound Poisson process Consider Corollary defined denote the number distributed with rate equivalent ergodic Example exists exit exponentially distributed finite invariant measure irreducible Jackson and Whittle Jackson network Jackson process large numbers law of large Little laws Markov chain Markov network Markov process Markovian mean measure multiclass network is open network process nonnegative normalization constant number of customers number of units Palm probability partial balance partition point process process with rate process X product form PROOF Proposition quasi-reversible queueing system reversible with respect routing rates sequence service rates sojourn space stationary distribution stationary functional stationary process stochastic process subset Suppose T-transition Tjkx traffic equations transition rates unit enters unit moves vector waiting Whittle network Whittle process