vix.ing · top · new · best · stats · spec

Design and Analysis of Queue Control Functions for Explicit Rate Switch Schemes

1998/09/22 by Bobby Vandalore, Vandalore, Bobby, Raj Jain +5
Business, Management and Accounting · Computer Science · #Advanced Queuing Theory Analysis #C.2.1 #FOS: Computer and information sciences #Networking and Internet Architecture (cs.NI) #Petri Nets in System Modeling #cs.NI

paper · pdf · doi:10.48550/arxiv.cs/9809041

Proceedings of IC3N'98, October 1998

arxiv created 1998/09/22 · openalex publication_date 1998/09/22 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The main goals of a switch scheme are high utilization, low queuing delay and fairness. To achieve high utilization the switch scheme can maintain non-zero (small) queues in steady state which can be used if the sources do not have data to send. Queue length (delay) can be controlled if part of the link capacity is used for draining queues in the event of queue build up. In most schemes a simple threshold function is used for queue control. Better control of the queue and hence delay can be achieved by using sophisticated queue control functions. It is very important to design and analyze such queue control functions. We study step, linear, hyperbolic and inverse hyperbolic queue control functions. Analytical explanation and simulation results consistent with analysis are presented. From the study, we conclude that inverse hyperbolic is the best control function and to reduce complexity the linear control function can be used since it performs satisfactorily in most cases.

Related