Name
Abstract | ||
|---|---|---|
Classic Markovian models for CSMA/CD LANs are modified to handle a finite number of stations with dissimilar arrival rates among the stations. Simple rules are derived for overload detection and protection of a CSMA/CD LAN. It is demonstrated that a station can correctly determine the total network load and decide whether the medium is currently overloaded or not. A fair share algorithm is suggested for every station in a CSMA/CD LAN to protect the medium from being overloaded. With proper overload protection, it is shown that the expected penalty due to collisions for each successful transmission is geometrically distributed. In conclusion, this analysis shows that the performance of CSMA/CD LANs is significantly better than predicted by simpler models and it can be improved by a simple modification to the standard CSMA/CD protocol. |
Year | DOI | Venue |
|---|---|---|
1986 | 10.1016/0169-7552(86)90011-5 | Computer Networks |
Keywords | Field | DocType |
overload detection,cd lans | Markov process,Data transmission,Computer science,Computer network,Carrier-sense multiple access,Local area network,CD protocol | Journal |
Volume | Issue | ISSN |
11 | 2 | 0169-7552 |
Citations | PageRank | References |
1 | 0.39 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| P T R Wang | 1 | 1 | 0.39 |
| M F McGurrin | 2 | 1 | 0.39 |