This is a Java program that simulates the token-based access scheme in queing theory. The program outputs a details time table as well as a real time animation.
- Simulation duration: the total duration that the simulation will cover
- Number of queues
- Initial token holder: which queue initially holds the token
- Initial arrival clock values: Specify when the first packet will arrive at each queue, can be set to a specific time or random.
- Enable packet priority: Enables 2 type of packets, high priority and low priority packets
- Simple time: if checked the inter arrival time and the transmition time are fixed, other wise they follow an exponential distribution.
- Inter arrival time: the time between packets if Simple time is checked, otherwise the mean.
- Time before timeout: Token time out.
- Switch over time: how long it takes to pass the token from one queue to another
- Transmit time: used when Simple time is used
- Short/Long transmit time: When Simple time is not checked, 80% of the time the packets will take a short time to transmit and 20% of the time they will take a long time. The short and long times are exponentially distributed and these 2 parameters control their mean.
