메뉴 건너뛰기




Volumn 1, Issue , 2006, Pages 623-628

Bounding delay through a buffer using dynamic queue thresholds

Author keywords

Control strategy; Quality of Service (QoS); Queue threshold; Queueing delay

Indexed keywords

COMPUTER SIMULATION; INTERNET; JITTER; QUALITY OF SERVICE; ROUTERS; TELECOMMUNICATION SERVICES;

EID: 33751077098     PISSN: 1550445X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/AINA.2006.117     Document Type: Conference Paper
Times cited : (8)

References (13)
  • 1
    • 0033906593 scopus 로고    scopus 로고
    • Analytical evaluation of RED performance
    • T. Bonald, M.May and J.Bolot "Analytical Evaluation of RED Performance" IEEE Infocom 2000. vol. 3, pp. 1415-1424.
    • IEEE Infocom 2000 , vol.3 , pp. 1415-1424
    • Bonald, T.1    May, M.2    Bolot, J.3
  • 2
    • 0002208362 scopus 로고    scopus 로고
    • Recommendations on queue management and congestion avoidance in the internet
    • April
    • B. Braden et al, "Recommendations on Queue Management and Congestion Avoidance in the Internet" IETF RFC 2309 April 1998.
    • (1998) IETF RFC , vol.2309
    • Braden, B.1
  • 3
    • 0027647490 scopus 로고
    • Random early detection gateways for congestion avoidance
    • August
    • S. Floyd and V. Jacobspn, "Random Early Detection Gateways for Congestion Avoidance", IEEE/ACM Transaction on Networking, Vol 1, No 4, pp. 397-413, August 1993.
    • (1993) IEEE/ACM Transaction on Networking , vol.1 , Issue.4 , pp. 397-413
    • Floyd, S.1    Jacobspn, V.2
  • 4
    • 0033294432 scopus 로고    scopus 로고
    • Ransom early marking for internet congestion control
    • Dec
    • D. Lapsley and S. Low, "Ransom Early Marking for Internet Congestion Control", Proceeding of GlobeCom'99, pp1747-1752, Dec 1999.
    • (1999) Proceeding of GlobeCom'99 , pp. 1747-1752
    • Lapsley, D.1    Low, S.2
  • 5
    • 0033901102 scopus 로고    scopus 로고
    • An enhanced random early marking algorithm for internet flow control
    • S. Athuraliya, D. Lapsley and S. Low, "An Enhanced Random Early Marking Algorithm for Internet Flow Control", Infocom, 2000, pp. 1425-1434.
    • (2000) Infocom , pp. 1425-1434
    • Athuraliya, S.1    Lapsley, D.2    Low, S.3
  • 6
    • 0001037993 scopus 로고    scopus 로고
    • Distributed connection acceptance control for a connectionless network
    • Edinburgh, Scotland, June
    • R. Gibbens and F. Kelly, "Distributed Connection Acceptance Control for a Connectionless Network", Proceeding of the 16th Intl. Teletraffic Congress, Edinburgh, Scotland, June, 1999.
    • (1999) Proceeding of the 16th Intl. Teletraffic Congress
    • Gibbens, R.1    Kelly, F.2
  • 7
    • 0033893168 scopus 로고    scopus 로고
    • End-to-end congestion control: Utility function, random losses and ECN marks
    • Israel, March
    • S. Kunniyur and R. Srikant, "End-to-End Congestion Control: Utility Function, Random Losses and ECN Marks", Proceedings of Infocom 2000, pp. 1323-1332, Israel, March, 2000.
    • (2000) Proceedings of Infocom 2000 , pp. 1323-1332
    • Kunniyur, S.1    Srikant, R.2
  • 8
    • 0034997164 scopus 로고    scopus 로고
    • A time-scale decomposition approach to adaptive ECN marking
    • Alaska, Anchorage, April
    • S. Kunniyur and R. Srikant, "A Time-Scale Decomposition Approach to Adaptive ECN Marking", Proceeding of Infocom 2001, vol. 3, pp. 1330-1339. Alaska, Anchorage, April, 2001.
    • (2001) Proceeding of Infocom 2001 , vol.3 , pp. 1330-1339
    • Kunniyur, S.1    Srikant, R.2


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