COD: alternative architectures for high speed packet switching
IEEE/ACM Transactions on Networking (TON)
LATENCY-RATE SERVERS: A GENERAL MODEL FOR ANALYSIS OF TRAFFIC SCHEDULING ALGORITHMS
LATENCY-RATE SERVERS: A GENERAL MODEL FOR ANALYSIS OF TRAFFIC SCHEDULING ALGORITHMS
Exact emulation of a priority queue with a switch and delay lines
Queueing Systems: Theory and Applications
Constructions of optical FIFO queues
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Emerging Optical Network Technologies: Architectures, Protocols and Performance
Emerging Optical Network Technologies: Architectures, Protocols and Performance
Recursive construction of FIFO optical multiplexers with switched delay lines
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
With recent advances in optical technology, we are closer to building all-optical routers than ever before. A major problem in this area, however, is the lack of all-optical memories similar to what we have in electronics. To overcome this problem, recently, there have been several proposals that show how we can emulate First-In First-Out (FIFO) queues using a combination of fiber delay lines and switches. Unfortunately, FIFO queues cannot be used for implementing many link scheduling policies including weighted fair queuing, weighted round-robin, or strict priority, which are essential components of any modern router today. In this paper, we introduce an architecture based on fiber delay lines and optical switches that can be used for emulating Push-In First-Out (PIFO) queues. In a PIFO queue, an incoming packet can be pushed anywhere in the queue, and therefore it can be used for the implementation of various link scheduling policies. We describe a scheduling algorithm for this architecture and show that with a small speedup, we can build a PIFO queue of size N-1 using only O(log2 N) 3×3 optical switches. The resulting system has a minimum reliability of 99.5%, and even for the small portion of departure requests that cannot be fulfilled immediately, the requested packet is ready to depart within approximately five time slots from the request time.