Abstract:          Scalable Internet services are based on sets of peer application servers. A decentralized location service is used to resolve human readable application identifiers and return the nearest application server reference. This paper evaluates several services and algorithms from the Internet, grid and peer-to-peer community services. It identifies two potential problems and proposes a new approach for handling them. Existing techniques structure the overlay networks using tree structures. The proposed service enhances the structure with meshed structures at each level, creating dynamically multiple paths to enhance scalability. We present a study and simulation results on one aspect of scalability – sudden load of requests from users. Our service adapts to the load reaching a stable stage and performing resolution requests before a certain time limit.