Main Reference PaperThe Small World of File Sharing, IEEE Transactions on Parallel and Distributed Systems, July 2011.
  • File sharing by means of peer-to-peer (P2P) networks has got wide popularity; some reports suggest that P2P traffic is the leading consumer of bandwidth ahead of Web traffic. To propose a new outlook for analyzing data access workloads that deems the implicit relationships that form among users based on the data they access. It also recommends a new formation the interest-sharing graph that captures common user interests in data and validates its efficiency with data-sharing systems.

+ Description
  • File sharing by means of peer-to-peer (P2P) networks has got wide popularity; some reports suggest that P2P traffic is the leading consumer of bandwidth ahead of Web traffic. To propose a new outlook for analyzing data access workloads that deems the implicit relationships that form among users based on the data they access. It also recommends a new formation the interest-sharing graph that captures common user interests in data and validates its efficiency with data-sharing systems.

  • To identifying the structure of community’s and to exploit data access patterns.

  • To significantly increase the overall system performance.

  • To analyze data access workloads and hence form an implicit relationship among the users.

+ Aim & Objectives
  • To identifying the structure of community’s and to exploit data access patterns.

  • To significantly increase the overall system performance.

  • To analyze data access workloads and hence form an implicit relationship among the users.

  • The world-wide web forms a large directed graph, whose vertices are documents and edges are links pointing from one document to another. Here we contribute a new model, scale-free model which demonstrates that despite its apparent random character, the topology of this graph has a number of universal scale-free characteristics.

+ Contribution
  • The world-wide web forms a large directed graph, whose vertices are documents and edges are links pointing from one document to another. Here we contribute a new model, scale-free model which demonstrates that despite its apparent random character, the topology of this graph has a number of universal scale-free characteristics.

  • OS : Window 7 (Cygwin) / Ubuntu 12.04 LTS 64bit.

  • Simulator: NS 2.35, Language : TCL and AWK script, (C++)

+ Software Tools & Technologies
  • OS : Window 7 (Cygwin) / Ubuntu 12.04 LTS 64bit.

  • Simulator: NS 2.35, Language : TCL and AWK script, (C++)

  • B.E / B.Tech / M.E / M.Tech

+ Project Recommended For
  • B.E / B.Tech / M.E / M.Tech

Professional Ethics: We S-Logix would appreciate the students those who willingly contribute with atleast a line of thinking of their own while preparing the project with us. It is advised that the project given by us be considered only as a model project and be applied with confidence to contribute your own ideas through our expert guidance and enrich your knowledge.