{"title":"The Virtually Invisible Internet","authors":"S. Singh, J. Binkley","doi":"10.1109/GI.2007.4301432","DOIUrl":"https://doi.org/10.1109/GI.2007.4301432","url":null,"abstract":"We consider the question \"What if we could redesign the Internet, how would we do it?\" The preliminary proposal discussed in this paper is based on two observations - today, and in the future, wireless access by users will be the predominant mode of communication and communication typically follows a group-pattern where groups of people and/or entities engage in a specific communication activity. Using these two observations, we propose a novel group-based architecture with the goal of making the Internet more usable as well as invisible to users.","PeriodicalId":309919,"journal":{"name":"2007 IEEE Global Internet Symposium","volume":"613 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124626481","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"OverSim: A Flexible Overlay Network Simulation Framework","authors":"I. Baumgart, Bernhard Heep, Stephan Krause","doi":"10.1109/GI.2007.4301435","DOIUrl":"https://doi.org/10.1109/GI.2007.4301435","url":null,"abstract":"A fundamental problem in studying peer-to- peer networks is the evaluation of new protocols. This paper presents OverSim, a flexible overlay network simulation framework based on OMNeT++. It was designed to fulfill a number of requirements that have been partially neglected by existing simulation frameworks. OverSim includes several structured and unstructured peer-to-peer protocols like Chord, Kademlia and Gia. These protocol implementations can be used for both simulation as well as real world networks. To facilitate the implementation of additional protocols and to make them more comparable OverSim provides several common functions like a generic lookup mechanism for structured peer-to-peer networks and an RPC interface. Several exchangeable underlay network models allow to simulate complex heterogeneous underlay networks as well as simplified networks for large- scale simulations. We show that with OverSim simulations of overlay networks with up to 100,000 nodes are feasible.","PeriodicalId":309919,"journal":{"name":"2007 IEEE Global Internet Symposium","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116047084","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Camouflaging Honeynets","authors":"V. Yegneswaran, C. Alfeld, P. Barford, Jin-Yi Cai","doi":"10.1109/gi.2007.4301430","DOIUrl":"https://doi.org/10.1109/gi.2007.4301430","url":null,"abstract":"Over the past several years, honeynets have proven invaluable for understanding the characteristics of unwanted Internet traffic from misconfigurations and malicious attacks. In this paper, we address the problem of defending honeynets against systematic mapping by malicious parties, so we can ensure that honeynets remain viable in the long term. Our approach is based on two ideas: (i) counting the number of probes received in the honeynet, and (ii) shuffling the location of live systems with those that comprise the honeynet in a larger address space after the probe count has exceeded a threshold. We describe four different strategies for randomizing the location of the honeynet. Each strategy is defined in terms of the degree of defense that it provides and its associated computational and state requirements. We implement a prototype middlebox that we call kaleidoscope to gain practical insight on the feasibility of these strategies. Through a series of tests we show that the system is capable of effectively defending honeynets in large networks with limited impact on normal traffic, and that it continues to respond well in the face of large resource attacks.","PeriodicalId":309919,"journal":{"name":"2007 IEEE Global Internet Symposium","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123268862","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
K. Ishibashi, R. Kawahara, M. Tatsuya, T. Kondoh, S. Asano
{"title":"Effect of sampling rate and monitoring granularity on anomaly detectability","authors":"K. Ishibashi, R. Kawahara, M. Tatsuya, T. Kondoh, S. Asano","doi":"10.1109/GI.2007.4301426","DOIUrl":"https://doi.org/10.1109/GI.2007.4301426","url":null,"abstract":"In this paper, we quantitatively evaluate how sampling decreases the detectability of anomalous traffic. We build equations to calculate the false positive ratio (FPR) and false negative ratio (FNR) for given values of the sampling rate, statistics of normal traffic, and volume of anomalies to be detected. We show that by changing the measurement granularity, we can detect anomalies even with a low sampling rate and give the equation to derive optimal granularity by using the relationship between the mean and variance of aggregated flows. With those equations, we can answer for the practical questions that arise in actual network operations; what sampling rate to set in order to find the given volume of anomaly, or, if the sampling is too high for actual operation, then what granularity is optimal to find the anomaly for a given lower limit of sampling rate.","PeriodicalId":309919,"journal":{"name":"2007 IEEE Global Internet Symposium","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132292535","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
求助内容：
应助结果提醒方式：