By Topic

Distributed Computing Systems, 2000. Proceedings. 20th International Conference on

Date 10-13 April 2000

Filter Results

Displaying Results 1 - 25 of 78
  • Proceedings 20th IEEE International Conference on Distributed Computing Systems

    Publication Year: 2000
    Request permission for commercial reuse | PDF file iconPDF (328 KB)
    Freely Available from IEEE
  • Index of authors

    Publication Year: 2000, Page(s):707 - 708
    Request permission for commercial reuse | PDF file iconPDF (9 KB)
    Freely Available from IEEE
  • Dynamic adaptive file management in a local area network

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

    In light of advances in processor and networking technology, especially the emergence of network attached disks, the traditional client-server architecture of file systems has become suboptimal for many computation/data intensive applications. We introduce a revised architecture for file management employing network attached storage: the dynamic file server environment (Dynamo). Dynamo introduces ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A security architecture for mobile agents in Ajanta

    Publication Year: 2000, Page(s):402 - 409
    Cited by:  Papers (11)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (84 KB)

    A mobile agent represents a computation that can autonomously migrate in a network to perform tasks on behalf of its creator. This paper describes the security architecture of Ajanta, a Java-based system for mobile agent programming. This architecture provides mechanisms to protect server resources from malicious agents, agent data from tampering by malicious servers, and to protect the system inf... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On request forwarding for dynamic Web caching hierarchies

    Publication Year: 2000, Page(s):262 - 269
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (124 KB)

    We propose a Web caching scheme, based on the caching neighborhood protocol, featuring dynamic caching hierarchies as its underlying infrastructure. Dynamic Web caching hierarchies consist of proxy servers building hierarchies on a per request basis, in contrast to static Web caching hierarchies that comprise proxy servers preconfigured into hierarchies. Concerns of overheads and efficiency in for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A client-server oriented algorithm for virtually synchronous group membership in WANs

    Publication Year: 2000, Page(s):356 - 365
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (292 KB)

    We describe a novel scalable group membership service designed explicitly for wide area networks. Our membership service is scalable in the number of groups supported, in the number of members in each group, and in the topology each group spans. Our service also supplies the hooks needed to provide clients with full virtual synchrony semantics. Our service attains, on average, a low message overhe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Precluding useless events for on-line global predicate detections

    Publication Year: 2000, Page(s):670 - 677
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (140 KB)

    Detecting global predicates is an important task in testing and debugging distributed programs. In this paper, we propose an approach that effectively precludes useless events for global predicate detection, facilitating the process of an independent online checking routine. To identify more useless events than a simple causality-check method can do, our method tracks and maintains the precedence ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spout: a transparent distributed execution engine for Java applets

    Publication Year: 2000, Page(s):394 - 401
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (88 KB)

    The advent of executable contents such as Java applets exposes WWW users to a new class of attacks that were not possible before. Serious security breach incidents due to implementation bugs arose repeatedly in the past several years. Without a provably correct implementation of Java's security architecture specification, it is difficult to make any conclusive statements about the security charact... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deterministic optimal routing for two heterogeneous parallel servers

    Publication Year: 2000, Page(s):46 - 53
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (228 KB)

    The paper describes the characteristics of an optimal routing that assigns each arriving packet to one of two heterogeneous parallel servers. The characteristics are derived from numerical solutions to a routing problem, which finds an optimal routing that minimizes the average packet delay under the condition that the input traffic is completely deterministic. Four characteristics are presented: ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quartz: a QoS architecture for open systems

    Publication Year: 2000, Page(s):197 - 204
    Cited by:  Papers (12)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (108 KB)

    This paper describes an architecture that provides support for quality of service (QoS) specification and enforcement in heterogeneous distributed computing systems. The Quartz QoS architecture has been designed to overcome various limitations of previous QoS architectures that have constrained their use in heterogeneous systems. These limitations include dependencies on specific platforms and the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Popularity-aware greedy dual-size Web proxy caching algorithms

    Publication Year: 2000, Page(s):254 - 261
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (168 KB)

    Web caching aims at reducing network traffic, server load and user-perceived retrieval delays by replicating popular content on proxy caches that are strategically placed within the network. While key to effective cache utilization, popularity information (e.g. relative access frequencies of objects requested through a proxy) is seldom incorporated directly in cache replacement algorithms. Rather ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A client-server approach to virtually synchronous group multicast: specifications and algorithms

    Publication Year: 2000, Page(s):344 - 355
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (128 KB)

    This paper presents a formal design for a novel group multicast service that provides virtually synchronous semantics in asynchronous fault-prone environments. The design employs a client-server architecture in which group membership is maintained not by every process but only by dedicated membership servers, while virtually synchronous group multicast is implemented by service end-points running ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling using genetic algorithms

    Publication Year: 2000, Page(s):662 - 669
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (156 KB)

    Considers the scheduling of mixed task- and data-parallel modules comprising computation and communication operations. The program generation starts with a specification of the maximum degree of task- and data-parallelism of the method to be implemented. In several derivation steps, the degree of parallelism is adapted to a specific distributed memory machine. We present a scheduling derivation st... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A relaxed mutual exclusion problem with application to channel allocation in mobile cellular networks

    Publication Year: 2000, Page(s):592 - 599
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (128 KB)

    Distributed channel allocation is a fundamental resource management problem in mobile cellular networks. It has a flavor of distributed mutual exclusion but is not exactly a mutual exclusion problem (because a channel may be reused in different cells). However it is still not clear what is the relationship between the two problems. We establish the exact relationship between the two. Specifically,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • System mechanisms for partial rollback of mobile agent execution

    Publication Year: 2000, Page(s):20 - 28
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (120 KB)

    Mobile agent technology has been proposed for various fault-sensitive application areas, including electronic commerce, systems management and active messaging. Recently proposed protocols providing the exactly-once execution of mobile agents allow the usage of mobile agents in these application areas. Based on these protocols, a mechanism for the application-initiated partial rollback of the agen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Static and adaptive data replication algorithms for fast information access in large distributed systems

    Publication Year: 2000, Page(s):385 - 392
    Cited by:  Papers (26)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (100 KB)

    Creating replicas of frequently accessed objects across a read-intensive network can result in large bandwidth savings which, in turn, can lead to reduction in user response time. On the contrary, data replication in the presence of writes incurs extra cost due to multiple updates. The set of sites at which an object is replicated constitutes its replication scheme. Finding an optimal replication ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mobile Cache Protocol: a dynamic object relocation protocol for wide area networks

    Publication Year: 2000, Page(s):420 - 427
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    This paper proposes a relocation protocol of a replicated object in a widely distributed object system called Mobile Cache Protocol (MCP). MCP has four basic features: it creates a replicated object and allocates it on an intermediate site to reduce the latency of object retrieval in a wide area network; it supports both client and server oriented updates to achieve object consistency; it supports... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Striping doesn't scale: how to achieve scalability for continuous media servers with replication

    Publication Year: 2000, Page(s):64 - 71
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB)

    Multimedia applications place high demands for QoS, performance, and reliability on storage servers and communication networks. These, often stringent requirements, make design of cost-effective and scalable continuous media (CM) servers difficult. In particular, the choice of data placement techniques can have a significant effect on the scalability of the CM server and its ability to utilize res... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Partitionable light-weight groups

    Publication Year: 2000, Page(s):38 - 45
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (116 KB)

    Group communication, providing virtual synchrony semantics, is a powerful paradigm for building distributed applications. For applications that require a large number of groups, significant performance gains can be attained if these groups share the resources required to provide virtual synchrony. A service that maps multiple user groups onto a small number of instances of a virtually synchronous ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Achieving per-flow weighted rate fairness in a core stateless network

    Publication Year: 2000, Page(s):188 - 196
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (564 KB)

    Corelite is a quality of service architecture that provides weighted max-min fairness for rate among flows in a network without maintaining any per-flow state in the core routers. There are three key mechanisms that work in concert to achieve the service model of Corelite: the introduction of markers in a packet flow by the edge routers to reflect the normalized rate of the flow; weighted fair mar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The effect of nogood learning in distributed constraint satisfaction

    Publication Year: 2000, Page(s):169 - 177
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (80 KB)

    We present resolvent-based learning as a new nogood learning method for a distributed constraint satisfaction algorithm. This method is based on a look-back technique in constraint satisfaction algorithms and can efficiently make effective nogoods. We combine the method with the asynchronous weak-commitment search algorithm (AWC) and evaluate the performance of the resultant algorithm on distribut... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deadlock analysis of client/server programs

    Publication Year: 2000, Page(s):484 - 491
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (116 KB)

    Deadlocks are a common type of fault in distributed programs. To detect deadlocks in a distributed program P, one approach is to construct the reachability graph (RG) of P, which contains all possible states of P, and analyze the RG to detect deadlocks. Since the size of RG(P) is an exponential function of the number of processes in P, the use of RG for deadlock detection has limited success. In t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Contract type sequencing for reallocative negotiation

    Publication Year: 2000, Page(s):154 - 160
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (204 KB)

    The capability to reallocate items-e.g. tasks, securities, bandwidth slices, MW hours of electricity, and collectibles-is a key feature in automated negotiation. Especially when agents have preferences over combinations of items, this is highly nontrivial. Marginal cost based reallocation leads to an anytime algorithm where every agent's utility increases monotonically over time. Different contrac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detecting and representing relevant Web deltas using Web join

    Publication Year: 2000, Page(s):246 - 253
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (188 KB)

    We show how to detect and represent Web deltas, i.e., changes in Web information, that are relevant to a user's query in the context of our Web warehousing system called WHOWEDA (Warehouse of Web Data). In WHOWEDA, Web information are materialized views stored in Web tables and can be manipulated and analyzed using a set of Web algebraic operators. We present a mechanism to detect relevant Web del... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Understanding replication in databases and distributed systems

    Publication Year: 2000, Page(s):464 - 474
    Cited by:  Papers (76)  |  Patents (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (152 KB)

    Replication is an area of interest to both distributed systems and databases. The solutions developed from these two perspectives are conceptually similar but differ in many aspects: model, assumptions, mechanisms, guarantees provided, and implementation. In this paper, we provide an abstract and “neutral” framework to compare replication techniques from both communities. The framework... View full abstract»

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