By Topic

Proceedings. 19th IEEE International Conference on Distributed Computing Systems (Cat. No.99CB37003)

5-5 June 1999

Filter Results

Displaying Results 1 - 25 of 59
  • Proceedings. 19th IEEE International Conference on Distributed Computing Systems (Cat. No.99CB37003)

    Publication Year: 1999
    Request permission for commercial reuse | PDF file iconPDF (301 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 1999, Page(s):553 - 554
    Request permission for commercial reuse | PDF file iconPDF (221 KB)
    Freely Available from IEEE
  • Replicated directory service for weakly consistent distributed caches

    Publication Year: 1999, Page(s):92 - 100
    Cited by:  Papers (4)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (136 KB)

    Relais is a replicated directory service that improves Web caching within an organization. Relais connects a distributed set of caches and mirrors, providing the abstraction of a single consistent, shared cache. Relais is based on a replication protocol that exploits the semantics of user requests to guarantee cache coherence. The protocol also exploits the semantics of origin servers to optimize ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ETE: a customizable approach to measuring end-to-end response times and their components in distributed systems

    Publication Year: 1999, Page(s):152 - 162
    Cited by:  Papers (6)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1944 KB)

    Detecting and resolving performance problems in distributed systems often requires measurements of end-to-end (“finger tip to eyeball”) response times. Existing approaches embed transaction definitions in instrumentation codes. As a result, service providers (e.g., ISPs) cannot tailor transaction definitions to the usage patterns of their customers. We propose a new approach-ETE (end-t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stateful group communication services

    Publication Year: 1999, Page(s):82 - 89
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (104 KB)

    Reliable group multicasts provide a nice abstraction for communicating data reliably among group members and have been used for a variety of applications. In this paper we present Corona, a group communication service for building collaboration tools and reliable data dissemination services in Web-based environments, where clients connect independently of other clients and are not necessarily conn... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Search space reduction in QoS routing

    Publication Year: 1999, Page(s):142 - 149
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (280 KB)

    To provide real time service, integrated networks require the underlying routing algorithm to be able to find low cost paths that satisfy given Quality of Service (QoS) constraints. The problem of constrained shortest (least cost) path routing is known to be NP hard, and some heuristics have been proposed to find a near optimal solution. However, these heuristics either impose relationships among ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scalable processing of read-only transactions in broadcast push

    Publication Year: 1999, Page(s):432 - 439
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (132 KB)

    Recently, push-based delivery has attracted considerable attention as a means of disseminating information to large client populations in both wired and wireless settings. We address the problem of ensuring the consistency and currency of client read-only transactions in the presence of updates. To this end, additional control information is broadcast. A suite of methods is proposed that vary in t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Striping and buffer caching for software RAID file systems in workstation clusters

    Publication Year: 1999, Page(s):544 - 551
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (168 KB)

    A software RAID file system is defined as a system that distributes data redundantly across an array of disks attached to each of the workstations connected to a high-speed network. This configuration provides higher throughput and availability compared to conventional file systems. In this paper, we consider two specific issues, namely the distribution of data among the cluster (i.e. striping) an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proxy cache coherency and replacement-towards a more complete picture

    Publication Year: 1999, Page(s):332 - 339
    Cited by:  Papers (11)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (80 KB)

    This work studies the interaction of Web proxy cache coherency and replacement policies using trace-driven simulations. We specifically examine the relative importance of each type of policy in affecting the overall costs, the potential of incorporating coherency issues in cache replacement and the inclusion of additional factors such as frequency of resource use in replacement and coherency polic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Swarm scalable storage system

    Publication Year: 1999, Page(s):74 - 81
    Cited by:  Papers (17)  |  Patents (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (88 KB)

    Swarm is a storage system that provides scalable, reliable, and cost-effective data storage. Swarm is based on storage servers, rather than file servers; the storage servers are optimized for cost-performance and aggregated to provide high-performance data access. Swarm uses a striped log abstraction to store data on the storage servers. This abstraction simplifies storage allocation, improves fil... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal dynamic location update for PCS networks

    Publication Year: 1999, Page(s):134 - 141
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (180 KB)

    The movement based dynamic location update scheme is studied. An analytical model is applied to formulate the costs of location update and paging in the movement based location update scheme. The problem of minimizing the total cost is formulated as an optimization problem that finds the optimal threshold in the movement based location update scheme. We prove that the total cost function is a conv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Processing transactions over optimistic atomic broadcast protocols

    Publication Year: 1999, Page(s):424 - 431
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (132 KB)

    Atomic broadcast primitives allow fault-tolerant cooperation between sites in a distributed system. Unfortunately, the delay incurred before a message can be delivered makes it difficult to implement high performance, scalable applications on top of atomic broadcast primitives. A new approach has been proposed which, based on optimistic assumptions about the communication system, reduces the avera... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load balancing and hot spot relief for hash routing among a collection of proxy caches

    Publication Year: 1999, Page(s):536 - 543
    Cited by:  Papers (4)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 KB)

    Hash routing partitions the entire URL space among a collection of cooperating proxy caches. Each partition is assigned to a cache server. Duplication of cache contents is eliminated. Client requests to a cache server for non-assigned partition objects are forwarded to proper sibling caches. As a result, the load level of the cache servers can be quite unbalanced. We examine an adaptable controlle... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Uniform timing of a multi-cast service

    Publication Year: 1999, Page(s):478 - 486
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (144 KB)

    Presents a new architecture for a clock synchronization protocol based on multi-cast communication. The protocol implements the gradual tuning of the clocks, in order to automatically compensate the systematic drift and increase the time between re-synchronizations. Hosts participating in the same service are grouped into a cohort: the protocol self-stabilizes into an optimal routine where all mem... View full abstract»

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

    Publication Year: 1999, Page(s):384 - 392
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (96 KB)

    We present the design of an interface to allow applications to export tuning alternatives to a higher-level system. By exposing different parameters that can be changed at runtime, applications can be made to adapt to changes in their execution environment due to other programs, or the addition or deletion of nodes, communication links, etc. An integral part of this interface is that an applicatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A compiler-based approach to design and engineering of complex real-time systems

    Publication Year: 1999, Page(s):306 - 313
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (128 KB)

    We present a compiler-based approach to the design and engineering of complex real-time systems. The systems are built from computation, communication and I/O subsystems, based on different extant real-time models and schemes. We have defined a high-level system specification language, called Real-Time System Markup Language (RTSML), for integration of model-specific subsystems. We have developed ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PASS-a service for efficient large scale dissemination of time varying data using CORBA

    Publication Year: 1999, Page(s):496 - 506
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (132 KB)

    A common class of wide-area distributed applications remotely collect time-varying data and send it to consumers around the network. Some examples of these include network management, stock ticker data and event logs. The environment in which these applications must operate often dictates the schemes for disseminating the data between the writers and the readers. If the transport channel can be op... View full abstract»

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

    Publication Year: 1999, Page(s):324 - 331
    Cited by:  Papers (8)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    We describe methods of identifying and exploiting sharing patterns in multi-threaded DSM applications. Active correlation tracking is used to determine the affinity, or amount of sharing, in pairs of threads. Thread affinities are combined to create correlation maps, which summarize sharing between all pairs of threads in the application. Correlation maps can be used in two ways. First, they can b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient kernel support of fine-grained protection domains for mobile code

    Publication Year: 1999, Page(s):64 - 73
    Cited by:  Papers (9)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (136 KB)

    Mobile code is an emerging paradigm of distributed computing. It roams over a network, is linked with an application, and runs as a part of an application. In the case of Web browsers, it is commonplace to download a mobile code, called a plug-in, from a truly open network such as the Internet. Owing to the anonymity of an open network, the mobile code may be malicious; thus, it is important to pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient collective communication in distributed heterogeneous systems

    Publication Year: 1999, Page(s):15 - 24
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (168 KB)

    The Information Power Grid (IPG) is emerging as an infrastructure that will enable distributed applications-such as videoconferencing and distributed interactive simulation-to seamlessly integrate collections of heterogeneous workstations, multiprocessors, and mobile nodes over heterogeneous wide-area networks. This paper introduces a framework for developing efficient collective communication sch... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • (h, k)-arbiters for h-out of-k mutual exclusion problem

    Publication Year: 1999, Page(s):216 - 223
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (148 KB)

    h-out of-k mutual exclusion is a generalization of 1-mutual exclusion problem, where there are k limits of shared resources and each process requests h(1⩽h⩽k) units at the same time. Though the k-arbiter has been shown to be a quorum-based solution to this problem, quorums in the k-arbiter are much larger than these in the 1-coterie for 1-mutual exclusion. Thus, the algorithm based on the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Trust vs. threats: recovery and survival in electronic commerce

    Publication Year: 1999, Page(s):126 - 133
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (76 KB)

    The paper analyzes threats and attacks in the Internet commerce world and suggests schemes to detect the attacks when they occur, prevent further loss once an attack is detected, and provides remedial corrective actions so as to enable victims of commerce-related attacks to resume conducting business transactions. Some commerce based transaction recovery mechanisms are suggested to recover from lo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Incorporating transaction semantics to reduce reprocessing overhead in replicated mobile data applications

    Publication Year: 1999, Page(s):414 - 423
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (192 KB)

    Update anywhere-anytime-anyway transactional replication has unstable behavior as the workload scales up. To reduce this problem, a two-tier replication algorithm is proposed in (Gray et al., 1996) that allows mobile applications to propose tentative transactions that are later applied to a master copy. However it can suffer from heavy reprocessing overhead in many circumstances. We present the me... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Redirection algorithms for load sharing in distributed Web-server systems

    Publication Year: 1999, Page(s):528 - 535
    Cited by:  Papers (28)  |  Patents (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (96 KB)

    Replication of information among multiple World Wide Web servers is necessary to support high request rates to popular Web sites. A clustered Web server organization is preferable to multiple independent mirrored servers because it maintains a single interface to the users and has the potential to be more scalable, fault-tolerant and better load-balanced. In this paper, we propose a Web cluster ar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reducing message overhead in TMR systems

    Publication Year: 1999, Page(s):45 - 54
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (116 KB)

    Traditional TMR protocols assume either single, reliable voters for each triple-modular redundant unit (TMRU) or triplicated voters (one for each processor) for each TMRU. In the first case a voter is a single point of failure for the system. In the second case, many physical messages must be sent across the communication network for each logical data item. We examine some protocols which attempt ... View full abstract»

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