메뉴 건너뛰기




Volumn 1044, Issue , 1996, Pages 173-185

Virtual partitioning by dynamic priorities: Fair and efficient resource-sharing by several services

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EID: 84958061533     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0022226     Document Type: Conference Paper
Times cited : (28)

References (9)
  • 2
    • 0019595463 scopus 로고
    • Optimum allocation of servers to two types of competing customers
    • Foschini, G.J., Gopinath, B., Hayes, J.F.: Optimum allocation of servers to two types of competing customers. IEEE Trans. Comm. COM-29 (1981) 1051-1055.
    • (1981) IEEE Trans. Comm. COM-29 , pp. 1051-1055
    • Foschini, G.J.1    Gopinath, B.2    Hayes, J.F.3
  • 4
    • 0001033437 scopus 로고
    • Loss networks
    • Kelly, F.P.: Loss networks. Ann. Appl. Prob. 1 (1991) 319-378.
    • (1991) Ann. Appl. Prob , vol.1 , pp. 319-378
    • Kelly, F.P.1
  • 5
    • 0021314798 scopus 로고
    • Traffic access control strategies in integrated digital networks
    • Kraimeche, B., Schwartz, M.: Traffic access control strategies in integrated digital networks. Proceedings of Infocom '84 (1984) 230-235.
    • (1984) Proceedings of Infocom '84 , pp. 230-235
    • Kraimeche, B.1    Schwartz, M.2


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