09 فروردین 1403
حبيب رستمي

حبیب رستمی

مرتبه علمی: دانشیار
نشانی: دانشکده مهندسی سیستم های هوشمند و علوم داده - گروه مهندسی کامپیوتر
تحصیلات: دکترای تخصصی / کامپیوتر
تلفن: 0773
دانشکده: دانشکده مهندسی سیستم های هوشمند و علوم داده

مشخصات پژوهش

عنوان Recommend top-k most downloaded files in the chord-based P2P file-sharing system
نوع پژوهش مقالات در نشریات
کلیدواژه‌ها
ثبت نشده‌است!
مجله Peer-to-Peer Networking and Applications
شناسه DOI
پژوهشگران سینا کشوادی (نفر اول) ، امیر مسعود رحمانی (نفر دوم) ، حبیب رستمی (نفر سوم)

چکیده

Peer-to-peer (P2P) file sharing system provides a platform that enables users to share their files over network and provides a rapid and scalable content distribution mechanism to access an explosive volume of shared files on the system. The search mechanism in these systems is mainly keyword-based, so, users may have to try different keywords to find the desired file, where increase the network traffic. Therefore, the existence of a tool in these clients that guide users towards the top-k most downloaded files is very beneficial in terms of user convenience and traffic reduction. We have proposed our algorithms by adding a new data structure to chord protocol. Chord has been widely used as a routing protocol in structured P2P networks. We validated our proposed algorithms through simulation by using PlanetSim simulator and studied the effect of several parameters on the performance of our algorithms. The results show very good performance, in terms of communication cost and response time. Keywords