DOCSLIB.ORG

Queueing Networks 1 QUEUEING NETWORKS

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Queueing Networks 1 QUEUEING NETWORKS J. Virtamo 38.3143 Queueing Theory / Queueing networks 1 QUEUEING NETWORKS A network consisting of several interconnected queues Network of queues • Examples Customers go form one queue to another in post office, bank, supermarket etc • Data packets traverse a network moving from a queue in a router to the queue in another • router History Burke’s theorem, Burke (1957), Reich (1957) • Jackson (1957, 1963): open queueing networks, product form solution • Gordon and Newell (1967): closed queueing networks • Baskett, Chandy, Muntz, Palacios (1975): generalizations of the types of queues • Reiser and Lavenberg (1980, 1982): mean value analysis, MVA • J. Virtamo 38.3143 Queueing Theory / Queueing networks 2 Jackson’s queueing network (open queueing network) Jackson’s open queueing network consists of M nodes (queues) with the following assumptions: Node i is a FIFO queue • – unlimited number of waiting places (infinite queue) Service time in the queue obeys the distribution Exp(µ ) • i – in each queue, the service time of the customer is drawn independent of the service times in other queues – note: in a packet network the sending time of a packet, in reality, is the same in all queues (or differs by a constant factor, the inverse of the line speed) – this dependence, however, does not markedly affect the behaviour of the system (so called Kleinrock’s independence assumption) Upon departure from queue i, the customer chooses the next queue j randomly with the • probability qi,j or exits the network with the probability qi,d (probabilistic routing) – the model can be extended to cover the case of predetermined routes (route pinning) The network is open to arrivals from outside of the network (source) • – from the source s customers arrive as a Poisson stream with intensity λ – fraction qs,i of them enter queue i (intensity λqs,i) J. Virtamo 38.3143 Queueing Theory / Queueing networks 3 Node i in Jackson’s network lqs,i liq i,d Ni s = source, external l1..q1,i li li liq i,1 ..mi .. d = destination, sink lMqM,i liq i,M Exp(mi ) Ni = number of customers in queue i Without complications one could assume state dependent service rates µi = µi(Ni). This could describe e.g. multiserver nodes. To simplify the notation, we assume in the sequel a constant sevice rate µi. l1q1,d Jackson’s network lqs,1 lähdes l 1 m l 1 nielud l q The opnenness of the lqs,2 1 1,4 l l q network requires that 1 1,2 lqs,3 from each node there l4q4,1 l 3 l is at leas one path (= 2 6 m4 l2q2,d l4 0) to the sink d, i.e. m m 2 3 the probability that a l3q3,2 l q customer entering the 2 2,4 l q network will ultimately 3 3,4 exit the network is 1. J. Virtamo 38.3143 Queueing Theory / Queueing networks 4 Conservation of the flows Denote λi = average customer flow through node i. Although the external arrival streams to the nodes are Poissonian, there is no guarantee • that the flows inside the network were also Poissonian. In general, they are not. – except when there are no loops, i.e. a customer never re-enters a previously visited queue; then the Poisson property follows from Burke’s theorem. Stream λi is composed of the direct stream from the source and the split output streams from other nodes: M The conservation laws constitute a set of λi = λqs,i + λjqj,i i =1,...,M linear equations, from which the λi can be X j=1 solved. A similar equation holds for the destination d. Since the total M stream exiting the network must equal the stream entering the λ = λjqj,d jX=1 network, we have (qs,d = 0): Example λ1 = λ + qλ1 q λ λ1 = l m1 ⇒ 1 q l − 1 1-q Note. λ1 is not Poissonian although λ is. J. Virtamo 38.3143 Queueing Theory / Queueing networks 5 Jackson’s theorem The number of customers N in different nodes, i =1,...,M, are independent. • i Queue i behaves as if the arrival stream λ were Poissonian. • i State vector State probability The network state is determined by the vector N = (N ,...,N ). p(n) = P N = n 1 M { } Its possible values are denoted by n = (n1,...,nM ). Define p(n)=0, The network is in state n when N = n, i.e. N1 = n1,...,NM = nM . if some ni < 0 Jackson’s theorem M ni p(n)= p1(n1) pM (nM )= pi(ni) where pi(ni)=(1 ρi)ρi ρi = λi/µi ··· iY=1 − The network behaves as if it were composed of idependent M/M/1 queues. • The state probability is of the product form independence. • ⇔ If there are many customers in one of the nodes, this does not imply anything about the • number of customers in other nodes. ni If the service rate is state λi where pi(0) is determined by pi(ni)= pi(0) ni dependent µi(ni), then j=1 µi(j) the normalization condition. Q J. Virtamo 38.3143 Queueing Theory / Queueing networks 6 Proof of Jackson’s theorem n Denote ei = (0,..., 0, 1 , 0,..., 0). 2 component|{z} i Then, for instance p(n ei)= p(n1,...,ni 1,ni 1,ni+1,...,nM ) − − − Write the globabl balance condition for state n (one equation for each possible state n, n 0 i): i ≥ ∀ M M λ p(n)+ µi1ni>0 p(n) = λ qs,i p(n ei) iX=1 iX=1 − M n1 + qi,d µi p(n + ei) iX=1 M M + qj,i µj p(n + ej ei) iX=1 jX=1 − jonoon2saapuuasiakasulkopuolelta where the lhs represents the probability flow out jonosta2poistuuasiakasulkopuolelle of state n (in state n, any arrival or any departure jonoon1saapuuasiakasulkopuolelta causes a transition to another state) ant the rhs jonosta1poistuuasiakasulkopuolelle the flow to state n (cf. the transition diagram). asiakassiirtyyjonosta2jonoon1 asiakassiirtyyjonosta1jonoon2 Note. One could again allow state dependent service rates µi = µi(ni). J. Virtamo 38.3143 Queueing Theory / Queueing networks 7 Proof of Jackson’s theorem (continued) Rewrite the factor λqs,i in the first term on the rhs by means of the flow conservation equation: M λqs,i = λi λjqj,i. The equation becomes − jX=1 M M M M λ p(n)+ µi1ni>0 p(n) = λi p(n ei) λj qj,i p(n ei) iX=1 iX=1 − − iX=1 jX=1 − M + qi,d µi p(n + ei) iX=1 M M + qj,i µj p(n + ej ei) iX=1 jX=1 − We insert the product form solution of Jackson’s theorem as a trial and show that the equation indeed is satisfied. The following relations hold for the product form trial λ p(n e ) = µ 1 p(n) i i i ni>0 − λj p(n ei) = µj p(n ei + ej) − − λi p(n) = µi p(n + ei) Substitute these relations, in this order, into the first three terms on the rhs. J. Virtamo 38.3143 Queueing Theory / Queueing networks 8 Proof of Jackson’s theorem (continued) The equation takes now the form M M M M λ p(n)+ µi1ni>0 p(n) = µi 1ni>0 p(n) qj,i µj p(n + ej ei) iX=1 iX=1 − iX=1 jX=1 − M + qi,d λi p(n) iX=1 M M + qj,i µj p(n + ej ei) iX=1 jX=1 − The second term on the lhs and the first term on the rhs cancel; so do the second and fourth term on the rhs. What remains is M M λ p(n) = qi,d λi p(n)= p(n) qi,d λi iX=1 iX=1 M which is satisfied, because the streams into and out from the network are equal, λ = λiqi,d. iX=1 Thus we have shown that the product form solution stated in Jackson’s theorem indeed satisfy the global balance equations of the Markov process describing the network. J. Virtamo 38.3143 Queueing Theory / Queueing networks 9 Example l l λ 1 CPU 1 l (1-q)l λ1 = 1 λ1 = λ + λ2 m1 1 q − λ q λ2 = q λ1 ⇒ l2 l2=ql1 · λ2 = · 1 q I/O − m ρ1 = λ1/µ1, ρ2 = λ2/µ2 2 p(n ,n )=(1 ρ )ρn1(1 ρ )ρn2 1 2 − 1 1 − 2 2 Mean queue lengths ρ ρ ρ ρ N¯ = 1 , N¯ = 2 , N¯ = N¯ + N¯ = 1 + 2 1 1 ρ 2 1 ρ 1 1 1 ρ 1 ρ − 1 − 2 − 1 − 2 mean time in the system N¯ ρ ρ λ /µ λ /µ S S T¯ = = 1 + 2 = 1 1 + 2 2 = 1 + 2 λ λ(1 ρ ) λ(1 ρ ) λ(1 λ /µ ) λ(1 λ /µ ) 1 λS 1 λS − 1 − 2 − 1 1 − 2 2 − 1 − 2 Equivalent system miss¨a λ1 1 1 S1 = = averge CPU time I/O µ1λ 1 q · µ1 CPU − 1/S1 1/S2 λ2 q 1 S2 = = average I/O time µ2λ 1 q · µ2 − J. Virtamo 38.3143 Queueing Theory / Queueing networks 10 Mean results of Jackson’s networks Assume state independent service rates µi. Mean number of customers in node i Mean sojourn time in node i ¯ ρi N¯ 1 1 1 Ni = T¯ = i = = 1 ρi i λ 1 ρ µ µ λ − i − i i i − i Mean waiting time in node i 1 ρ 1 W¯ = T¯ = i i i − µ 1 ρ µ i − i i Mean time in the network of a customer entering node i ¯ ¯ M ¯ cf.
Load more

