1096 results about "Optimal route" patented technology

A routing mechanism, service or system operable in a distributed networking environment. One preferred environment is a content delivery network (CDN) wherein the present invention provides improved connectivity back to an origin server, especially for HTTP traffic. In a CDN, edge servers are typically organized into regions, with each region comprising a set of content servers that preferably operate in a peer-to-peer manner and share data across a common backbone such as a local area network (LAN). The inventive routing technique enables an edge server operating within a given CDN region to retrieve content (cacheable, non-cacheable and the like) from an origin server more efficiently by selectively routing through the CDN's own nodes, thereby avoiding network congestion and hot spots. The invention enables an edge server to fetch content from an origin server through an intermediate CDN server or, more generally, enables an edge server within a given first region to fetch content from the origin server through an intermediate CDN region.

A routing mechanism, service or system operable in a distributed networking environment. One preferred environment is a content delivery network (CDN) wherein the present invention provides improved connectivity back to an origin server, especially for HTTP traffic. In a CDN, edge servers are typically organized into regions, with each region comprising a set of content servers that preferably operate in a peer-to-peer manner and share data across a common backbone such as a local area network (LAN). The inventive routing technique enables an edge server operating within a given CDN region to retrieve content (cacheable, non-cacheable and the like) from an origin server more efficiently by selectively routing through the CDN's own nodes, thereby avoiding network congestion and hot spots. The invention enables an edge server to fetch content from an origin server through an intermediate CDN server or, more generally, enables an edge server within a given first region to fetch content from the origin server through an intermediate CDN region. As used herein, this routing through an intermediate server, node or region is sometimes referred to as “tunneling.”

Reduction of administrative overhead in maintaining network information, rapid convergence on an optimal routing path through the data network, and utilization of only required network resources are realized by a novel method for establishing a call path between network users. The method is based upon deployment of a network information server that stores network topology information and that is addressable by each end user. In this method, the network information server receives a request to establish a call path. The request identifies at least the calling party. In response to the request, the network information server determines a network traversal between the calling party and a root network wherein the network traversal includes call path information about the sub-networks between the calling party and the root network. The request for establishing a call path can also identify the called party. Based on the calling and called party identification, the network information server also determines a second network traversal between the called party and the root network. The second network traversal is sent to either the calling party or the called party or to both the calling and called parties. The server can determine an intersection of the traversals and send the intersection information to the parties. The intersection information is known as a merge point and represents an optimal call path between the parties.

A wireless network, which includes a wireless router client operable to broadcast data packets to at least one wireless server and one additional wireless client. Each client and server includes programs for determining optimum routes between them. The client also includes a program for determining if a received data packet is not addressed to it and if the packet has been sent via a new optimal route unknown to the client, and for notifying the respective server of such a new optimal route.

A system and method for virtual link aggregation for combining network links of various types and speeds to increase throughput and reliability for packetized transport. In contrast with physical port trunking, the system does not require direct control over ports or network interfaces. Instead, the system rewrites packet addresses and works through existing networking equipment, without requiring any new or special protocols, processing, or equipment within the network. The system works through low-level rerouting by rewriting hardware addresses and / or high-level routing by rewriting logical addresses. Thus packets are redirected through multiple routes to a common destination via alternate gateways and links. Different algorithms may be employed to balance the load on each link and determine an optimal route for each packet. Embodiments may also employ packet flow or stream identification and thereby only provide link aggregation for a specified set of packet flows.

Some embodiments implement systems and methods to monitor CDN performance from the end user's perspective. To achieve full end-to-end monitoring, the systems and methods monitor the performance of Anycast routing for routing an end user to the optimal PoP of the CDN and monitor the performance of different routes that deliver content from the optimally selected PoP back to the end user. Systems and methods are also provided to leverage the monitored performance in order to automatically optimize the performance of the CDN by optimizing or modifying Anycast routing and by performing route grooming as needed to ensure that the optimal route is selected to deliver content to different sets of end users that request content from a particular PoP.

A traffic incidents processing system for sharing real time traffic information between a plurality of users connected via a network. The system includes a central computer system, operatively connected to a wide area network such as the Internet, a multiplicity of mobile communication devices, capable of determining their geographical location, and are operatively connected to a wide area network such as the Internet, and are capable of transmitting location based traffic information to the said central computer system. The central computer system continuously maintains updated database of traffic information. The central computer system is capable of analyzing, screening and assessing the reliability of the traffic information, detect a traffic situation, and provide customized, real time traffic alerts to a plurality of users connected to a network and to mobile communication devices such as cellular telephones via the wide area network as well as via short messaging service SMS, multimedia messaging system MMS, or any other data protocol capable of communicating with mobile devices. The central computer system is further capable of storing a history of routes traveled by users, and determine an optimal route from any originating point to any destination point by analyzing the stored routes and construct the optimal route using the most frequently traveled segments found in the stored routes database, and the realtime traffic information that is known to the system.

