Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/44178
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKalra, Ritesh
dc.date.accessioned2011-05-27T06:29:26Z
dc.date.available2011-05-27T06:29:26Z
dc.date.copyright2011en_US
dc.date.issued2011
dc.identifier.urihttp://hdl.handle.net/10356/44178
dc.description.abstractThe first generation peer-to-peer file sharing networks, such as Napster, relied on a central database to co-ordinate look ups on the network. The second generation peer to-peer networks such as Gnutella used flooding to locate files, searching every node on the network. Third generation peer-to-peer networks use Distributed Hash Tables to look up files in the network. Distributed Hash Tables store resource locations throughout the network. A major criterion for these protocols is locating the desired nodes quickly. Various structured and unstructured DHT protocols are used in the implementation of P2P network. Some of them are Tapestry, Chord, Pastry, Kademlia etc.en_US
dc.format.extent96 p.en_US
dc.language.isoenen_US
dc.rightsNanyang Technological University
dc.subjectDRNTU::Engineering::Computer science and engineering::Computer systems organization::Computer-communication networksen_US
dc.titleSocial networking in P2P systemsen_US
dc.typeFinal Year Project (FYP)en_US
dc.contributor.supervisorAnwitaman Dattaen_US
dc.contributor.schoolSchool of Computer Engineeringen_US
dc.description.degreeBachelor of Engineering (Computer Science)en_US
item.grantfulltextrestricted-
item.fulltextWith Fulltext-
Appears in Collections:SCSE Student Reports (FYP/IA/PA/PI)
Files in This Item:
File Description SizeFormat 
SCE10-0014.pdf
  Restricted Access
1.45 MBAdobe PDFView/Open

Page view(s) 50

254
Updated on Nov 28, 2020

Download(s) 1

31
Updated on Nov 28, 2020

Google ScholarTM

Check

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.