MatchTree: Flexible, scalable, and fault-tolerant wide-area resource discovery with distributed matchmaking and aggregation

This paper proposes a novel wide-area resource discovery method, MatchTree  , that is built upon a Peer-to-Peer (P2P) framework to deliver scalable and fault-tolerant resource discovery supporting distributed query processing and aggregation of results. MatchTree leverages a self-organizing tree for query distribution and result aggregation with the asymptotic latency increase pattern of O(logN)O(logN), where NN is the number of queried nodes. MatchTree distinguishes itself from related resource discovery systems based on structured P2P overlays by supporting complex queries (such as regular expressions in matchmaking), and from related unstructured P2P discovery systems by guaranteeing query completeness. This paper presents the overall architecture of MatchTree, proposes heuristics to improve fault-tolerance and reduce query response times through redundant query topologies, dynamic timeout policies, and sub-region queries. The paper evaluates the system quantitatively through large scale simulations, as well as through experiments with a prototype implementation deployed on a wide-area infrastructure (PlanetLab). The experiment results with proposed heuristics show that the maximum query latency of MatchTree decreases from 154 to 12 s, and the maximum query missing region decreases from 13.4% to 2.3% in the wide-area real world testbed.

► A decentralized resource discovery mechanism with rich query processing capacity.
► Providing flexible attributes addition and guaranteeing the query completeness.
► Proposing novel fault-tolerance algorithms of a self-organizing multicast tree.
► Interactive query submission web-service operating on PlanetLab resources.