US 7,020,714 B2Grant
System and method of source based multicast congestion control
Issue Date:2006-03-28
•17 Claims
•9 Drawing Sheets
Abstract
The present invention provides for a method of congestion control for multicast transmission that is entirely managed at the source of the transmission. The various types of filters as well as round trip time estimators (130) that are used in the invention to determine when the rate of the multicast transmission should be reduced to alleviate congestion. The source of the transmission adjusts the rate of transmission based on loss indications that the receivers would otherwise transmit.
Metadata
Assignee
- Rensselaer Polytechnic Institute
Inventors
- Shivkumar Kalyanaraman
- Neelkanth Natu
- Priya Rajagopal
- Puneet Thapliyal
- Fnu Sidhartha
- Jiang Li
Application Information
Application Number:US 10/240,323
Filing Date:2001-04-06
Priority Date:2000-04-06
Art Unit:2143
Classifications
IPC:
G06F15/16
Patent Drawings (9 sheets)
Description
Cross-Reference to Related Applications
[0001] This application is a 371 of PCT/US01/11119 filed Apr. 6, 2001 which claims benefit of U.S. Provisional Patent Application Ser. No. 60/195,553 filed on Apr. 6, 2000 which claims benefit of U.S. Provisional Patent Application 60/247,027 filed Nov. 9, 2000.
Field of the Invention
[0002] The present invention involves a system and method of source-based multicast congestion control.
Background of the Invention
[0003] As a greater number of people begin to access the Internet through high speed connections, the content offered is expanding. Video and audio broadcasting over the internet is extremely appealing because the potential audience is extremely large and the cost of broadcasting is far less than traditional broadcasting methods. One method of broadcasting video and audio streams over the Internet is Multicasting.
[0004] Multicasting is one of the types of packets that the Internet Protocol Version 6 (“IPv6”) supports. It is communication between a single source and multiple receivers on a network. Unicast, the more common method of transmission over the Internet, is communication between a single source and single receiver. Multicasting is used to send files to multiple users at the same time somewhat as radio and TV programs are broadcast to many people at the same time. Typical uses of multicast include audio/video streaming and periodic issuance of online newsletters.
[0005] The multicast backbone (“MBone”) uses a of a portion of the Internet for Internet Protocol multicasting. The MBone consists of servers that are equipped to handle multicast protocol. An MBone router that is sending a packet to another MBone router through a non-MBone part of the Internet encapsulates the multicast packet as a unicast packet. The non-MBone routers simply see an ordinary packet. The destination MBone router unencapsulates the unicast packet and forwards it appropriately.
[0006] It is important that the MBone's use of the portions of the Internet that are not equipped to handle multicast protocol be Transmission Control Protocol (“TCP”) friendly. TCP is a protocol used along with IP to send data in the form of message units between computers over the Internet. While IP handles the actual delivery of the data, TCP keeps track of the individual units of data (packets) that a message is divided into for efficient routing through the Internet. When a multicast transmission is sent over a portion of the Internet that is not equipped to handle multicast protocol, the transmission of packets should be at the same rate that TCP would transmit them. This is called a TCP-friendly transmission rate. An method of transmission is “TCP-friendly” if it has a congestion control scheme that maintains the arrival rate of packets at some constant over the square root of the packet loss rate.
[0007] The various multicast protocols provide methods of insuring that each packet transmitted is received. One such method entails the recipient sending an acknowledgment signal to the source when the recipient receives each packet so that the source can determine that a packet was not received if an acknowledgment signal is not received. The problem with using acknowledgement signals to determine if each transmitted packet was received for multicast signals arises when there are many recipients, as is usually the cast with multicast transmissions. In such a case, the large number of acknowledgement signals sent for each packet would cause a great deal of congestion over the Internet.
[0008] One method of reducing the congestion caused by multicast signals on the Internet, such as the method used in Pragmatic General Multicast (“PGM”), is the use of negative acknowledgement signals. In this case, when the recipient does not receive a packet that it is supposed to receive, a negative acknowledgement signal is sent to the source so that the packet can be retransmitted. While this method greatly reduces the traffic from the recipients to the source when there are low errors, it causes a great deal of congestion when many recipients are experiencing errors.
[0009] A second method of reducing the congestion caused by multicast signals on the Internet is to use aggregators. Aggregators will aggregate the various acknowledgement signals or negative acknowledgement signals into a single combined signal at the routers. This reduces the congestion problem, but it requires additional infrastructure (i.e. routers that can aggregate signals).
[0010] A third method of reducing the congestion caused by multicast signals on the Internet is to use statistical or round-robin selection of receivers to send control traffic. For statistical selection of receivers to send control traffic, those receivers that are statistically more likely to receive errors transmit control traffic (i.e. acknowledgment or negative acknowledgement signals) more often than those receivers that do not experience errors as often. While this reduces the congestion problem, it also reduces the accuracy of the error detection.
[0011] As can be seen from above, the task of providing reliable multicasting outside of the MBone causes a great deal of undesired congestion on the Internet or requires additional infrastructure. Therefore, there exists a need in the art for a system and method of congestion control for multicast transmissions that is implemented entirely at the source of the transmission without any modifications to the receivers or routers.
Summary and Objects of the Invention
[0012] Briefly, the present invention addresses the above-noted gaps. In contrast with the solutions discussed above, the present invention provides a method of congestion control for multicast transmissions that is entirely implemented at the source of the transmission. Various types of filters as well as a round trip time estimator are used to determine when the rate of the multicast transmission should be reduced to alleviate congestion.
[0013] It is, therefore, an object of the present invention to provide a method of controlling congestion generated by multicast transmissions implemented entirely at the source of the transmission.
[0014] It is further an object of this invention to provide a computer system source-based multicast congestion control comprising a processor, a computer memory, a communications system, and a multicast congestion control program. The multicast congestion control program adjusts the rate at which the processor multicasts a transmission based solely on signals the receivers would transmit without any modification.
[0015] It is another object of the present invention to provide a multicast congestion control program that comprises a round trip time estimator, a loss indication to loss event filter, a maximum linear proportional response filter, an adaptive time filter, and an additive increase multiplicative decrease module. The loss indication to loss event filter, the maximum linear proportional filter, and the adaptive time filter each receive estimates of the round trip time of the multicast from the round trip time estimator. The rate is decreased when the loss indication to loss event filter converts a loss indication to a loss event and forwards the loss event to the maximum linear proportional filter, the maximum linear proportional forwards to the adaptive time filter loss events that meet a threshold probability, the adaptive time filter eliminates excess loss events, and the additive increase multiplicative decrease module decrease the rate of transmission by half when it receives a loss event
[0016] It is further an object of the present invention that the round trip time estimator also estimates the standard deviation of the round trip time.
[0017] It is yet another object of the present invention that the round trip time estimator also estimates the smoothed round trip time.
[0018] It is further an object of the present invention that the smoothed round trip time is the round trip time plus one eighth of the smoothed round trip time minus the round trip time.
[0019] It is another object of the present invention that the round trip time is the round trip time for a congested subtree of the multicast.
[0020] It is yet another object of the present invention that the loss indication to loss event filter convert a loss indication to a loss event when the time since the previous loss event was passed to said maximum linear proportional response filter is greater than the smoothed round trip time plus twice the standard deviation.
[0021] It is further an object of the present invention that the maximum linear proportional response filter sends a loss event to the adaptive time filter if it meets a threshold probability of the maximum number of loss events from any receiver divided by the summation of loss events from each receiver.
[0022] It is another object of the present invention that the adaptive time filter eliminate excess loss events.
[0023] It is yet another object of the present invention that the method of multicast congestion control is implemented as hardware.
[0024] It is further object of the present invention that the method of multicast congestion control is implemented as software.
Brief Description of the Drawings
[0025] The foregoing brief description as well as further objects, features and advantages of the present invention will be understood more completely from the following detailed description of the presently preferred, but nonetheless illustrative embodiments of the invention, with reference being had to the accompanying drawings, in which:
[0026] FIG. 1 is a flowchart of the operation of a method of source-based multicast congestion control;
[0027] FIG. 2 is a block diagram of the operation of the rate reduction portion of a method of source-based multicast congestion control;
[0028] FIG. 3 is a flowchart of the operation of a loss indication to loss event filter;
[0029] FIG. 4 is a flowchart of the operation of a maximum linear proportional response filter;
[0030] FIG. 5 is a flowchart of the operation of an adaptive time filter;
[0031] FIG. 6 is a flowchart of the operation of a round trip time estimator
[0032] FIG. 7 is a block diagram of a multicast transmission tree.
Detailed Description of the Invention
[0033] In the following detailed description, reference is made to the accompanying drawings which form a part hereof, and in which is shown by way of illustration specific embodiments in which the invention may be practiced. These embodiments are described in sufficient detail to enable those skilled in the art to practice the invention. It is to be understood that structural changes may be made and equivalent structures substituted for those shown without departing from the spirit and scope of the present invention.
[0034] The present invention comprises a system and method of controlling congestion created by multicasting implemented entirely at the source of the multicast.
[0035] FIG. 1 illustrates the functional and logical topology of the preferred embodiment of the present invention. It is understood that those skilled in the art will know that components illustrated in FIG. 1 can be realized as hardware or software functional components.
[0036] In a preferred embodiment of the present invention, a method of congestion control is implemented for a multicast data transfer session entirely at the source of the data transfer session. This method can function without any new support from receivers, network elements or packet-header support and can leverage the underlying loss indications provided by various multicast protocols. A system implementing a negative acknowledgment (“NAK”) driven reliable multicast transport (“RMT”), such as, Pragmatic General Multicast (“PGM”), is illustrated below. The present invention, however, can also be implemented with other multicast protocols using different types of feedback, such as, for example, acknowledgment signals and hierarchical acknowledgment signals.
[0037] The present invention consists of a purely source-based cascaded set of filters and Round Trip Time (“RTT”) estimation modules feeding into a rate-based Additive Increase/Multiplicative Decrease (“AIMD”) module as illustrated in FIG. 1 . The filters are designed to address the Drop-to-Zero problem and TCP-unfriendliness.
[0038] Drop-to-Zero is the problem of reacting to more loss indications (“LIs”) than is necessary leading to an extreme slowdown of the multicast's flow rate. This occurs because the multicast flow receives LIs from multiple paths and may not filter LIs sufficiently. TCP-unfriendliness is the problem of reacting to less LIs than a hypothetical TCP flow would on the worst loss path.
[0039] When a multicast data transfer session is started 110, as shown in FIG. 1 , the rate increase timer is set to the round trip time (“RTT”)+twice the standard deviation (“D”) from the RTT 111. The RTT is the amount of time it takes for a transmission to go from the source 700, as shown in FIG. 7 , to receivers 703, 704, 706, and 707 plus the time for a NAK to go from receivers 703, 704, 706, and 707 to source 700. The RTT estimate is calculated based on a congested subtree and not the entire tree. A congested subtree includes all paths from Source 700 to receivers which have at least one bottleneck, i.e. points where demand outstrips capacity. Thus, the true RTT of the entire tree is not being measured. Instead, the RTT of the congested subtree is being measured because it is operationally useful in setting the congestion epoch and leads to robust stability.
[0040] Once the multicast data transfer is started 110, source 700 sends a packet 120. The variable Tsend is set to the sending time of the packet 121 to keep track of how long it has been since the packet has been sent.
[0041] When the rate increase timer expires 130, the transmission rate should be increased. Rate increases are performed in the absence of new NAKs. When there are no new NAKs, the rate is increased by MSS (a constant) divided by RIT+2D 132. An important question is “how long should the rate-increase timer be set for?” In congestion avoidance phase (steady state) TCP increases its window by a constant (MSS) approximately once per RTT. In the present invention, if the congestion flag is set to false (i.e. not congested) 131, the rate-increase timer is set to RTT+2D 136. Once again, RTT represents the RIT of the congested subtree because it is that portion of the tree which needs to respond to the rate-increase (i.e. signal if the rate increase has resulted in congestion).
[0042] If the congestion flag is set to true (i.e. congested) 131, the state of the silence flag becomes important. A silence flag, as well as a silence timer, is used to alleviate the retransmission ambiguity problem. When a retransmission is sent and NAKs are received it is ambiguous whether the RTT samples belong to the original transmission or due to retransmission. To counter this problem, a timestamp is not recorded when a packet is retransmitted (such as Tsend when a packet is initially transmitted). Instead, a silence period of RTT/2 is set just after the rate reduction has been effected in addition to the regular setting of the congestion epoch.
[0043] If the silence flag is set to true 133, there is no data transfer 135. If the silence flag is set to false 133, there is no increase in rate 134. In either case, the rate increase timer is set to RTT+2D 136. If the silence timer expires 140, the silence flag is set to false 141.
[0044] If the congestion epoch timer expires 150, the congestion flag is set to false (i.e. not congested). Congestion epochs are important in addressing the drop-to-zero problem because the number of congestion epochs detected during congestion is equal to the total number of rate reductions. The first new NAK received after the end of a congestion epoch is an indication that the source rate is still larger than the minimum bottleneck rate of the tree. It therefore triggers a new congestion epoch and corresponding rate-reduction.
[0045] When a loss indication is received from receiver(i) 160, RTT is estimated 161. Next, the Loss Indicator to Loss Event Filter (“LI2LEfilter”) 200 is accessed. If the LI2LE filter 200 accepts the loss indication for rate reduction 162, the maxLPRFilter 201 is accessed. If the maxLPRFilter 201 accepts the loss indication for rate reduction 163, the ATFilter 203 is accessed. If the ATFilter 203 accepts the loss indication for rate reduction 164, then the rate is halved 165.
[0046] All filters and the AIMD module 204 need RTT estimates which are fed by the RTT estimator 202. The RTT estimator 202 works similarly to the TCP timeout procedure (i.e. it calculates a smoothed RTT (SRTT) and a mean deviation which approximates the standard deviation). However, the set of samples is pruned to exclude a large fraction of samples which are smaller than 0.5SRTT (i.e. smaller by an order of magnitude) to bias the average RTT higher.
[0047] To estimate the RTT and D, the RIT estimator 202 performs the following calculations:
RTTcurrent=Tcurrent−Tsend[j] 600
δ=SRTT−RTTcurrent 601
SRTT−RTTcurrentT+0.125*δ 602
D=D+(0.125*(|δ|−D)) 603
RTTcurrent=Tcurrent−Tsend[j] 600
δ=SRTT−RTTcurrent 601
SRTT−RTTcurrentT+0.125*δ 602
D=D+(0.125*(|δ|−D)) 603
[0048] The LI2LE filter 200 converts per-receiver loss indications (“Lis”) into per-receiver loss events (“LEs”). A LE is a per-receiver binary number which is 1 when one or more LIs are generated per RTT per receiver, and 0 otherwise. The LI2LE filter 200 accepts a LI for rate reduction 162, if a new LI arrives from the receiver after a period SRTT+2D 300. In this case, the LI is converted into a LE and passed 301 and the timestamp TLastPassed is updated to the current time 302. Otherwise, the LIs are filtered 303 (i.e. nothing happens).
[0049] The maxLPRFilter 201 is a probabilistic filter that takes as input all the LEs from receivers (ΣiXi) and on the average passes the maximum number of LEs from any one receiver (i.e. maxiXi). The maxLPRFilter 201 tracks the worse path better than a LPR-Filter and is the crucial building block for drop-to-zero avoidance. It operates on per-receiver LE counts since they differ dramatically from LI counts in drop-tail networks with no self-clocking.
[0050] When the maxLPRFilter 201 receives a LE, it updates Xi, max Xi, and ΣXi 400. The threshold probability P(accept) is then set to max Xi/ΣXi 401. The maxLPRFilter 201 then checks if the LE has a probability of P(accept) 402. If the LE has a probability of P(accept), the LE is accepted for rate reduction 163. If the LE does not have a probability of P(accept), the LE is rejected for rate reduction 403.
[0051] The ATFilter 203 drops excess LEs passed by maxLPRFilter 201 in any RTT to enforce at most one rate reduction per SRTT+4D. In addition, the ATFilter 203 also imposes an optional silence period of 0.5(SRTT+4D) when no packets are sent. The goal is to reduce the probability of losing any control traffic or retransmissions during this phase.
[0052] The ATFilter 203 determines if a LE is accepted for a rate reduction 164 by filtering any LEs 501 that are passed while the congestion flag is set to true 500. If the congestion flag is not set to true 500 when an LE is passed, the silence flag is set to true 502, the silence period timer is set to 0.5RTT+2D 503, the congestion flag is set to true 504, the congestion epoch timer is set to the silence period +SRTT+4D 505, and the LE is accepted 506.
[0053] Finally, the AIMD module 204 reduces the rate by half 165 when a LE is accepted by the LI2LE filter 200, the maxLPRFilter 201, and the ATFilter 203.
[0054] In general, this work is extremely useful for multicast congestion control when it is not feasible or undesirable to provide any additional functionality at receivers or routers. This system and method can be implemented entirely at the source of a multicast transmission.
[0055] The invention provides an system and method for source-based multicast congestion control. The above description and drawings are only illustrative of preferred embodiments which achieve the objects, features and advantages of the present invention. It is not intended that the present invention be limited to the illustrated embodiments as modifications, substitutions and use of equivalent structures can be made. Accordingly, the invention is not to be considered as limited by the foregoing description, but is only limited by the scope of the appended claims.
Claims
What is claimed is:
1. A computer system computer application for source-based multicast congestion control comprising: a processor; a computer memory coupled to said processor; and a communications system coupled to said processor; a multicast congestion control program stored in said computer memory, said multicast congestion control program comprising a maximum linear proportional response filter; and wherein said multicast congestion control program adjusts the rate at which said processor multicasts a transmission to a plurality of receivers based solely on signals said receivers would transmit without any modification.
2. A computer system as in claim 1, wherein said multicast congestion control program further comprises: a round trip time estimator; a loss indication to loss event filter; an adaptive time filter; and an additive increase multiplicative decrease module; wherein said loss indication to loss event filter, said maximum linear proportional filter, and said adaptive time filter each receive estimates of the round trip time of said multicast from said round trip time estimator; and wherein said rate is decreased when said loss indication to loss event filter converts a loss indication to a loss event and forwards said loss event to said maximum linear proportional response filter, said maximum linear proportional response filter forwards loss events meeting a threshold probability to said adaptive time filter, said adaptive time filter eliminates excess loss events forwarded by said maximum linear proportional filter and forwards the remaining loss events to said additive increase multiplicative decrease module, and said additive increase multiplicative decrease module decreases said rate by half whenever said additive increase multiplicative decrease module receives a loss event.
3. A computer application as in claim 2, wherein said round trip time estimator estimates standard deviation of the round trip time of said multicast as well as said round trip time.
4. A computer application as in claim 2, wherein said round trip time estimator estimates a smoothed round trip time as well as said round trip time.
5. A computer application as in claim 4, wherein said smoothed round trip time is the round trip time plus one eighth of the smoothed round trip time minus the round trip time.
6. A computer application as in claim 5, wherein said loss indication to loss event filter converts a loss indication to a loss event and forwards said loss event to said maximum linear proportional response filter when the time since the previous loss event was passed to said maximum linear proportional response filter is greater than the smoothed round trip time plus twice the standard deviation.
7. A computer application as in claim 5, wherein said maximum linear proportional filter forwards loss events to said adaptive time filter meeting a threshold probability of the maximum number of loss events from any receiver divided by the summation of loss events from each receiver.
8. A computer application as in claim 5, wherein said adaptive time filter eliminates excess loss events forwarded by said maximum linear proportional filter and forwards the remaining loss events to said additive increase multiplicative decrease module when a congestion indicator is set to false.
9. A computer application as in claim 2, wherein said round trip time is the round trip time for a congested subtree of said multicast.
10. A computer application as in claim 2, wherein said computer application is implemented as software.
11. A computer application as in claim 1, wherein said computer application is implemented in hardware.
12. A method of source-based multicast congestion control comprising the steps of: transmitting a packet of a multicast transmission over the Internet to a plurality of receivers; receiving loss indications from said receivers; estimating the round trip time, smoothed round trip time, and standard deviation of said multicast transmission; converting loss indications to loss events; deleting said loss events if said loss events fail to meet a threshold probability; deleting said loss events such that no more than one rate reduction occurs per a function of the round trip time; reducing the rate of said multicast transmission; increasing the rate of said multicast transmission if no loss indications are received in period of time defined by a function of the round trip time.
13. A method as in claim 12, wherein said smoothed round trip time is the round trip time plus one eighth of the difference between the smoothed round trip time and the round trip time.
14. A method as in claim 12, wherein said loss indications are converted to loss events when the time since the previous loss event was converted is greater than the smoothed round trip time plus twice the standard deviation.
15. A method as in claim 12, wherein said threshold probability is the maximum number of loss events from any receiver divided by the summation of loss events from each receiver.
17. A method as in claim 12, wherein said rate is increased by a constant divided by the sum of the smoothed round trip time and twice the standard deviation.
Patent Citations (13)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US5193151(A) | 1993-03-01 | Jain | Examiner |
| US5243596(A) | 1993-09-01 | Port et al. | Applicant |
| US5313454(A) | 1994-05-01 | Bustini et al. | Examiner |
| US5838687(A) | 1998-11-01 | Ramfelt | Applicant |
| US5960002(A) | 1999-09-01 | Ramfelt et al. | Applicant |
| US5982780(A) | 1999-11-01 | Bohm et al. | Applicant |
| US6038230(A) | 2000-03-01 | Ofek | Applicant |
| US6148005(A) | 2000-11-01 | Paul et al. | Applicant |
| US6151300(A) | 2000-11-01 | Hunt et al. | Applicant |
| US6212582(B1) | 2001-04-01 | Chong et al. | Applicant |
| US6424624(B1) | 2002-07-01 | Galand et al. | Examiner |
| US6424626(B1) | 2002-07-01 | Kidambi et al. | Examiner |
| US6643259(B1) | 2003-11-01 | Borella et al. | Examiner |