Mathar, R.Pawlikowski, K.2009-10-192009-10-191995Mathar, R., Pawlikowski, K. (1995) A Random Access Protocol for Unidirectional Bus Networks..http://hdl.handle.net/10092/3001TR-COSC 06/95A random access protocol for packet-switched, multiple access communication via time slotted busses is investigated. Assuming heavy traffic for all stations, the access probabilities are determined as to allocate a certain portion of the channel capacity to individual stations for achieving prescribed service requirements. In the infinite buffer case with Poisson arrivals the probability generating function of the queue length, and its expectation and variance are determined for a single station. We furthermore calculate the expected delay time of the last arriving packet in a slot, as well as the corresponding variance. Based on these formulas a system of N coupled stations is investigated w.r.t. packet delay and fairness. It turns out that if the bus is able to carry all offered load, then protection of fairness means only deterioration of oneself's performance without improving corresponding parameters for other stations.enReportsFields of Research::230000 Mathematical Sciences::230200 Statistics::230201 Probability theoryFields of Research::280000 Information, Computing and Communication Sciences::280400 Computation Theory and Mathematics::280499 Computation theory and mathematics not elsewhere classifiedFields of Research::290000 Engineering and Technology::291700 Communications Technologies::291704 Computer communications networks