An investigation about process matchmaking performances of unstructured and decentralized digital environments
No Thumbnail Available
Date
2007
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Open Access Color
OpenAIRE Downloads
OpenAIRE Views
Abstract
Efficient matchmaking is an important problem in unstructured and decentralized digital environments. We report the results of simulations of these environments and provide measurements of match performance focusing on unstructured and decentralized environments. In the study, different environment models including P2P (Hypergrid, Gnutella with/without ultrapeer); small-world (WattsStrogatz); heavy-tailed and random versions of Autonomous System Waxman model showing power-law distribution property; random and 2D-Grid are considered. The flooding mechanism enabling process encounters for match purposes is uninformed Breadth-First-Search. Simulations show that the matchmaking performance of random environment outperforms the others for almost all different problems and time-to-live settings. On the other hand, the total cost of small world environment model is the highest for almost all setups. © 2007 IEEE.
Description
Keywords
Performance, Process matchmaking, Simulation, Unstructured and decentralized environments
Turkish CoHE Thesis Center URL
Fields of Science
Citation
1
WoS Q
N/A
Scopus Q
N/A
Source
Proceedings of the 2007 Inaugural IEEE-IES Digital EcoSystems and Technologies Conference, DEST 2007 -- 2007 Inaugural IEEE-IES Digital EcoSystems and Technologies Conference, DEST 2007 -- 21 February 2007 through 23 February 2007 -- Cairns -- 70254
Volume
Issue
Start Page
81
End Page
87