| Texto completo | |
| Autor(es): |
Waldman, H.
;
Bortoletto, R. C.
;
de Souza, V. F.
;
Almeida, R. C. A., Jr.
Número total de Autores: 4
|
| Tipo de documento: | Artigo Científico |
| Fonte: | 2023 23RD INTERNATIONAL CONFERENCE ON TRANSPARENT OPTICAL NETWORKS, ICTON; v. N/A, p. 4-pg., 2023-01-01. |
| Resumo | |
This paper presents an analytical derivation of an optimal spectrum assignment algorithm that minimizes spectral resource idleness in a single elastic link. The algorithm is aware of the requestable connection sizes and rates thereof. This awareness enables the calculation, for each possible void size and assignment policy, of the expected idle slot-time integral until the void is either fully occupied or coalesced into a new void by the termination of a neighboring connection. Idleness minimization may then be obtained by comparison among all possible on-arrival assignment policies when starting at each possible void size and choosing among all available voids the one that yields maximal reward in terms of reduction of the expected idleness, assuming the new connection is placed next to one of its edges. Since the number of policies grows exponentially with the number of requestable connection sizes, a scalability issue is identified. (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 |
| Processo FAPESP: | 22/07488-8 - Aplicações de machine learning para redes ópticas avançadas |
| Beneficiário: | Darli Augusto de Arruda Mello |
| Modalidade de apoio: | Auxílio à Pesquisa - Regular |