2008 The 28th International Conference on Distributed Computing Systems最新文献_第6页

Updates and Asynchronous Communication in Trusted Computing Systems 可信计算系统中的更新和异步通信

2008 The 28th International Conference on Distributed Computing Systems Pub Date : 2008-06-17 DOI: 10.1109/ICDCS.2008.109

J. Brustoloni, David Kyle

引用次数: 0

Mobility-Assisted Spatiotemporal Detection in Wireless Sensor Networks 无线传感器网络中的移动辅助时空检测

2008 The 28th International Conference on Distributed Computing Systems Pub Date : 2008-06-17 DOI: 10.1109/ICDCS.2008.81

G. Xing, Jianping Wang, Ke Shen, Qingfeng Huang, X. Jia, H. So

引用次数: 43

Efficient Distributed Third-Party Data Authentication for Tree Hierarchies 树形结构的高效分布式第三方数据认证

2008 The 28th International Conference on Distributed Computing Systems Pub Date : 2008-06-17 DOI: 10.1109/ICDCS.2008.53

Hao Yuan, M. Atallah

{"title":"Efficient Distributed Third-Party Data Authentication for Tree Hierarchies","authors":"Hao Yuan, M. Atallah","doi":"10.1109/ICDCS.2008.53","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.53","url":null,"abstract":"In the third-party model for the distribution of data, the trusted data creator or owner provides an untrusted distributor D with integrity verification (IV) items that are stored at D in addition to the n data items. When a user U has a subset of n' of those n data items and needs to verify their integrity, U is provided by D with a number of IV items that U uses to verify its data's integrity. The model forbids U from receiving any information about the n-n' data items that the user is not authorized to access, and assumes that D has no signature authority (it stores only pre-signed IVs). Most of the published work in this area uses the Merkle tree or variants thereof, and typically requires D to store a linear or close to linear (in n) number s(n) of IV items that are pre-signed by the trusted authority. Moreover, most of the existing schemes impose on D a non-constant amount of computation work t(n) (typically logarithmic in n) in order to provide U with the IV items that enable U to verify the integrity of its data; we call h(n) the number of such IV items. The h(n) values found in the literature are non-constant, i.e., they actually do depend on the number of data items. The main contribution of this paper is to achieve linear s(n), constant h(n) and constant or logarithmic t(n) when the n data items are organized in a tree hierarchy T, and the user's subset of n' items form a subtree T'. The cases of T' considered are when T' is (i) rooted at a node v and of depth k below v; and (ii) reachable in k hops from v going both up and down in T.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133997522","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

Performance Analysis of Group Based Detection for Sparse Sensor Networks 稀疏传感器网络中基于组的检测性能分析

2008 The 28th International Conference on Distributed Computing Systems Pub Date : 2008-06-17 DOI: 10.1109/ICDCS.2008.30

Jingbin Zhang, Gang Zhou, S. Son, J. Stankovic, K. Whitehouse

{"title":"Performance Analysis of Group Based Detection for Sparse Sensor Networks","authors":"Jingbin Zhang, Gang Zhou, S. Son, J. Stankovic, K. Whitehouse","doi":"10.1109/ICDCS.2008.30","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.30","url":null,"abstract":"In this paper, we analyze the performance of group based detection in sparse sensor networks, when the system level detection decision is made based on the detection reports generated from multiple sensing periods. Sparse deployment is essential for reducing cost of large scale sensor networks, which cover thousands of square miles. In a sparse deployment, the sensor field is only partially covered by sensorspsila sensing ranges, resulting in void sensing areas in the region, but all nodes are connected through multi-hop networking. Further, due to the unavoidable false alarms generated by a single sensor in a network, many deployed systems use group based detection to reduce system level false alarms. Despite the popularity of group based detection, few analysis works in the literature deal with group based detection. In this paper, we propose a novel approach called Markov chain based Spatial approach (MS-approach) to model group based detection in sensor networks. The M-S-approach successfully overcomes the complicated conditional detection probability of a target in each sensing period, and reduces the execution time of the analysis from many days to 1 minute. The analytical model is validated through extensive simulations. This analytical work is important because it provides an easy way to understand the performance of a system that uses group based detection without running countless simulations or deploying real systems.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134207744","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}

引用次数: 8

The SCREAM Approach for Efficient Distributed Scheduling with Physical Interference in Wireless Mesh Networks 无线网状网络中具有物理干扰的高效分布式调度的尖叫方法

2008 The 28th International Conference on Distributed Computing Systems Pub Date : 2008-06-17 DOI: 10.1109/ICDCS.2008.104

Gurashish Singh Brar, D. Blough, P. Santi

{"title":"The SCREAM Approach for Efficient Distributed Scheduling with Physical Interference in Wireless Mesh Networks","authors":"Gurashish Singh Brar, D. Blough, P. Santi","doi":"10.1109/ICDCS.2008.104","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.104","url":null,"abstract":"It is known that CSMA/CA channel access schemes are not well suited to meet the high traffic demand of wireless mesh networks. One possible way to increase traffic carrying capacity is to use a spatial TDMA (STDMA) approach in conjunction with the physical interference model, which allows more aggressive scheduling than the protocol interference model on which CSMA/CA is based. While an efficient centralized solution for STDMA with physical interference has been recently proposed, no satisfactory distributed approaches have been introduced so far. In this paper, we first prove that no localized distributed algorithm can solve the problem of building a feasible schedule under the physical interference model. Motivated by this, we design a global primitive, called SCREAM, which is used to verify the feasibility of a schedule during an iterative distributed scheduling procedure. Based on this primitive, we present two distributed protocols for efficient, distributed scheduling under the physical interference model, and we prove an approximation bound for one of the protocols. We also present extensive packet-level simulation results, which show that our protocols achieve schedule lengths very close to those of the centralized algorithm and have running times that are practical for mesh networks.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130982930","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

On Security Vulnerabilities of Null Data Frames in IEEE 802.11 Based WLANs 基于IEEE 802.11的无线局域网中空数据帧的安全漏洞研究

2008 The 28th International Conference on Distributed Computing Systems Pub Date : 2008-06-17 DOI: 10.1109/ICDCS.2008.17

Wenjun Gu, Zhimin Yang, Can Que, D. Xuan, W. Jia

引用次数: 14

Circumventing Server Bottlenecks: Indirect Large-Scale P2P Data Collection 绕过服务器瓶颈:间接大规模P2P数据收集

2008 The 28th International Conference on Distributed Computing Systems Pub Date : 2008-06-17 DOI: 10.1109/ICDCS.2008.74

Di Niu, Baochun Li

引用次数: 7

MR-PDP: Multiple-Replica Provable Data Possession MR-PDP:多副本可证明的数据占有

2008 The 28th International Conference on Distributed Computing Systems Pub Date : 2008-06-17 DOI: 10.1109/ICDCS.2008.68

Reza Curtmola, O. Khan, R. Burns, G. Ateniese

{"title":"MR-PDP: Multiple-Replica Provable Data Possession","authors":"Reza Curtmola, O. Khan, R. Burns, G. Ateniese","doi":"10.1109/ICDCS.2008.68","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.68","url":null,"abstract":"Many storage systems rely on replication to increase the availability and durability of data on untrusted storage systems. At present, such storage systems provide no strong evidence that multiple copies of the data are actually stored. Storage servers can collude to make it look like they are storing many copies of the data, whereas in reality they only store a single copy. We address this shortcoming through multiple-replica provable data possession (MR-PDP): A provably-secure scheme that allows a client that stores t replicas of a file in a storage system to verify through a challenge-response protocol that (1) each unique replica can be produced at the time of the challenge and that (2) the storage system uses t times the storage required to store a single replica. MR-PDP extends previous work on data possession proofs for a single copy of a file in a client/server storage system (Ateniese et al., 2007). Using MR-PDP to store t replicas is computationally much more efficient than using a single-replica PDP scheme to store t separate, unrelated files (e.g., by encrypting each file separately prior to storing it). Another advantage of MR-PDP is that it can generate further replicas on demand, at little expense, when some of the existing replicas fail.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115823808","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}

引用次数: 569

Exploring Anti-Spam Models in Large Scale VoIP Systems 探讨大规模VoIP系统中的反垃圾邮件模型

2008 The 28th International Conference on Distributed Computing Systems Pub Date : 2008-06-17 DOI: 10.1109/ICDCS.2008.71

P. Patankar, Gunwoo Nam, G. Kesidis, C. Das

{"title":"Exploring Anti-Spam Models in Large Scale VoIP Systems","authors":"P. Patankar, Gunwoo Nam, G. Kesidis, C. Das","doi":"10.1109/ICDCS.2008.71","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.71","url":null,"abstract":"Although the problem of spam detection in email is well understood and has been extensively researched, a significant portion of emails today are spam. A most widely used method to detect spam involves content filtering, where the spam detector scans the received email for keywords. However, the same approach cannot be applied to detect Voice over IP (VoIP) spam, since a call has to be categorized as a legitimate or a spam (each to a degree with a certain reliability) before the connection is established. Also, spammers over IP can potentially generate orders of magnitude more spam volume, at far less cost, and with greater anonymity than telemarketers using the Public Switch Telephone Network (PSTN). The spam problem in VoIP is further compounded by the absence of a do-not-call-list, which has been the main reason for the reduction of spam calls in PSTN. Thus, the spam issue for VoIP is as important as those pertaining to quality-of-service (QoS) of the voice traffic itself. To this end, we propose two different anti-spam frameworks for large scale VoIP systems. The first one is a centralized SIP-based spam detection framework that relies on SIP messages during the call establishment phase to identify spam calls, and the second one is a distributed referral social network model, where a user is assigned a reputation score by its neighbors. Based on the reputation, a callee can decide either to accept or decline a call. Our simulation results indicate that the referral model can provide better anti-spam capabilities by isolating a spammer faster than the SIP based approach, and can also correctly identify spam calls over 98% of time.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114634356","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

Crystal: An Emulation Framework for Practical Peer-to-Peer Multimedia Streaming Systems 实用点对点多媒体流系统的仿真框架

2008 The 28th International Conference on Distributed Computing Systems Pub Date : 2008-06-17 DOI: 10.1109/ICDCS.2008.57

Mea Wang, H. Shojania, Baochun Li

{"title":"Crystal: An Emulation Framework for Practical Peer-to-Peer Multimedia Streaming Systems","authors":"Mea Wang, H. Shojania, Baochun Li","doi":"10.1109/ICDCS.2008.57","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.57","url":null,"abstract":"To rapidly evolve new designs of peer-to-peer (P2P) multimedia streaming systems, it is highly desirable to test and troubleshoot them in a controlled and repeatable experimental environment in a local cluster of servers, as it is risky to integrate untested protocols in live production and mission-critical peer-to-peer sessions, such as live P2P streaming. Though it is possible to construct such controlled experiments with virtual machine monitors, there are a number of challenges and roadblocks: (1) The deployment of such resource-hungry virtual machine environments are complicated and time-consuming for researchers without prior systems expertise; (2) The system designer needs to implement many basic streaming elements, such as playback buffers and message switches. In this paper, we seek to address these challenges by introducing Crystal, an emulation framework for practical P2P multimedia streaming systems, which provides support for developing, testing, and troubleshooting new streaming system designs in a controlled server cluster environment. It is our imperative design objective that Crystal offers ease of use, rapid experimental turnaround, and the capability of emulating realistic P2P environments.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124414632","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