Patent US6185698B1 successfully refreshed from Google Patents.
US6185698B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus using ranking to select repair nodes in formation of a dynamic tree for multicast repair
Assignee: Oracle America Inc
•
Filing: 1998-04-20
•
Granted: 2001-02-06
•
Expires: 2018-04-20
Abstract
Abstract An embodiment consistent with the present invention includes a method and apparatus for forming a multicast repair tree. The method may be performed by a data processor and comprises the steps of determining, for each of a plurality of potential heads in a multicast group, a ranking value associated with the potential head; advertising, by the potential heads to a plurality of potential receivers; prioritizing, by a potential receiver, the ranking values from the potential heads; and binding, by a potential receiver to the head having the highest ranking value, thereby forming a group of which the potential receiver is a member and the potential head is the head. The head may also be the sender. There may be a plurality of heads. The ranking values may include “able”, “unable”, “willing”, and “reluctant.” The ranking value of a potential head may be determined in accordance with a static or a dynamic configuration. Ranking values may be determined dynamically based on ranges of system resource levels such as memory and available processor resources.
Inventors
- 👤 Joseph Wesley
- 👤 Stephen A. Hurst
- 👤 Miriam C. Kadansky
- 👤 Stephen R. Hanna
- 👤 Philip M. Rosenzweig
- 👤 Dah Ming Chiu
- 👤 Radia J. Perlman
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 22:26
CPC Classifications
H; H04; H04L; H04L45/00; H04L45/46; H04L12/00; H04L12/02; H04L12/16; H04L12/18; H04L12/185; H04L45/02; H04L45/04; H04L45/16; H04L12/1863
Claims Analysis
Total Claims: 24
Claim 1
Independent Claim
108 words
A method for forming a multicast repair tree, performed by a data processor, comprising the steps of: determining, for each of a plurality of potential heads, a ranking value associated with the potential head, wherein the ranking value is selected from a group including “able”, “unable” and “reluctant”; advertising, by the potential heads to a plurality of potential receivers; prioritizing by a potential receiver, the ranking values from the potential heads; and binding, by a potential receiver to the potential head having the highest ranking value, thereby forming a repair group of which the potential receiver is a member and the highest ranking potential head is the head.
Claim 2
Independent Claim
108 words
A method for forming a multicast repair tree, performed by a data processor, comprising the steps of: determining, for each of a plurality of potential heads, a ranking value associated with the potential head, wherein the ranking value is selected from a group including “able”, “unable” and “reluctant”; advertising, by the potential heads to a plurality of potential receivers; prioritizing by a potential receiver, the ranking values from the potential heads; and binding, by a potential receiver to the potential head having the highest ranking value, thereby forming a repair group of which the potential receiver is a member and the highest ranking potential head is the head.
Claim 3
Independent Claim
108 words
A method for forming a multicast repair tree, performed by a data processor, comprising the steps of: determining, for each of a plurality of potential heads, a ranking value associated with the potential head, wherein the ranking value is selected from a group including “able”, “unable” and “willing”; advertising, by the potential heads to a plurality of potential receivers; prioritizing, by a potential receiver, the ranking values from the potential heads; and binding, by a potential receiver to the potential head having the highest ranking value, thereby forming a repair group of which the potential receiver is a member and the highest ranking potential head is the head.
Claim 4
Independent Claim
108 words
A method for forming a multicast repair tree, performed by a data processor, comprising the steps of: determining, for each of a plurality of potential heads, a ranking value associated with the potential head, wherein the ranking value is selected from a group including “able”, “unable” and “willing”; advertising, by the potential heads to a plurality of potential receivers; prioritizing, by a potential receiver, the ranking values from the potential heads; and binding, by a potential receiver to the potential head having the highest ranking value, thereby forming a repair group of which the potential receiver is a member and the highest ranking potential head is the head.
Claim 5
Independent Claim
136 words
A method for forming a multicast repair tree, performed by a data processor, comprising the steps of: (1) determining, for each of a plurality of potential heads, a ranking value associated with the potential head, including (a) determining whether the potential head has a static configuration, and (b) determining the ranking value of the potential head in accordance with a dynamic configuration if the potential head is not statically configured to be a head; (2) advertising, by the potential heads to a plurality of potential receivers; prioritizing, by a potential receiver, the ranking values from the potential heads; and (3) binding, by a potential receiver to the potential head having the highest ranking value, thereby forming a repair group of which the potential receiver is a member and the highest ranking potential head is the head.
Claim 6
Independent Claim
136 words
A method for forming a multicast repair tree, performed by a data processor, comprising the steps of: (1) determining, for each of a plurality of potential heads, a ranking value associated with the potential head, including (a) determining whether the potential head has a static configuration, and (b) determining the ranking value of the potential head in accordance with a dynamic configuration if the potential head is not statically configured to be a head; (2) advertising, by the potential heads to a plurality of potential receivers; prioritizing, by a potential receiver, the ranking values from the potential heads; and (3) binding, by a potential receiver to the potential head having the highest ranking value, thereby forming a repair group of which the potential receiver is a member and the highest ranking potential head is the head.
Claim 7
Dependent Claim
148 words
A computer data signal embodied in a carrier wave and representing sequences of instructions which, when executed by a processor, cause said processor to form a multicast repair tree, by performing the steps of: executing a first computer program to determine, for each of a plurality of potential heads, a ranking value associated with the potential head, wherein the ranking value is selected from a group including “able”, “unable”, and “reluctant”; executing the first computer program to advertise, by the potential heads, to a plurality of potential receivers; executing a second computer program to prioritize, by a potential receiver, the ranking values from the potential heads; and executing the second computer program to bind, by a potential receiver to the potential head having the highest ranking value, thereby forming a group of which the potential receiver is a member and the highest ranking potential head is the head.
Claim 8
Dependent Claim
148 words
A computer data signal embodied in a carrier wave and representing sequences of instructions which, when executed by a processor, cause said processor to form a multicast repair tree, by performing the steps of: executing a first computer program to determine, for each of a plurality of potential heads, a ranking value associated with the potential head, wherein the ranking value is selected from a group including “able”, “unable”, and “reluctant”; executing the first computer program to advertise, by the potential heads, to a plurality of potential receivers; executing a second computer program to prioritize, by a potential receiver, the ranking values from the potential heads; and executing the second computer program to bind, by a potential receiver to the potential head having the highest ranking value, thereby forming a group of which the potential receiver is a member and the highest ranking potential head is the head.
Claim 9
Dependent Claim
147 words
A computer data signal embodied in a carrier wave and representing sequences of instructions which, when executed by a processor, cause said processor to form a multicast repair tree, by performing the steps of: executing a first computer program to determine, for each of a plurality of potential heads, a ranking value associated with the potential head, wherein the ranking value is selected from a group including “able”, “unable”and “willing”; executing the first computer program to advertise, by the potential heads, to a plurality of potential receivers; executing a second computer program to prioritize, by a potential receiver, the ranking values from the potential heads; and executing the second computer program to bind, by a potential receiver to the potential head having the highest ranking value, thereby forming a group of which the potential receiver is a member and the highest ranking potential head is the head.
Claim 10
Dependent Claim
147 words
A computer data signal embodied in a carrier wave and representing sequences of instructions which, when executed by a processor, cause said processor to form a multicast repair tree, by performing the steps of: executing a first computer program to determine, for each of a plurality of potential heads, a ranking value associated with the potential head, wherein the ranking value is selected from a group including “able”, “unable”and “willing”; executing the first computer program to advertise, by the potential heads, to a plurality of potential receivers; executing a second computer program to prioritize, by a potential receiver, the ranking values from the potential heads; and executing the second computer program to bind, by a potential receiver to the potential head having the highest ranking value, thereby forming a group of which the potential receiver is a member and the highest ranking potential head is the head.
Claim 11
Dependent Claim
187 words
A computer data signal embodied in a carrier wave and representing sequences of instructions which, when executed by a processor, cause said processor to form a multicast repair tree, by performing the steps of: (1) executing a first computer program to determine, for each of a plurality of potential heads, a ranking value associated with the potential head, including (a) executing a computer program to determine whether the potential head has a static configuration, and (b) executing a computer program to determine the ranking value of the potential head in accordance with a dynamic configuration if the potential head is not statically configured to be a head; (2) executing the first computer program to advertise, by the potential heads, to a plurality of potential receivers; (3) executing a second computer program to prioritize, by a potential receiver, the ranking values from the potential heads; and (4) executing the second computer program to bind, by a potential receiver to the potential head having the highest ranking value, thereby forming a group of which the potential receiver is a member and the highest ranking potential head is the head.
Claim 12
Dependent Claim
187 words
A computer data signal embodied in a carrier wave and representing sequences of instructions which, when executed by a processor, cause said processor to form a multicast repair tree, by performing the steps of: (1) executing a first computer program to determine, for each of a plurality of potential heads, a ranking value associated with the potential head, including (a) executing a computer program to determine whether the potential head has a static configuration, and (b) executing a computer program to determine the ranking value of the potential head in accordance with a dynamic configuration if the potential head is not statically configured to be a head; (2) executing the first computer program to advertise, by the potential heads, to a plurality of potential receivers; (3) executing a second computer program to prioritize, by a potential receiver, the ranking values from the potential heads; and (4) executing the second computer program to bind, by a potential receiver to the potential head having the highest ranking value, thereby forming a group of which the potential receiver is a member and the highest ranking potential head is the head.
Claim 13
Independent Claim
115 words
An apparatus for forming a multicast repair tree, comprising: a circuit configured to determine, for each of a plurality of potential heads, a ranking value associated with the potential head, wherein the ranking value is selected from a group including “able”, “unable” and “reluctant”; a circuit configured to advertise, by the potential heads to a plurality of potential receivers; a circuit configured to prioritize, by a potential receiver, the ranking values from the potential heads; and a circuit configured to bind, by a potential receiver to the potential head having the highest ranking value, thereby forming a group of which the potential receiver is a member and the highest ranking potential head is the head.
Claim 14
Independent Claim
115 words
An apparatus for forming a multicast repair tree, comprising: a circuit configured to determine, for each of a plurality of potential heads, a ranking value associated with the potential head, wherein the ranking value is selected from a group including “able”, “unable” and “reluctant”; a circuit configured to advertise, by the potential heads to a plurality of potential receivers; a circuit configured to prioritize, by a potential receiver, the ranking values from the potential heads; and a circuit configured to bind, by a potential receiver to the potential head having the highest ranking value, thereby forming a group of which the potential receiver is a member and the highest ranking potential head is the head.
Claim 15
Independent Claim
115 words
An apparatus for forming a multicast repair tree, comprising: a circuit configured to determine, for each of a plurality of potential heads, a ranking value associated with the potential head, wherein the ranking value is selected from a group including “able”, “unable” and “willing”; a circuit configured to advertise, by the potential heads to a plurality of potential receivers; a circuit configured to prioritize, by a potential receiver, the ranking values from the potential heads; and a circuit configured to bind, by a potential receiver to the potential head having the highest ranking value, thereby forming a group of which the potential receiver is a member and the highest ranking potential head is the head.
Claim 16
Independent Claim
115 words
An apparatus for forming a multicast repair tree, comprising: a circuit configured to determine, for each of a plurality of potential heads, a ranking value associated with the potential head, wherein the ranking value is selected from a group including “able”, “unable” and “willing”; a circuit configured to advertise, by the potential heads to a plurality of potential receivers; a circuit configured to prioritize, by a potential receiver, the ranking values from the potential heads; and a circuit configured to bind, by a potential receiver to the potential head having the highest ranking value, thereby forming a group of which the potential receiver is a member and the highest ranking potential head is the head.
Claim 17
Independent Claim
150 words
An apparatus for forming a multicast repair tree, comprising: (1) a circuit configured to determine, for each of a plurality of potential heads, a ranking value associated with the potential head, including (a) circuitry configured to determine whether the potential head has a static configuration, and (b) circuitry configured to determine the ranking value of the potential head in accordance with a dynamic configuration if the potential head is not statically configured to be a head; (2) a circuit configured to advertise, by the potential heads to a plurality of potential receivers; (3) a circuit configured to prioritize, by a potential receiver, the ranking values from the potential heads; and (4) a circuit configured to bind, by a potential receiver to the potential head having the highest ranking value, thereby forming a group of which the potential receiver is a member and the highest ranking potential head is the head.
Claim 18
Independent Claim
150 words
An apparatus for forming a multicast repair tree, comprising: (1) a circuit configured to determine, for each of a plurality of potential heads, a ranking value associated with the potential head, including (a) circuitry configured to determine whether the potential head has a static configuration, and (b) circuitry configured to determine the ranking value of the potential head in accordance with a dynamic configuration if the potential head is not statically configured to be a head; (2) a circuit configured to advertise, by the potential heads to a plurality of potential receivers; (3) a circuit configured to prioritize, by a potential receiver, the ranking values from the potential heads; and (4) a circuit configured to bind, by a potential receiver to the potential head having the highest ranking value, thereby forming a group of which the potential receiver is a member and the highest ranking potential head is the head.
Claim 19
Dependent Claim
154 words
A computer program product, comprising: a computer usable medium having computer readable code embodied therein for forming a multicast repair tree that includes one or more systems, the computer program product including: first computer readable program code devices configured to determine, for each of a plurality of potential heads, a ranking value associated with the potential head, wherein the ranking value is selected from a group including “able”, “unable” and “reluctant”; second computer readable program code devices configured to advertise, by the potential heads, to a plurality of potential receivers; third computer readable program code devices configured to prioritize, by a potential receiver, the ranking values from the potential heads; and fourth computer readable program code devices configured to bind, by a potential receiver to the potential head having the highest ranking value, thereby forming a group of which the potential receiver is a member and the highest ranking potential head is the head.
Claim 20
Dependent Claim
154 words
A computer program product, comprising: a computer usable medium having computer readable code embodied therein for forming a multicast repair tree that includes one or more systems, the computer program product including: first computer readable program code devices configured to determine, for each of a plurality of potential heads, a ranking value associated with the potential head, wherein the ranking value is selected from a group including “able”, “unable” and “reluctant”; second computer readable program code devices configured to advertise, by the potential heads, to a plurality of potential receivers; third computer readable program code devices configured to prioritize, by a potential receiver, the ranking values from the potential heads; and fourth computer readable program code devices configured to bind, by a potential receiver to the potential head having the highest ranking value, thereby forming a group of which the potential receiver is a member and the highest ranking potential head is the head.
Claim 21
Dependent Claim
154 words
A computer program product, comprising: a computer usable medium having computer readable code embodied therein for forming a multicast repair tree that includes one or more systems, the computer program product including: first computer readable program code devices configured to determine, for each of a plurality of potential heads, a ranking value associated with the potential head, wherein the ranking value is selected from a group including “able”, “unable” and “willing”; second computer readable program code devices configured to advertise, by the potential heads, to a plurality of potential receivers; third computer readable program code devices configured to prioritize, by a potential receiver, the ranking values from the potential heads, and fourth computer readable program code devices configured to bind, by a potential receiver to the potential head having the highest ranking value, thereby forming a group of which the potential receiver is a member and the highest ranking potential head is the head.
Claim 22
Dependent Claim
154 words
A computer program product, comprising: a computer usable medium having computer readable code embodied therein for forming a multicast repair tree that includes one or more systems, the computer program product including: first computer readable program code devices configured to determine, for each of a plurality of potential heads, a ranking value associated with the potential head, wherein the ranking value is selected from a group including “able”, “unable” and “willing”; second computer readable program code devices configured to advertise, by the potential heads, to a plurality of potential receivers; third computer readable program code devices configured to prioritize, by a potential receiver, the ranking values from the potential heads, and fourth computer readable program code devices configured to bind, by a potential receiver to the potential head having the highest ranking value, thereby forming a group of which the potential receiver is a member and the highest ranking potential head is the head.
Claim 23
Dependent Claim
189 words
A computer program product, comprising: a computer usable medium having computer readable code embodied therein for forming a multicast repair tree that includes one or more systems, the computer program product including: first computer readable program code devices configured to determine, for each of a plurality of potential heads, a ranking value associated with the potential head, including computer readable program code devices to determine whether the potential head has a static configuration, and computer readable program code devices to determine the ranking value of the potential head in accordance with a dynamic configuration if the potential head is not statically configured to be a head; second computer readable program code devices configured to advertise, by the potential heads, to a plurality of potential receivers; third computer readable program code devices configured to prioritize, by a potential receiver, the rankling values from the potential heads; and fourth computer readable program code devices configured to bind, by a potential receiver to the potential head having the highest ranking value, thereby forming a group of which the potential receiver is a member and the highest ranking potential head is the head.
Claim 24
Dependent Claim
189 words
A computer program product, comprising: a computer usable medium having computer readable code embodied therein for forming a multicast repair tree that includes one or more systems, the computer program product including: first computer readable program code devices configured to determine, for each of a plurality of potential heads, a ranking value associated with the potential head, including computer readable program code devices to determine whether the potential head has a static configuration, and computer readable program code devices to determine the ranking value of the potential head in accordance with a dynamic configuration if the potential head is not statically configured to be a head; second computer readable program code devices configured to advertise, by the potential heads, to a plurality of potential receivers; third computer readable program code devices configured to prioritize, by a potential receiver, the rankling values from the potential heads; and fourth computer readable program code devices configured to bind, by a potential receiver to the potential head having the highest ranking value, thereby forming a group of which the potential receiver is a member and the highest ranking potential head is the head.
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) | 2004-02-06 | 2004-08-07 | 2005-02-06 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2008-02-06 | 2008-08-07 | 2009-02-06 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2012-02-06 | 2012-08-07 | 2013-02-06 | $7700.00 | Window Closed / Lapsed |