Virtual spacing for flexible traffic control

1 January 1994

journal article
research article
Published by Wiley in International Journal of Communication Systems

Vol. 7 (4) , 307-318
https://doi.org/10.1002/dac.4500070407

Abstract

Weighted fair queuing emerges as an elegant and effective solution to the problem of integrating real time services with strict delay constraints and high‐speed data services for which significant delays cannot always be avoided. Virtual spacing is a weighted fair queuing scheduling algorithm intended to be applied in the context of the ATM based BISDN. After discussing how virtual spacing allows flexible traffic control for a variety of service types, we discuss the issue of its implementation in switching nodes. The aim of the paper is to highlight the advantages of weighted fair queuing in enabling a truly integrated services network and to propose a technologically feasible implementation.

Keywords

This publication has 13 references indexed in Scilit:

On the self-similar nature of Ethernet traffic
Published by Association for Computing Machinery (ACM) ,1993
Methodologies for bandwidth allocation, transmission scheduling, and congestion avoidance in broadband ATM networks
Computer Networks and ISDN Systems, 1993
Variable-bit-rate traffic control in B-ISDN
IEEE Communications Magazine, 1991
Effective bandwidths at multi-class queues
Queueing Systems, 1991
A calculus for network delay. I. Network elements in isolation
IEEE Transactions on Information Theory, 1991
Duration-limited statistical multiplexing of delay-sensitive traffic in packet networks
Published by Institute of Electrical and Electronics Engineers (IEEE) ,1991
A simulation study of fair queueing and policy enforcement
ACM SIGCOMM Computer Communication Review, 1990
Virtual clock: a new traffic control algorithm for packet switching networks
Published by Association for Computing Machinery (ACM) ,1990
Analysis and simulation of a fair queueing algorithm
Published by Association for Computing Machinery (ACM) ,1989
On Packet Switches with Infinite Storage
IEEE Transactions on Communications, 1987