Modeling and Analysis of Computer Communications Networks
Modeling and Analysis of Computer Communications Networks
| Hi-index | 0.00 |
In a binary tree type local area network (LAN) protocol, the number of probe slots (K) needed for contention resolution, when M out of N terminals are contending for the bus access depends not only on the value of M but also on the pattern of the active terminals, i.e., where the physical addresses of the active terminals are located in the logical binary tree structure. The value of M depends on the traffic intensity and increases with the packet arrival rate.In this paper, we develop simple mathematical models for the upper and lower bounds on K as a function of M, with N as a parameter taking into account the above active terminal patterns. The models developed are useful in determining the maximum and minimum transmission frame durations for the performance evaluation of binary type LAN protocols and other reservation type LAN protocols which employ binary tree type probing algorithm. In the case of integrated traffic, when frame duration is to be fixed, the model will enable to optimize bandwidth allocation to different types of traffic.