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":"29 1","pages":""},"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\":\"29 1\",\"pages\":\"\"},\"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}
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.