Queueing Networks with Discrete Time Scale Explicit Expressions for the Steady State Behavior of Discrete Time Stochastic Networks /
Building on classical queueing theory mainly dealing with single node queueing systems, networks of queues, or stochastic networks has been a field of intensive research over the last three decades. Whereas the first breakthrough in queueing network theory was initiated by problems and work in opera...
Κύριος συγγραφέας: | |
---|---|
Συγγραφή απο Οργανισμό/Αρχή: | |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2001.
|
Έκδοση: | 1st ed. 2001. |
Σειρά: | Lecture Notes in Computer Science,
2046 |
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- State dependent Bernoulli Servers
- Closed Cycles of State Dependent Bernoulli Servers with Different Customer Types
- Open Tandems of State Dependent Bernoulli Servers with Different Customer Types
- Networks with Doubly Stochastic and Geometrical Servers
- General Networks with Batch Movements and Batch Services.