Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Delayed and network queues / / Aliakbar Montazer Haghighi, Prairie View A&M University, member of Texas A&M University System, Prairie View, Texas, USA, Dimitar P. Mishev, Prairie View A&M University, member of Texas A&M University System, Prairie View, Texas
| Delayed and network queues / / Aliakbar Montazer Haghighi, Prairie View A&M University, member of Texas A&M University System, Prairie View, Texas, USA, Dimitar P. Mishev, Prairie View A&M University, member of Texas A&M University System, Prairie View, Texas |
| Autore | Haghighi Aliakbar Montazer |
| Edizione | [1st edition] |
| Pubbl/distr/stampa | Hoboken, New Jersey : , : John Wiley & Sons, , [2016] |
| Descrizione fisica | 1 online resource (417 p.) |
| Disciplina | 004.601/51982 |
| Soggetto topico |
Routing (Computer network management) - Mathematics
Computer networks - Mathematical models Telecommunication - Traffic Queuing networks (Data transmission) |
| Soggetto genere / forma | Electronic books. |
| ISBN | 1-119-02214-2 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Cover; Title Page; Copyright; Dedication; Contents; Preface; Chapter 1 Preliminaries; 1.1 Basics of Probability; 1.1.1 Introduction; 1.1.2 Conditional Probability; 1.2 Discrete Random Variables and Distributions; 1.3 Discrete Moments; 1.4 Continuous Random Variables, Density, and Cumulative Distribution Functions; 1.5 Continuous Random Vector; 1.6 Functions of Random Variables; 1.7 Continuous Moments; 1.8 Difference Equations; 1.8.1 Introduction; 1.8.2 Basic Definitions and Properties; 1.9 Methods of Solving Linear Difference Equations with Constant Coefficients
1.9.1 Characteristic Equation Method1.9.2 Recursive Method; 1.9.3 Generating Function Method; 1.9.4 Laplace Transform Method; Exercises; Chapter 2 Stochastic Processes; 2.1 Introduction and Basic Definitions; 2.2 Markov Chain; 2.2.1 Classification of States; 2.3 Markov Process; 2.3.1 Markov Process with Discrete Space State; 2.4 Random Walk; 2.5 Up-and-Down Biased Coin Design as a Random Walk; Exercises; Chapter 3 Birth and Death Processes; 3.1 Overviews of the Birth and Death Processes; 3.2 Finite B-D Process; 3.3 Pure Birth Process (Poisson Process) 3.4 Pure Death Process (Poisson Death Process)Exercises; Chapter 4 Standard Queues; 4.1 Introduction of Queues (General Birth and Death Process); 4.1.1 Mechanism, Characteristics, and Types of Queues; 4.2 Remarks on Non-Markovian Queues; 4.2.1 Takács's Waiting Time Paradox; 4.2.2 Virtual Waiting Time and Takács's Integro-Differential Equation; 4.2.3 The Unfinished Work; 4.3 Stationary M/M/1 Queueing Process; 4.4 A Parallel M/M/C/K with Baking and Reneging; 4.5 Stationary M/M/1/K Queueing Process; 4.6 Busy Period of an M/M/1/K Queue 4.7 Stationary M/M/1 and M/M/1/K Queueing Processes with Feedback4.7.1 Stationary Distribution of the Sojourn Time of a Task; 4.7.2 Distribution of the Total Time of Service by a Task; 4.7.3 Stationary Distribution of the Feedback Queue Size; 4.7.4 Stationary Distribution of n (Sojourn Time of the nth task); 4.8 Queues with Bulk Arrivals and Batch Service; 4.9 A Priority Queue with Balking and Reneging; 4.10 Discrete Time M/M/1 Queueing Process, Combinatorics Method (Lattice Paths); 4.10.1 The Basic Ballot Problem; 4.10.2 Ballot Problem (based on Takács 1997) 4.10.3 Transient Solution of the M/M/1 by Lattice Path Method4.11 Stationary M/M/C Queueing Process; 4.11.1 A Stationary Multiserver Queue; Exercises; Chapter 5 Queues With Delay; 5.1 Introduction; 5.2 A Queuing System with Delayed Service; 5.3 An M/G/1 Queue with Server Breakdown and with Multiple Working Vacation; 5.3.1 Mathematical Formulation of the Model; 5.3.2 Steady-State Mean Number of Tasks in the System; 5.3.3 A Special Case; 5.4 A Bulk Queuing System Under N-Policy with Bilevel Service Delay Discipline and Start-Up Time; 5.4.1 Analysis of the Model 5.5 Interrelationship between N-Policy M/G/1/K and F-Policy G/M/1/K Queues with Start-up Time |
| Record Nr. | UNINA-9910466077403321 |
Haghighi Aliakbar Montazer
|
||
| Hoboken, New Jersey : , : John Wiley & Sons, , [2016] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Modern probabilistic methods for analysis of telecommunication networks : Belarusian Winter Workshops in Queueing Theory, BWWQT 2013, Minsk, Belarus, January 28-31, 2013 : proceedings / / Alexander Dudin ... [et al.] (eds.)
| Modern probabilistic methods for analysis of telecommunication networks : Belarusian Winter Workshops in Queueing Theory, BWWQT 2013, Minsk, Belarus, January 28-31, 2013 : proceedings / / Alexander Dudin ... [et al.] (eds.) |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2013 |
| Descrizione fisica | 1 online resource (VIII, 217 p. 40 illus.) |
| Disciplina | 519.8/2 |
| Altri autori (Persone) | DudinAlexander |
| Collana | Communications in computer and information science |
| Soggetto topico |
Queuing networks (Data transmission)
Telecommunication - Switching systems |
| ISBN | 3-642-35980-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Altri titoli varianti | BWWQT 2013 |
| Record Nr. | UNINA-9910739451303321 |
| Berlin ; ; New York, : Springer, c2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Performance modeling and design of computer systems : queueing theory in action / / Mor Harchol-Balter, Carnegie Mellon University, Pennsylvania [[electronic resource]]
| Performance modeling and design of computer systems : queueing theory in action / / Mor Harchol-Balter, Carnegie Mellon University, Pennsylvania [[electronic resource]] |
| Autore | Harchol-Balter Mor <1966-> |
| Pubbl/distr/stampa | Cambridge : , : Cambridge University Press, , 2013 |
| Descrizione fisica | 1 online resource (xxiii, 548 pages) : digital, PDF file(s) |
| Disciplina | 519.8/2 |
| Soggetto topico |
Transaction systems (Computer systems) - Mathematical models
Computer systems - Design and construction - Mathematics Queuing theory Queuing networks (Data transmission) |
| ISBN |
1-107-23684-3
1-107-25475-2 1-139-61641-2 1-139-62571-3 1-139-61269-7 1-139-22642-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Machine generated contents note: Part I. Introduction to Queueing: 1. Motivating examples; 2. Queueing theory terminology; Part II. Necessary Probability Background: 3. Probability review; 4. Generating random variables; 5. Sample paths, convergence, and averages; Part III. The Predictive Power of Simple Operational Laws: 'What If' Questions and Answers; 6. Operational laws; 7. Modification analysis; Part IV. From Markov Chains to Simple Queues: 8. Discrete-time Markov Chains; 9. Ergodicity theory; 10. Real-world examples: Google, Aloha; 11. Generating functions for Markov Chains; 12. Exponential distributions and Poisson Process; 13. Transition to continuous-time Markov Chains; 14. M/M/1 and PASTA; Part V. Server Farms and Networks: Multi-server, Multi-queue Systems: 15. Server farms: M/M/k and M/M/k/k; 16. Capacity provisioning for server farms; 17. Time-reversibility and Burke's Theorem; 18. Jackson network of queues; 19. Classed network of queues; 20. Closed networks of queues; Part VI. Real-World Workloads: High-Variability and Heavy Tails: 21. Tales of tails: real-world workloads; 22. Phase-type workloads and matrix-analytic; 23. Networks of time-sharing (PS) servers; 24. M/G/I queue and inspection paradox; 25. Task assignment for server farms; 26. Transform analysis; 27. M/G/I transform analysis; 28. Power optimization application; Part VII. Smart Scheduling: 29. Performance metrics; 30. Non-preemptive, non-size-based policies; 31. Preemptive, non-size-based policies; 32. Non-preemptive, size-based policies; 33. Preemptive, size-based policies; 34. Scheduling: SRPT and fairness. |
| Altri titoli varianti | Performance modeling & design of computer systems |
| Record Nr. | UNINA-9910465041203321 |
|
Harchol-Balter Mor <1966->
|
||
| Cambridge : , : Cambridge University Press, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Performance modeling and design of computer systems : queueing theory in action / / Mor Harchol-Balter, Carnegie Mellon University, Pennsylvania [[electronic resource]]
| Performance modeling and design of computer systems : queueing theory in action / / Mor Harchol-Balter, Carnegie Mellon University, Pennsylvania [[electronic resource]] |
| Autore | Harchol-Balter Mor <1966-> |
| Pubbl/distr/stampa | Cambridge : , : Cambridge University Press, , 2013 |
| Descrizione fisica | 1 online resource (xxiii, 548 pages) : digital, PDF file(s) |
| Disciplina | 519.8/2 |
| Soggetto topico |
Transaction systems (Computer systems) - Mathematical models
Computer systems - Design and construction - Mathematics Queuing theory Queuing networks (Data transmission) |
| ISBN |
1-107-23684-3
1-107-25475-2 1-139-61641-2 1-139-62571-3 1-139-61269-7 1-139-22642-8 |
| Classificazione | COM000000 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Machine generated contents note: Part I. Introduction to Queueing: 1. Motivating examples; 2. Queueing theory terminology; Part II. Necessary Probability Background: 3. Probability review; 4. Generating random variables; 5. Sample paths, convergence, and averages; Part III. The Predictive Power of Simple Operational Laws: 'What If' Questions and Answers; 6. Operational laws; 7. Modification analysis; Part IV. From Markov Chains to Simple Queues: 8. Discrete-time Markov Chains; 9. Ergodicity theory; 10. Real-world examples: Google, Aloha; 11. Generating functions for Markov Chains; 12. Exponential distributions and Poisson Process; 13. Transition to continuous-time Markov Chains; 14. M/M/1 and PASTA; Part V. Server Farms and Networks: Multi-server, Multi-queue Systems: 15. Server farms: M/M/k and M/M/k/k; 16. Capacity provisioning for server farms; 17. Time-reversibility and Burke's Theorem; 18. Jackson network of queues; 19. Classed network of queues; 20. Closed networks of queues; Part VI. Real-World Workloads: High-Variability and Heavy Tails: 21. Tales of tails: real-world workloads; 22. Phase-type workloads and matrix-analytic; 23. Networks of time-sharing (PS) servers; 24. M/G/I queue and inspection paradox; 25. Task assignment for server farms; 26. Transform analysis; 27. M/G/I transform analysis; 28. Power optimization application; Part VII. Smart Scheduling: 29. Performance metrics; 30. Non-preemptive, non-size-based policies; 31. Preemptive, non-size-based policies; 32. Non-preemptive, size-based policies; 33. Preemptive, size-based policies; 34. Scheduling: SRPT and fairness. |
| Altri titoli varianti | Performance modeling & design of computer systems |
| Record Nr. | UNINA-9910789462403321 |
|
Harchol-Balter Mor <1966->
|
||
| Cambridge : , : Cambridge University Press, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Performance modeling and design of computer systems : queueing theory in action / / Mor Harchol-Balter, Carnegie Mellon University, Pennsylvania [[electronic resource]]
| Performance modeling and design of computer systems : queueing theory in action / / Mor Harchol-Balter, Carnegie Mellon University, Pennsylvania [[electronic resource]] |
| Autore | Harchol-Balter Mor <1966-> |
| Pubbl/distr/stampa | Cambridge : , : Cambridge University Press, , 2013 |
| Descrizione fisica | 1 online resource (xxiii, 548 pages) : digital, PDF file(s) |
| Disciplina | 519.8/2 |
| Soggetto topico |
Transaction systems (Computer systems) - Mathematical models
Computer systems - Design and construction - Mathematics Queuing theory Queuing networks (Data transmission) |
| ISBN |
1-107-23684-3
1-107-25475-2 1-139-61641-2 1-139-62571-3 1-139-61269-7 1-139-22642-8 |
| Classificazione | COM000000 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Machine generated contents note: Part I. Introduction to Queueing: 1. Motivating examples; 2. Queueing theory terminology; Part II. Necessary Probability Background: 3. Probability review; 4. Generating random variables; 5. Sample paths, convergence, and averages; Part III. The Predictive Power of Simple Operational Laws: 'What If' Questions and Answers; 6. Operational laws; 7. Modification analysis; Part IV. From Markov Chains to Simple Queues: 8. Discrete-time Markov Chains; 9. Ergodicity theory; 10. Real-world examples: Google, Aloha; 11. Generating functions for Markov Chains; 12. Exponential distributions and Poisson Process; 13. Transition to continuous-time Markov Chains; 14. M/M/1 and PASTA; Part V. Server Farms and Networks: Multi-server, Multi-queue Systems: 15. Server farms: M/M/k and M/M/k/k; 16. Capacity provisioning for server farms; 17. Time-reversibility and Burke's Theorem; 18. Jackson network of queues; 19. Classed network of queues; 20. Closed networks of queues; Part VI. Real-World Workloads: High-Variability and Heavy Tails: 21. Tales of tails: real-world workloads; 22. Phase-type workloads and matrix-analytic; 23. Networks of time-sharing (PS) servers; 24. M/G/I queue and inspection paradox; 25. Task assignment for server farms; 26. Transform analysis; 27. M/G/I transform analysis; 28. Power optimization application; Part VII. Smart Scheduling: 29. Performance metrics; 30. Non-preemptive, non-size-based policies; 31. Preemptive, non-size-based policies; 32. Non-preemptive, size-based policies; 33. Preemptive, size-based policies; 34. Scheduling: SRPT and fairness. |
| Altri titoli varianti | Performance modeling & design of computer systems |
| Record Nr. | UNINA-9910821695403321 |
|
Harchol-Balter Mor <1966->
|
||
| Cambridge : , : Cambridge University Press, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
QTNA 2016 : 11th International Conference on Queueing Theory and Network Applications : December 13-15, 2016, Wellington, New Zealand. / / in-cooperations, ACM SIGMETRICS
| QTNA 2016 : 11th International Conference on Queueing Theory and Network Applications : December 13-15, 2016, Wellington, New Zealand. / / in-cooperations, ACM SIGMETRICS |
| Pubbl/distr/stampa | New York : , : ACM, , 2016 |
| Descrizione fisica | 1 online resource (159 pages) |
| Disciplina | 519.82 |
| Collana | ACM International Conference Proceeding Series |
| Soggetto topico |
Queuing theory
Queuing networks (Data transmission) Computer networks |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Altri titoli varianti | Proceedings of the 11th International Conference on Queueing Theory and Network Applications |
| Record Nr. | UNINA-9910376446903321 |
| New York : , : ACM, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Queues applied to telecoms : courses and exercises / / Toky Basilide Ravaliminoarimalalason and Falimanana Randimbindrainibe
| Queues applied to telecoms : courses and exercises / / Toky Basilide Ravaliminoarimalalason and Falimanana Randimbindrainibe |
| Autore | Ravaliminoarimalalason Toky Basilide |
| Pubbl/distr/stampa | Hoboken, NJ : , : John Wiley & Sons, Inc., , [2023] |
| Descrizione fisica | 1 online resource (271 pages) |
| Disciplina | 621.382 |
| Collana | Networks and telecommunications series |
| Soggetto topico |
Queuing networks (Data transmission)
Telecommunication systems |
| ISBN |
1-394-19198-7
1-394-19196-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front Matter -- Typical Processes in Queues. The Poisson Process -- Markov Chains -- Queues. Common Queues -- Product-Form Queueing Networks -- Teletraffic. Notion of Teletraffic -- Resource Requests and Activity -- The Teletraffic of Loss Systems -- Teletraffic in Delay Systems -- Answers to Exercises. Chapter 1 Exercises -- Chapter 2 Exercises -- Chapter 3 Exercises -- Chapter 4 Exercise -- Chapter 5 Exercises -- Chapter 6 Exercises -- Chapter 7 Exercises -- Chapter 8 Exercises -- Appendices. Appendix 1: Erlang-B Table -- Appendix 2: Erlang-C Table -- References -- Index -- Other titles from ISTE in Networks and Telecommunications |
| Record Nr. | UNINA-9910830202903321 |
|
Ravaliminoarimalalason Toky Basilide
|
||
| Hoboken, NJ : , : John Wiley & Sons, Inc., , [2023] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Stability analysis of regenerative queueing models : mathematical methods and applications / / Evsey Morozov and Bart Steyaert
| Stability analysis of regenerative queueing models : mathematical methods and applications / / Evsey Morozov and Bart Steyaert |
| Autore | Morozov Evsey |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2021] |
| Descrizione fisica | 1 online resource (193 pages) |
| Disciplina | 519.82 |
| Soggetto topico | Queuing networks (Data transmission) |
| ISBN | 3-030-82438-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910503002703321 |
|
Morozov Evsey
|
||
| Cham, Switzerland : , : Springer, , [2021] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Stability analysis of regenerative queueing models : mathematical methods and applications / / Evsey Morozov and Bart Steyaert
| Stability analysis of regenerative queueing models : mathematical methods and applications / / Evsey Morozov and Bart Steyaert |
| Autore | Morozov Evsey |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2021] |
| Descrizione fisica | 1 online resource (193 pages) |
| Disciplina | 519.82 |
| Soggetto topico | Queuing networks (Data transmission) |
| ISBN | 3-030-82438-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996464412903316 |
|
Morozov Evsey
|
||
| Cham, Switzerland : , : Springer, , [2021] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
