2015 IEEE 35th International Conference on Distributed Computing Systems最新文献_第6页

An Efficient Anonymous Authentication Protocol for RFID Systems Using Dynamic Tokens 基于动态令牌的RFID系统高效匿名认证协议

2015 IEEE 35th International Conference on Distributed Computing Systems Pub Date : 2015-06-01 DOI: 10.1109/ICDCS.2015.94

Min Chen, Shigang Chen

引用次数: 19

An Application-Aware Scheduling Policy for Real-Time Traffic 基于应用的实时流量调度策略

2015 IEEE 35th International Conference on Distributed Computing Systems Pub Date : 2015-06-01 DOI: 10.1109/ICDCS.2015.50

Xu Zheng, Zhipeng Cai, Jianzhong Li, Hong Gao

引用次数: 39

Community-Based Bus System as Routing Backbone for Vehicular Ad Hoc Networks 基于社区的总线系统作为车辆自组织网络的路由骨干

2015 IEEE 35th International Conference on Distributed Computing Systems Pub Date : 2015-06-01 DOI: 10.1109/ICDCS.2015.16

Fusang Zhang, Hai Liu, Y. Leung, Xiaowen Chu, Beihong Jin

{"title":"Community-Based Bus System as Routing Backbone for Vehicular Ad Hoc Networks","authors":"Fusang Zhang, Hai Liu, Y. Leung, Xiaowen Chu, Beihong Jin","doi":"10.1109/ICDCS.2015.16","DOIUrl":"https://doi.org/10.1109/ICDCS.2015.16","url":null,"abstract":"Low delivery latency and high delivery ratio are two key goals in the design of routing schemes in Vehicular Ad Hoc Networks (VANETs). The existing routing schemes utilize real-time information (e.g., Geographical position and vehicle density) and historical information (e.g., Contacts of vehicles), which usually suffer from a long delivery latency and a low delivery ratio. Inspired by the unique features of bus systems such as wide coverage, fixed routes and regular service, we propose to use the bus systems as routing backbones of VANETs. In this work, we present a Community-based Bus System (CBS) which consists of two components: a community-based backbone and a routing scheme over the backbone. We collect real traces of 2515 buses in Beijing and build a community-based backbone by applying community detection techniques in the Beijing bus system. A two-level routing scheme is proposed to operate over the backbone. The proposed routing scheme performs sequentially in the inter-community level and the intra-community level, and is able to support message delivery to both mobile vehicles and specific locations/areas. Extensive experiments are conducted on the real trace data of the Beijing bus system and the results show that CBS can significantly lower the delivery latency and improve the delivery ratio. CBS is applicable to any bus-based VANETs.","PeriodicalId":129182,"journal":{"name":"2015 IEEE 35th International Conference on Distributed Computing Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126313275","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}

引用次数: 9

PTZ Camera Scheduling for Selected Area Coverage in Visual Sensor Networks 视觉传感器网络中选定区域覆盖的PTZ摄像机调度

2015 IEEE 35th International Conference on Distributed Computing Systems Pub Date : 2015-06-01 DOI: 10.1109/ICDCS.2015.46

Ling Guo, Yuqing Zhu, Deying Li, Donghyun Kim

引用次数: 3

Data Center Sprinting: Enabling Computational Sprinting at the Data Center Level 数据中心冲刺:在数据中心级别实现计算冲刺

2015 IEEE 35th International Conference on Distributed Computing Systems Pub Date : 2015-06-01 DOI: 10.1109/ICDCS.2015.26

Wenli Zheng, Xiaorui Wang

{"title":"Data Center Sprinting: Enabling Computational Sprinting at the Data Center Level","authors":"Wenli Zheng, Xiaorui Wang","doi":"10.1109/ICDCS.2015.26","DOIUrl":"https://doi.org/10.1109/ICDCS.2015.26","url":null,"abstract":"Microprocessors may need to keep most of their cores off in the era of dark silicon due to thermal constraints. Recent studies have proposed Computational Sprinting, which allows a chip to temporarily exceed its power and thermal limits by turning on all its cores for a short time period, such that its computing performance is boosted for bursty computation demands. However, conducting sprinting in a data center faces new challenges due to power and thermal constraints at the data center level, which are exacerbated by recently proposed power infrastructure under-provisioning and reliance on renewable energy, as well as the increasing server density. In this paper, we propose Data Center Sprinting, a methodology that enables a data center to temporarily boost its computing performance by turning on more cores in the era of dark silicon, in order to handle occasional workload bursts. We demonstrate the feasibility of this approach by analyzing the tripping characteristics of data center circuit breakers and the discharging characteristics of energy storage devices, in order to realize safe sprinting without causing undesired server overheating or shutdown. We evaluate a prototype of Data Center Sprinting on a hardware testbed and in data enter-level simulations. The experimental results show that our solution can improve the average computing performance of a data center by a factor of 1.62 to 2.45 for 5 to 30 minutes.","PeriodicalId":129182,"journal":{"name":"2015 IEEE 35th International Conference on Distributed Computing Systems","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121732359","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}

引用次数: 29

Piros: Pushing the Limits of Partially Concurrent Transmission in WiFi Networks Piros:推动WiFi网络部分并发传输的极限

2015 IEEE 35th International Conference on Distributed Computing Systems Pub Date : 2015-06-01 DOI: 10.1109/ICDCS.2015.103

Lu Wang, Xiaoke Qi, Jiang Xiao, Kaishun Wu, Jin Zhang, M. Hamdi, Qian Zhang

引用次数: 2

Aurora: Adaptive Block Replication in Distributed File Systems Aurora:分布式文件系统中的自适应块复制

2015 IEEE 35th International Conference on Distributed Computing Systems Pub Date : 2015-06-01 DOI: 10.1109/ICDCS.2015.52

Qi Zhang, S. Zhang, A. Leon-Garcia, R. Boutaba

{"title":"Aurora: Adaptive Block Replication in Distributed File Systems","authors":"Qi Zhang, S. Zhang, A. Leon-Garcia, R. Boutaba","doi":"10.1109/ICDCS.2015.52","DOIUrl":"https://doi.org/10.1109/ICDCS.2015.52","url":null,"abstract":"Distributed file systems such as Google File System and Hadoop Distributed File System have been used to store large volumes of data in Cloud data centers. These systems divide data sets in blocks of fixed size and replicate them over multiple machines to achieve both reliability and efficiency. Recent studies have shown that data blocks tend to have a wide disparity in data popularity. In this context, the naive block replication schemes used by these systems often cause an uneven load distribution across machines, which reduces the overall I/O throughput of the system. While many replication algorithms have been proposed, existing solutions have not carefully studied the placement of data blocks that balances the load across machines, while ensuring node and rack-level reliability requirements are satisfied. In this paper, we study the dynamic data replication problem with the goal of balancing machine load while ensuring machine and rack-level reliability requirements are met. We propose several local search algorithms that provide constant approximation guarantees, yet simple and practical for implementation. We further present Aurora, a dynamic block placement mechanism that implements these algorithms in the Hadoop Distributed File System with minimal overhead. Through experiments using workload traces from Yahoo! and Facebook, we show Aurora reduces machine load imbalance by up to 26.9% compared to existing solutions, while satisfying node and rack-level reliability requirements.","PeriodicalId":129182,"journal":{"name":"2015 IEEE 35th International Conference on Distributed Computing Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120948842","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}

引用次数: 14

Weighted Restless Bandit and Its Applications 加权不宁土匪及其应用

2015 IEEE 35th International Conference on Distributed Computing Systems Pub Date : 2015-06-01 DOI: 10.1109/ICDCS.2015.58

P. Wan, Xiaohua Xu

{"title":"Weighted Restless Bandit and Its Applications","authors":"P. Wan, Xiaohua Xu","doi":"10.1109/ICDCS.2015.58","DOIUrl":"https://doi.org/10.1109/ICDCS.2015.58","url":null,"abstract":"Motivated by many applications such as cognitive radio spectrum scheduling, downlink fading channel scheduling, and unmanned aerial vehicle dynamic routing, we study two restless bandit problems. Given a bandit consisting of multiple restless arms, the state of each arm evolves as a Markov chain. Assume each arm is associated with a positive weight. At each step, we select a subset of arms to play such that the weighted sum of the selected arms cannot exceed a limit. The reward of playing each arm varies according to the arm's state. The exact state of each arm is only revealed when the arm is played. The problem weighted restless bandit aims to maximize the expected average reward over the infinite horizon. We also study an extended problem called multiply-constrained restless bandit where each time there are two simultaneous constraints on the selected arms. First, the weighted sum of the selected arms cannot exceed a limit, Second, the number of the selected arms is at most a constant K. The objective of multiply-constrained restless bandit is to maximize the long term average reward. Both problems are partially observable Markov decision processes and have been proved to be PSPACE-hard even in their special cases. We propose constant approximation algorithms for both problems. Our method involves solving a semi-infinite program, converting back to a low-complexity policy, and accounting for the average reward via a Lyapunov function analysis.","PeriodicalId":129182,"journal":{"name":"2015 IEEE 35th International Conference on Distributed Computing Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122537461","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

Prebaked µVMs: Scalable, Instant VM Startup for IaaS Clouds 预焙微虚拟机:可扩展，IaaS云的即时虚拟机启动

2015 IEEE 35th International Conference on Distributed Computing Systems Pub Date : 2015-06-01 DOI: 10.1109/ICDCS.2015.33

Kaveh Razavi, Gerrit Van Der Kolk, T. Kielmann

引用次数: 23

TAFTA: A Truthful Auction Framework for User Data Allowance Trading in Mobile Networks TAFTA:移动网络中用户数据限额交易的真实拍卖框架

2015 IEEE 35th International Conference on Distributed Computing Systems Pub Date : 2015-06-01 DOI: 10.1109/ICDCS.2015.118

Zhongxing Ming, Mingwei Xu, Ning Wang, Bingjie Gao, Qi Li

引用次数: 0