Buffer management for lossless service in shared buffer switches

Authors:
Deng Pan;Yuanyuan Yang
Affiliations:
School of Computing & Information Sciences, Florida International University, Miami, FL 33199, USA;Department of Electrical & Computer Engineering, State University of New York, Stony Brook, NY 11794, USA
Venue:
Journal of Parallel and Distributed Computing
Year:
2009

Citing 18
Cited 0

Analysis and simulation of a fair queueing algorithm

SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
Random early detection gateways for congestion avoidance

IEEE/ACM Transactions on Networking (TON)
High performance TCP in ANSNET

ACM SIGCOMM Computer Communication Review
Efficient fair queueing using deficit round-robin

IEEE/ACM Transactions on Networking (TON)
Dynamics of random early detection

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Scalable QoS provision through buffer management

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Computer Networking: A Top-Down Approach Featuring the Internet

Computer Networking: A Top-Down Approach Featuring the Internet
On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms

Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Sizing router buffers

Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Part I: buffer sizes for core routers

ACM SIGCOMM Computer Communication Review
FIFO-Based Multicast Scheduling Algorithm for Virtual Output Queued Packet Switches

IEEE Transactions on Computers
Fair Round-Robin: A Low Complexity Packet Schduler with Proportional and Worst-Case Fairness

IEEE Transactions on Computers
WF2Q: worst-case fair weighted fair queueing

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Maintaining high throughput during overload in ATM switches

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Overview of ITU-T NGN QoS Control

IEEE Communications Magazine
Dynamics of TCP traffic over ATM networks

IEEE Journal on Selected Areas in Communications
A service architecture for ATM: from applications to scheduling

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Fair scheduling and buffer management are two typical approaches to provide differentiated service. Fair scheduling algorithms usually need to keep a separate queue and maintain associated state variables for each incoming flow, which makes them difficult to operate and scale. On the contrary, buffer management (in conjunction with FIFO scheduling) needs only a constant amount of state information and processing, and can be efficiently implemented. In this paper, we consider using buffer management to provide lossless service for guaranteed performance flows in shared buffer switches. We study the buffer size requirement and buffer allocation strategies by starting with the single output switch and then extending the analytical results to the general multiple output switch. We present a universally applicable buffer allocation method for assuring lossless service, and validate the correctness of the theoretical results through simulations.