Dynamics of congestion control and avoidance of two-way traffic in an OSI testbed

Wilder, R.; Ramakrishnan, K. K.; Mankin, Allison

doi:10.1145/122419.122422

Cited by 26 publications

(4 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It has also been observed when the two streams share buffers at the end points [54], the case here. ACK compression was found to exist in simulations of larger topologies [93] and in traces of live networks [88]. ACK compression is reduced with a delayed ACK strategy (acknowledging every nth packet), but this only has a significant effect with smaller window sizes [93].…”

Section: Overhead Experimentsmentioning

confidence: 99%

See 1 more Smart Citation

A GridFTP Overlay Network Service

Rizk

Kiddle

Simmonds

2006

2006 7th IEEE/ACM International Conference on Grid Computing

View full text Add to dashboard Cite

show abstract

Section: Overhead Experimentsmentioning

confidence: 99%

“…The behavior of the link for the split connection resembles ACK-compression [93,88]. ACK-compression describes a state in which two or more TOP connections transferring data in opposite directions share a queue or buffer.…”

Section: Overhead Experimentsmentioning

confidence: 99%

A GridFTP Overlay Network Service

Rizk

Kiddle

Simmonds

2006

2006 7th IEEE/ACM International Conference on Grid Computing

View full text Add to dashboard Cite

show abstract

“…Both CSFQ [19] and CORELITE [16] move their feedback along the core-edge path, so that information is exchanged between core routers and edge routers.…”

Section: Related Workmentioning

confidence: 99%

Twofold control loop network‐level congestion control

Calvagna¹,

Tropea²

2006

Trans Emerging Tel Tech

View full text Add to dashboard Cite

SUMMARYActive monitoring of a network's congestion level can be coupled with network-level traffic control to maximise usage of bandwidth resources and avoid congestion. Explicit signalling between nodes has been introduced in literature to enable novel congestion control schemes. In this paper, we present a hybrid scheme to support distributed congestion avoidance, in which explicit feedback signalling flows along the core-node to next core-node closed circuit and along the core-node to edge-node closed circuit. Our main goals have been unresponsive traffic regulation, independent of transport protocol; max-min fairness among end-to-end flows with no need for stateful core routers and friendliness to QoS router mechanisms. We present edge nodes and core nodes regulation algorithms, and show results of extensive tests done on a real implementation.

show abstract

“…For lack of a more accurate model, previous studies that simulate flow control, congestion control, multiple access protocols, and traffic dynamics in general have been forced to assume a rather simple traffic model [Demers89], [Floyd91], [Wilder91], [Will91], [Zhang90], [Zhang91]. These studies either use a continuous bulk transfer or an arbitrary mix of bulk and interactive traffic.…”

Section: Traffic Breakdownmentioning

confidence: 99%

Characteristics of wide-area TCP/IP conversations

Cáceres

Danzig

Jamin

et al. 1991

Proceedings of the Conference on Communications Architecture &Amp; Protocols

145

View full text Add to dashboard Cite

In this paper, we characterize wide-area network applications that use the TCP transport protocol. We also describe a new way to model the wide-area traffic generated by a stub network. We believe the traffic model presented here will be useful in studying congestion control, routing algorithms, and other resource management schemes for existing and future networks.Our model is based on trace analysis of TCP/IP widearea internetwork traffic. We collected the TCP/IP packet headers of USC, UCB, and Bellcore networks at the point they connect with their respective regional access networks. We then wrote a handful of programs to analyze the traces. Our model characterizes individual TCP conversations by the distributions of: number of bytes transferred, duration, number of packets transferred, packet size, and packet interarrival time.Our trace analysis shows that both interactive and bulk transfer traffic from all sites reflect a large number of short conversations. Similarly, it shows that a very large percentage of traffic is bidirectional, even for bulk transfer. We observed that interactive applications send significantly different amounts of data in each direction of a conversation, and that interarrival times for interactive applications closely follow a constant plus exponential model. Half of the conversations are directed to a handful of networks, but the other half are directed to hundreds of networks. Many of these observations contradict commonly held beliefs regarding wide-area traffic. This research was supported by an equipment grant from the Charles Lee Powell Foundation. Ramón Cáceres was supported by the NSF and DARPA under Cooperative Agreement NCR-8919038 with CNRI, by AT&T Bell Laboratories, Hitachi, a University of California MICRO grant, and ICSI. Introduction"The key issue in the design or selection of a congestion management scheme is the traffic pattern, and traffic patterns are dependent upon the application [Jain90]." This paper presents conversation level analysis of wide-area TCP traces collected on two campus networks-University of Southern California (USC) and University of California, Berkeley (UCB), and one industrial research site-Bellcore. Most of the analysis was done as part of term projects for graduate courses in performance evaluation and distributed systems at the University of Southern California. Our goal was to collect information that would be useful in evaluating future network designs. Since TCP packets make up roughly 80% of all wide-area network traffic, 1 a model based on TCP traffic is necessary to study network behavior. We restrict our discussion to TCP in this paper. Table 1 summarizes our most important results.When simulating new congestion, flow control, and routing algorithms one needs to model the overall pattern of traffic flowing through the network, from distribution of packet sizes and interarrival times to characteristics such as distribution of host reference patterns and direction of traffic flow. Current practice is to use FTP and TELNET so...

show abstract

Dynamics of congestion control and avoidance of two-way traffic in an OSI testbed

Cited by 26 publications

References 14 publications

A GridFTP Overlay Network Service

A GridFTP Overlay Network Service

Twofold control loop network‐level congestion control

Characteristics of wide-area TCP/IP conversations

Contact Info

Product

Resources

About