07670nam 2200709 450 991046607740332120200520144314.01-119-02214-2(CKB)3710000000852004(EBL)4678302(PQKBManifestationID)16429325(PQKBWorkID)14978806(PQKB)24865457(MiAaPQ)EBC4678302(DLC) 2016020734(CaSebORM)9781119022138(PPN)197542956(Au-PeEL)EBL4678302(CaPaEBR)ebr11263129(CaONFJC)MIL956163(OCoLC)958566431(EXLCZ)99371000000085200420160419h20162016 uy| 0engur|n|---|||||txtccrDelayed 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, Texas1st editionHoboken, New Jersey :John Wiley & Sons,[2016]©20161 online resource (417 p.)Description based upon print version of record.1-119-02213-4 Includes bibliographical references and index.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 Coefficients1.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 Queue4.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 Model5.5 Interrelationship between N-Policy M/G/1/K and F-Policy G/M/1/K Queues with Start-up TimePresents an introduction to differential equations, probability, and stochastic processes with real-world applications of queues with delay and delayed network queues Featuring recent advances in queueing theory and modeling, Delayed and Network Queues provides the most up-to-date theories in queueing model applications. Balancing both theoretical and practical applications of queueing theory, the book introduces queueing network models as tools to assist in the answering of questions on cost and performance that arise throughout the life of a computer system and signal processing. Written by well-known researchers in the field, the book presents key information for understanding the essential aspects of queues with delay and networks of queues with unreliable nodes and vacationing servers. Beginning with simple analytical fundamentals, the book contains a selection of realistic and advanced queueing models that address current deficiencies. In addition, the book presents the treatment of queues with delay and networks of queues, including possible breakdowns and disruptions that may cause delay. Delayed and Network Queues also features: Numerous examples and exercises with applications in various fields of study such as mathematical sciences, biomathematics, engineering, physics, business, health industry, and economics A wide array of practical applications of network queues and queueing systems, all of which are related to the appropriate stochastic processes Up-to-date topical coverage such as single- and multiserver queues with and without delays, along with the necessary fundamental coverage of probability and difference equations Discussions on queueing models such as single- and multiserver Markovian queues with balking, reneging, delay, feedback, splitting, and blocking, as well as their role in the treatment of networks of queues with and without delay and network reliability Delayed and Network Queues is an excellent textbook for upper-undergraduate and graduate-level courses in applied mathematics, queueing theory, queueing systems, probability, and stochastic processes. The book is also an ideal reference for academics and practitioners in mathematical sciences, biomathematics, operations research, management, engineering, physics, business, economics, health industry, and industrial engineering. Aliakbar Montazer Haghighi, PhD, is Professor and Head of the Department of Mathematics at Prairie View A&M University, USA, as well as ...Routing (Computer network management)MathematicsComputer networksMathematical modelsTelecommunicationTrafficQueuing networks (Data transmission)Electronic books.Routing (Computer network management)Mathematics.Computer networksMathematical models.TelecommunicationTraffic.Queuing networks (Data transmission)004.601/51982Haghighi Aliakbar Montazer891451Mishev D. P(Dimiter P.),MiAaPQMiAaPQMiAaPQBOOK9910466077403321Delayed and network queues2021331UNINA01130nam a2200277 i 450099100225940970753620020503163153.0010315s1961 it ||| | fre b10339024-39ule_instEXGIL100895ExLBiblioteca Interfacoltàita843.5Voltaire132570Contes et romans /texte établi et présenté par René PomeauFirenze :Sansoni,19613 v. ;17 cm.Les petits classique francaisPomeau, René.b1033902402-04-1427-06-02991002259409707536LE002 Fr. III N 50/IV. 112002000954251le002-E0.00-l- 00000.i1039803x27-06-02LE002 Fr. III N 50/IIV. 212002000954268le002-E0.00-l- 00000.i1039804127-06-02LE002 Fr. III N 50/IIIV. 312002000954275le002-E0.00-l- 00000.i1039805327-06-02Contes et romans199259UNISALENTOle00201-01-01ma -freit 0301317nam 2200421 450 991080937660332120230725031732.01-84888-029-410.1163/9781848880290(CKB)4920000000126955(nllekb)BRILL9781848880290(MiAaPQ)EBC6185714(EXLCZ)99492000000012695520200808d2010 uy 0engurun| uuuuatxtrdacontentcrdamediardacarrierState power and the legal regulation of evil /edited by Francesca DominelloFirst edition.Oxford, United Kingdom :Inter-Disciplinary Press,2010.1 online resourceAt The Interface90-04-40336-1 Includes bibliographical references.At the interface/probing the boundaries.Diversity and recognition.Criminal justice, Administration ofCriminal justice, Administration of.364.068Dominello FrancescaMiAaPQMiAaPQMiAaPQBOOK9910809376603321State power and the legal regulation of evil3930116UNINA