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...

Cijeli opis

Spremljeno u:
Bibliografski detalji
Glavni autor: Daduna, Hans, 1947-
Format: Livre numérique
Jezik:Anglais
Izdano: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Serija:Lecture notes in computer science 2046
Teme:
Online pristup:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Bilješka: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Queueing networks with discrete time scale, explicit expressions for the Steady State Behavior of discrete time stochastic networks, Hans Daduna, 2001, Berlin, Springer, 1 vol. (X-138 p.), Lecture notes in computer science, 3-540-42357-5
• Queueing Networks with Discrete Time Scale, Texte imprimé, 9783662182765
LEADER 03768nam a22004457a 4500
001 948535
008 110927q2000 xxe ||| |||| 00| 0 eng d
009 PPN155169203
020 |a 9783540445920 (PDF) 
041 0 |a eng 
082 |a 519.82 
082 |a 004 
100 1 |a Daduna, Hans,  |d 1947- 
245 1 0 |a Queueing networks with discrete time scale :  |b explicit expressions for the Steady State Behavior of discrete time stochastic networks   |c Hans Daduna. 
260 |a Berlin [etc.] :  |b Springer. 
260 |a Cham :  |b Springer Nature,  |c [20..]. 
490 0 |a Lecture notes in computer science  |v 2046  |x 1611-3349 
500 |a Archives Springer e-books (Licence nationale) 
500 |a Archives Springer e-books (Licence nationale) 
505 0 |a 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. 
506 |a Accès en ligne pour les établissements français bénéficiaires des licences nationales 
506 |a Accès soumis à abonnement pour tout autre établissement 
506 |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 
520 |a 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 operations research, the second breakthrough, as well as subsequent major work in the area, was closely related to computer science, particularly to performance analysis of complex systems in computer and communication science. The text reports on recent research and development in the area. It is centered around explicit expressions for the steady behavior of discrete time queueing networks and gives a moderately positive answer to the question of whether there can be a product form calculus in discrete time. Originating from a course given by the author at Hamburg University, this book is ideally suited as a text for courses on discrete time stochastic networks. 
650 |a Informatique 
650 |a Systèmes stochastiques 
650 |a Files d'attente, Théorie des 
650 |a Systèmes échantillonnés 
650 |a Systèmes d'exploitation (ordinateurs) 
650 |a Réseaux d'ordinateurs 
650 |a Probabilités 
650 |a Analyse stochastique 
650 |a Systèmes informatiques  |x Pannes 
776 0 |0 058096736  |t Queueing networks with discrete time scale  |o explicit expressions for the Steady State Behavior of discrete time stochastic networks  |f Hans Daduna  |d 2001  |c Berlin  |n Springer  |p 1 vol. (X-138 p.)  |s Lecture notes in computer science  |z 3-540-42357-5 
776 0 |t Queueing Networks with Discrete Time Scale  |b Texte imprimé  |z 9783662182765 
856 4 |q PDF  |u https://doi.org/10.1007/3-540-44592-7  |z Accès sur la plateforme de l'éditeur 
856 4 |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-HFX47G1T-T  |z Accès sur la plateforme Istex 
856 4 |5 452349901:748062866  |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-44592-7  |z Accès Université d'Orléans 
856 4 |5 180339901:751514500  |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-44592-7  |z Accès INSA CVL 
997 |0 948535  |1 Livre numérique  |a Ressource numérique  |b INSA  |b ENSA  |c 0/Bibliothèque numérique/  |c 1/Bibliothèque numérique/Autre ressource numérique/