Category: Networking Projects

Techniques for computing shortest path between nodes project explains about two new techniques for fast computation of constrained network. This project report covers introduction to new methodology, Details on existing system, proposed system details and hardware and software requirements.

Calculating shortest distance in Network is one of the important network functions for QoS routing, MLPS Path selection, ATM networking and traffic networking engineering. In voice and video calling finding cheapest path is not an easy task. In order to find solution for this problem many researches and algorithms are designed. This project proposes two techniques which will reduce decentralization errors and provide shortest routing distance by developing faster algorithms. Providing shortest path is the important factor for successful design in QOS system. Simulator is used to test new techniques which show execution time efficiency in new system.

In Existing system Dijikstra algorithms are used for calculating shortest path. RTF and RTC are used to reduce discretization errors along traveling path. In this system finding shortest path from single source node to multiple destination nodes is not possible.

In Proposed system shortest path is accurately calculated using domain packet filter. Two techniques are used to reduce discretization errors. Algorithms used in this system are faster compared to existing system algorithms.

download Techniques for Computing Shortest Path Between Nodes Report.

Spam E-Mail Filtering Java Project explains about developing anti spam application by using ALPACAS frame work, preserving message transformation process and privacy protecting protocol.

This project report covers overview on project, problems in existing system, proposed system features and hardware and software requirement.

Google, Yahoo and many other mailing systems are facing problems with spam emails. This project provides a research paper for developing a anti spam architecture.

E-mail spam problem is a serious problem because users, government and private organizations share security information through mails.

More details on techniques used in web spam, e-mail spam by spammers are explained in web spam seminar.

In order to develop email spam filtering application developers should look after three scenarios. Firstly developers should provide accurate privacy protection policies to participating entities. Secondly developing techniques should be hidden to public market.

Thirdly application should be light weight, less cost, and scalable. Considering above three factors privacy aware frame work is used to filter spam e-mails.

Existing system uses DCC spam filters which are not efficient and accurate to solve the problem. Proposed system uses DHT paradigm and ALPACAS techniques to develop anti spam application.

Java, swing is used as front end and MS Access is used as back end for developing this application.

download Spam E-Mail Filtering A Java Project Report.

 Process Analysis in asynchronous system explains about a new method for handling process threads and message transmitting between processes in synchronous manner. This paper covers existing system details, Disadvantages of existing system, proposed system, advantages of proposed system, hardware and software requirements.

Inside every system different processes share information by exchanging messages between them as every process threads run with different speeds and there is no exact time span for message transfer between them. In existing system locks are used in processes for controlling timing between them but it is not maintained with message transfer , synchronization is not maintained between process speed and message transfer.

In existing system there is no chance of detecting single process failure and there is no definite method to look at every single process individually. In this system finding out crashed processes is calculated by subtracting total processes by running process.

Proposed system will overcome these problems by using time lapse method. In this system local clock will look after each processes status whether it is sending messages are not if any processes is not sending message in specified time it is considered as a crashed.

download Process Analysis in Asynchronous System A Java Project Report.

Object sharing with multi proxies for edge service java project explains about implementing multiple proxies in internet network for allowing clients to access mutable objects, this process of using proxies is called Quiver. This paper covers introduction to quiver, existing system details, proposed system functionality and hardware and software requirements.

Proxies are interconnected to each other by sharing objects information between them and perform operations on objects. By using this method performance can be increased mainly when operations are performed on objects from different locations, Process of using different proxies is called as migration. Objects sharing between these proxies will reduce work load on servers and there is no chances of server break downs.  Based on FIFO method work load is handled by servers. Object sharing is maintained consistently using two techniques serializability and strict serializability. Using Load sharing technique proxies will share object information.

In existing system proxies are connected to centralized server where for any objects updating proxies need to connect with server. Shared objects will be missed when proxy is down. Single object operations are only option in this system.

In present system proxies are implemented in tree model and objects are shared between proxies. There are no chances of server down problem, if one proxy is down other proxy will handle objects.

download Object Sharing with Multi Proxies for Edge Service Java Project Report.

Life Span based organization protocol for p2p systems project explains about implementing new protocol for designing less structured p2p system. This project report covers introduction to life span protocol, existing system details, and disadvantages of existing system, proposed system details and hardware and software requirements.

 In present network Peer to Peer communication is unstructured and loosely constructed because of its high transit traffic. In order to solve this problem query related strategies and life span organized protocol is implemented by taking peers session time, performance characteristics in to consideration. Firstly this paper demonstrates about benefits of life span organization in terms of end-application performance and its usage in Internet network. This can be explained by using query related strategies, and methods used for query distribution, caching and replication.

Life span based query related functions ore implemented on life span organized protocol and its performance is tested using trace drive simulator.

In existing system due to lack of query distribution, replication and caching there are chances of scalability problem. Collision is the basic problem in existing system.

download Life Span Based Organization Protocol for P2P Systems Report.

Latency reduction in cell switching network java project explains about a speculative transmission methodology in centrally scheduled cell switch to increase performance in computing applications. This project covers details introduction to speculative transmission system, existing system drawbacks, proposed system details and hardware and software details.

In centrally switched cell switch network there is delay in between request and arrival of packet in network which is called control path latency. Centralized scheduling switching network consists of two components control path latency and data path latency for maintaining minimum latency. Speculative transmission system reduces average latency by reducing waiting time for transmission in certain conditions. Any algorithm can be easily incorporated with this system to provide reliable delivery mechanism. Using this module mean delay and speculative transmission can be derived and control path latency can be increased up to 50%.

Existing system uses Brikoff-von-newmann switching technology which follows N time time slot which takes lot of time for new packet transmission. Serialization and de serialization techniques causes propagation delay.

Proposed system will solve existing system issues. This applications front end part is implemented in java platform and SQL Server is used for back end.

download Latency Reduction in Cell switching Network A Java project Report.

Data Recovery Using Trap Architecture project explains about a new methodology for recovering data any point of time with 100% accuracy. This project covers details of TRAP system, existing system, proposed system and hardware and software requirements.

Data loss problems mainly occur when disk is affected with power problem, virus attack or software defects. Using TRAP architecture it will be easy to retrieve lost data even disk is effected with above mentioned problems. Time recovery at any point of time is called as TRAP. In this system data is spitted in to small blocks and stores data in different parts of drives in the form of arrays. TRAP uses time sequence and XROS history to recovery damaged data at any point of time.

In existing system it is not possible to recover damaged data from one or two disks. Even if data is recovered 50 to 70% data is lost. Data recovery is not fast.

For implementing this project java is used as front end and sql server is used as back end.

download Data Recovery Using Trap Architecture a Java Project.

Consensus protocol Concept for ad-hoc network technical paper explains about developing a new protocol in ad-hoc network for increasing message transferring scalability and reducing messaging cost and time cost for mobile users. In this paper it covers detail introduction to new methodology and how existing system works and improvements in proposed system, hardware and software requirements.

Consensus protocol architecture is a two layer hierarchy integrated on network. In this system mobile hosts are divided in to clusters or cells and each host holds cluster header. Whenever mobile user sends message cluster header is contrasted and cluster head is unmerged when packet is received. In order to maintain two layers hierarchy eventual clusterer is developed in c language.

In existing system rotating coordinator method with asynchronous data transmition is used which is not efficient. There are chances of message loss while sending large sized data in the network. In proposed system eventual clusterer is implemented in mobile hosts which will control messaging cost.

download Consensus Protocol Concept for AD-HOC Networks Abstract.