And Telecommunications

Abstract—In this poster a Random Walk-like algorithm for Service Discovery is presented, considering Random Graph topologies. According to the proposed algorithm, a certain entity moves in the network informing nodes about the service’s location. The movement is random and it may be possible for the entity to divide based on certain criteria presented here. This movement of the entity(ies) stops after a fixed number of hops that corresponds to the end of the advertising process. Afterwards, a searching process may start and it is expected to achieve higher probability of success compared to other cases (e.g., advertisement by a single random walker, controlled flooding). Furthermore, the overall time required until the advertisement process ends is significantly reduced. Simulation results presented here show the performance improvement of the proposed algorithm compared to the single random walker case