By Topic

25th IEEE International Conference on Distributed Computing Systems Workshops

Date 6-10 June 2005

Filter Results

Displaying Results 1 - 25 of 144
  • Proceedings. 25th IEEE International Conference on Distributed Computing Systems Workshops

    Publication Year: 2005
    Request permission for commercial reuse | PDF file iconPDF (53 KB)
    Freely Available from IEEE
  • 25th IEEE International Conference on Distributed Computing Systems Workshops - Title Page

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

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

    Publication Year: 2005, Page(s):v - xiv
    Request permission for commercial reuse | PDF file iconPDF (79 KB)
    Freely Available from IEEE
  • Message from the Workshops Chair

    Publication Year: 2005, Page(s): xv
    Request permission for commercial reuse | PDF file iconPDF (26 KB) | HTML iconHTML
    Freely Available from IEEE
  • Message from the ADSN Chairs

    Publication Year: 2005, Page(s): xvi
    Request permission for commercial reuse | PDF file iconPDF (25 KB) | HTML iconHTML
    Freely Available from IEEE
  • Workshop Committee Members

    Publication Year: 2005, Page(s):xxv - xxxii
    Request permission for commercial reuse | PDF file iconPDF (47 KB)
    Freely Available from IEEE
  • Adding confidentiality to application-level multicast by leveraging the multicast overlay

    Publication Year: 2005, Page(s):5 - 11
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (152 KB) | HTML iconHTML

    While scalability, routing and performance are core issues for application-level multicast (ALM) protocols, an important but less studied problem is security. In particular, confidentiality (i.e. data secrecy, achieved through data encryption) in ALM protocols is needed. Key management schemes must be simple, scalable, and must not degrade the performance of the ALM protocol. We explore three key ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Byzantine fault-tolerant mutual exclusion algorithm and its application to Byzantine fault-tolerant storage systems

    Publication Year: 2005, Page(s):12 - 19
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (128 KB) | HTML iconHTML

    This paper presents a new distributed mutual exclusion protocol that can tolerate Byzantine faults. We use the protocol to create Byzantine fault-tolerant storage systems. We show a necessary and sufficient condition to achieve distributed Byzantine fault-tolerant mutual exclusion. The condition is n ≥ 3f+1 where n is the number of servers and f is the number of Byzantine failure servers, which... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Zmail: zero-sum free market control of spam

    Publication Year: 2005, Page(s):20 - 26
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (192 KB) | HTML iconHTML

    The problem of spam is a classic "tragedy of the commons" (G. Hardin, 1968). We propose the Zmail protocol as a way to preserve email as a "free" common resource for most users, while imposing enough cost on bulk mailers so that market forces control the volume of spam. A key idea behind Zmail is that the most important resource consumed by email is not the transmission process but the end user's ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • State checksum and its role in system stabilization

    Publication Year: 2005, Page(s):29 - 34
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (93 KB) | HTML iconHTML

    Although a self-stabilizing system that suffers from a transient fault is guaranteed to converge to a legitimate state after a finite number of steps, the convergence can be slow if the harmful effects of the fault are allowed to propagate into many processes in the system. Moreover, some safety properties of the system may be violated during the convergence. To address these problems, we propose ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An optimal snap-stabilizing multi-wave algorithm

    Publication Year: 2005, Page(s):35 - 41
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB) | HTML iconHTML

    In real-time systems, correct information is needed fast, so developing fast and accurate algorithms is a must. Algorithms must be resilient to transient faults and topology changes. The capability to adapt to heterogeneous and changing requirements is the core of assurance in distributed systems. A snap-stabilizing algorithm, starting from an arbitrary system configuration, always behaves accordi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reconciling the theory and practice of (un)reliable wireless broadcast

    Publication Year: 2005, Page(s):42 - 48
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (136 KB) | HTML iconHTML

    Theorists and practitioners have fairly different perspectives on how wireless broadcast works. Theorists think about synchrony; practitioners think about backoff. Theorists assume reliable communication; practitioners worry about collisions. The examples are endless. Our goal is to begin to reconcile the theory and practice of wireless broadcast, in the presence of failures. We propose new models... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic load balancing using network transferable computer

    Publication Year: 2005, Page(s):51 - 57
    Cited by:  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (896 KB) | HTML iconHTML

    This paper proposes a new dynamic load balancing (DLB) method for network traffic. In client-server systems, intense access to a particular server host often causes excessive traffic on a path connected to the server. Although mirror servers are used for load balancing of host performance, this may not be sufficient to balance the load of network traffic. In the DLB method a server has the capabil... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementation issues of parallel downloading methods for a proxy system

    Publication Year: 2005, Page(s):58 - 64
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (192 KB) | HTML iconHTML

    The parallel downloading technology is expected to utilize broad bandwidth and fetch a file quickly, retrieving each piece from a different server in parallel. When users retrieve a file from mirror servers in parallel, it is important that the files on the mirror servers should be identical. We have already proposed a proxy system which can ensure the sameness of files for users. In this paper we... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Voting multi-dimensional data with deviations for Web services under group testing

    Publication Year: 2005, Page(s):65 - 71
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (152 KB) | HTML iconHTML

    Web services (WS) need to be trustworthy to be used in critical applications. A technique called WS group testing has been proposed which can significantly reduce the cost of testing and ranking a large number of WS. A main feature of WS group testing is that it is able to establish the test oracles for the given test inputs from multiple WS and infer the oracles by plural voting. Efficient voting... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new TCP congestion control method considering adaptability over satellite Internet

    Publication Year: 2005, Page(s):75 - 81
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB) | HTML iconHTML

    Most standard implementations of congestion control method perform poorly in the satellite Internet due to both a high bit error rate and a long propagation delay. This paper proposes a new TCP congestion control method called TCP-STAR to improve both TCP performance and adaptability of network conditions over the satellite Internet. The performance and the adaptability of network conditions are m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving multipath reliability in topology-aware overlay networks

    Publication Year: 2005, Page(s):82 - 88
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (216 KB) | HTML iconHTML

    Use of multiple paths between node pairs can enable an overlay network to bypass Internet link failures. Selecting high quality primary and backup paths is challenging, however. To maximize communication reliability, an overlay multipath routing protocol must account for both the failure probability of a single path and link sharing among multiple paths. We propose a practical solution that exploi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bandwidth clustering for reliable and prioritized network routing using split agent-based method

    Publication Year: 2005, Page(s):89 - 94
    Cited by:  Papers (1)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (152 KB) | HTML iconHTML

    Recent researches have highlighted the importance of developing a network with distributed problem solving abilities thus enhancing reliability with equal share of network resources. While several centralized schemes have been proposed for efficient path marking and capacity reservation, the decentralized approach is one of the motivating reasons for employing adaptive behavior of swarm-based agen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Message from the SDCS Chairs

    Publication Year: 2005, Page(s): xvii
    Request permission for commercial reuse | PDF file iconPDF (23 KB) | HTML iconHTML
    Freely Available from IEEE
  • InFilter: predictive ingress filtering to detect spoofed IP traffic

    Publication Year: 2005, Page(s):99 - 106
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (192 KB) | HTML iconHTML

    Cyber-attackers often use incorrect source IP addresses in attack packets (spoofed IP packets) to achieve anonymity, reduce the risk of trace-back and avoid detection. We present the predictive ingress filtering (InFilter) approach for network-based detection of spoofed IP packets near cyber-attack targets. Our InFilter hypothesis states that traffic entering an IP network from a specific source f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Active timing-based correlation of perturbed traffic flows with chaff packets

    Publication Year: 2005, Page(s):107 - 113
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (176 KB) | HTML iconHTML

    Network intruders usually launch their attacks through a chain of intermediate stepping stone hosts in order to hide their identities. Detecting such stepping stone attacks is difficult because packet encryption, timing perturbations, and meaningless chaff packets can all be utilized by attackers to evade from detection. In this paper, we propose a method based on packet matching and timing-based ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Specifying information-flow controls

    Publication Year: 2005, Page(s):114 - 120
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (152 KB) | HTML iconHTML

    The core problem in risk analysis - determining exploitable paths between attackers and system assets - is essentially a problem of determining information flow. It is relatively straightforward to interpret design models for service-based distributed systems in information-flow terms, but the analysis results must be integrated into the system engineering process, and any resulting security contr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MAFIC: adaptive packet dropping for cutting malicious flows to push back DDoS attacks

    Publication Year: 2005, Page(s):123 - 129
    Cited by:  Papers (7)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (168 KB) | HTML iconHTML

    In this paper, we propose a new approach called MAFIC (malicious flow identification and cutoff) to support adaptive packet dropping to fend off DDoS attacks. MAFIC works by judiciously issuing lightweight probes to flow sources to check if they are legitimate. Through such probing, MAFIC would drop malicious attack packets with high accuracy while minimizes the loss on legitimate traffic flows. O... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performing BGP experiments on a semi-realistic Internet testbed environment

    Publication Year: 2005, Page(s):130 - 136
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1208 KB) | HTML iconHTML

    We have built a router testbed that is connected to the Deter/Emist experimental infrastructure. Our goal is to create a semi-realistic testbed to conduct BGP experiments, measure and visualize their impact on network performance and stability. Such testbed is also useful for evaluating different security countermeasures. Our testbed architecture includes four components: routing topology, backgro... View full abstract»

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