The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Seni bina suis Paket Optik Memori Berkongsi (SMOP) sangat menjanjikan untuk mengurangkan dengan ketara jumlah memori optik yang diperlukan, yang biasanya dibina daripada talian kelewatan gentian (FDL). Algoritma penjadualan berasaskan tempahan semasa untuk suis SMOP boleh menggunakan FDL dengan berkesan dan mencapai kadar kehilangan paket yang rendah dengan hanya menempah masa berlepas untuk setiap paket ketibaan. Walau bagaimanapun, adalah ketara bahawa skim penjadualan yang mudah itu mungkin memperkenalkan masalah paket yang tidak terurus. Dalam makalah ini, kami mula-mula mengenal pasti dua sumber utama masalah paket tidak tertib dalam suis SMOP berasaskan tempahan semasa. Kami kemudian menunjukkan bahawa dengan memperkenalkan pembolehubah "cap masa terakhir" dan mengubah suai susunan FDL yang sepadan serta proses penjadualan dalam suis SMOP berasaskan tempahan semasa, adalah mungkin untuk mengekalkan paket dalam urutan sambil mengekalkan kelewatan yang sama dan prestasi kehilangan paket seperti reka bentuk sebelumnya. Akhir sekali, kami melanjutkan lagi kerja kami untuk menyokong penukaran letusan panjang boleh ubah.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Xiaoliang WANG, Xiaohong JIANG, Susumu HORIGUCHI, "Maintaining Packet Order in Reservation-Based Shared-Memory Optical Packet Switch" in IEICE TRANSACTIONS on Communications,
vol. E91-B, no. 9, pp. 2889-2896, September 2008, doi: 10.1093/ietcom/e91-b.9.2889.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e91-b.9.2889/_p
Salinan
@ARTICLE{e91-b_9_2889,
author={Xiaoliang WANG, Xiaohong JIANG, Susumu HORIGUCHI, },
journal={IEICE TRANSACTIONS on Communications},
title={Maintaining Packet Order in Reservation-Based Shared-Memory Optical Packet Switch},
year={2008},
volume={E91-B},
number={9},
pages={2889-2896},
abstract={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.},
keywords={},
doi={10.1093/ietcom/e91-b.9.2889},
ISSN={1745-1345},
month={September},}
Salinan
TY - JOUR
TI - Maintaining Packet Order in Reservation-Based Shared-Memory Optical Packet Switch
T2 - IEICE TRANSACTIONS on Communications
SP - 2889
EP - 2896
AU - Xiaoliang WANG
AU - Xiaohong JIANG
AU - Susumu HORIGUCHI
PY - 2008
DO - 10.1093/ietcom/e91-b.9.2889
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E91-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2008
AB - 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.
ER -