{"title":"Examining Graph Properties of Unstructured Peer-to-Peer Overlay Topology","authors":"Chao Xie, Sijie Guo, R. Rejaie, Yi Pan","doi":"10.1109/GI.2007.4301424","DOIUrl":"https://doi.org/10.1109/GI.2007.4301424","url":null,"abstract":"During the past few years, unstructured peer-to- peer (P2P) file-sharing systems have witnessed a significant increase in popularity. However, there lacks a systematic study on graph properties of the overlay topology. In this paper, we use accurate snapshots of the Gnutella overlay that span over roughly three years to explore changes in graph properties over long timescale. We investigate the effect of network address translation (NAT) on topology analysis. We examine a wide spectrum of graph properties characterizing the Gnutella top-level overlay topology and illustrate some interesting results. We find that the connection limit plays an important role in forming the unstructured overlay topology.","PeriodicalId":309919,"journal":{"name":"2007 IEEE Global Internet Symposium","volume":"1 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":"115814827","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":"The Case for Public Work","authors":"Wu-chang Feng, E. Kaiser","doi":"10.1109/GI.2007.4301429","DOIUrl":"https://doi.org/10.1109/GI.2007.4301429","url":null,"abstract":"Whether it is port scans, spam, or distributed denial-of-service attacks from botnets, unwanted traffic is a fundamental problem in all networked systems. Although proof-of-work has been proposed as a mechanism for thwarting such attacks, few proof-of-work systems have been successfully deployed. One of the problems in the proof-of-work approach is that the systems that issue and verify puzzles are typically located at or near the server edge. Rather than eliminate the denial-of-service problem, such approaches merely shift the problem from the service itself to the proof-of-work systems protecting the service. As a result, adversaries can disable services by flooding the issuer, by flooding the verifier, or by flooding all of the network links that lead to the issuer and verifier. To address this problem, this paper proposes a new approach for building proof-of-work systems based on publicly verifiable client puzzles. The system works by issuing a single \"public work function\" that clients must solve for each of its subsequent requests. Because the work function is publicly verifiable, any network device at the client's edge can verify that subsequent traffic will be accepted by the service. The system mitigates floods to the issuer since only a single work function needs to be given per client, thus allowing duplicate requests and replies to be supressed. The system mitigates floods to the verifier and across links leading to the server edge by allowing the verifier to be placed arbitrarily close to the client adversary.","PeriodicalId":309919,"journal":{"name":"2007 IEEE Global Internet Symposium","volume":"1 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":"129195858","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":"Packet Forwarding: Name-based Vs. Prefix-based","authors":"Craig A. Shue, Minaxi Gupta","doi":"10.1109/GI.2007.4301434","DOIUrl":"https://doi.org/10.1109/GI.2007.4301434","url":null,"abstract":"Using domain names for routing, instead of IP prefixes, has the potential to address many of the core outstanding issues in today's Internet. To initiate research in that direction, this paper compares the performance of name-based routing in the core of the Internet with that of IPv4 routing. Our analysis concludes that name-based routing is well within the scope of feasibility.","PeriodicalId":309919,"journal":{"name":"2007 IEEE Global Internet Symposium","volume":"8 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":"125820936","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":"Stochastic Sampling for Internet Traffic Measurement","authors":"Tilman Wolf, Yan Cai, Patrick A. Kelly, W. Gong","doi":"10.1109/GI.2007.4301427","DOIUrl":"https://doi.org/10.1109/GI.2007.4301427","url":null,"abstract":"The increasing complexity of the Internet demands continued improvements to measurement techniques and data analysis methods to aid our understanding of network operation. The availability of accurate measurement data is necessary in many areas ranging from attack detection, novel pricing schemes, buffer dimensioning and switch design to general network management. In this paper, we develop a theory for accurate and unbiased Internet traffic measurement using the tools of Poisson random sampling. We show how this approach helps in storing, managing, and aggregating data from different sources with independent clocks and sampling rates. We present results that show that stochastic sampling maintains important information about network measurements that would be lost when using conventional uniform sampling.","PeriodicalId":309919,"journal":{"name":"2007 IEEE Global Internet Symposium","volume":"5 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":"127592497","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":"A Black-box Router Profiler","authors":"R. Chertov, S. Fahmy, N. Shroff","doi":"10.1109/GI.2007.4301428","DOIUrl":"https://doi.org/10.1109/GI.2007.4301428","url":null,"abstract":"Simulation, emulation, and wide-area testbeds exhibit different strengths and weaknesses with respect to fidelity, scalability, and manageability. Fidelity is a key concern since simulation or emulation inaccuracies can lead to a dramatic and qualitative impact on the results. For example, high-bandwidth denial of service attack floods of the same rates have very different impact on the different platforms, even if the experimental scenario is supposedly identical. This is because many popular simulation and emulation environments fail to account for realistic commercial router behaviors, and incorrect results have been reported based on experiments conducted in these environments. In this paper, we describe the architecture of a black-box router profiling tool which integrates the popular ns-2 simulator with the Click modular router and a modified network driver. We use this profiler to collect measurements on a Cisco router. Our preliminary results demonstrate that routers and other forwarding devices cannot be modeled as simple output port queues, even if correct rate limits are observed. We discuss our future work plans for using our data to create high-fidelity network simulation/emulation models that are not computationally prohibitive.","PeriodicalId":309919,"journal":{"name":"2007 IEEE Global Internet Symposium","volume":"6 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":"131827476","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":"Distributed Social-based Overlay Adaptation for Unstructured P2P Networks","authors":"Ching-Ju Lin, Yi-Ting Chang, Shuo-Chan Tsai, Cheng-Fu Chou","doi":"10.1109/GI.2007.4301422","DOIUrl":"https://doi.org/10.1109/GI.2007.4301422","url":null,"abstract":"The widespread use of peer-to-peer (P2P) systems has made multimedia content sharing more efficient. Users in a P2P network can query and download objects based on their preference for specific types of multimedia content. However, most P2P systems only construct the overlay architecture according to physical network constraints and do not take user preferences into account. In this paper, we investigate a social-based overlay that can cluster peers that have similar preferences. To construct a semantic social-based overlay, we model a quantifiable measure of similarity between peers so that those with a higher degree of similarity can be connected by shorter paths. Hence, peers can locate objects of interest from their overlay neighbors, i.e., peers who have common interests. In addition, we propose an overlay adaptation algorithm that allows the overlay to adapt to P2P churn and preference changes in a distributed manner. We use simulations and a real database called Audioscrobbler, which tracks users' listening habits, to evaluate the proposed social-based overlay. The results show that social-based overlay adaptation enables users to locate content of interest with a higher success ratio and with less message overhead.","PeriodicalId":309919,"journal":{"name":"2007 IEEE Global Internet Symposium","volume":"79 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":"124174766","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":"A Case for Unstructured Distributed Hash Tables","authors":"Krishna P. N. Puttaswamy, B.Y. Zhao","doi":"10.1109/GI.2007.4301423","DOIUrl":"https://doi.org/10.1109/GI.2007.4301423","url":null,"abstract":"Structured peer-to-peer overlays support compelling applications such as large-scale file systems and distributed backup using the distributed hash table (DHT) interface. While unstructured file-sharing systems continue to flourish, wide adoption of structured applications has been elusive. We explore an alternative path to deployment of these applications by asking the question, can structured applications be run on top of unstructured overlays? We build an unstructured distributed hash table (UDHT) on top of state of the art search and topology management mechanisms, and evaluate whether it can sufficiently emulate properties of DHTs to support structured applications.","PeriodicalId":309919,"journal":{"name":"2007 IEEE Global Internet Symposium","volume":"199 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":"122518527","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":"Importance of IP Alias Resolution in Sampling Internet Topologies","authors":"M. H. Gunes, K. Saraç","doi":"10.1109/GI.2007.4301425","DOIUrl":"https://doi.org/10.1109/GI.2007.4301425","url":null,"abstract":"Internet measurement studies utilize traceroute-based path traces to build representative Internet maps. These maps are then used to analyze various topological characteristics of the Internet. IP alias resolution is an important step in building a map from a set of collected path traces. In this paper, we study the impact of incomplete IP alias resolution on Internet measurement studies. Using a set of synthetic topologies and a genuine topology map, we experimentally show that the accuracy/completeness of alias resolution has an important effect on the observed topological characteristics. The results obtained in this work point out the importance of IP alias resolution and call for further research in alias resolution.","PeriodicalId":309919,"journal":{"name":"2007 IEEE Global Internet Symposium","volume":"5 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113937768","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":"Dynamic Internetworking Based on Late Locator Construction","authors":"A. Eriksson, B. Ohlman","doi":"10.1109/GI.2007.4301433","DOIUrl":"https://doi.org/10.1109/GI.2007.4301433","url":null,"abstract":"The legacy Internet technology is optimized for a semi-static inter-domain topology. Mobility or multihoming is handled by extending the legacy technology with new protocols. This paper describes a novel internetworking architecture with native support for a highly dynamic edge topology. The architecture distinguishes between a rather static core network on the one hand, and on the other hand edge networks forming an edge topology that may change on a short timescale due to mobility or re-homing events. The source host addresses the destination host directly with a hierarchically structured global locator. Indirection via a mobility agent is thus not needed. The name to locator resolution is based on a novel mechanism that constructs a global host locator on-demand that describes the current internetwork path from the core network to the host (late locator construction). This enables the resolution of the host name into a hierarchical and topologically significant host locator also with a highly dynamic edge topology where the path to the destination host traverses several moving and multihomed networks. The same locator construction mechanism is used to handle both node and network mobility as well as multihoming. Simulation results that verify the basic functionality of the late locator construction approach are reported.","PeriodicalId":309919,"journal":{"name":"2007 IEEE Global Internet Symposium","volume":"1 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":"126059294","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":"Inherent Behaviors for On-line Detection of Peer-to-Peer File Sharing","authors":"G. Bartlett, J. Heidemann, C. Papadopoulos","doi":"10.1109/GI.2007.4301431","DOIUrl":"https://doi.org/10.1109/GI.2007.4301431","url":null,"abstract":"Blind techniques to detect network applications-approaches that do not consider packet contents-are increasingly desirable because they have fewer legal and privacy concerns, and they can be robust to application changes and intentional cloaking. In this paper we identify several behaviors that are inherent to peer-to-peer (P2P) traffic and demonstrate that they can detect both BitTorrent and Gnutella hosts using only packet header and timing information. We identify three basic behaviors: failed connections, the ratio of incoming and outgoing connections, and the use of unprivileged ports. We quantify the effectiveness of our approach using two day-long traces, achieve up to an 83% true positive rate with only a 2% false positive rate. Our system is suitable for on-line use, with 75% of new P2P peers detected in less than 10 minutes of trace data.","PeriodicalId":309919,"journal":{"name":"2007 IEEE Global Internet Symposium","volume":"147 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":"114642405","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号
