Effect of the Degree of Neighborhood on Resource Discovery in Ad Hoc Grids

Match

“…The network layer is implemented using our networking library, optimized for building peer-to-peer overlay networks and with built-in support for Network Address Translation (NAT) puncturing and authenticated messaging. 1 For eciency, message exchange between users and matchmakers uses UDP. Order negotiation proceeds using TCP since this ow requires bilateral and reliable message exchange.…”

“…These results show that in a network with 2'000 matchmakers, by increasing the order fanout by only 15, MATCH can tolerate with 50% of all matchmakers acting maliciously and still produce a matching quality that is on par with the situation where all matchmakers are honest. In practice, the exact value of A is not known a-priori and MATCH developers should therefore x the order fanout to account for an upper bound for the malicious fraction (e.g., many BFT consensus algorithms tolerate up to A = 1 3 [12]).…”

“…Motivated by the scalability and load balancing issues of centralized matchmaking, various researchers explored the usage of multiple, independent matchmakers [1,2,20,48]. Matchmakers usually operate within their own administrative domain, acting as a broker for a specic set of nodes.…”