mca final year projects in java free download
BACK END - SQL SEVER 2007
MCA FINAL YEAR PROJECT Project SYNOPSIS OF ONLINE EXAMINATION SYSTEM
Final Report Of Online Examination System with full Documentation
SYNOPSIS of Project Sanatorium (Hospital Information System)
Click here to download Final report of project Hospital Information System
BCA Project 3# ONLINE AUCTION SYSTEM
FRONTEND
- C # AND .NET FRAMEWORK
BACKEND
- SQL
SERVER 2008
SYNOPSIS OF PROJECT ONLINE
AUCTION SYSTEM
FINAL REPORT WITH FULL DOCUMENTATION and SOURCE CODE OF
PROJECT ONLINE AUCTION SYSTEM
INTRODUCTION
CHAPTER 1 INTRODUCTION
1 Overview of the System
The worldwide
infrastructure of computers and networks creates exciting opportunities for
collecting vast amounts of data and for sharing computers and resources on an
unprecedented scale. In the last few years, the emerging Peer-to-Peer (P2P)
model has become a very powerful and attractive paradigm for developing
Internet scale file systems and sharing resources (that is, CPU cycles, memory,
storage space, and network bandwidth) over large-scale geographical areas. The
basic idea is that an overlay network of nodes (peers) is constructed on top of
heterogeneous networks. Overlays are
flexible and deployable approaches that allow users to perform distributed
operations without modifying the underlying physical network.
The first wave
of P2P systems implemented unstructured P2P overlays in which no global
structure or knowledge is maintained. To search for data or resources, messages
are sent over multiple hops from one peer to another with each peer responding
to queries for information it has stored locally. Structured P2P overlays,
implement a distributed hash table data structure in which every data item can
be located within a small number of hops at the expense of keeping some state
information locally at the nodes.
Unstructured
P2P systems are very effective infrastructures to share and store documents,
because their decentralized nature allows easy additions, updates, increased
storage, and offers fault-tolerant properties through the use of replication
and caching. In addition, recent efforts based on caching and other heuristics
have significantly improved the query-routing problem in unstructured P2P
systems as well. An important problem is that such systems have not fully
considered how the heterogeneity of the
underlying infrastructure affects the performance of the information retrieval
algorithms implemented on top of these networks. The P2P infrastructure can
encompass resources with different processing and communication capabilities,
located across different geographical areas. As a result, retrieving documents
over such Internet-scale environments is subject to greater variations due to
unpredictable communication latencies, excessive resource consumption, and
changing resource availability.
CHAPTER 2
DESCRIPTION OF THE PROBLEM
2.1 Existing System:
Web sites such
as Youtube.com and Yahoo Video allow users to upload, search, browse, and view
on demand the video clips of other users through a keyword-based search
interface. Such systems typically exploit a centralized storage and retrieval
infrastructure that has a number of disadvantages and limitations.
We are all
witnessing the rise in a new form of journalism, where nonjournalists have an
active role in collecting, analyzing, and generating news based on their
personal rules of fairness and objectivity, often also referred to as Citizen
Journalism. The Web site voiceofsandiego.com establishes half of its content from contributing authors, and
this new way of performing journalism has profound implications on the future
of news media. Content in such applications is currently communicated to users
through centralized Web sites, which suffer from the same disadvantages as the video-sharing applications:
Drawbacks of the existing system
1) The service
can easily become a bottleneck during periods of high demand and is also a
single point of failure.
2)The
infrastructure is expensive and requires extensive administration.
3) The content
can be censored.
2.2 Proposed System:
We model such
a service on the premise of an unstructured P2P system, where each user stores
locally its own data and performs the search and retrieval functions.
An important
point in such Internet-scale applications is that the large-scale data transfer
and retrieval can be expensive when the network connections among the clients
are arbitrary, due to unpredictable communication latencies, excessive resource
consumption, and changing resource availability in inter domain routing. Thus,
we seek to optimize the overlay by establishing connections between peers based
on the criterion of network proximity. In particular, peers minimize the
network distance from their neighboring nodes by establishing connections to
nodes that belong to the same network.
Using a
topologically aware P2P system, besides that of overcoming the problems of
centralization, would also enable users to more easily retrieve local or
regional content.
Our project
provides an efficient content based search and retrieval that can be used in a
variety of contexts. Our project, is designed to make keyword search efficient
in unstructured P2P networks . The reason that we haven’t used structured
overlays is that the retrieval of information in them is a complex task.
Although
structured P2P networks have their own important advantages, unstructured P2P networks
impose very small demands on individual nodes and can easily accommodate nodes
of varying power. Thus they are compatible with our philosophy of minimizing
the requirements that the technique imposes on individual peers.
Here only the
autonomous operation of the peers is given more importance. Any global state or
structures that requires the active cooperation of the peers is minimized.
The objective
is to build overlays that can minimize the time and resource requirements for
search in unstructured P2P networks.
We consider
unstructured P2P networks because they offer a number of important advantages:
1)
Unstructured networks are appropriate for retrieval (for example, keyword
searches) as opposed to object identifiers utilized in structured overlays.
2) An
unstructured network imposes very small demands on individual nodes, as it
allows nodes to join or leave the network without significantly affecting the
system performance.
3) Finally,
unstructured networks can easily accommodate nodes of varying power.
Consequently, they scale into very large sizes, and they offer a more robust
performance in the presence of node failures and connection unreliability.
Merits of proposed system:
The proposed system is to overcome the problem of storing and retrieving
the data from centralized database, through the peer to peer architecture for
easy search and retrieval of data. It uses DDNO (Distributed Domain Name Order)
topology for getting information about the peers. Each user stores locally its
own data and performs the search and retrieval functions.
2.3 System Environment:
Front end
used:
Microsoft Visual Studio dot Net is
used as front end tool. The reason for selecting Visual Studio dot Net as front
end tool is as follows:
BCA MCA Bsc B tech CS information technology
final year project
Android SDK 1.5 or later
Eclipse Ganymede IDE
Operating System can be Windows XP, LINUX and Mac etc.
RAM : (min) 128
HARD DISK : 100 MB
No comments:
Post a Comment