Decentralized Distributed Computing System for Privacy-Preserving Combined Classifiers – Modeling and Optimization

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6782)


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.


distributed computing grid computing privacy-preserving combined classifiers ILP modeling optimization 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Anderson, D.: BOINC: A System for Public-Resource Computing and Storage. In: Proc. of the Fifth IEEE/ACM International Workshop on Grid Computing, pp. 4–10 (2004)Google Scholar
  2. 2.
    Buford, J., Yu, H., Lua, E.: P2P Networking and Applications. Morgan Kaufmann, San Francisco (2009)Google Scholar
  3. 3.
    Milojicic, D., et al.: Peer to Peer computing. HP Laboratories Palo Alto, Technical Report HPL-2002-57 (2002)Google Scholar
  4. 4.
    Nabrzyski, J., Schopf, J., Węglarz, J. (eds.): Grid resource management:state of the art and future trends. Kluwer Academic Publishers, Boston (2004)zbMATHGoogle Scholar
  5. 5.
    Shen, X., Yu, H., Buford, J., Akon, M. (eds.): Handbook of Peer-to-Peer Networking. Springer, Heidelberg (2009)zbMATHGoogle Scholar
  6. 6.
    Tarkoma, S.: Overlay Networks: Toward Information Networking. Auerbach Publications (2010)Google Scholar
  7. 7.
    Taylor, I.: From P2P to Web services and grids: peers in a client/server world. Springer, Heidelberg (2005)zbMATHGoogle Scholar
  8. 8.
    Travostino, F., Mambretti, J., Karmous Edwards, G.: Grid Networks Enabling grids with advanced communication technology. Wiley, Chichester (2006)CrossRefGoogle Scholar
  9. 9.
    Jain, A.K., Duin, P.W., Mao, J.: Statistical Pattern Recognition: A Review. IEEE Trans. on PAMI 22(1), 4–37 (2000)CrossRefGoogle Scholar
  10. 10.
    Kuncheva, L.I.: Combining Pattern Classifiers: Methods and Algorithms. New Jersey (2004)Google Scholar
  11. 11.
    Miller, D.J., Zhang, Y., Kesidis, G.: Decision Aggregation in Distributed Classification by a Transductive Extension of Maximum Entropy/Improved Iterative Scaling, Hindawi Publishing Corporation. EURASIP Journal on Advances in Signal Processing Volume (2008)Google Scholar
  12. 12.
    Kacprzak, T., Walkowiak, K., Woźniak, M.: Optimization of Overlay Distributed Computing Systems for Multiple Classifier System – Heuristic Approach. Logic Journal of IGPL (in press, 2011)Google Scholar
  13. 13.
    Vaidya, J., Clifton, C.W., Zhu, Y.M.: Privacy Preserving Data Mining. Springer, New York (2006)zbMATHGoogle Scholar
  14. 14.
    Aggrawal, C.C., Yu, P.S.: Privacy-Preserving Data Mining: Models and Algorithms. Springer, New York (2008)CrossRefGoogle Scholar
  15. 15.
    Lindell, Y., Pinkas, B.: Secure Multiparty Computation for Privacy-Preserving Data Mining. The Journal of Privacy and Confidentiality 1(1), 59–98 (2009)Google Scholar
  16. 16.
    Kuncheva, L.I., Whitaker, C.J., Shipp, C.A., Duin, R.P.W.: Limits on the Majority Vote Accuracy in Classier Fusion. Pattern Analysis and Applications 6, 22–31 (2003)CrossRefzbMATHGoogle Scholar
  17. 17.
    Alexandre, L.A., Campilho, A.C., Kamel, M.: Combining Independent and Unbiased Classifiers Using Weighted Average. In: Proc. of the 15th ICPR, vol. 2, pp. 495–498 (2000)Google Scholar
  18. 18.
    Biggio, B., Fumera, G., Roli, F.: Bayesian Analysis of Linear Combiners. In: Haindl, M., Kittler, J., Roli, F. (eds.) MCS 2007. LNCS, vol. 4472, pp. 292–301. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  19. 19.
    Duin, R.P.W.: The Combining Classifier: to Train or Not to Train? In: Proc. of the ICPR 2002, Quebec City (2002)Google Scholar
  20. 20.
    Przewoźniczek, M., Walkowiak, K., Woźniak, M.: Optimizing distributed computing systems for k-nearest neighbors classifiers - evolutionary approach. Logic Journal of IGPL (2011), doi:10.1093/jigpal/jzq034Google Scholar
  21. 21.
    Pioro, M., Medhi, D.: Routing, Flow, and Capacity Design in Communication and Computer Networks. Morgan Kaufmann, San Francisco (2004)zbMATHGoogle Scholar
  22. 22.
    Puchinger, J., Raidl, G., Pferschy, U.: The Multidimensional Knapsack Problem: Structure and Algorithms. Informs Journal on Computing (2009), doi:10.1287/ijoc.1090.0344Google Scholar
  23. 23.
    ILOG CPLEX, 12.0 User’s Manual, France (2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  1. 1.Department of Systems and Computer Networks, Faculty of ElectronicsWrocław University of TechnologyWroclawPoland

Personalised recommendations