Distributed System Project Abstract

The aim of this Project is to assist students to create the distributed applications with the help of RMI – Java program. 

The Project deals with the management of the occasion cars at the Dealer showroom  by Client- Server application. The application must have option for the registration of the new cars and its sales receipt. This information or data is next transferred to the Server by implementing the Car and Receipt objects. The Server has to produce every new information into the text file or the database which is stored in the system, can be read. The information regarding the car is made for the Client to look car on the basis of its number. This request is then transferred to the Server which backs the information to the Client. 

The Server consists of the use of the Hahmap, Hashset, Vector, Hashtable class. 

The work to develop a program can be done by the Console but JFrame can also develop it.

 Download  Distributed System Project Abstract .

Distributed Cache Updated System for DSR

Project on Distributed Cache Updated System for DSR (Dynamic Source Routing Protocol) as a part of engineering final year project. In this, a user can easily understand the disconnection in the huge network.

Foreground Java & Background SQL Server Software technologies used to develop this final year major project.

This project mainly consists of four modules named request new route module, maintenance new route module, data transferring module and updating message cache module.

Before going to send message first we should provide destination node in the drop down list then after we can enter the message what we are going to send in the message text box, we have two options available to send the entered message one send button and second clear button, Here we should keep select Node active button before sending. 

In the message transformation box, we can see the message sender name, route path & finally the message what we send to the receiver.

Download Distributed Cache Updated System for DSR (Dynamic Source Routing Protocol)

Simulative CBT Examination With Random Paper Generation

Project Title:    Simulative CBT Examination With Random Paper Generation

The Simulative Computer-Based Testing (CBT) Examination With Random Paper Generation system provides a online testing platform to the users on which Exam questions are keyed into question bank, organize questions randomly and sequence manner, prepare question paper automatically, conduct online test, evaluate results and display score papers. It affords an online practicing platform for students where they can participate in simulative examination in which questions are randomized, provided a realistic examination environment for students. It appraises the candidate’s knowledge on the prepared stream for computerized e-examination.

The online practice test is being conducted based on candidate’s preference in different parameters such as question difficulty level like difficult mode, intermediate mode & easy mode, Subject topic and number of questions to be appeared. The portable document file could also be created with the candidate’s preferred parameters. After completion of their exam students can have an option to take a print and they can send these results to mail address. This Project was developed under Net beans IDE 5.0 Java Programming & MYSQL Database Server. This project can be worked under Linux Operating System & Windows operating System, Distribute Memory method and concurrent Access method used in this project.

Dynamic routing with security consideration Java Project

  • Project Title: Dynamic routing with security consideration Java Project.
  • ENVIRONMENT: Java, HTML, Java Script


The Purpose of this Dynamic routing with security consideration Java project is to propose a dynamic routing algorithm to improve the security of data transmission. We define the eavesdropping avoidance problem as follows: a source node, and a destination node, the problem is t minimizing the path similarity without introducing any extra control messages, and thus to reduce the probability of eavesdropping consecutive packets over a specific link. This final year Engineering project was developed in java.


  • Network Module
  • Dynamic Routing
  • Randomization Process
  • Routing Table Maintenance
  • Load on Throughput

Developer Responsibility: we are going to propose dynamic routing algorithm that could delivery paths for data transmission networks. We have taken this entire project into two those are Network module & Dynamic module.

In network module distributed application architecture that partitions tasks between server side and client side. In dynamic routing module we can propose a distance vector algorithm to improve the security of data transmission.

Adaptive Programming Model for Fault Tolerant Distributed Computing

Adaptive Programming Model For Fault Tolerant Distributed Computing projects main idea is to implement a error controlling method using fault tolerant distributed computing method. In distributed systems capability of adapting to run time conditions is one of the important factors for providing quality of service between processes. But maintaining error control in distributed systems is challenging task. In order to implement adaptive programming model which works on top layer with process state information as per the quality of service? The system we are working on is a hybrid model which has synchronous part and asynchronous part.

Existing System: 

  • Present system which is known as time free asynchronous distributed system which causes crashes in runtime processing.
  • This system designers can estimate process by considering upper bound on the number of processes that can crash and implement new design where we can control process crash.
  • In existing system there process crash information is not known to protocol.

Robust Spanning Tree Topology for Data Collection and Dissemination in Distributed Environment

