Doc.: IEEE 802.11-06/0001r0 Submission Jan 2006 Bin Wang, ZTE CorporationSlide 1 ESS Load Balancing Notice: This document has been prepared to assist IEEE.

Slides:



Advertisements
Similar presentations
Doc.: IEEE /0866r1 Submission September 2005 Michael Montemurro, Chantry NetworksSlide 1 Mobility Domain Definition and Description Notice: This.
Advertisements

Doc.: IEEE /90r0 Submission Nov., 2012 NICTSlide b NICT Proposal IEEE P Wireless RANs Date: Authors: Notice: This document.
Doc.: IEEE /0930r0 Submission July 2006 Nancy Cam-Winget, Cisco Slide 1 Editor Updates since Jacksonville Notice: This document has been prepared.
Doc.: IEEE /1867r1 Submission November r Security TeamSlide 1 TGr Security Requirements Notice: This document has been prepared to.
Doc.: IEEE /0094r0 Submission November 2009 Steve Shellhammer, QualcommSlide 1 Comments on PAR Notice: This document has been prepared.
Doc.: IEEE /1280r1 Submission Jan 2006 Bin Wang, ZTE CorporationSlide 1 Frequent Handover Notice: This document has been prepared to assist IEEE.
Doc.: IEEE /1071r3 Submission November 2005 Bin Wang, ZTE CorporationSlide 1 Solve Frequent Handover Requirement Notice: This document has been.
Doc.: IEEE /0629r1 Submission July 2005 Bin Wang, ZTE CorporationSlide 1 ESS Load Balancing Requirements Notice: This document has been prepared.
Doc.: IEEE /0072r0 SubmissionS. Filin H. Harada, NICTSlide 1 Coexistence algorithms Notice: This document has been prepared to assist IEEE
Doc.: IEEE /2237r0 Submission July 2007 Emily Qi, Intel CorporationSlide 1 TGv Redline D1.0 Insert and Deletion Notice: This document has been.
Doc.: IEEE /1057r0 Submission November 2005 Bin Wang, ZTE CorporationSlide 1 Using AP’s Location Information in Load Balancing Notice: This document.
Doc.: IEEE /1212r0 Submission TGT and MEF Liaison Notice: This document has been prepared to assist IEEE It is offered as a basis for.
Doc.: IEEE /1936r0 Submission December 2006 Bruce Kraemer, Marvell Adrian Stephens, IntelSlide 1 TGn Proposed Draft Revision Notice Notice: This.
Doc.: IEEE /86r2 Submission March, 2010 Gabor BajkoSlide 1 Location Proxy Notice: This document has been prepared to assist IEEE It is.
Doc.: IEEE /0028r0 Submission January 2005 Eleanor Hepworth, Siemens Roke ManorSlide 1 Definitions and Terminology Notice: This document has been.
Doc.: IEEE /0215r1 Submission January 2006 Jesse Walker, Intel CorporationSlide 1 TGw Closing Report Notice: This document has been prepared to.
Doc.: IEEE /2112r1 Submission Peter Loc, MarvellSlide 1 TGn LB97 Frame Format Ad Hoc San Francisco, July 2007 Notice: This document.
Doc.: IEEE /0652r1 Submission May 2007 Emily Qi, Intel CorporationSlide 1 TGv Redline D0.12 Insert and Deletion Notice: This document has been.
[ Interim Meetings 2006] Date: Authors: July 2005
IEEE White Space Radio Contribution Title
LB73 Noise and Location Categories
LB73 Noise and Location Categories
Waveform Generator Source Code
March 2014 Election Results
TGp Closing Report Date: Authors: July 2007 Month Year
Attendance and Documentation for the March 2007 Plenary
3GPP Extended Date: Authors: July 2005 July 2005
[ Policies and Procedure Summary]
3GPP liaison report May 2006 May 2006 Date: Authors:
Motion to accept Draft p 2.0
Protected SSIDs Date: Authors: March 2005 March 2005
[place presentation subject title text here]
Descriptive Language Usage in TGv
(Presentation name) For (Name of group) (Presenter’s name,title)
TGp Closing Report Date: Authors: March 2006 Month Year
On Coexistence Mechanisms
TGu-changes-from-d0-02-to-d0-03
TGp Closing Report Date: Authors: May 2007 Month Year
On Coexistence Mechanisms
Reflector Tutorial Date: Authors: July 2006 Month Year
TGv Redline D0.07 Insert and Deletion
Solve Frequent Handover Requirement
TGv Redline D0.06 Insert and Deletion
Experimental DTV Sensor
ADS Study Group Mid-week Report
IEEE P Wireless RANs Date:
TGu-changes-from-d0-01-to-d0-02
LB73 Noise and Location Categories
TGy draft 2.0 with changebars from draft 1.0
TGv Redline D0.10 Insert and Deletion
Solve Frequent Handover Requirement
WAPI Position Paper Sept 2005 Sept 2005 IEEE WG
Redline of draft P802.11w D2.2 Date: Authors:
TGr Proposed Draft Revision Notice
TGu-changes-from-d0-02-to-d0-03
[ Policies and Procedure Summary]
Frequent Handover Authors: Date: Jan 2006 Month Year
Beamforming and Link Adaptation Motions
Beam Ad Hoc Agenda Date: Authors: March 2007 March 2007
Draft P802.11s D1.03 WordConversion
Adaptive Rate Control NAV Setting
ESS Load Balancing Requirements
Questions to the Contention-based Protocol (CBP) Study Group
EC Motions – July 2005 Plenary
TGu-changes-from-d0-04-to-d0-05
Transition Nowhere Date: Authors: Sept 2005 Sept 2005
TGu-changes-from-d0-03-to-d0-04
TGu Motions Date: Authors: May 2006 May 2006
WAPI Position Paper Sept 2005 Sept 2005 IEEE WG
TGr Proposed Draft Revision Notice
Presentation transcript:

