← Back to Patent Explorer
US6069889A Expired / Lapsed US ⏱️ 0.0 years remaining

Aggregation of data flows on switched network paths

Assignee: International Business Machines Corp
•
Filing: 1997-09-30
•
Granted: 2000-05-30
•
Expires: 2017-09-30
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract In networks that use the label switching paradigm, labels are typically allocated to a "flow", where a flow is identified as an end-to-end connection between two or more user applications. This approach may quickly lead to exhaustion of the label space, because the number of user connections across a network is unbounded and hence can be too numerous. Moreover, this requires that the setup and teardown procedures be exercised for each user connection. This demands large amounts of resources (in terms of labels, memory and processing) from the network devices. An important objective of this inventive proposal is to reduce the consumption of labels in a network. Several methods are identified through which multiple flows that traverse the same network hops can use a single connection through the network to transport data from the ingress to the egress point of a network. In other words, the flows are "aggregated" onto a single connection from an ingress to an egress point of a network. Consequently, this helps in reducing the labels usage by several degrees and similarly the setup and teardown work by the same order.

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-10-30 02:09
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: 28
Claim 1
Independent Claim 166 words
A method of building a switched connection for receiving and transmitting data units using labels within a network of nodes, wherein each node which is to initiate the transmission of data units using said switched connection in said network comprises at least one incoming and at least one outgoing port, a router device with a routing database, a linking database mapping a routing database entry to a label, and wherein an identifier unique within said network is used for the purpose of mapping a plurality of network addresses associated with said identifier in said routing database to said switched connection, comprising the steps wherein: a) each node transmitting a set-up message for building a switched connection includes an identifier in said message, b) each node receiving said message performs a lookup in the routing database to identify entries that are associated with said identifier, c) each node receiving said message associates each routing database entry identified in (b) with said switched connection via the linking database.
Claim 2
Independent Claim 166 words
A method of building a switched connection for receiving and transmitting data units using labels within a network of nodes, wherein each node which is to initiate the transmission of data units using said switched connection in said network comprises at least one incoming and at least one outgoing port, a router device with a routing database, a linking database mapping a routing database entry to a label, and wherein an identifier unique within said network is used for the purpose of mapping a plurality of network addresses associated with said identifier in said routing database to said switched connection, comprising the steps wherein: a) each node transmitting a set-up message for building a switched connection includes an identifier in said message, b) each node receiving said message performs a lookup in the routing database to identify entries that are associated with said identifier, c) each node receiving said message associates each routing database entry identified in (b) with said switched connection via the linking database.
Claim 3
Independent Claim 173 words
A method of building a switched connection for receiving and transmitting data units using labels within a network of nodes, wherein each node which is to initiate the transmission of data units using said switched connection in said network comprises at least one incoming and at least one outgoing port, a router device with a routing database, and a linking database mapping a routing database entry to a label for the purpose of mapping a plurality of network addresses in said routing database to said switched connection, comprising the steps wherein: a) each node transmits a set-up message for a switched connection, said message including at least one network address, b) each node receiving said message performs a lookup in the routing database on each received network address to verify that said network address was received from an adjacent node in the direction of the network address, c) each node receiving said message associates the switched connection with each verified received network address as set forth in step (b) via the linking database.
Claim 4
Independent Claim 173 words
A method of building a switched connection for receiving and transmitting data units using labels within a network of nodes, wherein each node which is to initiate the transmission of data units using said switched connection in said network comprises at least one incoming and at least one outgoing port, a router device with a routing database, and a linking database mapping a routing database entry to a label for the purpose of mapping a plurality of network addresses in said routing database to said switched connection, comprising the steps wherein: a) each node transmits a set-up message for a switched connection, said message including at least one network address, b) each node receiving said message performs a lookup in the routing database on each received network address to verify that said network address was received from an adjacent node in the direction of the network address, c) each node receiving said message associates the switched connection with each verified received network address as set forth in step (b) via the linking database.
Claim 5
Independent Claim 172 words
A method of associating a switched connection for receiving and transmitting data units using labels within a network of nodes, wherein each node which is to initiate the transmission of data units using said switched connection in said network comprises at least one incoming and at least one outgoing port, a router device with a routing database, and a linking database mapping a routing database entry to a label for the purpose of mapping a plurality of network addresses in said routing database to said switched connection, comprising the steps wherein: a) each node transmits an association message for an existing switched connection which includes at least one network address, b) each node receiving said message performs a lookup in the routing database on each received network address to verify that said network address arrived from an adjacent node in the direction of the network address, c) each node receiving the said message associates the switched connection with each verified received network address as described in step (b) via the linking database.
Claim 6
Independent Claim 172 words
A method of associating a switched connection for receiving and transmitting data units using labels within a network of nodes, wherein each node which is to initiate the transmission of data units using said switched connection in said network comprises at least one incoming and at least one outgoing port, a router device with a routing database, and a linking database mapping a routing database entry to a label for the purpose of mapping a plurality of network addresses in said routing database to said switched connection, comprising the steps wherein: a) each node transmits an association message for an existing switched connection which includes at least one network address, b) each node receiving said message performs a lookup in the routing database on each received network address to verify that said network address arrived from an adjacent node in the direction of the network address, c) each node receiving the said message associates the switched connection with each verified received network address as described in step (b) via the linking database.
Claim 7
Dependent Claim 24 words
A method as set forth in claim 1, 2, or 3 wherein an IP address in the routing database is used as said identifier.
Claim 8
Dependent Claim 27 words
A method as set forth in claim 1, 2, or 3 wherein the identifier comprises the Border Gateway Protocol's NEXT -- HOP attribute from a BGP message.
Claim 9
Dependent Claim 28 words
A method as set forth in claim 1, 2, or 3 wherein the identifier comprises the Open Shortest Path First protocol's Router Identifier from a Link State advertisement.
Claim 10
Dependent Claim 28 words
A method as set forth in claim 1, 2, or 3 wherein the identifier comprises the Open Shortest Path First protocol's Forwarding Address from a Link State Advertisement.
Claim 11
Dependent Claim 18 words
A method as set forth in claim 1, 2, or 3 wherein the identifier comprises a multicast group.
Claim 12
Dependent Claim 19 words
A method as set forth in claim 2 or 3 wherein the identifier comprises a node's local IP address.
Claim 13
Dependent Claim 18 words
A method as set forth in claim 2 or 3 wherein the identifier comprises a node's unique identifier.
Claim 14
Dependent Claim 18 words
A method as set forth in claim 2 or 3 wherein the identifier comprises a node's router identifier.
Claim 15
Dependent Claim 190 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 building a switched connection for receiving and transmitting data units using labels within a network of nodes, wherein each node which is to initiate the transmission of data units using said switched connection in said network comprises at least one incoming and at least one outgoing port, a router device with a routing database, a linking database mapping a routing database entry to a label, and wherein an identifier unique within said network is used for the purpose of mapping a plurality of network addresses associated with said identifier in said routing database to said switched connection, comprising the steps wherein: a) each node transmitting a set-up message for building a switched connection includes an identifier in said message, b) each node receiving said message performs a lookup in the routing database to identify entries that are associated with said identifier, c) each node receiving said message associates each routing database entry identified in (b) with said switched connection via the linking database.
Claim 16
Dependent Claim 190 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 building a switched connection for receiving and transmitting data units using labels within a network of nodes, wherein each node which is to initiate the transmission of data units using said switched connection in said network comprises at least one incoming and at least one outgoing port, a router device with a routing database, a linking database mapping a routing database entry to a label, and wherein an identifier unique within said network is used for the purpose of mapping a plurality of network addresses associated with said identifier in said routing database to said switched connection, comprising the steps wherein: a) each node transmitting a set-up message for building a switched connection includes an identifier in said message, b) each node receiving said message performs a lookup in the routing database to identify entries that are associated with said identifier, c) each node receiving said message associates each routing database entry identified in (b) with said switched connection via the linking database.
Claim 17
Dependent Claim 197 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 building a switched connection for receiving and transmitting data units using labels within a network of nodes, wherein each node which is to initiate the transmission of data units using said switched connection in said network comprises at least one incoming and at least one outgoing port, a router device with a routing database, and a linking database mapping a routing database entry to a label for the purpose of mapping a plurality of network addresses in said routing database to said switched connection, comprising the steps wherein: a) each node transmits a set-up message for a switched connection, said message including at least one network address, b) each node receiving said message performs a lookup in the routing database on each received network address to verify that said network address was received from an adjacent node in the direction of the network address, c) each node receiving said message associates the switched connection with each verified received network address as set forth in step (b) via the linking database.
Claim 18
Dependent Claim 197 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 building a switched connection for receiving and transmitting data units using labels within a network of nodes, wherein each node which is to initiate the transmission of data units using said switched connection in said network comprises at least one incoming and at least one outgoing port, a router device with a routing database, and a linking database mapping a routing database entry to a label for the purpose of mapping a plurality of network addresses in said routing database to said switched connection, comprising the steps wherein: a) each node transmits a set-up message for a switched connection, said message including at least one network address, b) each node receiving said message performs a lookup in the routing database on each received network address to verify that said network address was received from an adjacent node in the direction of the network address, c) each node receiving said message associates the switched connection with each verified received network address as set forth in step (b) via the linking database.
Claim 19
Dependent Claim 196 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 associating a switched connection for receiving and transmitting data units using labels within a network of nodes, wherein each node which is to initiate the transmission of data units using said switched connection in said network comprises at least one incoming and at least one outgoing port, a router device with a routing database, and a linking database mapping a routing database entry to a label for the purpose of mapping a plurality of network addresses in said routing database to said switched connection, comprising the steps wherein: a) each node transmits an association message for an existing switched connection which includes at least one network address, b) each node receiving said message performs a lookup in the routing database on each received network address to verify that said network address arrived from an adjacent node in the direction of the network address, c) each node receiving the said message associates the switched connection with each verified received network address as described in step (b) via the linking database.
Claim 20
Dependent Claim 196 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 associating a switched connection for receiving and transmitting data units using labels within a network of nodes, wherein each node which is to initiate the transmission of data units using said switched connection in said network comprises at least one incoming and at least one outgoing port, a router device with a routing database, and a linking database mapping a routing database entry to a label for the purpose of mapping a plurality of network addresses in said routing database to said switched connection, comprising the steps wherein: a) each node transmits an association message for an existing switched connection which includes at least one network address, b) each node receiving said message performs a lookup in the routing database on each received network address to verify that said network address arrived from an adjacent node in the direction of the network address, c) each node receiving the said message associates the switched connection with each verified received network address as described in step (b) via the linking database.
Claim 21
Dependent Claim 26 words
A program storage device as set forth in claim 12, 13, or 14 wherein an IP address in the routing database is used as said identifier.
Claim 22
Dependent Claim 29 words
A program storage device as set forth in claim 12, 13, or 14 wherein the identifier comprises the Border Gateway Protocol's NEXT -- HOP attribute from a BGP message.
Claim 23
Dependent Claim 28 words
A method as set forth in claim 12, 13, or 14 wherein the identifier comprises the Open Shortest Path First protocol's Router Identifier from a Link State Advertisement.
Claim 24
Dependent Claim 28 words
A method as set forth in claim 12, 13, or 14 wherein the identifier comprises the Open Shortest Path First protocol's Router Identifier from a Link State Advertisement.
Claim 25
Dependent Claim 28 words
A method as set forth in claim 12, 13, or 14 wherein the identifier comprises the Open Shortest Path First protocol's Forwarding Address from a Link State Advertisement.
Claim 26
Dependent Claim 20 words
A program storage device as set forth in claim 12, 13, or 14 wherein the identifier comprises a multicast group.
Claim 27
Dependent Claim 21 words
A program storage device as set forth in claim 13 or 14 wherein the identifier comprises a node's local IP address.
Claim 28
Dependent Claim 25 words
A program storage device as set forth in claim 13 or 14 wherein the identifier comprises a node's unique identifier or a node's router identifier.

References Cited (Backward Citations)

US5408469A Cited
US5583868A Cited
US5825772A Cited
US5768271A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2003-05-30 2003-11-29 2004-05-30 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2007-05-30 2007-11-29 2008-05-30 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2011-05-30 2011-11-29 2012-05-30 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag