Performance evaluation of crossover switch discovery algorithms for wireless ATM LANs

• Authors: Chai-Keong Toh
• Venue: INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
• Year: 1996

In a connection-oriented Wireless LAN, the mobility of mobile hosts results in the establishment and disconnection of new and old virtual circuits. The resulting zncrease in signalling traffic along with the need to support multi-media stream handovers demand a fast, continuous and bandwidth-eficient handover protocol. In this paper, we adopt a handover scheme based on partial reestablishments, where a new partial path converges to an existing path. Connection re-routing (CR) operations are then performed at the convergence/crossover switch (CX). To achieve localised handovers, a wireless cell clustering scheme is proposed. The clustering of base stations to cluster switches (CLSs) provides fast intra-cluster handovers since the CR operations are performed at the CLS. To support fast inter-cluster handovers, four CX discovery schemes (Loose Select, Prior Path, Distributed Hunt and Backward Tracking) are introduced. Simulation results obtained from a trace-driven mobile network simulator on four diflerent network topologies (Random, Star, Tree and Hierarchical Redundancy) reveal that both Prior Path and Distrzbuted Hunt discoveries outperform the others by providing the fastest convergence with shorter resulting paths and higher circuit reuse efficiency.