doc.: IEEE /0001r0 Submission Jan 2006 Bin Wang, ZTE CorporationSlide 1 ESS Load Balancing Notice: This document has been prepared to assist IEEE It is offered as a basis for discussion and is not binding on the contributing individual(s) or organization(s). The material in this document is subject to change in form and content after further study. The contributor(s) reserve(s) the right to add, amend or withdraw material contained herein. Release: The contributor grants a free, irrevocable license to the IEEE to incorporate material contained in this contribution, and any modifications thereof, in the creation of an IEEE Standards publication; to copyright in the IEEE’s name any IEEE Standards publication even though it may include portions of this contribution; and at the IEEE’s sole discretion to permit others to reproduce in whole or in part the resulting IEEE Standards publication. The contributor also acknowledges and accepts that this contribution may be made public by IEEE Patent Policy and Procedures: The contributor is familiar with the IEEE 802 Patent Policy and Procedures, including the statement "IEEE standards may include the known use of patent(s), including patent applications, provided the IEEE receives assurance from the patent holder or applicant with respect to patents essential for compliance with both mandatory and optional portions of the standard." Early disclosure to the Working Group of patent information that might be relevant to the standard is essential to reduce the possibility for delays in the development process and increase the likelihood that the draft publication will be approved for publication. Please notify the Chair as early as possible, in written or electronic form, if patented technology (or technology under patent application) might be incorporated into a draft standard being developed within the IEEE Working Group. If you have questions, contact the IEEE Patent Committee Administrator at. Date: Authors:

doc.: IEEE /0001r0 Submission Jan 2006 Bin Wang, ZTE CorporationSlide 2 Abstract This document suggests ESS load balancing for Wireless Network Managements.

doc.: IEEE /0001r0 Submission Jan 2006 Bin Wang, ZTE CorporationSlide 3 Agenda Definition The classification of load balancing Neighbor Load Balancing Neighbor Load Balancing step ESS Load Balancing ESS Load Balancing step

