	US 7,542,470 B2
	Method and apparatus for routing a packet within a plurality of nodes arranged in a line or a tree given a maximum stack depth
Anupam Gupta, Pittsburgh, Pa. (US); Amit Kumar, Ithaca, N.Y. (US); and Rajeev Rastogi, New Providence, N.J. (US)
Assigned to Alcatel-Lucent USA Inc., Murray Hill, N.J. (US)
Filed on Mar. 31, 2003, as Appl. No. 10/404,010.
Prior Publication US 2004/0190517 A1, Sep. 30, 2004
Int. Cl. H04L 12/56 (2006.01)

U.S. Cl. 370—392 [370/256; 370/408]

18 Claims

1. A method for routing a packet within a plurality of n nodes arranged in a line using a stack depth, s, wherein said line of said plurality of n nodes are divided into segments, a first unique label is assigned to each of said segments; and within each of said segments, a second unique label is assigned to each node, wherein s is an integer that is not less than one, said method comprising the steps of:

identifying one of said segments based on said first unique label; and

identifying a node within said identified segment based on said second unique label, wherein said n nodes are divided into approximately n^1/ssegments.