BROWSE
Detail
Conference Paper
Shortest and Oldest First Non-interleaving Packet Switching Scheduling Algorithm
Cited 0 time in 
Share 
Share
- Authors
- Young Ki Hong, Sung Chang Lee, Hyeong Ho Lee
- Issue Date
- 2002-01
- Citation
- International Conference on Information Networking (ICOIN) 2002 (LNCS 2343), v.2343, pp.226-236
- Publisher
- Springer
- Language
- English
- Type
- Conference Paper
- Abstract
- A packet-aware non-interleaving scheduling algorithm is proposed and examined in this paper. The non-interleaving scheduling algorithm eliminates the complexity of packet reassembly at the output queue. The characteristics of packet latency and queue occupancies are investigated in comparison with the cell-interleaving scheduling algorithm. The simulated results show that the packet-aware non-interleaving scheduling could be a feasible or better choice for packet switch implementations in the latency, output buffer requirement and implementation complexity viewpoints. The simulated results are obtained using self-similar traffic generated based on the measured Internet backbone traffic that reflects the predominance of short packets.
- KSP Keywords
- Implementation complexity, Internet backbone, Packet latency, Packet switching, Scheduling algorithm, Self-similar traffic, Switching scheduling, backbone traffic, output buffer