A method provides a sequence of travel instructions that reports fuel-efficient routes calculated with regard to vehicle specifications, geography of terrain, and complexity of travel route. An operator selects the desired starting and ending location via a client interface of a software application. When the user selects “most fuel efficient route,” the fuel-efficient route (FER) utility of the application prompts for entry of the make, model, and year of the operator's vehicle. If the FER utility is embedded in an in-car navigation system, the information about the vehicle characteristics is preprogrammed during installation (e.g., at the factory). The FER utility uses a number of metrics and the vehicle's characteristics, to generate an optimal route for efficient fuel consumption. The invention provides means for an operator of a route planning application to optimize the driving directions for optimally predicted fuel usage.

A method, system and program product for utilization within a client that provides an optimal connection between the client and a network. The method, system and program product provides a graphical user interface for receiving user selection and connection requests and a connection utility for connecting the client system with a selected server of the network. The selected server and connection route is dynamically selected from a plurality of servers in response to the receipt of a connection request, based on a determination of a best route for completing the connection request. The client is provided with multiple connection media and the determination of the best route includes a selection of the connection medium to utilize for the connection. Also, a table of connection information is stored within the client and utilized in evaluating which connection route is optimal.

A wireless network, which includes a wireless router client operable to broadcast data packets to at least one wireless server and one additional wireless client. Each client and server includes programs for determining optimum routes between them. The client also includes a program for determining if a received data packet is not addressed to it and if the packet has been sent via a new optimal route unknown to the client, and for notifying the respective server of such a new optimal route.

A mobile ad-hoc network system includes: a plurality of mobile terminals; and a central control means for setting an optimal route among terminals, performing connection with an infrastructure network and connecting networks using different wireless access technologies. By including the central control means, the ad-hoc network system can overcome the limitation of the related art ad-hoc network and provide a network service with high quality and stability to each terminal.

A routing mechanism, service or system operable in a distributed networking environment. One preferred environment is a content delivery network (CDN) wherein the present invention provides improved connectivity back to an origin server, especially for HTTP traffic. In a CDN, edge servers are typically organized into regions, with each region comprising a set of content servers that preferably operate in a peer-to-peer manner and share data across a common backbone such as a local area network (LAN). The inventive routing technique enables an edge server operating within a given CDN region to retrieve content (cacheable, non-cacheable and the like) from an origin server more efficiently by selectively routing through the CDN's own nodes, thereby avoiding network congestion and hot spots. The invention enables an edge server to fetch content from an origin server through an intermediate CDN server or, more generally, enables an edge server within a given first region to fetch content from the origin server through an intermediate CDN region.

A navigation aide device is disclosed that is capable of conveying traveling instructions to a user in possession of the device to allow the user to navigate from a predetermined source position on a predetermined road map, containing road information, to a predetermined destination position on the map, along an optimal road route, under control of travel instructions spoken by the device. Preferably the device includes a position sensor for sensing position of the device and reporting that position, a text to speech converter, a sound conveying device (such as a speaker and associated amplifier) operably connected to the text to speech converter for conveying speech to the user. The device further includes memory for storing a predetermined road map containing road information and a controller. The controller is operably connected to the position sensor, text to speech converter and map memory. The controller calculates an optimal road route between the source position and the destination position, generates a series of text road travel instructions that describe the optimal route in terms of associated road information, receives the report of position by the position sensor during travel, calculates the speed of the device and its direction of travel from the positions reported by the position sensor and determines the road map position corresponding to the reported position based on the position reported, the calculated speed, the calculated direction of travel and the road information. The controller also conveys the series of text road instructions to the text to speech converter. Based on the road map position determined, the controller causes the text to speech converter to convey to the sound conveying device each of the series of text road instructions at a time before the travel has reached the map position corresponding to the particular text road instruction such that the user hears relevant road travel instructions in substantially a timely manner.

The invention discloses a carpooling system and method for matching information through a route segmenting method. The carpooling system comprises a mobile passenger terminal, a mobile driver terminal, a website platform, a car hire managing and dispatching system and a communication module, wherein the mobile passenger terminal, the mobile driver terminal, the website platform and the car hire managing and dispatching system communicate with one another through the communication module. Based on a common computing and matching method, in order to achieve matching of same-direction carpool information to the maximum extent, a vehicle route is matched by adopting a full-route coordinate segmenting way to help a passenger to match the optimal route and the predicted arrival time of a vehicle going in the same direction. The carpooling system is applied to a mobile terminal product and an Internet platform, and has a greater same-direction carpooling matching range, more optimized matching accuracy and zero error rate, thereby directly improving the carpooling matching success rate; the carpooling system has the characteristics of energy conservation, low carbon and environment friendliness, simultaneously reduces the pressure of public transport, and relieves traffic congestion to a certain extent.

