A Nonhomogeneous Frame RMA Algorithm

We consider nonhomogeneous frame random multiple access algorithms. The algorithms are optimized by frame size, the number of tree branches, and the probability that a packet visits a given branch. Packet delays and the algorithm rates are calculated. The frame stack algorithm with a binary tree is shown to be optimal.