메뉴 건너뛰기




Volumn 2, Issue , 2003, Pages 1619-1624

On the Predictability of Data Network Traffic

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; CORRELATION METHODS; DAMPING; STATE SPACE METHODS; TELECOMMUNICATION TRAFFIC; TOPOLOGY;

EID: 0142200301     PISSN: 07431619     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (17)

References (20)
  • 3
    • 0002846908 scopus 로고    scopus 로고
    • Analysis and design of an adaptive virtual queue (AVQ) algorigthm for active queue management
    • S. Kunniyur and R. Srikant, "Analysis and design of an adaptive virtual queue (AVQ) algorigthm for active queue management," in SIGCOMM, 2001.
    • (2001) SIGCOMM
    • Kunniyur, S.1    Srikant, R.2
  • 4
    • 0142164270 scopus 로고    scopus 로고
    • C. A. for Internet Data Analysis (CAIDA), "http://www.caida.org."
  • 5
    • 0031274649 scopus 로고    scopus 로고
    • Wide-area internet traffic patterns and characteristics
    • K. Thompson, G. J. Miller, and R. Wilder, "Wide-area internet traffic patterns and characteristics," IEEE Network, vol. 11, 1997.
    • (1997) IEEE Network , vol.11
    • Thompson, K.1    Miller, G.J.2    Wilder, R.3
  • 6
    • 0001994082 scopus 로고
    • Connections with muliple congested gateways in packet-switched networks part 1: One-way traffic
    • S. Floyd, "Connections with muliple congested gateways in packet-switched networks part 1: One-way traffic," Computer Communication Review, vol. 21, pp. 30-47, 1991.
    • (1991) Computer Communication Review , vol.21 , pp. 30-47
    • Floyd, S.1
  • 9
    • 0033893168 scopus 로고    scopus 로고
    • End-to-end congestion control: Utility functions, random loss and ECN marks
    • March
    • S. Kunniyur and R. Srikant, "End-to-end congestion control: Utility functions, random loss and ECN marks," in Proceedings of INFOCOM 2000, March, 2000.
    • (2000) Proceedings of INFOCOM 2000
    • Kunniyur, S.1    Srikant, R.2
  • 11
    • 0033644992 scopus 로고    scopus 로고
    • TCP is max-plus linear
    • F. Baccelli and D. Hong, "TCP is max-plus linear," Proc. of ACMSIGCOMM, vol. 30, No. 4, pp. 219-230, 2000.
    • (2000) Proc. of ACMSIGCOMM , vol.30 , Issue.4 , pp. 219-230
    • Baccelli, F.1    Hong, D.2
  • 13
    • 0038486525 scopus 로고    scopus 로고
    • TCP/IP traffic dynamics and network performance: A lesson in workload modeling, flow control, and trace-driven simulations
    • Y. Joo, V. Ribeiro, A. Feldmann, A. C. Gilbert, and W. Willinger, "TCP/IP traffic dynamics and network performance: A lesson in workload modeling, flow control, and trace-driven simulations," SIGCOMM Computer Communication Review, vol. 31, 2001.
    • (2001) SIGCOMM Computer Communication Review , vol.31
    • Joo, Y.1    Ribeiro, V.2    Feldmann, A.3    Gilbert, A.C.4    Willinger, W.5
  • 14
    • 0033884567 scopus 로고    scopus 로고
    • The chaotic nature of TCP congestion control
    • A. Veres and M. Boda, "The chaotic nature of TCP congestion control," in INFOCOM, pp. 1715-1723, 2000.
    • (2000) INFOCOM , pp. 1715-1723
    • Veres, A.1    Boda, M.2
  • 17
    • 0016355478 scopus 로고
    • A new look at the statistical model identification
    • H. Akaike, "A new look at the statistical model identification," in IEEE Transactions on Automatic Control, AC-19, pp. 716-723, 1974.
    • (1974) IEEE Transactions on Automatic Control , vol.AC-19 , pp. 716-723
    • Akaike, H.1
  • 18
    • 0018015137 scopus 로고
    • Modeling by shortest data description
    • J. Rissanen, "Modeling by shortest data description," Automatica, vol. 14, pp. 465-471, 1978.
    • (1978) Automatica , vol.14 , pp. 465-471
    • Rissanen, J.1
  • 19
    • 0031373091 scopus 로고    scopus 로고
    • An empirical model of HTTP network traffic
    • Kobe, Japan, April 7-11
    • B. A. Mah, "An empirical model of HTTP network traffic," (Kobe, Japan), Published in the Proceedings of INFOCOM, April 7-11, 1997.
    • (1997) Proceedings of INFOCOM
    • Mah, B.A.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.