The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Jul. 20, 2010
Filed:
Mar. 17, 2005
William J. Dally, Stanford, CA (US);
Philip P. Carvey, Bedford, MA (US);
Paul A. Beliveau, Essex Jct., VT (US);
William F. Mann, Sudbury, MA (US);
Larry R. Dennison, Norwood, MA (US);
William J. Dally, Stanford, CA (US);
Philip P. Carvey, Bedford, MA (US);
Paul A. Beliveau, Essex Jct., VT (US);
William F. Mann, Sudbury, MA (US);
Larry R. Dennison, Norwood, MA (US);
FutureWei Technologies, Inc., Plano, TX (US);
Abstract
In a network router, a tree structure or a sorting network is used to compare scheduling values and select a packet to be forwarded from an appropriate queue. In the tree structure, each leaf represents the scheduling value of a queue and internal nodes of the structure represent winners in comparisons of scheduling values of sibling nodes of the tree structure. CBR scheduling values may first be compared to select a queue and, if transmission from a CBR queue is not timely, a packet may be selected using WFQ scheduling values. The scheduling values are updated to reflect variable packet lengths and byte stuffing in the prior packet. Scheduling may be performed in multiple stages.