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

Adaptive Distributed Time-Slot Based Scheduling for Fairness in Multi-Hop Wireless Networks 基于自适应分布式时隙的多跳无线网络公平性调度

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

A. Rao, I. Stoica

{"title":"Adaptive Distributed Time-Slot Based Scheduling for Fairness in Multi-Hop Wireless Networks","authors":"A. Rao, I. Stoica","doi":"10.1109/ICDCS.2008.108","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.108","url":null,"abstract":"Recent research indicates that multi-hop wireless networks can suffer from extreme imbalances in the throughput achieved by simultaneous competing flows. We address this problem by designing a practical distributed algorithm to compute a time-slot based schedule that provides end-to-end max-min fairness. Our system uses randomized priorities based on local weights to arbitrate access between nodes that directly compete with each other (we call this weighted slot allocation or WSA). The local weights are in turn computed by a higher layer called end-to-end fairness using local weights (EFLoW). EFLoW implements an additive-increase multiplicative-decrease (AIMD) algorithm that can automatically adapt to changes in traffic demands and network conditions. In each iteration, EFLoW only uses state obtained from within a given node's contention region. We have implemented WSA and EFLoW in both a simulator and a real system by using the overlay MAC layer (OML). Unlike previous work on end-to-end fairness, our approach does not use a centralized coordinator and works for traffic patterns with any number of sources and sinks. Also, since we compute both the fair allocation and a schedule to achieve it, we do not make any assumptions about the efficiency of carrier-sense (CS) based MACs - this is very important in the light of recent work which shows that current CS-based MACs can be very unfair even when all nodes are limited to sending at their fair rate. Our results show that WSA and EFLoW can prevent starvation of flows and improve fairness without sacrificing efficiency for a wide variety of traffic patterns.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"3 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":"130852468","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}

引用次数: 10

Routing of XML and XPath Queries in Data Dissemination Networks 数据传播网络中XML和XPath查询的路由

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

Guoli Li, Shuang Hou, H. Jacobsen

引用次数: 28

Can We Really Recover Data if Storage Subsystem Fails? 存储子系统故障，数据真的能恢复吗?

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

Weijun Xiao, Qing Yang

引用次数: 9

Correlation-Aware Object Placement for Multi-Object Operations 面向多对象操作的关联感知对象放置

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

Ming Zhong, Kai Shen, J. Seiferas

