%0 Conference Proceedings
%T A Network-Driven Multi-Access-Point Load-Balancing Algorithm for Large-Scale Public Hotspots
%+ Iminds [Ghent]
%A Bosch, Patrick
%A Braem, Bart
%A Latré, Steven
%Z Part 1: Autonomic and Decentralized Management
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 9th Autonomous Infrastructure, Management, and Security (AIMS)
%C Ghent, Belgium
%Y Steven Latré
%Y Marinos Charalambides
%Y Jérôme François
%Y Corinna Schmitt
%Y Burkhard Stiller
%I Springer
%3 Intelligent Mechanisms for Network Configuration and Security
%V LNCS-9122
%P 30-42
%8 2015-06-22
%D 2015
%R 10.1007/978-3-319-20034-7_3
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X Wireless networks are getting more and more popular and are a basic part of our life with the daily use of smartphones. Users expect high quality connectivity even in public spaces where a high number of clients connect to a limited spectrum on a geographically small area. Therefore, large-scale, high density wireless networks, like they are present at events, are getting more common, but provide a serious resource allocation challenge. Thousands of clients want to connect to a network consisting of multiple APs and a limited spectrum, while all of them should receive a decent connection quality, throughput and delay. Therefore, none of the APs should be overloaded, so that they can provide service for each connected client. The IEEE 802.11 standard stipulates that the client makes the decision to which AP to connect to. In high-density networks, the individual decision of the client can lead to an AP overload and oscillations in AP association as a client typically has limited information about the network performance and does not collaborate with other clients in taking its decision. This provides unwanted behaviour for load-balancing, as there is no control over the clients. Therefore, we present a method where the APs get control over the client and realise load balancing in such a network. The AP evaluates through a score if the client can connect and, if the client is connected, checks regularly if it is the best option for the client.
%G English
%Z TC 6
%Z WG 6.6
%2 https://hal.science/hal-01410140/document
%2 https://hal.science/hal-01410140/file/978-3-319-20034-7_3_Chapter.pdf
%L hal-01410140
%U https://hal.science/hal-01410140
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC6
%~ IFIP-AIMS
%~ IFIP-WG6-6
%~ IFIP-LNCS-9122