南開科技大學圖書館 |

Language: 繁體中文

說明(常見問題)

南開科技大學

圖書館首頁

編目中圖書申請

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Network-wide traffic analysis: Metho...

Boston University.

Network-wide traffic analysis: Methods and applications.

紀錄類型:	書目-電子資源 : 單行本
正題名/作者:	Network-wide traffic analysis: Methods and applications./
作者:	Lakhina, Anukool.
面頁冊數:	206 p.
附註:	Source: Dissertation Abstracts International, Volume: 67-09, Section: B, page: 5195.
Contained By:	Dissertation Abstracts International67-09B.
標題:	Mathematics. -
電子資源:	Download PDF (下載PDF全文)
ISBN:	9780542868597

Network-wide traffic analysis: Methods and applications.
Lakhina, Anukool.

Network-wide traffic analysis: Methods and applications. - 206 p.

Source: Dissertation Abstracts International, Volume: 67-09, Section: B, page: 5195.

Thesis (Ph.D.)--Boston University, 2007.

The dominant paradigm in network traffic analysis has been the study of traffic volume as a time series measured at a single network location. However, a wide range of problems currently faced by network operators demand more sophisticated analysis. These problems involve a variety of traffic features as well as simultaneous traffic measurements from multiple sources. Examples of such problems include traffic engineering, traffic matrix estimation, anomaly detection, attack detection, and capacity planning.

ISBN: 9780542868597Subjects--Topical Terms:

146772
Mathematics.

Network-wide traffic analysis: Methods and applications.
LDR:03968nmm 2200325 4500 001 1000004923
005 20070601084734.5
008 070601s2007 eng d
020 $a 9780542868597
035 $a (UnM)AAI3232904
035 $a AAI3232904
040 $a UnM $c UnM{me_controlnum}
100 1 $a Lakhina, Anukool. $3 1000006078
245 1 0 $a Network-wide traffic analysis: Methods and applications.
300 $a 206 p.
500 $a Source: Dissertation Abstracts International, Volume: 67-09, Section: B, page: 5195.
500 $a Adviser: Mark E. Crovella.
502 $a Thesis (Ph.D.)--Boston University, 2007.
520 $a The dominant paradigm in network traffic analysis has been the study of traffic volume as a time series measured at a single network location. However, a wide range of problems currently faced by network operators demand more sophisticated analysis. These problems involve a variety of traffic features as well as simultaneous traffic measurements from multiple sources. Examples of such problems include traffic engineering, traffic matrix estimation, anomaly detection, attack detection, and capacity planning.
520 $a This dissertation describes methods for and results of analyzing multi-featured network traffic from multiple sources, which we term network-wide traffic analysis. Examples include processing traffic from all network links simultaneously, or all source-destination flows in a network simultaneously. The features involved may include fields contained in packet headers as well as traditional volume measures.
520 $a Network-wide analysis of traffic is a challenging problem involving multivariate statistics. Even a moderate-sized network may contain hundreds of links or flows, and each traffic stream presents many features that may be of interest. Thus the central problem one confronts in network-wide traffic analysis is the so-called "curse of dimensionality".
520 $a To attack this problem we adopt the general strategy of seeking low-dimensional approximations that preserve important traffic properties. Our starting point, and the first contribution of this dissertation, is to demonstrate that accurate low-dimensional approximations of network traffic often exist. We show that network-wide traffic measurements that exhibit as many as hundreds of dimensions can be approximated well using a much smaller set of dimensions (for example, less than ten). This observation of low effective dimensionality is key, and provides leverage on a number of problems related to network operations.
520 $a In particular, low effective dimensionality leads us to make use of subspace methods. These methods systematically exploit the low dimensionality of multi-feature traffic flows, to capture network-wide normal behavior, and to expose anomalous events that span a network. We con sides two basic kinds of anomalies: volume anomalies, and general anomalies. Volume anomalies are unusual and significant changes in a network's traffic levels that can often involve multiple links, while general anomalies include a range of unusual events that do not necessarily disturb traffic volume, such as port scans, network scans, user experiments and high-rate flows. Our second contribution is to show that in the case of volume anomalies, applying subspace methods to simple traffic measurements from all links one can: (1) accurately detect when a volume anomaly is occurring; (2) correctly identify the underlying origin-destination (OD) traffic flow which is the source of the anomaly; and (3) accurately estimate the amount of traffic involved in the anomalous OD flow. (Abstract shortened by UMI.)
590 $a School code: 0017.
650 4 $a Mathematics. $3 146772
650 4 $a Computer Science. $3 1000005419
690 $a 0405
690 $a 0984
710 2 0 $a Boston University. $3 1000005522
773 0 $t Dissertation Abstracts International $g 67-09B.
790 1 0 $a Crovella, Mark E., $e advisor
790 $a 0017
791 $a Ph.D.
792 $a 2007
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3232904 $z Download PDF (下載PDF全文)