“Bufferbloat” is the growth in buffer size that has led Internet delays to occasionally exceed the light propagation delay from the Earth to the Moon. Manufacturers have built in large buffers to prevent losses on Wi-Fi, cable and ADSL links. But the combination of some links’ limited bandwidth with TCP’s tendency to saturate that bandwidth results in excessive queuing delays. In response, new ...

It is not an easy task to write a book on queuing networks when a large number of books in the topic have already been published. The authors have written a very timely book on queuing networks which can be used by people working in the area of communication networks. The basics of stochastic process have been discussed in Chapter 1 with queuing networks being introduced in Chapter 2 where the ...

Despite the greater bandwidth available for home Internet users, network problems continue to surface with regard to the mix of network applications being run. The ease in which Internet sharing can be configured, coupled with the increase in the number of computers present in consumer residences, increase the likelihood that concurrent network applications will have to compete for access to a ...

This paper proposes different queuing scenarios to avoid dropping of handoff and new calls in a cellular phone network, which is essential when the network has certain restrictions on the available frequencies. This limitation degrades the performance of the system and more sites are required to achieve the desired capacity and coverage. However, this leads to a higher percentage of call drops ...

A novel Markov-chain model of RED is proposed by the authors in the article. The paper gives a detailed description of the model and some preliminary results for exponential and self-similar traffic. The Markov chain analysis results are verified by a simulation model. 1. The RED (Random Early Drop) active queuing management algorithm The majority of nowadays network technologies is based on tr...

We define a class of anticipating flows on Poisson space and compute its RadonNikodym derivative. This result is applied to statistical testing in an anticipating queuing problem. HYPOTHESIS TESTING; QUEUING THEORY; SKOROKHOD INTEGRAL; POINT PROCESSES AMS 1991 SUBJECT CLASSIFICATION: PRIMARY 62F03; 60H07 SECONDARY 60K25; 60J75

The paper explains the main idea of how the Estelle semantics may be reinterpreted within the queuing network model making possible a translation of Estelle into the algorithmic language of the Queuing Network Analysis Package (QNAP2). Such a translation gives access to all utilities of the package and enables the performance analysis to be integrated into the design process of Estelle specific...