TRAFFIC MANAGEMENT SYSTEM

• US 20170250896A1
• Filed: 02/28/2016
• Published: 08/31/2017
• Est. Priority Date: 02/28/2016
• Status: Active Grant

• Current Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Original Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Inventors: PUNJANI, Megha, DIXITH, Maheshwari
• Granted Patent: US 10,491,507 B2
• Time in Patent Office: Days
• CPC Class Codes: H04L 45/121 by minimising delays

Abstract

In one embodiment, a traffic management system includes an input/output sub-system to receive route search requests from client devices, and a CPU to search a route database for a suitable match for the route search requests yielding routes. The input/output sub-system is operative to receive data related to traffic levels along the routes. The CPU is operative to calculate a score for each route, select N quickest routes, and allocate the N quickest routes among the client devices. A first and second client device are allocated a first and second quickest route from the N quickest routes, respectively, the first and second quickest route having a first and second score, respectively. The second score is different to the first score. The input/output sub-system is operative to send to each client device data about the route allocated to that client device. Related apparatus and methods are also described.

Claims

1. A traffic management system comprising:

an input/output sub-system to receive a plurality of route search requests from a plurality of client devices; and

a central processing unit to search a route database for a suitable match for the plurality of route search requests yielding a plurality of routes, wherein;

the input/output sub-system is operative to receive data related to traffic levels along the plurality of routes;

the central processing unit is operative to;

calculate a score for each one route of the plurality of routes, the score representing an estimated journey time along the one route based on the data related to traffic levels along the one route;

select N quickest routes from the plurality of routes based on the score of each one route of the plurality of routes; and

allocate the N quickest routes among the plurality of client devices, wherein;

only one quickest route of the N quickest routes is allocated to each one of the plurality of client devices;

a first client device of the plurality of client devices is allocated a first quickest route from the N quickest routes, the first quickest route having a first score; and

a second client device of the plurality of client devices is allocated a second quickest route from the N quickest routes, the second quickest route having a second score which is different to the first score; and

the input/output sub-system is further operative to send to each one client device of the plurality of client devices data about the one quickest route allocated to the one client device.

2. The system according to claim 1, wherein the first quickest route having the first score and the second quickest route having the second score are based on the same traffic input data.

3. The system according to claim 1, wherein the central processing unit is operative to select the N quickest routes from the plurality of routes by selecting routes from the plurality of routes having a score within a predetermined measure from the score of one route of the plurality routes having a shortest estimated journey time along the one route.

4. The system according to claim 1, wherein the central processing unit is operative to allocate the N quickest routes among the plurality of client devices according to the score of each of the N quickest routes.

5. The system according to claim 4, wherein the central processing unit is operative to allocate the N quickest routes among the plurality of client devices in proportion to the score of each of the N quickest routes.

6. The system according to claim 4, wherein the central processing unit is operative to allocate the N quickest routes among the plurality of client devices inversely proportional to the score of each of the N quickest routes.

7. The system according to claim 1, wherein the central processing unit is operative to calculate the score for each one route of the plurality of routes based on the data related to traffic levels and incoming route search requests.

8. The system according to claim 1, wherein the central processing unit is operative to calculate a score for each one route of the plurality of routes based on the data related to traffic levels and allocation of incoming route search requests among the plurality of routes by the central processing unit.

9. The system according to claim 1, wherein the central processing unit is operative to calculate a score for each one route of the plurality of routes based on the data related to traffic levels and an estimate of assignment of incoming route search requests, received by one or more systems external to the traffic management system, among the plurality of routes.

10. The system according to claim 9, wherein central processing unit is operative to estimate the assignment of the incoming route search requests received by the one or more systems external to the routing planning system based on a number of incoming route search requests received by the input/output sub-system.

11. A traffic management method comprising:

receiving a plurality of route search requests from a plurality of client devices;

searching a route database for a suitable match for the plurality of route search requests yielding a plurality of routes;

receiving data related to traffic levels along the plurality of routes;

calculating a score for each one route of the plurality of routes, the score representing an estimated journey time along the one route based on the data related to traffic levels along the one route;

selecting N quickest routes from the plurality of routes based on the score of each one route of the plurality of routes;

allocating the N quickest routes among the plurality of client devices, wherein;

only one quickest route of the N quickest routes is allocated to each one of the plurality of client devices;

a first client device of the plurality of client devices is allocated a first quickest route from the N quickest routes, the first quickest route having a first score; and

a second client device of the plurality of client devices is allocated a second quickest route from the N quickest routes, the second quickest route having a second score which is different to the first score; and

sending to each one client device of the plurality of client devices data about the one quickest route allocated to the one client device.

12. The method according to claim 11, wherein the first quickest route having the first score and the second quickest route having the second score are based on the same traffic input data.

13. The method according to claim 11, wherein the selecting the N quickest routes from the plurality of routes includes selecting routes from the plurality of routes having a score within a predetermined measure from the score of one route of the plurality routes having a shortest estimated journey time along the one route.

14. The method according to claim 11, wherein the allocating includes allocating the N quickest routes among the plurality of client devices according to the score of each of the N quickest routes.

15. The method according to claim 14, wherein the allocating includes allocating the N quickest routes among the plurality of client devices in proportion to the score of each of the N quickest routes.

16. The method according to claim 14, wherein the allocating includes allocating the N quickest routes among the plurality of client devices inversely proportional to the score of each of the N quickest routes.

17. The method according to claim 11, wherein the calculating includes calculating the score for each one route of the plurality of routes based on the data related to traffic levels and incoming route search requests.

18. The method according to claim 11, wherein the calculating includes calculating the score for each one route of the plurality of routes based on the data related to traffic levels and allocation of incoming route search requests among the plurality of routes.

19. The method according to claim 11, wherein:

the traffic management method is implemented in a traffic management system; and

the calculating includes calculating the score for each one route of the plurality of routes based on the data related to traffic levels and an estimate of assignment of incoming route search requests, received by one or more systems external to the traffic management system, among the plurality of routes.

20. The method according to claim 19, further comprising estimating the assignment of the incoming route search requests received by the one or more systems external to the routing planning system based on a number of incoming route search requests received by the routing planning system.