Optical buffering is fundamental to contention resolution in optical networks. The current works on this line mainly focus on the emulation of dedicated input/output buffer queue by using switched fiber delay lines (SDL). It is notable that the shared buffer queue, where a common buffer pool is shared by all the input/output ports of a switch, has the potential to significantly reduce the overall buffer capacity requirement. As far as we know, however, no related work is available yet on the exact emulation of a shared optical buffer queue with SDLs. In this paper, we focus on the design of first in first out (FIFO) shared optical buffer queue based on the optical feedback SDL construction. The construction considered consists of an (M + 2) × (M + 2) switch fabric and M fiber delay lines FDL1, . . ., FDLM, where FDLi connects the i-th output of the switch fabric with its i-th input. We show that by setting the length of FDLi as min(M + 1 − i, i), i = 1, . . . , M, such a construction can actually work as an 1-to-2 shared buffer queue. We then extend this emulation to the more general N-to-2 case.
A construction of 1-to-2 shared optical buffer queue with switched delay line
PATTAVINA, ACHILLE;
2009-01-01
Abstract
Optical buffering is fundamental to contention resolution in optical networks. The current works on this line mainly focus on the emulation of dedicated input/output buffer queue by using switched fiber delay lines (SDL). It is notable that the shared buffer queue, where a common buffer pool is shared by all the input/output ports of a switch, has the potential to significantly reduce the overall buffer capacity requirement. As far as we know, however, no related work is available yet on the exact emulation of a shared optical buffer queue with SDLs. In this paper, we focus on the design of first in first out (FIFO) shared optical buffer queue based on the optical feedback SDL construction. The construction considered consists of an (M + 2) × (M + 2) switch fabric and M fiber delay lines FDL1, . . ., FDLM, where FDLi connects the i-th output of the switch fabric with its i-th input. We show that by setting the length of FDLi as min(M + 1 − i, i), i = 1, . . . , M, such a construction can actually work as an 1-to-2 shared buffer queue. We then extend this emulation to the more general N-to-2 case.File | Dimensione | Formato | |
---|---|---|---|
jrnl-TCOM09.pdf
Accesso riservato
:
Post-Print (DRAFT o Author’s Accepted Manuscript-AAM)
Dimensione
650.08 kB
Formato
Adobe PDF
|
650.08 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.