Traffic Measurement for Big Network Data [electronic resource] / by Shigang Chen, Min Chen, Qingjun Xiao.

За: Інтелектуальна відповідальність: Вид матеріалу: Текст Серія: Wireless NetworksПублікація: Cham : Springer International Publishing : Imprint: Springer, 2017Видання: 1st ed. 2017Опис: VII, 104 p. 45 illus., 2 illus. in color. online resourceТип вмісту:
  • text
Тип засобу:
  • computer
Тип носія:
  • online resource
ISBN:
  • 9783319473406
Тематика(и): Додаткові фізичні формати: Printed edition:: Немає назви; Printed edition:: Немає назви; Printed edition:: Немає назвиДесяткова класифікація Дьюї:
  • 621.382 23
Класифікація Бібліотеки Конгресу:
  • TK1-9971
Електронне місцезнаходження та доступ:
Вміст:
Introduction -- Per-Flow Size Measurement -- Per-Flow Cardinality Measurement -- Persistent Spread Measurement.
У: Springer eBooksЗведення: 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.
Тип одиниці: ЕКнига Списки з цим бібзаписом: Springer Ebooks (till 2020 - Open Access)+(2017 Network Access)) | Springer Ebooks (2017 Network Access))
Мітки з цієї бібліотеки: Немає міток з цієї бібліотеки для цієї назви. Ввійдіть, щоб додавати мітки.
Оцінки зірочками
    Середня оцінка: 0.0 (0 голос.)
Немає реальних примірників для цього запису

Introduction -- Per-Flow Size Measurement -- Per-Flow Cardinality Measurement -- Persistent Spread Measurement.

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.

Available to subscribing member institutions only. Доступно лише організаціям членам підписки.

Online access from local network of NaUOA.

Online access with authorization at https://link.springer.com/

Онлайн-доступ з локальної мережі НаУОА.

Онлайн доступ з авторизацією на https://link.springer.com/

Немає коментарів для цієї одиниці.

для можливості публікувати коментарі.