Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Core-Stateless Proportional Fair Queuing for AF Traffic Gang Cheng, Kai Xu, Ye Tian, and Nirwan Ansari
 

Summary: Core-Stateless Proportional Fair Queuing for AF Traffic
Gang Cheng, Kai Xu, Ye Tian, and Nirwan Ansari
Advanced Networking Laboratory, Department of Electrical and Computer Engineering,
New Jersey Institute of Technology, Newark, NJ 07102, USA
Abstract-- Proportional fair queuing is to ensure that a flow passing
through the network only consumes a fair share of the network resource
that is proportional to its committed rate or other service level agreement
(SLA). It is of great importance in differentiated services (DiffServ)
networks as well as other price incentive network services. In this paper,
we propose a simple core-stateless proportional fair queuing algorithm
(CSPFQ) for the assured forward (AF) traffic in DiffServ networks. We
first develop our algorithm based on a fluid model analysis and then
extend it to a realizable packet level algorithm. We prove analytically
and instantiate through simulations that our algorithm can achieve
proportional fair bandwidth allocation among competing flows without
requiring routers to estimate flows' fair share rates. Our simulation
results also demonstrate that our algorithm outperforms the weighted
core-stateless fair queuing (WCSFQ) in terms of proportional fairness.
I. INTRODUCTION
Since data traffic in the current Internet is inherently bursty, and

  

Source: Ansari, Nirwan - Department of Electrical and Computer Engineering, New Jersey Institute of Technology

 

Collections: Engineering