Patent ID: 8929216
Filing Date: 2015-01-06
Classification: H04L

Abstract:
1. A packet scheduling method comprising: calculating an expected time of arrival of a (k+1)-th packet subsequent to a currently input k-th packet of individual flows by use of bandwidth allocated fairly to each of the flows and a length of the k-th packet; in response to the arrival of the (k+1)-th packet, comparing the expected time of arrival of the (k+1)-th packet to an actual time of arrival of the (k+1)-th packet; and scheduling the (k+1)-th packet of each flow according to the comparison result, wherein the scheduling of the (k+1)-th packet of each flow according to the comparison result comprises comparing the expected time of arrival of the (k+1)-th packet to a time obtained by subtracting a “rearrangement limit time” for the expected time of arrival from the actual time of arrival of the (k+1)-th if the expected time of arrival of the (k+1)-th packet of each flow is not later than the sum of the actual time of arrival of the (k+1)-th packet and a burst tolerance time, wherein the scheduling of the (k+