匿名网络传感图挑战

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
{"title":"匿名网络传感图挑战","authors":"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","doi":"arxiv-2409.08115","DOIUrl":null,"url":null,"abstract":"The MIT/IEEE/Amazon GraphChallenge encourages community approaches to\ndeveloping new solutions for analyzing graphs and sparse data derived from\nsocial media, sensor feeds, and scientific data to discover relationships\nbetween events as they unfold in the field. The anonymized network sensing\nGraph Challenge seeks to enable large, open, community-based approaches to\nprotecting networks. Many large-scale networking problems can only be solved\nwith community access to very broad data sets with the highest regard for\nprivacy and strong community buy-in. Such approaches often require\ncommunity-based data sharing. In the broader networking community (commercial,\nfederal, and academia) anonymized source-to-destination traffic matrices with\nstandard data sharing agreements have emerged as a data product that can meet\nmany of these requirements. This challenge provides an opportunity to highlight\nnovel approaches for optimizing the construction and analysis of anonymized\ntraffic matrices using over 100 billion network packets derived from the\nlargest Internet telescope in the world (CAIDA). This challenge specifies the\nanonymization, construction, and analysis of these traffic matrices. A\nGraphBLAS reference implementation is provided, but the use of GraphBLAS is not\nrequired in this Graph Challenge. As with prior Graph Challenges the goal is to\nprovide a well-defined context for demonstrating innovation. Graph Challenge\nparticipants are free to select (with accompanying explanation) the Graph\nChallenge elements that are appropriate for highlighting their innovations.","PeriodicalId":501407,"journal":{"name":"arXiv - MATH - Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Anonymized Network Sensing Graph Challenge\",\"authors\":\"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\",\"doi\":\"arxiv-2409.08115\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The MIT/IEEE/Amazon GraphChallenge encourages community approaches to\\ndeveloping new solutions for analyzing graphs and sparse data derived from\\nsocial media, sensor feeds, and scientific data to discover relationships\\nbetween events as they unfold in the field. The anonymized network sensing\\nGraph Challenge seeks to enable large, open, community-based approaches to\\nprotecting networks. Many large-scale networking problems can only be solved\\nwith community access to very broad data sets with the highest regard for\\nprivacy and strong community buy-in. Such approaches often require\\ncommunity-based data sharing. In the broader networking community (commercial,\\nfederal, and academia) anonymized source-to-destination traffic matrices with\\nstandard data sharing agreements have emerged as a data product that can meet\\nmany of these requirements. This challenge provides an opportunity to highlight\\nnovel approaches for optimizing the construction and analysis of anonymized\\ntraffic matrices using over 100 billion network packets derived from the\\nlargest Internet telescope in the world (CAIDA). This challenge specifies the\\nanonymization, construction, and analysis of these traffic matrices. A\\nGraphBLAS reference implementation is provided, but the use of GraphBLAS is not\\nrequired in this Graph Challenge. As with prior Graph Challenges the goal is to\\nprovide a well-defined context for demonstrating innovation. Graph Challenge\\nparticipants are free to select (with accompanying explanation) the Graph\\nChallenge elements that are appropriate for highlighting their innovations.\",\"PeriodicalId\":501407,\"journal\":{\"name\":\"arXiv - MATH - Combinatorics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - MATH - Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.08115\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.08115","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

麻省理工学院/IEEE/亚马逊图形挑战赛鼓励社区开发新的解决方案,用于分析从社交媒体、传感器馈送和科学数据中获得的图形和稀疏数据,以发现事件在现场发生时之间的关系。匿名网络传感图挑战赛旨在启用大型、开放、基于社区的方法来保护网络。许多大规模的网络问题只能通过社区访问非常广泛的数据集来解决,同时要高度重视隐私问题并得到社区的大力支持。这种方法通常需要基于社区的数据共享。在更广泛的网络社区(商业、联邦和学术界)中,符合数据共享协议的匿名源到目的地流量矩阵已经成为一种数据产品,可以满足许多此类要求。本挑战赛提供了一个机会,可以利用从世界上最大的互联网望远镜(CAIDA)中获得的超过 1000 亿个网络数据包,重点介绍优化匿名流量矩阵构建和分析的新方法。本挑战书规定了这些流量矩阵的匿名化、构建和分析。我们提供了 AGraphBLAS 参考实现,但本图表挑战赛并不要求使用 GraphBLAS。与以往的图形挑战赛一样,本次挑战赛的目标是为展示创新提供一个定义明确的环境。图形挑战赛参赛者可以自由选择适合突出其创新的图形挑战赛元素(附带说明)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Anonymized Network Sensing 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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A note on connectivity in directed graphs Proof of a conjecture on graph polytope Generalized Andrásfai--Erdős--Sós theorems for odd cycles The repetition threshold for ternary rich words Isomorphisms of bi-Cayley graphs on generalized quaternion groups
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1