Jonathan Ashley, Brian Marcus, et al.
Ergodic Theory and Dynamical Systems
We consider an infinite tandem network in which every node is capable of hearing its neighbors up to a given distance n. At any moment of time every node may contain in the top of its queue a message destined to one of its neighbors. This network can be used as a model for a microwave or optic link with many users. For small and large n we investigate the maximal selection of nodes in the network, for which their transmissions are collision-free. For a large hearing range we show that the upper bound on the maximal selection, which is found herein, is asymptotically achievable. For small hearing ranges we show that a greedy selection is better but not asymptotically optimal. We also specify a sequence of upper bounds which converge to the maximal throughput. © 1989 Springer-Verlag New York Inc.
Jonathan Ashley, Brian Marcus, et al.
Ergodic Theory and Dynamical Systems
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
George Markowsky
J. Math. Anal. Appl.
M. Shub, B. Weiss
Ergodic Theory and Dynamical Systems