Source: http://www.google.com/patents/US6185698?dq=6,183,366
Timestamp: 2016-08-30 01:53:30
Document Index: 486624982

Matched Legal Cases: ['art 200', 'art 300', 'art 400', 'art 500', 'art 300', 'art 600', 'art 300', 'art 600', 'art 300']

Patent US6185698 - Method and apparatus using ranking to select repair nodes in formation of a ... - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inPatentsAn 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...http://www.google.com/patents/US6185698?utm_source=gb-gplus-sharePatent US6185698 - Method and apparatus using ranking to select repair nodes in formation of a dynamic tree for multicast repairAdvanced Patent SearchPublication numberUS6185698 B1Publication typeGrantApplication numberUS 09/063,498Publication dateFeb 6, 2001Filing dateApr 20, 1998Priority dateApr 20, 1998Fee statusPaidAlso published asEP1074115A1, US6757843, WO1999055041A1Publication number063498, 09063498, US 6185698 B1, US 6185698B1, US-B1-6185698, US6185698 B1, US6185698B1InventorsJoseph Wesley, Stephen A. Hurst, Miriam C. Kadansky, Stephen R. Hanna, Philip M. Rosenzweig, Dah Ming Chiu, Radia J. PerlmanOriginal AssigneeSun Microsystems, IncorporatedExport CitationBiBTeX, EndNote, RefManPatent Citations (4), Non-Patent Citations (3), Referenced by (37), Classifications (13), Legal Events (5) External Links: USPTO, USPTO Assignment, EspacenetMethod and apparatus using ranking to select repair nodes in formation of a dynamic tree for multicast repair
US 6185698 B1Abstract
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.
What is claimed is: 1. 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. 2. 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. 3. 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. 4. 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. 5. 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. 6. 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. 7. 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. 8. 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. 9. 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. 10. 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. 11. 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. 12. 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.
The present invention relates generally to network communications. More specifically, the present invention is a method and apparatus for using ranking to select repair nodes in formation of a dynamic tree for multicast repair
Internet Protocol (IP) multicasting is useful for disseminating data to a large group of receivers in a network. Multicast is a form of network communication in which a transmitting node, or sender, sends a single message to multiple destinations at once. The multiple destinations are the recipients, or receivers of the message. Other methods of network communication include broadcast, in which a sender transmits to all possible recipients, and unicast, in which the sender transmits only to one specific recipient. Multicast is described in more detail in D. Comer, Internetworking with TCP/IP, Prentice Hall, 1991, Chapter 17, which is herein incorporated by reference to the extent that it is not inconsistent with the present invention.
A multicast sender node sends a message to a multicast address. The sender transmits the message to any receivers that are listening for messages at the same multicast address. A set of receivers listening for messages at a particular multicast address are associated with the sender and form a multicast group in which the receivers are group members.
As the number of receivers joining a multicast group becomes large, the sender becomes overworked and slows down as a result of having to process notifications of receipt and requests for multicast repair from group members (receivers). Multicast repair is the process of the sender resending a multicast message in response to a request for retransmission (a “repair” request) from a receiver. The increased network traffic may cause a loss of data messages due to errors and overloading in the networking equipment.
In an embodiment consistent with the present invention, the sender sets up a hierarchical tree structure containing a plurality of receivers in which the sender is the root of the tree. The branches of the tree are repair groups. A repair group is a subset of the multicast group. The sender is the head of a first repair group. Each repair group contains a head and at least one receiver.
Each receiver has a ranking value corresponding to its ability to perform the duties of a head. Except for the sender, each of the heads are receivers which have a high enough ranking value to perform the duties of a head. If this ranking value is high enough, the receiver becomes a head and starts advertising for new members by sending multicast control messages containing the head's ranking value.
A receiver collects advertisement messages from heads which are available (for example, heads which are nearby). The receiver uses the ranking values in these advertisements to rank the heads, and then picks the most suitable head based on the ranking. The receiver then responds to the advertisement messages by sending a join request message to the head it picked. If the head rejects the receiver's membership request, the receiver sends a join request to the next most suitable head, i.e., the next highest ranked head. As some of the receivers become heads and other receivers become associated with those heads by joining groups, a hierarchical tree structure forms.
A receiver's ranking value can fall within at least three value ranges: (1) “unable” to serve as a head, (2) “able” to serve as a head, and (3) “willing” to serve as a head. “Willing” to serve as a head indicates that the receiver is a very good head candidate, thus ranking it higher than a head which is “able” to serve. In an embodiment consistent with the present invention, the value ranges may be represented by a point range from zero to ten, where zero represents “unable” to serve as a head, 1-9 represent “able” to serve as a head, and 10 represents “willing” to serve as a head. Additional ranking values may be added to provide greater ranking flexibility by creating multiple levels of heads. For example, a value of “reluctant” may be added to indicate a receiver which is “able” to serve but does not have as much resource capacity to serve as a receiver which is “willing” to serve.
The sender delegates multicast repair to the heads in the tree so that the sender provides multicast repair only to a subset of the total receivers in the multicast group. This reduces the sender's workload and enables the sender to send messages to larger multicast groups. The sender transmits multicast messages to all of the receivers at the multicast group address at a data rate which is preconfigured or dynamically determined. Receivers that have joined a group and become associated with a head may request re-transmissions of the multicast message from their associated head.
In accordance with an embodiment consistent with the present invention, a method and apparatus for forming a multicast repair tree performed by a data processor includes the step of determining a ranking value associated with a potential head for each of a plurality of potential heads in a multicast group. A potential head sends advertisements containing its ranking value. A plurality of potential receivers receive the advertisements. A potential receiver prioritizes the ranking values from the potential heads and binds to the head having the highest ranking value, thereby forming a group of which the potential receiver is a receiver and the potential head is the head. The head may be the sender of the multicast message. There may be a plurality of heads. There may be two or more possible ranking values including “able”, “unable”, “willing”, and “reluctant” to perform the duties of a head.
In accordance with an embodiment consistent with the present invention, a method and apparatus for forming a multicast repair tree, performed by a data processor, comprises the steps of determining, for each of a plurality of potential heads, 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 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. An embodiment consistent with the present invention may be implemented as a computer program product or as a computer data signal embodied in a carrier wave. In accordance with another embodiment consistent with the present invention, a method and apparatus for forming a multicast repair tree, performed by a data processor, comprises the steps of receiving a plurality of advertisements, each containing a ranking value, from the potential heads; prioritizing the ranking values from the potential heads; and binding to the potential head having the highest ranking value, thereby forming a group in which the highest ranking potential head is the head. An embodiment consistent with the present invention may be implemented as a computer program product or as a computer data signal embodied in a carrier wave. In accordance with an embodiment consistent with the present invention, a method and apparatus for forming a multicast repair tree, performed by a data processor programmed to be a potential head, comprising the steps of determining a ranking value associated with the potential head; advertising to a plurality of potential receivers in accordance with the ranking value; receiving a join message from a potential receiver; and adding the potential receiver to a group in accordance with a predetermined limit. An embodiment consistent with the present invention may be implemented as a computer program product or as a computer data signal embodied in a carrier wave.
Advantages of the invention will be set forth, in part, in the description that follows and in part, will be understood by those skilled in the art from the description or may be learned by practice of the invention. The advantages of the invention will be realized and attained by means of the elements and combinations particularly pointed out in the appended claims and equivalents.
FIG. 1 is a diagram of a multicast repair tree in accordance with an embodiment consistent with the present invention.
FIG. 2 is a flow chart showing steps performed by a data processing system programmed to process multicast messages in accordance with an embodiment consistent with the present invention to disseminate and repair multicast messages.
FIG. 3 is a flow chart showing steps performed by a data processing system programmed to be a potential head in accordance with an embodiment consistent with the present invention.
FIG. 4 is a flow chart showing steps performed by a data processing system programmed to be a potential group member in accordance with an embodiment consistent with the present invention.
FIG. 5 is a flow chart showing steps performed by a data processing system programmed to determine ranking in accordance with an embodiment consistent with the present invention.
FIG. 6 is a flow chart showing steps performed by a data processing system programmed to perform an algorithm for computing a ranking value in accordance with an embodiment consistent with the present invention.
FIG. 7 is a diagram showing a data processing system programmed to be a head in accordance with an embodiment consistent with the present invention.
FIG. 8 is a diagram showing a data processing system programmed to be a receiver in accordance with an embodiment consistent with the present invention.
FIG. 9 is an exemplary format of an advertisement message packet in accordance with an embodiment consistent with the present invention.
Reference will now be made in detail to embodiments consistent with the present invention, examples of which are illustrated in the accompanying drawings. Wherever possible, the same reference numbers will be used throughout the drawings to refer to the same or like parts.
FIG. 1 shows a network 100 in accordance with an embodiment consistent with the present invention and includes a sender node 102 and a plurality of receivers 118-154. Each of receivers 118-154 are part of the sender node's multicast group, as shown by multicast message path shown by arrow 116 which connects a sender 102 to each of receivers 118-154 in a multicast group.
Receivers 118-154 are organized in five subgroups 106-114. These subgroups are called repair groups. Each repair group includes a head and at least one receiver.
The following paragraphs describe the repair groups included in the multicast repair tree shown in FIG. 1. Note that all of the group members and most of the heads (except for the sender) are receiver nodes. In general, the heads are sender node 102 and receiver nodes 120, 122, 124, 132, and 140. The nodes which are only receivers (i.e., not heads) are receivers 118, 126, 128, 130, 134, 136, 138, 142, 144, 146, 148, 150, 152, and 154.
Group 104 contains a head 102 (which is also the sender) and group members 118, 120, 122, and 124 which are associated with head 102. Group 104 members 120, 122, and 124 are designated as heads for the next level of repair groups 106, 108, and 110, but group 104 member 118 is a not repair head and therefore does not have a group associated with it.
Group 106 includes a head 120 and group members 126, 128, and 130. Heads may also be group members. For example, head 120 is the head of group 106 but also is a member of group 104.
Group 108 includes a head 122 and group members 132, 134, and 136. Group member 132 is also the head of group 112. Group 112 includes a head 132 and receiver members 144, 146, and 148.
Group 110 includes a head 124 and members 138, 140, and 142. Head 124 is also a member of group 104, and group member 140 is the head of group 114. Group 114 includes a head 140 and members 150, 152, and 154.
A sender node 102 sends multicast messages to the receivers in the multicast repair tree along multicast message path 116 to receivers 118-154.
Sender 102 stores the message in a cache 176 until it receives an acknowledgment of receipt of the data packet from each of its group members, i.e., receivers 118, 120, 122, and 124. The acknowledgment of receipt may be a unicast message from each of the group members 118, 120, 122, and 124 to the sender 102 as shown by arrows 156, 157, 158, and 159 respectively.
Similarly, each of the other heads in the repair tree store the multicast message in data cache until receiving an acknowledgment of receipt from their respective group members. Heads 120, 122, 124, 132, and 140 store the message in a data cache 178, 180, 182, 184, and 186, respectively associated with each head.
After the multicast data message is sent, the head of each repair group waits for an acknowledgment of receipt from each of its group members Head 120 of group 106 waits for an acknowledgment of receipt from each of its members as shown by arrow 160 from receiver 126, arrow 161 from receiver 128, and arrow 162 from receiver 130. Head 122 of group 108 waits for acknowledgments of receipt as shown by arrows 163, 164, and 165 from receivers 132, 134, and 136, respectively. Head 124 of group 110 waits for acknowledgments of receipt as shown by arrows 166, 167, and 168 from receivers 138, 140, and 142, respectively. Head 140 of group 114 waits for acknowledgments of receipt as shown by arrows 172, 173, and 174 from receivers 150, 152, and 154, respectively. Head 132 of group 112 waits for acknowledgments of receipt as shown by arrows 169, 170, and 171 from receivers 144, 146, and 148, respectively.
Multicast repair is shown in group 112, in which head 132 has received a repair request from at least one of its group members 144, 146, or 148. When this happens, head 132 re-sends the multicast message which it has stored in cache 184 to each of its group members along a multicast repair path 188 shown by the dotted line arrows.
FIG. 2 is a flowchart 200 showing steps performed by a data processing system to process multicast messages, beginning at step 202. After the multicast repair tree is formed in step 204, a sender 102 sends a multicast data message, in step 206. More detail on the formation of the multicast tree is presented in the discussion of FIGS. 3-6. In step 208, sender 102 and heads 120, 122, 124, 132, and 140 store this multicast data message in their respective cache 176, 178, 180, 182, 184, 186.
In step 210, a head (including the sender which also performs as a head) waits for an event. These events are processed by each head in response to their group members and include an acknowledgment event 212 and a repair request event 218. If no other events occur, the head waits in a dormant state until it receives the next event. An acknowledgment event 212 is a notification from all of the head's group members that they have received the multicast data message. After receiving an acknowledgment event 212, the head releases the cached message in step 216. The head also may release the cached message under other circumstances, for example, if the cache fills up.
A repair request 218 is a request sent to the head by at least one of the group members for the head to retransmit the multicast data message. If the head receives a repair request 218 from one of its group members, the head performs multicast repair in step 220, i.e., the head retransmits the multicast data message (from the copy stored in cache) to the group. An example of multicast repair is shown by dotted-line arrows 188 in FIG. 1. The head performs multicast repair on a demand basis. After re-sending the multicast message in step 220, the head goes back to step 210 and waits for another event.
FIG. 3 is a flowchart 300 showing steps performed by a data processing system programmed to be a potential head in accordance with an embodiment consistent with the present invention, starting at step 302.
In step 303, a receiver which potentially could be a head determines its ranking value. (See FIG. 5.) The potential head, in step 304, uses the ranking value to determine whether it is able to serve as a head. The ranking value may be a bit, a flag, or any appropriate value which indicates whether a receiver is eligible to perform the duties of a head. The ranking value may be statically or dynamically configured. If the ranking value is sufficiently high, for example, if it corresponds to the level of “reluctant”, “able”, or “willing” to be a head, then the receiver sets its head status to TRUE in step 309, and begins to serve as a head The head then waits for an event in step 310. Otherwise, if the receiver is not able to serve as a head, the receiver simply performs the role of a normal receiver in step 306 and processing of that receiver stops at step 308.
Once the receiver is selected as being able to perform as a head, it waits in step 310 for an event such as a send advertisement event 312 or a receive join message event 315. An advertisement is a control message that lets potential group members know that a node is available to serve as a head. Receivers that are looking for a group to join, also known as potential group members, collect advertisement messages and use the ranking information contained in them to select a head. Head selection criteria are presented in more detail in the discussion of FIGS. 4-6. Advertisement messages are presented in more detail below in the discussion of FIG. 9. If a send advertisement event 312 occurs, the head sends an advertisement message including a ranking value in step 316, after which the head continues to wait for another event at step 310.
Assuming that there are receivers available which are interested in joining a group and are listening for advertisements, the head eventually receives a join message event 315 from a receiver. A join message is a request from a potential group member (receiver) to a head. A receiver selects a highest-ranked head from the heads represented by the list of advertisements that the receiver has collected. After selecting a highest-ranked head, the receiver sends a request to join that head's group. Join messages are presented in more detail in the discussion of FIG. 4. This starts the process of binding a receiver to the head's repair group. When the head receives a join message request 315, the head checks to find out if it has reached its member limit, step 318. The member limit may be any appropriate limit on the number of group members which a particular head may accommodate. The member limit typically depends on available system resources such as memory and compute power, but may be related to any appropriate criteria. A typical value for the member limit is 32 members per group head due to system resource limitations in one implementation consistent with the present invention.
If the member limit has been reached, the head does not accept the receiver into the group, sends the receiver a reject message in step 314, and then continues to wait for another event at step 310. If the member limit has not been reached then the head adds the new member to the group in step 320, and sends a member accept message to the new member in step 322 to inform the requesting receiver that it has become a member of the head's repair group. This completes the binding process. The receiver is now a member of the head's group and may send repair requests to the head. This receiver may also become a head and form subgroups, thereby adding branches to the tree.
FIG. 4 is a flowchart 400 showing steps performed by a data processing system programmed to be a potential group member (receiver) in accordance with an embodiment consistent with the present invention which starts at step 402. In step 404, the receiver initially sets a state indicating that it is not a member of any group and then waits for an event in step 406.
Events which occur include a timeout event 412, a received advertisement event 408, a received membership rejection event 430, and a received member acceptance message event 424. If a received advertisement event 408 occurs, the potential group member adds the advertisement to a list of received advertisements in step 410 and then returns to step 406 to wait for another event.
The potential group member continues to receive advertisements until a time-out event 412 occurs. The timeout value for collecting advertisements in an embodiment consistent with the present invention may be set to three times a predetermined head advertisement interval. The head advertisement interval may be set to roughly three seconds. Other values may be used for the advertisement collection interval and the head advertisement interval as appropriate to a particular application. The potential group member selects the highest-ranked heads from the list in step 414. If there is only one head with the highest rank, the receiver selects only one head. However, if multiple heads have the same highest ranking, then the receiver selects all of them in order to perform arbitration between heads having the same rank. The arbitration process is described below in the discussion of steps 414 and 415. The advertisements in the list created in step 410 contain the ranking values of the heads which are advertising. These ranking values may be stored in a data structure, such as an array or a list.
After selecting the highest-ranked heads in step 414, the potential group member checks if there are multiple heads with the same rank in step 415. If not, then processing continues at step 422 where a timer is reloaded with a predetermined value. The predetermined value represents an advertisement interval and corresponds to the length of time that a receiver waits for advertisements before processing them. This timer is also discussed in connection with step 432 described below. If there are multiple heads with the same rank then the potential group member selects the highest-ranked head with the closest TTL value in step 416. The head with the closest TTL value is the one requiring the fewest number of hops to reach and is based at least in part by its physical proximity to the potential group member. Step 416 is an example of a tie-breaking policy which may be specified. The potential group member determines which head has the highest ranking and in step 420, sends a join request to the highest ranking head. A timer is then reloaded with a predetermined value in step 422 after which the potential group member returns to step 406 to wait for another event.
In response to join request 420, the potential group member may be rejected, causing a received membership rejection event 430 to occur. After rejection, the potential group member removes the head which sent the rejection message from its list of heads in step 434, and then continues to step 414 where it selects the highest-ranked members from a list and continues processing as described above. If a potential group member receives a member acceptance message event 424, the potential group member changes its state to obtained membership in step 426, stops a timer corresponding to the wait for advertisements interval in step 432, and then determines its head status and ranking in step 428. This timer is also used in connection with step 422 described above. The potential group member then returns to step 406 and waits for another event.
FIG. 5 is a flowchart 500 showing steps performed by a data processing system programmed as a head or a potential head to determine a receiver's ranking value in accordance with an embodiment consistent with the present invention which starts at step 502. In step 504, the receiver determines whether its rank has been preconfigured. A receiver may be statically configured to be a head. A statically configured head may be set to always be a head or to never be a head. For example, someone who owns a particular receiver node who does not want to share the receiver's resources with the rest of the network and does not want the receiver to be used for servicing repair requests may specify that his system is never to be used as a head by setting the receiver statically to a ranking value of “unable” to be a head. If the receiver is statically configured to be a head, then its ranking value is set to “able” to serve as a head and is returned in step 508. The receiver then returns to be processed as a potential head, in step 304 of flow chart 300.
If the receiver is not statically configured to be a head, it can be dynamically configured to be a head. The process of determining whether a receiver is dynamically configured to be a head is performed at step 506, where the receiver computes its ranking value. Step 506 may be performed by a method such as that shown by flowchart 600 of FIG. 6. After the receiver computes its ranking value, that value is returned at step 508. The ranking value is returned to step 304 of flow chart 300.
FIG. 6 is a flowchart 600 showing steps performed by a data processing system programmed as a head or a potential head to determine a receiver's ranking value in accordance with an embodiment consistent with the present invention which starts at step 602. First, the head or potential head checks the amount of available memory. In step 604, the head or potential head checks whether the amount of available memory is less than 0.5 megabyte. If so, then the head or potential head sets the ranking value to be one, in step 606. If not, then the head or potential head continues to step 608 and checks whether the amount of available memory is less than 5.0 megabytes. If so, then the head or potential head sets the ranking value to be two, in step 610. If not, then the head or potential head continues to step 612 and checks whether the amount of available memory is greater than ten megabytes. If so, then the head or potential head sets the ranking value to be five in step 614. If not, then the head or potential head sets the ranking value to be four in step 616.
After performing any of steps 606, 610, 614, and 616, the head or potential head checks for available processing power, starting with step 618 where the head or potential head checks whether it has a fast processor. If so, then the head or potential head adds three to the current ranking value in step 620. If not, then the head or potential head returns the ranking value in step 626 and continues processing at step 304 of flowchart 300 shown in FIG. 3.
After adding three to the current ranking value in step 620, the head or potential head checks whether greater than 50% of the processor is available in step 622. The level of available processor power is a affected by factors including but not limited to the type of processor being used, the number of tasks the processor being executed, and how compute-intensive the tasks are. The level of available processor power may be determined by any appropriate method known to a person having ordinary skill in the art. If greater than 50% of the processor is available, then the head or potential head adds two to the current ranking value and returns the ranking value in step 626 as described above. If greater than 50% of the processor is not available in step 622, then the head or potential head simply returns the current ranking value in step 626 as described above. Determining a ranking value is not limited to checking available memory and processing power. Consistent with an embodiment of the present invention, other system resources could be checked and used for determining a ranking value, for example, network bandwidth, available disk space or other storage, and input/output loads.
FIG. 7 shows a computer system 700 which includes a processor 702, storage 704, which includes head software 718 programmed to perform the functions of a head, and receiver software 716 programmed to perform the functions of a receiver, a ranking value 722, a cache 717, and a list of heads 724. Computer system 700 also includes a network connection 720, an input device 708, output device 710, computer readable medium 712, and computer readable input device 714. Each of the nodes in network 100 may be a computer system such as computer system 700, connected other nodes in the network via network connection 720. Since the same node can be a receiver and also a head, head software 718 and receiver software 716 are both shown as being part of system 700 inside storage 704.
A person of ordinary skill in the art will understand that data processing system 700 may also contain additional information, such as input/output lines; input devices, such as a keyboard, a mouse, and a voice input device; and display devices, such as a display terminal. Input device 708 may be a floppy disk drive, CD ROM reader, or DVD reader, that reads computer instructions stored on a computer readable medium, such as a floppy disk, a CD ROM, or a DVD drive. Data processing system 700 also may include application programs, operating systems, data, etc., which are not shown in the figure for the sake of clarity. It also will be understood that data processing system 700 may also include numerous elements not shown, such as disk drives, keyboards, display devices, network connections, additional memory, additional CPUs, LANs, input/output lines, etc.
In the following discussion, it will be understood that the steps of methods and flow charts discussed preferably are performed by an appropriate processor 702 executing instructions stored in storage 704. It will also be understood that the invention is not limited to any particular implementation or programming technique and that the invention may be implemented using any appropriate techniques for implementing the functionality described herein. The invention is not limited to any particular programming language or operating system.
The instructions in storage 704 may be read from computer-readable medium 712. Execution of sequences of instructions contained in storage 704 causes processor 702 to perform the process steps described herein. In alternative embodiments, hard-wired circuitry may be used in place of or in combination with software instructions to implement the invention. Thus, embodiments of the invention are not limited to any specific combination of hardware circuitry and software.
The term “computer-readable medium” as used herein refers to any medium that participates in providing instructions to a processor for execution. Such a medium may take many forms, including but not limited to, non-volatile media, volatile media, and transmission media. Non-volatile media includes, for example, optical or magnetic disks, such as a storage device. Volatile media includes dynamic memory. Transmission media include coaxial cables, copper wire and fiber optics, including the wires that comprise a bus within a computer. Transmission media can also take the form of acoustic or light waves, such as those generated during radio-wave and infra-red data communications.
Common forms of computer-readable media include, for example a floppy disk, a flexible disk, a hard disk, magnetic tape, or any other magnetic medium, a CD-ROM, any other optical medium, punch cards, paper tapes, any other physical medium with patterns of holes, a RAM, a PROM, an EPROM, a FLASH-EPROM, any other memory chip or cartridge, a carrier wave as described hereafter, or any other medium from which a computer can read.
Various forms of computer readable media may be involved in carrying one or more sequences of one or more instructions to a processor for execution. For example, the instructions may initially be carried on a magnetic disk of a remote computer. The remote computer can load the instructions into its dynamic memory and send the instructions over a telephone line using a modem. A modem local to the computer system can receive the data on the telephone line and use an infra-red transmitter to convert the data to an infra-red signal. An infra-red detector coupled to a bus can receive the data carried in the infra-red signal and place the data on the bus. The bus carries data to main memory, from which a processor retrieves and executes the instructions. The instructions received by main memory may optionally be stored on a storage device either before or after execution by a processor. The instructions can also be transmitted via a carrier wave in a network, such as a LAN, a WAN, or the Internet.
FIG. 8 shows a computer system 800 which includes a processor 802, storage 804, which includes receiver software 816 programmed to perform the functions of a receiver, a ranking value 822, a cache 818, and a list of heads 822. Computer system 800 also includes a network connection 820, an input device 808, output device 810, computer readable medium 812, and computer readable input device 814. Each of the nodes in network 100 may be a computer system such as computer system 800, connected other nodes in the network via network connection 820. Since the same node can be a receiver and also a head, head software 818 and receiver software 816 are both shown as being part of system 800 inside storage 804.
A person of ordinary skill in the art will understand that data processing system 800 may also contain additional information, such as input/output lines; input devices, such as a keyboard, a mouse, and a voice input device; and display devices, such as a display terminal. Input device 808 may be a floppy disk drive, CD ROM reader, or DVD reader, that reads computer instructions stored on a computer readable medium, such as a floppy disk, a CD ROM, or a DVD drive. Data processing system 800 also may include application programs, operating systems, data, etc., which are not shown in the figure for the sake of clarity. It also will be understood that data processing system 800 may also include numerous elements not shown, such as disk drives, keyboards, display devices, network connections, additional memory, additional CPUs, LANs, input/output lines, etc.
It will be understood that the steps of methods and flow charts discussed preferably are performed by an appropriate processor 802 executing instructions stored in storage 804. It will also be understood that the invention is not limited to any particular implementation or programming technique and that the invention may be implemented using any appropriate techniques for implementing the functionality described herein. The invention is not limited to any particular programming language or operating system.
The instructions in storage 804 may be read from computer-readable medium 812. Execution of sequences of instructions contained in storage 804 causes processor 802 to perform the process steps described herein. In alternative embodiments, hard-wired circuitry may be used in place of or in combination with software instructions to implement the invention. Thus, embodiments of the invention are not limited to any specific combination of hardware circuitry and software.
FIG. 9 shows an example of a multicast advertisement message packet format 900 which is used in an embodiment consistent with the present invention. Packet format 900 contains a packet header 902. Packet header 902 is used for processing the advertisement message packet and includes fields indicating at least the following: a source address 906, a source address port 908, a destination address 910, and a destination port 912. These fields are included in a typical multicast message packet format. Also included in the packet header of an advertisement message are a ranking value 914 associated with the advertising head, a message type 916 indicating that the packet is an advertisement message, and a field 920 indicating a current TTL (Time to Live). The TTL is used in conjunction with the ranking value by a potential group member in picking which head is the best. The potential group member uses the number of hops to determine how far way the head is from the potential group member, and uses the TTL to determine how old the advertisement is. Better heads are closer to the potential group member and have more recent advertisements.
There are two kinds of multicast messages: control messages and data messages. Control messages are used for tasks such as setting up the multicast data distribution set-up (also known as a multicast repair tree) and for advertising for group members. Control messages typically contain only protocol-related information and are used for communication between nodes in the multicast data distribution set-up, for example when a receiver sends a receipt of acknowledgment to a head. Data messages contain data which the sender distributes to the receivers in the multicast group.
Multicast advertisement message packet format 900 is an example of a control message used in an embodiment consistent with the present invention and includes a Ranking Value field 914. Heads send out multicast advertisement messages according to packet format 900 to potential group members. Ranking Value 914 may be a bit, a flag, a signal, or any similar means for setting a value.
Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS5754939 *Oct 31, 1995May 19, 1998Herz; Frederick S. M.System for generation of user profiles for a system for customized electronic identification of desirable objectsUS5835087 *Oct 31, 1995Nov 10, 1998Herz; Frederick S. M.System for generation of object profiles for a system for customized electronic identification of desirable objectsUS5983366 *Mar 19, 1997Nov 9, 1999Optimay CorporationData processing system having monitoring of software activityUS6029195 *Dec 5, 1997Feb 22, 2000Herz; Frederick S. M.System for customized electronic identification of desirable objects* Cited by examinerNon-Patent CitationsReference1D. Katz, RFC 2113 entitled "IP Router Alert Option", published Feb. 1997.2Douglas E. Comer, Chapter 17, entitled "Multicast Addressing (IGMP)" in Book entitled "Internetworking with TCP/IP vol. 1 Principles, Protocols, and Architecture" 2nd Edition, published by Prentice Hall, 1991, pp. 281-290.3 *Multicast Addressing Douglas E. Comer PP 281-290, 1991.* Cited by examinerReferenced byCiting PatentFiling datePublication dateApplicantTitleUS6275859 *Oct 28, 1999Aug 14, 2001Sun Microsystems, Inc.Tree-based reliable multicast system where sessions are established by repair nodes that authenticate receiver nodes presenting participation certificates granted by a central authorityUS6501763 *May 6, 1999Dec 31, 2002At&T Corp.Network-based service for originator-initiated automatic repair of IP multicast sessionsUS6507562Jun 18, 1999Jan 14, 2003Sun Microsystems, Inc.Dynamic optimization for receivers using distance between a repair head and a member station in a repair group for receivers having a closely knit topological arrangement to locate repair heads near the member stations which they serve in tree based repair in reliable multicast protocolUS6567929 *Jul 13, 1999May 20, 2003At&T Corp.Network-based service for recipient-initiated automatic repair of IP multicast sessionsUS6724770 *Feb 17, 2000Apr 20, 2004Kenneth P. BirmanMulticast protocol with reduced buffering requirementsUS6757843 *Oct 26, 2000Jun 29, 2004Sun Microsystems, Inc.Method and apparatus for using ranking to select repair nodes in formation of a dynamic tree for multicast repairUS6775831 *Feb 11, 2000Aug 10, 2004Overture Services, Inc.System and method for rapid completion of data processing tasks distributed on a networkUS6785245 *Oct 20, 1999Aug 31, 2004Nortel Networks LimitedMethod and apparatus for controlling fanout of a multicast treeUS7257642 *Nov 1, 2000Aug 14, 2007Surp Communication Solutions Ltd.Channel load balancingUS7400577 *Feb 25, 2004Jul 15, 2008Microsoft CorporationMethods and systems for streaming dataUS7424003Mar 8, 2004Sep 9, 2008Surf Communication SolutionsMulti-parameter scheduling in communication systemsUS7490328Mar 11, 2001Feb 10, 2009Surf Communication Solutions, Ltd.Method and apparatus for allocating processor pool resources for handling mobile data connectionsUS7548966Jul 28, 2003Jun 16, 2009Huawei Technologies Co., Ltd.Multi-layer user management method for multicasting proxyUS7590889 *Jun 23, 2004Sep 15, 2009At&T Intellectual Property Ii, L.P.Network-based service for the repair of IP multicast sessionsUS7620847 *Jan 26, 2009Nov 17, 2009At&T Intellectual Property Ii, L.P.Network-based service for the repair of IP multicast sessionsUS7689661 *Mar 30, 2010Parallel Networks, LlcMethod and system for community data cachingUS7890701Feb 15, 2011Parallel Networks, LlcMethod and system for dynamic distributed data cachingUS7975032Jul 5, 2011Parallel Networks, LlcMethod and system for community data cachingUS8135812Jul 5, 2011Mar 13, 2012Parallel Networks, LlcMethod and system for community data cachingUS8205044Jun 19, 2012Parallel Networks, LlcMethod and system for dynamic distributed data cachingUS8271628Sep 18, 2012Parallel Networks, LlcMethod and system for community data cachingUS8504663Sep 13, 2012Aug 6, 2013Parallel Networks, LlcMethod and system for community data cachingUS8572326Jun 18, 2012Oct 29, 2013Parallel Networks, LlcMethod and system for dynamic distributed data caching when a source of data is not availableUS8751865Jul 30, 2013Jun 10, 2014At&T Intellectual Property Ii, L.P.Network-based service for the repair of IP multicast sessionsUS9210236Oct 29, 2013Dec 8, 2015Parallel Networks, LlcMethod and system for dynamic distributed data cachingUS9270475Jun 6, 2014Feb 23, 2016At&T Intellectual Property Ii, L.P.Network-based service for the repair of IP multicast sessionsUS20030140147 *Mar 11, 2001Jul 24, 2003Amnon GavishAlways-on access server poolUS20040059803 *Jul 28, 2003Mar 25, 2004Zhi HengMulti-layer user management method for multicasting proxyUS20050185578 *Feb 25, 2004Aug 25, 2005Microsoft CorporationMethods and systems for streaming dataUS20050195826 *Mar 8, 2004Sep 8, 2005Surf Communication Solutions Ltd.Multi-parameter scheduling in communication systemsUS20060262806 *May 19, 2005Nov 23, 2006Imed BouaziziSystem and method for data deliveryUS20080294745 *Aug 5, 2008Nov 27, 2008Parallel Networks, LlcMethod and System for Community Data CachingUS20100185745 *Jul 22, 2010Parallel Networks, LlcMethod and System for Community Data CachingUS20100241810 *Sep 23, 2010Parallel Networks, LlcMethod and System for Dynamic Distributed Data CachingUS20110161421 *Jun 30, 2011Parallel Networks, LlcMethod and system for dynamic distributed data cachingUS20120173620 *Jul 5, 2012Microsoft CorporationCreation and management of resilient wireless groupsEP1388972A1 *Jul 25, 2003Feb 11, 2004Huawei Technologies Co., Ltd.Multi-layer multicast user management method* Cited by examinerClassifications U.S. Classification714/18International ClassificationH04L12/56, H04L1/16, H04L12/18Cooperative ClassificationH04L12/185, H04L12/1863, H04L45/04, H04L45/16, H04L45/46European ClassificationH04L12/18M, H04L45/46, H04L45/04, H04L45/16Legal EventsDateCodeEventDescriptionJul 13, 1998ASAssignmentOwner name: SUN MICROSYSTEMS, INC., CALIFORNIAFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:WESLEY, JOSEPH S.;HURST, STEPHEN H.;KADANSKY, MIRIAM C.;AND OTHERS;REEL/FRAME:009312/0122Effective date: 19980511Jul 7, 2004FPAYFee paymentYear of fee payment: 4Jul 22, 2008FPAYFee paymentYear of fee payment: 8Jul 11, 2012FPAYFee paymentYear of fee payment: 12Dec 12, 2015ASAssignmentOwner name: ORACLE AMERICA, INC., CALIFORNIAFree format text: MERGER AND CHANGE OF NAME;ASSIGNORS:ORACLE USA, INC.;SUN MICROSYSTEMS, INC.;ORACLE AMERICA, INC.;REEL/FRAME:037278/0649Effective date: 20100212RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services