FAST ROAMING AND UNIFORM POLICY FOR WIRELESS CLIENTS WITH DISTRIBUTED HASHING

摘要

Techniques for efficient roaming of clients between access points (APs) of a wireless data communications network are described. A first AP can receive a request for the first client to join the network. The request can specify a unique identifier for the first client. An identifier for a second AP can be determined by processing the unique identifier for the first client using a predefined hash function. A network address of the second AP can be determined using the determined identifier for the second AP. The first AP can transmit a request to the determined network address of the second AP to query for network state information corresponding to the first client, and upon receiving a pairwise master key (PMK) associated with the first client, can authenticate the first client to join the network.