Title:
Network Data Streaming: Algorithms for Network Measurement and Monitoring

dc.contributor.advisor Zegura, Ellen W.
dc.contributor.author Kumar, Abhishek en_US
dc.contributor.committeeMember Ahamad, Mustaque
dc.contributor.committeeMember Blough, Douglas
dc.contributor.committeeMember Feamster, Nick
dc.contributor.committeeMember Venkateswaran, H.
dc.contributor.department Computing en_US
dc.date.accessioned 2006-01-18T22:18:34Z
dc.date.available 2006-01-18T22:18:34Z
dc.date.issued 2005-11-18 en_US
dc.description.abstract 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. 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. 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. 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. en_US
dc.description.degree Ph.D. en_US
dc.format.extent 2290391 bytes
dc.format.mimetype application/pdf
dc.identifier.uri http://hdl.handle.net/1853/7516
dc.language.iso en_US
dc.publisher Georgia Institute of Technology en_US
dc.subject High-speed networks en_US
dc.subject Network algorithms
dc.subject Expectation maximization
dc.subject Data streaming
dc.subject Network monitoring
dc.subject Computer networks
dc.title Network Data Streaming: Algorithms for Network Measurement and Monitoring en_US
dc.type Text
dc.type.genre Dissertation
dspace.entity.type Publication
local.contributor.advisor Zegura, Ellen W.
local.contributor.corporatename College of Computing
relation.isAdvisorOfPublication 8816f8c5-732c-4e5a-a86e-99019028a7b6
relation.isOrgUnitOfPublication c8892b3c-8db6-4b7b-a33a-1b67f7db2021
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
kumar_abhishek_200512_phd.pdf
Size:
2.18 MB
Format:
Adobe Portable Document Format
Description: