Queueing delay

Queueing delay

In computer engineering, a queueing delay is the time a job waits in a queue until it can be executed.

This term is most often used in reference to routers. When packets arrive at a router, they have to be processed and transmitted. A router can only process one packet at a time. If packets arrive faster than the router can process them (such as in a burst transmission) the router puts them into the queue (also called the buffer) until it can get around to transmitting them.

The maximum queuing delay is proportional to buffer size. The longer the line of packets waiting to be transmitted, the longer the average waiting time is. However, this is much preferable to a shorter buffer, which would result in ignored ("dropped") packets, which in turn would result in much longer overall transmission times.

The M/M/1/K queuing model, where K is the size of the buffer, may be used to analyze the queuing delay in a specific system. Check [http://streaming.stat.iastate.edu/~stat330/notes/day30.pdf] .

References

ee also

*Queueing theory
* [ [http://streaming.stat.iastate.edu/~stat330/notes/day30.pdf] **LINK IS BROKEN**]


Wikimedia Foundation. 2010.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

  • Queueing theory — is the mathematical study of waiting lines (or s ). The theory enables mathematical analysis of several related processes, including arriving at the (back of the) queue, waiting in the queue (essentially a storage process), and being served by… …   Wikipedia

  • Queueing model — In queueing theory, a queueing model is used to approximate a real queueing situation or system, so the queueing behaviour can be analysed mathematically. Queueing models allow a number of useful steady state performance measures to be determined …   Wikipedia

  • Network congestion — In data networking and queueing theory, network congestion occurs when a link or node is carrying so much data that its quality of service deteriorates. Typical effects include queueing delay, packet loss or the blocking of new connections. A… …   Wikipedia

  • Compound TCP — (CTCP) is a Microsoft algorithm that was introduced as part of the Windows Vista and Window Server 2008 TCP stack. It is designed to aggressively adjust the sender s congestion window to optimise TCP for connections with large bandwidth delay… …   Wikipedia

  • FAST TCP — is a new TCP congestion avoidance algorithm especially targeted at high speed, long distance links, developed at the [http://netlab.caltech.edu/ Netlab] , California Institute of Technology and now being commercialized by [http://www.fastsoft.com …   Wikipedia

  • List of mathematics articles (Q) — NOTOC Q Q analog Q analysis Q derivative Q difference polynomial Q exponential Q factor Q Pochhammer symbol Q Q plot Q statistic Q systems Q test Q theta function Q Vandermonde identity Q.E.D. QED project QR algorithm QR decomposition Quadratic… …   Wikipedia

  • Taxonomy of congestion control — refers to grouping congestion control algorithms according to their characteristics.Example classificationThe following is one possible classification according to the following properties: #The type and amount of feedback received from the… …   Wikipedia

  • Congestion control — This article concerns telecommunications traffic. For road traffic, see traffic congestion. Congestion control concerns controlling traffic entry into a telecommunications network, so as to avoid congestive collapse by attempting to avoid… …   Wikipedia

  • QD — abbr. Queueing Delay comp. abbr. Querty/Dvorak acronym Quaque Die (daily) (Medicine) …   United dictionary of abbreviations and acronyms

  • Neil J. Gunther — Neil James Gunther Neil Gunther at Bletchley Park 2002 A quantum leap is neither Born …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”