NDLI: An algorithm for computing the mean response time of a single server queue with generalized on/off traffic arrivals

Please wait, while we are loading the content...

DiST: a simple, reliable and scalable method to significantly reduce processor architecture simulation time

Queueing systems with long-range dependent input process and subexponential service times

A hybrid systems modeling framework for fast and accurate simulation of data communication networks

Resilient multicast using overlays

Internet intrusions: global characteristics and prevalence

Run-time modeling and estimation of operating system power consumption

A recursive random search algorithm for large-scale network parameter configuration

Analysis of LAS scheduling for job size distributions with high variance

Estimating membership in a multicast session

Data cache locking for higher program predictability

Analysis of TCP's computational energy cost for mobile computing

A framework for modeling and optimization of prescient instruction prefetch

An algorithm for computing the mean response time of a single server queue with generalized on/off traffic arrivals

Modeling the throughput of TCP Vegas

Incrementally improving lookup latency in distributed hash table systems

Conductance and congestion in power law graphs

Effects of clock resolution on the scheduling of interactive and soft real-time processes

Fast accurate computation of large-scale IP traffic matrices from link loads

Fairness and efficiency in web server protocols

Efficient implementation of a statistics counter architecture

Effect of node size on the performance of cache-conscious $B^{+}-trees$

Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms

Modeling, simulation and measurements of queuing delay under long-tail internet traffic

Maximum and asymptotic UDP throughput under CHOKe

Measuring the effects of internet path faults on reactive routing

Analysis of cycle stealing with switching cost

Classifying scheduling policies with respect to unfairness in an M/GI/1

Dynamic resource allocation for shared data centers using online measurements

Fluid models and solutions for large-scale IP networks

A self-tuning structure for adaptation in TCP/AQM networks

Characterizing and measuring path diversity of internet topologies

CacheCOW: providing QoS for storage system caches

Characterization of essential dynamic instructions

On the effectiveness of movement prediction to reduce energy consumption in wireless communication

Robustness of multicast congestion control to inflated subscription

Choosing an accurate network path model

An empirical evaluation of wide-area internet bottlenecks

Using SimPoint for accurate and efficient simulation

Spectroscopy of DNS update traffic

Gated asymptotic modEls (GAMEs): a new tool for the stability analysis of queueing systems

Priority queueing with finite buffer size and randomized push-out mechanism

Performance of estimated traffic matrices in traffic engineering

An algorithm for computing the mean response time of a single server queue with generalized on/off traffic arrivals

Content Provider	ACM Digital Library
Author	Galmés, Sebastià Puigjaner, Ramon
Abstract	In this paper, an exact solution for the response time distribution of a single server, infinite capacity, discrete-time queue is presented. This queue is fed by a flexible discrete-time arrival process, which follows an on/off evolution. A workload variable is associated with each arrival instant, which may correspond to the service demand generated by a single arrival, or represent the number of simultaneous arrivals (bulk arrivals). Accordingly, the analysis focuses on two types of queues: (On/Off)/G/1 and (Batch-On/Off)/D/1. For both cases, a decomposition approach is carried out, which divides the problem into two contributions: the response time experienced by single bursts in isolation, and the increase on the response time caused by the unfinished work that propagates from burst to burst. Particularly, the solution for the unfinished work is derived from a Wiener-Hopf factorization of random walks, which was already used in the analysis of discrete GI/G/1 queues. Compared to other related works, the procedure proposed in this paper is exact, valid for any traffic intensity and has no constraints on the distributions of the input random variables characterizing the process: duration of on and off periods, and workload. From the general solution, an efficient and robust iterative algorithm for computing the expected response time of both queues is developed, which can provide results at any desired precision. This algorithm is numerically evaluated for different types of input distributions and proved against simulation.
Starting Page	37
Ending Page	46
Page Count	10
File Format	PDF
ISBN	1581136641
DOI	10.1145/781027.781033
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2003-06-11
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Markov chain Queuing model Response time Arrival process Steady-state
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in