東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Network data streaming: Algorithms f...

Kumar, Abhishek.

FindBook

Google Book

Amazon

博客來

Network data streaming: Algorithms for network measurement and monitoring.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Network data streaming: Algorithms for network measurement and monitoring./
作者:	Kumar, Abhishek.
面頁冊數:	147 p.
附註:	Source: Dissertation Abstracts International, Volume: 66-11, Section: B, page: 6069.
Contained By:	Dissertation Abstracts International66-11B.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3198561
ISBN:	9780542433832

Network data streaming: Algorithms for network measurement and monitoring.
Kumar, Abhishek.

Network data streaming: Algorithms for network measurement and monitoring. - 147 p.

Source: Dissertation Abstracts International, Volume: 66-11, Section: B, page: 6069.

Thesis (Ph.D.)--Georgia Institute of Technology, 2005.

With the emergence of computer networks as one of the primary modes of communication, and with their adoption for an increasingly wide range of applications, there is a growing need to understand and characterize the traffic they carry. The rise of large scale network attacks adds urgency to this need. However, the large size, high speed and increasing complexity of these networks imply that tracking and characterizing the traffic they carry is an increasingly difficult problem. Dealing with higher level aggregates, such as flows instead of packets, does not solve the problem because these aggregates tend to be quite numerous and exhibit dynamics of their own.

ISBN: 9780542433832Subjects--Topical Terms:

626642
Computer Science.

Network data streaming: Algorithms for network measurement and monitoring.
LDR:03262nmm 2200313 4500 001 1825917
005 20061211073602.5
008 130610s2005 eng d
020 $a 9780542433832
035 $a (UnM)AAI3198561
035 $a AAI3198561
040 $a UnM $c UnM
100 1 $a Kumar, Abhishek. $3 1904855
245 1 0 $a Network data streaming: Algorithms for network measurement and monitoring.
300 $a 147 p.
500 $a Source: Dissertation Abstracts International, Volume: 66-11, Section: B, page: 6069.
500 $a Directors: Jun (Jim) Xu; Ellen W. Zegura.
502 $a Thesis (Ph.D.)--Georgia Institute of Technology, 2005.
520 $a With the emergence of computer networks as one of the primary modes of communication, and with their adoption for an increasingly wide range of applications, there is a growing need to understand and characterize the traffic they carry. The rise of large scale network attacks adds urgency to this need. However, the large size, high speed and increasing complexity of these networks imply that tracking and characterizing the traffic they carry is an increasingly difficult problem. Dealing with higher level aggregates, such as flows instead of packets, does not solve the problem because these aggregates tend to be quite numerous and exhibit dynamics of their own.
520 $a In this thesis, we investigate a novel approach to deal with the immense amounts of data associated with problems in network measurement and monitoring. Building upon the paradigm of Data Streaming, which processes a large stream of data using a small working memory to answer a class of queries, we develop an architecture for Network Data Streaming that can accommodate additional constraints imposed in the context of network monitoring.
520 $a Using this architecture, we design algorithms for monitoring properties of network traffic that have traditionally been considered too difficult to monitor at high speed network links and routers. Our first algorithm provides the ability to accurately estimate the size of individual flows. A second algorithm to estimate the distribution of flow sizes enables network operators to monitor anomalies in the traffic. Incorporating the use of packet sampling, we can extend the latter algorithm to estimate the flow size distribution of arbitrary subpopulations. Finally, we apply the tools of Network Data Streaming to the operation of packet sampling itself. Using the ability to efficiently estimate flow-statistics such as approximate per-flow size, we design a family of mechanisms where the sampling decision is guided by this knowledge.
520 $a The individual solutions developed in this thesis share a common architectural theme, supporting the monitoring of highly dynamic populations. Integrating this with the traditional sampling based framework for network monitoring will enable a broad range of applications for accurate and comprehensive monitoring of network traffic.
590 $a School code: 0078.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 0 $a Georgia Institute of Technology. $3 696730
773 0 $t Dissertation Abstracts International $g 66-11B.
790 1 0 $a Xu, Jun (Jim), $e advisor
790 1 0 $a Zegura, Ellen W., $e advisor
790 $a 0078
791 $a Ph.D.
792 $a 2005
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3198561