US6697361B2
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for stream aggregation in a multiprotocol label switching network environment
Assignee: Nortel Networks Corp
•
Filing: 1998-09-15
•
Granted: 2004-02-24
•
Expires: 2018-09-15
Abstract
Abstract A method and apparatus for stream aggregation in a multiprotocol label switching network environment. According to one embodiment, the method comprises receiving a label assignment request that includes an identification of a path followed by the label assignment request through the network and determining whether the path has been used by any of a plurality of previous label assignment requests. A new label is assigned for the path if the path has not been used by any of the plurality of previous label assignment requests. Otherwise, a previously assigned label is assigned.
Inventors
- 👤 Andre N. Fredette
- 👤 Christopher J. White
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 13:22
CPC Classifications
H; H04; H04Q; H04Q11/00; H04Q11/04; H04Q11/0428; H04Q11/0478
Claims Analysis
Total Claims: 34
Claim 1
Independent Claim
124 words
A method for aggregating data streams in a multiprotocol label switching (MPLS) network, the method comprising: receiving a label assignment request that includes a merge identifier to identify a portion of a path followed by the label assignment request through the MPLS network; determining whether the portion of the path has been used by any of a plurality of previous label assignment requests; and assigning a new label for the portion of the path if the portion of the path has not been used by any of the plurality of previous label assignment requests, otherwise assigning a previously assigned label for the portion of the path; and returning an indication of either the new label or the previously assigned label based on the determination.
Claim 2
Independent Claim
124 words
A method for aggregating data streams in a multiprotocol label switching (MPLS) network, the method comprising: receiving a label assignment request that includes a merge identifier to identify a portion of a path followed by the label assignment request through the MPLS network; determining whether the portion of the path has been used by any of a plurality of previous label assignment requests; and assigning a new label for the portion of the path if the portion of the path has not been used by any of the plurality of previous label assignment requests, otherwise assigning a previously assigned label for the portion of the path; and returning an indication of either the new label or the previously assigned label based on the determination.
Claim 3
Dependent Claim
23 words
The method of claim 1 , wherein the indication returned to a source of the label assignment request is a label assignment response.
Claim 4
Dependent Claim
26 words
The method of claim 1 , further comprising maintaining a record of each label assigned for each of a plurality of paths through the (MPLS) network.
Claim 5
Dependent Claim
19 words
The method of claim 1 , wherein the (MPLS) network includes a plurality of asynchronous transfer mode (ATM) switches.
Claim 6
Independent Claim
152 words
A method in a switch of a multiprotocol label switching (MPLS) network, the method comprising: receiving a label assignment request that includes a merge identifier to identify a portion of a path followed by the label assignment request through the MPLS network to the switch; determining whether a next portion of the path has been used by any of a plurality of previous label assignment requests; assigning a new merge identifier to the label assignment request if the next portion of the path has not been used by any of the plurality of previous label assignment requests; reassigning the merge identifier if the next portion of the path has been used by any of the plurality of previous label assignment requests; and forwarding both the label assignment request with at least one of the assigned, new merge identifier and the previously assigned merge identifier to a next switch in the MPLS network.
Claim 7
Independent Claim
152 words
A method in a switch of a multiprotocol label switching (MPLS) network, the method comprising: receiving a label assignment request that includes a merge identifier to identify a portion of a path followed by the label assignment request through the MPLS network to the switch; determining whether a next portion of the path has been used by any of a plurality of previous label assignment requests; assigning a new merge identifier to the label assignment request if the next portion of the path has not been used by any of the plurality of previous label assignment requests; reassigning the merge identifier if the next portion of the path has been used by any of the plurality of previous label assignment requests; and forwarding both the label assignment request with at least one of the assigned, new merge identifier and the previously assigned merge identifier to a next switch in the MPLS network.
Claim 8
Dependent Claim
44 words
The method of claim 5 , further comprising: maintaining a record of previously used merge identifiers, corresponding input ports of the switch on which label assignment requests are received, and corresponding output ports of the switch on which the label assignment requests are forwarded.
Claim 9
Dependent Claim
31 words
The method of claim 5 , wherein the inclusion of the merger identifier by the label assignment request is equivalent to the label assignment request being accompanied by the merger identifier.
Claim 10
Independent Claim
120 words
An apparatus for aggregating data streams in a multiprotocol label switching (MPLS) network, the apparatus comprising: a plurality of input ports to receive data and label assignment requests; and a controller, coupled to the plurality of input ports, to: receive a label assignment request that includes a merge identifier to identify a portion of a path followed by the label assignment request through the network, determine whether a next portion of the path has been used by any of a plurality of previous label assignment requests, and reassign the merge identifier for the next portion of the path that is able to be aggregated with the portion of the path, and otherwise assign a new merge identifier for the path.
Claim 11
Independent Claim
120 words
An apparatus for aggregating data streams in a multiprotocol label switching (MPLS) network, the apparatus comprising: a plurality of input ports to receive data and label assignment requests; and a controller, coupled to the plurality of input ports, to: receive a label assignment request that includes a merge identifier to identify a portion of a path followed by the label assignment request through the network, determine whether a next portion of the path has been used by any of a plurality of previous label assignment requests, and reassign the merge identifier for the next portion of the path that is able to be aggregated with the portion of the path, and otherwise assign a new merge identifier for the path.
Claim 12
Dependent Claim
31 words
The apparatus of claim 8 , wherein the controller is further to maintain a record of each merge identifier assigned for each of a plurality of paths through the MPLS network.
Claim 13
Dependent Claim
24 words
The apparatus of claim 8 , wherein the apparatus comprises one of a plurality of asynchronous transfer mode (ATM) nodes in the MPLS network.
Claim 14
Dependent Claim
38 words
The apparatus of claim 8 , wherein the receiving of the label assignment request that includes the merger identifier by the controller includes is equivalent to the controller receiving the label assignment request accompanied by the merger identifier.
Claim 15
Independent Claim
148 words
An apparatus comprising: a plurality of input ports to receive data and label assignment requests; and a controller, coupled to the plurality of input ports, to: receive a label assignment request that includes a merge identifier to identify a portion of a path followed by the label assignment request through a network to the apparatus, determine whether a next portion of the path has been used by any of a plurality of previous label assignment requests, assign either a new merge identifier if the next portion of the path has not been used by any of the plurality of previous label assignment requests, or a previously assigned merge identifier if the next portion of the path has been used by any of the plurality of previous label assignment requests, and forward both the label assignment request and the assigned merge identifier to a next node in the network.
Claim 16
Independent Claim
148 words
An apparatus comprising: a plurality of input ports to receive data and label assignment requests; and a controller, coupled to the plurality of input ports, to: receive a label assignment request that includes a merge identifier to identify a portion of a path followed by the label assignment request through a network to the apparatus, determine whether a next portion of the path has been used by any of a plurality of previous label assignment requests, assign either a new merge identifier if the next portion of the path has not been used by any of the plurality of previous label assignment requests, or a previously assigned merge identifier if the next portion of the path has been used by any of the plurality of previous label assignment requests, and forward both the label assignment request and the assigned merge identifier to a next node in the network.
Claim 17
Dependent Claim
47 words
The apparatus of claim 12 , further comprising a memory to store a record of previously used merge identifiers, corresponding input ports of the apparatus on which label assignment requests are received, and corresponding output ports of the apparatus on which the label assignment requests are forwarded.
Claim 18
Dependent Claim
38 words
The apparatus of claim 12 , wherein the receiving of the label assignment request that includes the merger identifier by the controller includes is equivalent to the controller receiving the label assignment request accompanied by the merger identifier.
Claim 19
Independent Claim
191 words
A system comprising: a plurality of routers to transmit and receive data; and a plurality of asynchronous transfer mode (ATM) switches interconnected in a multiprotocol label switching (MPLS) network and coupled to the plurality of routers, each of the plurality of ATM switches including, a plurality of input ports to receive data and label assignment requests, and a controller, coupled to the plurality of input ports, to: receive a label assignment request accompanied by a merge identifier to identify a portion of a path followed by the label assignment request through the MPLS network to the switch, determine whether a next portion of the path has been used by any of a plurality of previous label assignment requests, assign either a new merge identifier if the next portion of the path has not been used by any of the plurality of previous label assignment requests, or a previously assigned merge identifier if the next portion of the path has been used by any of the plurality of previous label assignment requests, and forward both the label assignment request and the assigned merge identifier to a next switch in the MPLS network.
Claim 20
Independent Claim
191 words
A system comprising: a plurality of routers to transmit and receive data; and a plurality of asynchronous transfer mode (ATM) switches interconnected in a multiprotocol label switching (MPLS) network and coupled to the plurality of routers, each of the plurality of ATM switches including, a plurality of input ports to receive data and label assignment requests, and a controller, coupled to the plurality of input ports, to: receive a label assignment request accompanied by a merge identifier to identify a portion of a path followed by the label assignment request through the MPLS network to the switch, determine whether a next portion of the path has been used by any of a plurality of previous label assignment requests, assign either a new merge identifier if the next portion of the path has not been used by any of the plurality of previous label assignment requests, or a previously assigned merge identifier if the next portion of the path has been used by any of the plurality of previous label assignment requests, and forward both the label assignment request and the assigned merge identifier to a next switch in the MPLS network.
Claim 21
Dependent Claim
112 words
A machine-readable medium having stored thereon a plurality of instructions, designed to be executed by a processor, for implementing a function to: receive a label assignment request that includes a merge identifier to identify a portion of a path followed by the label assignment request through a multiprotocol label switching (MPLS) network; determine whether a next portion of the path has been used by any of a plurality of previous label assignment requests; and assign a new label for the next portion of the path if the next portion of the path has not been used by any of the plurality of previous label assignment requests, otherwise assigning a previously assigned label.
Claim 22
Dependent Claim
112 words
A machine-readable medium having stored thereon a plurality of instructions, designed to be executed by a processor, for implementing a function to: receive a label assignment request that includes a merge identifier to identify a portion of a path followed by the label assignment request through a multiprotocol label switching (MPLS) network; determine whether a next portion of the path has been used by any of a plurality of previous label assignment requests; and assign a new label for the next portion of the path if the next portion of the path has not been used by any of the plurality of previous label assignment requests, otherwise assigning a previously assigned label.
Claim 23
Dependent Claim
37 words
The machine-readable medium of claim 15 , wherein the plurality of instructions are further for implementing a function to maintain a record of each label assigned for each of a plurality of paths through the network environment.
Claim 24
Dependent Claim
19 words
The machine-readable medium of claim 15 , wherein the network includes a plurality of asynchronous transfer mode (ATM) switches.
Claim 25
Dependent Claim
18 words
The machine-readable medium of claim 18 , wherein the label identifies a virtual circuit through the ATM switches.
Claim 26
Dependent Claim
32 words
The machine-readable medium of claim 16 , wherein the inclusion of the merge identifier by the label assignment request is equivalent to the label assignment request being accompanied by the merge identifier.
Claim 27
Dependent Claim
155 words
A machine-readable medium having stored thereon a plurality of instructions, designed to be executed by a controller in a switch of a multiprotocol label switching (MPLS) network, for implementing a function to: receive a label assignment request that includes a merge identifier to identify a portion of a path followed by the label assignment request through the MPLS network to the switch; determine whether a next portion of the path has been used by any of a plurality of previous label assignment requests; assign either a new merge identifier if the next portion of the path has not been used by any of the plurality of previous label assignment requests, or a previously assigned merge identifier if the next portion of the path has been used by any of the plurality of previous label assignment requests; and forward both the label assignment request and the assigned merge identifier to a next switch in the network.
Claim 28
Dependent Claim
155 words
A machine-readable medium having stored thereon a plurality of instructions, designed to be executed by a controller in a switch of a multiprotocol label switching (MPLS) network, for implementing a function to: receive a label assignment request that includes a merge identifier to identify a portion of a path followed by the label assignment request through the MPLS network to the switch; determine whether a next portion of the path has been used by any of a plurality of previous label assignment requests; assign either a new merge identifier if the next portion of the path has not been used by any of the plurality of previous label assignment requests, or a previously assigned merge identifier if the next portion of the path has been used by any of the plurality of previous label assignment requests; and forward both the label assignment request and the assigned merge identifier to a next switch in the network.
Claim 29
Dependent Claim
57 words
The machine-readable medium of claim 21 , wherein the plurality of instructions are further for implementing a function to: maintain a record of at least previously used merge identifiers, corresponding input ports of the switch on which label assignment requests are received, and corresponding output ports of the switch on which the label assignment requests are forwarded.
Claim 30
Dependent Claim
32 words
The machine-readable medium of claim 21 , wherein the inclusion of the merge identifier by the label assignment request is equivalent to the label assignment request being accompanied by the merge identifier.
Claim 31
Dependent Claim
126 words
A multiprotocol label switching (MPLS) network, comprising: a source device; and a router to receive a label assignment request from the source device, the label assignment request including a merge identifier to identify a path followed by the label assignment request, (ii) determine whether the portion of the path has been used by any of a plurality of previous label assignment requests, (iii) assign a new label for the portion of the path if the portion of the path ahs not been used by any of the plurality of previous label assignment requests, otherwise assigning a previously assigned label for the portion of the path, and (iv) return a label assignment response including either the new label of the previously assigned label based on the determination.
Claim 32
Dependent Claim
126 words
A multiprotocol label switching (MPLS) network, comprising: a source device; and a router to receive a label assignment request from the source device, the label assignment request including a merge identifier to identify a path followed by the label assignment request, (ii) determine whether the portion of the path has been used by any of a plurality of previous label assignment requests, (iii) assign a new label for the portion of the path if the portion of the path ahs not been used by any of the plurality of previous label assignment requests, otherwise assigning a previously assigned label for the portion of the path, and (iv) return a label assignment response including either the new label of the previously assigned label based on the determination.
Claim 33
Dependent Claim
28 words
The MPLS network of claim 24 , wherein the router maintains a record of each label assigned for each of a plurality of paths through the MPLS network.
Claim 34
Dependent Claim
23 words
The MPLS network of claim 24 comprises a plurality of asynchronous transfer mode (ATM) switches for coupling the source device to the router.
References Cited (Backward Citations)
US6021263A
Cited
US5917820A
Cited
US6092113A
Cited
US6101549A
Cited
US6069889A
Cited
GB2320159A
Cited
US6055561A
Cited
US5903559A
Cited
US6009097A
Cited
US6031841A
Cited
US6038230A
Cited
US5991300A
Cited
US6205488B1
Cited
US6332198B1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2007-02-23 | 2007-08-25 | 2008-02-24 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2011-02-23 | 2011-08-25 | 2012-02-24 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2015-02-23 | 2015-08-25 | 2016-02-24 | $7700.00 | Window Closed / Lapsed |