Name
Abstract | ||
|---|---|---|
In this paper we study the problem of scheduling variable-length frames in WDM-PON under Stanford University access (SUCCESS), a next-generation hybrid WDM/TDM optical access network architecture. The SUCCESS WDM-PON architecture has unique features that have direct impact on the design of scheduling algorithms: first, tunable transmitters and receivers at OLT are shared by ONU to reduce transceiver counts; second, the tunable transmitters not only generate downstream data traffic but also provide ONU with optical continuous wave (CW) bursts for upstream transmissions. To provide efficient bidirectional transmissions between OLT and ONU, we propose a batch scheduling algorithm based on the sequential scheduling algorithm previously studied. The key idea is to provide room for optimization and priority queueing by scheduling over more than one frame. In the batch scheduling, frames arriving at OLT during a batch period are stored in virtual output queues (VOQ) and scheduled at the end of the batch period. Through simulation with various configurations, we demonstrate that the proposed batch scheduling algorithm, compared to the original sequential scheduling algorithm, provides higher throughput, especially when the system load is high, and better fairness between upstream and downstream transmissions. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1109/GLOCOM.2004.1378304 | GLOBECOM |
Keywords | Field | DocType |
upstream transmissions,cw bursts,reduced transceiver counts,optimisation,optical continuous wave bursts,transceivers,tunable transmitters,scheduling,olt,data communication,voq,success,optical fibre subscriber loops,wavelength division multiplexing,fairness,sequential scheduling algorithm,virtual output queues,variable-length frames,onu,priority queueing,queueing theory,downstream data traffic,batch scheduling algorithm,wdm-pon,next-generation hybrid network,efficient bidirectional transmissions,optical receivers,optimization,optical access network,stanford university access,system load,tunable receivers,telecommunication traffic,optical transmitters,throughput,access network,universal access,scheduling algorithm,priority queue,continuous wave | Fixed-priority pre-emptive scheduling,Fair-share scheduling,Computer science,Deadline-monotonic scheduling,Algorithm,Computer network,Two-level scheduling,Real-time computing,Rate-monotonic scheduling,Earliest deadline first scheduling,Dynamic priority scheduling,Round-robin scheduling | Conference |
Volume | ISSN | ISBN |
3 | 1930-529X | 0-7803-8794-5 |
Citations | PageRank | References |
3 | 0.79 | 9 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kyeong Soo Kim | 1 | 120 | 26.16 |
| David Gutierrez | 2 | 37 | 5.50 |
| Fu-Tai An | 3 | 65 | 10.10 |
| Leonid G. Kazovsky | 4 | 73 | 16.89 |