发布求助
文献互助 智能选刊 最新文献

2008 The 28th International Conference on Distributed Computing Systems最新文献

筛选
英文 中文
On the Longest RNG Edge of Wireless Ad Hoc Networks 无线自组织网络RNG最长边缘研究
2008 The 28th International Conference on Distributed Computing Systems Pub Date : 2008-06-17 DOI: 10.1142/S1793830909000099
P. Wan, Lixin Wang, Frances F. Yao, Chih-Wei Yi
{"title":"On the Longest RNG Edge of Wireless Ad Hoc Networks","authors":"P. Wan, Lixin Wang, Frances F. Yao, Chih-Wei Yi","doi":"10.1142/S1793830909000099","DOIUrl":"https://doi.org/10.1142/S1793830909000099","url":null,"abstract":"Relative neighborhood graph (RNG) has been widely used in topology control and geographic routing in wireless ad hoc networks. Its maximum edge length is the minimum requirement on the maximum transmission radius by those applications of RNG. In this paper, we derive the precise asymptotic probability distribution of the maximum edge length of the RNG on a Poisson point process over a unit-area disk. Since the maximum RNG edge length is a lower bound on the critical transmission radius for greedy forward routing, our result also leads to an improved asymptotic almost sure lower bound on the critical transmission radius for greedy forward routing.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"83 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":"124742575","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
DTP: Double-Pairwise Time Protocol for Disruption Tolerant Networks 容忍中断网络的双对时间协议
2008 The 28th International Conference on Distributed Computing Systems Pub Date : 2008-06-17 DOI: 10.1109/ICDCS.2008.73
Q. Ye, Liang Cheng
{"title":"DTP: Double-Pairwise Time Protocol for Disruption Tolerant Networks","authors":"Q. Ye, Liang Cheng","doi":"10.1109/ICDCS.2008.73","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.73","url":null,"abstract":"Network time synchronization (NTS) is essential for any distributed systems, including disruption tolerant networks (DTNs). The feature of frequent contact disruptions and discontinuous network connections in DTNs raises a new challenge in providing the NTS service: synchronization operations may be interrupted for a long period of time when links between the time synchronization peers are opportunistic. To address this challenge, we propose double- pairwise time protocol (DTP) that can achieve better clock estimations and synchronization results in DTNs than NTP-Core, which models the major functionality of processing synchronization messages in network time protocol (NTP) that is the time-keeping standard in the Internet. The characteristics of DTP include: i) DTP achieves approximately half of the maximum time error achieved by NTP-Core; and ii) DTP only requires minor modifications to be implemented in the current architecture of NTP. Simulation results based on trace data collected from existing DTN testbeds validate such characteristics of DTP.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"2008 33","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120848994","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
Wavenet: A Wavelet-Based Approach to Monitor Changes on Data Distribution in Networks 小波网络:一种基于小波的监测网络数据分布变化的方法
2008 The 28th International Conference on Distributed Computing Systems Pub Date : 2008-06-17 DOI: 10.1109/ICDCS.2008.80
Mei Li, Ping Xia, Wang-Chien Lee
{"title":"Wavenet: A Wavelet-Based Approach to Monitor Changes on Data Distribution in Networks","authors":"Mei Li, Ping Xia, Wang-Chien Lee","doi":"10.1109/ICDCS.2008.80","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.80","url":null,"abstract":"A massive amount of data is available in distributed fashion on various networks, including Internet, peer-to-peer networks, and wireless sensor networks. Users are often interested in monitoring interesting patterns or abnormal events hidden in these data. Transferring all the raw data from each host node to a central coordinator for processing is costly and unnecessary. In this study, we investigate the problem of monitoring changes on the data distribution in the networks (MCDN). To address this problem, we propose a technique, called wavenet, by compressing the local item set in each host node into a compact yet accurate summary, called local wavelet, for communication with the coordinator. We also propose adaptive monitoring to address the issues of local wavelet propagation in wavenet. An extensive performance evaluation has been conducted to validate our proposal and demonstrates the efficiency of wavenet.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"14 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":"126471476","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
A Nonblocking Approach for Reaching an Agreement on Request Total Orders 达成请求总订单协议的非阻塞方法
2008 The 28th International Conference on Distributed Computing Systems Pub Date : 2008-06-17 DOI: 10.1109/ICDCS.2008.85
Yun Wang, Jie Wu
{"title":"A Nonblocking Approach for Reaching an Agreement on Request Total Orders","authors":"Yun Wang, Jie Wu","doi":"10.1109/ICDCS.2008.85","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.85","url":null,"abstract":"In distributed systems that use active replication to achieve robustness, it is important to efficiently enforce consistency among replicas. The nonblocking mode helps to speed up system execution. Unfortunately, this benefit comes at the expense of introducing decision conflicts when the replicas form a single logical token ring and client requests are processed in sequence following the ring. In order to reach an agreement regarding request total orders, this paper proposes a forward-confirmation (FC) approach to identify and solve decision conflicts when up to k successive replicas fail simultaneously. The FC approach can obtain consistent decisions among replicas. An implementation of the FC approach, namely, the queueing method, is proposed. Test results show that our protocol in the nonblocking mode outperforms the Totem protocol regarding delays and failure recovery.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"51 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":"126658725","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}
引用次数: 0
Identifying Frequent Items in P2P Systems 识别P2P系统中的频繁项目
2008 The 28th International Conference on Distributed Computing Systems Pub Date : 2008-06-17 DOI: 10.1109/ICDCS.2008.78
Mei Li, Wang-Chien Lee
{"title":"Identifying Frequent Items in P2P Systems","authors":"Mei Li, Wang-Chien Lee","doi":"10.1109/ICDCS.2008.78","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.78","url":null,"abstract":"As peer-to-peer (P2P) systems receive growing acceptance, the need of identifying 'frequent items' in such systems appears in a variety of applications. In this paper, we define the problem of identifying frequent items (IFI) and propose an efficient in-network processing technique, called in-network filtering (netFilter), to address this important fundamental problem. netFilter operates in two phases: 1) candidate filtering: data items are grouped into item groups to obtain aggregates for pruning of infrequent items; and 2) candidate verification: the aggregates for the remaining candidate items are obtained to filter out false frequent items. We address various issues faced in realizing netFilter, including aggregate computation, candidate set optimization, and candidate set materialization. In addition, we analyze the performance of netFilter, derive the optimal setting analytically, and discuss how to achieve the optimal setting in practice. Finally, we validate the effectiveness of netFilter through extensive simulation.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"14 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":"126707732","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
A Sophisticated Privacy-Enhanced Yet Accountable Security Framework for Metropolitan Wireless Mesh Networks 城域无线网状网络的复杂隐私增强但负责任的安全框架
2008 The 28th International Conference on Distributed Computing Systems Pub Date : 2008-06-17 DOI: 10.1109/ICDCS.2008.18
K. Ren, W. Lou
{"title":"A Sophisticated Privacy-Enhanced Yet Accountable Security Framework for Metropolitan Wireless Mesh Networks","authors":"K. Ren, W. Lou","doi":"10.1109/ICDCS.2008.18","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.18","url":null,"abstract":"Recently, multi-hop wireless mesh networks (WMNs) have attracted increasing attention and deployment as a low-cost approach to provide broadband Internet access at metropolitan scale. Security and privacy issues are of most concern in pushing the success of WMNs for their wide deployment and for supporting service-oriented applications. Despite the necessity, limited security research has been conducted towards privacy preservation in WMNs. This motivates us to develop PEACE, a soPhisticated privacy-Enhanced yet Accountable seCurity framEwork, tailored for WMNs. At the one hand, PEACE enforces strictuser access control to cope with both free riders and malicious users. On the other hand, PEACE offers sophisticated user privacy protection against both adversaries and various other network entities. PEACE is presented as a suite of authentication and key agreement protocols built upon our proposed short group signature variation. Our analysis shows that PEACE is resilient to a number of security and privacy related attacks.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"11 19 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":"129987875","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}
引用次数: 35
Optimal Placements in Ring Network for Data Replicas in Distributed Database with Majority Voting Protocol 基于多数投票协议的分布式数据库数据副本环网优化配置
2008 The 28th International Conference on Distributed Computing Systems Pub Date : 2008-06-17 DOI: 10.1109/ICDCS.2008.14
Zhao Zhang, Weili Wu, S. Shekhar
{"title":"Optimal Placements in Ring Network for Data Replicas in Distributed Database with Majority Voting Protocol","authors":"Zhao Zhang, Weili Wu, S. Shekhar","doi":"10.1109/ICDCS.2008.14","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.14","url":null,"abstract":"In a distributed database system, data replicas are placed at different locations to achieve high data availability in the presence of link failures. With majority voting protocol, a location is survived for read/write operations if and only if it is accessible to more than half of the replicas. The problem is to find out the optimal placements for a given number of data replicas in a ring network. When the number of replicas is odd, it was conjectured by Hu et al. that every uniform placement is optimal, which is proved by Shekhar and Wu later. However, when the number of replicas is even, it was pointed out by Hu et al. that uniform placements are not optimal and the optimal placement problem may be very complicated. In this paper, we study the optimal placement problem in a ring network with majority voting protocol and even number of replicas, and give a complete characterization of optimal placements when the number of replicas is not too large compared with the number of locations.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"43 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":"127773542","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}
引用次数: 0
Energy and Timing Constrained System Reward Maximization on Wireless Networks 无线网络能量和时间约束下的系统奖励最大化
2008 The 28th International Conference on Distributed Computing Systems Pub Date : 2008-06-17 DOI: 10.1109/ICDCS.2008.100
Jiayu Gong, Xiliang Zhong, Chengzhong Xu
{"title":"Energy and Timing Constrained System Reward Maximization on Wireless Networks","authors":"Jiayu Gong, Xiliang Zhong, Chengzhong Xu","doi":"10.1109/ICDCS.2008.100","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.100","url":null,"abstract":"Power efficiency is an important design issue in embedded devices with limited power supplies. In this paper, we study a reward-based packet scheduling problem in wireless environments. We consider a general scenario in which a transmitter communicates with multiple receivers periodically. To guarantee timely transmission of data, each packet is associated with a delay constraint. The periodic data streams have different importance levels, power functions, and levels of data sizes. The more data a transmitter delivers, the more rewards it obtains. Our objective is to develop schemes that selectively transmit data streams of different data sizes at different transmission rates to maximize the system reward under given time and energy constraints. We show that this problem is NP-hard and develop a dynamic programming algorithm for the optimal solution in pseudo-polynomial time. A fast polynomial-time heuristic approach is presented to achieve close approximation. Simulation results demonstrate that the proposed heuristic approach can achieve a significant improvement over other approaches adapted from existing studies at a small runtime overhead.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"16 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":"122411704","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
Efficient Privacy-Preserving k-Nearest Neighbor Search 高效保隐私k近邻搜索
2008 The 28th International Conference on Distributed Computing Systems Pub Date : 2008-06-17 DOI: 10.1109/ICDCS.2008.79
Yinian Qi, M. Atallah
{"title":"Efficient Privacy-Preserving k-Nearest Neighbor Search","authors":"Yinian Qi, M. Atallah","doi":"10.1109/ICDCS.2008.79","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.79","url":null,"abstract":"We give efficient protocols for secure and private k-nearest neighbor (k-NN) search, when the data is distributed between two parties who want to cooperatively compute the answers without revealing to each other their private data. Our protocol for the single-step k-NN search is provably secure and has linear computation and communication complexity. Previous work on this problem had a quadratic complexity, and also leaked information about the parties' inputs. We adapt our techniquesto also solve the general multi-step k-NN search, and describe a specific embodiment of it for the case of sequence data. The protocols and correctness proofs can be extended to suit other privacy-preserving data mining tasks, such as classification and outlier detection.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"136 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":"131785175","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}
引用次数: 116
PIRD: P2P-Based Intelligent Resource Discovery in Internet-Based Distributed Systems 基于互联网的分布式系统中基于p2p的智能资源发现
2008 The 28th International Conference on Distributed Computing Systems Pub Date : 2008-06-17 DOI: 10.1109/ICDCS.2008.9
Haiying Shen, Ze Li, Ting Li, Yingwu Zhu
{"title":"PIRD: P2P-Based Intelligent Resource Discovery in Internet-Based Distributed Systems","authors":"Haiying Shen, Ze Li, Ting Li, Yingwu Zhu","doi":"10.1109/ICDCS.2008.9","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.9","url":null,"abstract":"Internet-based distributed systems enable globally scattered resources to be collectively pooled and used in a cooperative manner to achieve unprecedented petascale super computing capabilities. Numerous resource discovery approaches have been proposed to help achieve this goal. To report or discover a multi-attribute resource, most approaches use multiple messages with each message for an attribute, leading to high overhead. Anther approach can reduce multi-attribute to one index, but it is not practically effective in an environment with a large number of different resource attributes. Furthermore, few approaches are able to locate resources geographically close to the requesters, which is critical to system performance. This paper presents a P2P-based intelligent resource discovery (PIRD) mechanism that weaves all attributes into a set of indices using locality sensitive hashing, and then maps the indices to a structured P2P. It further incorporates Lempel-Ziv-Welch algorithm to compress attribute information for higher efficiency. In addition, it helps to search resources geographically close to requesters by relying on a hierarchical P2P structure. PIRD significantly reduces overhead and improves the efficiency and effectiveness of resource discovery. Theoretical analysis and simulation results demonstrate the efficiency of PIRD in comparison with other approaches. It dramatically reduces overhead and yields significant improvements on the efficiency of resource discovery.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"39 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":"133690893","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}
引用次数: 26
首页 上一页 下一页 尾页
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学术官方微信