Statistical Pattern Recognition: A Review
IEEE Transactions on Pattern Analysis and Machine Intelligence
Combining Pattern Classifiers: Methods and Algorithms
Combining Pattern Classifiers: Methods and Algorithms
Grid resource management: state of the art and future trends
Grid resource management: state of the art and future trends
Routing, Flow, and Capacity Design in Communication and Computer Networks
Routing, Flow, and Capacity Design in Communication and Computer Networks
BOINC: A System for Public-Resource Computing and Storage
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Privacy-Preserving Data Mining: Models and Algorithms
Privacy-Preserving Data Mining: Models and Algorithms
P2P Networking and Applications
P2P Networking and Applications
Handbook of Peer-to-Peer Networking
Handbook of Peer-to-Peer Networking
Bayesian analysis of linear combiners
MCS'07 Proceedings of the 7th international conference on Multiple classifier systems
The Multidimensional Knapsack Problem: Structure and Algorithms
INFORMS Journal on Computing
Overlay Networks: Toward Information Networking.
Overlay Networks: Toward Information Networking.
Privacy Preserving Data Mining
Privacy Preserving Data Mining
A survey of multiple classifier systems as hybrid systems
Information Fusion
| Hi-index | 0.00 |
The growing amount of various kinds of information triggers the need to develop efficient network computing systems, as single machines in many cases are not able to provide effective processing and analysis. One of the very promising approaches of distributed data analysis is combined classification, which could be relatively easily implemented in distributed computing systems. In this paper we address problem of decentralized distributed computing system for mentioned above classification method. We focus on the system fairness. The performance metric is defined as a maximum response time, i.e., the computing system should be designed to minimize the response time of each client using the system. We assume that the system is decentralized and each request is sent by the client directly to computing nodes without assistance of a central service. An ILP (Integer Linear Programming) model is formulated and applied to obtain optimal results provided by branch-and-cut algorithm included in the CPLEX solver. Widespread simulations are performed to evaluate properties of the computing system in terms of several parameters describing the system.