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

Distributed Divide-and-Conquer Techniques for Effective DDoS Attack Defenses 有效防御DDoS攻击的分布式分治技术

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

M. Muthuprasanna, G. Manimaran

{"title":"Distributed Divide-and-Conquer Techniques for Effective DDoS Attack Defenses","authors":"M. Muthuprasanna, G. Manimaran","doi":"10.1109/ICDCS.2008.10","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.10","url":null,"abstract":"Distributed Denial-of-Service (DDoS) attacks have emerged as a popular means of causing mass targeted service disruptions, often for extended periods of time. The relative ease and low costs of launching such attacks, supplemented by the current woeful state of any viable defense mechanism, have made them one of the top threats to the Internet community today. While distributed packet logging and/or packet marking have been explored in the past for DDoS attack traceback/mitigation, we propose to advance the state of the art by using a novel distributed divide-and-conquer approach in designing a new data dissemination architecture that efficiently tracks attack sources. The main focus of our work is to tackle the three disjoint aspects of the problem, namely attack tree construction, attack path frequency detection, and packet to path association, independently and to use succinct recurrence relations to express their individual implementations. We also evaluate the network traffic and storage overhead induced by our proposed deployment on real-life Internet topologies, supporting hundreds of victims each subject to thousands of high-bandwidth flows simultaneously, and conclude that we can truly achieve single packet traceback guarantees with minimal overhead and high efficiency.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"45 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":"134193164","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}

引用次数: 21

Improving Energy Conservation Using Bulk Transmission over High-Power Radios in Sensor Networks 利用传感器网络中大功率无线电的批量传输提高节能

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

C. Sengul, Mehedi Bakht, A. Harris, T. Abdelzaher, R. Kravets

引用次数: 27

Heuristics-Based Strategies for Resolving Context Inconsistencies in Pervasive Computing Applications 基于启发式的解决普适计算应用中上下文不一致的策略

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

Chang Xu, S. Cheung, W. Chan, Chunyang Ye

引用次数: 45

Sensor Node Localization Using Uncontrolled Events 使用非受控事件的传感器节点定位

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

Ziguo Zhong, Dan Wang, T. He

{"title":"Sensor Node Localization Using Uncontrolled Events","authors":"Ziguo Zhong, Dan Wang, T. He","doi":"10.1109/ICDCS.2008.44","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.44","url":null,"abstract":"Many event-driven localization methods have been proposed as low cost, energy efficient solutions for wireless senor networks. In order to eliminate the requirement of accurately controlled events in existing approaches, we present a practical design using totally uncontrolled events for stationary sensor node positioning. The novel idea of this design is to estimate both the event generation parameters and the location of each sensor node by processing node sequences easily obtained from uncontrolled event distribution. To demonstrate the generality of our design, both straight-line scan and circular wave propagation events are addressed in this paper, and we evaluated our approach through theoretical analysis, extensive simulation and a physical test bed implementation with 41 MICAz motes. The evaluation results illustrate that with only randomly generated events, our solution can effectively localize sensor nodes with excellent flexibility while adding no extra cost at the resource constrained sensor node side. In addition, localization using uncontrolled events provides a nice potential option of achieving node positioning through natural ambient events.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"35 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":"115254729","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}

引用次数: 24

Data Estimation in Sensor Networks Using Physical and Statistical Methodologies 传感器网络中使用物理和统计方法的数据估计

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

Yingshu Li, Chunyu Ai, Wiwek P. Deshmukh, Yiwei Wu

引用次数: 19

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

Fully Adaptive Power Saving Protocols for Ad Hoc Networks Using the Hyper Quorum System 使用超仲裁系统的Ad Hoc网络的完全自适应节能协议

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

Shan-Hung Wu, Ming-Syan Chen, Chung-Min Chen

{"title":"Fully Adaptive Power Saving Protocols for Ad Hoc Networks Using the Hyper Quorum System","authors":"Shan-Hung Wu, Ming-Syan Chen, Chung-Min Chen","doi":"10.1109/ICDCS.2008.88","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.88","url":null,"abstract":"Quorum-based power saving (QPS) protocols have been proposed for ad hoc networks (e.g., IEEE 802.11 ad hoc mode) to increase energy efficiency and prolong the operational time of mobile stations. These protocols assign to each station a cycle pattern that specifies when the station should wake up (to transmit/receive data) and sleep (to save battery power). In all existing QPS protocols, the cycle length is either identical for all stations or is restricted to certain numbers (e.g. squares or primes). These restrictions on cycle length severely limit the practical use of QPS protocols as each individual station may want to select a cycle length that is best suited for its own need (in terms of remaining battery power, tolerable packet delay, and drop ratio). In this paper we propose the notion of hyper quorum system (HQS)-a generalization of QPS that allows for arbitrary cycle lengths. We describe algorithms to generate two different classes of HQS given any set of arbitrary cycle lengths as input. We then present analytical and simulation results that show the benefits of HQS-based power saving protocols over the existing QPS protocols.","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":"126560852","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

Availability and Fairness Support for Storage QoS Guarantee 存储QoS保障的可用性和公平性支持

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

Gang Peng, T. Chiueh

{"title":"Availability and Fairness Support for Storage QoS Guarantee","authors":"Gang Peng, T. Chiueh","doi":"10.1109/ICDCS.2008.107","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.107","url":null,"abstract":"Multi-dimensional storage virtualization (MDSV) technology allows multiple virtual disks, each with a distinct combination of capacity, latency and bandwidth requirements, to be multiplexed on a physical disk storage system with performance isolation. This paper presents novel design and implementation techniques that solve the availability guarantee and fairness assurance problems in multi-dimensional storage virtualization. First, we show that a measurement-based admission control algorithm can reduce the effective resource requirement of a virtual disk with availability guarantee by accurately estimating its resource needs without prior knowledge of its input workload characteristics. Moreover, to accurately factor disk access overhead into real-time disk request scheduling algorithm, we propose a virtual disk switching overhead extraction and distribution algorithm that can derive the intrinsic disk access overhead associated with each virtual disk so as to achieve perfect performance isolation. Finally, we develop an adaptive server time leap-forward algorithm to effectively address the short-term unfairness problem of virtual clock-based disk scheduler, the only known proportional-share scheduler that is based on wall-clock time and thus enables disk utilization efficiency optimization while delivering disk QoS guarantees.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"46 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":"127205786","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

Byzantine Fault-Tolerant Web Services for n-Tier and Service Oriented Architectures 用于n层和面向服务架构的拜占庭式容错Web服务

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

Sajeeva L. Pallemulle, Haraldur D. Thorvaldsson, K. Goldman

引用次数: 33

QoS Scheduling for Networked Storage System 网络存储系统QoS调度

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

Yingping Lu, D. Du, Chuanyi Liu, Xianbo Zhang

引用次数: 4