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:
Jun. 02, 2009
Filed:
Mar. 31, 2003
Anupam Gupta, Pittsburgh, PA (US);
Amit Kumar, Ithaca, NY (US);
Rajeev Rastogi, New Providence, NJ (US);
Anupam Gupta, Pittsburgh, PA (US);
Amit Kumar, Ithaca, NY (US);
Rajeev Rastogi, New Providence, NJ (US);
Alcatel-Lucent USA Inc., Murray Hill, NJ (US);
Abstract
A method and apparatus are provided for routing a packet within a plurality of n nodes arranged in a line or tree (or a combination of the foregoing), given a maximum stack depth, s. A fixed stack process for routing packets on a line given a stack depth, s, initially divides a line of n nodes into segments, such as napproximately equal segments. A unique label is assigned to each segment and, within each segment, one of up to nlabels is assigned to each node. A fixed stack process for routing packets on a tree, given a target stack depth, s, initially identifies a subset, S, of at nodes from the tree, such as at most 3 nnodes, such that after the subset, S, is removed, each remaining subtree has at most nnodes. A unique label is assigned to each of the nodes in the subset S and, within each remaining subtree, one of up to nlabels is assigned to each node. If the bound on the stack depth cannot be violated, the fixed stack routing process merges every two consecutive levels in the stack to one level.