Stateless Fair Admission Control

Authors:
Jui-Pin Yang
Affiliations:
Department of Information Technology and Communication,Shih Chien University, Taiwan, R.O.C.
Venue:
Simulation
Year:
2011

Citing 10
Cited 1

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)
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
Core-stateless fair queueing: a scalable architecture to approximate fair bandwidth allocations in high-speed networks

IEEE/ACM Transactions on Networking (TON)
XCHOKE: Malicious Source Control for Congestion Avoidance at Internet Gateways

ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Understanding CHOKe: throughput and spatial characteristics

IEEE/ACM Transactions on Networking (TON)
A Probabilistic Approach for Achieving Fair Bandwidth Allocations in CSFQ

NCA '05 Proceedings of the Fourth IEEE International Symposium on Network Computing and Applications
Self-Configured Fair Queueing

Simulation

Modeling and design of a Session Initiation Protocol overload control algorithm

Simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The heavily loaded flows usually occupy more bandwidth than that of the lightly loaded flows under congested traffic conditions. Without effective bandwidth management mechanisms, malicious users may violate congestion control principles in order to get maximum bandwidth. Therefore, how to provide fair bandwidth sharing with low implementation complexity is a critical issue for high-speed networks. An active queue management mechanism, stateless fair admission control (SFAC), is proposed in this paper, which can provide good fairness on bandwidth allocation. Furthermore, the SFAC does not have to maintain per-flow state in each router. The main idea of the SFAC is that two admission thresholds can optimally change according to traffic variations. By comparing the admission thresholds with the hit number of each arrival packet, the SFAC is able to guarantee fair buffer occupancy for each flow. The SFAC employs a single first in, first out buffer, so that it can provide fair bandwidth sharing. In a word, the SFAC is completely stateless, so it possesses the great advantage of being easy to implement. Computer simulations concluded that the SFAC is capable of providing good fair bandwidth sharing under a range of traffic conditions.