A spanning tree cross-route protocol for establishing mesh-like cross routes in an underlying wireless spanning tree topology. A cross route spans branches of the tree topology to provide a more optimal route between any two nodes in the wireless network. The cross route can span multiple spanning trees. Each mesh node maintains a cross route table. When a packet is received, the node determines whether there is an entry for the destination node in the cross route table. If there is an entry for the destination node in the cross route table, the packet is forwarded via the cross route; otherwise, the packet is forwarded via the spanning tree.

Embodiments of the present invention describe systems and methods for automatically generating route(s) based on users' trip intent and conditions. A user enters his / her trip intent and conditions. A context-sensitive route generation system generates one or more routes based on information surrounding the user's trip intent, such as destination, time, means of transportation, purpose and identity(ies) of traveler(s), and conditions, such as user's limitations, needs, and preferences, for the user. Once the user chooses a route to follow, context-sensitive route generation system (CRGS) keeps track of user's movement and can modify the user's route when a need arises. The CRGS searches one or more networks and the system database(s) for profile and real-time (or instant) information for route generation, and continues to mine networks for information related to the trip to ensure the best route is recommended to the user. In one embodiment, profile and real-time information relevant to the trip is used in generating and modifying the route. In addition to generation, monitoring and updating route(s) for the user, the CRGS also can present advertisements of interest to the user for business and services along user's route.

A method and system for managing the routing of traffic within a network develops a topological address space map of the network to enable a “best route” selection process. The network is comprised of a backbone connected to a plurality of peering partners. Points on the network monitor traffic flows. A central facility analyzes the traffic flows and routes within the network and performs intelligent routing management.Intelligent routing management ensures that traffic is properly routed through preferred routes on the network, and avoids inefficient routing. Intelligent routing management also selects new routes to be injected into the network in order to further improve the accuracy of the address space map of the network. Intelligent routing management ensures that bandwidth is requested and delivered topologically closely to peering partner networks, and that traffic is carried by the backbone for long haul data distribution in both directions.

This invention extends routing mechanisms that use link metrics for route selection so that: A link metric cross correlation vector is determined for all links, where each element in the vector corresponds to some other link, and reflects the change in the link metric value if a data flow would already use this other link. The invention further describes a specific embodiment where all cross-correlating links are adjacent to each other, i.e., they terminate or originate in a common node. A mechanism is described to create an extended routing graph. This extended graph permits the use of standard polynomial time algorithms that simultaneously construct the optimal route and find the optimal route metric (such as shortest-path algorithms) also for the adjacent link cross-correlating case.

An apparatus and method for facilitating a shopping experience. A user creates and stores a shopping list in a mobile terminal. Upon entering a shop, the mobile terminal downloads a shopping mini-application, which checks item availability and provides recommended substitute and complimentary items preferably taking user profile information into consideration. The mobile terminal also provides the user with reminders based on the user's purchasing history. Special offers are also presented to the user. Once the shopping list has been finalized, an optimal shopping route is computed for gathering the items on the list and is displayed to the user in the form of a map. The optimal route and recommendations may be updated at any time throughout the shopping experience in response to either the user's request, modifications to the shopping list and / or the user's divergence from the optimal route. The mini-application automatically may be deleted at the POS to conserve memory space.

In one embodiment, a computer readable medium comprises at least first instructions and second instructions. The first instructions, when executed, compute a first plurality of routes. Each route of the first plurality of routes corresponds to a respective net of a plurality of nets in an integrated circuit layout, and represents a theoretically optimal route of the respective net according to a graph theory based algorithm. The second instructions, when executed, compare each of the first plurality of routes to a corresponding route of a current plurality of routes, each of the current plurality of routes corresponding to the respective net of the plurality of nets and currently existing in the integrated circuit layout. A method is also contemplated.

The invention provides for path optimization for routing of a communication session in a network having a plurality of core networks coupled to a plurality of access networks. Both a core network and an access network perform the path optimization by determining a plurality of possible paths to a plurality of target access points to form a target matrix, determining a corresponding route preference factor for each possible path of the target matrix, and selecting, from the target matrix, a possible path having an optimal route preference factor. An overall or complete path, for routing of the communication session, is then determined either by combining the selected possible paths, or by selecting one possible path as a complete path. The route preference factor, for each possible path, is determined based upon various routing variables, such as quality of service, bandwidth for the communication session, route complexity, interconnect cost, routing cost; resource loading, resource availability, and operator preference for traffic biasing.

