Table 1: Classification of multicast congestion control protocols.

"... In PAGE 2: ... DSG [2, 3], SIM [7], and MLDA [16] are multi-group feedback-driven protocols that adjust both membership and transmission rates of the groups. Table1 classifies the mentioned prominent multicast pro- tocols with respect to their congestion control mechanisms. 3.... In PAGE 3: ... EXPERIMENTS 4.1 Experimental Methodology For each threat in our model, we evaluate one protocol from Table1 . Since our model defines threats with respect to control mechanisms, we select a representative protocol for a threat from the table row for the corresponding mechanism.... In PAGE 7: ... ANALYSIS Section 4 shows that each threat in our model victimizes at least one existing multicast protocol. Moreover, we ob- served that all the protocols from Table1 are vulnerable to receiver misbehavior. Following the threat ordering in our model, Table 2 classifies the vulnerabilities of these proto- cols.... In PAGE 7: ... Below, we discuss our findings in more detail. Among the protocols in Table1 , SAMM [19] is the only feedback-driven design where a misbehaving receiver does not benefit from its failure to report. In SAMM, the sender transmits all layers of hierarchically encoded data to a sin- gle group.... In PAGE 7: ... To protect receiver-based aggregation, a multicast protocol can employ feedback verification: if an aggregation node can detect that reports from its aggregation subtree are incor- rect or incomplete, the protocol can curb the transmission to give receivers incentives to aggregate feedback properly. Four protocols in Table1 rely on feedback suppression but... ..."

Table 1: Type of congestion control algorithms

Table 5: DCCP Congestion Control Identifiers

"... In PAGE 4: ... Table 4: DCCP Feature Numbers.....................................35 Table5 : DCCP Congestion Control Identifiers .... In PAGE 111: ...9.5. Congestion Control Identifiers Registry Each entry in the DCCP Congestion Control Identifiers (CCIDs) registry contains a CCID, which is a number in the range 0-255; the name of the CCID, such as quot;TCP-like Congestion Control quot;; and a reference to the RFC defining the CCID. The registry is initially populated using the values in Table5 (Section 10). CCIDs 2 and 3 are allocated by concurrently published profiles, and CCIDs 248-254 are permanently reserved for experimental and testing use.... ..."

Table 5: DCCP Congestion Control Identifiers

"... In PAGE 4: ... Table 4: DCCP Feature Numbers.....................................35 Table5 : DCCP Congestion Control Identifiers .... In PAGE 111: ...9.5. Congestion Control Identifiers Registry Each entry in the DCCP Congestion Control Identifiers (CCIDs) registry contains a CCID, which is a number in the range 0-255; the name of the CCID, such as quot;TCP-like Congestion Control quot;; and a reference to the RFC defining the CCID. The registry is initially populated using the values in Table5 (Section 10). CCIDs 2 and 3 are allocated by concurrently published profiles, and CCIDs 248-254 are permanently reserved for experimental and testing use.... ..."

Table 2. Reno TCP congestion control rules. Slow Start

"... In PAGE 6: ....e. a long-running connection where the length of the Slow Start phase is negligible with respect to the length of Congestion Avoidance phases. In Table2 we summarize the procedures assumed for the analysis of the congestion mechanism. Table 2.... ..."

Table 2. Reno TCP congestion control rules. Slow Start

"... In PAGE 6: ....e. a long-running connection where the length of the Slow Start phase is negligible with respect to the length of Congestion Avoidance phases. In Table2 we summarize the procedures assumed for the analysis of the congestion mechanism. Table 2.... ..."

"... In PAGE 5: ...cale (from not a problem to a major problem ). 84.3% responded that congestion is a problem in Austin and almost half felt congestion to be a major problem. An ordered probit model (Greene, 2000) was used to predict this four-level response, and results are shown in Table2 (Models 2a and 2b). Initially 407 valid weighted responses were grouped for analysis out of which 49 responses had to be excluded since they did not provide information on critical variables such as peak-hour travel distances and times.... In PAGE 5: ... As expected, people traveling longer distances and those who perceive greater time losses in peak hours find congestion to more bothersome in Austin. Table2 also gives ordered probit model results for frequency of trip modification in response to congestion (see Models 2c and 2d). Controlling for a variety of individual (and household) characteristics (including peak-hour trip-making frequency and congestion experience [measured as lost time per mile traveled during daily commute]), it can be inferred that males and older persons more frequently modify trip choices in order to avoid congestion.... ..."

Table 2. Accuracy report of the three methods for detecting lies (Vrij 2000)

"... In PAGE 12: ...1. An algorithmic approach The experimental results listed in Table2 show that the three methods introduced by Vrij are not reliable enough to detect lies. Although widely used, polygraph results are not even admissible as evidence in the Supreme Court of the United States (CNN 1997).... ..."

Table A.1 Congestion Control Algorithm Example This table shows how the four basic congestion control algorithms (slow start, con- gestion avoidance, fast retransmit and fast recovery) work as de ned by Jacobson [JK88].