Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 143,45
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 111.
Idioma: Inglés
Publicado por Springer International Publishing, 2018
ISBN 10: 3319837168 ISBN 13: 9783319837161
Librería: moluna, Greven, Alemania
EUR 93,00
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 159,52
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Brand New. reprint edition. 112 pages. 9.25x6.10x0.28 inches. In Stock.
Librería: preigu, Osnabrück, Alemania
EUR 95,15
Cantidad disponible: 5 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Traffic Measurement for Big Network Data | Shigang Chen (u. a.) | Taschenbuch | vii | Englisch | 2018 | Springer | EAN 9783319837161 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Idioma: Inglés
Publicado por Springer, Berlin, Springer, 2018
ISBN 10: 3319837168 ISBN 13: 9783319837161
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 111,35
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.
Librería: Brook Bookstore On Demand, Napoli, NA, Italia
EUR 86,24
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: new. Questo è un articolo print on demand.
Idioma: Inglés
Publicado por Berlin Springer International Publishing Springer Jun 2018, 2018
ISBN 10: 3319837168 ISBN 13: 9783319837161
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 106,99
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 104 pp. Englisch.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 150,71
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand pp. 111.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 150,05
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND pp. 111.