Optical packet assembly algorithms considering switching time
Junjie Yang, Jie Li
Abstract
Junjie Yang, Jie Li
Abstract
Optical packet assembly algorithms have great effects on the performances of optical packet switching network. When the granularity of an optical packet is almost the same as the switching time of an optical switch, optical packet assembly algorithms have to be modified. For this purpose, in this paper, two improved assembly algorithms, i.e., Threshold- Based-ST and Timer-Based-ST are proposed. The performances of the optical packet switch are evaluated by simulation experiments.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Optical packet assembly algorithms have great effects on the performances of optical packet switching network. When the granularity of an optical packet is almost the same as the switching time of an optical switch, optical packet assembly algorithms have to be modified. For this purpose, in this paper, two improved assembly algorithms, i.e., Threshold- Based-ST and Timer-Based-ST are proposed. The performances of the optical packet switch are evaluated by simulation experiments.
Key concepts: Burst switching, Optical burst switching, Computer science, Fast packet switching, Processing delay, Optical switch, Packet switching, Transmission delay