US6130889A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Determining and maintaining hop-count for switched networks
Assignee: International Business Machines Corp
•
Filing: 1997-09-30
•
Granted: 2000-10-10
•
Expires: 2017-09-30
Abstract
Abstract This invention discloses a way to map IP or similar routing information onto a technology that uses label switching and swapping, such as ATM, without the need to change the network paradigm. This allows a network to continue to function and appear as a standard IP network, but with much higher performance. One of the requirements of IP networks is to decrement the IP packet Time-To-Live (TTL) field on each hop it traverses. Currently, switched packets within an ATM like network cannot decrement the TTL. This invention can decrement packet TTLs appropriately by maintaining a hop-count per each switched path. This hop-count maintains the total number of hops a packets would have traversed, had it been forwarded in the IP hop-by-hop model, rather than through the ATM like switched path. Before forwarding a packet on a switched path, an ingress ISR decrements the TTL by the hop-count. In this way, at the switched path exit point, the TTL is the same as if it had been forwarded by IP. If the decrement value is greater than or equal to the TTL of the packet, the packet may be forwarded hop-by-hop; in this situation, the packet will be discarded at the correct IP node, rather than being switched through the ATM like network. This hop-count is calculated by virtue of the fact that each switched path is initiated by the egress node, and the establish (or set-up) message traverses the network hop-by-hop until each ingress node is reached. The switched path establishment message includes a hop-count field, which is incremented at each node that processes the establishment message. Thus, at the ingress node, the received hop-count is equal to the total number of hops to the egress point.
Inventors
- 👤 Nancy Karen Feldman
- 👤 Arun Viswanathan
- 👤 Richard M. Woundy
- 👤 Richard H. Boivie
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-01 21:01
CPC Classifications
H; H04; H04L; H04L45/00; H04L45/02; H04L45/04; H04L12/00; H04L12/28; H04L12/46; H04L12/4604; H04L12/4608; H04L12/54; H04L12/56; H04L12/5601; H04L45/10; H04L45/12; H04L45/22; H04L45/24; H04L45/245; H04L45/50; H04L49/00; H04L49/60; H04L49/602; H04L49/606; H04L69/00; H04L69/16; H04L69/161; H04L69/168; H04Q; H04Q11/00; H04Q11/04; H04Q11/0428; H04Q11/0478; H04L2012/5619; H04L2012/562; H04L2012/5629; H04L2012/563; H04L2012/5638; H04L2012/5665; H04L2012/5667; H04L45/243; H04L49/20; H04L49/201; H04L49/205; H04L49/30; H04L49/3009; Y; Y02; Y02D; Y02D30/00; Y02D30/50
Claims Analysis
Total Claims: 14
Claim 1
Independent Claim
126 words
A method of forwarding a data unit on a switched connection within a network of nodes while maintaining a correct hop-count within said data unit, said data unit having a header with a hop-count value therein, said method comprising: a) each forwarding node storing thereat information on the number of nodes from the forwarding node along said switched connection, said information including the total number of nodes from said forwarding node to an end of said switched connection, b) decrementing the hop-count value in said data unit header by said stored information when the hop-count value within said data unit header is greater than the stored information on the number of nodes along said switched connection, and c) forwarding said data unit along said switched connection.
Claim 2
Independent Claim
126 words
A method of forwarding a data unit on a switched connection within a network of nodes while maintaining a correct hop-count within said data unit, said data unit having a header with a hop-count value therein, said method comprising: a) each forwarding node storing thereat information on the number of nodes from the forwarding node along said switched connection, said information including the total number of nodes from said forwarding node to an end of said switched connection, b) decrementing the hop-count value in said data unit header by said stored information when the hop-count value within said data unit header is greater than the stored information on the number of nodes along said switched connection, and c) forwarding said data unit along said switched connection.
Claim 3
Independent Claim
124 words
A method of forwarding a data unit within a network of nodes while maintaining a correct hop-count within said data unit, said data unit having a header with a hop-count therein, said method comprising: a) each forwarding node storing thereat information on the number of nodes from the forwarding node along said switched connection, said information including the total number of nodes from said forwarding node to an end of said switched connection, b) decrementing the hop-count value in said data unit header by one when the hop-count value within said data unit is less than or equal to the stored information on the number of nodes along said switched connection, and c) forwarding said data unit to the next hop towards the destination.
Claim 4
Independent Claim
124 words
A method of forwarding a data unit within a network of nodes while maintaining a correct hop-count within said data unit, said data unit having a header with a hop-count therein, said method comprising: a) each forwarding node storing thereat information on the number of nodes from the forwarding node along said switched connection, said information including the total number of nodes from said forwarding node to an end of said switched connection, b) decrementing the hop-count value in said data unit header by one when the hop-count value within said data unit is less than or equal to the stored information on the number of nodes along said switched connection, and c) forwarding said data unit to the next hop towards the destination.
Claim 5
Independent Claim
105 words
A method of forwarding a data unit within a network of nodes while maintaining a correct hop-count within said data unit, said data unit having a header with a hop-count therein, said method comprising: a) each forwarding node storing thereat information on the number of nodes from the forwarding node along said switched connection, said information including the total number of nodes from said forwarding node to an end of said switched connection, and b) discarding said data unit when the hop-count value within said data unit is less than or equal to the stored information on the number of nodes along said switched connection.
Claim 6
Independent Claim
105 words
A method of forwarding a data unit within a network of nodes while maintaining a correct hop-count within said data unit, said data unit having a header with a hop-count therein, said method comprising: a) each forwarding node storing thereat information on the number of nodes from the forwarding node along said switched connection, said information including the total number of nodes from said forwarding node to an end of said switched connection, and b) discarding said data unit when the hop-count value within said data unit is less than or equal to the stored information on the number of nodes along said switched connection.
Claim 7
Dependent Claim
41 words
A method as set forth in claim 1, 2, or 3, wherein said data unit comprises an Internet Protocol (IP) packet having an IP header with a Time-To-Live (TTL) field, and wherein the TTL field is used as the hop-count value.
Claim 8
Dependent Claim
150 words
A program storage device readable by a computing machine, tangibly embodying a program of instructions executable by the machine to perform method steps of a method of forwarding a data unit on a switched connection within a network of nodes while maintaining a correct hop-count within said data unit, said data unit having a header with a hop-count value therein, said method comprising: a) each forwarding node storing thereat information on the number of nodes from the forwarding node along said switched connection, said information including the total number of nodes from said forwarding node to an end of said switched connection, b) decrementing the hop-count value in said data unit header by said stored information when the hop-count value within said data unit header is greater than the stored information on the number of nodes along said switched connection, and c) forwarding said data unit along said switched connection.
Claim 9
Dependent Claim
150 words
A program storage device readable by a computing machine, tangibly embodying a program of instructions executable by the machine to perform method steps of a method of forwarding a data unit on a switched connection within a network of nodes while maintaining a correct hop-count within said data unit, said data unit having a header with a hop-count value therein, said method comprising: a) each forwarding node storing thereat information on the number of nodes from the forwarding node along said switched connection, said information including the total number of nodes from said forwarding node to an end of said switched connection, b) decrementing the hop-count value in said data unit header by said stored information when the hop-count value within said data unit header is greater than the stored information on the number of nodes along said switched connection, and c) forwarding said data unit along said switched connection.
Claim 10
Dependent Claim
148 words
A program storage device readable by a computing machine, tangibly embodying a program of instructions executable by the machine to perform method steps of a method of forwarding a data unit within a network of nodes while maintaining a correct hop-count within said data unit, said data unit having a header with a hop-count therein, said method comprising: a) each forwarding node storing thereat information on the number of nodes from the forwarding node along said switched connection, said information including the total number of nodes from said forwarding node to an end of said switched connection, b) decrementing the hop-count value in said data unit header by one when the hop-count value within said data unit is less than or equal to the stored information on the number of nodes along said switched connection, and c) forwarding said data unit to the next hop towards the destination.
Claim 11
Dependent Claim
148 words
A program storage device readable by a computing machine, tangibly embodying a program of instructions executable by the machine to perform method steps of a method of forwarding a data unit within a network of nodes while maintaining a correct hop-count within said data unit, said data unit having a header with a hop-count therein, said method comprising: a) each forwarding node storing thereat information on the number of nodes from the forwarding node along said switched connection, said information including the total number of nodes from said forwarding node to an end of said switched connection, b) decrementing the hop-count value in said data unit header by one when the hop-count value within said data unit is less than or equal to the stored information on the number of nodes along said switched connection, and c) forwarding said data unit to the next hop towards the destination.
Claim 12
Dependent Claim
129 words
A program storage device readable by a computing machine, tangibly embodying a program of instructions executable by the machine to perform method steps of a method of forwarding a data unit within a network of nodes while maintaining a correct hop-count within said data unit, said data unit having a header with a hop-count therein, said method comprising: a) each forwarding node storing thereat information on the number of nodes from the forwarding node along said switched connection, said information including the total number of nodes from said forwarding node to an end of said switched connection, and b) discarding said data unit when the hop-count value within said data unit is less than or equal to the stored information on the number of nodes along said switched connection.
Claim 13
Dependent Claim
129 words
A program storage device readable by a computing machine, tangibly embodying a program of instructions executable by the machine to perform method steps of a method of forwarding a data unit within a network of nodes while maintaining a correct hop-count within said data unit, said data unit having a header with a hop-count therein, said method comprising: a) each forwarding node storing thereat information on the number of nodes from the forwarding node along said switched connection, said information including the total number of nodes from said forwarding node to an end of said switched connection, and b) discarding said data unit when the hop-count value within said data unit is less than or equal to the stored information on the number of nodes along said switched connection.
Claim 14
Dependent Claim
43 words
A program storage device as set forth in claim 5, 6, or 7, wherein said data unit comprises an Internet Protocol (IP) packet having an IP header with a Time-To-Live (TTL) field, and wherein the TTL field is used as the hop-count value.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-10-10 | 2004-04-10 | 2004-10-10 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-10-10 | 2008-04-10 | 2008-10-10 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-10-10 | 2012-04-10 | 2012-10-10 | $7700.00 | Window Closed / Lapsed |