|
| Â Â |
| Â | Queueing delay |
 | | Queueing delay is a term in computer engineering. | | | 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. |
|
http://www.freeglossary.com/Queueing_delay
|
|
| Â Â |
| Â | RFC 2212 (rfc2212) - Specification of Guaranteed Quality of Service |
| | Furthermore, to compute the maximum delay a datagram will experience, the latency of the path MUST be determined and added to the guaranteed queueing delay. | | | If the composition function is applied along the entire path to compute the end-to-end sums of C and D (Ctot and Dtot) and the resulting values are then provided to the end nodes (by presumably the setup protocol), the end nodes can compute the maximal datagram queueing delays. | | | Delay values that are not dependent on the rate SHOULD be incorporated into the value for the D parameter. |
|
http://www.faqs.org/rfcs/rfc2212.html
|
|
| Â Â |
| Â | jin-wei-low-tcp-fast-01.txt |
| | Window Control Algorithm Without explicit feedback from routers, only two kinds of signals are available for congestion control: queueing delay and packet loss. | | | At the time when a packet is acknowledged, the implementation should compare the current time and the time-stamp in the copy in the retransmission queue, and compute the RTT sample as the difference between the two values. | | | It may also incur estimation errors in a dynamic sharing environment where the minimum observed RTT of a new FAST TCP flow may include queueing delay produced by packets of existing flows. |
|
http://ietfreport.isoc.org/idref/draft-jin-wei-low-tcp-fast
|
|
| Â Â |
| Â | Eytan Modiano's Publications |
| | Eytan Modiano, Jeffrey Wieselthier and Anthony Ephremides, "An Approach for the Analysis of Packet Delay in an Integrated Mobile Radio Network," Proc. | | | "Tradeoffs in Delay Guarantees and Computation Complexity for N x N Packet Switches," Conference on Information Science and System, Princeton, NJ, March, 2002. | | | Michael Neely and Eytan Modiano, "Convexity and Optimal Loadings in Work Conserving */*/1 Queues," IEEE Transactions on Information Theory, to appear, 2005. |
|
http://web.mit.edu/modiano/www/pub.htm
|
|
| Â Â |
| Â | Queueing theory |
| | Queueing theory is directly applicable to intelligent transportation systems, call centers, PABXs, network telecommunications, server queueing, mainframe computer queueing of telecommunications terminals, and advanced telecommunications systems. | | | Set home page · Bookmark site · Add search | | | Queueing theory (spelled queuing theory in the US) is the mathematical study of waiting lines (or queues). |
|
http://www.sciencedaily.com/encyclopedia/queueing_theory
|
|
| Â Â |
| Â | Queueing Theory Basics |
| | A good understanding of the relationship between congestion and delay is essential for designing effective congestion control algorithms. | | | This delay depends on the error rate on the link and the protocol used for retransmissions. | | | This delay depends on the load on the communication link. |
|
http://www.eventhelix.com/RealtimeMantra/CongestionControl/queueing_theory.htm
|
|
| Â Â |
| Â | [No title] |
| | Figure 14: Delay distribution versus test flow position, aggregate intensity In Figure 15, the tail distribution of the delay experienced by the packets of test flow when located at both extremes are plotted against that of the packets of test flow when the aggregate flow is fed into a stand-alone router. | | | Figure 15: Delay distribution, tandem versus stand-alone, aggregate intensity As the curves indicate, when the test flow is located furthest from the egress router, the performance is inferior to that of stand- alone router. | | | We note that the variation in transmission Mercankosk Informational - Jan 2001 10 Virtual Wire - Analysis & Extensions July 2000 time can be incorporated into the earlier analysis as a modification on the propagation delay without any effect on the queueing delay. |
|
http://www.ee.uwa.edu.au/~guven/vwpdb.txt
|
|
| Â Â |
| Â | Publications of Sabine Wittevrongel |
| | S. Exact calculation of buffer-contents variance and delay jitter in a discrete-time queue with correlated input traffic, Electronics Letters, 1996, vol. | | | S. Analytic study of the queueing performance and the departure process of a leaky bucket with bursty input traffic, AEÜ (International Journal of Electronics and Communications), 1996, vol. | | | V. Rate adapters with bursty arrivals and rational rate reduction: queueing analysis, Presentation at the IFIP WG 7.3 Conference on Modeling and Performance Evaluation of Computer Systems and Networks, PERFORMANCE '99 (Istanbul, 15-17 October 1999). |
|
http://heloise.rug.ac.be/~sw/papers.html
|
|
| Â Â |
| Â | Queueing Delay Guarantees in Bandwidth Packing (ResearchIndex) |
| | An efficient Lagrangean relaxation based heuristic procedure for finding bounds and solutions to the problem is demonstrated, and computational results from... | | | Abstract: This paper proposes a new formulation for the bandwidth packing problem, assuring maximum service delay in telecommunications networks. | | | 36 Communications nets: stochastic message flow and delay (context) - Kleinrock - 1964 |
|
http://citeseer.ist.psu.edu/517080.html
|
|
| Â Â |
| Â | Rate-Controlled Static-Priority Queueing - Zhang, Ferrari (ResearchIndex) |
| | Previously proposed solutions are based on either a time-framing strategy, or a sorted priority queue mechanism. | | | Time-framing schemes suffer from the dependencies that they introduce between the queueing delay and the granularity of bandwidth allocation; sorted... | | | 770 Analysis and simulation of a fair queueing algorithm (context) - Demers, Keshav et al. |
|
http://citeseer.ist.psu.edu/zhang93ratecontrolled.html
|
|
| Â Â |
| Â | Simple, classless Queueing Disciplines |
| | SFQ is called 'Stochastic' because it doesn't really allocate a queue for each session, it has an algorithm which divides traffic over a limited number of queues using a hashing algorithm. | | | For example, 15 stands for a packet wanting Minimal Monetary Cost, Maximum Reliability, Maximum Throughput AND Minimum Delay. | | | In this case each incoming packet has its matching token and passes the queue without delay.
; |
|
http://www.lartc.org/howto/lartc.qdisc.classless.html
|
|
| Â Â |
| Â | 5.3.1.1 Sending Strategy |
| | The strategy may be further modified as a result of multiple addresses per host (see Section 5.3.4), to optimize delivery time vs. resource usage. | | | A sender SHOULD keep a list of hosts it cannot reach and corresponding timeouts, rather than just retrying queued mail items. | | | In a typical system, the program that composes a message has some method for requesting immediate attention for a new piece of outgoing mail, while mail that cannot be transmitted immediately MUST be queued and periodically retried by the sender. |
|
http://www.freesoft.org/CIE/RFC/1123/107.htm
|
|
| Â Â |
| Â | Enterprise Voice over Data Design |
| | When surveying an existing data network to determine if it can support IP telephony, all switches that do not support ________________ should be upgraded. | | | Which of the following is considered variable delay? | | | Which of the following H.323 components opens a logical channel? |
|
http://www.ralieghjones.com/evodd_practice.htm
|
|
| Â Â |
| Â | Publications by the Algorithms Project |
| | - Asymptotic average access delay analysis: adaptive p-persistence versus tree algorithm. | | | - Framing protocols on upstream channel in CATV networks: asymptotic average delay analysis. | | | Coffman (E. G.), Gilbert (E. N.), Greenberg (A. G.), Leighton (F. Robert (P.), and Stolyar (A. Queues served by a rotating ring. |
|
http://algo.inria.fr/papers/bibgen/algobib.html
|
|
| Â Â |
| Â | Jason Yi-Bing Lin |
| | Lin, Y.-B. Parallel Trace-Driven Simulation of G/D/1/K Queue: A Study for Packet Loss in Finite-Buffered Voice Multiplexers, Parallel Computing, 19:219-228, 1993. | | | Lin, Y.-B., Mohan, S., and Noerpel, A. Analyzing Queueing Priority Channel Assignment Strategies for Hand-off and Initial Access for a a PCS Network. | | | Chan, W.C. and Lin, Y.-B., The Waiting Time Distribution for the $M/M/m$ Queue. |
|
http://liny.csie.nctu.edu.tw/
|
|
| Â Â |
| Â | ITTC - Publications Index |
| | Charalambous P. Charalambous, Georgios Y. Lazarou, Victor S. Frost, Joseph Evans, Roelof Jonkman; 1998 IEEE International Conference on Communications, Vol. | | | Performance Evaluation of TCP Extensions on ATM over High Bandwidth Delay Product Networks, |
|
http://www.ittc.ku.edu/publications/index.phtml
|
|
| Â Â |
| Â | Re: Queueing Delay measurement |
| | You can use tcpdump and then analyse your results with tcptrace. | | | > Is there any document, which provides the exact procedure for measuring the > queuing delay?. | | | On Wed, 7 Feb 2001, Karthikeyan Nathillvar wrote: > hi > I am working on RSVP on Linux. |
|
http://www.atm.tut.fi/list-archive/linux-diffserv/msg01517.html
|
|
| Â Â |
| Â | Queueing Delay |
| | Long queueing delays could be caused by lame hardware (switches/routers) |
|
http://www.upenn.edu/computing/group/sug/presentation/feb02/net-perf/sld024.htm
|
|
| Â Â |
| Â | Queueing delay (revisited) |
| | La/R > 1: more “work” arriving than can be serviced, average delay infinite! |
|
http://www.cs.umd.edu/~shankar/417-F01/Slides/chapter1a-aus/sld027.htm
|
|
| Â Â |
| Â | The Performance Analysis of SIP-T Signaling System in Carrier Class VoIP Network |
| | First, we assume a mathematical model of the M/G/1 queue with non-preemptive priority assignment to represent SIP-T signaling system. | | | Besides, some numerical examples of queueing size, queueing delay, and delay variation are presented as well. | | | In this paper, we analyze the queueing size (i.e. |
|
http://csdl.computer.org/comp/proceedings/aina/2003/1906/00/19060039abs.htm
|
|
| Â Â |
| Â | [ns] Hlep:Queueing Delay |
| | There are several sources connect to one node,some destinations connect to the other node. | | | Dear ns users, Hello, I have a question about queuing delay between two nodes(bottle neck link). | | | My question is "is there any methord to calculate the queuing delay on the bottle neck link?" Thanks. |
|
http://mailman.isi.edu/pipermail/ns-users/2000-April/008359.html
|
|
| Â Â |
| Â | Little's Formula and Queueing Delay |
| | Let T = time spent by a customer in a queueing system (waiting and being served). | | | Little's Formula holds for very general queueing systems (not just M/M/1). | | | When it arrives to the queueing system, it should find |
|
http://networks.ecse.rpi.edu/~vastola/pslinks/perf/node46.html
|
|
| Â Â |
| Â | Queueing Delay |
| | RED reduces mean delay, but also add jitter | | | For small weight and high offered load, estimated average queue size slowly oscillate around max_thresh |
|
http://www.cs.bu.edu/faculty/matta/Teaching/cs835/S00/Slides/analysis-red/sld006.htm
|
|
| Â Â |
| Â | Linux LARTC -- [LARTC] measuring queueing delay using iproute2 |
| | You could calculate the effective class bandwidth and multiply that by the average qlength, but that would be pretty indirect. | | | Right now the actual delay is not measured by the kernel, so I don't see how you would get at it. | | | I have a > requirement to determine the queueing delay of each > packet belonging to a particular class so that i can > measure the average queueing delay over a time > interval for a particular traffic class. |
|
http://www.spinics.net/lists/lartc/msg00491.html
|
|
| Â Â |
| Â | queueing delay from virtual IP |
| | We think this problem is associated with DNS and we installed "bind" on the same server. | | | queueing delay from virtual IP queueing delay from virtual IP This message | | | But when clients from inside the firewall (who use virtual IP) send email, the emails gets stuck in the queue for hours before being sent. |
|
http://www.cm.nu/~shane/lists/comp.mail.sendmail/2000-11/1054.html
|
|
|