Recommended publications
  • The Queueing Network Analyzer
    THE BELL SYSTEM TECHNICAL JOURNAL Vol. 62, No.9, November 1983 Printed in U.S.A. The Queueing Network Analyzer By W. WHITT* (Manuscript received March 11, 1983) This paper describes the Queueing Network Analyzer (QNA), a software package developed at Bell Laboratories to calculate approximate congestion measures for a network of queues. The first version of QNA analyzes open networks of multiserver nodes with the first-come, first-served discipline and no capacity constraints. An important feature is that the external arrival processes need not be Poisson and the service-time distributions need not be exponential. Treating other kinds of variability is important. For example, with packet-switchedcommunication networks we need to describe the conges­ tion resulting from bursty traffic and the nearly constant service times of packets. The general approach in QNA is to approximately characterize the arrival processes by two or three parameters and then analyze the individual nodes separately. The first version of QNA uses two parameters to characterize the arrival processes and service times, one to describe the rate and the other to describe the variability. The nodes are then analyzed as standard GI/G/m queues partially characterized by the first two moments of the interarrival­ time and service-time distributions. Congestion measures for the network as a whole are obtained by assuming as an approximation that the nodes are stochastically independent given the approximate flow parameters. I. INTRODUCTION AND SUMMARY Networks of queues have proven to be useful models to analyze the performance of complex systems such as computers, switching ma­ chines, communications networks, and production job shOpS.1-7 To facilitate the analysis of these models, several software packages have * Bell Laboratories.
    [Show full text]
  • The MVA Priority Approximation
    The MVA Priority Approximation RAYMOND M. BRYANT and ANTHONY E. KRZESINSKI IBM Thomas J. Watson Research Center and M. SEETHA LAKSHMI and K. MANI CHANDY University of Texas at Austin A Mean Value Analysis (MVA) approximation is presented for computing the average performance measures of closed-, open-, and mixed-type multiclass queuing networks containing Preemptive Resume (PR) and nonpreemptive Head-Of-Line (HOL) priority service centers. The approximation has essentially the same storage and computational requirements as MVA, thus allowing computa- tionally efficient solutions of large priority queuing networks. The accuracy of the MVA approxima- tion is systematically investigated and presented. It is shown that the approximation can compute the average performance measures of priority networks to within an accuracy of 5 percent for a large range of network parameter values. Accuracy of the method is shown to be superior to that of Sevcik's shadow approximation. Categories and Subject Descriptors: D.4.4 [Operating Systems]: Communications Management-- network communication; D.4.8 [Operating Systems]: Performance--modeling and prediction; queuing theory General Terms: Performance, Theory Additional Key Words and Phrases: Approximate solutions, error analysis, mean value analysis, multiclass queuing networks, priority queuing networks, product form solutions 1. INTRODUCTION Multiclass queuing networks with product-form solutions [3] are widely used to model the performance of computer systems and computer communication net- works [11]. The effective application of these models is largely due to the efficient computational methods [5, 9, 13, 18, 21] that have been developed for the solution of product-form queuing networks. However, many interesting and significant system characteristics cannot be modeled by product-form networks.
    [Show full text]
  • Product-Form in Queueing Networks
    Product-form in queueing networks VRIJE UNIVERSITEIT Product-form in queueing networks ACADEMISCH PROEFSCHRIFT ter verkrijging van de graad van doctor aan de Vrije Universiteit te Amsterdam, op gezag van de rector magnificus dr. C. Datema, hoogleraar aan de faculteit der letteren, in het openbaar te verdedigen ten overstaan van de promotiecommissie van de faculteit der economische wetenschappen en econometrie op donderdag 21 mei 1992 te 15.30 uur in het hoofdgebouw van de universiteit, De Boelelaan 1105 door Richardus Johannes Boucherie geboren te Oost- en West-Souburg Thesis Publishers Amsterdam 1992 Promotoren: prof.dr. N.M. van Dijk prof.dr. H.C. Tijms Referenten: prof.dr. A. Hordijk prof.dr. P. Whittle Preface This monograph studies product-form distributions for queueing networks. The celebrated product-form distribution is a closed-form expression, that is an analytical formula, for the queue-length distribution at the stations of a queueing network. Based on this product-form distribution various so- lution techniques for queueing networks can be derived. For example, ag- gregation and decomposition results for product-form queueing networks yield Norton's theorem for queueing networks, and the arrival theorem implies the validity of mean value analysis for product-form queueing net- works. This monograph aims to characterize the class of queueing net- works that possess a product-form queue-length distribution. To this end, the transient behaviour of the queue-length distribution is discussed in Chapters 3 and 4, then in Chapters 5, 6 and 7 the equilibrium behaviour of the queue-length distribution is studied under the assumption that in each transition a single customer is allowed to route among the stations only, and finally, in Chapters 8, 9 and 10 the assumption that a single cus- tomer is allowed to route in a transition only is relaxed to allow customers to route in batches.
    [Show full text]
  • Introduction to Queueing Theory Review on Poisson Process
    Contents ELL 785–Computer Communication Networks Motivations Lecture 3 Discrete-time Markov processes Introduction to Queueing theory Review on Poisson process Continuous-time Markov processes Queueing systems 3-1 3-2 Circuit switching networks - I Circuit switching networks - II Traffic fluctuates as calls initiated & terminated Fluctuation in Trunk Occupancy Telephone calls come and go • Number of busy trunks People activity follow patterns: Mid-morning & mid-afternoon at All trunks busy, new call requests blocked • office, Evening at home, Summer vacation, etc. Outlier Days are extra busy (Mother’s Day, Christmas, ...), • disasters & other events cause surges in traffic Providing resources so Call requests always met is too expensive 1 active • Call requests met most of the time cost-effective 2 active • 3 active Switches concentrate traffic onto shared trunks: blocking of requests 4 active active will occur from time to time 5 active Trunk number Trunk 6 active active 7 active active Many Fewer lines trunks – minimize the number of trunks subject to a blocking probability 3-3 3-4 Packet switching networks - I Packet switching networks - II Statistical multiplexing Fluctuations in Packets in the System Dedicated lines involve not waiting for other users, but lines are • used inefficiently when user traffic is bursty (a) Dedicated lines A1 A2 Shared lines concentrate packets into shared line; packets buffered • (delayed) when line is not immediately available B1 B2 C1 C2 (a) Dedicated lines A1 A2 B1 B2 (b) Shared line A1 C1 B1 A2 B2 C2 C1 C2 A (b)
    [Show full text]
  • EUROPEAN CONFERENCE on QUEUEING THEORY 2016 Urtzi Ayesta, Marko Boon, Balakrishna Prabhu, Rhonda Righter, Maaike Verloop
    EUROPEAN CONFERENCE ON QUEUEING THEORY 2016 Urtzi Ayesta, Marko Boon, Balakrishna Prabhu, Rhonda Righter, Maaike Verloop To cite this version: Urtzi Ayesta, Marko Boon, Balakrishna Prabhu, Rhonda Righter, Maaike Verloop. EUROPEAN CONFERENCE ON QUEUEING THEORY 2016. Jul 2016, Toulouse, France. 72p, 2016. hal- 01368218 HAL Id: hal-01368218 https://hal.archives-ouvertes.fr/hal-01368218 Submitted on 19 Sep 2016 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. EUROPEAN CONFERENCE ON QUEUEING THEORY 2016 Toulouse July 18 – 20, 2016 Booklet edited by Urtzi Ayesta LAAS-CNRS, France Marko Boon Eindhoven University of Technology, The Netherlands‘ Balakrishna Prabhu LAAS-CNRS, France Rhonda Righter UC Berkeley, USA Maaike Verloop IRIT-CNRS, France 2 Contents 1 Welcome Address 4 2 Organization 5 3 Sponsors 7 4 Program at a Glance 8 5 Plenaries 11 6 Takács Award 13 7 Social Events 15 8 Sessions 16 9 Abstracts 24 10 Author Index 71 3 1 Welcome Address Dear Participant, It is our pleasure to welcome you to the second edition of the European Conference on Queueing Theory (ECQT) to be held from the 18th to the 20th of July 2016 at the engineering school ENSEEIHT in Toulouse.
    [Show full text]
  • Queueing Theory
    Queueing theory Agner Krarup Erlang, a Danish engineer who worked for the Copenhagen Telephone Exchange, published the first paper on what would now be called queueing theory in 1909.[8][9][10] He modeled the number of telephone calls arriving at an exchange by a Poisson process and solved the M/D/1 queue in 1917 and M/D/k queueing model in 1920.[11] In Kendall’s notation: • M stands for Markov or memoryless and means ar- rivals occur according to a Poisson process • D stands for deterministic and means jobs arriving at the queue require a fixed amount of service • k describes the number of servers at the queueing node (k = 1, 2,...). If there are more jobs at the node than there are servers then jobs will queue and wait for service Queue networks are systems in which single queues are connected The M/M/1 queue is a simple model where a single server by a routing network. In this image servers are represented by serves jobs that arrive according to a Poisson process and circles, queues by a series of retangles and the routing network have exponentially distributed service requirements. In by arrows. In the study of queue networks one typically tries to an M/G/1 queue the G stands for general and indicates obtain the equilibrium distribution of the network, although in an arbitrary probability distribution. The M/G/1 model many applications the study of the transient state is fundamental. was solved by Felix Pollaczek in 1930,[12] a solution later recast in probabilistic terms by Aleksandr Khinchin and Queueing theory is the mathematical study of waiting now known as the Pollaczek–Khinchine formula.[11] lines, or queues.[1] In queueing theory a model is con- structed so that queue lengths and waiting time can be After World War II queueing theory became an area of [11] predicted.[1] Queueing theory is generally considered a research interest to mathematicians.
    [Show full text]
  • Delay Models in Data Networks
    3 Delay Models in Data Networks 3.1 INTRODUCTION One of the most important perfonnance measures of a data network is the average delay required to deliver a packet from origin to destination. Furthennore, delay considerations strongly influence the choice and perfonnance of network algorithms, such as routing and flow control. For these reasons, it is important to understand the nature and mechanism of delay, and the manner in which it depends on the characteristics of the network. Queueing theory is the primary methodological framework for analyzing network delay. Its use often requires simplifying assumptions since, unfortunately, more real- istic assumptions make meaningful analysis extremely difficult. For this reason, it is sometimes impossible to obtain accurate quantitative delay predictions on the basis of queueing models. Nevertheless, these models often provide a basis for adequate delay approximations, as well as valuable qualitative results and worthwhile insights. In what follows, we will mostly focus on packet delay within the communication subnet (i.e., the network layer). This delay is the sum of delays on each subnet link traversed by the packet. Each link delay in tum consists of four components. 149 150 Delay Models in Data Networks Chap. 3 1. The processinR delay between the time the packet is correctly received at the head node of the link and the time the packet is assigned to an outgoing link queue for transmission. (In some systems, we must add to this delay some additional processing time at the DLC and physical layers.) 2. The queueinR delay between the time the packet is assigned to a queue for trans- mission and the time it starts being transmitted.
    [Show full text]
  • Matrix Geometric Approach for Random Walks
    Matrix geometric approach for random walks Citation for published version (APA): Kapodistria, S., & Palmowski, Z. B. (2017). Matrix geometric approach for random walks: stability condition and equilibrium distribution. Stochastic Models, 33(4), 572-597. https://doi.org/10.1080/15326349.2017.1359096 Document license: CC BY-NC-ND DOI: 10.1080/15326349.2017.1359096 Document status and date: Published: 02/10/2017 Document Version: Publisher’s PDF, also known as Version of Record (includes final page, issue and volume numbers) Please check the document version of this publication: • A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal.
    [Show full text]
  • Improving Queuing System Throughput Using Distributed Mean Value Analysis to Control Network Congestion
    Communications and Network, 2015, 7, 21-29 Published Online February 2015 in SciRes. http://www.scirp.org/journal/cn http://dx.doi.org/10.4236/cn.2015.71003 Improving Queuing System Throughput Using Distributed Mean Value Analysis to Control Network Congestion Faisal Shahzad1, Muhammad Faheem Mushtaq1, Saleem Ullah1*, M. Abubakar Siddique2, Shahzada Khurram1, Najia Saher1 1Department of Computer Science & IT, The Islamia University of Bahawalpur, Bahawalpur, Pakistan 2College of Computer Science, Chongqing University, Chongqing, China Email: [email protected], [email protected], *[email protected], [email protected], [email protected], [email protected] Received 12 June 2014; accepted 30 January 2015; published 2 February 2015 Copyright © 2015 by authors and Scientific Research Publishing Inc. This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/ Abstract In this paper, we have used the distributed mean value analysis (DMVA) technique with the help of random observe property (ROP) and palm probabilities to improve the network queuing system throughput. In such networks, where finding the complete communication path from source to destination, especially when these nodes are not in the same region while sending data between two nodes. So, an algorithm is developed for single and multi-server centers which give more in- teresting and successful results. The network is designed by a closed queuing network model and we will use mean value analysis to determine the network throughput (β) for its different values. For certain chosen values of parameters involved in this model, we found that the maximum net- work throughput for β ≥ 0.7 remains consistent in a single server case, while in multi-server case for β ≥ 0.5 throughput surpass the Marko chain queuing system.
    [Show full text]
  • BUSF 40901-1/CMSC 34901-1: Stochastic Performance Modeling Winter 2014
    BUSF 40901-1/CMSC 34901-1: Stochastic Performance Modeling Winter 2014 Syllabus (January 15, 2014) Instructor: Varun Gupta Office: 331 Harper Center e-mail: [email protected] Phone: 773-702-7315 Office hours: by appointment Class Times: Wed, Fri { 10:10-11:30 am { Harper Center (3A) Final Exam (tentative): March 21, Friday { 8:00-11:00am { Harper Center (3A) Course Website: http://chalk.uchicago.edu Course Objectives This is an introductory course in queueing theory and performance modeling, with applications including but not limited to service operations (healthcare, call centers) and computer system resource management (from datacenter to kernel level). The aim of the course is two-fold: 1. Build insights into best practices for designing service systems (How many service stations should I provision? What speed? How should I separate/prioritize customers based on their service requirements?) 2. Build a basic toolbox for analyzing queueing systems in particular and stochastic processes in general. Tentative list of topics: Open/closed queueing networks; Operational laws; M=M=1 queue; Burke's theorem and reversibility; M=M=k queue; M=G=1 queue; G=M=1 queue; P h=P h=k queues and their solution using matrix-analytic methods; Arrival theorem and Mean Value Analysis; Analysis of scheduling policies (e.g., Last-Come-First Served; Processor Sharing); Jackson network and the BCMP theorem (product form networks); Asymptotic analysis (M=M=k queue in heavy/light traf- fic, Supermarket model in mean-field regime) Prerequisites Exposure to undergraduate probability (random variables, discrete and continuous probability dis- tributions, discrete time Markov chains) and calculus is required.
    [Show full text]
  • Queueing Networks and Insensitivity
    Jackson networks EL System QR Queues QR Networks The Arrival Theorem Queueing Networks and Insensitivity Luk´aˇsAdam 29. 10. 2012 Queueing Networks and Insensitivity 1 / 40 Jackson networks EL System QR Queues QR Networks The Arrival Theorem Table of contents 1 Jackson networks 2 Insensitivity in Erlang's Loss System 3 Quasi-Reversibility and Single-Node Symmetric Queues 4 Quasi-Reversibility in Networks 5 The Arrival Theorem Queueing Networks and Insensitivity 2 / 40 Jackson networks EL System QR Queues QR Networks The Arrival Theorem Reminder Birth{death process M/M/1 One type of customer One node Queueing Networks and Insensitivity 3 / 40 Jackson networks EL System QR Queues QR Networks The Arrival Theorem Jackson networks Series of K nodes, not necessarily linear. Arrivals from external sources are independent Poisson processes with intensities α1; : : : ; αK . A customer having completed service at node k goes to node l with probability γkl and leaves the system with probability γk0. A single exponential server at each node with corresponding service rates δ1; : : : ; δK . Queueing Networks and Insensitivity 4 / 40 Jackson networks EL System QR Queues QR Networks The Arrival Theorem Closed and open networks Closed network No external inflow of outflow of customers. The number of customers in the network is constant. αk = 0, γk0 = 0. Open network Opposite to closed network. At least one external inflow αk is nonzero. At least one probability of external outflow γk0 is nonzero. Queueing Networks and Insensitivity 5 / 40 Jackson networks EL System QR Queues QR Networks The Arrival Theorem Examples Queueing Networks and Insensitivity 6 / 40 Jackson networks EL System QR Queues QR Networks The Arrival Theorem Some propositions Proposition Any ergodic birth-death process is time reversible.
    [Show full text]
  • Inferring Queueing Network Models from High-Precision Location Tracking Data
    University of London Imperial College of Science, Technology and Medicine Department of Computing Inferring Queueing Network Models from High-precision Location Tracking Data Tzu-Ching Horng Submitted in part fulfilment of the requirements for the degree of Doctor of Philosophy in Computing of the University of London and the Diploma of Imperial College, May 2013 Abstract Stochastic performance models are widely used to analyse the performance and reliability of systems that involve the flow and processing of customers. However, traditional methods of constructing a performance model are typically manual, time-consuming, intrusive and labour- intensive. The limited amount and low quality of manually-collected data often lead to an inaccurate picture of customer flows and poor estimates of model parameters. Driven by ad- vances in wireless sensor technologies, recent real-time location systems (RTLSs) enable the automatic, continuous and unintrusive collection of high-precision location tracking data, in both indoor and outdoor environment. This high-quality data provides an ideal basis for the construction of high-fidelity performance models. This thesis presents a four-stage data processing pipeline which takes as input high-precision location tracking data and automatically constructs a queueing network performance model approximating the underlying system. The first two stages transform raw location traces into high-level “event logs” recording when and for how long a customer entity requests service from a server entity. The third stage infers the customer flow structure and extracts samples of time delays involved in the system; including service time, customer interarrival time and customer travelling time. The fourth stage parameterises the service process and customer arrival process of the final output queueing network model.
    [Show full text]