Buffering management schemes for optical variable length packets under limited packet sorting

Citation

Tan, Choo Peng and Castanon, Gerardo and Chien, Su Fong and You, Ah Heng and Low, Andy L. Y. (2006) Buffering management schemes for optical variable length packets under limited packet sorting. Photonic Network Communications, 12 (3). pp. 257-268. ISSN 1387-974X

[img] Text (Buffering management schemes for optical variable length packets under limited packet sorting)
1282.pdf
Restricted to Repository staff only

Download (0B)

Abstract

This paper studies several buffering strategies for optical packet switching (OPS) under limited packet sorting. Three schemes, which are able to sort newly arrived packets based on packet's length as well as capability of finding the minimum buffer occupancy, are analyzed and compared. Results show that all three proposed schemes could improve OPS performance considerably in terms of probability of packet loss (PPL) and probability of information loss (PIL). In addition, the simulation results show that not all the newly arrived packets need to be sorted in order to obtain minimum packet loss probability. Since the amount of packets and thus the packet processing time is significant in OPS, it is possible that not all the packets can be processed using one of the buffering strategies. An important finding of this paper is that if only 10% of the packets are sorted, the PPL is comparable to the minimum packet loss value obtained when 100% of the packets are sorted.

Item Type: Article
Subjects: T Technology > T Technology (General)
Q Science > QA Mathematics > QA71-90 Instruments and machines > QA75.5-76.95 Electronic computers. Computer science
Divisions: Faculty of Engineering and Technology (FET)
Depositing User: Ms Suzilawati Abu Samah
Date Deposited: 14 Oct 2011 03:18
Last Modified: 21 Dec 2022 09:18
URII: http://shdl.mmu.edu.my/id/eprint/3260

Downloads

Downloads per month over past year

View ItemEdit (login required)