By Topic

A class-of-service oriented packet scheduling (COPS) algorithm for EPON-based access networks

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
$31 $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)
Naser, H. ; Dept. of Software Eng., Lakehead Univ., Thunder Bay, Ont., Canada ; Mouftah, H.T.

We consider the problem of dynamic bandwidth allocation (DBA) for Ethernet passive optical networks (EPONs), subject to requirements of fairness, efficiency, and cost. The traffic from the access side is aggregated at ONUs and mapped to different classes of service queues. We employ credit pooling technique, together with weighted-share policy, that enables the OLT to partition the upstream bandwidth among different classes, and to prevent ONUs from monopolizing the bandwidth. We propose a packet scheduling algorithm, referred to as COPS (Class-of-service Oriented Packet Scheduling) that meets our requirements set out above. We compare COPS with a well-known scheduling algorithm which employed a standard priority-based scheduling, and we show that COPS is superior in terms of network utilization and maximum packet delay.

Published in:

Transparent Optical Networks, 2005, Proceedings of 2005 7th International Conference  (Volume:1 )

Date of Conference:

3-7 July 2005