Sap Se

Isaac Eliassi

Or Igelka

Alex Drobinsky

Ran Bittmann

Itzhak Shoshan

Avi Rokach

Ahmad Haj Ali

Anna Gurayevskaya

Matan Mizrahi

Yan Vulich

A number of parking segments is defined as a plurality of areas for street parking. A request for parking within the plurality of parking segments is received that defines parking constraints. The request is for optimize navigation to search for a free parking spot. Parking segments that comply with the parking constraints are determined. Current values for probabilities to park for the parking segments are determined based on evaluation of collected data for parking events. The data may include both traffic data and data related to defined features that are associated with determining of probability values. A route for traversing the parking segments is determined. The route defines an optimized order for traversing according to the determined current value for the probabilities to park. Navigation instructions are provided for the determined optimized route in response to the received request.

Optimized generation of navigation instructions based on computed parking probability values

The present disclosure describes methods, systems, and computer program products for providing network traffic routing optimizations. One computer-implemented method includes calculating a direct connection cost for network traffic between two points in a network, the network including one or more nodes of an accelerated application delivery (AccAD) network, calculating an AccAD connection cost for the network traffic between the two points in the network using at least one node of the AccAD network, comparing the calculated direct connection cost and the AccAD connection cost, and determining whether the direct connection cost is greater than the sum of the AccAD connection cost and a minimum cost threshold value.

Network traffic routing optimization

Growing community of inventors

Raanana, Israel

Isaac Eliassi