메뉴 건너뛰기




Volumn 19, Issue 4, 2005, Pages 938-951

Dynamic TCP acknowledgment: Penalizing long delays

Author keywords

Acknowledgment; Competitive analysis; Data packet; Online algorithm; TCP

Indexed keywords

ALGORITHMS; INTERACTIVE COMPUTER SYSTEMS; NETWORK PROTOCOLS; NUMBER THEORY; ONLINE SYSTEMS; OPTIMAL CONTROL SYSTEMS; PACKET NETWORKS;

EID: 33751163031     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480104441656     Document Type: Article
Times cited : (12)

References (9)
  • 3
    • 0038522100 scopus 로고    scopus 로고
    • On-line analysis of the TCP acknowledgment delay problem
    • D. R. DOOLY, S. A. GOLDMAN, AND S. D. SCOTT, On-line analysis of the TCP acknowledgment delay problem, J. ACM, 48 (2001), pp. 243-273.
    • (2001) J. ACM , vol.48 , pp. 243-273
    • Dooly, D.R.1    Goldman, S.A.2    Scott, S.D.3
  • 5
    • 33751168041 scopus 로고    scopus 로고
    • private communication
    • J. NOGA, private communication, 2001.
    • (2001)
    • Noga, J.1
  • 6
    • 0037203613 scopus 로고    scopus 로고
    • A faster off-line algorithm for the TCP acknowledgment problem
    • J. NOGA, S. S. SEIDEN, AND G. J. WOEGINGER, A faster off-line algorithm for the TCP acknowledgment problem, Inform. Process. Lett., 81 (2002), pp. 71-73.
    • (2002) Inform. Process. Lett. , vol.81 , pp. 71-73
    • Noga, J.1    Seiden, S.S.2    Woeginger, G.J.3
  • 8
    • 0022012946 scopus 로고
    • Amortized efficiency of list update and paging rules
    • D. D. SLEATOR AND R. E. TARJAN, Amortized efficiency of list update and paging rules, Commun. ACM, 28 (1985), pp. 202-208.
    • (1985) Commun. ACM , vol.28 , pp. 202-208
    • Sleator, D.D.1    Tarjan, R.E.2


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