ACM/SIGCOMM Internet Measurement Conference最新文献

Going viral: flash crowds in an open CDN 病毒式传播:开放CDN中的快闪人群

ACM/SIGCOMM Internet Measurement Conference Pub Date : 2011-11-02 DOI: 10.1145/2068816.2068867

Patrick Wendell, M. Freedman

引用次数: 88

Understanding and characterizing PlanetLab resource usage for federated network testbeds 了解和描述联合网络试验台的PlanetLab资源使用情况

ACM/SIGCOMM Internet Measurement Conference Pub Date : 2011-11-02 DOI: 10.1145/2068816.2068864

Wonho Kim, Ajay Roopakalu, Katherine Y. Li, Vivek S. Pai

{"title":"Understanding and characterizing PlanetLab resource usage for federated network testbeds","authors":"Wonho Kim, Ajay Roopakalu, Katherine Y. Li, Vivek S. Pai","doi":"10.1145/2068816.2068864","DOIUrl":"https://doi.org/10.1145/2068816.2068864","url":null,"abstract":"Global network testbeds are crucial for innovative network research. Built on the success of PlanetLab, the next generation of federated testbeds are under active development, but very little is known about resource usage in the shared infrastructures. In this paper, we conduct an extensive study of the usage profiles in PlanetLab that we collected for six years by running CoMon, a PlanetLab monitoring service. We examine various aspects of node-level behavior as well as experiment-centric behavior, and describe their implications for resource management in the federated testbeds. Our main contributions are threefold: (1) Contrary to common belief, our measurements show there is no tragedy of the commons in PlanetLab, since most PlanetLab experiments exploit the system's network reach more than just its hardware resources; (2) We examine resource allocation systems proposed for the federated testbeds, such as bartering and central banking schemes, and show that they would handle only a small percentage of the total usage in PlanetLab; and (3) Lastly, we identify factors that account for high resource contention or poor utilization in PlanetLab nodes. We analyze workload imbalance and problematic slices in PlanetLab, and describe the implications of our measurements for improving overall utility of the testbed.","PeriodicalId":287661,"journal":{"name":"ACM/SIGCOMM Internet Measurement Conference","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123798641","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}

引用次数: 22

Proportional rate reduction for TCP TCP的比例速率降低

ACM/SIGCOMM Internet Measurement Conference Pub Date : 2011-11-02 DOI: 10.1145/2068816.2068832

Nandita Dukkipati, M. Mathis, Yuchung Cheng, Monia Ghobadi

{"title":"Proportional rate reduction for TCP","authors":"Nandita Dukkipati, M. Mathis, Yuchung Cheng, Monia Ghobadi","doi":"10.1145/2068816.2068832","DOIUrl":"https://doi.org/10.1145/2068816.2068832","url":null,"abstract":"Packet losses increase latency for Web users. Fast recovery is a key mechanism for TCP to recover from packet losses. In this paper, we explore some of the weaknesses of the standard algorithm described in RFC 3517 and the non-standard algorithms implemented in Linux. We find that these algorithms deviate from their intended behavior in the real world due to the combined effect of short flows, application stalls, burst losses, acknowledgment (ACK) loss and reordering, and stretch ACKs. Linux suffers from excessive congestion window reductions while RFC 3517 transmits large bursts under high losses, both of which harm the rest of the flow and increase Web latency.\u0000 Our primary contribution is a new design to control transmission in fast recovery called proportional rate reduction (PRR). PRR recovers from losses quickly, smoothly and accurately by pacing out retransmissions across received ACKs. In addition to PRR, we evaluate the TCP early retransmit (ER) algorithm which lowers the duplicate acknowledgment threshold for short transfers, and show that delaying early retransmissions for a short interval is effective in avoiding spurious retransmissions in the presence of a small degree of reordering. PRR and ER reduce the TCP latency of connections experiencing losses by 3-10% depending on the response size. Based on our instrumentation on Google Web and YouTube servers in U.S. and India, we also present key statistics on the nature of TCP retransmissions.","PeriodicalId":287661,"journal":{"name":"ACM/SIGCOMM Internet Measurement Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125443794","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}

引用次数: 83

The SSL landscape: a thorough analysis of the x.509 PKI using active and passive measurements SSL前景:对x.509的全面分析PKI采用主动和被动测量

ACM/SIGCOMM Internet Measurement Conference Pub Date : 2011-11-02 DOI: 10.1145/2068816.2068856

Ralph Holz, L. Braun, Nils Kammenhuber, G. Carle

{"title":"The SSL landscape: a thorough analysis of the x.509 PKI using active and passive measurements","authors":"Ralph Holz, L. Braun, Nils Kammenhuber, G. Carle","doi":"10.1145/2068816.2068856","DOIUrl":"https://doi.org/10.1145/2068816.2068856","url":null,"abstract":"The SSL and TLS infrastructure used in important protocols like HTTPs and IMAPs is built on an X.509 public-key infrastructure (PKI). X.509 certificates are thus used to authenticate services like online banking, shopping, e-mail, etc. However, it always has been felt that the certification processes of this PKI may lack in stringency, resulting in a deployment where many certificates do not meet the requirements of a secure PKI.\u0000 This paper presents a comprehensive analysis of X.509 certificates in the wild. To shed more light on the state of the deployed and actually used X.509 PKI, we obtained and evaluated data from many different sources. We conducted HTTPs scans of a large number of popular HTTPs servers over a 1.5-year time span, including scans from nine locations distributed over the globe. To compare certification properties of highly ranked hosts with the global picture, we included a third-party scan of the entire IPv4 space in our analyses. Furthermore, we monitored live SSL/TLS traffic on a 10Gbps uplink of a large research network. This allows us to compare the properties of the deployed PKI with the part of the PKI that is being actively accessed by users.\u0000 Our analysis reveals that the quality of certification lacks in stringency, due to a number of reasons among which incorrect certification chains or invalid certificate subjects give the most cause for concern. Similar concerns can be raised for the properties of certification chains and many self-signed certificates used in the deployed X.509 PKI. Our findings confirm what has long been believed -- namely that the X.509 PKI we often use in our everyday's lives is in a sorry state.","PeriodicalId":287661,"journal":{"name":"ACM/SIGCOMM Internet Measurement Conference","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133921185","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}

引用次数: 210

Is it still possible to extend TCP? 是否还有可能扩展TCP?

ACM/SIGCOMM Internet Measurement Conference Pub Date : 2011-11-02 DOI: 10.1145/2068816.2068834

Michio Honda, Y. Nishida, C. Raiciu, A. Greenhalgh, M. Handley, H. Tokuda

{"title":"Is it still possible to extend TCP?","authors":"Michio Honda, Y. Nishida, C. Raiciu, A. Greenhalgh, M. Handley, H. Tokuda","doi":"10.1145/2068816.2068834","DOIUrl":"https://doi.org/10.1145/2068816.2068834","url":null,"abstract":"We've known for a while that the Internet has ossified as a result of the race to optimize existing applications or enhance security. NATs, performance-enhancing-proxies,firewalls and traffic normalizers are only a few of the middleboxes that are deployed in the network and look beyond the IP header to do their job. IP itself can't be extended because \"IP options are not an option\". Is the same true for TCP?\u0000 In this paper we develop a measurement methodology for evaluating middlebox behavior relating to TCP extensions and present the results of measurements conducted from multiple vantage points. The short answer is that we can still extend TCP, but extensions' design is very constrained as it needs to take into account prevalent middlebox behaviors. For instance, absolute sequence numbers cannot be embedded in options, as middleboxes can rewrite ISN and preserve undefined options. Sequence numbering also must be consistent for a TCP connection, because many middleboxes only allow through contiguous flows.\u0000 We used these findings to analyze three proposed extensions to TCP. We find that MPTCP is likely to work correctly in the Internet or fallback to regular TCP. TcpCrypt seems ready to be deployed, however it is fragile if resegmentation does happen---for instance with hardware offload. Finally, TCP extended options in its current form is not safe to deploy.","PeriodicalId":287661,"journal":{"name":"ACM/SIGCOMM Internet Measurement Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127249013","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}

引用次数: 281

GQ: practical containment for measuring modern malware systems GQ:测量现代恶意软件系统的实用容器

ACM/SIGCOMM Internet Measurement Conference Pub Date : 2011-11-02 DOI: 10.1145/2068816.2068854

C. Kreibich, N. Weaver, Chris Kanich, Weidong Cui, V. Paxson

引用次数: 62

On the prevalence and characteristics of MPLS deployments in the open internet 论开放互联网中MPLS部署的流行和特点

ACM/SIGCOMM Internet Measurement Conference Pub Date : 2011-11-02 DOI: 10.1145/2068816.2068858

J. Sommers, P. Barford, Brian Eriksson

{"title":"On the prevalence and characteristics of MPLS deployments in the open internet","authors":"J. Sommers, P. Barford, Brian Eriksson","doi":"10.1145/2068816.2068858","DOIUrl":"https://doi.org/10.1145/2068816.2068858","url":null,"abstract":"Multi-Protocol Label Switching (MPLS) is a mechanism that enables service providers to specify virtual paths through IP networks. The use of MPLS in the open Internet (i.e., public end-to-end paths) has important implications for users and network neutrality since MPLS is frequently used in traffic engineering applications today. In this paper we present a longitudinal study of the prevalence and characteristics of MPLS deployments in the open Internet. We use path measurement data collected over the past 3.5 years by the CAIDA Archipelago project (Ark), which consist of over 10 billion individual traceroutes between hosts throughout the Internet. We use two different techniques for identifying MPLS paths in Ark data: direct observation via ICMP extensions that include MPLS label information, and inference using a Bayesian data fusion methodology. Our direct observation method can only identify uniform-mode tunnels, which very likely underestimates MPLS deployments. Nonetheless, our results show that the total number of tunnels observed in a given measurement period has varied widely over time with the largest deployments in tier-1 providers. About 7% of all autonomous systems deploy MPLS and this level of deployment has been consistent over the past three years. The average length of an MPLS tunnel has decreased from 4 hops in 2008 to 3 hops in 2011, and the path length distribution is heavily skewed. About 25% of all paths in 2011 cross at least one MPLS tunnel, while 4% cross more than one. Finally, data observed in MPLS headers suggest that many ASes employ some types of traffic classification and engineering in their tunnels.","PeriodicalId":287661,"journal":{"name":"ACM/SIGCOMM Internet Measurement Conference","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130059994","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}

引用次数: 38

Pingin' in the rain 在雨中叮当作响

ACM/SIGCOMM Internet Measurement Conference Pub Date : 2011-11-02 DOI: 10.1145/2068816.2068819

Aaron Schulman, N. Spring

{"title":"Pingin' in the rain","authors":"Aaron Schulman, N. Spring","doi":"10.1145/2068816.2068819","DOIUrl":"https://doi.org/10.1145/2068816.2068819","url":null,"abstract":"Residential Internet connections are susceptible to weather-caused outages: Lightning and wind cause local power failures, direct lightning strikes destroy equipment, and water in the atmosphere degrades satellite links. Outages caused by severe events such as fires and undersea cable cuts are often reported upon by operators and studied by researchers. In contrast, outages cause by ordinary weather are typically limited in scope, and because of their small scale, there has not been comparable effort to understand how weather affects everyday last-mile Internet connectivity. We design and deploy a measurement tool called ThunderPing that measures the connectivity of residential Inter- net hosts before, during, and after forecast periods of severe weather. ThunderPing uses weather alerts from the US National Weather Service to choose a set of residential host addresses to ping from several vantage points on the Internet. We then process this ping data to determine when hosts lose connectivity, completely or partially, and categorize whether these failures occur during periods of severe weather or when the skies are clear. In our preliminary results, we find that compared to clear weather, failures are four times as likely during thunderstorms and two times as likely during rain. We also find that the duration of weather induced outages is relatively small for a satellite provider we focused on.","PeriodicalId":287661,"journal":{"name":"ACM/SIGCOMM Internet Measurement Conference","volume":"238 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122498570","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}

引用次数: 88

Measurement and evaluation of a real world deployment of a challenge-response spam filter 对挑战-响应垃圾邮件过滤器的实际部署进行测量和评估

ACM/SIGCOMM Internet Measurement Conference Pub Date : 2011-11-02 DOI: 10.1145/2068816.2068855

Jelena Isacenkova, D. Balzarotti

{"title":"Measurement and evaluation of a real world deployment of a challenge-response spam filter","authors":"Jelena Isacenkova, D. Balzarotti","doi":"10.1145/2068816.2068855","DOIUrl":"https://doi.org/10.1145/2068816.2068855","url":null,"abstract":"Despite the number of existing solutions, spam still accounts for a large percentage of the email traffic on the Internet. Both the effectiveness and the impact of many common anti-spam techniques have already been largely studied and evaluated against multiple datasets. However, some of the less known solutions still lack a proper experimental validation. For example, Challenge-Response (CR) systems have been largely discussed, and often criticized, because they shift the effort to protect the user's mailbox from the recipient to the sender of the messages. In addition, these systems are believed to produce a lot of backscattered emails that further deteriorate the global Internet situation.\u0000 In this paper we present the first comprehensive measurement study of a real anti-spam system based on a challenge-response technique. In our work we analyze a large amount of data, collected for a period of six months from over forty companies protected by a commercial challenge-response product. We designed our experiments from three different point of views: the end user, the system administrator, and the entire Internet community. Our results cover many different aspects such as the amount of challenges sent, the delay on the message delivery, and the likelihood of getting the challenge server blacklisted.\u0000 Our aim is neither to attack nor to defend CR-based solutions. Instead, we hope that our findings will shed some light on some of the myths about these kind of systems, and will help both users and companies to take an informed decision on the topic.","PeriodicalId":287661,"journal":{"name":"ACM/SIGCOMM Internet Measurement Conference","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122676260","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}

引用次数: 10

ShaperProbe: end-to-end detection of ISP traffic shaping using active methods ShaperProbe:使用主动方式对ISP流量整形进行端到端检测

ACM/SIGCOMM Internet Measurement Conference Pub Date : 2011-11-02 DOI: 10.1145/2068816.2068860

Partha Kanuparthy, C. Dovrolis

引用次数: 71