arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2409.08115cs.NIcs.DMcs.PFcs.SEmath.CO
收藏

匿名化网络感知图挑战

Anonymized Network Sensing Graph Challenge

Hayden Jananthan, Michael Jones, William Arcand, David Bestor, William Bergeron, Daniel Burrill, Aydin Buluc, Chansup Byun, Timothy Davis, Vijay Gadepally, Dani… 展开作者

Hayden Jananthan, Michael Jones, William Arcand, David Bestor, William Bergeron, Daniel Burrill, Aydin Buluc, Chansup Byun, Timothy Davis, Vijay Gadepally, Daniel Grant, Michael Houle, Matthew Hubbell, Piotr Luszczek, Peter Michaleas, Lauren Milechin, Chasen Milner, Guillermo Morales, Andrew Morris, Julie Mullen, Ritesh Patel, Alex Pentland, Sandeep Pisharody, Andrew Prout, Albert Reuther, Antonio Rosa, Gabriel Wachman, Charles Yee, Jeremy Kepner

AI总结:

MIT/IEEE/Amazon GraphChallenge鼓励社区开发新方案分析图与稀疏数据。匿名化网络感知图挑战旨在基于CAIDA超1000亿网络数据包,推动匿名化流量矩阵构建与分析的社区创新方法。

摘要:

MIT/IEEE/Amazon GraphChallenge鼓励社区方法开发新方案,以分析源自社交媒体、传感器馈送和科学数据的图与稀疏数据,从而发现事件在现场展开时之间的关系。匿名化网络感知Graph Challenge旨在实现大规模、开放的、基于社区的网络保护方法。许多大规模网络问题只能通过社区访问非常广泛的数据集来解决,同时需高度重视隐私并获得社区的强烈支持。此类方法通常需要基于社区的数据共享。在更广泛的网络社区(商业、联邦和学术界)中,具有标准数据共享协议的匿名化源到目的地流量矩阵已成为一种能够满足许多此类要求的数据产品。本挑战提供了一个机会,以突出优化匿名化流量矩阵的构建和分析的新颖方法,使用的数据来自全球最大的互联网望远镜(CAIDA)的超过1000亿个网络数据包。本挑战规定了这些流量矩阵的匿名化、构建和分析。提供了一个GraphBLAS参考实现,但在本Graph Challenge中不要求使用GraphBLAS。与之前的Graph Challenges一样,目标是提供一个明确定义的背景以展示创新。Graph Challenge参与者可以自由选择(并附带说明)适合突出其创新的Graph Challenge元素。

英文摘要:

The MIT/IEEE/Amazon GraphChallenge encourages community approaches to developing new solutions for analyzing graphs and sparse data derived from social media, sensor feeds, and scientific data to discover relationships between events as they unfold in the field. The anonymized network sensing Graph Challenge seeks to enable large, open, community-based approaches to protecting networks. Many large-scale networking problems can only be solved with community access to very broad data sets with the highest regard for privacy and strong community buy-in. Such approaches often require community-based data sharing. In the broader networking community (commercial, federal, and academia) anonymized source-to-destination traffic matrices with standard data sharing agreements have emerged as a data product that can meet many of these requirements. This challenge provides an opportunity to highlight novel approaches for optimizing the construction and analysis of anonymized traffic matrices using over 100 billion network packets derived from the largest Internet telescope in the world (CAIDA). This challenge specifies the anonymization, construction, and analysis of these traffic matrices. A GraphBLAS reference implementation is provided, but the use of GraphBLAS is not required in this Graph Challenge. As with prior Graph Challenges the goal is to provide a well-defined context for demonstrating innovation. Graph Challenge participants are free to select (with accompanying explanation) the Graph Challenge elements that are appropriate for highlighting their innovations.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