1 / 5

Fixing the locked legacy slot condition

Fixing the locked legacy slot condition. Matthew Fischer Broadcom. Problem text – 7.3.1.4.

wendellp
Download Presentation

Fixing the locked legacy slot condition

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Fixing the locked legacy slot condition Matthew Fischer Broadcom

  2. Problem text – 7.3.1.4 • In the case of a network composed of only short slot-time devices, but with knowledge of a neighboring co-channel BSS having longer slot-time traffic, the AP shall switch to the longest slot-time of the overlapping BSSs.

  3. Motion • Move to modify the last sentence of the second to last paragraph of 7.3.1.4 by changing both occurrences of “BSS” to “legacy BSS” and adding “until no indication of the presence of the overlapping legacy BSS has been detected for a period of 30 seconds” to the end of the sentence.

  4. Amended text • In the case of a network composed of only short slot-time devices, but with knowledge of a neighboring co-channel legacy BSS having longer slot-time traffic, the AP shall switch to the longest slot-time of the overlapping legacy BSSs until no indication of the presence of the overlapping legacy BSS has been detected for a period of 30 seconds.

  5. Effect of motion • Causes zero-hop limit to be invoked • You must directly observe legacy in order to switch to legacy slot • You must limit hops to some finite number if you wish to avoid the locked problem • Zero hops is much simpler to implement than one hop

More Related