Characteristics of wide-area TCP/IP conversations

作者: Ramón Cáceres , Peter B. Danzig , Sugih Jamin , Danny J. Mitzel

DOI: 10.1145/115992.116003

关键词: Internet protocol suiteInternet ProtocolTransmission Control ProtocolAccess networkTCP Friendly Rate ControlTCP congestion-avoidance algorithmTCP global synchronizationComputer networkNetwork packetComputer scienceNetwork congestion

摘要: In this paper, we characterize wide-area network applications that use the TCP transport protocol. We also describe a new way to model traffic generated by stub network. believe presented here will be useful in studying congestion control, routing algorithms, and other resource management schemes for existing future networks. Our is based on trace analysis of TCP/IP widearea internetwork traffic. collected packet headers USC, UCB, Bellcore networks at point they connect with their respective regional access then wrote handful programs analyze traces. characterizes individual conversations distributions of: number bytes transferred, duration, packets size, interarrival time. shows both interactive bulk transfer from all sites reflect large short conversations. Similarly, it very percentage bidirectional, even transfer. observed send significantly different amounts data each direction conversation, times closely follow constant plus exponential model. Half are directed networks, but half hundreds Many these observations contradict commonly held beliefs regarding This research was supported an equipment grant Charles Lee Powell Foundation. Ramon Caceres NSF DARPA under Cooperative Agreement NCR8919038 CNRI, AT&T Bell Laboratories, Hitachi, University California MICRO grant, ICSI.

参考文章(21)
Ramon Caceres, Measurements of Wide Area Internet TraffiC University of California at Berkeley. ,(1989)
Raj Jain, Myths about Congestion Management in High Speed Networks Proceedings of the IFIP TC6 International Conference on Information Network and Data Communication, IV. pp. 55- 70 ,(1992)
John K. Ousterhout, Hervé Da Costa, David Harrison, John A. Kunze, Mike Kupfer, James G. Thompson, A trace-driven analysis of the UNIX 4.2 BSD file system symposium on operating systems principles. ,vol. 19, pp. 15- 24 ,(1985) , 10.1145/323627.323631
Peter B. Danzig, Stephen Melvin, High resolution timing with low resolution clocks and microsecond resolution timer for Sun workstations Operating Systems Review. ,vol. 24, pp. 23- 26 ,(1990) , 10.1145/90994.91003
Jeffrey C. Mogul, Network locality at the scale of processes acm special interest group on data communication. ,vol. 21, pp. 273- 284 ,(1991) , 10.1145/115992.116017
Sally Floyd, Van Jacobson, Traffic phase effects in packet-switched gateways acm special interest group on data communication. ,vol. 21, pp. 26- 42 ,(1991) , 10.1145/122419.122421
A. Demers, S. Keshav, S. Shenker, Analysis and simulation of a fair queueing algorithm acm special interest group on data communication. ,vol. 19, pp. 1- 12 ,(1989) , 10.1145/75246.75248
L. Zhang, Virtual clock: a new traffic control algorithm for packet switching networks Proceedings of the ACM symposium on Communications architectures & protocols - SIGCOMM '90. ,vol. 20, pp. 19- 29 ,(1990) , 10.1145/99508.99525
Rick Wilder, K. K. Ramakrishnan, Allison Mankin, Dynamics of congestion control and avoidance of two-way traffic in an OSI testbed acm special interest group on data communication. ,vol. 21, pp. 43- 58 ,(1991) , 10.1145/122419.122422