doc.: IEEE /0001r0 Submission Jan 2006 Bin Wang, ZTE CorporationSlide 4 Definition dot11LoadDifference : –defined the threshold of two AP’s load difference to init a load balancing process. The necessity of load difference: –Load balancing adjust process would bring new network overhead into the ESS. –Limit the frequency of load distribution process, decrease network management exchange between AP and STA, decrease network overhead. –Avoid frequent handover caused by load balancing. –Can be changed adaptively by other function such as frequent handover avoid.

doc.: IEEE /0001r0 Submission Jan 2006 Bin Wang, ZTE CorporationSlide 5 The classification of load balancing Load balancing should be divided into two sections. Neighbor Load balancing. –deal with the problem of load difference among neighbor APs ESS load balancing. –deal with the problem of load difference in ESS which has more APs beyond neighbor scope.

doc.: IEEE /0001r0 Submission Jan 2006 Bin Wang, ZTE CorporationSlide 6 Neighbor Load Balancing

doc.: IEEE /0001r0 Submission Jan 2006 Bin Wang, ZTE CorporationSlide 7 Neighbor Load Balancing AP will give it’s STA some candidate information for handover, reduce the sightless handover of STA in advance. –Suppose the dot11LoadDifference is set to (30). As showing in figure, AP7,2,5,6 should be excellent candidates subject to AP4. Because the STA of central AP can not or has very little possibility to handover to the other AP in one step which are not adjacent to the central AP. Tiny scope adjust to solve neighbor scope problems.

doc.: IEEE /0001r0 Submission Jan 2006 Bin Wang, ZTE CorporationSlide 8 Neighbor Load Balancing step 1. Load difference discovery. –Each AP in ESS exchange load information with it’s neighbor AP, when the central AP discovery the existence of load difference and the difference has been greater than dot11LoadDifference , Then the AP would init a load balance process. 2. AP implements the candidate neighbor information exchanging –The central AP should select one or more candidates from neighbor APs based on the candidate neighbor selection algorithm, and format to a candidate list, send to the STAs belongs to the central AP. –The detail frame format and interactive sequence should be same as the description in document “ v-normative-text- proposal-load-balancing.doc”

doc.: IEEE /0001r0 Submission Jan 2006 Bin Wang, ZTE CorporationSlide 9 Neighbor Load Balancing step 3. STA makes roaming decision. –The detail frame format and interactive sequence should be same as the description in document “ v-normative-text- proposal-load-balancing.doc”.

doc.: IEEE /0001r0 Submission Jan 2006 Bin Wang, ZTE CorporationSlide 10 ESS Load Balancing

doc.: IEEE /0001r0 Submission Jan 2006 Bin Wang, ZTE CorporationSlide 11 ESS Load Balancing Suppose the dot11LoadDifference is set to (30). The load of ESS is distributed in gradate by position, as showing in the figure: –The load difference between AP1 and it’s neighbors (AP2,3,4) are all less than the threshold. –The load difference between any two APs are less than the threshold. –But the difference between AP1 and AP5,6 are greater than the threshold, and the unbalancing do existed. –In this circumstance, the Neighbor Load Balancing will never started and this kind of unbalancing will keep living. The AP1 should try to pass it’s load to the AP5 or AP6, which are beyond the scope of neighbor of AP1. Pass Load Process is necessary.

doc.: IEEE /0001r0 Submission Jan 2006 Bin Wang, ZTE CorporationSlide 12 ESS Load Balancing step 1. Candidate AP select and create candidate list. –After the heavy load AP init a load balancing process, it should select candidate target AP in the ESS, whether the candidate is in the neighbor position of the heavy load AP or not. 2. Pass load to the light AP. –The heavy load AP should try to pass it’s load to the lightest AP or the AP in the direction. Each pass process has a time expire, after the pass process, the heavy AP would calculate success rate. if the success rate of once load pass process below some threshold, a newer target will be selected. –The load pass process would be marked in the target AP, and after the pass process, this target AP would try to init a new Neighbor Load Balancing and try to pass it’s load to the lighter direction. –The pass load process will be terminated only if the candidate list has been consumed or the load of the heavy AP has been successful passed.

doc.: IEEE /0001r0 Submission Jan 2006 Bin Wang, ZTE CorporationSlide 13 Feedback?