By Topic

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
  • Cyber-intrusion response

    Publication Year: 1998, Page(s):413 - 415
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (444 KB)

    Cyber response technologies are a relatively new area of research. This paper provides a high level description of the hard problems associated with responding to a cyber intrusion, identifies several questions that need to be addressed in order to solve these hard problems, provides a few examples of current response technologies, and describes an approach that can be taken to fill the gaps betwe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A metaobject protocol for fault-tolerant CORBA applications

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

    The use of metalevel architectures for the implementation of fault-tolerant systems is today very appealing. Nevertheless, all such fault-tolerant systems have used a general-purpose metaobject protocol (MOP) or are based on restricted reflective features of some object-oriented language. According to our past experience, we define in this paper a suitable metaobject protocol, called FT-MOP for bu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Requirements for a true enterprise-wide security infrastructure: the play's the thing

    Publication Year: 1998, Page(s):403 - 406
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (24 KB)

    Business has certain requirements that must be met if the enterprise is to thrive; some of these requirements are affected by security systems. The relationship of these requirements and supporting business has been well illustrated by the success of enterprise resource planning (ERP) systems and the initial failure and subsequent transformational impact of tools such as spreadsheets. If designed ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Checkpoints-on-demand with active replication

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

    Checkpointing and roll-back recovery is a well known technique for recovering from software process failures. Analytical models have been developed for computing the completion time of processes that use various checkpointing strategies such as periodic checkpointing, random checkpointing etc. In this paper, we show that with active replication of processes, a strategy that uses a mechanism we cal... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An active transcoding proxy to support mobile web access

    Publication Year: 1998, Page(s):118 - 123
    Cited by:  Papers (39)  |  Patents (53)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB)

    In this paper, we present a proxy based system (MOWSER) to support web browsing from mobile clients over wireless networks. Mowser is a proxy agent between the mobile host and the web server, which performs active transcoding of data on both upstream and downstream traffic to present web information to the mobile user according to the QoS parameters set by the user. Active transcoding is defined a... 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.
  • Optimizing join index based join processing: a graph partitioning approach

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

    The cost of join computation, which uses a join index in a sequential system with limited buffer space, depends primarily on the page access sequence used to fetch the pages of the base relations. We introduce a graph partitioning model that will minimize the length of the page access sequence thus minimizing the redundant I/O, given a fixed buffer. Experiments with Sequoia 2000 data sets show tha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • System-level versus user-defined checkpointing

    Publication Year: 1998, Page(s):68 - 74
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (56 KB)

    Checkpointing and rollback recovery is a very effective technique to tolerate transient faults and preventive shutdowns. In the past, most of the checkpointing schemes published in the literature were supposed to be transparent to the application programmer and implemented at the operating-system level. In recent years, there has been some work on higher-level forms of checkpointing. In this secon... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tolerating Visitor Location Register failures in mobile environments

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

    For mobile users who move frequently but receive relatively rare calls, a forwarding scheme has been shown to outperform the normal IS-41 location management scheme. But the forwarding scheme is more vulnerable to failure of intermediate Visitor Location Registers (VLRs) than the IS-41 scheme. We propose two simple variations to the forwarding scheme to address the fault tolerance weakness. One is... 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.
  • An integration of the primary-shadow TMO replication scheme with a supervisor-based network surveillance scheme and its recovery time bound analysis

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

    The time-triggered message-triggered object (TMO) scheme was formulated a few years ago (K.H. Kim et al., 1994; K.H. Kim and C. Subbaraman, 1997), as a major extension of the conventional object structuring schemes with the idealistic goal of facilitating general form design and timeliness-guaranteed design of complex real time application systems. Recently, as a new scheme for realizing TMO-struc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enforcing security policies in large scale communication networks

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

    Due to unexpected network interconnection growth, the security of technological and information infrastructures is becoming difficult to be managed and controlled. In addition, security is becoming more and more crucial for an organisation's information systems operation. The management of an organisation has to establish rules and regulations in order to face the threats that its information syst... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Off-line diagnosis of parallel systems

    Publication Year: 1998, Page(s):360 - 365
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (36 KB)

    This paper presents an off-line diagnosis strategy for parallel message-passing systems. This strategy, called host-diagnosis, allows an external observer, i.e. the host system, to perform centralized diagnosis of the system state, given results of distributed tests performed among the system processors. Three algorithms that use the host-diagnosis strategy are proposed. The performance of the thr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A distributed version of the SequenceL language

    Publication Year: 1998, Page(s):295 - 301
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (48 KB)

    This paper introduces a new computational model for SequenceL. The model is extended through the addition of a notion of the VRAM model. The computational model introduced together with the SequenceL language provides for a good expression of distributed behaviour View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A VP-accordant checkpointing protocol preventing useless checkpoints

    Publication Year: 1998, Page(s):61 - 67
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (160 KB)

    A useless checkpoint corresponds to the occurrence of a checkpoint and communication pattern called Z-cycle. A recent result shows that ensuring a computation without Z-cycles is a particular application of a property, namely Virtual Precedence (VP), defined on an interval-based abstraction of a computation. We first propose a taxonomy of communication-induced checkpointing protocols based on the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fault-tolerant protocol for providing the exactly-once property of mobile agents

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

    Mobile agent technology has been proposed for various fault-sensitive application areas, including electronic commerce, systems management and active messaging. Due to the autonomy of mobile agents, there is no natural instance that monitors the progress of an agent's execution. As a result, agents may be lost or blocked due to node crashes or network partitioning even if there are other nodes ava... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A data allocation algorithm for distributed hypermedia documents

    Publication Year: 1998, Page(s):473 - 478
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (48 KB)

    A major cost in executing queries in a distributed database system is the data transfer cost incurred in transferring relations (fragments) accessed by a query from different sites to the site where the query is initiated. The objective of a data allocation algorithm is to locate the fragments at different sites so as to minimize the total data transfer cost incurred in executing a set of queries.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluation of filtering mechanisms for MPEG video communications

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

    In this paper, we evaluate two video filtering mechanisms for MPEG-1 video, namely low-pass filtering and selective frame dropping. The evaluation provides tradeoffs between the reduction achieved in bandwidth requirements and the perceptual quality of the video sequences delivered to the client. Extensive experiments revealed that these filtering mechanisms result in a significant reduction in ba... 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.
  • 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.
  • 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.