Abstract: A scheduling method for a switch includes steps as follows. First type protocol flows are sorted according to a sending rate to obtain a plurality of sorted first type protocol flows; a difference of sending rate between each two adjacent of sorted first type protocol flows is calculated to obtain a plurality of differences; N?1 differences are selected from the differences, where each of the N?1 differences is greater than a largest one of remaining differences; a position of each of the N?1 differences between corresponding two adjacent of sorted first type protocol flows is marked to obtain N?1 marked positions; the sorted first type protocol flows are divided into N groups of first type protocol flows according to the N?1 marked positions; each group of the N groups of first type protocol flows is directed to a first queue of the N first queues correspondingly.

Abstract: A scheduling method for a switch includes steps as follows. First type protocol flows are sorted according to a sending rate to obtain a plurality of sorted first type protocol flows; a difference of sending rate between each two adjacent of sorted first type protocol flows is calculated to obtain a plurality of differences; N?1 differences are selected from the differences, where each of the N?1 differences is greater than a largest one of remaining differences; a position of each of the N?1 differences between corresponding two adjacent of sorted first type protocol flows is marked to obtain N?1 marked positions; the sorted first type protocol flows are divided into N groups of first type protocol flows according to the N?1 marked positions; each group of the N groups of first type protocol flows is directed to a first queue of the N first queues correspondingly.