Implementation and analysis of connection-management procedures in a wireless ATM LAN

In a previous paper, we proposed a wireless ATM (asynchronous transfer mode) LAN (local area network) with two features to simplify handoffs: distributed switching/buffering at base stations, and provisioned destination-rooted trees. In this paper, we describe an end-to-end handshake-based connection-management algorithm, and a distributed location-management algorithm for this wireless ATM LAN. An implementation of these algorithms and the service time measurements obtained from the implementation are described. This data is used to perform a throughput analysis, which indicates that over 100 calls/sec can be handled by each node in typical configurations, which is comparable to current wired ATM switch call handling throughputs, in spite of the fact that these nodes perform additional location management and handoff functions. Finally, we present a signaling bandwidth analysis to demonstrate the feasibility of the distributed location management scheme in LANs.