Cite This        Tampung        Export Record
Judul A Load Concentration Avoidance Algorithm for the Shortest Network Path Problem
Pengarang Fuad Fadhil Azzar
Armin Lawi
Masato Tsuru
EDISI Journal
Penerbitan Universitas Hasanuddin : Fak. Mipa, 2018
Deskripsi Fisik 5 hlm.
Subjek network
routing
shortest path
best path
floydwarshall
Abstrak The shortest path search is one of the most fundamental problems in network optimization and it is still being studied for various applications. The shortest path algorithm that is mostly used by network devices to transfer data packets is the Floyd-Warshall algorithm. This algorithm can find the shortest path by considering the weight of each link, however, the generated shortest path does not guarantee as an optimal path since in some links there may be too much data transferred and can cause congestion. In this paper, an algorithm is developed to find the shortest path that is more optimal that is aware of the load concentration above the link. The Floyd-Warshall algorithm will be used as a basis for finding the shortest path firstly and then the results path will be used to find the optimal path. Pathways can be considered optimal if there is no excessive concentration on some links. Our results show that the algorithm developed can reduce the load path distribution in the link, which means congestion is also reduced.
Bahasa Inggris
Bentuk Karya Bukan fiksi atau tidak didefinisikan
Target Pembaca Tidak diketahui / tidak ditentukan

 
No Barcode No. Panggil Akses Lokasi Ketersediaan
Tag Ind1 Ind2 Isi
001 INLIS000000000045136
005 20181217111839
007 ta
008 181217###########################0#eng##
035 # # $a 0010-1218000374
100 0 # $a Fuad Fadhil Azzar
245 1 # $a A Load Concentration Avoidance Algorithm for the Shortest Network Path Problem
250 # # $a Journal
260 # # $a Universitas Hasanuddin :$b Fak. Mipa,$c 2018
300 # # $a 5 hlm.
520 # # $a The shortest path search is one of the most fundamental problems in network optimization and it is still being studied for various applications. The shortest path algorithm that is mostly used by network devices to transfer data packets is the Floyd-Warshall algorithm. This algorithm can find the shortest path by considering the weight of each link, however, the generated shortest path does not guarantee as an optimal path since in some links there may be too much data transferred and can cause congestion. In this paper, an algorithm is developed to find the shortest path that is more optimal that is aware of the load concentration above the link. The Floyd-Warshall algorithm will be used as a basis for finding the shortest path firstly and then the results path will be used to find the optimal path. Pathways can be considered optimal if there is no excessive concentration on some links. Our results show that the algorithm developed can reduce the load path distribution in the link, which means congestion is also reduced.
650 # # $a best path
650 # # $a floydwarshall
650 # # $a network
650 # # $a routing
650 # # $a shortest path
700 0 # $a Armin Lawi
700 0 # $a Masato Tsuru
No Nama File Nama File Format Flash Format File Action
1 Paper Fadhil Revised 151020182148_001.pdf pdf Baca Online
Content Unduh katalog