A COMPARATIVE STUDY ON OPTIMIZATION OF SEARCH IN OVERLAY NETWORKS

Overlay Networks both in structured and unstructured environments have a massive growth in today’s market providing support of several applications. These networks can be erected very competently without any distinct rules and therefore considered suitable to the Internet environment. But, it is oblivious that searching techniques that are proposed usually perform poorly when the size of network is large network and ignorant to the physical network topology that also introduces wide-area network traffic. To enhance the search in overlay network different approaches of search patterns are provided in prior. These searches are done with various topologies in order to further expedite the search progress through selforganizing the P2P network into a small world. Both theoretical and experimental results on optimization on various search approaches are studied also effectiveness and efficiency of various approaches in comparison are discussed.