Accurate performance analysis of hard handoff algorithms

Previous work on estimating the performance of hard handoff algorithms has been based on Monte-Carlo simulations or asymptotic approximations. A new analysis technique for evaluating the performance of handoff algorithms is introduced. This technique may be used to accurately estimate the performance of both optimal and suboptimal handoff algorithms. Specifically, the technique allows for the calculation of an upper bound on handoff performance without the need for storing or simulating the complicated optimal solution