Network communication system and method of dynamic routing

• US 7,020,138 B2
• Filed: 01/16/2001
• Issued: 03/28/2006
• Est. Priority Date: 07/28/2000
• Status: Active Grant

• Current Assignee: Acer, Inc., Wistron Corporation
• Original Assignee: Acer, Inc., Wistron Corporation
• Inventors: Huang, James
• Primary Examiner(s): Kizou, Hassan
• Assistant Examiner(s): Cho, Hong Sol
• Application Number:
  US09/759,343
• Publication Number:
  US 20020034186A1
• Time in Patent Office: 1,897 Days
• Field of Search: 370/238, 370/252, 370/392, 370/411, 370396-401, 709238-242
• US Class Current: 370/392
• CPC Class Codes: H04L 45/00 Routing or path finding of packets in data switching networks routing or path finding in wireless networks H04W40/00
• CPC Class Codes: H04L 45/20 Hop count for routing purposes, e.g. TTL
• CPC Class Codes: H04L 45/26 Route discovery packet
• CPC Class Codes: H04L 45/34 Source routing

Abstract

A system and method of dynamic routing is provided. When a connection cannot be built, execute the follows. (a) A sending-host transports messages to destination-host. If connection built, the method ends, otherwise go to step (b). (b) Find a series of routers, and put IP-addresses of routers into a list. (c) Judge whether list includes at least one IP-address; if yes, go to step (d), otherwise step (i). (d) A pointer points to the last. (e) Find a domain of IP-address pointed. (f) If a message-routing-in-charge host is found, go to step (g), otherwise step (h). (g) The sending-host transports messages to message-routing-in-charge host, and go to step (a). (h) If IP-address pointed is the first one, go to step (i), otherwise step (j). (i) The sending-host keeps messages for a period, and go to step (a). (j) Move pointer to point to the previous, and go to step (e).

Claims

1. A network communication system for efficiently determining a message-transporting path between a sending host and destination host on the Internet by finding a routing host when the sending host cannot effectively connect to the destination host, the system comprising:

a tracing means for finding a series of routers which can be effectively connected to between the sending host and destination host and successively putting the routers'"'"' IP addresses into a list;

a memory means for storing the list;

a pointing means for pointing a pointer to an IP address of the list;

a judging means for judging whether the list comprises at least one IP address and judging whether the IP address pointed by the pointer is the first IP address of the list; and

a searching means for finding a domain of the IP address pointed by the pointer and finding a message-routing-in-charge host in the domain;

wherein at the beginning, when the judging means judges that the list comprises at least one IP address, the pointing means moves the pointer to point to the last IP address of the list and when the searching means can not find the message-routing-in-charge host in the domain of the IP address pointed by the pointer, the pointing means moves the pointer to point to an IP address previous to that presently pointed in the list, wherein the pointing means continuously moves the pointer to point to a previous IP address until the searching means finds out the message-routing-in-charge host or the judging means judges that the pointed IP address is the first IP address of the list.

2. The system according to claim 1, wherein the tracing means uses a path-tracing program to find the series of routers between the sending host and the destination host;

the sending host sends an IP datagram having a time-to-live (TTL) field with a value of one to the destination host, and obtains an IP address of the first router by receiving an Internet control message protocol (ICMP) time-out message from the first router;

the sending host continuously sends an IP datagram having a TTL field with a value repeatedly increased by one in order to obtain the IP address of the series of routers which can be effectively connected until the sending host does not receive any ICMP time-out message.

3. The system according to claim 1, wherein the searching means uses the Domain Name Service (DNS) to find the domain of the IP address pointed by the pointer and uses an IP address of a message-routing host registered beforehand in the Well Know Service (WKS) Record of the DNS as a way of querying the WKS record to find the IP address of the message-routing-in-charge host.

4. The system according to claim 1, wherein the searching means uses the DNS to find the domain of the IP address pointed by the pointer and uses the property of regarding a name of message-sending service as an alias of the message-routing host to find the IP address of the message-routing-in-charge host by using the name of the message-sending service as a querying name.

5. A method for efficiently determining a message-transporting path between a sending host and destination host on the Internet by finding a routing host when the sending host cannot effectively connect to the destination host, the system comprising:

(a) finding a series of routers which can be effectively connected to between the sending host and destination host and successively putting the routers'"'"' IP addresses into a list;

(b) storing the list;

(c) pointing a pointer to an IP address of the list;

(d) judging whether the list comprises at least one IP address and judging whether the IP address pointed by the pointer is the first IP address of the list; and

(e) finding a domain of the IP address pointed by the pointer and finding a message-routing-in-charge host in the domain;

wherein, when judging whether the list comprises at least one IP address, moving the pointer to point to the last IP address of the list and if the message-routing-in-charge host in the domain of the IP address pointed by the pointer cannot be found, moving the pointer to point to an IP address previous to that presently pointed in the list, and continuously moving the pointer to point to a previous IP address until the message-routing-in-charge host is found or determining that the pointed IP address is the first IP address of the list.

6. The method according to claim 5, wherein step b uses a path-tracing program to find the series of routers between the sending host and the destination host;

the sending host sends an IP datagram having a time-to-live (TTL) field with a value of one to the destination host, and obtains an IP address of the first router by receiving an Internet control message protocol (ICMP) time-out message from the first router;

the sending host continuously sends an IP datagram having a TTL field with a value repeatedly increased by one in order to obtain the IP addresses of the series of routers which can be effectively connected to until the sending host cannot receive any ICMP time-out message.

7. The method according to claim 5, wherein the step e uses the Domain Name Service (DNS) to find the domain of the IP address pointed by the pointer.

8. The method according to claim 5, further comprising using an IP address of a message-routing host registered beforehand in the Well Know Service (WKS) record of the DNS as a way of querying the WKS record to find the IP address of the message-routing-in-charge host.

9. The method according to claim 5, further comprising using the property that a name of message-sending service can be regarded as an alias of the message-routing host to find the IP address of the message-routing-in-charge host by regarding the name of message-sending service as a querying name.

10. The method according to claim 5, further comprising, if the list does not contain an IP address, keeping the message in the sending host for a predetermined time, then proceeding to step a.