Analysis, modeling and generation of self-similar VBR video traffic
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round robin
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Simple and efficient models for variable bit rate MPEG video traffic
Performance Evaluation - Special issue on applied probability modelling in telecommunication
Latency-rate servers: a general model for analysis of traffic scheduling algorithms
IEEE/ACM Transactions on Networking (TON)
On the equivalent bandwidth of self-similar sources
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on modeling and simulation of communication networks
A joint-ONU interval-based dynamic scheduling algorithm for ethernet passive optical networks
IEEE/ACM Transactions on Networking (TON)
Ethernet passive optical network architectures and dynamic bandwidth allocation algorithms
IEEE Communications Surveys & Tutorials
IEEE Journal on Selected Areas in Communications
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
A priority-based processor sharing model for TDM passive optical networks
IEEE Journal on Selected Areas in Communications - Special issue on next-generation broadband optical access network technologies
Hi-index | 0.00 |
We propose a novel policy for scheduling upstream flows in Ethernet passive optical networks. This policy, called proportional sharing with load reservation (PSLR), provides bandwidth guarantees on a per-flow basis and redistributes the unused bandwidth among active flows in proportion to their priority level. We establish convergence conditions for the PSLR policy and show that it provides a fair service distribution among the flows. Moreover, we establish bounds for the backlog and delay on a per-flow basis, thus enabling a network to provide its users with absolute performance guarantees.