By Topic

Distributed Computing Systems, 1999. Proceedings. 19th IEEE International Conference on

Date 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
    Save to Project icon | Request Permissions | PDF file iconPDF (301 KB)  
    Freely Available from IEEE
  • Author index

    Publication Year: 1999 , Page(s): 553 - 554
    Save to Project icon | Request Permissions | PDF file iconPDF (221 KB)  
    Freely Available from IEEE
  • HiFi: a new monitoring architecture for distributed systems management

    Publication Year: 1999 , Page(s): 171 - 178
    Cited by:  Papers (8)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (168 KB)  

    With the increasing complexity of large scale distributed (LSD) systems, an efficient monitoring mechanism has become an essential service for improving the performance and reliability of such complex applications. The paper presents a scalable, dynamic, flexible and nonintrusive monitoring architecture for managing large scale distributed (LSD) systems. This architecture, which is referred to as ... 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
    Save to Project icon | Request Permissions | 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.
  • Mockingbird: flexible stub compilation from pairs of declarations

    Publication Year: 1999 , Page(s): 393 - 402
    Cited by:  Papers (2)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (104 KB)  

    Mockingbird is a prototype tool for developing interlanguage and distributed applications. It compiles stubs from pairs of interface declarations, allowing existing data types to be reused on both sides of every interface. Other multilanguage stub compilers impose data types on the application, complicating development. Mockingbird supports C/C++, Java, and CORBA IDL, and can be extended to other ... 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
    Save to Project icon | Request Permissions | 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.
  • Initial synchronization of TDMA communication in distributed real-time systems

    Publication Year: 1999 , Page(s): 370 - 379
    Cited by:  Papers (5)  |  Patents (4)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (112 KB)  

    This paper discusses the startup phase of a TDMA protocol intended for safety-critical real-time systems using a broadcast bus. The protocol contains sender id in each message, and nodes send messages of equal size in a fixed order. A single channel media is used and data and synchronization information must therefore share the same channel. Synchronization is challenging, since clocks must be syn... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design considerations for distributed caching on the Internet

    Publication Year: 1999 , Page(s): 273 - 284
    Cited by:  Papers (20)  |  Patents (17)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (164 KB)  

    We describe the design and implementation of an integrated architecture for cache systems that scale to hundreds or thousands of caches with thousands to millions of users. Rather than simply try to maximize hit rates, we take an end-to-end approach to improving response time by also considering hit times and miss times. We begin by studying several Internet caches and workloads, and we derive thr... 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)
    Save to Project icon | Request Permissions | 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.
  • Run-time detection in parallel and distributed systems: application to safety-critical systems

    Publication Year: 1999 , Page(s): 163 - 170
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (100 KB)  

    There is growing interest in run-time detection as parallel and distributed systems grow larger and more complex. This work targets run-time analysis of complex, interactive scientific applications for purposes of attaining scalability improvements with respect to the amount and complexity of the data transmitted, transformed, and shared among different application components. Such improvements ar... 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)
    Save to Project icon | Request Permissions | 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.
  • Exposing application alternatives

    Publication Year: 1999 , Page(s): 384 - 392
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | 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.
  • Progressive construction of consistent global checkpoints

    Publication Year: 1999 , Page(s): 55 - 62
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (152 KB)  

    A checkpoint pattern is an abstraction of the computation performed by a distributed application. A progressive view of this abstraction is formed by a sequence of consistent global checkpoints that may have occurred in this order during the execution of the application. Considering pairs of checkpoints, we have determined that a checkpoint must be observed before another in a progressive view if ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Beyond the black box: event-based inter-process communication in process support systems

    Publication Year: 1999 , Page(s): 450 - 457
    Cited by:  Papers (5)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (140 KB)  

    We describe the concept and implementation of an inter-process communication facility based on the exchange of events between concurrently running processes. In contrast to previous approaches based on shared data stored in a common database, our approach has the advantage of being platform independent and providing straightforward support for distribution. In addition, we also explore the problem... 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 (6)  |  Patents (9)
    Save to Project icon | Request Permissions | 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.
  • On classes of problems in asynchronous distributed systems with process crashes

    Publication Year: 1999 , Page(s): 470 - 477
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (172 KB)  

    This paper is on classes of problems encountered in asynchronous distributed systems in which processes can crash but links are reliable. The hardness of a problem is defined with respect to the difficulty to solve it despite failures: a problem is easy if it can be solved in presence of failures, otherwise it is hard. Three classes of problems are defined: F, NF and NFC. F is the class of easy pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • NAP: practical fault-tolerance for itinerant computations

    Publication Year: 1999 , Page(s): 180 - 189
    Cited by:  Papers (15)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (288 KB)  

    One use of mobile agents is support for itinerant computation (D. Chess et al., 1995). An itinerant computation is a program that moves from host to host in a network. Which hosts the program visits is determined by the program. The program can have a pre-defined itinerary or can dynamically compute the next host to visit as it visits each successive host; it can visit the same host repeatedly or ... 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)
    Save to Project icon | Request Permissions | 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.
  • Processing transactions over optimistic atomic broadcast protocols

    Publication Year: 1999 , Page(s): 424 - 431
    Cited by:  Papers (15)
    Save to Project icon | Request Permissions | 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.
  • Possession System: middleware for adaptive multiuser applications in a mobile environment

    Publication Year: 1999 , Page(s): 198 - 205
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1636 KB)  

    Describes the design and implementation of a middleware system named the Possession System. The system is designed based on the “possession model”, which provides users with a consistent view of application components, networked sensors and distributed devices by introducing two separate abstractions: “body” and “soul”. The Possession System realizes a simple fr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Imprecise calendars: an approach to scheduling computational grids

    Publication Year: 1999 , Page(s): 352 - 359
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (100 KB)  

    We describe imprecise calendars, a way to organize and schedule clusters of nodes in a computation grid. Imprecise calendars permit the easy and efficient sharing of resources between different clusters of computers that are part of a computational grid. In addition, they can be used to provide specific time reservations for applications. We describe the algorithms and policies for manipulation of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault tolerant video on demand services

    Publication Year: 1999 , Page(s): 244 - 252
    Cited by:  Papers (11)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (172 KB)  

    This paper describes a highly available distributed video on demand (VoD) service which is inherently fault tolerant. The VoD service is provided by multiple servers that reside at different sites. New servers may be brought up “on the fly” to alleviate the load on other servers. When a server crashes it is replaced by another server in a transparent way; the clients are unaware of the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mobile agent programming in Ajanta

    Publication Year: 1999 , Page(s): 190 - 197
    Cited by:  Papers (6)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (84 KB)  

    The paper gives an overview of Ajanta, a Java based system for mobile agent programming. We outline the Ajanta architecture, and discuss the basic elements that comprise an agent based application. Ajanta's programming environment is defined in terms of a set of primitive operations for agent creation, dispatch, migration and remote control. Agents can access server resources using a proxy based a... 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)
    Save to Project icon | Request Permissions | 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.
  • A property-based clustering approach for the CORBA Trading Service

    Publication Year: 1999 , Page(s): 517 - 525
    Cited by:  Papers (3)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (248 KB)  

    The CORBA Trading Service is an object service advertiser for heterogeneous distributed computing environments. Current approaches for the design and implementation of such a CORBA service do not deal with some of the major problems of searching for service offers in large-scale distributed systems, namely performance and scalability problems. This paper proposes an appropriate approach for cluste... View full abstract»

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