By Topic

Distributed Computing Systems, 2006. ICDCS 2006. 26th IEEE International Conference on

Date 4-7 July 2006

Filter Results

Displaying Results 1 - 25 of 85
  • 26th IEEE International Conference on Distributed Computing Systems - Cover

    Publication Year: 2006 , Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (166 KB)  
    Freely Available from IEEE
  • 26th IEEE International Conference on Distributed Computing Systems - Title

    Publication Year: 2006 , Page(s): i
    Save to Project icon | Request Permissions | PDF file iconPDF (166 KB)  
    Freely Available from IEEE
  • 26th IEEE International Conference on Distributed Computing Systems - Copyright

    Publication Year: 2006 , Page(s): iv
    Save to Project icon | Request Permissions | PDF file iconPDF (62 KB)  
    Freely Available from IEEE
  • 26th IEEE International Conference on Distributed Computing Systems - Table of contents

    Publication Year: 2006 , Page(s): v - xvii
    Save to Project icon | Request Permissions | PDF file iconPDF (91 KB)  
    Freely Available from IEEE
  • Message from the General Chair

    Publication Year: 2006 , Page(s): xix
    Save to Project icon | Request Permissions | PDF file iconPDF (38 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Program Co-chair's Message

    Publication Year: 2006 , Page(s): xxi
    Save to Project icon | Request Permissions | PDF file iconPDF (38 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Program and Organizing Committee

    Publication Year: 2006 , Page(s): xxiii
    Save to Project icon | Request Permissions | PDF file iconPDF (54 KB)  
    Freely Available from IEEE
  • Full Program Committee

    Publication Year: 2006 , Page(s): xxvi
    Save to Project icon | Request Permissions | PDF file iconPDF (192 KB)  
    Freely Available from IEEE
  • External reviewers

    Publication Year: 2006 , Page(s): xxvii
    Save to Project icon | Request Permissions | PDF file iconPDF (58 KB)  
    Freely Available from IEEE
  • Analysis of the Message Waiting Time for the FioranoMQ JMS Server

    Publication Year: 2006 , Page(s): 1
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (424 KB) |  | HTML iconHTML  

    The Java messaging service (JMS) is a means to organize communication among distributed applications according to the publish/subscribe principle. If the subscribers install filter rules on the JMS server, JMS can be used as a message routing platform, but it is not clear whether its message throughput is sufficiently high to support large-scale systems. We perform measurements for the FioranoMQ J... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Highly Available Long Running Transactions and Activities for J2EE Applications

    Publication Year: 2006 , Page(s): 2
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (490 KB) |  | HTML iconHTML  

    Today’s business applications are typically built on top of middleware platforms such as J2EE and use transactions that have evolved into long running activities able to adapt to different circumstances. Specifications, such as the J2EE Activity Service, have arised for applications requiring that support. These applications also demand high availability to prevent financial losses and/or ser... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Bridging Framework for Universal Interoperability in Pervasive Systems

    Publication Year: 2006 , Page(s): 3
    Cited by:  Papers (12)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2016 KB) |  | HTML iconHTML  

    We explore the design patterns and architectural tradeoffs for achieving interoperability across communication middleware platforms, and describe uMiddle, a bridging framework for universal interoperability that enables seamless device interaction over diverse platforms. The proliferation of middleware platforms that cater to specific devices has created isolated islands of devices with no uniform... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Loss and Queuing-Delay Controller for Router Buffer Management

    Publication Year: 2006 , Page(s): 4
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (584 KB) |  | HTML iconHTML  

    Active queue management (AQM) in routers has been proposed as a solution to some of the scalability issues associated with TCP’s pure end-to-end approach to congestion control. However, beyond congestion control, controlling queues in routers is important because unstable router queues can cause poor application performance. Existing AQM schemes explicitly try to control router queues by prob... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Confluent Capacity of the Internet: Congestion vs. Dilation

    Publication Year: 2006 , Page(s): 5
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (280 KB) |  | HTML iconHTML  

    Using shortest paths, the Internet scales very poorly with respect to congestion [2]. Two main reasons for using shortest paths are dilation (or delay) and size of routing tables. As the Internet grows, the small size of routing tables is important for scaling, but it does not require shortest paths. As long as the paths are confluent, the routing table size is unchanged. In this paper we study th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • FastFlow: A Framework for Accurate Characterization of Network Traffic

    Publication Year: 2006 , Page(s): 6
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (424 KB) |  | HTML iconHTML  

    This paper proposes a new measurement architecture and associated traffic estimation algorithm called FastFlow that uses the heavy-tailed nature of Internet traffic in order to distinguish packets belonging to short lived flows (SLFs) and long lived flows (LLFs). While complete information is stored for SLFs, only partial information related to LLFs is collected using systematic sampling. The abse... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Autonomic Management of Stream Processing Applications via Adaptive Bandwidth Control

    Publication Year: 2006 , Page(s): 7
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (312 KB) |  | HTML iconHTML  

    We present a novel autonomic control system for high performance stream processing systems. The system uses bandwidth controls on incoming or outgoing streams to achieve a desired resource utilization balance among a set of concurrently executing stream processing tasks. We show that CPU prioritization and allocation mechanisms in schedulers and virtual machine managers are not sufficient to contr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SysProf: Online Distributed Behavior Diagnosis through Fine-grain System Monitoring

    Publication Year: 2006 , Page(s): 8
    Cited by:  Papers (10)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (352 KB) |  | HTML iconHTML  

    Runtime monitoring is key to the effective management of enterprise and high performance applications. To deal with the complex behaviors of today’s multi-tier applications running across shared platforms, such monitoring must meet three criteria: (1) fine granularity, including being able to track the resource usage of specific application behaviors like individual client-server interactions... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Hierarchical Optimization Framework for Autonomic Performance Management of Distributed Computing Systems

    Publication Year: 2006 , Page(s): 9
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (488 KB) |  | HTML iconHTML  

    This paper develops a scalable online optimization framework for the autonomic performance management of distributed computing systems operating in a dynamic environment to satisfy desired quality-ofservice objectives. To efficiently solve the performance management problems of interest in a distributed setting, we develop a hierarchical structure where a highlevel limited-lookahead controller man... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Loud and Clear: Human-Verifiable Authentication Based on Audio

    Publication Year: 2006 , Page(s): 10
    Cited by:  Papers (32)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (328 KB) |  | HTML iconHTML  

    Secure pairing of electronic devices that lack any previous association is a challenging problem which has been considered in many contexts and in various flavors. In this paper, we investigate the use of audio for human-assisted authentication of previously un-associated devices. We develop and evaluate a system we call Loud-and-Clear (L&C) which places very little demand on the human user. L... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and Performance Evaluation of a Proxy-based Java Rewriting Security System

    Publication Year: 2006 , Page(s): 11
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (432 KB) |  | HTML iconHTML  

    Binary rewriting techniques have been developed to allow users to enforce security policies directly on mobile code. However, the performance overheads incurred for improved security, particularly in large organizations with many end-hosts, accentuate the inherent challenges of code rewriting and limit the rate of improvement in these systems. We integrate a binary code rewriter with a web caching... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Store, Forget, and Check: Using Algebraic Signatures to Check Remotely Administered Storage

    Publication Year: 2006 , Page(s): 12
    Cited by:  Papers (30)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (384 KB) |  | HTML iconHTML  

    The emerging use of the Internet for remote storage and backup has led to the problem of verifying that storage sites in a distributed system indeed store the data; this must often be done in the absence of knowledge of what the data should be. We use m/n erasure-correcting coding to safeguard the stored data and use algebraic signatures hash functions with algebraic properties for verification. O... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • WhoPay: A Scalable and Anonymous Payment System for Peer-to-Peer Environments

    Publication Year: 2006 , Page(s): 13
    Cited by:  Papers (9)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (408 KB) |  | HTML iconHTML  

    An electronic payment system ideally should provide security, anonymity, fairness, transferability and scalability. Existing payment schemes often lack either anonymity or scalability. In this paper we propose WhoPay, a peer-topeer payment system that provides all the above properties. For anonymity, we represent coins with public keys; for scalability, we distribute coin transfer load across all ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust Accounting in Decentralized P2P Storage Systems

    Publication Year: 2006 , Page(s): 14
    Cited by:  Papers (8)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (352 KB) |  | HTML iconHTML  

    A peer-to-peer (P2P) storage system allows a network of peer computers to increase the availability of their data by replicating it on other peers in the network. In such networks, a central challenge is preventing "freeloaders", or nodes that use disproportionately more storage on other peers than they contribute to the network. While several existing systems claim to solve this problem, we show ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Elastic Routing Table with Provable Performance for Congestion Control in DHT Networks

    Publication Year: 2006 , Page(s): 15
    Cited by:  Papers (3)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (320 KB) |  | HTML iconHTML  

    Distributed hash table (DHT) networks based on consistent hashing functions have an inherent load balancing problem. The problem becomes more severe due to the heterogeneity of network nodes and the non-uniform and timevarying file popularity. Existing DHT load balancing algorithms are mainly focused on the issues caused by node heterogeneity. To deal with skewed lookups, this paper presents an el... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computing in the Presence of Timing Failures

    Publication Year: 2006 , Page(s): 16
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (240 KB) |  | HTML iconHTML  

    Timing failures refer to a situation where the environment in which a system operates does not behave as expected regarding the timing assumptions, that is, the timing constraints are not met. In the immense body of work on the designing fault-tolerant systems, the type of failures that are usually considered are, process failures, link failures, messages loss and memory failures; and it is usuall... View full abstract»

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