107 results about "Shortest path computation" patented technology

Methods, apparatus, and products for routing frames in a shortest path computer network for a multi-homed legacy bridge, wherein the network includes a plurality of bridges. At least two of the plurality of bridges operate as edge bridges through which the frames ingress and egress the network. A first edge bridge identifies a legacy bridge nickname for a legacy bridge connected to the network through the first edge bridge and a second edge bridge using active-active link aggregation. The first bridge receives a frame from the legacy bridge and determines, in dependence upon the frame's destination node address, an egress bridge nickname for a third bridge through which a destination node connects to the network. The first bridge then adds the legacy bridge nickname and the egress bridge nickname to the frame and routes the frame to the third bridge in dependence upon the egress bridge nickname.

Methods, apparatus, and products for routing frames in a shortest path computer network for a multi-homed legacy bridge, wherein the network includes a plurality of bridges. At least two of the plurality of bridges operate as edge bridges through which the frames ingress and egress the network. A first edge bridge identifies a legacy bridge nickname for a legacy bridge connected to the network through the first edge bridge and a second edge bridge using active-active link aggregation. The first bridge receives a frame from the legacy bridge and determines, in dependence upon the frame's destination node address, an egress bridge nickname for a third bridge through which a destination node connects to the network. The first bridge then adds the legacy bridge nickname and the egress bridge nickname to the frame and routes the frame to the third bridge in dependence upon the egress bridge nickname.

Each network node in a network is configured for calculating a directed acyclic graph that provides at least one path from all the other network nodes toward the one network node. The network node performs a modified shortest path first calculation by identifying next-hop nodes adjacent to the network node, and orienting the link of each next-hop node toward itself (i.e., the origin). The network node also identifies secondary adjacent nodes, adjacent to each of the next hop nodes, and extends paths from next-hop nodes to the associated secondary adjacent nodes while orienting each of the links of the path between adjacent nodes and next-hop nodes toward the next hop nodes. The paths of the nodes form a directed acyclic graph from any other network node toward the origin, enabling distribution of the directed acyclic graph to the other network nodes for optimized reachability to the network node.

Virtual routers that abstract photonic sub-domains are provided for GMPLS networks. A virtual router uses a link viability matrix to keep track of the set of viable connections between inputs and outputs of a photonic sub-domain. A virtual router may receive RSVP-TE signaling messages and either allocate a working input to output link pair or, if explicitly signaled, verify that the requested link is currently viable. A virtual router also advertises, in its link state updates, the current set of possible outputs for any input link. Shortest path computations can be implemented utilizing virtual routers by modifying a topology graph in accordance with the link viability matrix of the virtual router.

A network comprises a plurality of interconnected switches. At least one pair of switches is interconnected by a trunk formed from a plurality of individual links. A cost value is assigned to the trunk that is equal to the cost of one of the trunk's individual links. As such, a trunk is considered the same as an individual link when shortest path calculations are made. When multiple paths are computed as having the same lowest cost, the system balances load traffic between such lowest cost paths in a way that takes advantage of the higher bandwidth capabilities of trunks.

A method for calculating the shortest vehicle finding path in a parking lot comprises the following steps: (1) making a map of a parking lot, marking parking space points, path points, a vehicle finding point and an elevator point, and determining the names; (2) describing the connection relationship among the path points, the vehicle finding point and the elevator point; (3) connecting all the path points in each layer to form line segments, calculating the vertical distances from each parking space point to the line segments, taking the line segment with the shortest vertical distance from the parking space point as the nearest line segment of the parking space point, and recording the horizontal and vertical coordinates of the vertical point; (4) calculating the shortest path from the vehicle finding point to the elevator point; and (5) calculating the shortest path from the vehicle finding point and the elevator point to the vertical points of the parking space points, calculating the sum of distances of the connection line segments between the vehicle finding point and the parking space points, wherein the vehicle finding path with the shortest distance is the shortest vehicle finding path. The advantage lies in that through calculation of the shortest path from the vehicle finding point to the parking space points, artificial workload is reduced, accuracy is ensured, and the problem of shortest path calculation for same-floor and cross-floor vehicle finding is solved.

The invention discloses a strip-shaped robot path planning method based on a self-learning ant colony algorithm. The strip-shaped robot path planning method based on the self-learning ant colony algorithm is characterized by comprising the following steps: step 1, environment modeling; step 2, initializing stage; step 3, initial searching; step 4, overall updating of grid map pheromone; step 5, self-learning searching; and step 6, outputting of a planning path. The strip-shaped robot path planning method based on the self-learning ant colony algorithm is greatly improved for an ant colony algorithm calculating process, a self-learning strategy is introduced, grid-process environment modeling is treated specially, by the used grid method, the ant colony algorithm deals with a strip-shaped robot path planning process under the condition that barrier cells do not need to be expanded, a new shortest path calculating method is provided, thought of machine learning is fused in the ant colonyalgorithm, the efficiency of path planning of the ant colony algorithm is improved by effective combination of methods such as pheromone, heuristic information, positive feedback and greedy search, and a strip-shaped robot can pass through a narrow channel according to the outline of the strip-shaped robot so as to implement the shortest path planning.

The invention relate to a shortest route planning and navigating method. The method comprises the following steps: step one, according to the user preference, adding a user preference weight to a route distance weight, and using a formula: M(n)=P(n)+Q(n)*A to preprocessing the data to obtain a comprehensive evaluation weight M(n); step two, selecting a special node that a user has to pass by, taking the special node as the cutting point, cutting the road network into a first network and a second network by the cutting point, wherein the first network is a node network from the start point to the special node, and the second network is a node network from the special node to the final point; step three, replacing the route distance weight P(n) in Dijkstra algorithm by the comprehensive evaluation weight M(n) obtained in the step one, and then using the improved Dijkstra algorithm to carry out shortest route on the first network and the second network so as to obtain the shortest route from the start point to the special node to the final point.

A single step routing and wavelength assignment method and system for automated provisioning of services on DWDM networks is presented. This novel single step solution automates design and assignment of services in DWDM networks. For an automated provisioning platform that can handle the routing and wavelength assignment in a single step, the solution avoids reconfiguration of existing services. It also takes into consideration practical aspects of DWDM transponder availability at termination sites and regeneration sites along the selected route. The methodology includes iterative computation of common channel sets to avoid multiple shortest path computations for each of the wavelengths.

Embodiments disclosed herein provide systems, methods, and software for determining the shortest distance between vertices in relatively large graphs. In an embodiment a method includes identifying an original graph comprising a plurality of nodes and a plurality of edges, identifying a plurality of hub nodes from within the original graph, creating a hub matrix comprising the plurality of hub nodes and the shortest distance between the plurality of hub nodes, and determining a shortest distance between the at least two nodes using the original graph and / or the hub matrix.

The present invention relates to an undirected connected network shortest path-based network division method. The objective of the invention is to solve practical problems. When a Voronoi diagram is generated on the network, the L2 Euclidean distance is replaced by a shortest path in connected lines between nodes along the network. According to the undirected connected network shortest path-based network division method, after a group of randomly distributed seed points are provided, Voronoi units on the current network are calculated based on the shortest path; a Voronoi diagram in the Euclidean space is generalized into the Voronoi diagram in the connected network through a CVT (centroidal Voronoi tessellation) algorithm; and iteration is performed, the weighting length of the network corresponding to each seed point on the network is made to be identical as much as possible, and therefore, the optimal division of the network model is obtained. With the method of the invention adopted, problems in the distribution of public infrastructure such as gas stations, charging stations and sanitation facilities, and the distribution of logistics warehouse nodes on urban road can be solved.