Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 1

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  anycast traffic
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
Driven by increasing user requirements and expectations, the fast development of telecommunications networks brings new challenging optimization problems. One of them is routing and spectrum allocation (RSA) of three types of network flows (unicast, anycast, multicast) in elastic optical networks (EONs) implementing dedicated path protection (DPP). In the paper, we model this problem as integer linear programming (ILP) and we introduce two new optimization approaches—a dedicated heuristic algorithm and a column generation (CG)-based method. Then, relying on extensive simulations, we compare algorithm performance with reference methods and evaluate CG efficiency in detail. The results show that the proposed CG method significantly outperforms reference algorithms and achieves results very close to optimal ones (the average distance to optimal results was at most 2.1%).
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.