We derive uniform asymptotic expressions of some Abel sums appearing in some problems in coding theory and indicate the usefulness of these sums in other fields, like empirical processes, machine maintenance, analysis of algorithms, probabilistic number theory, queuing models, etc.

There are various techniques for dealing with server saturation. Under duress, some variation of admission control is usually applied, including possibly refusing (aka “throttling”) all arrivals. As parallelism, threading, etc. become commonplace, alternative approaches to servicing heavy workloads are feasible. For a given stream of arriving requests, classical M/G/1 and M/G/infinity queuing m...

The performance of parallel discrete event models is highly dependent on lookahead, particularly when a conservative algorithm is employed. Unfortunately lookahead is known to be problem-dependant, which restricts the implementations of conservative algorithms. This paper uses a simple queuing network to show how this lookahead affects performance and discusses various techniques for automatic ...

This paper criticises the notion that long-range dependence is an important contributor to the queuing behaviour of real Internet traffic. The idea is questioned in two different ways. Firstly, a class of models used to simulate Internet traffic is shown to have important theoretical flaws. It is shown that this behaviour is inconsistent with the behaviour of real traffic traces. Secondly, the ...

Studies of queuing models with resequencing of jobs to keep the order at the output in the order of arrival are reviewed. A focus on recent authors results regarding optimal jobs assignment to heterogeneous servers is presented.

A queuing model is introduced for estimating container flow times through port terminals as a function of infrastructure, staffing, and import volume. The model is statistically calibrated on industry data. Flow-time estimates of the model are aggregated with estimates from models previously developed for rail networks to develop estimates of the total container flow times from West Coast ports...

This paper presents a set of simulation studies for comparing the performance of several flow-based scheduling algorithms, namely Weighted Fair Queuing, Self-Clock Fair Queuing, Start-Time Fair Queuing, Virtual Clock, Worst-case Fair Weighted Fair Queuing and Worstcase Fair Weighted Fair Queuing-plus. These algorithms are being considered for IP networks supporting Quality of Service (QoS).

This paper presents one of the features of DS (Differentiated Services) architecture, namely the queuing or congestion management. Packets can be placed into separate buffer queues, on the basis of the DS value. Several forwarding policies can be used to favor high priority packets in different ways. The major reason for queuing is that the router must hold the packet in its memory while the ou...