A Router Architecture for Real-Time Communication in Multicomputer Networks
IEEE Transactions on Computers
Optimizing static calendar queues
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Enhanced Weighted Round Robin Schedulers for Bandwidth Guarantees in Packet Networks
QoS-IP '01 Proceedings of the International Workshop on Quality of Service in Multiservice IP Networks
Queue Management in Network Processors
Proceedings of the conference on Design, Automation and Test in Europe - Volume 3
Performance analysis of greedy shapers in real-time systems
Proceedings of the conference on Design, automation and test in Europe: Proceedings
WF2Q-M: Worst-case fair weighted fair queueing with maximum rate control
Computer Networks: The International Journal of Computer and Telecommunications Networking
A versatile timing unit for traffic shaping, policing and charging in packet-switched networks
Journal of Systems Architecture: the EUROMICRO Journal
Mathematical remarks on token bucket
SoftCOM'09 Proceedings of the 17th international conference on Software, Telecommunications and Computer Networks
Evaluation of multi-point to single-point service traffic shaping in an enterprise network
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
On the use of greedy shapers in real-time embedded systems
ACM Transactions on Embedded Computing Systems (TECS)
| Hi-index | 0.08 |
Emerging broad-band switches must accommodate the diverse traffic parameters and quality-of-service requirements of voice, data, and video applications. End-to-end performance guarantees depend on connections complying with traffic contracts as their cells travel through the network. This paper presents a leaky-bucket shaper architecture that scales to a large number of connections with diverse burstiness and bandwidth parameters. In contrast to existing designs, the proposed architecture arbitrates fairly between connections with conforming cells by carefully integrating leaky-bucket traffic shaping with rate-based scheduling algorithms. Through a careful combination of per-connection queueing and approximate sorting, the shaper performs a small, bounded number of operations in response to each arrival and departure, independent of the number of connections and cells. When the shaper must handle a wide range of rate parameters, a hierarchical arbitration scheme can reduce the implementation overheads and further limit interference between competing connections. Through simulation experiments, we demonstrate that the architecture limits cell-shaping delay and traffic distortions, even in periods of heavy congestion. The efficient combination of traffic shaping and link scheduling results in an effective architecture for managing buffer and bandwidth resources in large, high-speed ATM switches