메뉴 건너뛰기




Volumn 3, Issue , 2003, Pages 1651-1658

Input queued switches: Cell switching vs. packet switching

Author keywords

[No Author keywords available]

Indexed keywords

BERNOULLI; CELL SWITCHING; CELL-BASED; FLUID LIMITS; INPUT QUEUED; INPUT QUEUED SWITCH; NON-PREEMPTIVE; PACKET SCHEDULING; PACKET SIZE; PACKET-BASED; PACKET-BASED SCHEDULING; REAL TRAFFIC; SCHEDULING DECISIONS; SIMPLE MODIFICATIONS; STABILITY PROPERTIES; TRAFFIC MODEL; TRAFFIC PATTERN; VARIABLE LENGTH PACKET;

EID: 0041973729     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2003.1209188     Document Type: Conference Paper
Times cited : (21)

References (8)
  • 1
    • 0029772922 scopus 로고    scopus 로고
    • Achieving 100% throughput in an input-queued switch
    • N. McKeown, V. Anantharam, and J. Walrand, "Achieving 100% throughput in an input-queued Switch," INFOCOM 1996, pp. 296-302.
    • INFOCOM 1996 , pp. 296-302
    • McKeown, N.1    Anantharam, V.2    Walrand, J.3
  • 2
    • 84930890020 scopus 로고
    • Tability properties of constrained queuing systems and scheduling plicies for maximum throughput in multihop radio networks
    • Dec
    • L. Tassiulas and A. Ephremides, "tability Properties of constrained queuing systems and scheduling plicies for maximum throughput in multihop radio networks," IEEE Trans. Automatic Control, vol. 37, no. 12, Dec 1992, pp. 1936-1948.
    • (1992) IEEE Trans. Automatic Control , vol.37 , Issue.12 , pp. 1936-1948
    • Tassiulas, L.1    Ephremides, A.2
  • 4
    • 0032655137 scopus 로고    scopus 로고
    • ISLIP: A scheduling algorithm for input-queued switches
    • April
    • N. McKeown, "iSLIP: a scheduling algorithm for input-queued switches," IEEE Transaction on Networking, vol. 7, no.2, April 1999, pp. 188-201.
    • (1999) IEEE Transaction on Networking , vol.7 , Issue.2 , pp. 188-201
    • McKeown, N.1
  • 6
    • 0033891586 scopus 로고    scopus 로고
    • The throughput of data switches with and without speedup
    • J.G. Dai and B. Prabhakar, "The throughput of data switches with and without speedup," INFOCOM 2000, pp. 556-564.
    • INFOCOM 2000 , pp. 556-564
    • Dai, J.G.1    Prabhakar, B.2
  • 8
    • 0036349563 scopus 로고    scopus 로고
    • Towards simple, HighPerformance schedulers for high-aggregate bandwidth switches
    • New York, NY
    • P. Giaccone, B. Prabhakar, and D. Shah, "Towards Simple, HighPerformance Schedulers for High-aggregate bandwidth Switches," INFOCOM 2002, New York, NY.
    • INFOCOM 2002
    • Giaccone, P.1    Prabhakar, B.2    Shah, D.3


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