Multiple and replicated random walkers analysis for service discovery in fog computing IoT environments
Authors:
- Konstantinos SkiadopoulosKSKonstantinos Skiadopoulos
- Konstantinos OikonomouKonstantinos Oikonomou
- Markos AvlonitisMAMarkos Avlonitis
- Konstantinos GiannakisKonstantinos Giannakis
- Dimitrios KogiasDKDimitrios Kogias
- Ioannis StavrakakisISIoannis Stavrakakis
- 1 October 2019
- journal article
- research article
- Published by Elsevier in Ad Hoc Networks
- Vol. 93
Abstract
No abstract availableKeywords
This publication has 39 references indexed in Scilit:
- Finding your Way in the FogACM SIGCOMM Computer Communication Review, 2014
- A Scalable and Self-Configuring Architecture for Service Discovery in the Internet of ThingsIEEE Internet of Things Journal, 2014
- Tight bounds for the cover time of multiple random walksTheoretical Computer Science, 2011
- Random walk with jumps in large-scale random geometric graphsComputer Communications, 2010
- Multiple Random Walks in Random Regular GraphsSIAM Journal on Discrete Mathematics, 2010
- Random walk with long jumps for wireless ad hoc networksAd Hoc Networks, 2009
- The cover time of the preferential attachment graphJournal of Combinatorial Theory, Series B, 2007
- The cover time of sparse random graphsRandom Structures & Algorithms, 2006
- A tight lower bound on the cover time for random walks on graphsRandom Structures & Algorithms, 1995
- A tight upper bound on the cover time for random walks on graphsRandom Structures & Algorithms, 1995