Abstract
We introduce the problem of load-distance balancing in assigning users of a delay-sensitive networked application to servers. We model the service delay experienced by a user as a sum of a network-incurred delay, which depends on its network distance from the server, and a server-incurred delay, stemming from the load on the server. The problem is to minimize the maximum service delay among all users.
We address the challenge of finding a near-optimal assignment in a scalable distributed manner. The key to achieving scalability is using local solutions, whereby each server only communicates with a few close servers. Note, however, that the attainable locality of a solution depends on the workload – when some area in the network is congested, obtaining a near-optimal cost may require offloading users to remote servers, whereas when the network load is uniform, a purely local assignment may suffice. We present algorithms that exploit the opportunity to provide a local solution when possible, and thus have communication costs and stabilization times that vary according to the network congestion. We evaluate our algorithms with a detailed simulation case study of their application in assigning hosts to Internet gateways in an urban wireless mesh network (WMN).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cisco Wireless Control System: http://www.cisco.com/univercd/cc/td/doc/product/wireless/wcs
Akylidiz, I.F., Wang, X., Wang, W.: Wireless Mesh Networks: a Survey. Computer Networks Journal (Elsevier) (March 2005)
Awerbuch, B.: On the Complexity of Network Synchronization. J. ACM 32, 804–823 (1985)
Barak, A., Wheeler, R.G., Guday, S.: The MOSIX Distributed Operating System. LNCS, vol. 672. Springer, Heidelberg (1993)
Bejerano, Y., Han, S.-J.: Cell Breathing Techniques for Balancing the Access Point Load in Wireless LANs. IEEE INFOCOM (2006)
Birk, Y., Keidar, I., Liss, L., Schuster, A., Wolff, R.: Veracity Radius – Capturing the Locality of Distributed Computations. ACM PODC (2006)
Bortnikov, E., Cidon, I., Keidar, I.: Scalable Load-Distance Balancing in Large Networks. Technical Report 587, CCIT, EE Department Pub No.1539, Technion IIT (May 2006), http://comnet.technion.ac.il/magma/ftp/LDBalance_tr.pdf
Chen, J., Knutsson, B., Wu, B., Lu, H., Delap, M., Amza, C.: Locality Aware Dynamic Load Management form Massively Multiplayer Games. PPoPP (2005)
Du, L., Bigham, J., Cuthbert, L.: A Bubble Oscillation Algorithm for Distributed Geographic Load Balancing in Mobile Networks. IEEE INFOCOM (2004)
Ganguly, S., Navda, V., Kim, K., Kashyap, A., Niculescu, D., Izmailov, R., Hong, S., Das, S.: Performance Optimizations for VoIP Services in Mesh Networks. JSAC 24(11) (2006)
Ghosh, B., Leighton, F.T., Maggs, B., Muthukrishnan, S., Plaxton, G., Rajaraman, R., Richa, A., Tarjan, R., Zuckerman, D.: Tight Analyses of Two Local Load Balancing Algorithms. ACM STOC (1995)
Hanna, K.M., Nandini, N.N., Levine, B.N.: Evaluation of a Novel Two-Step Server Selection Metric. IEEE ICNP (2001)
Kuhn, F., Moscibroda, T., Nieberg, T., Wattenhoffer, R.: Local Approximation Schemes for Ad Hoc and Sensor Networks. ACM DIALM-POMC (2005)
Kutten, S., Peleg, D.: Fault-Local Distributed Mending. J. Algorithms (1999)
Moscibroda, T., Wattenhoffer, R.: Facility Location: Distributed Approximation. ACM PODC (2005)
Naor, M., Stockmeyer, L.: What can be Computed Locally? ACM STOC (1993)
Niedermeyer, R., Reinhardt, K., Sanders, P.: Towards Optimal Locality in Mesh Indexings. In: Chlebus, B.S., Czaja, L. (eds.) FCT 1997. LNCS, vol. 1279, pp. 364–375. Springer, Heidelberg (1997)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bortnikov, E., Cidon, I., Keidar, I. (2007). Scalable Load-Distance Balancing. In: Pelc, A. (eds) Distributed Computing. DISC 2007. Lecture Notes in Computer Science, vol 4731. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75142-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-75142-7_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75141-0
Online ISBN: 978-3-540-75142-7
eBook Packages: Computer ScienceComputer Science (R0)