| Popis: |
The multiple random walkers mechanism is revisited in this paper for service discovery purposes considering modern dynamic network environments like fog computing, where there is a need for certain services (e.g., virtual network functions) to be available to the end users. Network coverage is analytically investigated here considering multiple random walkers in geometric random graph topologies of various densities. The analytical results derived here are shown to be in accordance with other results in the literature (e.g., coverage under multiple random walkers for fully connected network topologies). Moreover, when there exist certain coverage and time constraints (i.e., the minimum fraction of network nodes to be covered within a certain time period), the required minimum number of random walkers satisfying these constraints is also analytically derived. Simulation results demonstrate the effectiveness of multiple random walkers for service discovery purposes and support the claims and expectations of the analysis. |
