Bounds on the Capacity of FCFS Multiple-Access Algorithms

A class of FCFS (first-come-first-served) multiple-access algorithms is considered. Several subclasses are identified and the capacity of the corresponding algorithms is estimated. A conjecture concerning the capacity of the entire class of FCFS algorithms is advanced.