Fairness and load balancing in wireless LANs using association control
作者： Y. Bejerano , Seung-Jae Han , Li Li
关键词:
摘要: Recent studies on operational wireless LANs (WLANs) have shown that user load is often unevenly distributed among wireless access points (APs). This unbalanced load results in …
acm.org
elsevier.com
sci-hub.se 
columbia.edu 参考文章(27)
J. Kleinberg, Y. Rabani, E. Tardos, Fairness in routing and load balancing foundations of computer science. pp. 568- 578 ,(1999) , 10.1109/SFFCS.1999.814631
Anand Balachandran, Geoffrey M. Voelker, Paramvir Bahl, P. Venkat Rangan, Characterizing user behavior and network performance in a public wireless LAN measurement and modeling of computer systems. ,vol. 30, pp. 195- 205 ,(2002) , 10.1145/511334.511359
Serge Plotkin, Adam Meyerson, Ashish Goel, Approximate majorization and fair online load balancing symposium on discrete algorithms. pp. 384- 390 ,(2001) , 10.5555/365411.365483
David Kotz, Kobby Essien, Analysis of a campus-wide wireless network Proceedings of the 8th annual international conference on Mobile computing and networking - MobiCom '02. pp. 107- 118 ,(2002) , 10.1145/570645.570659
Anand Balachandran, Paramvir Bahl, Geoffrey M. Voelker, Hot-spot congestion relief and service guarantees in public-area wireless networks acm special interest group on data communication. ,vol. 32, pp. 59- 59 ,(2002) , 10.1145/510726.510733
Yehuda Afek, Yishay Mansour, Zvi Ostfeld, Convergence Complexity of Optimistic Rate-Based Flow-Control Algorithms Journal of Algorithms. ,vol. 30, pp. 106- 143 ,(1999) , 10.1006/JAGM.1998.0970
B. Eklundh, Channel Utilization and Blocking Probability in a Cellular Mobile Telephone System with Directed Retry IEEE Transactions on Communications. ,vol. 34, pp. 329- 337 ,(1986) , 10.1109/TCOM.1986.1096544
Ilenia Tinnirello, Giuseppe Bianchi, A simulation study of load balancing algorithms in cellular packet networks Proceedings of the 4th ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems - MSWIM '01. pp. 73- 78 ,(2001) , 10.1145/381591.381608
Michael R. Garey, David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness ,(1979)
David B. Shmoys, Éva Tardos, An approximation algorithm for the generalized assignment problem Mathematical Programming. ,vol. 62, pp. 461- 474 ,(1993) , 10.1007/BF01585178