Patents Assigned to Nokia Wireless Routers, Inc.
-
Publication number: 20040213167Abstract: One or more labeled routing trees (LRTs) are produced at a router of a computer network according to a shortest path determination made over a partial topology graph of the network, which graph is produced according to knowledge of adjacent links of the router and one or more LRTs of neighboring routers. The LRTs of the router may be updated in response to receipt of routing state update messages, and such messages may include local link identifiers assigned by a head of a link to which the identifiers pertain, and node parameters of a tail of the link to which the local link identifiers pertain.Type: ApplicationFiled: May 12, 2004Publication date: October 28, 2004Applicant: Nokia Wireless Routers, Inc.Inventors: J. Joaquin Garcia-Luna-Aceves, Marcelo Spohn, David A. Beyer
-
Patent number: 6788702Abstract: Scheduling packets are exchanged among neighboring nodes of a computer network. These scheduling packets include descriptions of a transmitting node's 2-hop neighborhood within the computer network, and nodes are able to determine transmission schedules from information received via said scheduling packets. Preferably, the computer network is a synchronized network in which time is dived into a number of frames, each of which are made up of a plurality of slots. In such cases, the exchange of scheduling packets should occur within a first number of the slots of each frame, preferably in a common communication channel. Transmission schedules may be determined, at least in part, because nodes advertise their availability using the scheduling packets. The above-mentioned descriptions may include an identification of received communication times and/or channels, an identification of requested communication times and/or channels and an identification of available communication times and/or channels.Type: GrantFiled: October 15, 1999Date of Patent: September 7, 2004Assignee: Nokia Wireless Routers, Inc.Inventors: J. Joaquin Garcia-Luna-Aceves, David A. Beyer, Chane L. Fullmer
-
Patent number: 6683865Abstract: A protocol for a computer network in which routing operation codes (ROCs) in headers of packets transmitted within the network specify to a receiving router which of a number of routing or switching methods to apply to forward associated packets. The packets may be forwarded in any of the following modes: (a) a broadcast mode, (b) a hop-by-hop mode based on receiving node address information, (c) a label swapping mode, (d) a source-switching mode, (e) a flow switching mode, or (f) a hop-by-hop mode based on sending mode address information. In the label swapping mode, packets are accepted by the receiving router if the packets include a media access control address of the receiving router, and packets are forwarded from the receiving router according to a switching table indexed by a media access control address of a transmitting router. In the source switching mode, the headers include source routes specified in terms of local link identifiers used by routers in the network.Type: GrantFiled: October 15, 1999Date of Patent: January 27, 2004Assignee: Nokia Wireless Routers, Inc.Inventors: J. Joaquin Garcia-Luna-Aceves, David A. Beyer, Thane J. Frivold
-
Publication number: 20030037167Abstract: Routing table update messages that include both network-level and link-level addresses of nodes of a computer network are exchanged among the nodes of the computer network. Further, a routing table maintained by a first one of the nodes of the computer network may be updated in response to receiving one or more of the update messages. The routing table is preferably updated by selecting a next node to a destination node of the computer network only if every intermediate node in a path from the next node to the destination node satisfies a set of nodal conditions required by the first node for its path to the destination node and the next node offers the shortest distance to the destination node and to every intermediate node along the path from the next node to the destination node. The shortest distance to the destination node may be determined according to one or more link-state and/or node-state metrics regarding communication links and nodes along the path to the destination node.Type: ApplicationFiled: September 25, 2002Publication date: February 20, 2003Applicant: Nokia Wireless Routers Inc.Inventors: J. Joaquin Garcia-Luna-Aceves, David A. Beyer, Thane J. Frivold
-
Publication number: 20030028668Abstract: Routing table update messages that include both network-level and link-level addresses of nodes of a computer network are exchanged among the nodes of the computer network. Further, a routing table maintained by a first one of the nodes of the computer network may be updated in response to receiving one or more of the update messages. The routing table is preferably updated by selecting a next node to a destination node of the computer network only if every intermediate node in a path from the next node to the destination node satisfies a set of nodal conditions required by the first node for its path to the destination node and the next node offers the shortest distance to the destination node and to every intermediate node along the path from the next node to the destination node. The shortest distance to the destination node may be determined according to one or more link-state and/or node-state metrics regarding communication links and nodes along the path to the destination node.Type: ApplicationFiled: September 25, 2002Publication date: February 6, 2003Applicant: Nokia Wireless Routers Inc.Inventors: J. Joaquin Garcia-Luna-Aceves, David A. Beyer, Thane J. Frivold