Maintaining Packet Order in Reservation-Based Shared-Memory Optical Packet Switch
Author(s) -
Xiaofeng Wang,
Xiaohong Jiang,
S. Horiguchi
Publication year - 2008
Publication title -
ieice transactions on communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.211
H-Index - 56
eISSN - 1745-1345
pISSN - 0916-8516
DOI - 10.1093/ietcom/e91-b.9.2889
Subject(s) - computer science , network packet , burst switching , transmission delay , reservation , processing delay , computer network , scheduling (production processes) , packet switching , fast packet switching , end to end delay , real time computing , operations management , economics
Shared-Memory Optical Packet (SMOP) switch architecture is very promising for significantly reducing the amount of required optical memory, which is typically constructed from fiber delay lines (FDLs). The current reservation-based scheduling algorithms for SMOP switches can effectively utilize the FDLs and achieve a low packet loss rate by simply reserving the departure time for each arrival packet. It is notable, however, that such a simple scheduling scheme may introduce a significant packet out of order problem. In this paper, we first identify the two main sources of packet out of order problem in the current reservation-based SMOP switches. We then show that by introducing a “last-timestamp” variable and modifying the corresponding FDLs arrangement as well as the scheduling process in the current reservation-based SMOP switches, it is possible to keep packets in-sequence while still maintaining a similar delay and packet loss performance as the previous design. Finally, we further extend our work to support the variable-length burst switching.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom