Method and system for improving a route along which data is sent using an ip protocol in a data communications network

• US 20040199664A1
• Filed: 01/05/2004
• Published: 10/07/2004
• Est. Priority Date: 07/04/2001
• Status: Abandoned Application

• Current Assignee: Ilya Yulish, Mark Shvartser, Mordecai Feldman, Sergei Ivanov
• Original Assignee: Ilya Yulish, Mark Shvartser, Mordecai Feldman, Sergei Ivanov
• Inventors: Feldman, Mordecai, Yulish, Ilya, Shvartser, Mark, Ivanov, Sergei
• Application Number:
  US10/482,665
• Publication Number:
  US 20040199664A1
• Time in Patent Office: Days
• US Class Current: 709/238
• CPC Class Codes: H04L 45/02 Topology update or discovery
• CPC Class Codes: H04L 45/34 Source routing
• CPC Class Codes: H04L 45/70 Routing based on monitoring results

Abstract

A method and system for improving a route between a source node (24) and a target node (25) between which data is sent using an IP protocol in a data communications network (20) having a plurality of interconnected nodes (22) defining a plurality of possible routes (23) between the source node and the target node. For all available nodes in at least a portion of the network spanning the source node and the target node, a respective IP address and status is obtained dynamically together with their respective intercon-nections if viable. An improved route between the source node and a route node connected to the target node is determined dynamically and corresponding IP addresses are identified of improved route nodes spanning the improved route. The IP addresses are dynamically conveyed to the source node for allowing the source node to embed at least some of the IP addresses in the data so as to allow successive ones of the improved route nodes to which the data is routed to route the data to an adjacent one of the improved route nodes. This may be done by using the loose source routing feature supported by the IP protocol.

Claims

1. A method for conveying data along an improved route from a source node (24) to a target node (25) between which data is sent using an IP protocol in a data communications network (20) having a plurality of interconnected nodes (22) defining a plurality of possible routes (23) between the source node and the target node, said method comprising:

(a) obtaining corresponding IP addresses of improved route nodes spanning said improved route, and

(b) embedding at least some of said IP addresses in said data so as to allow successive ones of said improved route nodes whose IP addresses are embedded in the data and which receive the data to route the data to an adjacent one of the improved route nodes.

2. The method according to claim 1, further comprising:

(c) conveying the IP addresses to the source node for allowing the source node to embed at least some of said IP addresses in said data.

3. The method according to claim 1 or 2, wherein (a) includes dynamically monitoring at at least one location at least a portion of the network.

4. The method according to claim 3, wherein the operation of dynamically monitoring includes:

i) determining whether each node in a node map of at least said portion of the network is available,

ii) determining whether interconnections between adjacent available nodes are viable, and

iii) obtaining information indicative of changes to a status of nodes and interconnections in the network so as to allow said changes to be reflected in the improved route.

5. The method according to claim 4, wherein obtaining information indicative of changes to a status of nodes and interconnections in the network includes sending a probe signal through the network so as to provide information relating to nodes probed thereby.

6. The method according to claim 4 or 5, wherein said information is received from at least one Internet service provider.

7. The method according to claim 3, further including:

(d) receiving from at least one Internet service provider external information indicative of constraints to be applied to the route along which the data is to be conveyed so as to allow said constraints to be reflected in the improved route.

8. The method according to any one of claims 1 to 7, wherein prior to operation (a) there is included the operation of mapping the network so as to obtain a node map of at least said portion of the network including all nodes and their respective interconnections therein.

9. The method according to any one of claims 1 to 8, further including:

(e) obtaining information indicative of changes to the network so as to allow said changes to be reflected in said node map.

10. The method according to claim 9, wherein said information is received from at least one Internet service provider.

11. The method according to any one of claims 1 to 10, wherein the corresponding IP addresses of improved route nodes spanning said improved route are received from a routing server (28) coupled to the source node.

12. The method according to any one of claims 1 to 10, wherein the corresponding IP addresses of improved route nodes spanning said improved route are identified from an improved route fed to the source node.

13. The method according to claim 11, wherein the data communications network is a Virtual Private Network and the routing server is a logical device coupled to the source node.

14. The method according to claim 17, wherein the source node receives from the target node a request that includes the corresponding IP addresses of improved route nodes spanning said improved route.

15. The method according to claim 14, wherein the target node receives the corresponding IP addresses of improved route nodes spanning said improved route from a routing server.

