메뉴 건너뛰기




Volumn 58, Issue 3, 2001, Pages 221-233

A priority-based resource allocation strategy in distributed computing networks

Author keywords

Distributed computing networks; Network bandwidth; Quality of service; Resource allocation; Resource utilization

Indexed keywords

ALGORITHMS; BANDWIDTH; COMPUTER NETWORKS; COMPUTER SIMULATION; DIGITAL STORAGE; INTERFACES (COMPUTER); QUALITY OF SERVICE; RESOURCE ALLOCATION; TIME SHARING PROGRAMS;

EID: 0035885362     PISSN: 01641212     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0164-1212(01)00040-1     Document Type: Article
Times cited : (25)

References (29)
  • 17
    • 70350674995 scopus 로고
    • On the shortest spanning sub-tree of a graph and the traveling salesman problem
    • (1956) ACM , vol.7 , Issue.1 , pp. 48-50
    • Kruskal J.B., Jr.1


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