Scheduled System Maintenance
On Tuesday, May 22, IEEE Xplore will undergo scheduled maintenance. Single article sales and account management will be unavailable
from 6:00am–5:00pm ET. There may be intermittent impact on performance from noon–6:00pm ET.
We apologize for the inconvenience.

Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems

22-22 Oct. 1999

Filter Results

Displaying Results 1 - 25 of 57
  • Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems

    Publication Year: 1999
    Request permission for commercial reuse | PDF file iconPDF (135 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 1999, Page(s):v - viii
    Request permission for commercial reuse | PDF file iconPDF (125 KB)
    Freely Available from IEEE
  • Workshop on Reliable Middleware (Wremi) Foreward

    Publication Year: 1999, Page(s): 309
    Request permission for commercial reuse | PDF file iconPDF (14 KB)
    Freely Available from IEEE
  • Workshop on Electronic Commerce (Welcom) Foreward

    Publication Year: 1999, Page(s): 329
    Request permission for commercial reuse | PDF file iconPDF (13 KB)
    Freely Available from IEEE
  • Index of authors

    Publication Year: 1999, Page(s):401 - 402
    Request permission for commercial reuse | PDF file iconPDF (8 KB)
    Freely Available from IEEE
  • Performance evaluation of the circulating multisequencer and the consensus algorithms in a real-time distributed transactional system

    Publication Year: 1999, Page(s):302 - 303
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (24 KB)

    In a real-time distributed transactional system, customers generate transactions, which should be scheduled to be executed on different servers. The transactions must be executed before their deadlines. To schedule these transactions the circulating multisequencer and the consensus algorithms have been considered to obtain a global view of the system. Mathematical models are developed to obtain th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Authorization methods for e-commerce applications

    Publication Year: 1999, Page(s):366 - 371
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (124 KB)

    In the recent past, a lot of work has been done in establishing public key infrastructures (PKIs) for electronic commerce (e-commerce) applications Unfortunately, most of these PKIs can only be used to authenticate the participants of e-commerce applications; they can't be used to properly authorize the participants and to control access to system resources accordingly. Consequently, these PKIs ad... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and validation of a distributed industrial control system's nodes

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

    The Fault Tolerant Systems Group (GSTF) of the Technical University of Valencia has developed the DICOS (Distributed Industrial COntrol System) system. The architecture of DICOS nodes and the error detection mechanisms used are presented. These mechanisms are based on the built-in capabilities of the microcontroller used, control flow checking with the aid of a second microcontroller and double ex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Trust and electronic commerce-more than a technical problem

    Publication Year: 1999, Page(s):360 - 365
    Cited by:  Papers (7)  |  Patents (79)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (52 KB)

    It is argued that the building of trust in electronic commerce depends only partly on technical security, and the knowledge of security gaps and ways of closing them. It is not only a technical system which is trusted but rather a socio-technical system, including users, business practices and related institutions. We take a closer look at the concept of trust and its relation to knowledge, descri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A distributed algorithm for deadlock detection under OR-request model

    Publication Year: 1999, Page(s):298 - 299
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (52 KB)

    This paper presents a distributed algorithm for detecting deadlocks in the OR request model in distributed systems. The initiator of the algorithm builds a reduced local wait-for graph to determine a deadlock by employing two phases for probe propagation and receiving replies. The proposed algorithm exhibits faster deadlock detection and shorter blocked time of processes than the current algorithm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Logging and recovery in adaptive software distributed shared memory systems

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

    Software distributed shared memory (DSM) improves the programmability of message-passing machines and workstation clusters by providing a shared memory abstract (i.e., a coherent global address space) to programmers. As in any distributed system, however; the probability of software DSM failures increases as the system size grows. This paper presents a new efficient logging protocol for adaptive s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Service provision and composition in virtual business communities

    Publication Year: 1999, Page(s):336 - 341
    Cited by:  Papers (8)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (88 KB)

    Service provisioning is at the base of the business economy and is a major driver for business-to-business interaction. The strong competition induced by market globalisation is forcing businesses to concentrate on their core competencies and to rely on specialised third parties for the provisioning of corollary service infrastructure. New expectations and opportunities are emerging for business u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Accountable anonymous access to services in mobile communication systems

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

    We introduce a model that allows anonymous yet accountable access to services in mobile communication systems. This model is based on the introduction of a new business role, called the customer care agency and a ticket based mechanism for service access. We introduce the general idea of ticket based service access, and present a categorisation of ticket types and ticket acquisition models. We ana... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approaching a formal definition of fairness in electronic commerce

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

    The notion of fairness is a very general concept and can be used to coin terms in many different application areas. Recently the term fairness has appeared in the context of electronic commerce. Here, the term fair exchange refers to the problem that two parties want to swap some distinct items in a way which ensures that no participant can gain advantage over the other. Many protocols for fair ex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exactly-once end-to-end semantics in CORBA invocations across heterogeneous fault-tolerant ORBs

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

    We propose a mechanism, based on fault tolerant request IDs piggybacked on GIOP messages, that can be used to enable fault tolerant CORBA invocations spanning multiple heterogeneous ORBs. The proposed mechanism supports replication at both server and client sides View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault-tolerant replication management in large-scale distributed storage systems

    Publication Year: 1999, Page(s):144 - 155
    Cited by:  Papers (7)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (124 KB)

    Failures of all forms happen: from losing single network packets to site-wide disasters. Since businesses rely heavily on their data, it is imperative that failures require minimal time and effort to repair and that the service interruption during the failure or repair period should be as short as possible. To this end, the ideal system should repair itself relying on humans only when absolutely n... View full abstract»

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

    Publication Year: 1999, Page(s):190 - 201
    Cited by:  Papers (1)  |  Patents (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (80 KB)

    Unix's lack of a robust and expandable file system has become a significant problem with the growth of Unix in large commercial environments. The HAMFS (highly available multi-server file system) is a cluster file system designed to address this need. HAMFS offers disk-pooling, supports off-the-shelf disks, and automatically balances file load across disks dynamically. Data residing in a disk pool... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Safecharts for specifying and designing safety critical systems

    Publication Year: 1999, Page(s):78 - 87
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (260 KB)

    This paper proposes a novel variant of Statecharts, called Safecharts, especially for use in the specification and the design of safety critical systems. The objective is to provide a sharper focus on safety issues and a systematic approach to deal with them. This is achieved by making a clear separation between functional and safety requirements. A novel feature of Safecharts is the safety annota... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • XML documents production for an electronic platform of requests for proposals

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

    Addresses the problem of document production in the context of an electronic market application, namely a platform dealing with requests for proposals (RFP). Our project relies on XML as the leading technology, in accordance with a general trend in electronic commerce. The consequences of the RFP workflow on the document publishing requirements are motivated. Various aspects of the XML technology ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The “QoS query service” for improved quality-of-service decision making in CORBA

    Publication Year: 1999, Page(s):274 - 285
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (152 KB)

    We present the quality-of-service query service (QQS) a CORBA service which provides quality-of-service-related “decisions” for the configuration and parameterization of CORBA applications. Applications and services query QQS for those QoS-related decisions, and input data into QQS, so that evaluators have the necessary information to execute their decision-making algorithms. QQS consi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An algorithm for fault-tolerant clock state & rate synchronization

    Publication Year: 1999, Page(s):36 - 47
    Cited by:  Papers (4)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (252 KB)

    We propose a fault-tolerant algorithm for synchronizing both state and rate of clocks in a distributed system. This algorithm is based on rounds, uses our fault-tolerant optimal precision (OF) convergence function as the means of synchronization, and maintains a collection of intervals to keep track of real-time, internal global time, and clock rates. The analysis shows that the interlocking betwe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Security mechanisms for using mobile agents in electronic commerce

    Publication Year: 1999, Page(s):378 - 383
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (44 KB)

    In order for mobile agents to be accepted as a basic technology for enabling electronic commerce, proper security mechanisms must be developed. Hosts must be protected from malicious agents, agents must be protected from other agents and also agents must be protected from malicious hosts. For solving the first three problems, existing technology from operating systems and distributed systems resea... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A practical guideline to the implementation of online shops

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

    Implementing an online shop can be a risky project, since there's no widespread and profound knowledge or experiences. This guideline is intended to support the management of organizational, technical and human challenges in online shop implementation projects. An overview of the implementation process is given. Subsequently, the development of a concept, using the services offered by a company to... View full abstract»

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

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

    The article has two basic premises: why good user interface design matters more for e-commerce than for most online endeavors; and why-despite lots of corporate head-nodding and murmurs of assent-it's still very hard to achieve. The author is working on an e-commerce “wallet” project and struggling with two UI issues. One is minor, the type of wrangle designers and engineers bicker ove... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient checkpointing algorithm for distributed systems implementing reliable communication channels

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

    This paper presents a new checkpointing algorithm that guarantees the semantics of reliable communication channels despite the crash and recovery of processes. This algorithm requires O(n+m) communication messages, where n is the number of participating processes, and m is the number of “late” messages. The algorithm is nonblocking, requires minimal message logging, and has minimal sta... View full abstract»

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