Temat: network survivability - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Network Topology Effect on QoS Delivering in Survivable DWDM Optical Networks
Autorzy:: Kavian, Y.
Rashvand, H.
Leeson, M.
Ren, W.
Hines, E.
Naderi, M.
Powiązania:: https://bibliotekanauki.pl/articles/308960.pdf
Data publikacji:: 2009
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: dedicated path protection
DWDM
network topology
optical networks
QoS
survivability
Opis:: The quality of service (QoS) is an important and considerable issue in designing survivable dense wavelength division multiplexing (DWDM) backbones for IP networks. This paper investigates the effect of network topology on QoS delivering in survivable DWDM optical transport networks using bandwidth/load ratio and design flexibility metrics. The dedicated path protection architecture is employed to establish diverse working and spare lightpaths between each node pair in demand matrix for covering a single link failure model. The simulation results, obtained for the Pan-European and ARPA2 test bench networks, demonstrate that the network topology has a great influence on QoS delivering by network at optical layer for different applications. The Pan-European network, a more connected network, displays better performance than ARPA2 network for both bandwidth/load ratio and design flexibility metrics.
Źródło:: Journal of Telecommunications and Information Technology; 2009, 1; 68-71
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: Tabu Search Algorithm for Survivable Network Design Problem with Simultaneous Unicast and Anycast Flows
Autorzy:: Gładysz, J.
Walkowiak, K.
Powiązania:: https://bibliotekanauki.pl/articles/226174.pdf
Data publikacji:: 2010
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: anycast
network design
tabu search
survivability
Opis:: In this work we focus on the problem of survivable network design for simultaneous unicast and anycast flows. This problem follows from the growing popularity of network services applying the anycast paradigm. The anycasting is defined as one-to-one-of-many transmission and is applied in Domain Name Service (DNS), peer-to-peer (P2P) systems, Content Delivery Networks (CDN). In this work we formulate two models that enables joint optimization of network capacity, working and backup connections for both unicast and anycast flows. The goal is to minimize the network cost required to protect the network against failures using the single backup path approach. In the first model we consider modular link cost, in the second we are given a set of link proposal and we must select only one of them. Because these problems are NP-hard, therefore optimal solutions of branch-and-bounds or branch-and-cut methods can be generated for relatively small networks. Consequently, we propose a new heuristic algorithm based on Tabu Search method. We present results showing the effectiveness the proposed heuristic compared against optimal results. Moreover, we report results showing that the use of anycast paradigm can reduce the network cost.
Źródło:: International Journal of Electronics and Telecommunications; 2010, 56, 1; 41-47
2300-1933
Pojawia się w:: International Journal of Electronics and Telecommunications
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 3.

Tytuł:: Guaranteed Protection in Survivable WDM Mesh Networks - New ILP Formulations for Link Protection and Path Protection
Autorzy:: Mohapatra, B.
Nagaria, R. K.
Tiwari, S.
Powiązania:: https://bibliotekanauki.pl/articles/308390.pdf
Data publikacji:: 2011
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: Lightpath
protection
RWA
survivability
WDM network
Opis:: In this paper we propose new simple integer linear programs (ILPs) formulations for minimizing capacity (in wavelength link) utilization in survivable WDM network. The study examines the performance of shared based protection schemes, such as path protection scheme and link protection scheme under single fiber failure. The numerical results obtained show a reduction in capacity utilization using random traffic compared to the reported ILP formulation. We also present the results using Poisson's traffic to identify the frequently used links for the widely used NSF network. The proposed work not only reduces the wavelength consumption in different traffic scenarios but also efficient in terms of simulation time.
Źródło:: Journal of Telecommunications and Information Technology; 2011, 4; 108-114
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 4.

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ł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "network survivability" wg kryterium: Temat

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język