The Community for Technology Leaders
RSS Icon
Issue No.04 - April (2008 vol.19)
pp: 433-446
In recent years, inspired by the emerging web services standard and peer-to-peer technology, a new federated service providing (FSP) system paradigm has attracted increasing research interests. Many existing systems have either explicitly or implicitly followed this paradigm. Instead of exchanging files, peers in FSP systems share their computation resources in order to offer domain-specific services. In this paper, we focused on a coordination problem as how to self-organize the service group structures in response to the varying service demand. We presented our solution in the form of a coordination mechanism, which includes a labor-market model, a recruiting protocol, and a policy-driven decision architecture. Peers make their service providing decisions based on their local policies, which can be added, removed, or modified by users. A general methodology is introduced in this paper to facilitate policy design. Specifically, a heuristic inspired by the Extremal Optimization technique is utilized to handle potential inconsistencies among policies. A stimulus-response mechanism was further applied to make the decision process adjustable. Experiments under five application scenarios verified our ideas and demonstrated the effectiveness of our coordination mechanism.
Federated Service Providing System, P2P System, Coordination, Policy-driven decision-making
Gang Chen, Chor Ping Low, Zhonghua Yang, "Coordinated Services Provision in Peer-to-Peer Environments", IEEE Transactions on Parallel & Distributed Systems, vol.19, no. 4, pp. 433-446, April 2008, doi:10.1109/TPDS.2007.70745
[1] Kazaa Media Desktop, http:/, 2001.
[2] BitTorrent, http:/, 2003.
[3] M. Adler, R. Kumar, K. Ross, D. Rubenstein, D. Turner, and D.D. Yao, “Optimal Peer Selection in a Free-Market Peer-Resource Economy,” Proc. Second Workshop Economics of Peer-to-Peer Systems, 2004.
[4] S. Androutsellis-Theotokis and D. Spinellis, “A Survey of Peer-to-Peer Content Distribution Technologies,” ACM Computing Surveys, vol. 36, no. 4, pp. 335-371, 2004.
[5] P. Bak and K. Sneppen, “Punctuated Equilibrium and Criticality in a Simple Model of Evolution,” Physics Rev. Letters, vol. 71, pp.4083-4086, 1993.
[6] F. Banaei-Kashani, C.C. Chen, and C. Shahabi, “WSPDS: Web Services Peer-to-Peer Discovery Service,” Proc. Int'l Symp. Web Services and Applications, 2004.
[7] Grid Computing: Making the Global Infrastructure a Reality, F.Berman, G. Fox, and A.J.G. Hey, eds. John Wiley & Sons, 2003.
[8] S. Boettcher and M. Grigni, “Jamming Model for the Extremal Optimization Heuristics,” J. Physics A: Math. and General, pp. 1109-1123, 2002.
[9] S. Boettcher and A.G. Percus, “Optimization with Extremal Dynamics,” Physics Rev. Letters, vol. 23, no. 4, pp. 5211-5214, 2001.
[10] S. Boettcher and A.G. Percus, “Extremal Optimization: An Evolutionary Local-Search Algorithm,” Computational Modeling and Problem Solving in the Networked World: Interfaces in Computer Science and Operations Research, H.K. Bhargava and N. Ye, eds., pp.61-77, Kluwer Academic Publishers, 2003.
[11] R. Buyya, D. Abramson, and J. Giddy, “An Economy Driven Resource Management Architecture for Computational Power Grids,” Proc. Int'l Conf. Parallel and Distributed Processing Techniques and Applications (PDPTA '00), 2000.
[12] A.J. Chakravarti, G. Baumgartner, and M. Lauria, “The Organic Grid: Self-Organizing Computation on a Peer-to-Peer Network,” IEEE Trans. Systems, Man, and Cybernetics, vol. 35, no. 3, pp. 373-384, 2005.
[13] V.A. Cicirello and S.F. Smith, “Wasp-Like Agents for Distributed Factory Coordination,” Autonomous Agents and Multi-Agent Systems, vol. 8, pp. 237-266, 2004.
[14] B. Cohen, “Incentives Build Robustness in BitTorrent,” Proc. First Workshop Economics of Peer-to-Peer Systems, 2003.
[15] F.M. Cuenca-Acuna and T.D. Nguyen, “Self-Managing Federated Services,” Proc. 23rd IEEE Symp. Reliable Distributed Systems, 2004.
[16] Y. Fu, Z. Dong, and X. He, “An Approach to Web Services Oriented Modeling and Validation,” Proc. Int'l Workshop Service-Oriented Software Eng. (IW-SOSE '06), pp. 81-87, 2006.
[17] B. Godfrey, K. Lakshminarayanan, S. Surana, R. Karp, and I. Stoica, “Load Balancing in Dynamic Structured P2P Systems,” Proc. IEEE INFOCOM, 2004.
[18] D.E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley Professional, 1989.
[19] X. Gu and K. Nahrstedt, “Distributed Multimedia Service Composition with Statistical QoS Assurances,” IEEE Trans. Multimedia, vol. 8, no. 1, pp. 141-151, 2006.
[20] X. Gu and K. Nahrstedt, “On Composing Stream Applications in Peer-to-Peer Environments,” IEEE Trans. Parallel and Distributed Systems, vol. 17, no. 8, pp. 824-837, Aug. 2006.
[21] X. Gu, K. Nahrstedt, and B. Yu, “SpiderNet: An Integrated Peer-to-Peer Service Composition Framework,” Proc. 13th IEEE Int'l Symp. High-Performance Distributed Computing (HPDC '04), pp. 110-119, 2004.
[22] D. Hausheer and B. Stiller, “PeerMart: The Technology for a Distributed Auction-Based Market for Peer-to-Peer Services,” Proc. 40th Int'l Conf. Comm. (ICC '05), 2005.
[23] D. Hausheer and B. Stiller, “PeerMint: Decentralized and Secure Accounting for Peer-to-Peer Applications,” Proc. Fourth Int'l IFIP-TC6 Networking Conf. (Networking '05), pp. 40-52, 2005.
[24] C.H. Hsu, T.L. Chen, and G.H. Lin, “Grid Enabled Master Slave Task Scheduling for Heterogeneous Processor Paradigm,” Proc. Fourth Int'l Conf. Grid and Cooperative Computing (GCC '05), pp.449-454, 2005.
[25] M. Klusch, B. Fries, and K. Sycara, “Automated Semantic Web Service Discovery with OWLS-MX,” Proc. Fifth Int'l Joint Conf. Autonomous Agents and Multiagent Systems (AAMAS '06), pp. 915-922, 2006.
[26] D. Kondo, M. Taufer, C.L. Brooks, H. Casanova, and A. Chien, “Characterizing and Evaluating Desktop Grids: An Empirical Study,” Proc. 18th IEEE/ACM Int'l Parallel and Distributed Processing Symp. (IPDPS), 2004.
[27] E.K. Lua, J. Crowcroft, M. Pias, R. Sharma, and S. Lim, “A Survey and Comparison of Peer-to-Peer Overlay Network Schemes,” IEEE Comm. Surveys and Tutorials, vol. 7, no. 2, pp. 72-93, 2005.
[28] O. Ratsimor, D. Chakraborty, A. Joshi, T. Finin, and Y. Yesha, “Service Discovery in Agent-Based Pervasive Computing Environments,” Mobile Networks and Applications, vol. 9, pp. 679-692, 2004.
[29] D.M. Reeves, M.P. Wellman, J.K. Mackie-Mason, and A. Osepayshvili, “Exploring Bidding Strategies for Market-Based Scheduling,” Decision Support Systems, vol. 39, no. 1, pp. 67-85, 2005.
[30] A. Rowstron and P. Druschel, “Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems,” Proc. IFIP/ACM Int'l Conf. Distributed Systems Platforms, 2001.
[31] G. Shao, F. Berman, and R. Wolski, “Master/Slave Computing on the Grid,” Proc. Ninth Heterogeneous Computing Workshop, pp. 3-16, 2000.
[32] I. Stoica, R. Morris, D. Liben-Nowell, D.R. Karger, M.F. Kaashoek, F. Dabek, and H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications,” IEEE/ACM Trans. Networking, vol. 11, no. 1, pp. 17-32, 2003.
[33] K. Sycara, M. Paolucci, A. Anolekar, and N. Srinivasan, “Automated Discovery, Interaction and Composition of Semantic Web Services,” Web Semantics, vol. 1, no. 1, 2003.
[34] R. Wolff and A. Schuster, “Association Rule Mining in Peer-to-Peer Systems,” IEEE Trans. Systems, Man, and Cybernetics, vol. 34, no. 6, pp. 2426-2438, 2004.
[35] B. Yang and H. Garcia-Monlina, “Efficient Search in Peer-to-Peer Networks,” Proc. 22nd IEEE Int'l Conf. Distributed Computing Systems (ICDCS), 2002.
[36] B. Yu and M.P. Singh, “A Social Mechanism of Reputation Management in Electronic Communities,” Proc. Fourth Int'l Workshop Cooperative Information Agents (CIA '00), pp. 154-165, 2000.
[37] J. Yu, S. Venugopal, and R. Buyya, “A Market-Oriented Grid Directory Service for Publication and Discovery of Grid Service Providers and Their Services,” J. Supercomputing, vol. 36, no. 1, pp.17-31, 2006.
25 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool