On modeling local area networks
The study of network throughput and utilization requires the modeling of packets being transmitted along the media. Modeling such a system can be quite logically demanding, especially that packets can move along the media in opposite directions at almost the speed of light; and when collisions are a...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | The study of network throughput and utilization requires the modeling of packets being transmitted along the media. Modeling such a system can be quite logically demanding, especially that packets can move along the media in opposite directions at almost the speed of light; and when collisions are allowed, a packet may collide with another that is beyond its control.
Two modeling approaches are presented in this paper. One results in programs that closely follow the behavior of the physical system, yet require significant CPU time to execute. The second approach results in programs that may seem to be 'unnatural', yet more time-efficient.
Examples on token-ring and CSMA/CD networks are given in pseudo codes, followed by comparison of run times. |
---|---|
DOI: | 10.1145/318123.318333 |