Approximate flow-aware networking

Authors:
Jerzy Domzal;Andrzej Jajszczyk
Affiliations:
Department of Telecommunications, AGH University of Science and Technology, Krakow, Poland;Department of Telecommunications, AGH University of Science and Technology, Krakow, Poland
Venue:
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Year:
2009

Citing 4
Cited 1

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)
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks

IEEE/ACM Transactions on Networking (TON)
Approximate Fair Dropping for Variable-Length Packets

IEEE Micro

Flow Oriented Approaches to QoS Assurance

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new variation of the Flow-Aware Networking (FAN) concept is presented in the paper. The proposed solution is based on the Approximate Fair Dropping algorithm and called by us Approximate Flow-Aware Networking (AFAN). The simplicity of the new proposal is assured as a result of using only two FIFO queues for the scheduled packets. The impact of congestion control mechanisms proposed for Flow-Aware Networks on packet transmission in the overloaded network for the AFAN is also presented. The analysis shows how to choose the values of the parameters which decide of proper transmission characteristics of the network. The results of the research are compared with those obtained for the other two FAN architectures, with the PFQ (Priority Fair Queuing) and with the PDRR (Priority Deficit Round Robin) scheduling algorithms. The advantages and weaknesses of the new proposal are described and analyzed.