Napredna pretraga

Pregled bibliografske jedinice broj: 17891

On Minimum Congestion Routing in Broadcast Optical Networks with Regular and Arbitrary Topologies


Skorin-Kapov, Jadranka; Labourdette, Jean-Francois
On Minimum Congestion Routing in Broadcast Optical Networks with Regular and Arbitrary Topologies // Multichannel Optical Networks: Theory and Practice: DIMACS Workshop, March 16-19,1998 (DIMACS Series in Discrete Mathematics and Theoretical Computer Science; Volume 46) / Wan, Peng-Jun ; Du, Ding-Zhu ; Pardalos, Panos, M. (ur.).
Providence, RI: American Mathematical Society, 1998. str. 143-155


Naslov
On Minimum Congestion Routing in Broadcast Optical Networks with Regular and Arbitrary Topologies

Autori
Skorin-Kapov, Jadranka ; Labourdette, Jean-Francois

Vrsta, podvrsta i kategorija rada
Poglavlja u knjigama, znanstveni

Knjiga
Multichannel Optical Networks: Theory and Practice: DIMACS Workshop, March 16-19,1998 (DIMACS Series in Discrete Mathematics and Theoretical Computer Science; Volume 46)

Urednik/ci
Wan, Peng-Jun ; Du, Ding-Zhu ; Pardalos, Panos, M.

Izdavač
American Mathematical Society

Grad
Providence, RI

Godina
1998

Raspon stranica
143-155

ISBN
0-8218-1004-9

Ključne riječi
Throughput and congestion minimization, multihop lightwave networks, tabu search, arbitrary and regular topology, Perfect Shuffle

Sažetak
We survey some recent results regarding throughput optimization in logically rearrangable multihop lightwave networks. Two cases are distinguished: networks having arbitrary as well as regular connectivity topology. In both cases we present formulation of the combined station assignment/flow routing problem with the congestion minimization objective. We then outline a heuristic solution strategy based on tabu search. In terms of small congestion (as obtained heuristically), the results suggest that with increased problem sizes, regular topologies become more attractive. In such cases the benefit of having less restricted arbitrary network topology might not be fully utilized. We present some results with a combined approach whereby initial assignments to network stations are restricted to a Perfect Shuffle connectivity pattern and obtained by solving a quadratic assignment problem. (In an earlier study, Perfect Shuffle proved to be the most promising among different regular topologies.) Computational results confirmed the possible merit of this approach.

Izvorni jezik
Engleski

Znanstvena područja
Računarstvo



POVEZANOST RADA


Ustanove
Fakultet elektrotehnike i računarstva, Zagreb