Pretražite po imenu i prezimenu autora, mentora, urednika, prevoditelja

Napredna pretraga

Pregled bibliografske jedinice broj: 730405

Optimizing Maximum Shared Risk Link Group Disjoint Path Algorithm using NVIDIA CUDA Heterogeneous Parallel Programming Platform


Miletić, Vedran; Šubić, Tomislav; Mikac, Branko
Optimizing Maximum Shared Risk Link Group Disjoint Path Algorithm using NVIDIA CUDA Heterogeneous Parallel Programming Platform // Proceedings on the 2014 X International Symposium on Telecommunications (BIHTEL) / Mrdovic, Sasa (ur.).
Sarajevo, Bosna i Hercegovina, 2014. str. 1-6 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)


CROSBI ID: 730405 Za ispravke kontaktirajte CROSBI podršku putem web obrasca

Naslov
Optimizing Maximum Shared Risk Link Group Disjoint Path Algorithm using NVIDIA CUDA Heterogeneous Parallel Programming Platform

Autori
Miletić, Vedran ; Šubić, Tomislav ; Mikac, Branko

Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni

Izvornik
Proceedings on the 2014 X International Symposium on Telecommunications (BIHTEL) / Mrdovic, Sasa - Sarajevo, Bosna i Hercegovina, 2014, 1-6

Skup
2014 X International Symposium on Telecommunications (BIHTEL)

Mjesto i datum
Sarajevo, Bosna i Hercegovina, 27-29.10.2014

Vrsta sudjelovanja
Predavanje

Vrsta recenzije
Međunarodna recenzija

Ključne riječi
optical networks; reliability; shared risk link group; modelling; simulation; ns-3; maximum SRLG-disjoint path algorithm; algorithm optimization; heterogeneous paralell programming; NVIDIA CUDA

Sažetak
Network availability is an essential feature of an optical telecommunication network. Should a failure of a network component occur, be it a link or a component inside a node, network control plane must be able to detect the failure and reroute the traffic using spare components until a repair is done. Shared risk link groups (SRLGs) are used to describe a situation where seemingly unrelated logical failures happen due to a single physical failure. For example, two or more links might share a bridge crossing ; should a failure happen, all of them will be damaged. Routing algorithms were proposed to ensure working and spare paths of a connection in a network are SRLG-disjoint to avoid such common cause failures. However, complete SRLG-disjointness of working and spare path is not always possible due to limited number of links or limited capacity available in the network, so maximum SRLG-disjoint paths algorithm is taken instead. Maximum SRLG-disjoint path problem is in general NP-hard. In terms of solution quality greedy algorithms for maximum SRLG-disjoint path problem are as good as more complicated heuristics. To improve the performance of maximum SRLG-disjoint path greedy algorithm, it was implemented using NVIDIA CUDA heterogeneous parallel programming platform and executed on graphics processing unit. The implementation of maximum SRLG-disjoint path algorithm on GPU increases performance significantly compared to implementation utilizing only CPU, especially in simulations of large networks.

Izvorni jezik
Engleski

Znanstvena područja
Elektrotehnika, Računarstvo



POVEZANOST RADA


Projekti:
036-0362027-1640 - UPRAVLJANJE MREŽOM I USLUGAMA TEMELJENO NA ZNANJU (Jevtić, Dragan, MZOS ) ( POIROT)

Ustanove:
Fakultet elektrotehnike i računarstva, Zagreb,
Sveučilište u Rijeci - Odjel za informatiku

Profili:

Avatar Url Vedran Miletić (autor)

Avatar Url Branko Mikac (autor)

Citiraj ovu publikaciju

Miletić, Vedran; Šubić, Tomislav; Mikac, Branko
Optimizing Maximum Shared Risk Link Group Disjoint Path Algorithm using NVIDIA CUDA Heterogeneous Parallel Programming Platform // Proceedings on the 2014 X International Symposium on Telecommunications (BIHTEL) / Mrdovic, Sasa (ur.).
Sarajevo, Bosna i Hercegovina, 2014. str. 1-6 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
Miletić, V., Šubić, T. & Mikac, B. (2014) Optimizing Maximum Shared Risk Link Group Disjoint Path Algorithm using NVIDIA CUDA Heterogeneous Parallel Programming Platform. U: Mrdovic, S. (ur.)Proceedings on the 2014 X International Symposium on Telecommunications (BIHTEL).
@article{article, editor = {Mrdovic, S.}, year = {2014}, pages = {1-6}, keywords = {optical networks, reliability, shared risk link group, modelling, simulation, ns-3, maximum SRLG-disjoint path algorithm, algorithm optimization, heterogeneous paralell programming, NVIDIA CUDA}, title = {Optimizing Maximum Shared Risk Link Group Disjoint Path Algorithm using NVIDIA CUDA Heterogeneous Parallel Programming Platform}, keyword = {optical networks, reliability, shared risk link group, modelling, simulation, ns-3, maximum SRLG-disjoint path algorithm, algorithm optimization, heterogeneous paralell programming, NVIDIA CUDA}, publisherplace = {Sarajevo, Bosna i Hercegovina} }
@article{article, editor = {Mrdovic, S.}, year = {2014}, pages = {1-6}, keywords = {optical networks, reliability, shared risk link group, modelling, simulation, ns-3, maximum SRLG-disjoint path algorithm, algorithm optimization, heterogeneous paralell programming, NVIDIA CUDA}, title = {Optimizing Maximum Shared Risk Link Group Disjoint Path Algorithm using NVIDIA CUDA Heterogeneous Parallel Programming Platform}, keyword = {optical networks, reliability, shared risk link group, modelling, simulation, ns-3, maximum SRLG-disjoint path algorithm, algorithm optimization, heterogeneous paralell programming, NVIDIA CUDA}, publisherplace = {Sarajevo, Bosna i Hercegovina} }




Contrast
Increase Font
Decrease Font
Dyslexic Font