Share Email Print
cover

Proceedings Paper

Design and implementation of a double-queue contention resolution algorithm for the ATM-PON system
Author(s): Jongwook Jang; Sera Choi; Eun K. Park
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

FSAN GX has discussed on the cost-effective way to deploy the ATM-PON (Passive Optical Network) system that is suitable for providing broadband services. A common broadband PON applicable to many operators increases the world-wide market for the product. The MAC (Medium Access Control) protocol controls ONUs' (Optical Network Unit) access to the shared capacity on the PON, this product is very important if TDMA (Time Division Multiple Access) multiplexing is used on the upstream. In fact there is a relatively large number of MAC proposals mentioning IEEE802.14. The tree algorithm presents the main advantage of being stable, predictable and performant. In this paper, we proposed a new contention resolution algorithm called DQT (Double Queue Tree based) which can support multi level service under practical environments. Simulations result show that channel utility and delay time are improved than other algorithms under practical environments. Proposed DQT algorithm that using double queue consider priority consists of OLT control part and station part show us good simulation result compare to existing MAC algorithm.

Paper Details

Date Published: 7 October 1998
PDF: 9 pages
Proc. SPIE 3531, All-Optical Networking: Architecture, Control, and Management Issues, (7 October 1998); doi: 10.1117/12.327051
Show Author Affiliations
Jongwook Jang, DongEui Univ. (South Korea)
Sera Choi, DongEui Univ. (South Korea)
Eun K. Park, Univ. of Missouri/Kansas City (United States)


Published in SPIE Proceedings Vol. 3531:
All-Optical Networking: Architecture, Control, and Management Issues
John M. Senior; Chunming Qiao, Editor(s)

© SPIE. Terms of Use
Back to Top