메뉴 건너뛰기




Volumn 49, Issue 2, 2002, Pages 207-235

Understanding TCP vegas: A duality model

Author keywords

Persistent congestion; REM; TCP congestion control; TCP Vegas

Indexed keywords

PERSISTENT CONGESTION; REM; TCP CONGESTION CONTROL; TCP VEGAS;

EID: 0000769437     PISSN: 00045411     EISSN: 00045411     Source Type: Journal    
DOI: 10.1145/506147.506152     Document Type: Review
Times cited : (241)

References (36)
  • 2
    • 0035331741 scopus 로고    scopus 로고
    • REM: Active queue management
    • ATHURALIYA, S., Li, V. H., Low, S. H., AND YIN, Q. 2001. REM: Active queue management. IEEE Netw. 15, 3 May/June, 48-53.
    • (2001) IEEE Netw. , vol.15 , Issue.3 MAY-JUNE , pp. 48-53
    • Athuraliya, S.1    Li, V.H.2    Low, S.H.3    Yin, Q.4
  • 3
    • 0042533540 scopus 로고    scopus 로고
    • Extended version (Salvador, Brazil, Sept.)
    • Extended version in Proceedings of ITC17 (Salvador, Brazil, Sept.). 2001. http://netlab.caltech.edu.
    • (2001) Proceedings of ITC17
  • 5
    • 0012575261 scopus 로고    scopus 로고
    • Optimization flow control with Newton-like algorithm
    • ATHURALIYA, S., AND Low, S. H. 2000b. Optimization flow control with Newton-like algorithm. J. Telecommun. Syst. 15, 3/4, 345-358.
    • (2000) J. Telecommun. Syst. , vol.15 , Issue.3-4 , pp. 345-358
    • Athuraliya, S.1    Low, S.H.2
  • 8
    • 0003651630 scopus 로고    scopus 로고
    • Comparison of TCP Reno and TCP Vegas via fluid approximation
    • Dec.
    • BONALD, T. 1998. Comparison of TCP Reno and TCP Vegas via fluid approximation. In Worksohop on the Modeling of TCP. Dec. http : //www.dmi.ens.fr/\%7Emistral/tcpworkshop.html.
    • (1998) Worksohop on the Modeling of TCP
    • Bonald, T.1
  • 10
    • 0029394514 scopus 로고
    • TCP Vegas: End to end congestion avoidance on a global Internet
    • BRAKMO, L. S., AND PETERSON, L. L. 1995. TCP Vegas: End to end congestion avoidance on a global Internet. IEEE J. Select. Areas Commun. 13, 8 (Oct.), 1465-1480. http://cs.princeton.edu/nsg/papers/jsac-vegas.ps.
    • (1995) IEEE J. Select. Areas Commun. , vol.13 , Issue.8 OCT. , pp. 1465-1480
    • Brakmo, L.S.1    Peterson, L.L.2
  • 11
    • 0035247048 scopus 로고    scopus 로고
    • Stability and performance analysis of networks supporting elastic services
    • DE VECIANA, G., LEE, T.-J., AND KONSTANTOPOULOS, T. 2001. Stability and performance analysis of networks supporting elastic services. IEEE/ACM Trans. Netw. 9, 1 (Feb.), 2-14.
    • (2001) IEEE/ACM Trans. Netw. , vol.9 , Issue.1 FEB. , pp. 2-14
    • De Veciana, G.1    Lee, T.-J.2    Konstantopoulos, T.3
  • 12
    • 0001994082 scopus 로고
    • Connections with multiple congested gateways in packet-switched networks, Part I: One-way traffic
    • FLOYD, S. 1991. Connections with multiple congested gateways in packet-switched networks, Part I: One-way traffic. Comput. Commun. Rev. 21, 5 (Oct.).
    • (1991) Comput. Commun. Rev. , vol.21 , Issue.5 OCT.
    • Floyd, S.1
  • 13
    • 0002348257 scopus 로고
    • TCP and explicit congestion notification
    • FLOYD, S. 1994. TCP and Explicit Congestion Notification. ACM Comput. Commun. Review 24, 5, October.
    • (1994) ACM Comput. Commun. Review , vol.24 , Issue.5 OCTOBER
    • Floyd, S.1
  • 14
    • 0027647490 scopus 로고
    • Random early detection gateways for congestion avoidance
    • ROYD, S., AND JACOBSON, V. 1993. Random early detection gateways for congestion avoidance. IEEE/ACM Trans. Netw. 1, 4 (Aug.), 397-413. ftp ://ftp.ee.1bl.gov/papers/early.ps.gz.
    • (1993) IEEE/ACM Trans. Netw. , vol.1 , Issue.4 AUG. , pp. 397-413
    • Royd, S.1    Jacobson, V.2
  • 15
    • 0033907698 scopus 로고    scopus 로고
    • TCP Vegas revisited
    • IEEE Computer Society Press, Los Alamitos, Calif.
    • HENGARTNER, U., BOLLIGER, J., AND GROSS, T. 2000. TCP Vegas revisited. In Proceedings of IEEE Infocom. (Mar.). IEEE Computer Society Press, Los Alamitos, Calif.
    • (2000) Proceedings of IEEE Infocom , Issue.MAR.
    • Hengartner, U.1    Bolliger, J.2    Gross, T.3
  • 16
    • 85013623251 scopus 로고
    • Congestion avoidance and control
    • ACM, New York
    • JACOBSON, V. 1988. Congestion avoidance and control. Proceedings of SIGCOMM'88 (Aug.). ACM, New York. An updated version is available via ftp://ftp.ee.1bl.gov/papers/congavoid.ps.Z.
    • (1988) Proceedings of SIGCOMM'88 , Issue.AUG.
    • Jacobson, V.1
  • 17
    • 0035010961 scopus 로고    scopus 로고
    • Optimization based rate control for multirate multicast sessions
    • IEEE Computer Society Press, Los Alamitos, Calif.
    • KAR, K., SARKAR, S., AND TASSIULAS, L. 2001. Optimization based rate control for multirate multicast sessions. In Proceedings of IEEE Infocom (Apr.). IEEE Computer Society Press, Los Alamitos, Calif.
    • (2001) Proceedings of IEEE Infocom , Issue.APR.
    • Kar, K.1    Sarkar, S.2    Tassiulas, L.3
  • 18
    • 0346613481 scopus 로고    scopus 로고
    • Charging and rate control for elastic traffic
    • KELLY, F. P. 1997. Charging and rate control for elastic traffic. Europ. Trans. Telecom. 8, 33-37. http : //www.statslab.cam.ac.uk/~frank/elastic.html.
    • (1997) Europ. Trans. Telecom. , vol.8 , pp. 33-37
    • Kelly, F.P.1
  • 20
    • 0032027247 scopus 로고    scopus 로고
    • Rate control for communication networks: Shadosv prices, proportional fairness and stability
    • KELLY, F. P., MAULLOO, A., AND TAN, D. 1998. Rate control for communication networks: Shadosv prices, proportional fairness and stability. J. Oper. Res. Socl. 49, 3 (Mar.), 237-252.
    • (1998) J. Oper. Res. Socl. , vol.49 , Issue.3 MAR. , pp. 237-252
    • Kelly, F.P.1    Maulloo, A.2    Tan, D.3
  • 21
    • 0033893168 scopus 로고    scopus 로고
    • End-to-end congestion control schemes: Utility functions, random losses and ECN marks
    • IEEE Computer Society Press, Los Alamitos, Calif
    • KUNNIYUR, S., AND SRIKANT, R. 2000. End-to-end congestion control schemes: Utility functions, random losses and ECN marks. In Proceedings of IEEE Infocom (Mar.). IEEE Computer Society Press, Los Alamitos, Calif, http://www.ieee-infocom.org/2000/papers/401.ps.
    • (2000) Proceedings of IEEE Infocom , Issue.MAR.
    • Kunniyur, S.1    Srikant, R.2
  • 22
    • 0033905882 scopus 로고    scopus 로고
    • Charge-sensitive TCP and rate control in the Internet
    • IEEE Computer Society Press, Los Alamitos, Calif
    • LA, R., AND ANANTHARAM, V. 2000. Charge-sensitive TCP and rate control in the Internet. In Proceedings of IEEE Infocom (Mar.). IEEE Computer Society Press, Los Alamitos, Calif, http : //www. ieee-infocom.org/2000/papers/401.ps.
    • (2000) Proceedings of IEEE Infocom , Issue.MAR.
    • La, R.1    Anantharam, V.2
  • 23
    • 0031167787 scopus 로고    scopus 로고
    • The performance of TCP/IP for networks with high bandwidth-delay products and random loss
    • LAKSHMAN, T. V., AND MADHOW, U. 1997. The performance of TCP/IP for networks with high bandwidth-delay products and random loss. IEEE/ACM Trans. Netw. 5, 3 (June), 336-350. http : //www.ece.ucsb.edu/Faculty/Madhow/Publications/ton97.ps.
    • (1997) IEEE/ACM Trans. Netw. , vol.5 , Issue.3 JUNE , pp. 336-350
    • Lakshman, T.V.1    Madhow, U.2
  • 25
    • 0033355765 scopus 로고    scopus 로고
    • Optimization flow control. I: Basic algorithm and convergence
    • Low, S. H., AND LAPSLEY, D. E. 1999. Optimization flow control. I: Basic algorithm and convergence. IEEE/ACM Trans. Netw. 7, 6 (Dec.), 861-874. http://netlab.caltech.edu.
    • (1999) IEEE/ACM Trans. Netw. , vol.7 , Issue.6 DEC. , pp. 861-874
    • Low, S.H.1    Lapsley, D.E.2
  • 27
    • 0003208595 scopus 로고    scopus 로고
    • Understanding vegas: A duality model
    • ACM, New York
    • Low, S. H., PETERSON, L., AND WANG, L. 2001. Understanding Vegas: A duality model. In Proceedings of ACM Sigmetrics (June). ACM, New York, http : //netlab.caltech.edu/pub.html.
    • (2001) Proceedings of ACM Sigmetrics , Issue.JUNE
    • Low, S.H.1    Peterson, L.2    Wang, L.3
  • 28
    • 0031175629 scopus 로고    scopus 로고
    • The macroscopic behavior of the TCP congestion avoidance algorithm
    • MATHIS, M., SEMKE, J., MAHDAVI, J., AND OTT, T. 1997. The macroscopic behavior of the TCP congestion avoidance algorithm. ACM Comput. Commun. Rev. 27, 3 (July), http://www.psc.edu/ networking/papers/model_ccr97.ps.
    • (1997) ACM Comput. Commun. Rev. , vol.27 , Issue.3 JULY
    • Mathis, M.1    Semke, J.2    Mahdavi, J.3    Ott, T.4
  • 30
    • 0034297878 scopus 로고    scopus 로고
    • Fair end-to-end window-based congestion control
    • MO, J., AND WALRAND, J. 2000. Fair end-to-end window-based congestion control. IEEE/ACM Trans. New. 8, 5 (Oct.), 556-567.
    • (2000) IEEE/ACM Trans. New. , vol.8 , Issue.5 OCT. , pp. 556-567
    • Mo, J.1    Walrand, J.2
  • 33
    • 0002990537 scopus 로고    scopus 로고
    • End-to-end routing behavior in the Internet
    • ACM, New York
    • PAXSON, V. 1996. End-to-end routing behavior in the Internet. In Proceedings of SIGCOMM'96 (Aug.). ACM, New York.
    • (1996) Proceedings of SIGCOMM'96 , Issue.AUG.
    • Paxson, V.1
  • 35
    • 0025433940 scopus 로고
    • A binary feedback scheme for congestion avoidance in computer networks
    • RAMAKRISHNAN, K. K., AND JAIN, R. 1990. A binary feedback scheme for congestion avoidance in computer networks. ACM Trans. Comput. Syst. 8, 2 (May), 158-181.
    • (1990) ACM Trans. Comput. Syst. , vol.8 , Issue.2 MAY , pp. 158-181
    • Ramakrishnan, K.K.1    Jain, R.2


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