16. The method according to claim 11, wherein the target route node is connected to the target node and (a) includes:

i) receiving respective IP addresses of route nodes along respective improved routes between the source node and each route node connected thereto or a subset thereof, and

ii) identifying the respective improved route between the source node and the target route node.

17. The method according to any one of claims 1 to 16, wherein embedding at least some of said IP addresses in said data is achieved using source routing or loose source routing.

30. A computer program comprising computer program code means for performing all the steps of any of claims 1 to 17 when said program is run on a computer.

31. A computer program as claimed in claim 30 embodied on a computer readable medium.

18. A routing server (28) for improving a route between a source node (24) and a target node (25) between which data is sent using an IP protocol in a data communications network (20) having a plurality of interconnected nodes (22) defining a plurality of possible routes (23) between the source node and the target node, said routing server comprising:

a monitoring unit (35) for dynamically obtaining a respective IP address and status of all available nodes in at least a portion of the network spanning the source node and the target node and their respective interconnections if viable,

a route determination unit (36) coupled to the monitoring unit for dynamically determining an improved route between the source node and the target node and identifying corresponding IP addresses of improved route nodes spanning said improved route, and

a communication unit (37) coupled to the route determination unit for dynamically conveying the IP addresses to the source node for allowing the source node to embed at least some of said IP addresses in said data so as to allow successive ones of said improved route nodes to which the data is routed to route the data to an adjacent one of the improved route nodes thus allowing the improved route nodes to be determined remote from the source node.

19. The routing server according to claim 18, wherein the monitoring unit dynamically monitors at at least one location at least said portion of the network spanning the source node and the target node.

20. The routing server according to claim 18, wherein the monitoring unit (35) includes:

a node availability unit (41) responsive to a node map of at least said portion of the network for determining whether each node in the node map is available, and

a node interconnection unit (42) coupled to the node availability unit for determining whether interconnections between adjacent available nodes are viable.

21. The routing server according to any one of claims 18 to 20, further including at least one Internet service provider for providing information indicative of constraints to be applied to the route along which the data is to be conveyed so as to allow said constraints to be reflected in the improved route.

22. The routing server according to any one of claims 18 to 21, further including a network mapping unit (44) for mapping the network so as to obtain said node map of at least said portion of the network including all nodes and their respective interconnections therein.

23. The routing server according to any one of claims 18 to 22, further including:

a status update unit (43) coupled to the node availability unit and to the node interconnection unit for receiving information indicative of changes to a status of nodes and interconnections in the network so as to allow said changes to be reflected in the improved route.

24. The routing server according to claim 23, including at least one Internet service provider for providing said information.

25. The routing server according to any one of claims 18 to 24, wherein said IP addresses are embedded in said data using source routing or loose source routing.

26. A computer (27) for fetching data along an improved route from a source node (24) using an IP protocol in a data communications network (20) having a plurality of interconnected nodes (22) defining a plurality of possible routes (23) between the source node and the computer, said computer comprising:

a node address receiver unit (50) for receiving from a routing server (28) coupled to the source node (24) corresponding IP addresses of improved route nodes spanning said improved route, and

a route address unit (50) coupled to the node address receiver unit for embedding at least some of said IP addresses in said data so as to allow successive ones of said improved route nodes to which the data is routed to route the data to an adjacent one of the improved route nodes.

27. The computer according to claim 26, wherein said IP addresses are embedded in said data using source routing and loose source routing.

28. The computer according to claim 26 or 27, wherein the target route node is directly connected to the target node via one of the route nodes in said subset and the node address receiver unit includes:

a route node address unit (53) for receiving respective IP addresses of route nodes along respective improved routes between the source node and each route node connected thereto or a subset thereof, and

a route identifier unit (55) coupled to the route node address unit (53) for identifying the respective improved route between the source node and the target route node.

29. The computer according to claim 26, wherein the target route node is indirectly connected to the target node via one of the route nodes in said subset and the node address receiver unit includes:

a route node address unit (53) for receiving respective IP addresses of route nodes along respective improved routes between the source node and each route node connected thereto or a subset thereof,

a target route node identifier unit (54) coupled to the route node address unit for determining the IP address of the improved route node that is closest to the target node, and

a route identifier unit (55) coupled to the target route node identifier unit for identifying the respective improved route between the source node and the target route node.