2009 29th IEEE International Conference on Distributed Computing Systems最新文献_第4页

FLASH: Fine-Grained Localization in Wireless Sensor Networks Using Acoustic Sound Transmissions and High Precision Clock Synchronization FLASH:使用声波传输和高精度时钟同步的无线传感器网络中的细粒度定位

2009 29th IEEE International Conference on Distributed Computing Systems Pub Date : 2009-06-22 DOI: 10.1109/ICDCS.2009.33

Evangelos Mangas, A. Bilas

{"title":"FLASH: Fine-Grained Localization in Wireless Sensor Networks Using Acoustic Sound Transmissions and High Precision Clock Synchronization","authors":"Evangelos Mangas, A. Bilas","doi":"10.1109/ICDCS.2009.33","DOIUrl":"https://doi.org/10.1109/ICDCS.2009.33","url":null,"abstract":"Sensor localization in wireless sensor networks is an important component of many applications. Previous work has demonstrated how localization can be achieved using various methods. In this paper we focus on achieving fine-grained localization that does not require external infrastructure, specialized hardware support, or excessive sensor resources. We use a real sensor network and provide measurements on the actual system. We adopt a localization approach that relies on acoustic sounds and clock synchronization. The contribution of our work is achieving consistent sound pulse detection at each sensor and precise range estimation using a high-precision clock synchronization implementation. We first describe our technique and then we evaluate our approach using a real setup. Our results show that our approach achieves an average clock synchronization accuracy of 5μs. We verify this accuracy using an external global clock via an interrupt mechanism. Our sound detection technique is able to consistently identify sound pulses up to 10m distances in indoor environments. Combining the two techniques, we find that our localization method results in accurate range estimation with an average error of 11cm in distances up to 7m and in consistent range estimation up to 10m in various indoor environments.","PeriodicalId":387968,"journal":{"name":"2009 29th IEEE International Conference on Distributed Computing Systems","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121951205","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}

引用次数: 16

Locality-Preserving Clustering and Discovery of Wide-Area Grid Resources 广域网格资源的局部保持聚类与发现

2009 29th IEEE International Conference on Distributed Computing Systems Pub Date : 2009-06-22 DOI: 10.1109/ICDCS.2009.38

Haiying Shen, K. Hwang

引用次数: 4

A Reinforcement Learning Approach to Online Web Systems Auto-configuration 在线Web系统自动配置的强化学习方法

2009 29th IEEE International Conference on Distributed Computing Systems Pub Date : 2009-06-22 DOI: 10.1109/ICDCS.2009.76

Xiangping Bu, J. Rao, Chengzhong Xu

引用次数: 99

Logoot: A Scalable Optimistic Replication Algorithm for Collaborative Editing on P2P Networks 一种用于P2P网络协同编辑的可伸缩乐观复制算法

2009 29th IEEE International Conference on Distributed Computing Systems Pub Date : 2009-06-22 DOI: 10.1109/ICDCS.2009.75

Stéphane Weiss, Pascal Urso, P. Molli

引用次数: 149

Clock-like Flow Replacement Schemes for Resilient Flow Monitoring 弹性流量监测的类时钟流量替换方案

2009 29th IEEE International Conference on Distributed Computing Systems Pub Date : 2009-06-22 DOI: 10.1109/ICDCS.2009.53

Gunwoo Nam, P. Patankar, Seung-Hwan Lim, Bikash Sharma, G. Kesidis, C. Das

{"title":"Clock-like Flow Replacement Schemes for Resilient Flow Monitoring","authors":"Gunwoo Nam, P. Patankar, Seung-Hwan Lim, Bikash Sharma, G. Kesidis, C. Das","doi":"10.1109/ICDCS.2009.53","DOIUrl":"https://doi.org/10.1109/ICDCS.2009.53","url":null,"abstract":"In the context of a collaborating surveillance system for active TCP sessions handled by a networking device, we consider two problems. The first is the problem of protecting a flow table from overflow and the second is developing an efficient algorithm for estimating the number of active flows coupled with the identification of \"heavy-hitter\" TCP sessions. Our proposed techniques are sensitive to limited hardware and software resources allocated for this purpose in the linecards in addition to the very high data rates that modern line cards handle; specifically we are interested in cooperatively maintaining a per-flow state with a low cost, which has resiliency on dynamic traffic mix. We investigate a traditional timeout processing mechanism to manage the flow table for per-flow monitoring, called Timeout-Based Purging (TBP), our proposed Clock-like Flow Replacement (CFR) algorithms using a replacement policy, called \"clock\", and a hybrid approach combining these two. Experiments with Internet traces show that our CFR schemes can significantly reduce both false positive and false negative rates regardless of whether the flow table is fully occupied or sufficiently empty, even under SYN flooding. Our hybrid scheme estimates the number of active flows accurately, and confines the heavy-hitters without storing packet counters.","PeriodicalId":387968,"journal":{"name":"2009 29th IEEE International Conference on Distributed Computing Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124193095","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

NAT-resilient Gossip Peer Sampling nat弹性八卦对等抽样

2009 29th IEEE International Conference on Distributed Computing Systems Pub Date : 2009-06-22 DOI: 10.1109/ICDCS.2009.44

Anne-Marie Kermarrec, Alessio Pace, Vivien Quéma, V. Schiavoni

引用次数: 51

TBD: Trajectory-Based Data Forwarding for Light-Traffic Vehicular Networks TBD:基于轨迹的轻交通车辆网络数据转发

2009 29th IEEE International Conference on Distributed Computing Systems Pub Date : 2009-06-22 DOI: 10.1109/ICDCS.2009.11

J. Jeong, Shuo Guo, Yu Gu, T. He, D. Du

引用次数: 106

A Distributed Termination Detection Algorithm for Dynamic Asynchronous Systems 动态异步系统的分布式终端检测算法

2009 29th IEEE International Conference on Distributed Computing Systems Pub Date : 2009-06-22 DOI: 10.1109/ICDCS.2009.16

P. Johnson, N. Mittal

引用次数: 10

Pushing the Envelope: Extreme Network Coding on the GPU 突破极限:GPU上的极限网络编码

2009 29th IEEE International Conference on Distributed Computing Systems Pub Date : 2009-06-22 DOI: 10.1109/ICDCS.2009.68

H. Shojania, Baochun Li

{"title":"Pushing the Envelope: Extreme Network Coding on the GPU","authors":"H. Shojania, Baochun Li","doi":"10.1109/ICDCS.2009.68","DOIUrl":"https://doi.org/10.1109/ICDCS.2009.68","url":null,"abstract":"While it is well known that network coding achieves optimal flow rates in multicast sessions, its potential for practical use has remained to be a question, due to its high computational complexity. With GPU computing gaining momentum as a result of increased hardware capabilities and improved programmability, we show in this paper how the GPU can be used to improve network coding performance dramatically. Our previous work presented the first attempt in the literature to maximize the performance of network coding by taking advantage of not only multi-core CPUs, but also hundreds of computing cores in commodity off-the-shelf Graphics Processing Units (GPU). This paper represents another step forward, and presents a new array of GPU-based algorithms that improve network encoding by a factor of 2.2, and network decoding by a factor of 2.7 to 27.6 across a range of practical configurations. With just a single NVIDIA GTX 280 GPU, our implementation of GPU-based network encoding outperforms an 8-core Intel Xeon server by a margin of at least 4.3 to 1 in all practical test cases, and over 3000 peers can be served at high-quality video rates if network coding is used in a streaming server. With 128 blocks, for example, coding rates up to 294 MB/second can be achieved with a variety of block sizes.","PeriodicalId":387968,"journal":{"name":"2009 29th IEEE International Conference on Distributed Computing Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120961327","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}

引用次数: 32

Graduated QoS by Decomposing Bursts: Don't Let the Tail Wag Your Server 通过分解突发来分级QoS:不要让尾巴动摇你的服务器

2009 29th IEEE International Conference on Distributed Computing Systems Pub Date : 2009-06-22 DOI: 10.1109/ICDCS.2009.55

Lanyue Lu, P. Varman, K. Doshi

引用次数: 20