東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Network Coding for Network Tomography.

Sattari, Pegah.

FindBook

Google Book

Amazon

博客來

Network Coding for Network Tomography.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Network Coding for Network Tomography./
作者:	Sattari, Pegah.
面頁冊數:	154 p.
附註:	Source: Dissertation Abstracts International, Volume: 73-10(E), Section: B.
Contained By:	Dissertation Abstracts International73-10B(E).
標題:	Engineering, Computer. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3510248
ISBN:	9781267376091

Network Coding for Network Tomography.
Sattari, Pegah.

Network Coding for Network Tomography. - 154 p.

Source: Dissertation Abstracts International, Volume: 73-10(E), Section: B.

Thesis (Ph.D.)--University of California, Irvine, 2012.

Network tomography aims at inferring internal network characteristics, such as topology and/or link-level characteristics, such as loss rate or delay, based on measurements at the edge of the network. There is a significant body of work on this problem using multicast and/or unicast end-to-end probes. Independently, recent advances in network coding have shown that there are several advantages from allowing intermediate nodes to process and combine, in addition to just forward, incoming packets. In this dissertation, we revisit the problem of network tomography with network coding. We show that network coding offers several benefits in terms of complexity, accuracy, and bandwidth savings. Our key intuition is that network coding at intermediate nodes introduces topology-dependent correlation in the content of coded packets, which can then be exploited for inferring the coding points. This thesis makes three contributions.

ISBN: 9781267376091Subjects--Topical Terms:

1669061
Engineering, Computer.

Network Coding for Network Tomography.
LDR:04413nam 2200349 4500 001 1957259
005 20131202131324.5
008 150210s2012 ||||||||||||||||| ||eng d
020 $a 9781267376091
035 $a (UMI)AAI3510248
035 $a AAI3510248
040 $a UMI $c UMI
100 1 $a Sattari, Pegah. $3 2092123
245 1 0 $a Network Coding for Network Tomography.
300 $a 154 p.
500 $a Source: Dissertation Abstracts International, Volume: 73-10(E), Section: B.
500 $a Adviser: Athina Markopoulou.
502 $a Thesis (Ph.D.)--University of California, Irvine, 2012.
520 $a Network tomography aims at inferring internal network characteristics, such as topology and/or link-level characteristics, such as loss rate or delay, based on measurements at the edge of the network. There is a significant body of work on this problem using multicast and/or unicast end-to-end probes. Independently, recent advances in network coding have shown that there are several advantages from allowing intermediate nodes to process and combine, in addition to just forward, incoming packets. In this dissertation, we revisit the problem of network tomography with network coding. We show that network coding offers several benefits in terms of complexity, accuracy, and bandwidth savings. Our key intuition is that network coding at intermediate nodes introduces topology-dependent correlation in the content of coded packets, which can then be exploited for inferring the coding points. This thesis makes three contributions.
520 $a First, we revisit multiple-source loss tomography in tree topologies with multicast and network coding capabilities, and we provide, for the first time, a low-complexity Maximum Likelihood Estimator (MLE) for the link loss rates. In addition to the MLE, we also apply and evaluate message-passing algorithms for link loss estimation, both in trees and in general topologies.
520 $a Second, we study the topology inference problem in multiple-source multiple-receiver (M-by-N) networks. We build on prior work, which infers a general M-by-N topology by first inferring several 2-by-2 subnetwork components, and then merging them to obtain the M-by-N topology. We show that, with simple network coding operations at intermediate nodes, it is possible to perfectly identify every 2-by-2 component, which was not possible previously using only multicast or unicast probes. Furthermore, we propose a new algorithm for merging all 2-by-2 components to obtain the M-by-N topology. We cast the problem as multiple hypotheses testing (in particular, generalized binary search), and we design a greedy algorithm that adaptively selects which 2-by-2 components to measure so as to minimize the number of measurements needed to infer the M-by-N topology, and we analyze its performance.
520 $a In the last part of the thesis, we revisit the traceback problem, which arises in the context of denial-of-service attacks, where multiple attack sources flood a victim destination by sending a large number of packets. The goal of traceback is to identify the paths traversed by these malicious packets all the way back to the attack sources, by allowing intermediate nodes to mark a dedicated field on headers of packets passing through them with the node id. We incorporate, for the first time, network coding in two different types of traceback schemes: probabilistic packet marking schemes and algebraic traceback. In probabilistic packet marking, routers probabilistically mark packets with a function of their router id. We demonstrate the benefit of network coding, by essentially reducing the traceback problem to a coupon collector's problem. In contrast, algebraic traceback encodes the ids of routers on a single path as coefficients in a polynomial of a single variable. We extend that idea to encode multiple paths into a multivariate polynomial and we establish a one-to-one mapping between multi-path algebraic traceback and a particular network coding problem.
590 $a School code: 0030.
650 4 $a Engineering, Computer. $3 1669061
650 4 $a Engineering, Electronics and Electrical. $3 626636
650 4 $a Computer Science. $3 626642
690 $a 0464
690 $a 0544
690 $a 0984
710 2 $a University of California, Irvine. $b Electrical and Computer Engineering - Ph.D. $3 1670048
773 0 $t Dissertation Abstracts International $g 73-10B(E).
790 1 0 $a Markopoulou, Athina, $e advisor
790 1 0 $a Swindlehurst, Lee $e committee member
790 1 0 $a Goodrich, Michael $e committee member
790 $a 0030
791 $a Ph.D.
792 $a 2012
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3510248