Self-routing (Computer network management)

found: Work cat.: Franaszek, P.A. Adaptive routing in Clos networks, 1995:p. 12 (In this paper, a hybrid routing algorithm is proposed for three-stage Clos switches that utilizes a combination of packet self-routing and reservations over a separate control network. This algorithm adapts to the traffic characteristics in the switch ... )

found: IEEE transactions on parallel and distributed systems, Mar. 2000:p. 264 (Self-routing is a fast routing scheme in which the routing decision at a switch depends only on the addresses of source and destination, which form the routing tags)

found: IEEE proceedings. Communications, June 1997:p. 135 (Self-routing is a method of navigation through a packet network, in which the onward route at each node is determined locally without consulting a global or dynamic data base. Instead, the self-routing techniques either use an algorithm that avoids routing tables completely, or use static, possibly incomplete, routing tables which are seldom (or never) updated during the normal operation of the network)

found: Journal of lightwave technology, Feb. 2003:p. 329 (Self-routing has been used in packet and ATM switches to reduce the hardware cost and control complexity. Upon entering a switch, a packet is attached with a self-routing address that contains all the routing information from all input ports to the desired output ports of the switch. Intermediate switching elements forward the incoming packet to the output ports using bit-by-bit processing of the self-routing address header. The additional header is removed once the packet reaches the desired output port)

notfound: TechWeb: TechEncyclopedia, Sept. 20, 2007;FOLDOC, Sept. 20, 2007;Webopedia, Sept. 20, 2007.