Minimizing File Download Time in Stochastic Peer to Peer Networks
ABSTRACT
The peer-to-peer (P2P) file-sharing applications are becoming increasingly popular and account for more than 70% of the Internet’s bandwidth usage. Measurement studies show that a typical download of a file can take from minutes up to several hours depending on the level of network congestion or the service capacity fluctuation.
In the Existing System the Content distribution is a centralized one, where the content is distributed from the centralized server to all clients requesting the document. Clients send request to the centralized server for downloading the file. Server accepts the request and sends the file as response to the request. In most client-server setups, the server is a dedicated computer whose entire purpose is to distribute files.
Limitations of the Existing System, Scalability problem arises when multi requests arises at a single time, Servers need heavy processing power, Downloading takes hours when clients increases, Requires heavy storage in case of multimedia content.
In this project, the proposed system considers two major factors that have significant impact on average download time, namely, the spatial heterogeneity of service capacities in different source peers and the temporal fluctuation in service capacity of a single source peer. In this project, common approach of analyzing the average download time based on average service capacity is fundamentally flawed. We rigorously prove that both spatial heterogeneity and temporal correlations in service capacity increase the average download time in P2P networks and then analyze a simple, distributed algorithm to effectively remove these negative factors, thus minimizing the average download time. We show through analysis and simulations that it outperforms most of other algorithms currently used in practice under various network configurations.
Advantages of proposed System, Peer-to-peer content distribution provides more resilience and higher availability through wide-scale replication of content at large numbers of peers, A P2P content distribution community is a collection of intermittently-connected nodes with each node contributing storage, content and bandwidth to the rest of the community, The peer-to-peer file sharing networks had a centralized server system. This system controls traffic amongst the users.
Pdf
Click here to Download the Project Code and Project Document.
------------------------------------------------------------------------------------------------------------------
Always Acyclic Distributed Path Computation
ABSTRACT
Distributed routing
algorithms may give rise to transient loops during path recomputation, which
can pose significant stability problems in high-speed networks. We present a
new algorithm, Distributed Path
Computation with Intermediate Variables (DIV), which can be combined with any distributed routing algorithm to guarantee that the
directed graph induced by the routing decisions remains acyclic at all times.
The key contribution of DIV, besides its ability to operate with any routing
algorithm, is an update mechanism using simple message exchanges between neighboring
nodes that guarantees loop-freedom at all times. DIV provably outperforms
existing loop-prevention algorithms in several key metrics
such as frequency of synchronous updates and the ability to maintain paths
during transitions. Simulation results quantifying these gains in the context
of shortest path routing are presented. In addition, DIV’s universal
applicability is illustrated by studying its use with a routing that operates according
to a nonshortest path objective. Specifically, the routing seeks robustness
against failures by maximizing the number of next-hops available at each node
for each destination.
Click here to Download the Project Code, Project Document and Video.
------------------------------------------------------------------------------------------------------------------
Accredited College Information Management System
ABSTRACT
The
commissionaire/Director of college education (CCE), a part of the department of
education of the AP state government is looking after the various activities
pertaining to the development of colleges throughout the state. The Directorate
of collegiate Education’s responsibility is to govern the academic
&Administrative activities of all Colleges in the state. The dept is
required to maintain this information of the colleges and consolidate the
information and activities of all the colleges in the state.
The college
is entering all the information pertaining to department manually using office
software. This detailed entry is a combination of various type of information
related to the college, courses, teachers, scholarships, income and
expenditure, inspection and audit. This information from the various colleges
is sent back to the CCE where it is stored again compiled every time
repeatedly.
The Accredited College Information Management System (ACIMS)
deals with automation of maintenance of academic and administrative information
of all Engineering Colleges in the state which involves a lot of manual work to
coordinate and analyze the Information, a major drawback in the existing
system. We have to create the website. We give the login id to the Accredited
colleges and each and every college can upload the information. Accredited
Colleges can know the strengths and weakness of the other Accredited colleges.
Other non- accredited colleges don’t have the permission to login in to the
website. The students don’t know to choose which college is better to join.
They can get information of Accredited Colleges from this site.
Click here to Download the Project Code and Project Document.
------------------------------------------------------------------------------------------------------------------
Comments