Algorithms for Large-Scale Topology Discovery : An insight of the Internet topology discovery scalability

Benoit Donnet

ISBN 10: 3639164318 / ISBN 13: 9783639164312

Edité par VDM Verlag Dr. Müller, 2009

A propos de cet article

nach der Bestellung gedruckt Neuware - Printed after ordering - There is a growing interest in discovery of internettopology at the interface level. A new generation of highly distributed measurement systemsis currently being deployed. Unfortunately, prior to this thesis, the researchcommunity has not examined the problem of how to perform such measurements efficiently andin a network-friendly manner. In this book, we make several contributions toward that end. First, we show that standard topology discovery methods are quite inefficient,repeatedly probing the same interfaces. This is a concern, because when scaled up, suchmethods will generate so much traffic that they will begin to resemble DDoS attacks. As it isnot unusual for a route tracing monitor to operate in isolation, we next propose and evaluatestrategies for reducing redundancy within a single monitor. We third propose andevaluate Doubletree, a cooperative algorithm that reduces redundancy simultaneously on routers andend systems. Finally, we also provide a generalization of Bloom filters, calledretouched Bloom filters, that permits false negatives in addition to false positives and allows atrade-off between the two.

N° de réf. du vendeur 9783639164312

Détails bibliographiques

• Titre: Algorithms for Large-Scale Topology Discovery : An insight of the Internet topology discovery scalability
• Éditeur: VDM Verlag Dr. Müller
• Date de parution: 2009
• Langue: anglais
• ISBN à 10 chiffres: 3639164318
• ISBN à 13 chiffres: 9783639164312
• Reliure: Taschenbuch
• État de l'article: Neu
• Dimensions: 220 L x 150 H x 10 P (en millimètres) 220 millimètres de largeur par 150 millimètres de hauteur par 10 millimètres de profondeur
• Poids: 281 grammes

A propos de ce titre

Synopsis

There is a growing interest in discovery of internet topology at the interface level. A new generation of highly distributed measurement systems is currently being deployed. Unfortunately, prior to this thesis, the research community has not examined the problem of how to perform such measurements efficiently and in a network- friendly manner. In this book, we make several contributions toward that end. First, we show that standard topology discovery methods are quite inefficient, repeatedly probing the same interfaces. This is a concern, because when scaled up, such methods will generate so much traffic that they will begin to resemble DDoS attacks. As it is not unusual for a route tracing monitor to operate in isolation, we next propose and evaluate strategies for reducing redundancy within a single monitor. We third propose and evaluate Doubletree, a cooperative algorithm that reduces redundancy simultaneously on routers and end systems. Finally, we also provide a generalization of Bloom filters, called retouched Bloom filters, that permits false negatives in addition to false positives and allows a trade-off between the two.