|
Volumn , Issue , 2006, Pages 107-114
|
Computing real time jobs in P2P networks
|
Author keywords
[No Author keywords available]
|
Indexed keywords
(+ MOD 2N) OPERATION;
(E ,3E) PROCESS;
(R ,S ,S) POLICY;
COMMUNICATION BAND WIDTH;
COMPUTATION TREE (CT);
COMPUTATIONAL POWER;
COMPUTING CYCLES;
DISTRIBUTED COMPUTING;
HOC PEER TO PEER (P2P) NETWORKS;
LOAD BALANCING;
LOAD-SHARING SCHEME;
LOCAL COMPUTER;
MAXIMUM EFFICIENCY;
MINIMUM SPANNING TREE (MST);
MULTI LEVEL (ML);
NETWORK CONDITIONS;
P2P ENVIRONMENTS;
PEER COMPUTERS;
PEER SELECTION;
POWER EFFICIENT;
REAL TIME;
RESOURCE TREE;
RESOURCE UTILIZATIONS;
SIMULATION EXPERIMENTS;
TREE CONSTRUCTION ALGORITHMS;
AD HOC NETWORKS;
DISTRIBUTED COMPUTER SYSTEMS;
DISTRIBUTED PARAMETER NETWORKS;
FAULT TOLERANCE;
FEATURE EXTRACTION;
INTERNET;
INTERNET PROTOCOLS;
NETWORK PROTOCOLS;
QUALITY ASSURANCE;
QUALITY OF SERVICE;
RELIABILITY;
COMPUTER NETWORKS;
|
EID: 46149120346
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1109/LCN.2006.322078 Document Type: Conference Paper |
Times cited : (1)
|
References (23)
|