Semantic social routing in Gnutella
| dc.contributor.committeeMember | Zhang, W. J. (Chris) | en_US |
| dc.contributor.committeeMember | Vassileva, Julita | en_US |
| dc.contributor.committeeMember | McCalla, Gordon I. | en_US |
| dc.contributor.committeeMember | Grassmann, Winfried K. | en_US |
| dc.contributor.committeeMember | Deters, Ralph | en_US |
| dc.creator | Upadrashta, Yamini | en_US |
| dc.date.accessioned | 2005-02-17T13:08:38Z | en_US |
| dc.date.accessioned | 2013-01-04T04:25:40Z | |
| dc.date.available | 2005-02-18T08:00:00Z | en_US |
| dc.date.available | 2013-01-04T04:25:40Z | |
| dc.date.created | 2005-01 | en_US |
| dc.date.issued | 2005-01-28 | en_US |
| dc.date.submitted | January 2005 | en_US |
| dc.description.abstract | The objective of this project is to improve the performance of the Gnutella peer-to-peer protocol (version 0.4) by introducing a semantic-social routing model and several categories of interest. The Gnutella protocol requires peers to broadcast messages to their neighbours when they search files. The message passing generates a lot of traffic in the network, which degrades the quality of service. We propose using social networks to optimize the speed of search and to improve the quality of service in a Gnutella based peer-to-peer environment. Each peer creates and updates a “friends list” from its past experience, for each category of interest. Once peers generate their friends lists, they use these lists to semantically route queries in the network. Search messages in a given category are mainly sent to “friends” who have been useful in the past in finding files in the same category. This helps to reduce the search time and to decrease the network traffic by minimizing the number of messages circulating in the system as compared to standard Gnutella. This project will demonstrate by simulating a peer-to-peer type of environment with the JADE multi-agent system platform that by learning other peers’ interests, building and exploiting their social networks (friends lists) to route queries semantically, peers can get more relevant resources faster and with less traffic generated, i.e. that the performance of the Gnutella system can be improved. | en_US |
| dc.identifier.uri | http://hdl.handle.net/10388/etd-02172005-130838 | en_US |
| dc.language.iso | en_US | en_US |
| dc.subject | social networks | en_US |
| dc.subject | peer-to-peer | en_US |
| dc.subject | semantic routing | en_US |
| dc.title | Semantic social routing in Gnutella | en_US |
| dc.type.genre | Thesis | en_US |
| dc.type.material | text | en_US |
| thesis.degree.department | Computer Science | en_US |
| thesis.degree.discipline | Computer Science | en_US |
| thesis.degree.grantor | University of Saskatchewan | en_US |
| thesis.degree.level | Masters | en_US |
| thesis.degree.name | Master of Science (M.Sc.) | en_US |