東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

FindBook

Google Book

Amazon

博客來

All Pairs Routing Path Enumeration Using Latin Multiplication and Julia.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	All Pairs Routing Path Enumeration Using Latin Multiplication and Julia./
作者:	Sun, Haochen.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2022,
面頁冊數:	104 p.
附註:	Source: Dissertations Abstracts International, Volume: 83-11, Section: B.
Contained By:	Dissertations Abstracts International83-11B.
標題:	Computer science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=29165622
ISBN:	9798426826137

All Pairs Routing Path Enumeration Using Latin Multiplication and Julia.
Sun, Haochen.

All Pairs Routing Path Enumeration Using Latin Multiplication and Julia. - Ann Arbor : ProQuest Dissertations & Theses, 2022 - 104 p.

Source: Dissertations Abstracts International, Volume: 83-11, Section: B.

Thesis (Ph.D.)--Marquette University, 2022.

This item must not be sold to any third party vendors.

Enumerating all routing paths among Autonomous Systems (ASes) at an Internet-scale is an intractable problem. The Border Gateway Protocol (BGP) is the standard exterior gateway protocol through which ASes exchange reachability information. Building an efficient path enumeration tool for a given network is an essential step toward estimating the resiliency of the network to cyber security attacks, such as routing origin and path hijacking. In our work, we use the matrix Latin multiplication method to compute all possible paths among all pairs of nodes. We parallelize this computation through the domain decomposition for matrix multiplication and implement our solution in the Julia high-performance programming language. We also compare our method with the classical Monte Carlo method. Our results provide positive evidence for the applicability of the method.

ISBN: 9798426826137Subjects--Topical Terms:

523869
Computer science.
Subjects--Index Terms:

BGP prefix attacks

All Pairs Routing Path Enumeration Using Latin Multiplication and Julia.
LDR:02067nmm a2200385 4500 001 2348990
005 20220920134640.5
008 241004s2022 ||||||||||||||||| ||eng d
020 $a 9798426826137
035 $a (MiAaPQ)AAI29165622
035 $a AAI29165622
040 $a MiAaPQ $c MiAaPQ
100 1 $a Sun, Haochen. $0 (orcid)0000-0001-7390-843X $3 3560219
245 1 0 $a All Pairs Routing Path Enumeration Using Latin Multiplication and Julia.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2022
300 $a 104 p.
500 $a Source: Dissertations Abstracts International, Volume: 83-11, Section: B.
500 $a Advisor: Perouli, Debbie.
502 $a Thesis (Ph.D.)--Marquette University, 2022.
506 $a This item must not be sold to any third party vendors.
520 $a Enumerating all routing paths among Autonomous Systems (ASes) at an Internet-scale is an intractable problem. The Border Gateway Protocol (BGP) is the standard exterior gateway protocol through which ASes exchange reachability information. Building an efficient path enumeration tool for a given network is an essential step toward estimating the resiliency of the network to cyber security attacks, such as routing origin and path hijacking. In our work, we use the matrix Latin multiplication method to compute all possible paths among all pairs of nodes. We parallelize this computation through the domain decomposition for matrix multiplication and implement our solution in the Julia high-performance programming language. We also compare our method with the classical Monte Carlo method. Our results provide positive evidence for the applicability of the method.
590 $a School code: 0116.
650 4 $a Computer science. $3 523869
650 4 $a Information technology. $3 532993
650 4 $a Applied mathematics. $3 2122814
653 $a BGP prefix attacks
653 $a BGP simulation
653 $a Latin-multiplication
653 $a Monte Carlo simulation
653 $a Network routing
653 $a Path enumeration
690 $a 0984
690 $a 0489
690 $a 0364
710 2 $a Marquette University. $b Mathematics, Statistics & Computer Science. $3 1684566
773 0 $t Dissertations Abstracts International $g 83-11B.
790 $a 0116
791 $a Ph.D.
792 $a 2022
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=29165622