Improved CDMA Mobile Hashing Lucent Technologies grants a free, irrevocable license to 3GPP2 and its Organizational Partners to incorporate text or other copyrightable material contained in the contribution and any modifications thereof in the creation of 3GPP2 publications; to copyright and sell in Organizational Partner's name any Organizational Partner's standards publication even though it may include all or portions of this contribution; and at the Organizational Partner's sole discretion to permit others to reproduce in whole or in part such contribution or the resulting Organizational Partner's standards publication. Lucent Technologies is also willing to grant licenses under such contributor copyrights to third parties on reasonable, non-discriminatory terms and conditions for purpose of practicing an Organizational Partner’s standard which incorporates this contribution. This document has been prepared by Lucent Technologies to assist the development of specifications by 3GPP2. It is proposed to the Committee as a basis for discussion and is not to be construed as a binding proposal on Lucent Technologies. Lucent Technologies specifically reserves the right to amend or modify the material contained herein and to any intellectual property of Lucent Technologies other than provided in the copyright statement above. C A
2 Improved Hashing: Introduction Drivers –Insufficient control of mobile distribution across CDMA carriers –Some CDMA carriers may be set up specifically with: Subset of services (e.g. Packet Data) Revision-dependent mobile capabilities (e.g. EVDV F-PDCH) Different capacities –Load Balancing across bandclasses in multi-bandclass systems is inefficient and time consuming –Different CDMA carriers may have load imbalances –Efficient hashing will: Reduce cross-carrier traffic assignments to improve call setup performance Allow more flexibility in distributing paging load
3 Improved Hashing: Introduction Proposed Solution –Four new methods for hashing mobiles: Idle hashing –Across band classes –Based on Mobile P_REV –Non-uniformly based on carrier weighting System Access hashing based on Service Option
4 Improved Hashing: Call Flow MobileSystem Extended System Parameters(PCH) MC_RR Parameters(BCCH) Alternate Band Class System Access Hash Enable(Orig., Term.) ECCLM(PCH,BCCH) Alternate Band Class Alt. BC Frequencies Hash Weights P_REV Service Option (access only) Registration Alt. BC Support Enables system to hash paging messages To proper frequency across bandclasses
5 Improved Hashing: Idle Hashing Idle Mobile supports Alternate Bandclass? Combine both Frequency Lists in Specified order Hash according to original algorithm NUM_HASH_LIST > 0? Y Y N N Determine Idle Weighting of Supported frequencies Each supported frequency equally Weighted at 1 Ignore Alternate Frequency List Idle
6 Improved Hashing: Determine Idle Weighting of Supported Frequencies Find Hashing List that Corresponds to P_REV Any Applicable List? Y N Each supported frequency equally Weighted at 1 Attach associated weights to supported frequencies: Duplicate or eliminate (0 weight) entries in Existing sequence Adjust size of list (N) Return
7 Improved Hashing: Access Hashing System Access Mobile supports Alternate Bandclass? Combine both Frequency Lists in Specified order NUM_SO_GROUP > 0? Y Y N N Determine Access Weighting of Supported frequencies Remain on current frequency Ignore Alternate Frequency List Re-Hash using original algorithm and new list Access No applicable list
8 Improved Hashing: Determine Access Weighting of Supported Frequencies Find Hashing List that Corresponds to SO Group Any Applicable List? Y N Attach associated weights to supported frequencies: Duplicate or eliminate (0 weight) entries in Existing sequence Adjust size of list (N) No applicable list Re-hash
9 Improved Hashing: Conclusion The contribution will allow: –Directing idle mobiles to idle on desired carriers Load Balancing –Paging –Traffic Match Hardware/RF configuration/capacity –Directing accessing mobiles to carriers set up for the requested service group