Ms. Yangli Tu Profile

Yangli Tu

at Chongqing Univ of Posts and Telecommunications

SPIE Involvement:

Author

Publications (1)

This will count as one of your downloads.

You will have access to both the presentation and article (if available).

DOWNLOAD NOW

This content is available for download via your institution's subscription. To access this item, please sign in to your personal account.

Email or Username Forgot your username?

Password Forgot your password?

Show

Keep me signed in

No SPIE account? Create an account

Proceedings Article | 25 October 2005 Paper

A new GPS-based fairness algorithm for resilient packet ring

Yanli Tu, Zhizhong Zhang, Yunlin Zhang

Proceedings Volume 6011, 60110N (2005) https://doi.org/10.1117/12.631047

KEYWORDS: Global Positioning System, Control systems, Computer simulations, Algorithms, Local area networks, Curium, Surface plasmons, Statistical multiplexing, Standards development

Read Abstract +

Resilient packet ring (RPR), defined under IEEE 802.17, is a new kind of metropolitan area network technology. Fairness algorithm is one key technology of RPR. Presently, fairness algorithms found in RPR draft and related publications (e.g., DVSR algorithm) have some critical and common limitations, such as oscillation of the allocated bandwidth, high computation complexity or not get high bandwidth utilization. In this paper, we propose a new GPS-based algorithm, FBDRR algorithm, with a view to overcome these limitations. GPS is an ideal scheduling algorithm that can fairly allocate bandwidth to different flows and can also isolate vicious users. Its principle is that when downstream has high demand and make network congested and lost some frames, the low demand traffic from upstream node will has the same loss rate with the downstream one, and if one node does not constrain its stream to its fair share bandwidth, then it can use all of the bandwidth for C class if ring priority scheduling algorithm is used. We analyze the stability of this algorithm. Theoretical analysis and simulation results demonstrate that with this fairness algorithm, each node on the ring can remotely approximate the ideal fair rate for its own traffic at each downstream link, and there is no permanent oscillation, i.e., satisfied stability.

My Library

You currently do not have any folders to save your paper to! Create a new folder below.

Folder Name

Folder Description

View contact details

UPDATE YOUR PROFILE

Is this your profile? Update it now.

Sign into your SPIE.org account

Don’t have a profile and want one?

Create an account on SPIE.org

Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks. You are receiving this notice because your organization may not have SPIE eBooks access.*

*Shibboleth/Open Athens users─please sign in to access your institution's subscriptions.

To obtain this item, you may purchase the complete book in print or electronic format on SPIE.org.

ORGANIZATIONAL
Sign in with credentials provided by your organization.

Organizational Username

Organizational Password

Show/Hide Password

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members:

Non-members: ADD TO CART

Keywords/Phrases

Search In:

Publication Years