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

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

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Proceedings of 2005 7th International Conference Transparent Optical Networks, 2005 Ročník 1; s. 232 - 236 Vol. 1
Hlavní autori: Naser, H., Mouftah, H.T.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 2005
Predmet:
Bandwidth
Channel allocation
Optical network units
Optical sensors
Passive optical networks
Quality of service
Scheduling algorithm
Software algorithms
Telecommunication traffic
Traffic control
ISBN:9780780392366, 0780392361
ISSN:2162-7339
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
ISBN:9780780392366
0780392361
ISSN:2162-7339
DOI:10.1109/ICTON.2005.1505793