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

Distributed Key Generation for the Internet 互联网的分布式密钥生成

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

Aniket Kate, I. Goldberg

引用次数: 79

On the Impossibility of Maximal Scheduling for Strong Fairness with Interleaving 具有交错的强公平性的最大调度的不可能性

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

Matthew Lang, P. Sivilotti

引用次数: 7

The Case for Spam-Aware High Performance Mail Server Architecture 可识别垃圾邮件的高性能邮件服务器体系结构的案例

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

Abhinav Pathak, Syed Ali, Raza Jafri, Y. C. Hu

{"title":"The Case for Spam-Aware High Performance Mail Server Architecture","authors":"Abhinav Pathak, Syed Ali, Raza Jafri, Y. C. Hu","doi":"10.1109/ICDCS.2009.74","DOIUrl":"https://doi.org/10.1109/ICDCS.2009.74","url":null,"abstract":"The email volume per mailbox has largely remained low and unchanged in the past several decades, and hence mail server performance has largely remained a secondary issue. The steep rise in the amount of unsolicited emails, i.e. spam, in the past decade, however, has permanently disrupted this tranquility of largely steady email volume and turned mail server performance into an increasingly important issue. In this paper, we point out that modern mail servers were not originally designed with email spam in mind, and as such, as the \"common case'' workload for mail servers has shifted from legitimate emails to spam emails, we argue it is time to revisit mail server architecture design in following the system design principle of optimizing the common case. In particular, we show how to optimize the performance of three major components of modern mail servers, the concurrency architecture, the disk I/O, and DNSBL lookups, by exploiting the new \"common case\" workload. An evaluation of our prototype implementation of the enhanced postfix architecture shows that the optimizations significantly reduce the CPU, disk, and network resource consumptions, and improves the throughput of the mail server by 18% under a university departmental mail server workload and by 40% under a spam sinkhole workload.","PeriodicalId":387968,"journal":{"name":"2009 29th IEEE International Conference on Distributed Computing Systems","volume":"32 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":"134176510","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}

引用次数: 6

On Optimal Concurrency Control for Optimistic Replication 乐观复制的最优并发控制

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

Weihan Wang, C. Amza

{"title":"On Optimal Concurrency Control for Optimistic Replication","authors":"Weihan Wang, C. Amza","doi":"10.1109/ICDCS.2009.71","DOIUrl":"https://doi.org/10.1109/ICDCS.2009.71","url":null,"abstract":"Concurrency control is a core component in optimistic replication systems. To detect concurrent updates, the system associates each replicated object with metadata, such as, version vectors or causal graphs exchanged on synchronization opportunities. However, the size of such metadata increases at least linearly with the number of active sites. With recent trends in cloud computing, multi-regional collaboration, and mobile networks, the number of sites within a single replication system becomes very large. This imposes substantial overhead in communication and computation on every site. In this paper, we first present three version vector implementations that significantly reduce the cost of vector exchange by incrementally transferring vector elements. Basic rotating vectors (BRV) support systems providing no conflict reconciliation, whereas conflict rotating vectors (CRV) extend BRV to overcome this limitation. Skip rotating vectors (SRV) based on CRV further reduce data transmission. We show that both BRV and SRV are optimal implementations of version vectors, which, in turn, have minimal storage complexity among all known concurrency control schemes for state-transfer systems. We then present a causal graph exchange algorithm for operation-transfer systems with optimal communication overhead. All these algorithms adopt network pipelining to reduce running time.","PeriodicalId":387968,"journal":{"name":"2009 29th IEEE International Conference on Distributed Computing Systems","volume":"379 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":"134628005","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

Sampling Based (epsilon, delta)-Approximate Aggregation Algorithm in Sensor Networks 传感器网络中基于采样的(epsilon, delta)-近似聚合算法

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

Siyao Cheng, Jianzhong Li

引用次数: 30

TDMA-ASAP: Sensor Network TDMA Scheduling with Adaptive Slot-Stealing and Parallelism TDMA- asap:具有自适应偷槽和并行性的传感器网络TDMA调度

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

Sameh Gobriel, D. Mossé, Robert Cleric

引用次数: 95

A Note on Distributed Stable Matching 关于分布式稳定匹配的一个注记

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

Alexander Kipnis, B. Patt-Shamir

引用次数: 12

Implementing a Register in a Dynamic Distributed System 动态分布式系统中寄存器的实现

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

R. Baldoni, Silvia Bonomi, Anne-Marie Kermarrec, M. Raynal

{"title":"Implementing a Register in a Dynamic Distributed System","authors":"R. Baldoni, Silvia Bonomi, Anne-Marie Kermarrec, M. Raynal","doi":"10.1109/ICDCS.2009.46","DOIUrl":"https://doi.org/10.1109/ICDCS.2009.46","url":null,"abstract":"Providing distributed processes with concurrent objects is a fundamental service that has to be offered by any distributed system. The classical shared read/write register is one of the most basic ones. Several protocols have been proposed that build an atomic register on top of an asyn- chronous message-passing system prone to process crashes. In the same spirit, this paper addresses the implementation of a regular register (a weakened form of an atomic register) in an asynchronous dynamic message-passing system. The aim is here to cope with the net effect of the adversaries that are asynchrony and dynamicity (the fact that processes can enter and leave the system). The paper focuses on the class of dynamic systems the churn rate c of which is constant. It presents two protocols, one applicable to synchronous dynamic message passing systems, the other one to even- tually synchronous dynamic systems. Both protocols rely on an appropriate broadcast communication service (similar to a reliable broadcast). Each requires a specific constraint on the churn rate c. Both protocols are first presented in an as intuitive as possible way, and are then proved correct.","PeriodicalId":387968,"journal":{"name":"2009 29th IEEE International Conference on Distributed Computing Systems","volume":"28 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":"133608537","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}

引用次数: 54

Information Value-Driven Near Real-Time Decision Support Systems 信息价值驱动的近实时决策支持系统

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

Ying Yan, Wen-Syan Li, Jian Xu

{"title":"Information Value-Driven Near Real-Time Decision Support Systems","authors":"Ying Yan, Wen-Syan Li, Jian Xu","doi":"10.1109/ICDCS.2009.17","DOIUrl":"https://doi.org/10.1109/ICDCS.2009.17","url":null,"abstract":"In this paper, we focus on challenges of supporting a decision support system (DSS) based on a hybrid approach (i.e. a federation system with data placement) for agile business intelligence applications. A DSS needs to be designed to handle a workload of potentially complex queries for important decision-making processes. The response time requirement (and a realistic goal) for such a DSS is near real time. The users of a DSS care about not only the response time but also the time stamp of the business operation report since both of them introduce uncertainty and risks to business decision-making. In our proposed DSS, each report is assigned with a business value; denoting its importance to business decision-making. An Information Value (IV) is a business value of a report discounted by time to reflex the uncertainty and risks associated with the computational latency and synchronization latency. We propose a novel Information Value-driven Query Processing (IVQP) framework specific for near real time DSS applications. The framework enables dynamic query plan selection by taking into account of information value and adaptation for online-arrival ad hoc queries. The framework works with single query as well as a workload of queries. The experimental results based on synthetic data and TPC-H show the effectiveness of our approach in achieving optimal information values for the workloads.","PeriodicalId":387968,"journal":{"name":"2009 29th IEEE International Conference on Distributed Computing Systems","volume":"42 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":"131141580","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}

引用次数: 3

On the Connected k-Coverage Problem in Heterogeneous Sensor Nets: The Curse of Randomness and Heterogeneity 异构传感器网络中的连通k-覆盖问题:随机性和异质性的诅咒

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

H. Ammari, John Giudici

引用次数: 47