Robust Spanning Tree Topology for Data Collection and Dissemination in Distributed Environment Project Document contains:
  1. Introduction of the project
  2. Project Literature Survey
  3. Analysis Phase and Design Phase
  4. Implementation & coding of the project
  5. Testing phase  and Debugging phase
  6. Conclusion of the project

Software requirements:

Operating System Used: Windows 2000 / XP, Linux Fedora Core 4.

Programming Languages/Software Used: Java Run time Environment, Java Development Kit 1.6.0

Robust Spanning Tree Topology for Data Collection and Dissemination in Distributed EnvironmentHardware requirements:

Architecture: Pentium-4 PC

Hard Disk: 20 GB hard-disk


Equipment: Keyboard, Mouse Not-Applicable

Download Robust Spanning Tree Topology for Data Collection and Dissemination in Distributed Environment Project

Distributed System on One Lane Bridge Project Idea

Distributed system on One Lane Bridge project idea is to provide solution for vehicles coming from different  direction to cross one lane bridge.

Develop a server process to manage use of the bridge. Assume the cars are client processes that can remotely get connect to the server at any time.

In your simulation program, have new cars join in the session remotely and each car repeatedly try to cross the bridge. They should spend a random amount of time on the bridge and should delay for a random amount of time before crossing again. Each car client can specify some parameters such as its speed, average delaying time after crossing, initial heading direction etc. Ideally, each client should get a graphical interface showing the current status on the bridge utilization.

Final Year Distributed System Project Idea on Stock Market Simulation Game

Implement a stock market simulation game for several human players and several computer players.You are to create a fast-paced on-line interactive game of stock market, which has many of the characteristics of electronic commerce. The entities in the game are a bank, a stock exchange, several companies and several players. The time between events has been significantly accelerated to make the game more challenging and interesting.

Bank: The one bank holds the cash of any player.
A player can request a new account, deposit and withdraw money from the account. The bank has a maximum of 10 accounts. Once every minute during the game, all money in an account accumulates 1% interest.

Company: A company has a name and issues stock. Once a minute, the company’s price of the stock is adjusted based on a random process and the law of supply and demand. Initially each company has 1000 shares of stock, which starts at $30 a share. There are several companies for example three to ten in the game. A company buys or sells shares to a player by accepting or rejecting the player’s bid. The process of deciding to accept or reject may be random or based on sound business practices.

Player: There can be two types of players – human and computer. A player starts with $1000 and buys and sells stock from companies or other players by trading through the stock exchange. The goal of a player is to make money. A player buys or sells shares from another player or a company by posting bids on the stock exchange. The company or the other player may accept or reject the player’s bid. The process of deciding how the computer-based player accepts or rejects may be random or based on sound business practices. There are two to ten players.

Stock Exchange: Players and companies must register with the stock exchange. All trading of stocks must go through the centralized stock exchange. The stock exchange posts current bids and the prices of recent transactions on each stock.

The winner is the player with the highest total value in cash and stock value after a certain period of time. Of course, a player can not buy shares of stock that don’t exist and he or she must have enough cash to purchase the desired shares. The bank, stock exchange, companies and computer players are trusted entities, i.e., they don’t cheat.

Final Year Distributed System Project Idea on Replicated File System

Replicated file Distributed system project idea explains a simple way to increase the likelihood that a critical data file is always accessible is to keep a back-up copy of the file on another disk, usually one that is attached to a different machine. The file system provides transparent replication. In particular, suppose there are n copies of a data file and n server modules. Each server provides access to one copy of the file. A client interacts with any one of the server modules. The servers interact with each other to present clients with the illusion that there is a single copy of the file. Each file exports four operations: open, close, read and write for client. The file servers interact with each other to ensure that copies of the file are kept consistent and that at most one client at a time is permitted to write into the file. Each file servers has a local lock manager process that implements a solution to the readers/writer problem. Some points to bear in mind.

a. Each fileserver exports two sets of operations: those called by its clients and those called by other file servers. Each server module keeps track of current access mode by using a lock manager. For example,the file is not written if it was opened for reading. Multiple readings however are allowed. If a certain operation needs to get permission from all lock managers, please acquire the locks in the same order for all clients. Otherwise, deadlock may occur.

b. Within write procedure, a module first update its local copy then concurrently updates every remote
copy. It is analogous to using a write-through cache update policy. An alternative approach would be to
update the remote copy when the file is closed.

Demo purpose: Store duplicated simple text files in several fileservers for demo purpose. Write operation
just simply appends more text to the file. Client gets connected to any fileserver in a graphical user interface.