Vai al contenuto principale della pagina

Traffic Measurement for Big Network Data / / by Shigang Chen, Min Chen, Qingjun Xiao



(Visualizza in formato marc)    (Visualizza in BIBFRAME)

Autore: Chen Shigang Visualizza persona
Titolo: Traffic Measurement for Big Network Data / / by Shigang Chen, Min Chen, Qingjun Xiao Visualizza cluster
Pubblicazione: Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017
Edizione: 1st ed. 2017.
Descrizione fisica: 1 online resource (VII, 104 p. 45 illus., 2 illus. in color.)
Disciplina: 004.6
Soggetto topico: Electrical engineering
Computer communication systems
Application software
Communications Engineering, Networks
Computer Communication Networks
Information Systems Applications (incl. Internet)
Persona (resp. second.): ChenMin
XiaoQingjun
Nota di bibliografia: Includes bibliographical references at the end of each chapters.
Nota di contenuto: Introduction -- Per-Flow Size Measurement -- Per-Flow Cardinality Measurement -- Persistent Spread Measurement.
Sommario/riassunto: 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.
Titolo autorizzato: Traffic Measurement for Big Network Data  Visualizza cluster
Formato: Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione: Inglese
Record Nr.: 9910149461703321
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Serie: Wireless Networks, . 2366-1186