Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
The superPON demonstrator: an exploration of possible evolution paths for optical access networks
IEEE Communications Magazine
Ethernet passive optical network (EPON): building a next-generation optical access network
IEEE Communications Magazine
Efficient transport of packets with QoS in an FSAN-aligned GPON
IEEE Communications Magazine
Dynamic bandwidth allocation for quality-of-service over Ethernet PONs
IEEE Journal on Selected Areas in Communications
A fair scheduling discipline for Ethernet passive optical networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Shortest propagation delay (SPD) first scheduling for EPONs with heterogeneous propagation delays
IEEE Journal on Selected Areas in Communications - Special issue on next-generation broadband optical access network technologies
Providing delay bounds for real-time traffic over EPONs
ACMOS'07 Proceedings of the 9th WSEAS international conference on Automatic control, modelling and simulation
A survey of dynamic bandwidth allocation algorithms for Ethernet Passive Optical Networks
Optical Switching and Networking
A midterm DBA algorithm for quality of service on aggregation layer EPON networks
Photonic Network Communications
| Hi-index | 0.00 |
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.