By Topic

27th International Conference on Distributed Computing Systems (ICDCS '07)

Date 25-27 June 2007

Filter Results

Displaying Results 1 - 25 of 77
  • 27th International Conference on Distributed Computing Systems - Cover

    Publication Year: 2007, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (31 KB)
    Freely Available from IEEE
  • 27th International Conference on Distributed Computing Systems - Title page

    Publication Year: 2007, Page(s):i - iii
    Request permission for commercial reuse | PDF file iconPDF (28 KB)
    Freely Available from IEEE
  • 27th International Conference on Distributed Computing Systems - Copyright

    Publication Year: 2007, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (37 KB)
    Freely Available from IEEE
  • 27th International Conference on Distributed Computing Systems - Table of contents

    Publication Year: 2007, Page(s): v
    Request permission for commercial reuse | PDF file iconPDF (75 KB)
    Freely Available from IEEE
  • Message from the General Chair

    Publication Year: 2007, Page(s): xii
    Request permission for commercial reuse | PDF file iconPDF (21 KB) | HTML iconHTML
    Freely Available from IEEE
  • Message from the Program Chair

    Publication Year: 2007, Page(s): xiii
    Request permission for commercial reuse | PDF file iconPDF (22 KB) | HTML iconHTML
    Freely Available from IEEE
  • Committee Organization

    Publication Year: 2007, Page(s): xiv
    Request permission for commercial reuse | PDF file iconPDF (26 KB)
    Freely Available from IEEE
  • Technical Program Committee

    Publication Year: 2007, Page(s): xv
    Request permission for commercial reuse | PDF file iconPDF (35 KB)
    Freely Available from IEEE
  • list-reviewer

    Publication Year: 2007, Page(s): xvi
    Request permission for commercial reuse | PDF file iconPDF (32 KB)
    Freely Available from IEEE
  • Panel - Looking ahead: A ten-year outlook for internet security and privacy

    Publication Year: 2007, Page(s): xvii
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (19 KB)

    Summary form only given, as follows. Internet attacks are no longer for fun. Driven by financial gain, well-organized criminal groups, operating internationally while facing little obstruction from law enforcement, are collaborating to rapidly discover and exploit new vulnerabilities. These skilled professionals are using increasingly sophisticated attacks that target both businesses and individua... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Virtual Node-Based Tracking Algorithm for Mobile Networks

    Publication Year: 2007, Page(s): 1
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (219 KB) | HTML iconHTML

    We introduce a virtual-node based mobile object tracking algorithm for mobile sensor networks, VINESTALK. The algorithm uses the virtual stationary automata programming layer, consisting of mobile clients, virtual timed machines distributed at known locations in the plane, called virtual stationary automata (VSAs), and a communication service connecting VSAs and mobile clients. VINESTALK maintains... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting Symbolic Techniques in Automated Synthesis of Distributed Programs with Large State Space

    Publication Year: 2007, Page(s): 3
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (262 KB) | HTML iconHTML

    Automated formal analysis methods such as program verification and synthesis algorithms often suffer from time complexity of their decision procedures and also high space complexity known as the state explosion problem. Symbolic techniques, in which elements of a problem are represented by Boolean formulae, are desirable in the sense that they often remedy the state explosion problem and time comp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Streaming Algorithms for Robust, Real-Time Detection of DDoS Attacks

    Publication Year: 2007, Page(s): 4
    Cited by:  Papers (6)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (233 KB) | HTML iconHTML

    Effective mechanisms for detecting and thwarting distributed denial-of-service (DDoS) attacks are becoming increasingly important to the success of today's Internet as a viable commercial and business tool. In this paper, we propose novel data-streaming algorithms for the robust, real-time detection of DDoS activity in large ISP networks. The key element of our solution is a new, hash-based synops... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effective mechanisms for detecting and thwarting Distributed

    Publication Year: 2007, Page(s): 5
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (973 KB) | HTML iconHTML

    The emergence of applications producing continuous high-frequency data streams has brought forth a large body of research in the area of distributed stream processing. In presence of high volumes of data, efforts have primarily concentrated on providing approximate aggregate or top-k type results. Scalable solutions for providing answers to window join queries in distributed stream processing syst... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast Algorithms for Heavy Distinct Hitters using Associative Memories

    Publication Year: 2007, Page(s): 6
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (184 KB) | HTML iconHTML

    Real-time detection of worm attacks, port scans and distributed denial of service (DDoS) attacks, as network packets belonging to these security attacks flow through a network router, is of paramount importance. In a typical worm attack, a worm infected host tries to spread the worm by scanning a number of other hosts thus resulting in significant number of network connections at an intermediate r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Protocol Design and Optimization for Delay/Fault-Tolerant Mobile Sensor Networks

    Publication Year: 2007, Page(s): 7
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (149 KB) | HTML iconHTML

    While extensive studies have been carried out in the past several years for many sensor applications, they cannot be applied to the network with extremely low and intermittent connectivity, dubbed the delay/fault-tolerant mobile sensor network (DFT-MSN). Without end-to-end connections due to sparse network density and sensor node mobility, routing in DFT-MSN becomes localized and ties closely to m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • uSense: A Unified Asymmetric Sensing Coverage Architecture for Wireless Sensor Networks

    Publication Year: 2007, Page(s): 8
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (467 KB) | HTML iconHTML

    As a key approach to achieve energy efficiency in sensor networks, sensing coverage has been studied extensively. Researchers have designed many coverage protocols to provide various kinds of service guarantees on the network lifetime, coverage ratio and detection delay. While these protocols are effective, they are not flexible enough to meet multiple design goals simultaneously. In this paper, w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Non-Threshold based Event Detection for 3D Environment Monitoring in Sensor Networks

    Publication Year: 2007, Page(s): 9
    Cited by:  Papers (22)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (430 KB) | HTML iconHTML

    Event detection is a crucial task for wireless sensor network applications, especially environment monitoring. Existing approaches for event detection are mainly based on some predefined threshold values, and thus are often inaccurate and incapable of capturing complex events. For example, in coal mine monitoring scenarios, gas leakage or water osmosis can hardly be described by the overrun of spe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Multiphased Approach for Modeling and Analysis of the BitTorrent Protocol

    Publication Year: 2007, Page(s): 10
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (594 KB) | HTML iconHTML

    BitTorrent is one of the most popular protocols for content distribution and accounts for more than 15% of the total Internet traffic. In this paper, we present an analytical model of the protocol. Our work differs from previous works as it models the BitTorrent protocol specifically and not as a general file-swarming protocol. In our study, we observe that to accurately model the download process... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Execution of Continuous Incoherency Bounded Queries over Multi-Source Streaming Data

    Publication Year: 2007, Page(s): 11
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (195 KB) | HTML iconHTML

    On-line decision making often involves query processing over time-varying data which arrives in the form of data streams from distributed locations. In such environments typically, a user application is interested in the value of some function defined over the data items. For example, the traffic management system can make control decisions based on the observed traffic at major intersections; sto... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automated Storage Reclamation Using Temporal Importance Annotations

    Publication Year: 2007, Page(s): 12
    Cited by:  Papers (1)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 KB) | HTML iconHTML

    This work focuses on scenarios that require the storage of large amounts of data. Such systems require the ability to either continuously increase the storage space or reclaim space by deleting contents. Traditionally, storage systems relegated object reclamation to applications. In this work, content creators explicitly annotate the object using a temporal importance function. The storage system ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • LagOver: Latency Gradated Overlays

    Publication Year: 2007, Page(s): 13
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (230 KB) | HTML iconHTML

    We propose a new genre of overlay network for disseminating information from popular but resource constrained sources. We call this communication primitive as latency gradated overlay, where information consumers self- organize themselves according to their individual resource constraints and the latency they are willing to tolerate in receiving the information from the source. Such a communicatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Defragmenting DHT-based Distributed File Systems

    Publication Year: 2007, Page(s): 14
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB) | HTML iconHTML

    Existing DHT-based file systems use consistent hashing to assign file blocks to random machines. As a result, a user task accessing an entire file or multiple files needs to retrieve blocks from many different machines. This paper demonstrates that significant availability and performance gains can be achieved if instead, users are able to retrieve all the data needed for a given task from only a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Flashback: A Peer-to-PeerWeb Server for Flash Crowds

    Publication Year: 2007, Page(s): 15
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (193 KB) | HTML iconHTML

    We present Flashback, a ready-to-use system for scalably handling large unexpected traffic spikes on web-sites. Unlike previous systems, our approach does not rely on any intermediate nodes to cache content. Instead, the clients (browsers) create a dynamic, self-scaling peer-to-peer (P2P) Web-server that grows and shrinks according to the load. This approach translates into a challenging problem -... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Selfishness, Not Always A Nightmare: Modeling Selfish MAC Behaviors in Wireless Mobile Ad Hoc Networks

    Publication Year: 2007, Page(s): 16
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (310 KB) | HTML iconHTML

    In wireless mobile ad hoc networks where nodes are selfish and non-cooperative, a natural and crucial question is how well or how bad the MAC layer protocol IEEE 802.11 DCF performs. In this paper, we study this question by modeling the selfish MAC protocol as a non- cooperative repeated game where players follow the TIT- FOR-TAT (TFT) strategy which is regarded as the best strategy in such enviro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.