A share-controlled packet fair queueing algorithm for IntServ EPON

Junni Zou; Sunjuan Xun; Rujian Lin

doi:10.1117/12.634129

5 December 2005 A share-controlled packet fair queueing algorithm for IntServ EPON

Junni Zou, Sunjuan Xun, Rujian Lin

Proceedings Volume 6022, Network Architectures, Management, and Applications III; 60223C (2005) https://doi.org/10.1117/12.634129
Event: Asia-Pacific Optical Communications, 2005, Shanghai, China

Abstract

A share-controlled PFQ algorithm is proposed for IntServ EPON. It divides packet scheduling into high-priority phase and low-priority phase. In the high-priority phase, an improved PFQ algorithm is presented, which introduces a new constraint and a control factor into the scheduling discipline to overcome bandwidth preemption and to freely distribute excess bandwidth. Computer simulation results show that both the reserved services and non-reserved service can obtain excellent QoS performance when scheduled with the proposed algorithm.

Citation Download Citation

Junni Zou, Sunjuan Xun, and Rujian Lin "A share-controlled packet fair queueing algorithm for IntServ EPON", Proc. SPIE 6022, Network Architectures, Management, and Applications III, 60223C (5 December 2005); https://doi.org/10.1117/12.634129

ACCESS THE FULL ARTICLE

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