Comput. Commun. Rev.最新文献_第10页

Contain-ed: An NFV Micro-Service System for Containing e2e Latency contained -ed:一种包含端到端延迟的NFV微业务系统

Comput. Commun. Rev. Pub Date : 2017-10-25 DOI: 10.1145/3155055.3155064

Amit Sheoran, P. Sharma, S. Fahmy, Vinay Saxena

{"title":"Contain-ed: An NFV Micro-Service System for Containing e2e Latency","authors":"Amit Sheoran, P. Sharma, S. Fahmy, Vinay Saxena","doi":"10.1145/3155055.3155064","DOIUrl":"https://doi.org/10.1145/3155055.3155064","url":null,"abstract":"Network Functions Virtualization (NFV) has enabled operators to dynamically place and allocate resources for network services to match workload requirements. However, unbounded end-to-end (e2e) latency of Service Function Chains (SFCs) resulting from distributed Virtualized Network Function (VNF) deployments can severely degrade performance. In particular, SFC instantiations with inter-data center links can incur high e2e latencies and Service Level Agreement (SLA) violations. These latencies can trigger timeouts and protocol errors with latency-sensitive operations.\u0000 Traditional solutions to reduce e2e latency involve physical deployment of service elements in close proximity. These solutions are, however, no longer viable in the NFV era. In this paper, we present our solution that bounds the e2e latency in SFCs and inter-VNF control message exchanges by creating micro-service aggregates based on the affinity between VNFs. Our system, Contain-ed, dynamically creates and manages affinity aggregates using light-weight virtualization technologies like containers, allowing them to be placed in close proximity and hence bounding the e2e latency. We have applied Contain-ed to the Clearwater IP Multimedia Subsystem and built a proof-of-concept. Our results demonstrate that, by utilizing application and protocol specific knowledge, affinity aggregates can effectively bound SFC delays and significantly reduce protocol errors and service disruptions.","PeriodicalId":403234,"journal":{"name":"Comput. Commun. Rev.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125659278","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}

引用次数: 3

Perceived Performance of Top Retail Webpages In the Wild 在野外顶级零售网页的感知性能

Comput. Commun. Rev. Pub Date : 2017-10-25 DOI: 10.1145/3155055.3155062

Qingzhu Gao, Prasenjit Dey, P. Ahammad

{"title":"Perceived Performance of Top Retail Webpages In the Wild","authors":"Qingzhu Gao, Prasenjit Dey, P. Ahammad","doi":"10.1145/3155055.3155062","DOIUrl":"https://doi.org/10.1145/3155055.3155062","url":null,"abstract":"Clearly, no one likes webpages with poor quality of experience (QoE). Being perceived as slow or fast is a key element in the overall perceived QoE of web applications. While extensive effort has been put into optimizing web applications (both in industry and academia), not a lot of work exists in characterizing what aspects of webpage loading process truly influence human end-user's perception of the emph{Speed} of a page. In this paper we present emph{SpeedPerception}, a large-scale web performance crowdsourcing framework focused on understanding the perceived loading performance of above-the-fold (ATF) webpage content. Our end goal is to create free open-source benchmarking datasets to advance the systematic analysis of how humans perceive webpage loading process.\u0000 In Phase-1 of our emph{SpeedPerception} study using Internet Retailer Top 500 (IR 500) websites, we found that commonly used navigation metrics such as emph{onLoad} and emph{Time To First Byte (TTFB)} fail (less than 60% match) to represent majority human perception when comparing the speed of two webpages. We present a simple 3-variable-based machine learning model that explains the majority end-user choices better (with $87 pm 2%$ accuracy). In addition, our results suggest that the time needed by end-users to evaluate relative perceived speed of webpage is far less than the time of its emph{visualComplete} event.","PeriodicalId":403234,"journal":{"name":"Comput. Commun. Rev.","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123231599","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

Dissecting Last-mile Latency Characteristics 剖析最后一英里延迟特性

Comput. Commun. Rev. Pub Date : 2017-10-25 DOI: 10.1145/3155055.3155059

Vaibhav Bajpai, Steffie Jacob Eravuchira, J. Schönwälder

{"title":"Dissecting Last-mile Latency Characteristics","authors":"Vaibhav Bajpai, Steffie Jacob Eravuchira, J. Schönwälder","doi":"10.1145/3155055.3155059","DOIUrl":"https://doi.org/10.1145/3155055.3155059","url":null,"abstract":"Recent research has shown that last-mile latency is a key network performance indicator that contributes heavily to DNS lookup and page load times. Using a month-long dataset collected from 696 residential RIPE Atlas probes and 1245 SamKnows probes, we measure last-mile latencies from 19 ISPs (RIPE Atlas) in the US and the EU, and 9 ISPs (SamKnows) in the UK. We show that DSL deployments not only tend to enable interleaving on the last-mile, but also employ multiple depth levels that change over time. We also witness that last-mile latency is considerably stable over time and not affected by diurnal load patterns. Unlike observations from prior studies, we show that cable providers in the US do not generally exhibit lower last-mile latencies when compared to that of DSL. We instead identify that last-mile latencies vary by subscriber location and show that last-mile latencies of cable providers in the US are considerably different across the US east and west coast. We further show that last-mile latencies vary depending on the access technology used by the DSL modem wherein VDSL deployments show last-mile latencies lower than ADSL1/ADSL2+ broadband speeds. The entire dataset and software used in this study is made available to the measurement community.","PeriodicalId":403234,"journal":{"name":"Comput. Commun. Rev.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122295077","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}

引用次数: 21

The October 2017 Issue 2017年10月号

Comput. Commun. Rev. Pub Date : 2017-10-25 DOI: 10.1145/3155055.3155056

O. Bonaventure

引用次数: 0

Report on Networking and Programming Languages 2017 2017年网络和编程语言报告

Comput. Commun. Rev. Pub Date : 2017-10-25 DOI: 10.1145/3155055.3155061

N. Bjørner, M. Canini, Nik Sultana

{"title":"Report on Networking and Programming Languages 2017","authors":"N. Bjørner, M. Canini, Nik Sultana","doi":"10.1145/3155055.3155061","DOIUrl":"https://doi.org/10.1145/3155055.3155061","url":null,"abstract":"The third workshop on Networking and Programming Languages, NetPL 2017, was held in conjunction with SIGCOMM 2017. The workshop series attracts invited speakers from academia and industry and a selection of contributed abstracts for short presentations. NetPL brings together researchers from the networking community and researchers from the programming languages and verification communities. The workshop series is a timely forum for exciting trends, technological and scientific advances in the intersection of these communities. We describe some of the highlights from the invited talks through the lens of three trends: Advances in network machine architectures, network programming abstractions, and network verification. NetPL included five invited speakers, four from academia, and one from industry. The program contained six contributed papers out of eight submitted for presentation. The workshop organizers reviewed the abstracts for quality and scope. A total of 42 registrations were received and the attendance occupied the lecture room to the brink. Slides and abstracts from all talks are available from the workshop home page: http://conferences.sigcomm.org/sigcomm/2017/workshop-netpl.html. Videos of the presentations are available in the NetPL YouTube channel: https://www.youtube.com/channel/UCqU8E2n4MHthZUVb1xK2nRQ.","PeriodicalId":403234,"journal":{"name":"Comput. Commun. Rev.","volume":"2015 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128944715","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}

引用次数: 2

Inside the Walled Garden: Deconstructing Facebook's Free Basics Program Inside the Walled Garden:解构Facebook的免费基础项目

Comput. Commun. Rev. Pub Date : 2017-10-25 DOI: 10.1145/3155055.3155058

Rijurekha Sen, Sohaib Ahmad, A. Phokeer, Z. Farooq, I. Qazi, D. Choffnes, K. Gummadi

{"title":"Inside the Walled Garden: Deconstructing Facebook's Free Basics Program","authors":"Rijurekha Sen, Sohaib Ahmad, A. Phokeer, Z. Farooq, I. Qazi, D. Choffnes, K. Gummadi","doi":"10.1145/3155055.3155058","DOIUrl":"https://doi.org/10.1145/3155055.3155058","url":null,"abstract":"Free Basics is a Facebook initiative to provide zero-rated web services in developing countries. The program has grown rapidly to 60+ countries in the past two years. But it has also seen strong opposition from Internet activists and has been banned in some countries like India. Facebook highlights the societal benefits of providing low-income populations with free Internet access, while detractors point to concerns about privacy and network neutrality.\u0000 In this paper, we provide the first independent analysis of such claims regarding the Free Basics service, using both the perspective of a Free Basics service provider and of web clients visiting the service via cellular phones providing access to Free Basics in Pakistan and South Africa.\u0000 Specifically, with control of both endpoints, we not only provide a more detailed view of how the Free Basics service is architected, but also can isolate the likely causes of network performance impairments. Our analysis reveals that Free Basics services experience 4 to 12 times worse network performance than their paid counterparts. We isolate the root causes using factors such as network path inflation and throttling policies by Facebook and telecom service providers.\u0000 The Free Basics service and its restrictions are designed with assumptions about users' device capabilities (e.g., lack of JavaScript support). To evaluate such assumptions, we infer the types of mobile devices that generated 47K unique visitors to our Free Basics services between Sep 2016 and Jan 2017. We find that there are large numbers of requests from constrained WAP browsers, but also large fractions of high-capability mobile phones that send Free Basics requests.\u0000 We discuss the implications of our observations, with the hope to aid more informed debates on such telecom policies.","PeriodicalId":403234,"journal":{"name":"Comput. Commun. Rev.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122254796","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}

引用次数: 27

Wi-Stitch: Content Delivery in Converged Edge Networks Wi-Stitch:融合边缘网络中的内容交付

Comput. Commun. Rev. Pub Date : 2017-08-09 DOI: 10.1145/3155055.3155067

Aravindh Raman, Nishanth R. Sastry, A. Sathiaseelan, Jigna Chandaria, Andrew Secker

引用次数: 19

Towards a Rigorous Methodology for Measuring Adoption of RPKI Route Validation and Filtering 一种衡量RPKI路由验证和过滤采用情况的严谨方法

Comput. Commun. Rev. Pub Date : 2017-06-13 DOI: 10.1145/3211852.3211856

A. Reuter, R. Bush, Ítalo F. S. Cunha, Ethan Katz-Bassett, T. Schmidt, Matthias Wählisch

{"title":"Towards a Rigorous Methodology for Measuring Adoption of RPKI Route Validation and Filtering","authors":"A. Reuter, R. Bush, Ítalo F. S. Cunha, Ethan Katz-Bassett, T. Schmidt, Matthias Wählisch","doi":"10.1145/3211852.3211856","DOIUrl":"https://doi.org/10.1145/3211852.3211856","url":null,"abstract":"A proposal to improve routing security---Route Origin Authorization (ROA)---has been standardized. A ROA specifies which network is allowed to announce a set of Internet destinations. While some networks now specify ROAs, little is known about whether other networks check routes they receive against these ROAs, a process known as Route Origin Validation (ROV). Which networks blindly accept invalid routes? Which reject them outright? Which de-preference them if alternatives exist?\u0000 Recent analysis attempts to use uncontrolled experiments to characterize ROV adoption by comparing valid routes and invalid routes. However, we argue that gaining a solid understanding of ROV adoption is impossible using currently available data sets and techniques. Instead, we devise a verifiable methodology of controlled experiments for measuring ROV. Our measurements suggest that, although some ISPs are not observed using invalid routes in uncontrolled experiments, they are actually using different routes for (non-security) traffic engineering purposes, without performing ROV. We conclude with presenting three AS that do implement ROV as confirmed by the operators.","PeriodicalId":403234,"journal":{"name":"Comput. Commun. Rev.","volume":"15 10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126070754","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}

引用次数: 51

A Techno-Economic Approach for Broadband Deployment in Underserved Areas 在服务不足地区部署宽带的技术经济方法

Comput. Commun. Rev. Pub Date : 2017-05-02 DOI: 10.1145/3089262.3089265

Ramakrishnan Durairajan, P. Barford

引用次数: 11

2016 International Teletraffic Congress (ITC 28) Report 2016国际电信通信大会(ITC 28)报告

Comput. Commun. Rev. Pub Date : 2017-05-02 DOI: 10.1145/3089262.3089268

T. Hossfeld

引用次数: 0