JOHN I. CAPETANAKIS
This paper introduces the concept of tree algorithms. The address space is divided in two halves. In two successive slots, the one is devoted to the first halve and the second to the second halve. If there is a collision, the address spaces is subsequently divided in two. Again the stations belonging to the first part transmit in the first slot while the stations included in the second part transmit in the second slot. This algorithm is repeated until all the stations have transmittet their packets.
Even though the proposal is theoretically sound and leads to throughput of 0.3-0.4 packets per slot, it probably present practical disadvantages. It was proposed in 1979 and we have not seen any implementation yet.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment