Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)

20-23 Oct. 1998

Filter Results

Displaying Results 1 - 25 of 71
  • Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)

    Publication Year: 1998
    Request permission for commercial reuse | |PDF file iconPDF (301 KB)
    Freely Available from IEEE
  • Programming the grid: component systems for distributed applications

    Publication Year: 1998
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (42 KB)

    Summary form only given. The traditional model of software design for large scale scientific problem solving is outdated. The emphasis is now on large teams that must build simulation software that integrates physical systems from multiple scientific disciplines. In addition to the problem of multi-disciplinary physics, the computational environment is now a grid of distributed resources consistin... View full abstract»

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

    Publication Year: 1998, Page(s):407 - 412
    Cited by:  Papers (1)  |  Patents (34)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1055 KB)

    Mobile computing has become popular over the last few years. Users need to have continuous access to information even when they are mobile, e.g., a doctor may need to constantly monitor a patient's health or a stock broker may need periodic information about the stock market, etc. Communication in such cases is typically over wireless links and it becomes critical to ensure secure message exchange... View full abstract»

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

    Publication Year: 1998, Page(s):493 - 494
    Request permission for commercial reuse | |PDF file iconPDF (262 KB)
    Freely Available from IEEE
  • A non-blocking recovery algorithm for causal message logging

    Publication Year: 1998, Page(s):3 - 9
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (84 KB)

    In the recovery of failed processes in a distributed program, causal logging schemes offer several benefits. These benefits include no rollback of unfailed processes and simple approaches to output commit. Unfortunately, previous approaches to the recovery of multiple simultaneous failures require that the distributed execution be blocked or that recovering processes coordinate. The latter require... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed center location algorithm for fault-tolerant multicast in wide-area networks

    Publication Year: 1998, Page(s):324 - 329
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (188 KB)

    Group shared trees form a major component of most multicast routing protocols (e.g. PIM-SMv2, CBTv3). The shared trees are built by choosing one node as the center of the tree. The optimal location of a center under the constraints of minimal tree cost and delay for a particular group is an NP-complete problem. Current implementations of protocols decide on the location of these centers administra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Architecture for group communication in mobile systems

    Publication Year: 1998, Page(s):235 - 242
    Cited by:  Papers (18)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (172 KB)

    In mobile computing systems the network configuration changes due to node mobility. The paper identifies the issues a group communication service has to take into account in order to handle node mobility. These include the need to identify the location of a node, and the ability to cope with inaccuracies in the determination of a group membership. A multi level architecture for group communication... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A multiprocessor scheduling algorithm for low overhead fault-tolerance

    Publication Year: 1998, Page(s):186 - 194
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (212 KB)

    We propose a new scheduling algorithm for achieving fault tolerance in multiprocessor systems. The new algorithm partitions a parallel program into subsets of tasks based on some characteristics of a task graph. Then for each subset, the algorithm duplicates and schedules its tasks successively. Applying the proposed algorithm to three kinds of practical task graphs (Gaussian elimination, Laplace ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Issues in multimedia synchronization over broadband networks

    Publication Year: 1998, Page(s):467 - 472
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (164 KB)

    Distributed, networked multimedia information systems will be a critical component of technology-based information infrastructures in the future. Several ground-breaking applications have already appeared, and more are many are expected to follow. Innovations in hardware and software are feeding this revolution. In this paper, the notion of “quality of presentation” (QOP) for multimedi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Look-ahead traffic distribution in wormhole-routed networks

    Publication Year: 1998, Page(s):318 - 323
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (172 KB)

    A new approach, look-ahead traffic distribution, is proposed in this paper to improve the performance of adaptive routing algorithms in wormhole routed networks. In most adaptive routing algorithms, a packet changes its forwarding direction only if its requesting channel is not available, i.e., the routing decision is based only on the traffic information (buffer availability) in adjacent nodes. T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimization of a real-time primary-backup replication service

    Publication Year: 1998, Page(s):177 - 185
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (184 KB)

    The primary-backup replication model is one of the commonly adopted approaches to providing fault tolerant data services. Its extension to the real time environment, however, imposes the additional constraint of timing predictability, which requires a bounded overhead for managing redundancy. The paper discusses the trade-off between reducing system overhead and increasing (temporal) consistency b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interactive image retrieval over the Internet

    Publication Year: 1998, Page(s):461 - 466
    Cited by:  Papers (4)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (2448 KB)

    An efficient image database system is developed. The most important features of the proposed system include compressed domain indexing, searching by using scalable features, and progressive image transmission. User interaction is involved both at the search refinement stage and in the display of the query results. The most important query types include query by color layout and query by wavelet-co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High throughput networks for petaflops computing

    Publication Year: 1998, Page(s):312 - 317
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (72 KB)

    The smallest networks that can connect eight thousand processing elements and memory interfaces in a petaflops cryocomputer contain hundreds of thousands of 2×2 switching nodes. We have determined circuit costs, maximal throughput and average latency for feasible multistage banyan and multidimensional pruned ring mesh networks. Each can deliver 20000 single-word packets every 30 picoseconds,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extending the Coda File System to handle cache misses on isolated clients

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

    For mobile information access, client caching is widely used for coping with server unavailability due to temporary disconnection of the network. Cache-miss is the most visible phenomenon to users caused by the disconnection. When multiple clients are isolated from servers, cache-miss happening on a client can be fulfilled using cache contents on other clients. Using a mechanism called disconnecte... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dependability analysis of a cache-based RAID system via fast distributed simulation

    Publication Year: 1998, Page(s):254 - 260
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (192 KB)

    We propose a new speculation-based, distributed simulation method for dependability analysis of complex systems in which a detailed functional simulation of a system component is essential to obtain an accurate overall result. Our target example is a networked cluster with compute nodes and a single I/O node. Accurate system dependability characterization is achieved via a combination of detailed ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault-tolerant Total Order Multicast to asynchronous groups

    Publication Year: 1998, Page(s):228 - 234
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (128 KB)

    While Total Order Broadcast (or Atomic Broadcast) primitives have received a lot of attention, the paper concentrates on Total Order Multicast to Multiple Groups in the context of asynchronous distributed systems in which processes may suffer crash failures. “Multicast to Multiple Groups” means that each message is sent to a subset of the process groups composing the system, distinct m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tolerating client and communication failures in distributed groupware systems

    Publication Year: 1998, Page(s):221 - 227
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (84 KB)

    If a groupware system is to be effectively used, especially over a wide area network such as the Internet, where the quality of networking and computing resources are unpredictable, it should allow clients to tolerate client, link, and server failures. In particular, clients should be able to join groups and transfer groups' current state in the presence of most client and link failures. In order ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Managing network security-a pragmatic approach

    Publication Year: 1998, Page(s):398 - 402
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (32 KB)

    An efficient management is needed to make use of different security mechanisms in large networks. All mechanisms have to be configured consistently according to the security policy. To reduce complexity, the administrator should not have to cope with details not important for him. In the presented concept the network is divided into several administrative domains which are managed rather independe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Transformation-based reconstruction for audio transmissions over the Internet

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

    The paper studies the design of data transformation algorithms for audio data transmitted over the Internet, with a goal of reconstructing the original signals by the receiver with little distortions in the presence of bursty loss of packets. It assumes that a single audio stream is interleaved into multiple packets, and a lost sample at the receiver is reconstructed as the interpolation of adjace... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Security in the large: is Java's sandbox scalable?

    Publication Year: 1998, Page(s):387 - 392
    Cited by:  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (36 KB)

    Using Java security as an example, this paper tries to draw attention to the various issues of security in large scale distributed systems, some of which are often ignored when the security mechanisms are designed. Even though a lot of work has been done on Java security, we argue in this paper that due to weaknesses inherent in the Java approach to building sandboxes, Java security is not suitabl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • End to end reliable multicast transport protocol requirements for collaborative multimedia systems

    Publication Year: 1998, Page(s):425 - 430
    Cited by:  Papers (15)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1036 KB)

    Multi-party collaborative multimedia applications require data to be transmitted reliably and efficiently in order to provide a guaranteed quality of service (QoS). The multimedia applications can vary from distributed games and shared whiteboards to interactive video conferencing. These applications often involve a large number of participants and are interactive in nature, with participants dyna... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • View consistency for optimistic replication

    Publication Year: 1998, Page(s):36 - 42
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (76 KB)

    Optimistically replicated systems provide highly available data even when communication between data replicas is unreliable or unavailable. The high availability comes at the cost of allowing inconsistent accesses, since users can read and write old copies of data. Session guarantees have been used to reduce such inconsistencies. They preserve most of the availability benefits of optimistic system... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and verification of a secure electronic auction protocol

    Publication Year: 1998, Page(s):204 - 210
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (96 KB)

    Auctions are an important and common form of commerce today. A difficult aspect of auctions is that the bidder must be present at the site of the auction. This reduces the appeal of auction and restricts the number of people who would otherwise participate in it. An auction over an electronic network is therefore an attractive way of conducting business. The author proposes a protocol for electron... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pixel level interleaving schemes for robust image communication

    Publication Year: 1998, Page(s):455 - 460
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (208 KB)

    Interleaving schemes have proven to be an important mechanism in reducing the effect of network errors on image transmission. Current interleaving schemes spatially decorrelate neighboring image blocks by putting them into packets that are a long way apart from each other in the transmission sequence. Most of the existing schemes, while achieving good performance on random packet losses, do not wo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and analysis of a hardware-assisted checkpointing and recovery scheme for distributed applications

    Publication Year: 1998, Page(s):84 - 90
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (180 KB)

    A checkpointing and recovery scheme which exploits the low latency and high coverage characteristics of a hardware error detection scheme is presented. Message dependency which is the main source of multi-step rollback in distributed systems is minimized by using a new message validation technique derived from hardware-assisted error detection. The main contribution of this paper is the developmen... View full abstract»

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