Traffic Measurement for Big Network Data

This book presents several compact and fast methods for online traffic measurement of big network data. It describes challenges of online traffic measurement, discusses the state of the field, and provides an overview of the potential solutions to major problems. The authors introduce the problem of...

Full description

Bibliographic Details
Main Authors: Chen, Shigang, Chen, Min (Author), Xiao, Qingjun (Author)
Format: eBook
Language:English
Published: Cham Springer International Publishing 2017, 2017
Edition:1st ed. 2017
Series:Wireless Networks
Subjects:
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
LEADER 03066nmm a2200349 u 4500
001 EB001273232
003 EBX01000000000000000887874
005 00000000000000.0
007 cr|||||||||||||||||||||
008 161202 ||| eng
020 |a 9783319473406 
100 1 |a Chen, Shigang 
245 0 0 |a Traffic Measurement for Big Network Data  |h Elektronische Ressource  |c by Shigang Chen, Min Chen, Qingjun Xiao 
250 |a 1st ed. 2017 
260 |a Cham  |b Springer International Publishing  |c 2017, 2017 
300 |a VII, 104 p. 45 illus., 2 illus. in color  |b online resource 
505 0 |a Introduction -- Per-Flow Size Measurement -- Per-Flow Cardinality Measurement -- Persistent Spread Measurement 
653 |a Computer Communication Networks 
653 |a Application software 
653 |a Computer networks  
653 |a Telecommunication 
653 |a Communications Engineering, Networks 
653 |a Computer and Information Systems Applications 
700 1 |a Chen, Min  |e [author] 
700 1 |a Xiao, Qingjun  |e [author] 
041 0 7 |a eng  |2 ISO 639-2 
989 |b Springer  |a Springer eBooks 2005- 
490 0 |a Wireless Networks 
028 5 0 |a 10.1007/978-3-319-47340-6 
856 4 0 |u https://doi.org/10.1007/978-3-319-47340-6?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 621.382 
520 |a This book presents several compact and fast methods for online traffic measurement of big network data. It describes challenges of online traffic measurement, discusses the state of the field, and provides an overview of the potential solutions to major problems. The authors introduce the problem of per-flow size measurement for big network data and present a fast and scalable counter architecture, called Counter Tree, which leverages a two-dimensional counter sharing scheme to achieve far better memory efficiency and significantly extend estimation range. Unlike traditional approaches to cardinality estimation problems that allocate a separated data structure (called estimator) for each flow, this book takes a different design path by viewing all the flows together as a whole: each flow is allocated with a virtual estimator, and these virtual estimators share a common memory space. A framework of virtual estimators is designed to apply the idea of sharing to an array of cardinality estimation solutions, achieving far better memory efficiency than the best existing work. To conclude, the authors discuss persistent spread estimation in high-speed networks. They offer a compact data structure called multi-virtual bitmap, which can estimate the cardinality of the intersection of an arbitrary number of sets. Using multi-virtual bitmaps, an implementation that can deliver high estimation accuracy under a very tight memory space is presented. The results of these experiments will surprise both professionals in the field and advanced-level students interested in the topic. By providing both an overview and the results of specific experiments, this book is useful for those new to online traffic measurement and experts on the topic