A joint-ONU interval-based dynamic scheduling algorithm for Ethernet passive optical networks

This paper proposes a new dynamic bandwidth allocation system for Ethernet Passive Optical Networks (EPONs), subject to requirements of fairness, efficiency, and cost. An Optical Line Terminal (OLT)-centric bandwidth allocation model is proposed which employs a credit pooling technique combined with...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE/ACM transactions on networking Ročník 14; číslo 4; s. 889 - 899
Hlavní autoři: Naser, H., Mouftah, H.T.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.08.2006
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Allocations
Bandwidth
Bandwidths
Channel allocation
Communication protocols
Costs
Delay
Dynamic scheduling
Dynamical systems
Dynamics
Ethernet
Fiber optic networks
Heuristic algorithms
network architecture and design
network technologies
Optical communication
Optical fiber networks
Optical network units
Passive optical networks
Proposals
Scheduling
Scheduling algorithm
Scheduling algorithms
Spectrum allocation
Studies
ISSN:1063-6692, 1558-2566
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper proposes a new dynamic bandwidth allocation system for Ethernet Passive Optical Networks (EPONs), subject to requirements of fairness, efficiency, and cost. An Optical Line Terminal (OLT)-centric bandwidth allocation model is proposed which employs a credit pooling technique combined with a weighted-share policy to partition the upstream bandwidth among different classes of service, and to prevent Optical Network Units (ONUs) from monopolizing the bandwidth. The OLT-centric model allows global optimization of network resources, a characteristic which is not found in many earlier proposals. Supported by the new bandwidth allocation, the paper proposes a joint-ONU interval-based packet scheduling algorithm, referred to herein as COPS (Class-of-service Oriented Packet Scheduling), that meets the requirements set out above. We compare COPS with another well-known scheduling algorithm which employed a standard priority-based bandwidth sharing. We show that COPS is superior in terms of network utilization and maximum packet delay, with the consequence of an increase in average packet delay for the premium traffic. This drawback is overcome by combining COPS with a rate-based optimization scheme
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:1063-6692
1558-2566
DOI:10.1109/TNET.2006.879698