Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published October 1992 | Published
Book Section - Chapter Open

Heavy traffic performance of a class of channel assignment algorithms

Abstract

The authors present a study of the performance of a general class of channel assignment algorithms. These algorithms, which they call Ω-algorithms, are completely characterized by the set of carried-traffic "states" which they allow. They show that for any such algorithm, there is a closed-form expression for the carried traffic function, which lends itself to several kinds of asymptotic analysis. As an application, they study a particular Ω-algorithm, which has been previously studied under the name "maximum packing algorithm", and which is a "greedy" dynamic channel assignment algorithm, and show that its performance is in many cases inferior to that of simple fixed channel assignment algorithms. They show that the cause of this unexpected phenomenon is the tendency of dynamic algorithms to get trapped in states that are locally, but not globally, maximal.

Additional Information

© 1992 IEEE. Date of Current Version: 06 August 2002. A summary of a portion of this paper was published in the Proceedings of the 1991 IEEE Symposium on Information Theory, Budapest, Hungary under the title, "Asymptotic Performance of Fixed and Dynamic Channel Assignment in Cellular Radio." McEliece's contribution to this paper, and Sivarajan's contribution while he was a doctoral student at Caltech, were supported by a grant from GTE Laboratories. McEliece's contribution was also supported by AFOSR grant 91-0037, and a grant from Pacific Bell.

Attached Files

Published - MCEpimrc92.pdf

Files

MCEpimrc92.pdf
Files (537.8 kB)
Name Size Download all
md5:be9d4ec72f3fc54f8cc9f644a621ba27
537.8 kB Preview Download

Additional details

Created:
August 20, 2023
Modified:
October 24, 2023