메뉴 건너뛰기




Volumn 17, Issue 6, 1999, Pages 1159-1169

Buffer management schemes for supporting TCP in gigabit routers with per-flow queueing

Author keywords

[No Author keywords available]

Indexed keywords

BUFFER STORAGE; CONGESTION CONTROL (COMMUNICATION); DATA COMMUNICATION SYSTEMS; INTERNET; QUEUEING NETWORKS; ROUTERS; SCHEDULING;

EID: 0032631390     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/49.772451     Document Type: Article
Times cited : (71)

References (24)
  • 1
    • 85000408824 scopus 로고    scopus 로고
    • Observations on the dynamics of a congestion control algorithm: The effects of two-way traffic
    • L. Zhang, S. Shenker, and D. Clark, "Observations on the dynamics of a congestion control algorithm: The effects of two-way traffic," in Proc. ACM SIGCOMM'91, pp. 133-147.
    • Proc. ACM SIGCOMM'91 , pp. 133-147
    • Zhang, L.1    Shenker, S.2    Clark, D.3
  • 3
    • 0027647490 scopus 로고
    • Random early detection gateways for congestion avoidance
    • Aug.
    • S. Floyd and V. Jacobson, "Random early detection gateways for congestion avoidance," IEEE/ACM Trans. Networking, vol. 1, pp. 397-413, Aug. 1993.
    • (1993) IEEE/ACM Trans. Networking , vol.1 , pp. 397-413
    • Floyd, S.1    Jacobson, V.2
  • 4
    • 0003168619 scopus 로고
    • On traffic phase effects in packet switched gateways
    • Sept.
    • _, "On traffic phase effects in packet switched gateways," Internetworking: Res. Experience, vol. 3, pp. 115-156, Sept. 1992.
    • (1992) Internetworking: Res. Experience , vol.3 , pp. 115-156
  • 6
    • 0026965732 scopus 로고    scopus 로고
    • A generalized processor sharing approach to flow control - The single node case
    • A. K. Parekh and R. G. Gallager, "A generalized processor sharing approach to flow control - The single node case," in Proc. INFOCOM'92, vol. 2, pp. 915-924.
    • Proc. INFOCOM'92 , vol.2 , pp. 915-924
    • Parekh, A.K.1    Gallager, R.G.2
  • 7
    • 0027148124 scopus 로고    scopus 로고
    • A generalized processor sharing approach to flow control in integrated services networks: The multiple node case
    • _, "A generalized processor sharing approach to flow control in integrated services networks: The multiple node case," in Proc. INFOCOM'93, vol. 2, pp. 521-530.
    • Proc. INFOCOM'93 , vol.2 , pp. 521-530
  • 8
    • 0002562127 scopus 로고
    • Analysis and simulation of a fair queueing algorithm
    • A. Demers, S. Keshav, and S. Shenker, "Analysis and simulation of a fair queueing algorithm," Internetworking: Res. Experience, vol. 1, no. 1, pp. 3-26, 1990.
    • (1990) Internetworking: Res. Experience , vol.1 , Issue.1 , pp. 3-26
    • Demers, A.1    Keshav, S.2    Shenker, S.3
  • 9
    • 0029756392 scopus 로고    scopus 로고
    • The drop-from-front strategy in TCP over ATM and its interworking with other control features
    • San Francisco, CA
    • T. Lakshman, A. Neidhart, and T. Ott, "The drop-from-front strategy in TCP over ATM and its interworking with other control features," in Proc. IEEE INFOCOM'96, San Francisco, CA, pp. 1242-1250.
    • Proc. IEEE INFOCOM'96 , pp. 1242-1250
    • Lakshman, T.1    Neidhart, A.2    Ott, T.3
  • 10
    • 30244448393 scopus 로고
    • Traffic management for ATM local area networks
    • Aug.
    • P. Newman, "Traffic management for ATM local area networks," IEEE Trans. Commun., vol. 42, pp. 34-50, Aug. 1994.
    • (1994) IEEE Trans. Commun. , vol.42 , pp. 34-50
    • Newman, P.1
  • 11
  • 12
    • 84890503292 scopus 로고
    • Application of sampling methodologies to network traffic characterization
    • Sept.
    • K. Claffy, C. Polyzos, and H. W. Braun, "Application of sampling methodologies to network traffic characterization," in Proc. ACM SIGCOMM'93, Sept. 1993, pp. 194-203.
    • (1993) Proc. ACM SIGCOMM'93 , pp. 194-203
    • Claffy, K.1    Polyzos, C.2    Braun, H.W.3
  • 13
    • 0032047410 scopus 로고    scopus 로고
    • Rate-proportional servers: A design methodology for fair queueing algorithms
    • Apr.
    • D. Stiliadis and A. Varma, "Rate-proportional servers: A design methodology for fair queueing algorithms," IEEE/ACM Trans. Networking, vol. 6, pp. 164-174, Apr. 1998.
    • (1998) IEEE/ACM Trans. Networking , vol.6 , pp. 164-174
    • Stiliadis, D.1    Varma, A.2
  • 14
    • 0028599989 scopus 로고
    • A self-clocked fair queueing scheme for broadband applications
    • Apr.
    • S. Golestani, "A self-clocked fair queueing scheme for broadband applications," in Proc. IEEE INFOCOM'94, Apr. 1994, pp. 636-646.
    • (1994) Proc. IEEE INFOCOM'94 , pp. 636-646
    • Golestani, S.1
  • 15
    • 0032069182 scopus 로고    scopus 로고
    • Beyond best-effort: Router architectures for the differentiated services of tomorrow's internet
    • May
    • V. Kumar, T. V. Lakshman, and D. Stiliadis, "Beyond best-effort: Router architectures for the differentiated services of tomorrow's internet," IEEE Commun. Mag., pp. 152-164, May 1998.
    • (1998) IEEE Commun. Mag. , pp. 152-164
    • Kumar, V.1    Lakshman, T.V.2    Stiliadis, D.3
  • 16
    • 85013623251 scopus 로고
    • Congestion avoidance and control
    • Aug.
    • V. Jacobson, "Congestion avoidance and control," in Proc. ACM SIGCOMM'88, Aug. 1988, pp. 314-329.
    • (1988) Proc. ACM SIGCOMM'88 , pp. 314-329
    • Jacobson, V.1
  • 17
    • 0028714290 scopus 로고
    • Performance analysis of window-based flow control using TCP/IP: The effect of high-bandwidth-delay products and random loss
    • T. V. Lakshman and U. Madhow, "Performance analysis of window-based flow control using TCP/IP: The effect of high-bandwidth-delay products and random loss," in IFIP Trans. C-26, High Performance Networking V, 1994, pp. 135-150.
    • (1994) IFIP Trans. C-26, High Performance Networking V , pp. 135-150
    • Lakshman, T.V.1    Madhow, U.2
  • 18
    • 0031167787 scopus 로고    scopus 로고
    • The performance of TCP/IP for networks with high bandwidth-delay products and random loss
    • June
    • _, "The performance of TCP/IP for networks with high bandwidth-delay products and random loss," IEEE/ACM Trans. Networking, vol. 5, pp. 336-350, June 1997.
    • (1997) IEEE/ACM Trans. Networking , vol.5 , pp. 336-350
  • 19
    • 0029755481 scopus 로고    scopus 로고
    • Dynamic queue length threshold in a shared memory ATM switch
    • Mar.
    • A. K. Choudhury and E. L. Hahne, "Dynamic queue length threshold in a shared memory ATM switch," in Proc. IEEE INFOCOM'96, Mar. 1996, pp. 679-687.
    • (1996) Proc. IEEE INFOCOM'96 , pp. 679-687
    • Choudhury, A.K.1    Hahne, E.L.2
  • 20
    • 85176445282 scopus 로고    scopus 로고
    • An optimal buffer management policy for high-performance packet switching
    • S. Wei, E. Coyle, and M. Hsiao, "An optimal buffer management policy for high-performance packet switching," in Proc. IEEE GLOBECOM'91, pp. 924-928.
    • Proc. IEEE GLOBECOM'91 , pp. 924-928
    • Wei, S.1    Coyle, E.2    Hsiao, M.3
  • 22
    • 0031378778 scopus 로고    scopus 로고
    • Window-based error recovery and flow control with a slow acknowledgment channel: A study of TCP/IP performance
    • T. V. Lakshman, U. Madhow, and B. Suter, "Window-based error recovery and flow control with a slow acknowledgment channel: A study of TCP/IP performance," in Proc. IEEE INFOCOM'97, pp. 1201-1211.
    • Proc. IEEE INFOCOM'97 , pp. 1201-1211
    • Lakshman, T.V.1    Madhow, U.2    Suter, B.3
  • 24
    • 0030259608 scopus 로고    scopus 로고
    • Hierarchical packet fair queueing algorithms
    • Palo Alto, CA, Aug.
    • J. Bennett and H. Zhang, "Hierarchical packet fair queueing algorithms," in Proc. ACM SIGCOMM'96, Palo Alto, CA, Aug. 1996, pp. 143-156.
    • (1996) Proc. ACM SIGCOMM'96 , pp. 143-156
    • Bennett, J.1    Zhang, H.2


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