초록 ▼

The present invention provides a method and system for computing and storing minimum-cost routes to all destination nodes in a network. According to one embodiment, the present invention is applied in the context of computing quality of service routes using a source-directed connection-oriented rout

The present invention provides a method and system for computing and storing minimum-cost routes to all destination nodes in a network. According to one embodiment, the present invention is applied in the context of computing quality of service routes using a source-directed connection-oriented routing environment. The route computation scheme employs an extension to Dijkstra's algorithm coupled with discretized link costs to generate a shortest-path graph with one or more routes to each destination. The present invention provides a compact data structure for storing at least one minimum-cost route to each destination node in a network. In particular, the routes are stored using a directed acyclic graph representing at least one minimum-cost pre-computed route for each destination node in the network. Each destination node in the network is associated with one or more parent pointers pointing to an upstream node in network that lies along a minimum-cost route. Routes are retained in the data structure and not extracted until connection arrival. Upon connection arrival, a route is extracted from the data structure by performing a depth-first search of the acyclic graph, which returns the first route in the common case. As part of the route extraction process, the feasibility of each link in the route is determined based upon a recent link-state. Links that are infeasible are excluded from the extracted route. In addition, according to one embodiment, promising routes are re-ranked in the data structure to provide computational benefits for future route extractions.

대표청구항 ▼

The present invention provides a method and system for computing and storing minimum-cost routes to all destination nodes in a network. According to one embodiment, the present invention is applied in the context of computing quality of service routes using a source-directed connection-oriented rout

The present invention provides a method and system for computing and storing minimum-cost routes to all destination nodes in a network. According to one embodiment, the present invention is applied in the context of computing quality of service routes using a source-directed connection-oriented routing environment. The route computation scheme employs an extension to Dijkstra's algorithm coupled with discretized link costs to generate a shortest-path graph with one or more routes to each destination. The present invention provides a compact data structure for storing at least one minimum-cost route to each destination node in a network. In particular, the routes are stored using a directed acyclic graph representing at least one minimum-cost pre-computed route for each destination node in the network. Each destination node in the network is associated with one or more parent pointers pointing to an upstream node in network that lies along a minimum-cost route. Routes are retained in the data structure and not extracted until connection arrival. Upon connection arrival, a route is extracted from the data structure by performing a depth-first search of the acyclic graph, which returns the first route in the common case. As part of the route extraction process, the feasibility of each link in the route is determined based upon a recent link-state. Links that are infeasible are excluded from the extracted route. In addition, according to one embodiment, promising routes are re-ranked in the data structure to provide computational benefits for future route extractions. e notch (37) serving as an adjusting section is provided for a magnetic balancing adjustment between stators (31 and 32) and a rotor (12). The inside notch acts to reduce cogging torque, thereby allowing the rotor to rotate using a slight torque. Therefore, the rotor can be more readily started without using a complicated structure, can be prevented from easily stopping due to an external disturbance, and can be made more reliable. In reducing the cogging torque, it is not necessary to reduce the number of magnetic flux lines by, for example, making a rotor magnet (12b) smaller, making it possible to maintain the efficiency with which electrical power is produced. ole Mar. 2, 2000 Measurement and Control For Optimizing Gas Lift Well and Field Performance TH 1722 60/186,381 Controlled Downhole Mar. 2, 2000 Chemical Injection TH 1723 60/186,378 Wireless Power and Mar. 2, 2000 Communications Cross-Bar Switch The current application shares some specification and figures with the following commonly owned and concurrently filed applications in the following table, all of which are hereby incorporated by reference: [TABLE] ures with the following commonly owned and concurrently filed applications in the following table, all of which are hereby incorporated by reference: COMMONLY OWNED AND CONCURRENTLY FILED U.S. PATENT APPLICATIONS T&K # Ser. No. Title Filing Date TH 1599US 09/769,047 Choke Inductor for Wire- Jan. 24, 2001 less Communications and Control TH 1600US 09/769,048 Induction Choke for Power Jan. 24, 2001 Disribution