Analysis of Multiple Random Walkers for Service Discovery in Fog Computing Network Environments (bibtex)
by Konstantinos Skiadopoulos, Konstantinos Giannakis, Konstantinos Oikonomou, Ioannis Stavrakakis
Abstract:
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 fraction of network nodes to be covered within a certain time period), the required number of random walkers 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.
Reference:
Konstantinos Skiadopoulos, Konstantinos Giannakis, Konstantinos Oikonomou, Ioannis Stavrakakis, "Analysis of Multiple Random Walkers for Service Discovery in Fog Computing Network Environments", In Second International Balkan Conference on Communications and Networking 2018 (BalkanCom'18), Podgorica, Montenegro, 2018. ([pdf])
Bibtex Entry:
@inproceedings{skiadopoulos2018analysis,
	Abstract = {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 fraction of network nodes to be
	covered within a certain time period), the required number of random
	walkers 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.},
	Address = {Podgorica, Montenegro},
	Author = {Skiadopoulos, Konstantinos and Giannakis, Konstantinos and 	Oikonomou, Konstantinos and Stavrakakis, Ioannis},
	Booktitle = {Second International Balkan Conference on Communications and Networking 2018 (BalkanCom'18)},
	Comment = {<a href="./MyPublications/skiadopoulos2018analysis.pdf">[pdf]</a>},
	Days = {3},
	Keywords = {own, refereed, olinet},
	Month = {jun},
	Title = {{{Analysis of Multiple Random Walkers for Service Discovery in Fog Computing Network Environments}}},
	Year = {2018}}
Powered by bibtexbrowser