2010 IEEE 30th International Conference on Distributed Computing Systems最新文献

A Spinning Join That Does Not Get Dizzy 一个旋转的连接，不会让人头晕

2010 IEEE 30th International Conference on Distributed Computing Systems Pub Date : 2010-06-21 DOI: 10.1109/ICDCS.2010.23

P. Frey, R. Goncalves, M. Kersten, J. Teubner

{"title":"A Spinning Join That Does Not Get Dizzy","authors":"P. Frey, R. Goncalves, M. Kersten, J. Teubner","doi":"10.1109/ICDCS.2010.23","DOIUrl":"https://doi.org/10.1109/ICDCS.2010.23","url":null,"abstract":"As network infrastructures with 10 Gb/s bandwidth and beyond have become pervasive and as cost advantages of large commodity-machine clusters continue to increase, research and industry strive to exploit the available processing performance for large-scale database processing tasks. In this work we look at the use of high-speed networks for distributed join processing. We propose Data Roundabout as alight weight transport layer that uses Remote Direct Memory Access (RDMA) to gain access to the throughput opportunities in modern networks. The essence of Data Roundabout is a ring shaped network in which each host stores one portion of a large database instance. We leverage the available bandwidth to (continuously) pump data through the high-speed network. Based on Data Roundabout, we demonstrate cyclo-join, which exploits the cycling flow of data to execute distributed joins. The study uses different join algorithms (hash join and sort-merge join) to expose the pitfalls and the advantages of each algorithm in the data cycling arena. The experiments show the potential of a large distributed main-memory cache glued together with RDMA into a novel distributed database architecture.","PeriodicalId":199931,"journal":{"name":"2010 IEEE 30th International Conference on Distributed Computing Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126072545","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}

引用次数: 36

How Wireless Power Charging Technology Affects Sensor Network Deployment and Routing 无线充电技术如何影响传感器网络的部署和路由

2010 IEEE 30th International Conference on Distributed Computing Systems Pub Date : 2010-06-21 DOI: 10.1109/ICDCS.2010.61

Bin Tong, Zi Li, Guiling Wang, Wensheng Zhang

引用次数: 154

CacheCast: Eliminating Redundant Link Traffic for Single Source Multiple Destination Transfers CacheCast:消除单源多目的传输的冗余链路流量

2010 IEEE 30th International Conference on Distributed Computing Systems Pub Date : 2010-06-21 DOI: 10.1109/ICDCS.2010.29

Piotr Srebrny, T. Plagemann, V. Goebel, A. Mauthe

{"title":"CacheCast: Eliminating Redundant Link Traffic for Single Source Multiple Destination Transfers","authors":"Piotr Srebrny, T. Plagemann, V. Goebel, A. Mauthe","doi":"10.1109/ICDCS.2010.29","DOIUrl":"https://doi.org/10.1109/ICDCS.2010.29","url":null,"abstract":"Due to the lack of multicast services in the Internet, applications based on single source multiple destinations transfers such as video conferencing, IP radio, IPTV must use unicast or application layer multicast. This in turn has several well-known drawbacks. A basic insight is that this type of traffic exhibits high redundancy with temporal clustering of duplicated packets. The redundancy originates from multiple transfers of the same data chunk over the same link. We propose CacheCast-a link layer caching mechanism-that eliminates the redundant data transmissions using small caches on links. CacheCast's underlying principles are simplicity and reliability. It is a fully distributed and incrementally deployable architecture. It consists of small caches on links that act independently. A single cache removes redundant data from a packet on the link entry and recovers the data on the link exit. Thus, link caches are transparent to routers. We show through analysis and simulation that CacheCast achieves near multicast efficiency for superposition of unicast connections. We implemented CacheCast in ns-2 and show that it does not violate the current understanding of \"fairness\" in the Internet.","PeriodicalId":199931,"journal":{"name":"2010 IEEE 30th International Conference on Distributed Computing Systems","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122579728","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

P2P Streaming Capacity under Node Degree Bound 节点度约束下的P2P流容量

2010 IEEE 30th International Conference on Distributed Computing Systems Pub Date : 2010-06-21 DOI: 10.1109/ICDCS.2010.39

Shao Liu, Minghua Chen, S. Sengupta, M. Chiang, Jin Li, P. Chou

{"title":"P2P Streaming Capacity under Node Degree Bound","authors":"Shao Liu, Minghua Chen, S. Sengupta, M. Chiang, Jin Li, P. Chou","doi":"10.1109/ICDCS.2010.39","DOIUrl":"https://doi.org/10.1109/ICDCS.2010.39","url":null,"abstract":"Two of the fundamental problems in peer-to-peer (P2P) streaming are as follows: what is the maximum streaming rate that can be sustained for all receivers, and what peering algorithms can achieve close to this maximum? These problems of computing and approaching the P2P streaming capacity are often challenging because of the constraints imposed on overlay topology. In this paper, we focus on the limit of P2P streaming rate under node degree bound, i.e., the number of connections a node can maintain is upper bounded. We first show that the streaming capacity problem under node degree bound is NP Complete in general. Then, for the case of node out-degree bound, through the construction of a “Bubble algorithm”, we show that the streaming capacity is at least half of that of a much less restrictive and previously studied case, where we bound the node degree in each streaming tree but not the degree across all trees. Then, for the case of node total-degree bound, we develop a “Cluster-Tree algorithm” that provides probabilistic guarantee of achieving a rate close to the maximum rate achieved under no degree bound constraint, when the node degree bound is logarithmic in network size. The effectiveness of these algorithms in approaching the capacity limit is demonstrated in simulations using uplink bandwidth statistics of Internet hosts. Both analysis and numerical experiments show that peering in a locally dense and globally sparse manner achieves near-optimal streaming rate if the degree bound is at least logarithmic in network size.","PeriodicalId":199931,"journal":{"name":"2010 IEEE 30th International Conference on Distributed Computing Systems","volume":"07 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129823430","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}

引用次数: 70

A New Buffer Cache Design Exploiting Both Temporal and Content Localities 一种利用时间和内容位置的新缓存设计

2010 IEEE 30th International Conference on Distributed Computing Systems Pub Date : 2010-06-21 DOI: 10.1109/ICDCS.2010.26

Jin Ren, Qing Yang

引用次数: 20

Analyzing Self-Defense Investments in Internet Security under Cyber-Insurance Coverage 网络保险覆盖下的网络安全自卫投资分析

2010 IEEE 30th International Conference on Distributed Computing Systems Pub Date : 2010-06-21 DOI: 10.1109/ICDCS.2010.79

R. Pal, L. Golubchik

{"title":"Analyzing Self-Defense Investments in Internet Security under Cyber-Insurance Coverage","authors":"R. Pal, L. Golubchik","doi":"10.1109/ICDCS.2010.79","DOIUrl":"https://doi.org/10.1109/ICDCS.2010.79","url":null,"abstract":"Internet users such as individuals and organizations are subject to different types of epidemic risks such as worms, viruses, and botnets. To reduce the probability of risk, an Internet user generally invests in self-defense mechanisms like antivirus and antispam software. However, such software does not completely eliminate risk. Recent works have considered the problem of residual risk elimination by proposing the idea of cyber-insurance. In this regard, an important decision for Internet users is their amount of investment in self-defense mechanisms when insurance solutions are offered. In this paper, we investigate the problem of self-defense investments in the Internet, under full and partial cyber-insurance coverage models. By the term ‘self-defense investment’, we mean the monetary-cum-precautionary cost that each user needs to invest in employing risk mitigating self-defense mechanisms, given that it is fully or partially insured by the Internet insurance agencies. We propose a general mathematical framework by which co-operative and non-co-operative Internet users can decide whether or not to invest in self-defense for ensuring both, individual and social welfare. Our results show that (1) co-operation amongst users results in more efficient self-defense investments than those in a non-cooperative setting, under a full insurance coverage model and (2) partial insurance coverage motivates non-cooperative Internet users to invest more efficiently in self-defense mechanisms when compared to full insurance coverage.","PeriodicalId":199931,"journal":{"name":"2010 IEEE 30th International Conference on Distributed Computing Systems","volume":"164 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131465416","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}

引用次数: 43

Divide and Conquer Algorithms for Publish/Subscribe Overlay Design 发布/订阅覆盖设计的分而治之算法

2010 IEEE 30th International Conference on Distributed Computing Systems Pub Date : 2010-06-21 DOI: 10.1109/ICDCS.2010.87

Chen Chen, H. Jacobsen, R. Vitenberg

引用次数: 28

Adaptive Jamming-Resistant Broadcast Systems with Partial Channel Sharing 部分信道共享的自适应抗干扰广播系统

2010 IEEE 30th International Conference on Distributed Computing Systems Pub Date : 2010-06-21 DOI: 10.1109/ICDCS.2010.25

Qi Dong, Donggang Liu

引用次数: 11

Sentomist: Unveiling Transient Sensor Network Bugs via Symptom Mining Sentomist:通过症状挖掘揭示瞬态传感器网络漏洞

2010 IEEE 30th International Conference on Distributed Computing Systems Pub Date : 2010-06-21 DOI: 10.1109/ICDCS.2010.75

Yangfan Zhou, Xinyu Chen, Michael R. Lyu, Jiangchuan Liu

{"title":"Sentomist: Unveiling Transient Sensor Network Bugs via Symptom Mining","authors":"Yangfan Zhou, Xinyu Chen, Michael R. Lyu, Jiangchuan Liu","doi":"10.1109/ICDCS.2010.75","DOIUrl":"https://doi.org/10.1109/ICDCS.2010.75","url":null,"abstract":"Wireless Sensor Network (WSN) applications are typically event-driven. While the source codes of these applications may look simple, they are executed with a complicated concurrency model, which frequently introduces software bugs, in particular, transient bugs. Such buggy logics may only be triggered by some occasionally interleaved events that bear implicit dependency, but can lead to fatal system failures. Unfortunately, these deeply-hidden bugs or even their symptoms can hardly be identified by state-of-the-art debugging tools, and manual identification from massive running traces can be prohibitively expensive. In this paper, we present Sentomist (Sensor application anatomist), a novel tool for identifying potential transient bugs in WSN applications. The Sentomist design is based on a key observation that transient bugs make the behaviors of a WSN system deviate from the normal, and thus outliers (i.e., abnormal behaviors) are good indicators of potential bugs. Sentomist introduces the notion of event-handling interval to systematically anatomize the long-term execution history of an event-driven WSN system into groups of intervals. It then applies a customized outlier detection algorithm to quickly identify and rank abnormal intervals. This dramatically reduces the human efforts of inspection (otherwise, we have to manually check tremendous data samples, typically with brute force inspection) and thus greatly speeds up debugging. We have implemented Sentomist based on the concurrency model of TinyOS. We apply Sentomist to test a series of representative real-life WSN applications that contain transient bugs. These bugs, though caused by complicated interactions that can hardly be predicted during the programming stage, are successfully confined by Sentomist.","PeriodicalId":199931,"journal":{"name":"2010 IEEE 30th International Conference on Distributed Computing Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132182608","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

Deployment of a Reinforcement Backbone Network with Constraints of Connection and Resources 具有连接约束和资源约束的加固骨干网的部署

2010 IEEE 30th International Conference on Distributed Computing Systems Pub Date : 2010-06-21 DOI: 10.1109/ICDCS.2010.94

Peng Wei, Shan Chu, Xin Wang, Yu Zhou

{"title":"Deployment of a Reinforcement Backbone Network with Constraints of Connection and Resources","authors":"Peng Wei, Shan Chu, Xin Wang, Yu Zhou","doi":"10.1109/ICDCS.2010.94","DOIUrl":"https://doi.org/10.1109/ICDCS.2010.94","url":null,"abstract":"In recent years, we have seen a surge of interest in enabling communications over meshed wireless networks. Particularly, supporting peer-to-peer communications over a multi-hop wireless network has a big potential in enabling ubiquitous computing. However, many wireless nodes have limited capabilities, for example, sensor nodes or small handheld devices. Also, the end-to-end capacity and delay degrade significantly as the path length increases with the number of network nodes. In these scenarios, the deployment of a backbone network could potentially facilitate higher performance network communications. In this paper, we study the novel Reinforcement Back-bone Network (RBN) deployment problem considering the practical limitation in the number of available backbone nodes and enforcing backbone network connectivity. We propose an iterative and adaptive (ITA) algorithm for efficient backbone network deployment. In addition, in order to provide the performance bound, we redefine and solve the problem by implementing the Generic Algorithm. Finally, we present our simulation results under various settings and compare the performance of the proposed ITA algorithm and the generic algorithm. Our study indicates that the proposed ITA algorithm is promising for deploying a connected RBN with a limited number of available backbone nodes.","PeriodicalId":199931,"journal":{"name":"2010 IEEE 30th International Conference on Distributed Computing Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126964333","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}

引用次数: 11