Fair Queueing in ATM Networks a Simulation Study.pdfVIP

Fair Queueing in ATM Networks: A Simulation Study M.Ajmone Marsan, C.Casetti, M.Munafo, J.Valdes Dipartimento di Elettronica, Politecnico di Torino, 10129 Torino, Italy Abstract The issue of trac control in A TM networks is of the utmost importance in the light of the heterogeneity of the trac they carry. Each class of users is to be guar anteed a quality of servic e nominal ly dierent fr om what the other classes get. In other words, scheduling mechanisms are to be devised so as to minimize interference among trac ows having dier ent quality of service requirements. Fair Queueing (FQ { also known as Packet-b y-packet Generalized Processor Sharing) is recognise d as one of the most promis- ing scheduling mechanisms for A TM networks: its go al is to fairly pr ovide connections with a bandwidth pr oportional to the shar e of link capacity they are entitled to. In doing this, F Q tries to emulate bit-per-bit round-robin scheduling, while weighing the amount of bandwidth for each connection so as to obtain dierent service classes. This technique was studied in a simple network sc enario using CLASS, a software package for the simulation of A TM networks. Numerical results wil l be pr esented showing how eectively the F Q technique succeeds in preventing interference among classes of users with dierent quality of servic e requirements. In addition to that, some strategies for selective discard of cel ls in the event of buer over ow wil l be discussed and quantitativel y compared. 1 Intro duction As the new generation of broadband networks is rapidly overshadowing slower communi- cation systems, the attention has shifted from