Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "elastic optical network" wg kryterium: Temat


Wyświetlanie 1-3 z 3
Tytuł:
A column generation technique for routing and spectrum allocation in cloud-ready survivable elastic optical networks
Autorzy:
Goścień, R.
Walkowiak, K.
Powiązania:
https://bibliotekanauki.pl/articles/330528.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
elastic optical network
anycast traffic
multicast traffic
network survivability
column generation technique
elastyczna sieć optyczna
sieć przełącznikowa
przeżywalność sieci
Opis:
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%).
Źródło:
International Journal of Applied Mathematics and Computer Science; 2017, 27, 3; 591-603
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Heuristic algorithms for joint optimization of unicast and anycast traffic in elastic optical network-based large-scale computing systems
Autorzy:
Markowski, M.
Powiązania:
https://bibliotekanauki.pl/articles/330713.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
elastic optical network
joint optimization
distributed data center
metaheuristic algorithm
tabu search
elastyczna sieć optyczna
optymalizacja wspólna
baza danych rozproszona
algorytm heurystyczny
metoda tabu search
Opis:
In recent years elastic optical networks have been perceived as a prospective choice for future optical networks due to better adjustment and utilization of optical resources than is the case with traditional wavelength division multiplexing networks. In the paper we investigate the elastic architecture as the communication network for distributed data centers. We address the problems of optimization of routing and spectrum assignment for large-scale computing systems based on an elastic optical architecture; particularly, we concentrate on anycast user to data center traffic optimization. We assume that computational resources of data centers are limited. For this offline problems we formulate the integer linear programming model and propose a few heuristics, including a meta-heuristic algorithm based on a tabu search method. We report computational results, presenting the quality of approximate solutions and efficiency of the proposed heuristics, and we also analyze and compare some data center allocation scenarios.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2017, 27, 3; 605-622
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Combinatorial Properties and Defragmentation Algorithms in WSW1 Switching Fabrics
Autorzy:
Rajewski, Remigiusz
Kabaciński, Wojciech
Al-Tameemi, Atyaf
Powiązania:
https://bibliotekanauki.pl/articles/227184.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
elastic optical network
switching networks
rearrenging algorithm
defragmentation algorithm
Opis:
A spectrum defragmentation problem in elastic optical networks was considered under the assumption that all connections can be realized in switching nodes. But this assumption is true only when the switching fabric has appropriate combinatorial properties. In this paper, we consider a defragmentation problem in one architecture of wavelength-space-wavelength switching fabrics. First, we discuss the requirements for this switching fabric, below which defragmentation does not always end with success. Then, we propose defragmentation algorithms and evaluate them by simulation. The results show that proposed algorithms can increase the number of connections realized in the switching fabric and reduce the loss probability.
Źródło:
International Journal of Electronics and Telecommunications; 2020, 66, 1; 99-105
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-3 z 3

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies