We describe an eecient fair queuing scheme, Leap Forward Virtual Clock, that provides end-to-end delay bounds similar to WFQ, along with throughput fairness. Our scheme can be implemented with a worst-case time O(loglog N) per packet (inclusive of sorting costs), which improves upon all previously known schemes that guarantee delay and throughput fairness similar to WFQ. Interestingly, both the...

Input queuing has become dominant and popular building blocks for high speed crossbar switches with many ports and fast line rates because they require minimum speed-up of memory bandwidth. Input Queued switches with finite Virtual Output Queues guarantees QoS performance in terms of throughput and average delay. A switch performs two functions Queuing and Scheduling. Queue Management algorithm...

number: 025-0093 Abstract Title: Virtual Queuing at Airport Security Lanes Author 1: Robert de Lange; MyDivvi, Amsterdam, The Netherlands; [email protected] Author 2 Ilya Samoilovich; Capgemini, Utrecht, The Netherlands; [email protected] Author 3 (Corresponding Author): Bo van der Rhee; Center for Marketing & Supply Chain Management at the Nyenrode Business University; Straatwe...

Virtual Output Queuing is widely used by fixed-length highspeed switches to overcome head-of-line blocking. This is done by means of matching algorithms. Maximum matching algorithms have good performance, but their implementation complexity is quite high. Maximal matching algorithms need speedup to guarantee good performance. Iterative algorithms (such as PIM and iSLIP) use multiple iterations ...

Available bandwidth is an important factor that can be used to adapt the sending rate to network conditions, so that packet loss, caused by congestion, can be significantly reduced before error control mechanisms are employed. To this end, we propose an active probing-based queuing delay propagation model (QDPM)-based scheme for available bandwidth estimation. Common assumptions, including use ...

DWEKAT, ZYAD A. Practical Fair Queuing Schedulers: Simplification through Quantization. (Under the direction of Dr. George Rouskas and Dr. Mladen Vouk). Many packet scheduling schemes have been proposed, but most of them suffer from one of two extremes. A scheduling scheme may have simple implementation with low fairness qualities, or it may have good fairness qualities but high complexity. Our...

Dwekat, Zyad A. Practical Fair Queuing Schedulers: Simplification through Quantization. (Under the direction of Dr. George Rouskas and Dr. Mladen Vouk). Many packet scheduling schemes have been proposed, but most of them suffer from one of two extremes. A scheduling scheme may have simple implementation with low fairness qualities, or it may have good fairness qualities but high complexity. Our...

This paper proposes an innovative concept, called virtual output queue, to support available bit rate (ABR) traffic on an input-buffered, per virtual circuit (VC) queued switch. This technique allows ABR models developed for output-buffered systems to be migrated to an inputbuffered system. In order to evaluate the virtual output queue and to compare different ABR algorithms, a simulator of the...

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 ...

In this paper, we proposed a new multistage virtual shared memory model for cluster based parallel systems. This model can be expanded in hierarchical manner and covered many of the previous clusters of parallel system designs. Queuing theory and Jackson queuing networks are applied for constructing an analytical model. This model gives a closed-form solution for the system performance metrics,...