메뉴 건너뛰기




Volumn 3, Issue , 2002, Pages 1160-1169

Towards simple, high-performance schedulers for high-aggregate bandwidth switches

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; FREQUENCY ALLOCATION; GRAPH THEORY; PACKET SWITCHING; PARALLEL PROCESSING SYSTEMS; QUEUEING NETWORKS; RANDOM PROCESSES; THEOREM PROVING;

EID: 0036349563     PISSN: 0743166X     EISSN: None     Source Type: Journal    
DOI: 10.1109/INFCOM.2002.1019366     Document Type: Article
Times cited : (77)

References (24)
  • 14
    • 0003642259 scopus 로고
    • Scheduling algorithms for input-queued cell switches
    • Ph.D. Thesis, University of California at Berkeley
    • (1995)
    • McKeown, N.1
  • 17
    • 0004155132 scopus 로고    scopus 로고
    • The power of two choices in randomized load balancing
    • Ph.D. thesis, University of California at Berkeley
    • (1996)
    • Mitzenmacher, M.1
  • 22
    • 0037773179 scopus 로고    scopus 로고
    • An efficient randomized algorithm for input-queued switch scheduling
    • Hot Interconnects 9, Stanford, CA., Aug
    • (2001) , pp. 3-8
    • Shah, D.1    Giaccone, P.2    Prabhakar, B.3
  • 24
    • 0031701310 scopus 로고    scopus 로고
    • Linear complexity algorithms for maximum throughput in radio networks and input queued switches
    • New York
    • (1998) IEEE INFOCOM '98 , pp. 533-539
    • Tassiulas, L.1


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