{"title":"单例流回溯机制","authors":"R. C. Baishya, D. Bhattacharyya","doi":"10.1109/ISEA-ISAP49340.2020.235012","DOIUrl":null,"url":null,"abstract":"In this paper we propose and analyze a loggingbased IP traceback mechanism, referred to as Singleton Flow Traceback(SFT), that can traceback to the source of a flow containing one or more packets. We consider the tuple < S, D > as a flow, where S is the Source IP and D is the destination IP of the flow and all packets with the same < S, D > pair belongs to the same flow. For logging, SFT requires significantly less storage (less than 8% of packet rate) than most of the existing single packet traceback mechanism in the literature. SFT guarantees zero false negative rate, i.e., if there exists a path P = R1, R2….Rk of routers through which the packets of a flow < S, D > has traversed, SFT can always reach R1, i.e., the first router to which the source of the flow < S, D > is connected with. Also, the expected value of false positive rate for a traceback query is very low (< 0.11).","PeriodicalId":235855,"journal":{"name":"2020 Third ISEA Conference on Security and Privacy (ISEA-ISAP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Singleton Flow Traceback (SFT) Mechanism\",\"authors\":\"R. C. Baishya, D. Bhattacharyya\",\"doi\":\"10.1109/ISEA-ISAP49340.2020.235012\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we propose and analyze a loggingbased IP traceback mechanism, referred to as Singleton Flow Traceback(SFT), that can traceback to the source of a flow containing one or more packets. We consider the tuple < S, D > as a flow, where S is the Source IP and D is the destination IP of the flow and all packets with the same < S, D > pair belongs to the same flow. For logging, SFT requires significantly less storage (less than 8% of packet rate) than most of the existing single packet traceback mechanism in the literature. SFT guarantees zero false negative rate, i.e., if there exists a path P = R1, R2….Rk of routers through which the packets of a flow < S, D > has traversed, SFT can always reach R1, i.e., the first router to which the source of the flow < S, D > is connected with. Also, the expected value of false positive rate for a traceback query is very low (< 0.11).\",\"PeriodicalId\":235855,\"journal\":{\"name\":\"2020 Third ISEA Conference on Security and Privacy (ISEA-ISAP)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 Third ISEA Conference on Security and Privacy (ISEA-ISAP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISEA-ISAP49340.2020.235012\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 Third ISEA Conference on Security and Privacy (ISEA-ISAP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISEA-ISAP49340.2020.235012","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
摘要
在本文中,我们提出并分析了一种基于日志的IP回溯机制,称为单例流回溯(SFT),它可以回溯到包含一个或多个数据包的流的源。我们将元组< S, D >看作一个流,其中S为流的源IP, D为流的目的IP,所有具有相同< S, D >对的数据包都属于同一流。对于日志记录,与文献中大多数现有的单数据包追溯机制相比,SFT需要的存储空间要少得多(小于数据包速率的8%)。SFT保证假阴性率为零,即如果存在路径P = R1, R2....流< S, D >的数据包所经过的路由器的Rk, SFT总能到达R1,即流< S, D >的源所连接的第一个路由器。此外,回溯查询的误报率的期望值非常低(< 0.11)。
In this paper we propose and analyze a loggingbased IP traceback mechanism, referred to as Singleton Flow Traceback(SFT), that can traceback to the source of a flow containing one or more packets. We consider the tuple < S, D > as a flow, where S is the Source IP and D is the destination IP of the flow and all packets with the same < S, D > pair belongs to the same flow. For logging, SFT requires significantly less storage (less than 8% of packet rate) than most of the existing single packet traceback mechanism in the literature. SFT guarantees zero false negative rate, i.e., if there exists a path P = R1, R2….Rk of routers through which the packets of a flow < S, D > has traversed, SFT can always reach R1, i.e., the first router to which the source of the flow < S, D > is connected with. Also, the expected value of false positive rate for a traceback query is very low (< 0.11).