Distributed Monitoring in Large Scale Overlay Networks (OverlayMeter)

大规模覆盖网络中的分布式监控（OverlayMeter）

• 批准号: 253282637
• 负责人: Professor Dr.-Ing. Kalman Graffi
• 金额: --
• 依托单位: Arbeitsgruppe für Technik sozialer Netzwerke
• 依托单位国家: 德国
• 项目类别: Research Grants
• 财政年份: 2014
• 资助国家: 德国
• 起止时间: 2013-12-31 至 2017-12-31
• 项目状态: 已结题
• 来源: https://gepris.dfg.de/gepris/projekt/253282637?language=en
• 关键词: Distributed; Monitoring; Large; Scale; Overlay

Aiming at the quality of peer-to-peer overlay networks, research focused on optimized mechanisms for selected usage scenarios. The transfer of optimized solution from one specific use case to another is hardly or impossible to implement, as the parameter setting and strategy selection of the overlay is typically fixed for the specific use case. Either the overlays are blind for the dynamics of the environmental parameters, such as the node count or churn dynamics, and thus cannot adapt to a given situation. Or the various mechanisms that interact in the overlay themselves independently and redundantly try to gather relevant information for optimized decisions. In order to enable overlay networks to serve for a wide range of application areas with optimized quality, we aim in this project at providing of an information basis on the overlay which can be used for optimized overlay parameter settings and strategy selections. We consider in this information basis a set of statistics on the performance of the overlay, information on the capacities of the available nodes in the network as well as usage statistics on the documents in the overlay. The creation of future quality-centric overlays will be eased through the wide set of information available. New overlay mechanisms will be able to assume the existence of these information, interpret them and use them to optimally select parameter settings and strategies.In this research project we address the challenges in the creation of such a broad information basis on performance statistics in the overlay using only decentralized aggregation mechanisms. We investigate, design and evaluate efficient, precise and secure measurement mechanisms for overlay networks for the case that all nodes or only a subset of nodes participate in the measurement. The researched mechanisms should be applicable both on distributed hash tables as well as in general weakly connected overlay graphs which might also contain malicious nodes. Besides the focus on the creation of precise network-wide statistics on the performance of the overlay, we also focus on the research of measurement mechanisms to create a global view on the capacities of the peers in order to enable capacity-based peer search as well as on the usage statistics and rankings on the documents in the network. The strong dynamics of the peer capacities as well as the large number of the documents to be considered define new challenges for the measurement of these information.

针对对等覆盖网络的质量，研究重点是针对选定使用场景的优化机制。从一个特定用例到另一个特定用例的优化解决方案的转移几乎或不可能实现，因为覆盖的参数设置和策略选择通常对于特定用例是固定的。覆盖对于环境参数的动态（诸如节点计数或流失动态）是盲目的，并且因此不能适应给定的情况。或者，在覆盖层中交互的各种机制本身独立且冗余地尝试收集相关信息以优化决策。为了使覆盖网络服务于广泛的应用领域与优化的质量，我们的目标是在这个项目中提供的信息基础上的覆盖，可用于优化覆盖参数设置和策略选择。我们认为在这个信息的基础上的一组统计数据的性能覆盖，信息的能力，在网络中的可用节点，以及使用统计数据的文件覆盖。未来以质量为中心的覆盖图的创建将通过广泛的可用信息集而变得容易。新的覆盖机制将能够假设这些信息的存在，解释它们，并使用它们来优化选择参数设置和strategies.在这个研究项目中，我们解决的挑战，在创建这样一个广泛的信息基础上的性能统计数据的覆盖，只使用分散的聚合机制。我们调查，设计和评估有效的，精确的和安全的测量机制覆盖网络的情况下，所有节点或只有一个子集的节点参与测量。所研究的机制应适用于分布式哈希表，以及在一般的弱连接覆盖图，也可能包含恶意节点。除了专注于创建精确的网络范围内的统计数据的覆盖性能，我们还专注于测量机制的研究，以创建一个全球性的观点，以使基于能力的对等搜索，以及在网络中的文件的使用统计和排名的能力。同行能力的强大动态以及需要审议的大量文件，为衡量这些信息提出了新的挑战。

项目成果

Minicamp: Prototype for Partial Participation in Structured Peer-to-Peer Monitoring Protocols

Minicamp：部分参与结构化点对点监控协议的原型

• DOI: 10.1109/lcn.2017.58
• 发表时间: 2017
• 期刊: 2017 IEEE 42nd Conference on Local Computer Networks (LCN)
• 作者: Andreas Disterhöft;Kalman Graffi
• 通讯作者: Kalman Graffi

Chunked-Swarm: Divide and Conquer for Real-Time Bounds in Video Streaming

• DOI: 10.1007/978-3-319-23126-6_18
• 发表时间: 2015-08
• 作者: Christopher Probst;Andreas Disterhöft;Kalman Graffi

Mr.Tree: Multiple Realities in Tree-based Monitoring Overlays for Peer-to-Peer Networks

Mr Tree：点对点网络基于树的监控覆盖的多重现实

• DOI: 10.1109/iccnc.2018.8390361
• 发表时间: 2018
• 期刊: 2018 International Conference on Computing, Networking and Communications (ICNC)
• 作者: Andreas Disterhöft;Phillip Sandkühler;Andre Ippisch;Kalman Graffi
• 通讯作者: Kalman Graffi

Convex Hull Watchdog: Mitigation of Malicious Nodes in Tree-Based P2P Monitoring Systems

凸包看门狗：减少基于树的 P2P 监控系统中的恶意节点

• DOI: 10.1109/lcn.2016.16
• 发表时间: 2016
• 期刊: 2016 IEEE 41st Conference on Local Computer Networks (LCN)
• 作者: Andreas Disterhöft;Kalman Graffi
• 通讯作者: Kalman Graffi

CapSearch: Capacity-Based Search in Highly Dynamic Peer-to-Peer Networks

CapSearch：高度动态对等网络中基于容量的搜索

• DOI: 10.1109/aina.2017.129
• 发表时间: 2017
• 期刊: 2017 IEEE 31st International Conference on Advanced Information Networking and Applications (AINA)
• 作者: Andreas Disterhöft;Kalman Graffi
• 通讯作者: Kalman Graffi