In a network of wireless access points, location feeds are sourced from a controller machine managing these access points or from the access points themselves. These location feeds contain information like RSSI(Received Signal Strength Indicator) respectively for different clients(who have their unique mac address or unique labels), mac address of the client, mac address of the Access Point, etc. These location feeds or feed objects sourced either from the controller machine managing the access points or the access point to the location engine server are pushed to different queues based on the site(one queue per site) from where the location feed or feed object is coming from, assuming that there is one controller per site in the case of location feeds being sourced from the controller machine. Here depending upon the rate of arrival of location feeds from different sites and the platform capacity of the location engine server, there can be one or more sites handled by the location engine server. Also here site implies where the wireless access points are deployed and site may contain buildings, which in turn can have several floors where the access points are deployed. Typically each floor has a floor map with their respective dimensions where after computing the location of the client, we can plot the respective location on the user interface taking into account the scale of the map or the ratio of distance on the map to the corresponding distance in real time. Then various worker processes or threads for different queues pick up location feeds or feed objects and push them to a distributed hash table such that the insertion order of location feeds is maintained and the key for the distributed hash table is the client mac address(or unique label for client) and the value is the linked list of the location feeds or feed objects in insertion order. Also there can be a single distributed hash table if all servers computing the location of the client from the feed object has the access to information of all the sites or we can have several instances of distributed hash table per site if certain set of servers have access to information of a particular site only. While iterating through the entries of the distributed hash table to compute the location of the client, we also consider the timestamp when the first location feed or feed object was pushed for that entry. We calculate the difference between current time and the timestamp for that entry and if it is greater than or equal to the threshold set for calculating the location of the client like say 10 seconds then we delete the corresponding entry from the distributed hash table and calculate the location of the client using algorithms like trilateration, triangulation, etc. which might require minimum three location feeds or feed objects(in that case delete or disregard entries with less than 3 location feed or feed objects) in the threshold window set for calculating the location of the client. If the difference between the current time and timestamp of the entry in the distributed hash table is less than the threshold set for calculating the location of the client then we stop iteration of the subsequent entries of the distributed hash table as for subsequent entries the difference will be even smaller and start again from the first entry of the distributed hash table thereby maintaining insertion order for calculating the location of the client as well.