Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies最新文献_第4页

Non-altering time scales for aggregation of dynamic networks into series of graphs 动态网络聚合成一系列图的非改变时间尺度

Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies Pub Date : 2015-12-01 DOI: 10.1145/2716281.2836114

Yannick Léo, C. Crespelle, E. Fleury

引用次数: 22

Magus: minimizing cellular service disruption during network upgrades Magus:在网络升级期间最大限度地减少蜂窝服务中断

Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies Pub Date : 2015-12-01 DOI: 10.1145/2716281.2836106

Xing Xu, Ioannis Broustis, Zihui Ge, R. Govindan, A. Mahimkar, N. K. Shankaranarayanan, Jia Wang

{"title":"Magus: minimizing cellular service disruption during network upgrades","authors":"Xing Xu, Ioannis Broustis, Zihui Ge, R. Govindan, A. Mahimkar, N. K. Shankaranarayanan, Jia Wang","doi":"10.1145/2716281.2836106","DOIUrl":"https://doi.org/10.1145/2716281.2836106","url":null,"abstract":"Planned upgrades in cellular networks occur every day, may often need to be performed on weekdays, and can potentially degrade service for customers. In this paper, we explore the problem of tuning network configurations in order to mitigate any potential impact due to a planned upgrade which takes the base station off-air. The objective is to recover the loss in service performance or coverage which would have occurred without any modifications. To our knowledge, impact mitigation for planned base station downtimes has not been explored before in the literature. The primary contribution of this work is a proactive approach based on a predictive model that uses operational data of user density distributions and path loss (rather than idealized analytical models of these) to quickly estimate the best power and tilt configuration of neighboring base stations that enables high recovery. A secondary contribution is an approach to minimize synchronized handovers. These ideas, embodied in a capability called Magus, enables us to recover up to 76% of the potential performance loss due to planned upgrades in some cases for a large US mobile network, and this recovery varies as a function of base station density. Moreover, Magus is able to reduce synchronized handovers by a factor of 8.","PeriodicalId":169539,"journal":{"name":"Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129228934","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}

引用次数: 13

Cashing in on caching: on-demand contract design with linear pricing 利用缓存获利:线性定价的按需合约设计

Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies Pub Date : 2015-12-01 DOI: 10.1145/2716281.2836093

Richard T. B. Ma, D. Towsley

{"title":"Cashing in on caching: on-demand contract design with linear pricing","authors":"Richard T. B. Ma, D. Towsley","doi":"10.1145/2716281.2836093","DOIUrl":"https://doi.org/10.1145/2716281.2836093","url":null,"abstract":"There has been increasing interest in designing and developing highly scalable infrastructures to support the efficient distribution of content. This has led to the recent development of content-oriented network architectures that rely on on-demand caching. This paper addresses the question of how a cache provider can monetize its service. Standard cache management policies such as least recently used (LRU) treat different content in a strongly coupled manner that makes it difficult for a cache provider to design individualized contracts. We propose the use of timer-based caching for the purpose of designing contracts, which allow providers to monetize caching. We focus on on-demand request-based contracts that allow content providers (CPs) to negotiate contracts at the time that requests are made. We propose and analyze three variations, one where a contract is negotiated only at the time of a miss, and two where contracts are negotiated at the times of both misses and hits. The latter two differ from one another according to whether pricing is based on cache occupancy (time content spends in the cache) or on request rate. We conclude that the first one is least preferable and that the last one provides the provider greater opportunity for profit and greater flexibility to CPs.","PeriodicalId":169539,"journal":{"name":"Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121787840","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}

引用次数: 31

DiversiFi: robust multi-link interactive streaming 多样化:强大的多链接交互式流媒体

Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies Pub Date : 2015-12-01 DOI: 10.1145/2716281.2836120

Rajat Kateja, Nimantha Thushan Baranasuriya, Vishnu Navda, V. Padmanabhan

{"title":"DiversiFi: robust multi-link interactive streaming","authors":"Rajat Kateja, Nimantha Thushan Baranasuriya, Vishnu Navda, V. Padmanabhan","doi":"10.1145/2716281.2836120","DOIUrl":"https://doi.org/10.1145/2716281.2836120","url":null,"abstract":"Real-time, interactive streaming for applications such as audio-video conferencing (e.g., Skype) and cloud-based gaming depends critically on the network providing low latency, jitter, and packet loss, much more so than on-demand streaming (e.g., YouTube) does. However, WiFi networks pose a challenge; our analysis of data from a large VoIP provider and from our own measurements shows that the WiFi access link is a significant cause of poor streaming experience. To improve streaming quality over WiFi, we present DiversiFi, which takes advantage of the diversity of WiFi links available in the vicinity, even when the individual links are poor. Leveraging such cross-link spatial and channel diversity outperforms both traditional link selection and the temporal diversity arising from retransmissions on the same link. It also provides significant gains over and above the PHY-layer spatial diversity provided by MIMO. Our experimental evaluation shows that, for a client with two NICs, enabling replication across two WiFi links helps cut down the poor call rate (PCR) for VoIP by 2.24x. Finally, we present the design and implementation of DiversiFi, which enables it to operate with single-NIC clients, and with either minimally modified APs or unmodified APs augmented with a middlebox. Over 61 runs, where the baseline average PCR is 4.9%, DiversiFi running with a single NIC, switching between two links, helps cut the PCR down to 0%, while duplicating wastefully only 0.62% of the packets and impacting competing TCP throughput by only 2.5%. Thus, DiversiFi provides the benefit of multi-link diversity for real-time interactive streaming in a manner that is deployable and imposes little overhead, thereby ensuring coexistence with other applications.","PeriodicalId":169539,"journal":{"name":"Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128137014","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}

引用次数: 13

Scheduling techniques for hybrid circuit/packet networks 混合电路/分组网络的调度技术

Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies Pub Date : 2015-12-01 DOI: 10.1145/2716281.2836126

He Liu, Matthew K. Mukerjee, Conglong Li, Nicolas Feltman, G. Papen, S. Savage, S. Seshan, G. Voelker, D. Andersen, M. Kaminsky, G. Porter, A. Snoeren

{"title":"Scheduling techniques for hybrid circuit/packet networks","authors":"He Liu, Matthew K. Mukerjee, Conglong Li, Nicolas Feltman, G. Papen, S. Savage, S. Seshan, G. Voelker, D. Andersen, M. Kaminsky, G. Porter, A. Snoeren","doi":"10.1145/2716281.2836126","DOIUrl":"https://doi.org/10.1145/2716281.2836126","url":null,"abstract":"A range of new datacenter switch designs combine wireless or optical circuit technologies with electrical packet switching to deliver higher performance at lower cost than traditional packet-switched networks. These \"hybrid\" networks schedule large traffic demands via a high-rate circuits and remaining traffic with a lower-rate, traditional packet-switches. Achieving high utilization requires an efficient scheduling algorithm that can compute proper circuit configurations and balance traffic across the switches. Recent proposals, however, provide no such algorithm and rely on an omniscient oracle to compute optimal switch configurations. Finding the right balance of circuit and packet switch use is difficult: circuits must be reconfigured to serve different demands, incurring non-trivial switching delay, while the packet switch is bandwidth constrained. Adapting existing crossbar scheduling algorithms proves challenging with these constraints. In this paper, we formalize the hybrid switching problem, explore the design space of scheduling algorithms, and provide insight on using such algorithms in practice. We propose a heuristic-based algorithm, Solstice that provides a 2.9× increase in circuit utilization over traditional scheduling algorithms, while being within 14% of optimal, at scale.","PeriodicalId":169539,"journal":{"name":"Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130856389","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}

引用次数: 109

An anatomy of mobile web performance over multipath TCP 对多路径TCP上移动web性能的剖析

Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies Pub Date : 2015-12-01 DOI: 10.1145/2716281.2836090

B. Han, Feng Qian, Shuai Hao, Lusheng Ji

引用次数: 65

Scenario-based programming for SDN policies 基于场景的SDN策略编程

Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies Pub Date : 2015-12-01 DOI: 10.1145/2716281.2836119

Yifei Yuan, Dong Lin, R. Alur, B. T. Loo

{"title":"Scenario-based programming for SDN policies","authors":"Yifei Yuan, Dong Lin, R. Alur, B. T. Loo","doi":"10.1145/2716281.2836119","DOIUrl":"https://doi.org/10.1145/2716281.2836119","url":null,"abstract":"Recent emergence of software-defined networks offers an opportunity to design domain-specific programming abstractions aimed at network operators. In this paper, we propose scenario-based programming, a framework that allows network operators to program network policies by describing representative example behaviors. Given these scenarios, our synthesis algorithm automatically infers the controller state that needs to be maintained along with the rules to process network events and update state. We have developed the NetEgg scenario-based programming tool, which can execute the generated policy implementation on top of a centralized controller, but also automatically infers flow-table rules that can be pushed to switches to improve throughput. We study a range of policies considered in the literature and report our experience regarding specifying these policies using scenarios. We evaluate NetEgg based on the computational requirements of our synthesis algorithm as well as the overhead introduced by the generated policy implementation. Our results show that our synthesis algorithm can generate policy implementations in seconds, and the automatically generated policy implementations have performance comparable to their hand-crafted implementations.","PeriodicalId":169539,"journal":{"name":"Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125681108","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}

引用次数: 44

COPA: cooperative power allocation for interfering wireless networks COPA:干扰无线网络的协同功率分配

Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies Pub Date : 2015-12-01 DOI: 10.1145/2716281.2836103

G. Nikolaidis, M. Handley, K. Jamieson, B. Karp

引用次数: 7

Identifying the root cause of video streaming issues on mobile devices 确定移动设备上视频流问题的根本原因

Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies Pub Date : 2015-12-01 DOI: 10.1145/2716281.2836109

G. Dimopoulos, Ilias Leontiadis, P. Barlet-Ros, K. Papagiannaki, P. Steenkiste

{"title":"Identifying the root cause of video streaming issues on mobile devices","authors":"G. Dimopoulos, Ilias Leontiadis, P. Barlet-Ros, K. Papagiannaki, P. Steenkiste","doi":"10.1145/2716281.2836109","DOIUrl":"https://doi.org/10.1145/2716281.2836109","url":null,"abstract":"Video streaming on mobile devices is prone to a multitude of faults and although well established video Quality of Experience (QoE) metrics such as stall frequency are a good indicator of the problems perceived by the user, they do not provide any insights about the nature of the problem nor where it has occurred. Quantifying the correlation between the aforementioned faults and the users' experience is a challenging task due the large number of variables and the numerous points-of-failure. To address this problem, we developed a framework for diagnosing the root cause of mobile video QoE issues with the aid of machine learning. Our solution can take advantage of information collected at multiple vantage points between the video server and the mobile device to pinpoint the source of the problem. Moreover, our design works for different video types (e.g., bitrate, duration, ..) and contexts (e.g., wireless technology, encryption, ..) After training the system with a series of simulated faults in the lab, we analyzed the performance of each vantage point separately and when combined, in controlled and real world deployments. In both cases we find that the involved entities can independently detect QoE issues and that only a few vantage points are required to identify a problem's location and nature.","PeriodicalId":169539,"journal":{"name":"Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128023591","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}

引用次数: 34

Scaling the LTE control-plane for future mobile access 扩展LTE控制平面，面向未来移动接入

Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies Pub Date : 2015-12-01 DOI: 10.1145/2716281.2836104

Arijit Banerjee, R. Mahindra, K. Sundaresan, S. Kasera, K. V. Merwe, S. Rangarajan

{"title":"Scaling the LTE control-plane for future mobile access","authors":"Arijit Banerjee, R. Mahindra, K. Sundaresan, S. Kasera, K. V. Merwe, S. Rangarajan","doi":"10.1145/2716281.2836104","DOIUrl":"https://doi.org/10.1145/2716281.2836104","url":null,"abstract":"In addition to growth of data traffic, mobile networks are bracing for a significant rise in the control-plane signaling. While a complete re-design of the network to overcome inefficiencies may help alleviate the effects of signaling, our goal is to improve the design of the current platform to better manage the signaling. To meet our goal, we combine two key trends. Firstly, mobile operators are keen to transform their networks with the adoption of Network Function Virtualization (NFV) to ensure economies of scales. Secondly, growing popularity of cloud computing has led to advances in distributed systems. In bringing these trends together, we solve several challenges specific to the context of telecom networks. We present SCALE - A framework for effectively virtualizing the MME (Mobility Management Entity), a key control-plane element in LTE. SCALE is fully compatible with the 3GPP protocols, ensuring that it can be readily deployed in today's networks. SCALE enables (i) computational scaling with load and number of devices, and (ii) computational multiplexing across data centers, thereby reducing both, the latencies for control-plane processing, and the VM provisioning costs. Using an LTE prototype implementation and large-scale simulations, we show the efficacy of SCALE.","PeriodicalId":169539,"journal":{"name":"Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128187889","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}

引用次数: 79