Packet reordering is not pathological network behavior
IEEE/ACM Transactions on Networking (TON)
IEEE Communications Magazine
Optical packet switching in core networks: between vision and reality
IEEE Communications Magazine
Transparent optical packet switching: network architecture and demonstrators in the KEOPS project
IEEE Journal on Selected Areas in Communications
Optical routing of asynchronous, variable length packets
IEEE Journal on Selected Areas in Communications
The effect of packet reordering in a backbone link on application throughput
IEEE Network: The Magazine of Global Internetworking
Computer Networks: The International Journal of Computer and Telecommunications Networking
Review: A parallel iterative scheduler for asynchronous Optical Packet Switching networks
Optical Switching and Networking
Hi-index | 0.00 |
This paper deals with optical packet switches with limited buffer capabilities, subject to asynchronous, variable-length packets and connection-oriented operation. The focus is put on buffer scheduling policies and queuing performance evaluation. In particular a combined use of the wavelength and time domain is exploited in order to obtain contention resolution algorithms that guarantee the sequence preservation of packets belonging to the same connection. Four simple algorithms for strict and loose packet sequence preservation are proposed. Their performance is studied and compared with previously proposed algorithms. Simulation results suggest that by accepting some additional processing effort it is possible to guarantee very low packet loss probabilities while avoiding the out-of-sequence delivery.