Skip to main content
Download PDF
- Main
TTL implementation of a CAMB tree network switch
Abstract
Packet collisions and their resolution create a performance bottleneck in random-access LANs. A hardware solution to this problem is to use a collision avoidance switch. These switches allow the implementation of random access protocols without the penalty of collisions among packets. An architecture based on collision avoidance is the CAMB (Collision Avoidance Multiple Broadcast) Tree network, where concurrent broadcasts are possible.
The purpose of this paper is to present two implementations for a CAMB Tree switch. First, a general outline of the CAMB switch is provided. Then, a description of the two implementations is given.