top

  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.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Communication and computer networks : modelling with discrete-time queues / Michael E. Woodward
Communication and computer networks : modelling with discrete-time queues / Michael E. Woodward
Autore Woodward, Michael E.
Pubbl/distr/stampa London : Pentech press, 1993
Descrizione fisica x, 205 p. ; 23 cm
Disciplina 004.60151982
Soggetto topico Computer networks-mathematical models
Discrete-time systems
Queueing theory
ISBN 0727304100
Classificazione AMS 68M10
CR C.2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNISALENTO-991000760459707536
Woodward, Michael E.  
London : Pentech press, 1993
Materiale a stampa
Lo trovi qui: Univ. del Salento
Opac: Controlla la disponibilità qui
Delayed and Network Queues
Delayed and Network Queues
Autore Haghighi Aliakbar Montazer
Edizione [1st ed.]
Pubbl/distr/stampa Newark : , : John Wiley & Sons, Incorporated, , 2016
Descrizione fisica 1 online resource (417 pages)
Disciplina 004.60151982
Altri autori (Persone) MishevDimitar P
Soggetto topico Routing (Computer network management)--Mathematics
Soggetto genere / forma Electronic books.
ISBN 9781119022145
9781119022138
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 Method -- 1.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 Feedback.
4.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 Method -- 4.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 -- 5.5.1 N-Policy M/G/1/K Queuing System with Exponential Start-up Time -- 5.5.2 F-Policy G/E/1/K Queuing System with Exponential Start-up Time -- 5.6 A Transient M/M/1 Queue Under (M, N)-Policy, Lattice Path Method -- 5.6.1 Solution in Discrete Time -- 5.6.2 Solution in Continuous Time -- 5.7 Stationary M/M/1 Queuing Process with Delayed Feedback -- 5.7.1 Distribution of the Queue Length -- 5.7.2 Mean Queue Length and Waiting Time -- 5.8 Single-Server Queue with Unreliable Server and Breakdowns with an Optional Second Service -- 5.9 A Bulk Arrival Retrial Queue with Unreliable Server -- 5.9.1 The Model -- 5.9.2 Model Analysis -- 5.9.3 Steady-State System Analysis.
5.9.4 Performance Measures -- 5.9.5 Numerical Illustration -- 5.10 Multiserver Queue with Retrial Feedback Queuing System with Two Orbits -- 5.11 Steady-State Stability Condition of a Retrial Queuing System with Two Orbits, Reneging, and Feedback -- 5.11.1 Necessary Stability Condition for the Steady-State System -- 5.12 Batch Arrival Queue with General Service in Two Fluctuating Modes and Reneging During Vacation and Breakdowns -- 5.12.1 The Model -- 5.12.2 Analysis -- Exercises -- Chapter 6 Networks of Queues with Delay -- 6.1 Introduction to Networks of Queues -- 6.2 Historical Notes on Networks of Queues -- 6.3 Jackson's Network of Queues -- 6.3.1 Jackson's Model -- 6.4 Robustness of Networks of Queues -- 6.5 A MAP Single-Server Queueing System with Delayed Feedback as a Network of Queues -- 6.5.1 Description of the Model -- 6.5.2 Service Station -- 6.5.3 Stepwise Explicit Joint Distribution of the Number of Tasks in the System: General Case When Batch Sizes Vary Between a Minimum k and a Maximum K -- 6.6 Unreliable Networks of Queueing System Models -- 6.6.1 Unreliable Network Model of Goodman and Massey -- 6.6.2 Unreliable Network of Queues Model of Mylosz and Daduna -- 6.6.3 Unreliable Network of Queues Model of Gautam Choudhury, Jau-Chuan Ke, and Lotfi Tadj: A Queueing System with Two Network Phases of Services, Unreliable Server, Repair Time Delay under N-Policy -- 6.7 Assessment of Reliability of a Network of Queues -- 6.8 Effect of Network Service Breakdown -- 6.8.1 The Model (CoginfoCom System) -- 6.8.2 Analysis -- 6.8.3 Numerical Example -- Exercises -- References -- Index -- EULA.
Record Nr. UNINA-9910795987803321
Haghighi Aliakbar Montazer  
Newark : , : John Wiley & Sons, Incorporated, , 2016
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Delayed and Network Queues
Delayed and Network Queues
Autore Haghighi Aliakbar Montazer
Edizione [1st ed.]
Pubbl/distr/stampa Newark : , : John Wiley & Sons, Incorporated, , 2016
Descrizione fisica 1 online resource (417 pages)
Disciplina 004.60151982
Altri autori (Persone) MishevDimitar P
Soggetto topico Routing (Computer network management)--Mathematics
Soggetto genere / forma Electronic books.
ISBN 9781119022145
9781119022138
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 Method -- 1.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 Feedback.
4.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 Method -- 4.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 -- 5.5.1 N-Policy M/G/1/K Queuing System with Exponential Start-up Time -- 5.5.2 F-Policy G/E/1/K Queuing System with Exponential Start-up Time -- 5.6 A Transient M/M/1 Queue Under (M, N)-Policy, Lattice Path Method -- 5.6.1 Solution in Discrete Time -- 5.6.2 Solution in Continuous Time -- 5.7 Stationary M/M/1 Queuing Process with Delayed Feedback -- 5.7.1 Distribution of the Queue Length -- 5.7.2 Mean Queue Length and Waiting Time -- 5.8 Single-Server Queue with Unreliable Server and Breakdowns with an Optional Second Service -- 5.9 A Bulk Arrival Retrial Queue with Unreliable Server -- 5.9.1 The Model -- 5.9.2 Model Analysis -- 5.9.3 Steady-State System Analysis.
5.9.4 Performance Measures -- 5.9.5 Numerical Illustration -- 5.10 Multiserver Queue with Retrial Feedback Queuing System with Two Orbits -- 5.11 Steady-State Stability Condition of a Retrial Queuing System with Two Orbits, Reneging, and Feedback -- 5.11.1 Necessary Stability Condition for the Steady-State System -- 5.12 Batch Arrival Queue with General Service in Two Fluctuating Modes and Reneging During Vacation and Breakdowns -- 5.12.1 The Model -- 5.12.2 Analysis -- Exercises -- Chapter 6 Networks of Queues with Delay -- 6.1 Introduction to Networks of Queues -- 6.2 Historical Notes on Networks of Queues -- 6.3 Jackson's Network of Queues -- 6.3.1 Jackson's Model -- 6.4 Robustness of Networks of Queues -- 6.5 A MAP Single-Server Queueing System with Delayed Feedback as a Network of Queues -- 6.5.1 Description of the Model -- 6.5.2 Service Station -- 6.5.3 Stepwise Explicit Joint Distribution of the Number of Tasks in the System: General Case When Batch Sizes Vary Between a Minimum k and a Maximum K -- 6.6 Unreliable Networks of Queueing System Models -- 6.6.1 Unreliable Network Model of Goodman and Massey -- 6.6.2 Unreliable Network of Queues Model of Mylosz and Daduna -- 6.6.3 Unreliable Network of Queues Model of Gautam Choudhury, Jau-Chuan Ke, and Lotfi Tadj: A Queueing System with Two Network Phases of Services, Unreliable Server, Repair Time Delay under N-Policy -- 6.7 Assessment of Reliability of a Network of Queues -- 6.8 Effect of Network Service Breakdown -- 6.8.1 The Model (CoginfoCom System) -- 6.8.2 Analysis -- 6.8.3 Numerical Example -- Exercises -- References -- Index -- EULA.
Record Nr. UNINA-9910821282003321
Haghighi Aliakbar Montazer  
Newark : , : John Wiley & Sons, Incorporated, , 2016
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Elementi introduttivi alla teoria delle code / Alberto Tosalli
Elementi introduttivi alla teoria delle code / Alberto Tosalli
Autore Tosalli, Alberto
Pubbl/distr/stampa Torino : Boringhieri, 1968
Descrizione fisica 127 p. ; 21 cm
Disciplina 519.82
004.60151982
Collana Serie di ricerca operativa
Soggetto topico Teoria delle code
Reti di elaboratori
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione ita
Record Nr. UNIBAS-000028330
Tosalli, Alberto  
Torino : Boringhieri, 1968
Materiale a stampa
Lo trovi qui: Univ. della Basilicata
Opac: Controlla la disponibilità qui
Modelli di reti di code : esercizi / Giuseppe Maifredi, Stefano Mainetti
Modelli di reti di code : esercizi / Giuseppe Maifredi, Stefano Mainetti
Autore Maifredi, Giuseppe
Pubbl/distr/stampa Milano, : Città Studi, 1989
Descrizione fisica 117 p. ; 24 cm.
Disciplina 004.6
004.60151982
Altri autori (Persone) Mainetti, Stefano
Soggetto topico Sistemi a coda - Elaboratori
Reti di elaboratori
Teoria delle code
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione ita
Record Nr. UNISANNIO-RMS1440033
Maifredi, Giuseppe  
Milano, : Città Studi, 1989
Materiale a stampa
Lo trovi qui: Univ. del Sannio
Opac: Controlla la disponibilità qui
Network Intelligence Meets User Centered Social Media Networks [[electronic resource] /] / edited by Reda Alhajj, H. Ulrich Hoppe, Tobias Hecking, Piotr Bródka, Przemyslaw Kazienko
Network Intelligence Meets User Centered Social Media Networks [[electronic resource] /] / edited by Reda Alhajj, H. Ulrich Hoppe, Tobias Hecking, Piotr Bródka, Przemyslaw Kazienko
Edizione [1st ed. 2018.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018
Descrizione fisica 1 online resource (VI, 247 p. 63 illus., 54 illus. in color.)
Disciplina 004.60151982
Collana Lecture Notes in Social Networks
Soggetto topico Social sciences—Data processing
Social sciences—Computer programs
Physics
Data mining
Internet marketing
Graph theory
Computational Social Sciences
Applications of Graph Theory and Complex Networks
Data Mining and Knowledge Discovery
Online Marketing/Social Media
Graph Theory
ISBN 3-319-90312-8
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Data-based centrality measures -- Extracting the Main Path of historic events from Wikipedia -- Simulating trade in economic networks with TrEcSim -- Community Aliveness: Discovering interaction decay patterns in online social communities -- Network Patterns of Direct and Indirect Reciprocity in edX MOOC Forums -- Targeting influential nodes for recovery in bootstrap percolation on hyperbolic networks -- Trump versus Clinton – Twitter communication during the US primaries -- Extended feature-driven graph model for Social Media Networks -- Market basket analysis using minimum spanning trees -- Behavior-based relevance estimation for social networks interaction relations -- Sponge walker: Community detection in large directed social networks using local structures and random walks -- Identifying promising research topics in Computer Science -- Identifying accelerators of information diffusion across social media channels -- Towards an ILP approach for learning privacy heuristics from users' regrets -- Strength of nations: A case study on estimating the influence of leading countries using social media analysis -- Incremental learning in dynamic networks for node classification.
Record Nr. UNINA-9910300604603321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Petri nets for modeling of large discrete systems / / Reggie Davidrajuh
Petri nets for modeling of large discrete systems / / Reggie Davidrajuh
Autore Davidrajuh Reggie
Pubbl/distr/stampa Gateway East, Singapore : , : Springer, , [2021]
Descrizione fisica 1 online resource (236 pages)
Disciplina 004.60151982
Collana Asset analytics
Soggetto topico Computer networks - Mathematical models
ISBN 981-16-5203-1
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910503005703321
Davidrajuh Reggie  
Gateway East, Singapore : , : Springer, , [2021]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Reti di computer / Andrew S. Tanenbaum
Reti di computer / Andrew S. Tanenbaum
Autore Tanenbaum, Andrew S. <Andrew Stuart ; <1944-
Edizione [2. ed.]
Pubbl/distr/stampa Milano : Jackson Libri
Descrizione fisica XV, 732 p. : ill. ; 25 cm
Disciplina 004.60151982
004.6
Soggetto non controllato Reti di elaboratori
Informatica
Informatica di base
Reti di computer
Internet
ISBN 88-256-0273-1
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione ita
Record Nr. UNINA-990000133110403321
Tanenbaum, Andrew S. <Andrew Stuart ; <1944-  
Milano : Jackson Libri
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Sistemi a coda : modelli, analisi e applicazioni / Romano Fantacci
Sistemi a coda : modelli, analisi e applicazioni / Romano Fantacci
Autore Fantacci, Romano
Pubbl/distr/stampa Bologna : Esculapio, 2014
Descrizione fisica XII, 158 p. ; 24 cm
Disciplina 004.60151982
Soggetto non controllato Teoria delle code
Reti di elaboratori
ISBN 978-88-7488-808-5
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione ita
Record Nr. UNINA-990010085770403321
Fantacci, Romano
Bologna : Esculapio, 2014
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Verification and Evaluation of Computer and Communication Systems [[electronic resource] ] : 11th International Conference, VECoS 2017, Montreal, QC, Canada, August 24–25, 2017, Proceedings / / edited by Kamel Barkaoui, Hanifa Boucheneb, Ali Mili, Sofiène Tahar
Verification and Evaluation of Computer and Communication Systems [[electronic resource] ] : 11th International Conference, VECoS 2017, Montreal, QC, Canada, August 24–25, 2017, Proceedings / / edited by Kamel Barkaoui, Hanifa Boucheneb, Ali Mili, Sofiène Tahar
Edizione [1st ed. 2017.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017
Descrizione fisica 1 online resource (XVI, 205 p. 76 illus.)
Disciplina 004.60151982
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Software engineering
Operating systems (Computers)
Compilers (Computer programs)
Computer programming
Artificial intelligence
Software Engineering
Operating Systems
Compilers and Interpreters
Programming Techniques
Artificial Intelligence
ISBN 3-319-66176-0
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Distributed computing models.- Formal languages and automata theory.- Concurrency.- Probabilistic computation --  Timed and hybrid models.- Formal software verification.- Model verification and validation.- Performance evaluation -- Control methods -- Modeling methodologies -- Model development and analysis -- Modeling and simulation.- Formal mehods.
Record Nr. UNISA-996466151703316
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui