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. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Dai, Y., & Cao, L. (2008). Evaluation of a novel load-balancing algorithm with variable granularity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5022 LNCS, pp. 14–17). https://doi.org/10.1007/978-3-540-69501-1_3
Mendeley helps you to discover research relevant for your work.