McEliece, Robert J. and Sivarajan, Kumar N. (1992) Heavy traffic performance of a class of channel assignment algorithms. In: Third IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. IEEE , Piscataway, NJ, pp. 550-555. ISBN 0-7803-0841-7. https://resolver.caltech.edu/CaltechAUTHORS:20120329-101208582
![[img]](https://authors.library.caltech.edu/style/images/fileicons/application_pdf.png)
|
PDF
- Published Version
See Usage Policy. 537kB |
Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20120329-101208582
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.
| Item Type: | Book Section | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Related URLs: |
| |||||||||
| 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. | |||||||||
| Funders: |
| |||||||||
| Other Numbering System: |
| |||||||||
| DOI: | 10.1109/PIMRC.1992.279871 | |||||||||
| Record Number: | CaltechAUTHORS:20120329-101208582 | |||||||||
| Persistent URL: | https://resolver.caltech.edu/CaltechAUTHORS:20120329-101208582 | |||||||||
| Official Citation: | McEliece, R.J.; Sivarajan, K.N.; , "Heavy traffic performance of a class of channel assignment algorithms [cellular telephone systems]," Personal, Indoor and Mobile Radio Communications, 1992. Proceedings, PIMRC '92., Third IEEE International Symposium on , vol., no., pp.550-555, 19-21 Oct 1992 doi: 10.1109/PIMRC.1992.279871 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=279871&isnumber=6931 | |||||||||
| Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. | |||||||||
| ID Code: | 29899 | |||||||||
| Collection: | CaltechAUTHORS | |||||||||
| Deposited By: | Tony Diaz | |||||||||
| Deposited On: | 17 Apr 2012 20:54 | |||||||||
| Last Modified: | 09 Nov 2021 19:32 |
Repository Staff Only: item control page