A computer assisted navigation system determines a recommended route for a vehicle to travel between a source and destination location, and provides exception notifications in some events where the vehicle travels a route different that the recommended route. The vehicle includes a navigation system that has a location monitoring component. It is determined if the location of the vehicle is different than a location along the recommended route. An exception notification is generated when the vehicle is not along the recommended route it is likely that the reason the recommended route was not used is because the recommended route is not the optimal route between the source and destination locations.

Compliance with subscriber job delivery requirements is managed and tracked. Job requirements set forth in service level agreements are stored electronically as delivery parameters. A queue manager creates a prioritized list of delivery jobs. A delivery manager delivers the jobs in accordance with the prioritized list. A routing manager determines optimal routes, e.g., least cost route for delivery of each job. Retries of jobs that are not successfully delivered can be performed. delivery job sources include broadcast subscribers, high- and low-priority single address subscribers, free subscribers and off-peak subscribers.

A system and method for real time dispatching of vehicles taking into account multiple point to point transport requests and conditions including desired ride conditions, traffic, and infrastructure. Analysis of these factors is using suitable algorithms in order to determine optimal routes.

A system for routing an interaction request based on skill presence reporting has a routing application for determining best routing for the interaction request, a data store for storing and reporting skills data, and an object-oriented interface for presenting skills views including state information of those skills. The system is characterized in that it determines any skills requirements of the interaction request to be routed and discovers which skills of considered routing destinations are available at the time of routing, and routes the interaction according to the available skills discovered and matching the skills requirement, the available skills intrinsic to one or more than one routing destination selected to process the interaction.

Disclosed is an intelligent parking guiding system based on guidance of a quadrotor unmanned plane. The system includes a parking lot and is characterized in that the quadrotor unmanned plane is capable of detecting and recording parking-space parking state of the parking lot through an ultrasonic detector carried by the quadrotor unmanned plane; a vehicle sends a signal to the detector so that the detector is enabled to sense the position of the vehicle in the parking lot; and the quadrotor unmanned plane guides the vehicle to enter the parking lot in an optimal route after receiving the signal. The intelligent parking guiding system based on guidance of the quadrotor unmanned plane uses the quadrotor unmanned plane to detect the real-time vehicle state of the parking lot and then calculates an optimal route for parking so that the vehicle is guided to drive into or drive out of the parking lot in the optimal route and thus time consumed in parking of the vehicle is saved.

A navigation system for a vehicle is presented that provides and utilizes monetary cost-related information. The navigation system may include a database system, calculation module, and comparison module. The database system stores path data and related monetary cost-related data, which include monetary costs that are route-depend and those that are not route-dependent. The calculation module determines routes to a destination, the monetary costs associated with the routes, and may determine the fastest, longest, and least expensive routes. The comparison module enables the determination of an optimal route based on various criteria, including monetary cost. The navigation system further includes methods for determining the monetary costs associated with a route, the travel time associated with a route, determining an optimal route, and for guiding the vehicle according to the monetary cost-related information.

The invention discloses a dynamic indoor region coverage division method and device for a mobile robot. The dynamic indoor region coverage division method at least includes that scanning each row of a raster map to divide the indoor region for two times, dividing the indoor region into an independent sub-region block and an independent region block, wherein the independent region block comprises a plurality of adjacent independent sub-region blocks; acquiring the topology planning sequence of the independent sub-region block and the topology planning sequence of each independent sub-region block of the independent region block based on a reverse searching mode and a minimum tree principle; acquiring the optimal route of the mobile robot in the indoor region based on a Dijkstra algorithm according to the topology planning sequences. The dynamic indoor region coverage division method and device for the mobile robot start from the environment cognition habits of the human to divide the indoor environment for two times, the completeness of the region with a certain function in the environment is guaranteed, and meanwhile, the region with a certain function is divided into the independent sub-regions where the mobile robot can walk; the dynamic indoor region coverage division method and device for the mobile robot conform to the robot thought.

The embodiment of the invention provides a carport guide system used for a parking lot. The carport guide system comprises a vehicle detection device, a signal acquisition device, a storage device, a second central controller and an indicator light turning-on device, wherein the vehicle detection device is used for detecting whether a vehicle prepares to enter the parking lot or not; the signal acquisition device is arranged at the entrance of the parking lot and used for collecting the license plate number of the vehicle when the vehicle prepares to enter the parking lot; the storage device is used for storing the carport information and route information of all the carports, and the carport information includes corresponding relationship between the license plate number and the carport; the second central controller comprises a first control unit and is used for obtaining the license plate number, collected by the signal acquisition device, of the vehicle entering the parking lot, determining the target parking space and the optimal route according to the corresponding relationship, and sending corresponding control information; and the indicator light turning-on device is used for receiving the control information and then turning on a corresponding indicator light so as to guide the vehicle to achieve the target parking space. The carport guide system saves the time for searching the parking space, and is simple, convenient and practical.