Copyright © 2007 The Institute of Electronics, Information and Communication Engineers
Regular Section -- Papers -- Distributed Cooperation and Agents |
An Efficient and Privacy-Aware Meeting Scheduling Scheme Using Common Computational Space
1 The author is with The Graduate University for Advanced Studies, Tokyo, 101–8430 Japan. E-mail: huda{at}grad.nii.ac.jp, 2 The authors are with the National Institute of Informatics, Tokyo, 101–8430 Japan.
Privacy is increasingly viewed as a key concern in multi-agent based algorithms for Distributed Constraint Satisfaction Problems (DCSP) such as the Meeting Scheduling (MS) problem. Many algorithms aim for a global objective function and as a result, incur performance penalties in computational complexity and personal privacy. This paper describes a mobile agent-based scheduling scheme called Efficient and Privacy-aware Meeting Scheduling (EPMS), which results in a tradeoff among complexity, privacy, and global utility. It also introduces a privacy loss model for collaborative computation, multiple criteria for evaluating privacy in the MS problem, and a privacy measurement metric called the Min privacy metric. We have utilized a common computational space in EPMS for reducing the complexity and the privacy loss in the MS problem. The analytical results show that EPMS has a polynomial time computational complexity. In addition, simulation results show that the obtained global utility for scheduling multiple meetings with EPMS is close to the optimal level and the resulting privacy loss is less than for those in existing algorithms.
Key Words: algorithm, constraint, distributed computing, mobile agent, privacy
Manuscript received March 14, 2006. Manuscript revised August 2, 2006.
References
[1] L.D. Erman, F. Hayes-Roth, V.R. Lesser, and D.R. Reddy, "The HEARSAY-II speech understanding system: Integrating knowledge to resolve uncertainty," Computing Surveys, vol.12, no.2, pp.213–253, 1980.
[2] M.S. Franzin, E.C. Freuder, F. Rossi, and R. Wallace, "Multi-agent meeting scheduling with preferences: Efficiency, privacy, loss, and solution quality," Proc. American Association for Artificial Intelligence Conf., pp.25–32, Canada, Aug. 2002.
[3] E.C. Freuder, M. Minca, and R.J. Wallace, "Privacy/efficiency tradeoffs in distributed meeting scheduling by constraint-based agents," Proc. Int. Joint Conf. on Artificial Intelligence, pp.63–72, Australia, 2001.
[4] K. Ghedira and G. Verfaillie, "A multi-agent model for the resource allocation problem: A reactive approach," Proc. Tenth European Conf. on Artificial Intelligence, pp.252–254, 1992.
[5] R. Greenstadt, J.P. Pearce, E. Bowring, and M. Tambe, "Experimental analysis of privacy loss in DCOP algorithms," Proc. AAMAS'06, pp.1424–1426, Hakodate, Japan, May 2006.
[6] A.B. Hassine, X. Defago, and T.B. Ho, "Agent-based approach to dynamic meeting scheduling problems," Proc. AAMAS'04, pp.1132–1139, USA, July 2004.
[7] T. Haynes, S. Sen, N. Arora, and R. Nadella, "An automated meeting scheduling system that utilizes user preferences," Proc. First Int. Conf. on Autonomous Agents, pp.308–315, New York, 1997.
[8] T. Herlea, J. Claessens, G. Neven, F. Piessens, B. Preneel, and B. Decker, "On securely scheduling a meeting," Proc. IFIP Int. Information Security Conf., pp.183–198, Japan, 2001.
[9] L. Ismail and D. Hagimont, "A performance evaluation of the mobile agent paradigm," Proc. if the Int. Conf. on Objectoriented Programming, Systems, Languages, and Applications (OOPSLA99), pp.306–313, California, Oct. 1999.
[10] R.T. Maheswaran, J.P. Pearce, P. Varakantham, E. Bowring, and M. Tambe, "Valuations of possible states (VPS)- a quantitative framework for analysis of privacy loss among collaborative personal assistant agents," AAMAS'05, pp.1030–1037, Netherlands, July 2005.
[11] R.T. Maheswaran, M. Tambe, E. Bowring, J.P. Pearce, and P. Varakantham, "Taking DCOP to the real world: Efficient complete solutions for distributed multi-event scheduling," Proc. Third Int. Joint Conf. on Autonomous Agents and Multiagent Systems-vol.1, pp.310–317, 2004.
[12] R. Mailler and V. Lesser, "Solving distributed constraint optimization problems using cooperative mediation," Proc. AAMAS'04, pp.438–445, New York, 2004.
[13] P.J. Modi, W. Shen, M. Tambe, and M. Yokoo, "ADOPT: Asynchronous distributed constraint optimization with quality guarantees," Artificial Intelligence Journal (AIJ), vol.161, pp.149–180, 2005.
[14] S. Sen, T. Haynes, and N. Arora, "Satisfying user preferences while negotiating meetings," Int. Journal of Human-Computer Studies, vol.47, no.3, pp.407–427, 1997.
[15] M.L. Shooman, Reliability of Computer Systems and Networks - Fault Tolerance Analysis and Design, Wiley, 2002.
[16] M.C. Silaghi and D. Mitra, "Distributed constraint satisfaction and optimization with privacy enforcement," Proc. IEEE/WIC/ACM Int. Conf. on Intelligent Agent Technology, pp.531–535, Beijing, China, 2004.
[17] G. Solotorevsky and E. Gudes, "Solving a real-life time tabling and transportation problem using distributed csp techniques," Proc. CP '96 Workshop on Constraint Programming Applications, pp.123–131, 1996.
[18] K. Sycara, S. Roth, N. Sadeh, and M. Fox, "Distributed constrained heuristic search," IEEE Trans. Syst. Man Cybern., vol.21, no.6, pp.1446–1461, 1991.
[19] A.S. Tanenbaum and M.v. Steen, Distributed Systems: Principles and Paradigms, Prentice Hall, 2002.
[20] T. Tsuruta and T. Shintani, "Scheduling meetings using distributed valued constraint satisfaction algorithm," Proc. European Conference on Artificial Intelligence, pp.383–387, Germany, Aug. 2000.
[21] M. Yokoo, K. Suzuki, and K. Hirayama, "Secure distributed constraint satisfaction: Reaching agreement without revealing private information," Proc. Eighth Int. Conf. on Principles and Practice of Constraint Programming, LNCS Publication, pp.387–401, 2002.
[22] American National Computer Security Center, "A guide to understanding trusted facility management," NCSC-TG-015, http://www.fas.org/irp/nsa/rainbow/tg015.htm
[23] Trusted computing group, "How to implement trusted computing: A guide to tighter enterprise security," http://www.trustedcomputinggroup.org/home
CiteULike 
Connotea 
Del.icio.us What's this?
| ||||||||||||||||||||||||||||||||||||||||||||||||||