DOCSLIB.ORG

Queueing Theory

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

Outline • Mean value analysis for Jackson networks – Arrival theorem • Cyclic network • Extension of Jackson networks • BCMP network • More than classical queueing theory Li Xia, Tsinghua Univ. 1 Mean value analysis • Two methods to analyze closed Jackson network – Buzen’s algorithm to compute G(N) and distribution – Mean value analysis to recursively compute the average performance metrics; also can recursively compute marginal distribution • Mean value analysis, proposed by 1. Reiser, M.; Lavenberg, S. S. (1980). "Mean-Value Analysis of Closed Multichain Queuing Networks". Journal of the ACM 27(2): 313-322. (IBM Zurich research, IBM Watson research) 2. Sevcik, K. C.; Mitrani, I. (1981). "The Distribution of Queuing Network States at Input and Output Instants". Journal of the ACM 28 (2): 358-371. Li Xia, Tsinghua Univ. 2 Arrival theorem • Arrival theorem – A general case of PASTA theorem – Also called random observer property (ROP) or job observer property – “upon arrival at a station, a job observes the system as if in steady state at an arbitrary instant for the system without that job” Li Xia, Tsinghua Univ. 3 Arrival theorem • Applicability condition – always hold in open product-form networks with unbounded queues at each node (not Poisson arrival) – may not hold for some networks • Cyclic queue with M=2 and N=2, D/D/1, μ=1 and each server starts with 1 job, # of jobs seen by job 1 is 0, not equals 0.5 – for Poisson arrival, PASTA Theorem – for open Jackson network • q(n)=p(n) – for closed Jackson network • qi(N,n-i)=p(N-1,n-i), the statistics seen by an arrival customer is equal to that of the steady network with one customer less. Li Xia, Tsinghua Univ. 4 Mean value analysis • Based on two basic principles – Arrival theorem (PASTA or ROP for Jackson networks) – Little’s law • For closed Jackson network – qn (N)=pn(N-1), queue length seen by arrival equals that of the network with one less customer – Little’s law is applicable throughout the network Li Xia, Tsinghua Univ. 5 Mean value analysis • With Arrival theorem – Wi(N) = [1+Li(N-1)]/μi (also valid for M/M/1 or M/M/c) • Wi(N): mean response time at node i for a network with N customers • Li(N-1): average number of customers at node i for a network with N-1 customers • With Little’s law – Li(N) =λi(N)Wi(N) • λi(N): throughput (arrival rate) of node i in an N- customer network, which is unknown Li Xia, Tsinghua Univ. 6 Calculation of λi(n) • Calculate visit ratio vi by traffic equations M Add one more equation: v v r, for all i1,..., M i j ji v1+v2+…+vM = 1 j1 – vi is the relative throughput of node i n • Calculate λ(n): ()n M vW() n i1 ii • Throughput of node i: λi(n)=λ(n)vi Li Xia, Tsinghua Univ. 7 Algorithm of mean value analysis • Solve traffic equations to obtain vi, i=1,2,…,M • Initialize Li(0)=0, i=1,2,…,M • For n=1:N, calculate – Wi(n) = [1+Li(n-1)]/μi – λ(n)=n/[v1W1(n)+…+vMWM(n)] – λi(n)= λ(n) vi, i=1,2,…,M – Li(n) =λi(n)Wi(n), i=1,2,…,M Li Xia, Tsinghua Univ. 8 Discussion of mean value analysis • Calculate the average metrics easily – Average queue length, mean waiting time, mean response time – Also calculate the marginal distribution recursively • Recursive algorithm – Complexity is linear to the system size • For multiclass networks – Also applicable, but complexity grows exponentially with the number of classes Li Xia, Tsinghua Univ. 9 Example • Similar to Example 4.5 in page 203 of Gross’ book (machine repair problem) – Closed Jackson network with M=3, N=2 – Exception: all the nodes are single-server – Service rate: μ1=2, μ2=1, μ3=3 – Routing prob.: r12=3/4, r13=1/4, r21=2/3, r23=1/3, r31=1 Li Xia, Tsinghua Univ. 10 Example (cont.) 2 v v v • Visit rate equation set: 13 2 3 3 vv Let v1=1, solve the equation 214 11 v =3/4, v =1/2 v3 v 1 v 2 2 3 43 • State space: (M+N-1) choose N, it is 6 (0,0,2), (0,1,1), (0,2,0), (1,0,1), (1,1,0), (2,0,0) • Buzen’s algorithm to compute G(N), then compute the steady state distribution π = … Li Xia, Tsinghua Univ. 11 Example (cont.) • MVA method – For n=1: • W1(1)=[1+L1(0)]/μ1=1/2; W2(1)=1; W3(1)=1/3 • λ(1)=1/[1*1/2+3/4*1+1/2*1/3]=12/17 • λ1(1)= λ(1)v1=12/17; λ2(1)=9/17; λ3(1)=6/17 • L1(1)= λ1(1)W1(1)=6/17; L2(1)=9/17; L3(1)=2/17 – For n=2: • W1(2)=[1+L1(1)]/μ1=23/34; W2(2)=26/17; W3(2)=19/51 • λ(2)=2/[1*23/34+3/4*26/17+1/2*19/51]=204/205 • λ1(2)= λ(2)v1=204/205; λ2(2)=153/205; λ3(2)=102/205 • L1(2)= λ1(2)W1(2)=138/205; L2(2)=234/205; L3(2)=38/205 Li Xia, Tsinghua Univ. 12 Thinking of closed Jackson network • Relation of parameters – Arrival rate (throughput) λ v.s. service rates μ • μ increases, λ increases – Arrival rate λ v.s. number of customers N • N increases, λ increases with a upper bound • MVA for marginal distribution – Recursive formula, similar to M/M/1 pi(n,N)=λi(N)/μi*pi(n-1,N-1) Given marginal distribution Compute steady state distribution by Jackson theorem, as if independent , multiply … Li Xia, Tsinghua Univ. 13 Cyclic network • A special case of closed Jackson network – rij=1, if j=i+1 and 0<i<M; rM1=1; otherwise rij=0 μ1 μ5 μ2 μ4 μ3 Li Xia, Tsinghua Univ. 14 Cyclic network • Product-form solution of steady state distribution – Traffic equation is special, vi+1=vi, so set all vi=1 – ρi= vi/μi=1/ μi 11n12 n nM pnM12 n n n 12 M GNGN()()12 M 1 GN() where n12 n nM n1 ... nM N 12 M Li Xia, Tsinghua Univ. 15 Extension of Jackson networks • Load-dependent arrival rate and service rate – Similar results, product form solution • Consider travel time between nodes – Model the travel time as extra nodes with ample servers, still keep the form of Jackson networks • Multiclass Jackson network – Each class has its own routing structure, arrival rates and service rates – Applicable for computer, communication systems – BCMP network, still have product-form solution Li Xia, Tsinghua Univ. 16 Non-Jackson network • Many variants from Jackson networks • State-dependent routing probability – Customer has flexibility to decide its next stop • E.g., choose the node with less congestion – Even exponential interarrival and service time, no product-form solution – Use Markov model to do analysis, but suffer from “curse of dimensionality” • Product-form solution avoids this curse of computation • Storage is a curse if need to store every state distribution – Avoid to store every distribution, use iterative calculation, e.g., for all s: L=L+n*p(s), only one iterative variable L Li Xia, Tsinghua Univ. 17 BCMP network • BCMP network definition – M servers, K classes of customers – 4 kinds of service disciplines • FCFS, PS, IS(infinite servers, or ample servers), LCFS with preemptive-resume – Class transition • class k customer from server i transits to server j as class r, with probability qij,kr – Service time distribution • FCFS: IID exponential for all classes; • PS, IS, LCFS: any COX distribution (including exponential) Li Xia, Tsinghua Univ. 18 BCMP network • Steady state distribution of BMCP network has a product-form solution – Handle each server independently and multiply them together – Calculate the normalization constant, • Does exist similar algorithm to Buzen’s? – Scalability, avoid the curse of dimensionality • Applicable to large-scale problems Li Xia, Tsinghua Univ. 19 More than classical queueing theory • Heavy tail traffic • Phase-Type (PH) distribution • Matrix Analytic Method (MAM) Li Xia, Tsinghua Univ. 20 Heavy tail traffic • Assumption – Service time is exponentially distributed – Or: job size is exponentially distributed • In practice, especially in computer system – Job size is not exponentially distributed – Heavy tail, high variance, decreasing failure rate Li Xia, Tsinghua Univ. 21 Heavy tail traffic • Data Measure is important (ACM SIGMETRICS) – Collect the job size in computer system P{jobsize >x} 1 heavy tail exponential 1/2 1/4 1/8 x 1 2 4 8 16 32 Looks like an exponential distribution, F() x ex But actually it is not, 1st moment, 2nd moment, … Li Xia, Tsinghua Univ. 22 Pareto distribution • If we use log-log plot P{jobsize >x} 1 Pareto 1/2 1/4 1/8 Exponential 1/16 x 1 2 4 8 16 32 This fits well a Pareto distribution: F( x ) x , x 1, 0 2 [0.8,1.2] Li Xia, Tsinghua Univ. 23 Pareto distribution • Property of Pareto distribution – Decreasing failure rate f() x x 1 r( x ) , x 1 Fx() xx • The older a job is, the longer it will take CPU time in future – Infinite or near infinite variance • If α≤1: E[x]=∞, E[xn]=∞, E[x|x>a]=∞ • If α>1: E[x]<∞, E[xn]=∞, E[x|x>a]<∞ – Heavy-tail property • 1% largest job comprise 90% system load • More biased than the 80-20 rule (Pareto principle) Li Xia, Tsinghua Univ. 24 Pareto distribution • Also known as Power-law distribution – Hot concept: power-law; small-world – Widely exist in practice, almost everywhere! • Most of the resources/contributions belongs to a few people/units • In business, 80-20 rule • In computer network, heavy-tail traffic Win a lot of awards, top paper, nature/sci.
Recommended publications
  • Slides As Printed

    Slides As Printed

    Computer Systems Modelling Ian Leslie Notes by Dr R.J. Gibbens (minor edits by Ian Leslie) Computer Laboratory University of Cambridge Computer Science Tripos, Part II Lent Term 2016/17 CSM 2016/17 (1) Course overview 12 lectures covering: ◮ Introduction to modelling: ◮ what is it and why is it useful? ◮ Simulation techniques: ◮ random number generation, ◮ Monte Carlo simulation techniques, ◮ statistical analysis of results from simulation and measurements; ◮ Queueing theory: ◮ applications of Markov Chains, ◮ single/multiple servers, ◮ queues with finite/infinite buffers, ◮ queueing networks. CSM 2016/17 (2) Recommended books Ross, S.M. Probability Models for Computer Science Academic Press, 2002 Mitzenmacher, M & Upfal, E. Probability and computing: randomized algorithms and probabilistic analysis Cambridge University Press, 2005 Jain, A.R. The Art of Computer Systems Performance Analysis Wiley, 1991 Kleinrock, L. Queueing Systems — Volume 1: Theory Wiley, 1975 CSM 2016/17 (3) Introduction to modelling CSM 2016/17 (4) Why model? ◮ A manufacturer may have a range of compatible systems with different characteristics — which configuration would be best for a particular application? ◮ A system is performing poorly — what should be done to improve it? Which problems should be tackled first? ◮ Fundamental design decisions may affect performance of a system. A model can be used as part of the design process to avoid bad decisions and to help quantify a cost/benefit analysis. CSM 2016/17 (5) A simple queueing system arrival queue server departure ◮
  • The Queueing Network Analyzer

    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.
  • The MVA Priority Approximation

    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.
  • M/M/C Queue with Two Priority Classes

    M/M/C Queue with Two Priority Classes

    Submitted to Operations Research manuscript (Please, provide the mansucript number!) M=M=c Queue with Two Priority Classes Jianfu Wang Nanyang Business School, Nanyang Technological University, [email protected] Opher Baron Rotman School of Management, University of Toronto, [email protected] Alan Scheller-Wolf Tepper School of Business, Carnegie Mellon University, [email protected] This paper provides the first exact analysis of a preemptive M=M=c queue with two priority classes having different service rates. To perform our analysis, we introduce a new technique to reduce the 2-dimensionally (2D) infinite Markov Chain (MC), representing the two class state space, into a 1-dimensionally (1D) infinite MC, from which the Generating Function (GF) of the number of low-priority jobs can be derived in closed form. (The high-priority jobs form a simple M=M=c system, and are thus easy to solve.) We demonstrate our methodology for the c = 1; 2 cases; when c > 2, the closed-form expression of the GF becomes cumbersome. We thus develop an exact algorithm to calculate the moments of the number of low-priority jobs for any c ≥ 2. Numerical examples demonstrate the accuracy of our algorithm, and generate insights on: (i) the relative effect of improving the service rate of either priority class on the mean sojourn time of low-priority jobs; (ii) the performance of a system having many slow servers compared with one having fewer fast servers; and (iii) the validity of the square root staffing rule in maintaining a fixed service level for the low priority class.
  • Product-Form in Queueing Networks

    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.
  • A Simple, Practical Prioritization Scheme for a Job Shop Processing Multiple Job Types

    A Simple, Practical Prioritization Scheme for a Job Shop Processing Multiple Job Types

    University of Tennessee, Knoxville TRACE: Tennessee Research and Creative Exchange Doctoral Dissertations Graduate School 8-2013 A Simple, Practical Prioritization Scheme for a Job Shop Processing Multiple Job Types Shuping Zhang [email protected] Follow this and additional works at: https://trace.tennessee.edu/utk_graddiss Part of the Management Sciences and Quantitative Methods Commons Recommended Citation Zhang, Shuping, "A Simple, Practical Prioritization Scheme for a Job Shop Processing Multiple Job Types. " PhD diss., University of Tennessee, 2013. https://trace.tennessee.edu/utk_graddiss/2503 This Dissertation is brought to you for free and open access by the Graduate School at TRACE: Tennessee Research and Creative Exchange. It has been accepted for inclusion in Doctoral Dissertations by an authorized administrator of TRACE: Tennessee Research and Creative Exchange. For more information, please contact [email protected]. To the Graduate Council: I am submitting herewith a dissertation written by Shuping Zhang entitled "A Simple, Practical Prioritization Scheme for a Job Shop Processing Multiple Job Types." I have examined the final electronic copy of this dissertation for form and content and recommend that it be accepted in partial fulfillment of the equirr ements for the degree of Doctor of Philosophy, with a major in Management Science. Mandyam M. Srinivasan, Melissa Bowers, Major Professor We have read this dissertation and recommend its acceptance: Ken Gilbert, Theodore P. Stank Accepted for the Council: Carolyn R. Hodges Vice Provost and Dean of the Graduate School (Original signatures are on file with official studentecor r ds.) A Simple, Practical Prioritization Scheme for a Job Shop Processing Multiple Job Types A Dissertation Presented for the Doctor of Philosophy Degree The University of Tennessee, Knoxville Shuping Zhang August 2013 Copyright © 2013 by Shuping Zhang All rights reserved.
  • (Thesis Proposal) Takayuki Osogami

    (Thesis Proposal) Takayuki Osogami

    Resource Allocation Solutions for Reducing Delay in Distributed Computing Systems (Thesis Proposal) Takayuki Osogami Department of Computer Science Carnegie Mellon University [email protected] April, 2004 Committee members: Mor Harchol-Balter (Chair) Hui Zhang Bruce Maggs Alan Scheller-Wolf (Tepper School of Business) Mark Squillante (IBM Research) 1 Introduction Waiting time (delay) is a source of frustration for users who receive service via computer or communication systems. This frustration can result in lost revenue, e.g., when a customer leaves a commercial web site to shop at a competitor's site. One obvious way to decrease delay is simply to buy (more expensive) faster machines. However, we can also decrease delay for free with given resources by making more efficient use of resources and by better scheduling jobs (i.e., by changing the order of jobs to be processed). For single server systems, it is well understood how to minimize mean delay, namely by the shortest remaining processing time first (SRPT) scheduling policy. SRPT can provide mean delay an order of magnitude smaller than a naive first come first serve (FCFS) scheduling policy. Also, the mean delay under various scheduling policies, including SRPT and FCFS, can be easily analyzed for a relatively broad class of single server systems (M/GI/1 queues). However, utilizing the full potential computing power of multiserver systems and analyzing their performance are much harder problems than for the case of a single server system. Despite the ubiquity of multiserver systems, it is not known how we should assign jobs to servers and how we should schedule jobs within each server to minimize the mean delay in multiserver systems.
  • Introduction to Queueing Theory Review on Poisson Process

    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)
  • 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

    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.
  • Queueing Theory

    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.
  • Delay Models in Data Networks

    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.
  • Matrix Geometric Approach for Random Walks

    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.