{"title":"Correlation-Aware Object Placement for Multi-Object Operations","authors":"Ming Zhong, Kai Shen, J. Seiferas","doi":"10.1109/ICDCS.2008.60","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.60","url":null,"abstract":"A multi-object operation incurs communication or synchronization overhead when the requested objects are distributed over different nodes. The object pair correlations (the probability for a pair of objects to be requested together in an operation) are often highly skewed and yet stable over time for real-world distributed applications. Thus, placing strongly correlated objects on the same node (subject to node space constraint) tends to reduce communication overhead for multi-object operations. This paper studies the optimization of correlation-aware data placement. First, we formalize a restricted form of the problem as a variant of the classic Quadratic Assignment problem and we show that it is NP-hard. Based on a linear programming relaxation, we then propose a polynomial-time approximation algorithm that finds an object placement with communication overhead at most two times that of the optimal placement. We further show that the computation cost can be reduced by limiting the optimization scope to a relatively small number of most important objects. We quantitatively evaluate our approach on keyword index placement for full-text search engines using real traces of 3.7 million web pages and 6.8 million search queries. Compared to the correlation-oblivious random object placement, our approach achieves 37-86% communication overhead reduction on a range of optimization scopes and system sizes. The communication reduction is 30-78% compared to a correlation-aware greedy approach.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"31 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":"114707018","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

PAS: A Wireless-Enabled, Cell-Phone-Incorporated Personal Assistant System for Independent and Assisted Living PAS:一种独立和辅助生活的无线移动电话个人助理系统

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

Zheng Zeng, Sammy Yu, Wook Shin, J. Hou

引用次数: 14

Measurement Manipulation and Space Selection in Network Coordinates 网络坐标中的测量操作与空间选择

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

C. Lumezanu, N. Spring

{"title":"Measurement Manipulation and Space Selection in Network Coordinates","authors":"C. Lumezanu, N. Spring","doi":"10.1109/ICDCS.2008.27","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.27","url":null,"abstract":"Internet coordinate systems have emerged as an efficient method to estimate the latency between pairs of nodes without any communication between them. However, most coordinate systems have been evaluated solely on data sets built by their authors from measurements gathered over large periods of time. Although they show good prediction results, it is unclear whether the accuracy is the result of the system design properties or is more connected to the characteristics of the data sets. In this paper, we revisit a simple question: how do the features of the embedding space and the inherent attributes of the data sets interact in producing good embeddings? We adapt the Vivaldi algorithm to use Hyperbolic space for embedding and evaluate both Euclidean and Hyperbolic Vivaldi on seven sets of real-world latencies. Our results show that node filtering and latency distributions can significantly influence the accuracy of the predictions. For example, although Euclidean Vivaldi performs well on data sets that were chosen, constructed and filtered by the designers of the algorithm, its performance and robustness decrease considerably when run on third party data sets that were not filtered a priori. Our results offer important insight into designing and building coordinate systems that are both robust and accurate in Internet-like environments.","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":"132597790","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}

引用次数: 23

On Detection of Malicious Users Using Group Testing Techniques 基于组测试技术的恶意用户检测研究

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

M. Thai, Ying Xuan, Incheol Shin, T. Znati

引用次数: 18

End-to-End Congestion Control for High Speed Networks Based on Population Ecology Models 基于种群生态模型的高速网络端到端拥塞控制

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

Xiaomeng Huang, Fengyuan Ren, Guangwen Yang, Yongwei Wu, W. Zhen, Chuang Lin

引用次数: 4

Relative Network Positioning via CDN Redirections 通过CDN重定向的相对网络定位

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

Ao-Jan Su, D. Choffnes, F. Bustamante, A. Kuzmanovic

引用次数: 24

PFC: Transparent Optimization of Existing Prefetching Strategies for Multi-Level Storage Systems PFC:多级存储系统现有预取策略的透明优化

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

Zhe Zhang, Kyuhyung Lee, Xiaosong Ma, Yuanyuan Zhou

{"title":"PFC: Transparent Optimization of Existing Prefetching Strategies for Multi-Level Storage Systems","authors":"Zhe Zhang, Kyuhyung Lee, Xiaosong Ma, Yuanyuan Zhou","doi":"10.1109/ICDCS.2008.89","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.89","url":null,"abstract":"The multi-level storage architecture has been widely adopted in servers and data centers. However, while prefetching has been shown as a crucial technique to exploit the sequentiality in accesses common for such systems and hide the increasing relative cost of disk I/O, existing multi-level storage studies have focused mostly on cache replacement strategies. In this paper, we show that prefetching algorithms designed for single-level systems may have their limitations magnified when applied to multi-level systems. Overly conservative prefetching will not be able to effectively use the lower-level cache space, while overly aggressive prefetching will be compounded across levels and generate large amounts of wasted prefetch. We take an innovative approach to this problem: rather than designing a new, multi-level prefetching algorithm, we developed prefetching-coordinator (PFC), a hierarchy-aware optimization applicable to any existing prefetching algorithms. PFC does not require any application hints, a priori knowledge on the application access pattern or the native prefetching algorithm, or modification to the I/O interface. Instead, it monitors the upper-level access patterns as well as the lower-level cache status, and dynamically adjusts the aggressiveness of the lower-level prefetching activities. We evaluated PFC with extensive simulation study using a verified multi-level storage simulator, an accurate disk simulator, and access traces with different access patterns. Our results indicate that PFC dynamically controls lower-level prefetching in reaction to multiple system and workload parameters, improving the overall system performance in all 96 test cases. Working with four well-known existing prefetching algorithms adopted in real systems, PFC obtains an improvement of up to 35% to the average request response time, with an average improvement of 14.6% over all cases.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133224615","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}

引用次数: 23