Approximate Flow-Aware Networking

Author

Domzal, Jerzy ; Jajszczyk, Andrzej

Author_Institution

Dept. of Telecommun., AGH Univ. of Sci. & Technol., Krakow, Poland

fYear

2009

fDate

14-18 June 2009

Firstpage

1

Lastpage

6

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.

Keywords

queueing theory; scheduling; telecommunication congestion control; FAN architecture; FIFO queues; approximate fair dropping; approximate flow-aware networking; congestion control; flow-aware networks; overloaded network; packet transmission; priority deficit round robin scheduling; priority fair queuing; scheduled packets; transmission characteristics; Admission control; Bandwidth; Communications Society; Intrusion detection; Proposals; Quality of service; Round robin; Scheduling algorithm; Traffic control; Web and internet services;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, 2009. ICC '09. IEEE International Conference on

Conference_Location

Dresden

ISSN

1938-1883

Print_ISBN

978-1-4244-3435-0

Electronic_ISBN

1938-1883

Type

conf

DOI

10.1109/ICC.2009.5198757

Filename

5198757