The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January (2012 vol.23)
pp: 160-167
Chen Tian , Dept. of Electron. & Inf. Eng. ing, Huazhong Univ. of Sci. & Technol., Wuhan, China
ABSTRACT
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.
INDEX TERMS
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
CITATION
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
REFERENCES
[1] E. Adar and B.A. Huberman, “Free Riding on Gnutella,” technical report, Xerox PARC, 2000.
[2] R. Beraldi, “Biased Random Walks in Uniform Wireless Networks,” IEEE Trans. Mobile Computing, vol. 8, no. 4, pp. 500- 513, Apr. 2009.
[3] H. Cai and J. Wang, “Exploiting Geographical and Temporal Locality to Boost Search Efficiency in Peer-to-Peer Systems,” IEEE Trans. Parallel and Distributed Systems, vol. 17, no. 10, pp. 1189-1203, Oct. 2006.
[4] A.J. Chakravarti, G. Baumgartner, and M. Lauria, “The Organic Grid: Self-Organizing Computation on a Peer-to-Peer Network,” IEEE Trans. Systems, Man, and Cybernetics, Part A: Systems and Humans, vol. 35, no. 3, pp. 373-384, May 2005.
[5] N. Chang and M. Liu, “Revisiting the TTL-Based Controlled Flooding Search: Optimality and Randomization,” Proc. ACM MobiCom, 2004.
[6] N. Chang and M. Liu, “Optimal Controlled Flooding Search in a Large Wireless Network,” Proc. IEEE Third Int'l Symp. Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt), 2005.
[7] Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker, “Making Gnutella-Like P2P Systems Scalable,” Proc. ACM SIGCOMM, 2003.
[8] E. Cohen and S. Shenker, “Replication Strategies in Unstructured Peer-to-Peer Networks,” Proc. ACM SIGCOMM, 2002.
[9] O.S. Community, http:/gnutella.wego.com/, 2010.
[10] A. Crespo and H. Garcia-Molina, “Routing Indices for Peer-to-Peer Systems,” Proc. IEEE 22nd Int'l Conf. Distributed Computing Systems (ICDCS), 2002.
[11] C. Doulkeridis, A. Vlachou, K. Norvag, Y. Kotidis, and M. Vazirgiannis, “Multidimensional Routing Indices for Efficient Distributed Query Processing,” Proc. Int'l Conf. Information and Knowledge Management, 2009.
[12] A. Fisk, “Gnutella Dynamic Query Protocol v0.1,” http://www9.limewire.com/develop-rdynamic_query.html , 2003.
[13] C. Gkantsidis, M. Mihail, and A. Saberi, “Random Walks in Peer-to-Peer Networks,” Proc. IEEE INFOCOM, 2004.
[14] C. Gkantsidis, M. Mihail, and A. Saberi, “Hybrid Search Schemes for Unstructured Peer-to-Peer Networks,” Proc. IEEE INFOCOM, 2005.
[15] N. Inc, http:/www.napster.com/, 2011.
[16] S. Ioannidis, “Absence of Evidence as Evidence of Absence: A Simple Mechanism for Scalable P2P Search,” Proc. IEEE INFOCOM, 2009.
[17] H. Jiang and S. Jin, “Exploiting Dynamic Querying Like Flooding Techniques in Unstructured Peer-to-Peer Networks,” Proc. IEEE 13th Int'l Conf. Network Protocols (ICNP), 2005.
[18] S. Jin and H. Jiang, “Novel Approaches to Efficient Flooding Search in Peer-to-Peer Networks,” Computer Networks, vol. 51, no. 10, pp. 2818-2832, 2007.
[19] Limewire, http:/www.limewire.com/, 2011.
[20] Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, “Search and Replication in Unstructured Peer-to-Peer Networks,” Proc. Int'l Conf. Supercomputing, 2002.
[21] Q. Lv, S. Ratnasamy, and S. Shenker, “Can Heterogeneity Make Gnutella Scalable,” Proc. First Int'l Workshop Peer-to-Peer Systems (IPTPS), 2002.
[22] G. Nemhauser and L. Wolsey, Integer and Combinatorial Optimization. John Wiley, 1988.
[23] C. Palmer and G. Steffan, “Generating Network Topologies that Obey Power Laws,” Proc. IEEE Global Telecomm. Conf. (GLOBECOM), 2000.
[24] K. Puttaswamy, A. Sala, and B.Y. Zhao, “Searching for Rare Objects Using Index Replication,” Proc. IEEE INFOCOM, 2008.
[25] I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications,” Proc. ACM SIGCOMM, 2001.
[26] D. Stutzbach and R. Rejaie, “Characterizing the Two-Tier Gnutella Topology,” Proc. ACM Int'l Conf. Measurement and Modeling of Computer Systems (SIGMETRICS), 2005.
[27] C. Tian, H. Jiang, X. Liu, W. Liu, and Y. Wang, “Towards Minimum Traffic Cost and Minimum Response Latency: A Novel Dynamic Query Protocol in Unstructured P2P Networks,” Proc. IEEE 37th Int'l Conf. Parallel Processing (ICPP), 2008.
[28] B. Waxman, “Routing of Multipoint Connections,” IEEE J. Selected Areas in Comm., vol. 6, no. 9, pp. 1617-1622, Dec. 1988.
[29] C.-J. Wu, K.-H. Yang, and J.-M. Ho, “Antsearch: An Ant Search Algorithm in Unstructured Peer-to-Peer Networks,” Proc. IEEE Symp. Computers and Comm., 2006.
[30] Y. Zhao, J. Kubiatowicz, and A. Joseph, “Tapestry: An Infrastructure for Fault-Tolerant Wide-Area Location and Routing,” Technical Report UCB/CSD-01-1141, Computer Science Dept., University of California, 2001.
[31] M. Zhong, K. Shen, and J.I. Seiferas, “The Convergence-Guaranteed Random Walk and Its Applications in Peer-to-Peer Networks,” IEEE Trans. Computers, vol. 57, no. 5, pp. 619-633, May 2008.
[32] Y. Zhu and Y. Hu, “Enhancing Search Performance on Gnutella-Like P2P Systems,” IEEE Trans. Parallel and Distributed Systems, vol. 17, no. 12, pp. 1482-1495, Dec. 2006.
43 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool