... researchers[*]
Sally Floyd, Van Jacobson and others, End-to-end mailing list end2end-tf@isi.edu, 1994. 
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... group[*]
The mechanism describing this negotiation is not given. 
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... switches[*]
ATM switches perform cell routing, and so are analogous to routers in packet-switched networks. 
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... RBCC[*]
Rate-Based Congestion Control. 
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... TRUMP[*]
a reshuffled acronym standing for Reliable Unicast Transport Protocol. 
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... passing[*]
Protocols such as TCP and TP4 associate two data streams between a pair of connected endpoints; one in each direction. 
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... connection[*]
i.e uniquely identifies the connection for both the source and destination. 
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... RBCC[*]
Rate Based Congestion Control 
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... router[*]
Note that $R$ may be $\infty$ when there is no bottleneck router. 
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... language[*]
This code is abstracted from the file router/rbcc.c in the modified REAL network simulator, described in Chapter 8. 
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... ABTs[*]
One for the data flow and one for the acknowledgment flow. 
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
...-sim[*]
Written by Norm Hutchinson and Larry Peterson and others at the University of Arizona and elsewhere. 
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... code[*]
Comment lines are excluded, and the source has been formatted with the indent(1) program. 
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... flows[*]
i.e flows no longer crossing through the router. 
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... seconds[*]
In fact, for all scenarios, TCP Reno and TCP Vegas get the jump on TRUMP by transmitting without performing any handshaking. Similarly, neither Reno nor Vegas perform connection termination. 
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... curve[*]
Strictly speaking, the derivative of the sequence number curve. 
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... congested[*]
i.e. buffer sizes do not exceed one packet. 
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... generated[*]
The 4.4BSD rand() function was used, which conforms to the ANSI C standard. For each scenario generated, it was seeded with the current time in seconds since 1970. There was a delay of at least 100 seconds between the generation of each scenario. 
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... 0.84:0.99[*]
Normalised utilisation: a utilisation of 1.00 is full utilisation. 
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... change[*]
The time resolution in REAL 4.0 is 1 microsecond. 
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... fifth[*]
A run of 500 scenarios for a particular 5-tuple typically takes between 7 and 10 hours to complete. It is infeasible to thoroughly explore the 5-space. 
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... processor[*]
The macro processor used is the C preprocessor. 
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.