Share Email Print
cover

Proceedings Paper

A share-controlled packet fair queueing algorithm for IntServ EPON
Author(s): Junni Zou; Sunjuan Xun; Rujian Lin
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 6 December 2005
PDF: 7 pages
Proc. SPIE 6022, Network Architectures, Management, and Applications III, 60223C (6 December 2005); doi: 10.1117/12.634129
Show Author Affiliations
Junni Zou, Shanghai Univ. (China)
Sunjuan Xun, Shanghai Univ. (China)
Rujian Lin, Shanghai Univ. (China)


Published in SPIE Proceedings Vol. 6022:
Network Architectures, Management, and Applications III
Kwok-wai Cheung; Gee-Kung Chang; Guangcheng Li; Ken-Ichi Sato, Editor(s)

© SPIE. Terms of Use
Back to Top