2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)最新文献

筛选
英文 中文
Software-Based Networks: Leveraging High-Performance NFV Platforms to Meet Future Communication Challenges 基于软件的网络:利用高性能NFV平台应对未来通信挑战
K. Ramakrishnan
{"title":"Software-Based Networks: Leveraging High-Performance NFV Platforms to Meet Future Communication Challenges","authors":"K. Ramakrishnan","doi":"10.1109/ICDCS.2016.112","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.112","url":null,"abstract":"Summary form only given. Communication networks are changing: they are becoming more and more \"software-based.\" The use of network function virtualization (NFV) to run network services in software enables software-defined networks (SDNs) to create a largely software-based network. To truly achieve the vision of a high-performance software-based network that is flexible, lower- cost, and agile, a fast and carefully designed network function virtualization platform along with a comprehensive SDN control plane is needed.Our high-performance NFV platform, OpenNetVM, enables high bandwidth network functions to operate at near line speed, while taking advantage of the flexibility and customization of low cost commodity servers. OpenNetVM exploits Intel's DPDK libraries to minimize the overhead of packet processing, and to provide high throughput, low latency networking in virtualized environments. OpenNetVM allows true zero-copy delivery of data to VMs, both for packet processing and high-speed inter-VM communication through shared huge pages within a trust boundary. We envision a dynamic and flexible network that can support a smarter data plane than just simple switches that forward packets. We build on our OpenNetVM NFV platform by developing our SDNFV network architecture that supports complex stateful routing of flows where processing by network functions (NFs) can dynamically modify the path taken by flows, without unduly burdening the centralized SDN controller. The tutorial will also briefly touch upon the problem of dynamic placement of network functions and routing of flows through a software based network, exploiting a mixture of centralized SDN control and NFV capabilities in the network. The problem can be formulated as a mixed integer linear programming problem, and heuristics can be used to solve the problem incrementally.As a case study, we examine the growing communication needs of 'Internet-of-Things' (IoT). With 'smart' sensing devices becoming ubiquitous, there is a need to support IoT communication at large scale, especially over cellular networks. The use of NFV platforms for the Evolved Packet Core, we see opportunities for supporting IoT communications at large scale in 5G cellular networks. We describe potential solutions in this direction.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126269836","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
Interactive Wireless Charging for Energy Balance 用于能量平衡的交互式无线充电
S. Nikoletseas, Theofanis P. Raptis, C. Raptopoulos
{"title":"Interactive Wireless Charging for Energy Balance","authors":"S. Nikoletseas, Theofanis P. Raptis, C. Raptopoulos","doi":"10.1109/ICDCS.2016.37","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.37","url":null,"abstract":"Wireless energy transfer is an emerging technology that is used in networks of battery-powered devices in order to deliver energy and keep the network functional. Existing state-of-the-art studies have mainly focused on applying this technology on networks of relatively strong computational and communicational capabilities (wireless sensor networks, ad-hoc networks), also they assume one-directional energy transfer from special chargers to the network nodes. Different from these works, we here study (for the first time in the state-of-theart) interactive, \"peer-to-peer\" wireless charging in populations of much more resource-limited, mobile agents that abstract distributed portable devices. In this new model for interactive wireless charging, we assume that the agents are capable of achieving bi-directional wireless energy transfer acting both as energy transmitters and harvesters. We consider the cases of both loss-less and lossy energy transfer and provide an upper bound on the time needed to reach a balanced energy distribution in the population. We investigate the delicate impact of the diversity of energy levels on eventual energy balance achieved and highlight some key elements of the charging procedure. In the light of the above, we design and evaluate three interaction protocols that achieve different tradeoffs between energy balance, time and energy efficiency.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122502542","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
Backlog-Aware SRPT Flow Scheduling in Data Center Networks 数据中心网络中批量感知的SRPT流调度
Tong Zhang, Fengyuan Ren, Ran Shu
{"title":"Backlog-Aware SRPT Flow Scheduling in Data Center Networks","authors":"Tong Zhang, Fengyuan Ren, Ran Shu","doi":"10.1109/ICDCS.2016.26","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.26","url":null,"abstract":"The rapidly developing soft real-time data center applications impose stringent delay requirements on internal data transfers. Therefore many recently emerged network protocols in data center share a common goal of decreasing Flow Completion Time (FCT), in which case the Shortest Remaining Processing Time (SRPT) scheduling discipline has attracted widespread attentions. However, SRPT suffers the instability issue, incurring more and more flows left uncompleted even when traffic load is within network capacity, which implies unnecessary bandwidth waste. To solve the problem, this paper proposes a backlog aware scheduling algorithm (BASRPT) that stabilizes queue length while maintaining relatively low FCT based on Lyapunov optimization. To overcome the huge computational overhead, a fast and practical approximation algorithm called fast BASRPT is also developed. Extensive flow-level simulations show that fast BASRPT indeed stabilizes switch queue and obtains a higher throughput while being able to push FCT arbitrarily close to the optimal value in the condition of feasible traffic load.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132626678","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
Middleware for Proximity Distributed Real-Time Processing of IoT Data Flows 物联网数据流近距离分布式实时处理中间件
Yugo Nakamura, H. Suwa, Yutaka Arakawa, H. Yamaguchi, K. Yasumoto
{"title":"Middleware for Proximity Distributed Real-Time Processing of IoT Data Flows","authors":"Yugo Nakamura, H. Suwa, Yutaka Arakawa, H. Yamaguchi, K. Yasumoto","doi":"10.1109/ICDCS.2016.101","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.101","url":null,"abstract":"EdgeComputing and Fog Computing are new paradigms where data processing is executed in or on the edge of networks to mitigate cloud server load. However, EdgeComputing and Fog Computing still need powerful servers on the edge of networks which impose additional costs for deployments. We proposed a platform called IFoT (Information Flow of Things) that efficiently performs distributed processing as well as distribution and analysis of data streams near their sources based on \"Process On Our Own (PO3)\" concept. In IFoT, processing of tasks for cloud servers is delegated to an ad-hoc distributed system consisting of proximity IoT devices for distributed real-time stream processing. In this demonstration, we show a face recognition system for person tracking developed on top of IFoT middleware which locally processes video streams in real-time and in a distributed manner by using computational resources of IoT devices.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"178 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124744735","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}
引用次数: 7
The Internet is for Porn: Measurement and Analysis of Online Adult Traffic 互联网是色情的:在线成人流量的测量和分析
F. Ahmed, M. Shafiq, A. Liu
{"title":"The Internet is for Porn: Measurement and Analysis of Online Adult Traffic","authors":"F. Ahmed, M. Shafiq, A. Liu","doi":"10.1109/ICDCS.2016.81","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.81","url":null,"abstract":"Adult (or pornographic) websites attract a large number of visitors and account for a substantial fraction of the global Internet traffic. However, little is known about the makeup and characteristics of online adult traffic. In this paper, we present the first large-scale measurement study of online adult traffic using HTTP logs collected from a major commercial content delivery network. Our data set contains approximately 323 terabytes worth of traffic from 80 million users, and includes traffic from several dozen major adult websites and their users in four different continents. We analyze several characteristics of online adult traffic including content and traffic composition, device type composition, temporal dynamics, content popularity, content injection, and user engagement. Our analysis reveals several unique characteristics of online adult traffic. We also analyze implications of our findings on adult content delivery. Our findings suggest several content delivery and cache performance optimizations for adult traffic, e.g., modifications to website design, content delivery, cache placement strategies, and cache storage configurations.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134528226","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}
引用次数: 19
RUSH: A RobUst ScHeduler to Manage Uncertain Completion-Times in Shared Clouds RUSH:在共享云中管理不确定完成时间的健壮调度程序
Zhe Huang, Bharath Balasubramanian, Michael Wang, Tian Lan, M. Chiang, D. Tsang
{"title":"RUSH: A RobUst ScHeduler to Manage Uncertain Completion-Times in Shared Clouds","authors":"Zhe Huang, Bharath Balasubramanian, Michael Wang, Tian Lan, M. Chiang, D. Tsang","doi":"10.1109/ICDCS.2016.95","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.95","url":null,"abstract":"We address the problem of scheduling jobs with utilities that depend solely upon their completion-times in a shared cloud that imposes considerable uncertainty on the jobs' runtime. However, it is very hard to estimate the jobs' runtime in a shared cloud where jobs are often delayed due to reasons such as slow I/O performance and variations in memory availability. Unlike prior works, we acknowledge that runtime estimates are often erroneous and instead shift the burden of robustness to the job scheduler. Specifically, we present a scheduling problem that jointly accounts for: (i) job utilities specified as functions of their completion-time, and (ii) uncertainty in the jobs' runtime. Our proposed solution to this problem achieves lexicographic max-min fairness among the job utilities. We implement this as a robust scheduler, named RUSH, for YARN in Hadoop. Our experiments, using real-world data sets, illustrate RUSH's efficacy when compared with other commonly used schedulers.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114811537","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}
引用次数: 15
Exploiting Causality to Engineer Elastic Distributed Software 利用因果关系设计弹性分布式软件
K. R. Jayaram
{"title":"Exploiting Causality to Engineer Elastic Distributed Software","authors":"K. R. Jayaram","doi":"10.1109/ICDCS.2016.102","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.102","url":null,"abstract":"This goal of this paper is to anchor elasticity in terms of causality in distributed applications. Assuming a large-scale distributed application architected as a set of interacting components, we motivate the need for (1) analyzing causality between interactions, and (2) estimating casual probability that an increase in the frequency of interaction i1 can increase the frequency of interaction i2 caused by i1. We present algorithms to estimate causality and causal probability by combining well known sampling, program analysis, path profiling and dynamic slicing algorithms. We apply our algorithms for causal probability to three large-scale distributed applications, to evaluate (a) their effectiveness in the timely provisioning and de-provisioning of compute resources and (b) whether causality and causal probability present a fundamental and widely-applicable way of engineering auto-elasticity.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121823231","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}
引用次数: 1
CACA: Link-Based Channel Allocation Exploiting Capture Effect for Channel Reuse in Wireless Sensor Networks CACA:基于链路的信道分配,利用捕获效应实现无线传感器网络中的信道复用
J. Jun, Solchan Yeon, Titir Kundu, D. Agrawal, J. Jeong
{"title":"CACA: Link-Based Channel Allocation Exploiting Capture Effect for Channel Reuse in Wireless Sensor Networks","authors":"J. Jun, Solchan Yeon, Titir Kundu, D. Agrawal, J. Jeong","doi":"10.1109/ICDCS.2016.65","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.65","url":null,"abstract":"In this paper, we exploit the capture-effect for channel allocation. We experimentally show the characteristics of capture-effect across different channels, over time, and in different network densities. Then, we introduce CACA, an effective channel assignment protocol for wireless sensor networks. Traditional channel assignment protocols utilize all available channels to minimize interferences between any adjacent links. However, their performances are often not much better than the case of using single channel only. This is mainly due to an assumption that all channels are independent and quality of all channels are similar. However, this is a false assumption. In fact, there are only a few channels that show very good quality at any given time. The CACA avoids this problem by utilizing a few good channels and reuse these channels. When the channels are reused it relies on the capture-effect to ensure at least one of the contending nodes to transmit successfully. Maximizing this capture probability is a main objective of the CACA whenever the channels need to be reused. We evaluate the CACA on a 140-node wireless sensor network testbed and compare its performance with another benchmark protocol. Our results indicate that the CACA can improve the packet reception ratio of every link. As a result of this improvement, end-to-end throughput increases upto 100% in the case of a wireless sensor network with bursty traffic.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121266652","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}
引用次数: 5
Decentralized Context Sharing in Vehicular Delay Tolerant Networks with Compressive Sensing 基于压缩感知的车辆时延容忍网络中的分散上下文共享
Kun Xie, Wang Luo, Xin Wang, Dongliang Xie, Jiannong Cao, Jigang Wen, Gaogang Xie
{"title":"Decentralized Context Sharing in Vehicular Delay Tolerant Networks with Compressive Sensing","authors":"Kun Xie, Wang Luo, Xin Wang, Dongliang Xie, Jiannong Cao, Jigang Wen, Gaogang Xie","doi":"10.1109/ICDCS.2016.83","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.83","url":null,"abstract":"Vehicles equipped with various types of sensors can act as mobile sensors to monitor the road conditions. To speed up the information collection process, the monitoring data can be shared among vehicles upon their encounters to facilitate drivers to find a good route. The vehicular network experiences intermittent connectivity as a result of the mobility, which makes the inter-vehicle contact duration a scarce resource for data transmissions and the support of monitoring applications over vehicular networks a challenge. We propose a novel compressive sensing (CS)-based scheme to enable efficient decentralized context sharing in vehicular delay tolerant networks, called CS-Sharing. To greatly reduce the data transmission overhead and speed up the monitoring processing, CS-sharing exploits two techniques: sending an aggregate message in each vehicle encounter, and quick collection of information taking advantage of data sharing and the sparsity of events in vehicle networks to significantly reduce the number of measurements needed for global information recovery. We propose a novel data structure, and an aggregation method that can take advantage of the random and opportunistic vehicle encounters to form the measurement matrix. We prove that the measurement matrix satisfies the Restricted Isometry Property (RIP) property required by the CS technique. Our results from extensive simulations demonstrate that CS-Sharing allows vehicles in a large network to quickly obtain the full context data with the successful recovery ratio larger than 90%.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114559135","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}
引用次数: 19
Riptide: Jump-Starting Back-Office Connections in Cloud Systems 激流:在云系统中启动后台连接
Marcel Flores, Amir R. Khakpour, H. Bedi
{"title":"Riptide: Jump-Starting Back-Office Connections in Cloud Systems","authors":"Marcel Flores, Amir R. Khakpour, H. Bedi","doi":"10.1109/ICDCS.2016.47","DOIUrl":"https://doi.org/10.1109/ICDCS.2016.47","url":null,"abstract":"Large-scale cloud networks are constantly driven by the need for improved performance in communication between datacenters. Indeed, such back-office communication makes up a large fraction of traffic in many cloud environments. This communication often occurs frequently, carrying control messages, coordination and load balancing information, and customer data. However, ensuring such inter-datacenter traffic is delivered efficiently requires optimizing connections over large physical distances, which is non-trivial. Worse still, many large cloud networks are subject to complex configuration and administrative restrictions, limiting the types of solutions that can be implemented. In this paper, we propose improving the efficiency of datacenter to datacenter communication by learning the congestion level of links in between. We then use this knowledge to inform new connections made between the relevant datacenters, allowing us to eliminate the overhead associated with traditional slow-start processes in new connections. We further present Riptide, a tool which implements this approach. We present the design and implementation details of Riptide, showing that it can be easily executed on modern Linux servers deployed in the real world. We further demonstrate that it successfully reduces total transfer times in a production global-scale content delivery network (CDN), providing up to a 30% decrease in tail latency. We further show that Riptide is simple to deploy and easy to maintain within a complex existing network.","PeriodicalId":260925,"journal":{"name":"2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123351633","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}
引用次数: 4
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书