+- Free Academic Seminars And Projects Reports (https://easyreport.in)
+-- Forum: Project Ideas And Disscussion (https://easyreport.in/forumdisplay.php?fid=32)
+--- Forum: Engineering Project Ideas (https://easyreport.in/forumdisplay.php?fid=33)
+---- Forum: Computer Science Project Ideas (https://easyreport.in/forumdisplay.php?fid=36)
+---- Thread: Revisiting Dynamic Query Protocols in Unstructured Peer-to-Peer Networks (/showthread.php?tid=24137)
Revisiting Dynamic Query Protocols in Unstructured Peer-to-Peer Networks - prashant_007 - 08-16-2017
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.
projects9.com
Phone : +91-9618855666
+91-8008855666
Email : [email protected]
Revisiting Dynamic Query Protocols in Unstructured Peer-to-Peer Networks - shashi.kmr1 - 08-16-2017
Revisiting Dynamic Query Protocols in Unstructured Peer-to-Peer Networks
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.
Revisiting Dynamic Query Protocols in Unstructured Peer-to-Peer Networks - sayyadsanan - 08-16-2017
Hello sir can any one send the detailed code and documentation for the project
Sir i'm very thankful if any body provides the details
my mail id
[email protected]