Variable IP packets buffer management schemes for optical packet switching

Effective buffering of optical packets is essential to the efficient working of optical packet switches. In this paper three new schemes, which involve sorting and finding the least occupied buffer, are proposed. Their performance is compared with the common round-robin scheme. The results show that...

Full description

Saved in:
Bibliographic Details
Published in:BT technology journal 2006-04, Vol.24 (2), p.33-39
Main Authors: Chien, S. F., Low, A. L. Y., Choong, K. N., Yee, Y. C.
Format: Article
Language:English
Subjects:
Algorithms
Fiber optic networks
Internet Protocol
Packet switched networks
Studies
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Effective buffering of optical packets is essential to the efficient working of optical packet switches. In this paper three new schemes, which involve sorting and finding the least occupied buffer, are proposed. Their performance is compared with the common round-robin scheme. The results show that all these new schemes are able to enhance the optical packet switch performance significantly in terms of packet drop/loss probability. In addition, the results show that not all the newly arrived packets need to be sorted in order to obtain the minimum packet drop probability. As computation/processing time is significant in optical packet switching, partial sorting of the newly arrived packets with tolerable packet drop probability appears to be a viable proposition. Conversely, a complete sort of newly arrived packets wastes packet processing time unnecessarily while significantly increasing the packet drop probability. [PUBLICATION ABSTRACT]
ISSN:1358-3948
1573-1995
DOI:10.1007/s10550-006-0036-7