Cakir,B.Kilic,H.Computer Engineering2024-09-102024-09-10200711424404703978-142440470-410.1109/DEST.2007.371950https://doi.org/10.1109/DEST.2007.371950https://hdl.handle.net/20.500.14411/7328Efficient 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.eninfo:eu-repo/semantics/closedAccessPerformanceProcess matchmakingSimulationUnstructured and decentralized environmentsConference ObjectN/AN/A8187