https://github.com/duzun/netsim
Broad-cast Network Simulation in Delphi
https://github.com/duzun/netsim
Last synced: 6 months ago
JSON representation
Broad-cast Network Simulation in Delphi
- Host: GitHub
- URL: https://github.com/duzun/netsim
- Owner: duzun
- License: mit
- Created: 2016-08-11T21:11:52.000Z (about 9 years ago)
- Default Branch: master
- Last Pushed: 2020-08-02T17:23:04.000Z (about 5 years ago)
- Last Synced: 2025-03-30T11:34:30.470Z (6 months ago)
- Language: Pascal
- Size: 742 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# NetSim
Broad-cast Network Simulation in Delphi
This project has been created as an experiment of simulating network communication with broad-cast.
A communication chanel is a file, to which all client write and read.
There is always a moderator on the chanel.
## ABSTRACT
### ASPECTS IN MODELLING COMPUTER COMMUNICATION PROTOCOLS
When the first computer networks were compiled, attention was paid primarily to hardware, but the software part had been left for future.
Such a strategy does not work any more. Time and experience have proven that the efficiency of data transportation depends at first up on the algorithms (protocols) being used. Either the data is being transported through wires or wireless, at either 1000km or 10m, even if in the communication process take part only two machines or more of them, for each of the situations there can be achieved more algorithms that would accomplish the task, but the problem is to find the best one.
Therefore, for each certain real life situation encountered so far there exist specific protocols that are best given to it.
Given the general features, there are two types of technologies for data transmission:
— broadcast networks
— point-to-point networks
The main problems with broadcast networks are solving the conflict for "conquering" the channel and efficient use of time.
Point-to-point networks are based on algorithms for finding the shortest path from transmitter to the recipient.