By Topic

Proceedings 20th IEEE International Conference on Distributed Computing Systems

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
  • A new network layer protocol with routing address and tables auto-configuration mechanism

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

    We propose a network layer protocol denoted ACRP (Auto-Configurated Routing Protocol) equipped with a function that automatically configures routing addresses and routing tables for a large scale network system made up of multiple connected physical networks. The goals of the work presented, are to enable adding and deleting physical networks during practical use and designing the protocol in such... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MPEG-4 support to multiuser virtual environments

    Publication Year: 2000, Page(s):72 - 79
    Cited by:  Papers (2)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (128 KB)

    The few existing virtual reality distributed systems integrated to multimedia suffer from technical limitations on the number of users supported and on the presentation quality of the scenes. These limitations are due, among other things, to the slow progress of the VRML language to deal with multimedia integration. Today, the MPEG-4 standard is one of the most attractive alternative technologies ... 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 (13)  |  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.
  • 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.
  • 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.
  • 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.
  • 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.
  • Atomic broadcast in asynchronous crash-recovery distributed systems

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

    Atomic broadcast is a fundamental problem of distributed systems: it states that messages must be delivered in the same order to their destination processes. This paper describes a solution to this problem in asynchronous distributed systems in which processes can crash and recover. A consensus-based solution to atomic broadcast problem has been designed by Chandra and Toueg (1996) for asynchronou... 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 (84)  |  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.
  • Critical bandwidth allocation techniques for stored video delivery across best-effort networks

    Publication Year: 2000, Page(s):56 - 63
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (164 KB)

    We propose two new techniques for the delivery of compressed prerecorded video streams across best-effort networks like the Internet. Current approaches for the delivery of stored video across best-effort networks typically alter the quality of the video frames, the frame rate delivered to the user, or a combination of both. By using network feedback, these algorithms continually adjust the video ... 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 framework to protect mobile agents by using reference states

    Publication Year: 2000, Page(s):410 - 417
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (72 KB)

    To protect mobile agents from attacks by their execution environments, or hosts, one class of protection mechanisms uses “reference states” to detect modification attacks. Reference states are agent states that have been produced by non-attacking or reference hosts. This paper examines this class of mechanisms and presents the bandwidth of the achieved protection. First, the notion of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scalable QoS guaranteed communication services for real-time applications

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

    We propose an approach to flow-unaware admission control which is a combination with an aggregate packet forwarding scheme, improving scalability of networks while guaranteeing end-to-end deadlines for real-time applications. We achieve this by using an off-line delay computation and verification step, which allows to reduce the overhead at admission control while keeping admission probability and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An asymptotically multi-layered decentralized consensus protocol with an initiator

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

    A decentralized consensus protocol refers to a process for all nodes in a distributed system to collect the information/status from every other node and reach a consensus among them. Two classes of decentralized consensus protocols have been studied before: the one without an initiator and the one with an initiator. While the one without an initiator has been well studied in the literature: it is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance evaluation of soft real-time scheduling for multicomputer cluster

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

    We consider scheduling soft real-time tasks for a cluster which consists of multiple servers. Each server provides identical services where an incoming task can be assigned to one of the servers. The question we investigate is which assignment produces the best performance given two alternative approaches to queue the arriving tasks: a centralized approach or a distributed one. A missed deadline c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient cache maintenance scheme for mobile environment

    Publication Year: 2000, Page(s):530 - 537
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (132 KB)

    We present a new cache maintenance scheme, called AS, suitable for the wireless mobile environment. Our scheme integrates the mobility management scheme of Mobile IP with cache maintenance scheme used in the CODA file system. As opposed to broadcasting invalidation report schemes, AS supports arbitrary disconnection patterns and uses less wireless bandwidth. We present analytical and simulation re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Task assignment with unknown duration

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

    We consider a distributed server system and ask which policy should be used for assigning tasks to hosts. In our server tasks are not preemptible. Also, the task's service demand is not known a priori. We are particularly concerned with the case where the workload is heavy-tailed, as is characteristic of many empirically measured computer workloads. We analyze several natural task assignment polic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An asynchronous recovery scheme based on optimistic message logging for mobile computing systems

    Publication Year: 2000, Page(s):436 - 443
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (136 KB)

    This paper presents an asynchronous recovery scheme to provide fault-tolerance for mobile computing systems. The proposed scheme is based on optimistic message logging, since the checkpointing-only schemes are not suitable for the mobile environment in which unreliable mobile hosts and fragile network connection may hinder any kind of coordination for checkpointing and recovery. Also, in order to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient RMI: dynamic specialization of object serialization

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

    This paper describes a novel approach to object serialization in remote method invocation (RMI). Object serialization transforms objects' representations between heterogeneous platforms. Efficient serialization is primary concern in RMI because the conventional approaches incur large runtime overheads. The approach described specializes a serializing routine dynamically according to a receiver's p... 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.
  • Graceful quorum reconfiguration in a robust emulation of shared memory

    Publication Year: 2000, Page(s):454 - 463
    Cited by:  Papers (10)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB)

    Providing shared-memory abstraction in message-passing systems often simplifies the development of distributed algorithms and allows for the reuse of shared-memory algorithms in the message-passing setting. A robust emulation of atomic single-writer/multi-reader registers in message-passing systems was developed by Attiya, Bar-Noy and Dolev (1995). This emulation was extended by Lynch and Shvartsm... 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.
  • Aggregate TCP congestion control using multiple network probing

    Publication Year: 2000, Page(s):30 - 37
    Cited by:  Papers (7)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (112 KB)

    Extensive research in TCP's congestion control mechanism has resulted in an effective algorithm that gives fairly precise estimates on the available bandwidth on a given network path (J. Postel, 1981; V. Jacobson, 1988). However, most past efforts focused on enhancing the accuracy and robustness of the path bandwidth estimation algorithms for individual TCP connections. Relatively fewer attempts h... View full abstract»

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