On Minimum Congestion Routing in Broadcast Optical Networks with Regular and Arbitrary Topologies (CROSBI ID 24208)
Prilog u knjizi | izvorni znanstveni rad
Podaci o odgovornosti
Skorin-Kapov, Jadranka ; Labourdette, Jean-Francois
engleski
On Minimum Congestion Routing in Broadcast Optical Networks with Regular and Arbitrary Topologies
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.
throughput and congestion minimization, multihop lightwave networks, tabu search, arbitrary and regular topology, Perfect Shuffle
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o prilogu
143-155-x.
objavljeno
Podaci o knjizi
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.
Providence (RI): American Mathematical Society (AMS)
1998.
0-8218-1004-9