By Topic

WMRPS - a novel framework for wireless packet fair queuing algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Pham Viet Ha ; Dept. of Comput. Sci. & Eng., Pohang Univ. of Sci. & Technol., South Korea ; Young-Joo Suh

The presence of location-dependent and burst errors in wireless networks introduces difficulties in developing packet fair queuing (PFQ) algorithms for wireless networks. We introduce a new theoretical model to build PFQ algorithms for both wired and wireless networks and an algorithm to approximate the proposed model. The proposed model has some advantages in its application to wireless networks: self-detection of the session state and self-compensation. The proposed algorithm provides all expected characteristics of wireless PFQ: short-term fairness to error-free flows and long-term fairness to error-bounded flows; short-term throughput bounds to error-free flows and long-term throughput bounds to error-bounded flows; delay bounds to error-free flows; graceful service compensation and degradation. The algorithm is called WMRPS, wireless modified rate proportional server, based on the rate proportional server of D. Stiliadis and A. Varma (see IEEE/ACM Trans. on Networking, vol.6, no.2, 1998).

Published in:

Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE  (Volume:2 )

Date of Conference:

17-21 Nov. 2002