메뉴 건너뛰기




Volumn 6, Issue 5, 2002, Pages 76-80

Trade-offs in designing web clusters

Author keywords

[No Author keywords available]

Indexed keywords

CACHE MEMORY; CHANNEL CAPACITY; CLIENT SERVER COMPUTER SYSTEMS; COMPUTER SIMULATION; DATABASE SYSTEMS; ELECTRONIC COMMERCE; MATHEMATICAL MODELS; PROBABILITY DISTRIBUTIONS; QUEUEING THEORY; RANDOM PROCESSES; RESPONSE TIME (COMPUTER SYSTEMS);

EID: 0036756455     PISSN: 10897801     EISSN: None     Source Type: Journal    
DOI: 10.1109/MIC.2002.1036041     Document Type: Article
Times cited : (34)

References (8)
  • 4
    • 0000861722 scopus 로고
    • A proof of the queuing formula L = λW
    • J.C. Little, "A Proof of the Queuing Formula L = λW," Operations Res., vol. 9, no. 3, 1961, pp. 383-387.
    • (1961) Operations Res. , vol.9 , Issue.3 , pp. 383-387
    • Little, J.C.1


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