Issue No.01 - January (2012 vol.23)
Chen Tian , Dept. of Electron. & Inf. Eng. ing, Huazhong Univ. of Sci. & Technol., Wuhan, China
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2011.111
In unstructured peer-to-peer networks, the average response latency and traffic cost of a query are two main performance metrics. Controlled-flooding resource query algorithms are widely used in unstructured networks such as peer-to-peer networks. In this paper, we propose a novel algorithm named Selective Dynamic Query (SDQ). Based on mathematical programming, SDQ calculates the optimal combination of an integer TTL value and a set of neighbors to control the scope of the next query. Our results demonstrate that SDQ provides finer grained control than other algorithms: its response latency is close to the well-known minimum one via Expanding Ring; in the mean time, its traffic cost is also close to the minimum. To our best knowledge, this is the first work capable of achieving a best trade-off between response latency and traffic cost.
telecommunication traffic, costing, mathematical programming, peer-to-peer computing, protocols, expanding ring, dynamic query protocol, unstructured peer-to-peer network, average response latency, traffic cost, performance metrics, controlled-flooding resource query algorithm, selective dynamic query, mathematical programming, integer TTL value, Peer to peer computing, Heuristic algorithms, Network topology, Estimation, Topology, Erbium, Protocols, selective dynamic query., Peer-to-peer networks, query algorithm
Chen Tian, "Revisiting Dynamic Query Protocols in Unstructured Peer-to-Peer Networks", IEEE Transactions on Parallel & Distributed Systems, vol.23, no. 1, pp. 160-167, January 2012, doi:10.1109/TPDS.2011.111