Abstract
In large-scale distributed information systems, providers are typically autonomous, i.e. free to leave the system at will or to perform certain requests. In this context, request allocation is critical for the efficient system’s operation. However, most methods used in distributed information systems aim at maximizing overall system performance (throughput and response times) by allocating requests to the most efficient providers, without considering providers’ autonomy. In this paper, we propose a balanced request allocation method, K n Best, which considers providers’ autonomy in addition to load balancing. Our method is general and simple, so that it can be easily incorporated in existing distributed information systems. We describe the implementation of K n Best in different scenarios. Finally, we give an experimental evaluation which shows that K n Best significantly outperforms traditional request allocation methods.
Work partially funded by ARA “Massive Data” of the French ministry of research (projects MDP2P and Respire) and the European Strep Grid4All project.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Morgenstern, O., von Neumann, J.: Theory of Games and Economic Behavior. Princeton University Press, Princeton (1980)
Sah, A., Blow, J., Dennis, B.: An introduction to the Rush language. In: Procs. of the TCL Workshop (1994)
Ferguson, D., Nikolaou, C., Sairamesh, J., Yemini, Y.: Economic Models for Allocating Resources in Computer Systems. In: Market-based control: a paradigm for distributed resource allocation, World Scientific, Singapore (1996)
Ferguson, D., Yemini, Y., Nikolaou, C.: Microeconomic Algorithms for Load Balancing in Distributed Computer Systems. In: Procs. of the ICDCS Conference (1988)
Markatos, E.P.: Tracing a Large-Scale Peer to Peer System: An Hour in the Life of Gnutella. In: CCGRID Symposium (2002)
Zhu, H., Yang, T., Zheng, Q., Watson, D., Ibarra, O., Smith, T.: Adaptive Load Sharing for Clustered Digital Library Servers. In: HPDC Symposium (1998)
Quiané-Ruiz, J.-A., Lamarre, P., Valduriez, P.: Satisfaction-Based Query Load Balancing. In: Procs. of the CoopIS Conference (2006)
Sycara, K., Klusch, M., Widoff, S., Lu, J.: Dynamic Service Matchmaking Among Agents in Open Information Environments. SIGMOD Record 28(1) (1999)
Li, L., Horrocks, I.: A Software Framework for Matchmaking Based on Semantic Web Technology. In: Procs. of the WWW Conference (2003)
Mitzenmacher, M.: The Power of Two Choices in Randomized Load Balancing. PhD. Thesis, UC Berkeley (1996)
Nodine, M., Bohrer, W., Ngu, A.: Semantic Brokering over Dynamic Heterogeneous Data Sources in InfoSleuth. In: Procs. of the ICDE Conference (1999)
Roussopoulos, M., Baker, M.: Practical Load Balancing for Content Requests in Peer-to-Peer Networks. Distributed Computing 18(6), 421–434 (2006)
Stonebraker, M., Aoki, P., Litwin, W., Pfeffer, A., Sah, A., Sidell, J., Staelin, C., Yu, A.: Mariposa: A Wide-Area Distributed Database System. VLDB J 5(1) (1996)
Shivaratri, N., Krueger, P., Singhal, M.: Load Distributing for Locally Distributed Systems. IEEE Computer Journal 25(12) (1992)
Lamarre, P., Cazalens, S., Lemp, S., Valduriez, P.: A Flexible Mediation Process for Large Distributed Information Systems. In: Procs. of the CoopIS Conference (2004)
Buyya, R., Stockinger, H., Giddy, J., Abramson, D.: Economic Models for Management of Resources in Grid Computing. CoRR Journal (2001)
Mirchandaney, R., Towsley, D., Stankovic, J.: Adaptive Load Sharing in Heterogeneous Distributed Systems. Parallel and Distributed Computing J. 9(4) (1990)
Saroiu, S., Krishna Gummadi, P., Gribble, S.: A Measurement Study of Peer-to-Peer File Sharing Systems. In: Procs. of the MCN Conference (2002)
Özsu, T., Valduriez, P.: Principles of Distributed Database Systems, 2nd edn. Prentice-Hall, Englewood Cliffs (1999)
Azar, Y., Broder, A.Z., Karlin, A.R., Upfal, E.: Balanced Allocations. SIAM Journal on Computing 29(1) (1999)
Genova, Z., Christensen, K.: Challenges in URL Switching for Implementing Globally Distributed Web Sites. In: Procs. of the ICPP Workshops (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Quiané-Ruiz, JA., Lamarre, P., Valduriez, P. (2007). K n Best - A Balanced Request Allocation Method for Distributed Information Systems. In: Kotagiri, R., Krishna, P.R., Mohania, M., Nantajeewarawat, E. (eds) Advances in Databases: Concepts, Systems and Applications. DASFAA 2007. Lecture Notes in Computer Science, vol 4443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71703-4_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-71703-4_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71702-7
Online ISBN: 978-3-540-71703-4
eBook Packages: Computer ScienceComputer Science (R0)