| Texto completo | |
| Autor(es): |
Waldman, Helio
;
Almeida, Raul C., Jr.
;
Bortoletto, Rodrigo C.
;
Gutierrez, CA
Número total de Autores: 4
|
| Tipo de documento: | Artigo Científico |
| Fonte: | 2019 IEEE LATIN-AMERICAN CONFERENCE ON COMMUNICATIONS (IEEE LATINCOM); v. N/A, p. 6-pg., 2019-01-01. |
| Resumo | |
The paper addresses the problem of minimizing total slot idle time in assigning spectrum to an incremental 2-class traffic. Deadlock avoidance is first shown to be possible in many instances from knowledge of the connection sizes, thus keeping total idleness finite. Then, minimization of the finite residual idleness is shown to be possible with appropriate traffic-aware assignment policies. (AU) | |
| Processo FAPESP: | 15/24341-7 - Novas estratégias para enfrentar a ameaça de exaustão da capacidade |
| Beneficiário: | Helio Waldman |
| Modalidade de apoio: | Auxílio à Pesquisa - Temático |