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

Optimizing File Retrieval in Delay-Tolerant Content Distribution Community 在容延迟内容分发社区中优化文件检索

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

Ying Huang, Yan Gao, K. Nahrstedt, Wenbo He

引用次数: 72

The Impact of Communication Models on Routing-Algorithm Convergence 通信模型对路由算法收敛的影响

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

A. D. Jaggard, V. Ramachandran, R. Wright

{"title":"The Impact of Communication Models on Routing-Algorithm Convergence","authors":"A. D. Jaggard, V. Ramachandran, R. Wright","doi":"10.1109/ICDCS.2009.61","DOIUrl":"https://doi.org/10.1109/ICDCS.2009.61","url":null,"abstract":"Autonomous routing algorithms, such as BGP, are intended to reach a globally consistent set of routes after nodes iteratively and independently collect, process, and share network information. Generally, the important role of the mechanism used to share information has been overlooked in previous analyses of these algorithms. In this paper, we explicitly study how the network-communication model affects algorithm convergence. To do this, we consider a variety of factors, including channel reliability, how much information is processed from channels, and how many channels are processed simultaneously. Using these factors, we define a taxonomy of communication models and identify particular models of interest, including those used in previous theoretical work, those that most closely model real-world implementations of BGP, and those of potential interest for the design of future routing algorithms. We characterize an extensive set of relationships among models in our taxonomy and show that convergence depends on the communication model in nontrivial ways. These results highlight that certain models are best for proving conditions that guarantee convergence, while other models are best for characterizing conditions that might permit nonconvergence.","PeriodicalId":387968,"journal":{"name":"2009 29th IEEE International Conference on Distributed Computing Systems","volume":"31 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":"133344921","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

FlashLite: A User-Level Library to Enhance Durability of SSD for P2P File Sharing FlashLite:一个用户级库，以提高持久性的SSD的P2P文件共享

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

Hyojun Kim, U. Ramachandran

引用次数: 14

Reducing Disk I/O Performance Sensitivity for Large Numbers of Sequential Streams 降低磁盘I/O性能对大量顺序流的敏感性

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

George Panagiotakis, Michail Flouris, A. Bilas

{"title":"Reducing Disk I/O Performance Sensitivity for Large Numbers of Sequential Streams","authors":"George Panagiotakis, Michail Flouris, A. Bilas","doi":"10.1109/ICDCS.2009.31","DOIUrl":"https://doi.org/10.1109/ICDCS.2009.31","url":null,"abstract":"Retrieving sequential rich media content from modern commodity disks is a challenging task. As disk capacity increases, there is a need to increase the number of streams that are allocated to each disk. However, when multiple streams are accessing a single disk, throughput is dramatically reduced because of disk head seek overhead, resulting in requirements for more disks. Thus, there is a tradeoff between how many streams should be allowed to access a disk and the total throughput that can be achieved. In this work we examine this tradeoff and provide an understanding of issues along with a practical solution. We use Disksim, a detailed architectural simulator, to examine several aspects of a modern I/O subsystem and we show the effect of various disk parameters on system performance under multiple sequential streams. Then, we propose a solution that dynamically adjusts I/O request streams, based on host and I/O subsystem parameters. We implement our approach in a real system and perform experiments with a small and a large disk configuration. Our approach improves disk throughput up to a factor of 4 with a workload of 100 sequential streams, without requiring large amounts of memory on the storage node. Moreover, it is able to adjust (statically) to different storage node configurations, essentially making the I/O subsystem insensitive to the number of I/O streams used.","PeriodicalId":387968,"journal":{"name":"2009 29th IEEE International Conference on Distributed Computing Systems","volume":"21 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131614593","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

Transactional Mobility in Distributed Content-Based Publish/Subscribe Systems 分布式基于内容的发布/订阅系统中的事务移动性

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

Songlin Hu, Vinod Muthusamy, Guoli Li, H. Jacobsen

引用次数: 37

The Design and Evaluation of Accountable Grid Computing System 责任网格计算系统的设计与评价

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

Wonjun Lee, A. Squicciarini, E. Bertino

引用次数: 37

EUL: An Efficient and Universal Localization Method for Wireless Sensor Network EUL:一种高效通用的无线传感器网络定位方法

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

Wei Xi, Jizhong Zhao, Xue Liu, Xiangyang Li, Yong Qi

引用次数: 10

Automatic Performance Tuning for the Virtualized Cluster System 虚拟化集群系统性能自动调优

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

Chuliang Weng, Minglu Li, Zhigang Wang, Xinda Lu

{"title":"Automatic Performance Tuning for the Virtualized Cluster System","authors":"Chuliang Weng, Minglu Li, Zhigang Wang, Xinda Lu","doi":"10.1109/ICDCS.2009.45","DOIUrl":"https://doi.org/10.1109/ICDCS.2009.45","url":null,"abstract":"System virtualization can aggregate the functionality of multiple standalone computer systems into a single hardware computer. It is significant to virtualize the computing nodes with multi-core processors in the cluster system, in order to promote the usage of the hardware while decrease the cost of the power. In the virtualized cluster system, multiple virtual machines are running on a computing node. However, it is a challenging issue to automatically balance the workload in virtual machines on each physical computing node, which is different from the traditional cluster system's load balance. In this paper, we propose a management framework for the virtualized cluster system, and present an automatic performance tuning strategy to balance the workload in the virtualized cluster system. We implement a working prototype of the management framework (VEMan) based on Xen, and test the performance of the tuning strategy on a virtualized heterogeneous cluster system. The experimental result indicates that the management framework and tuning strategy are feasible to improve the performance of the virtualized cluster system.","PeriodicalId":387968,"journal":{"name":"2009 29th IEEE International Conference on Distributed Computing Systems","volume":"59 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":"126645084","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

Lightweight Secure Search Protocols for Low-cost RFID Systems 低成本RFID系统的轻量级安全搜索协议

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

Lars Kulseng, Zhen Yu, Yawen Wei, Y. Guan

{"title":"Lightweight Secure Search Protocols for Low-cost RFID Systems","authors":"Lars Kulseng, Zhen Yu, Yawen Wei, Y. Guan","doi":"10.1109/ICDCS.2009.12","DOIUrl":"https://doi.org/10.1109/ICDCS.2009.12","url":null,"abstract":"RFID technology can potentially be used in many applications. A typical RFID system involves a reader and a number of tags, which may range from the battery-powered tags that have Wi-Fi capabilities, to the low-cost tags that are constrained in computation capacities and hardware resources. Keeping RFID systems secure is crucial since RFID systems are vulnerable to a number of malicious attacks. As for low-cost RFID systems, security problems become much more challenging, because traditional security mechanisms are infeasible to be used on low-cost tags due to their resource constraints. Tag search is an important functionality that a RFID system should provide. In this paper, we study how to secure tag search with a focus on low-cost RFID systems. Existing solutions are mostly based on hash functions and consume 8000 to 10000 gates, however, the low-cost tags can afford at most 2000 gates for secure features. In this paper, we propose several lightweight secure search protocols based on Linear Feedback Shift Registers (LFSR) and Physically Unclonable Functions (PUF). Our protocols prevent adversaries from learning tag identity and impersonating RFID reader or tags. Experimental results show that our solutions have hundreds of nanoseconds processing time and require no more than 1400 hardware gates on tags.","PeriodicalId":387968,"journal":{"name":"2009 29th IEEE International Conference on Distributed Computing Systems","volume":"70 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":"123754369","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}

引用次数: 49

REMO: Resource-Aware Application State Monitoring for Large-Scale Distributed Systems 大规模分布式系统的资源感知应用状态监控

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

S. Meng, Srinivas R. Kashyap, C. Venkatramani, Ling Liu

{"title":"REMO: Resource-Aware Application State Monitoring for Large-Scale Distributed Systems","authors":"S. Meng, Srinivas R. Kashyap, C. Venkatramani, Ling Liu","doi":"10.1109/ICDCS.2009.15","DOIUrl":"https://doi.org/10.1109/ICDCS.2009.15","url":null,"abstract":"To observe, analyze and control large scale distributed systems and the applications hosted on them, there is an increasing need to continuously monitor performance attributes of distributed system and application states. This results in application state monitoring tasks that require fine-grained attribute information to be collected from relevant nodes efficiently. Existing approaches either treat multiple application state monitoring tasks independently and build ad-hoc monitoring trees for each task, or construct a single static monitoring tree for multiple tasks. We argue that a careful planning of multiple application state monitoring tasks by jointly considering multi-task optimization and node level resource constraints can provide significant gains in performance and scalability. In this paper, we present REMO, a REsource-aware application state MOnitoring system. REMO produces a forest of optimized monitoring trees through iterations of two phases, one phase exploring cost sharing opportunities via estimation and the other refining the monitoring plan through resource-sensitive tree construction. Our experimental results include those gathered by deploying REMO on a BlueGene/P rack running IBM's large-scale distributed streaming system - System S. Using REMO running over 200 monitoring tasks for an application deployed across 200 nodes results in a 35%-45% decrease in the percentage error of collected attributes compared to existing schemes.","PeriodicalId":387968,"journal":{"name":"2009 29th IEEE International Conference on Distributed Computing Systems","volume":"9 33 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":"128080676","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