TY - JOUR
T1 - Distributed resource scheduling in not-aligned optical cell switching
AU - Rodelgo-Lacruz, M.
AU - López-Bravo, C.
AU - González-Castano, F. J.
AU - Chao, H. J.
AU - Gil-Castiñeira, F.
N1 - Funding Information:
ACKNOWLEDGMENTS The work described in this paper was carried out with the support of the BONE-project (Building the Future Optical Network in Europe), a Network of Excellence funded by the European Commission through the 7th ICT-Framework Programme.
Funding Information:
It has also been supported by grant PHOBOS 09TIC014CT (Xunta de Galicia, Spain).
PY - 2010/4
Y1 - 2010/4
N2 - Most all-optical switching paradigms assume that different wavelengths are switched independently, which limits scalability. In optical cell switching (OCS), time is divided into time slots of fixed size by time-division multiplexing, and the wavelengths in a time slot are all bundled. Thus, each OCS switch (OCX) has a single switching plane and performs mere time-space switching. In OCS, each OCX requires optical slot synchronizers (OSYNs) at all inputs for the arrival slots to be aligned, so that cells can be simultaneously forwarded. In a recent OCS paradigm -not-aligned OCS-, the OSYNs and the alignment process are no longer required. Cell shifting still takes place inside the OCXs for minimizing the gaps between cells, but it is not necessary to align them to a reference time. Not-aligned OCS has clear advantages over aligned OCS: the total number of fiber delay loops (FDLs) and the hardware cost are reduced, and the number of switching operations is also lower. Moreover, cell arrival time to the switch is not critical, and the network becomes simpler and more flexible. In this paper, we propose a new distributed resource scheduling algorithm for not-aligned OCS networks, which takes connection blocking probability to reasonable values for practical loads.
AB - Most all-optical switching paradigms assume that different wavelengths are switched independently, which limits scalability. In optical cell switching (OCS), time is divided into time slots of fixed size by time-division multiplexing, and the wavelengths in a time slot are all bundled. Thus, each OCS switch (OCX) has a single switching plane and performs mere time-space switching. In OCS, each OCX requires optical slot synchronizers (OSYNs) at all inputs for the arrival slots to be aligned, so that cells can be simultaneously forwarded. In a recent OCS paradigm -not-aligned OCS-, the OSYNs and the alignment process are no longer required. Cell shifting still takes place inside the OCXs for minimizing the gaps between cells, but it is not necessary to align them to a reference time. Not-aligned OCS has clear advantages over aligned OCS: the total number of fiber delay loops (FDLs) and the hardware cost are reduced, and the number of switching operations is also lower. Moreover, cell arrival time to the switch is not critical, and the network becomes simpler and more flexible. In this paper, we propose a new distributed resource scheduling algorithm for not-aligned OCS networks, which takes connection blocking probability to reasonable values for practical loads.
KW - All-optical network
KW - OCS
KW - Optical packet switching
KW - Scheduling algorithm
UR - http://www.scopus.com/inward/record.url?scp=77950608130&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77950608130&partnerID=8YFLogxK
U2 - 10.1109/TCOMM.2010.04.080610
DO - 10.1109/TCOMM.2010.04.080610
M3 - Article
AN - SCOPUS:77950608130
SN - 0090-6778
VL - 58
SP - 1201
EP - 1212
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
IS - 4
M1 - 5439323
ER -