Analysis of the parallel packet switch architecture
IEEE/ACM Transactions on Networking (TON)
The load-balanced router
Load balanced Birkhoff-von Neumann switches, part I: one-stage buffering
Computer Communications
| Hi-index | 0.00 |
In this paper, we propose a Uniform Fine-grain Frame Spreading (UFFS-k, where k is the aggregate factor) algorithm to guarantee packet ordering in load-balanced switches by assigning k cells of the same flow to the fixed k successive intermediate inputs. The UFFS-k algorithm first guarantees packet ordering at input linecards without any computation and communication overhead. As the simulation results demonstrate, UFFS-k offers improved delay performance among existing scheduling algorithms that guarantee packet ordering.