24th International Conference on Distributed Computing Systems, 2004. Proceedings.

2004

Filter Results

Displaying Results 1 - 25 of 95
  • Overlay multicast trees of minimal delay

    Publication Year: 2004, Page(s):654 - 661
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (487 KB) | HTML iconHTML

    Overlay multicast (or application-level multicast) has become an increasingly popular alternative to IP-supported multicast. End nodes participating in overlay multicast can form a directed tree rooted at the source using existing unicast links. For each receiving node there is always only one incoming link. Very often, nodes can support no more than a fixed number of outgoing links due to bandwid... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Notification-based QoS control protocol for multimedia group communication in high-speed networks

    Publication Year: 2004, Page(s):644 - 651
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (555 KB) | HTML iconHTML

    In group communications, multiple processes first establish a group and then each process sends a message to multiple processes while receiving messages from multiple processes in the group. In addition, messages are required to be causally/totally delivered to each process. Due to the limited computation and communication resource, processes cannot send and receive as messages as the processes wo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Δ-reliable broadcast: a probabilistic measure of broadcast reliabillity

    Publication Year: 2004, Page(s):636 - 643
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (489 KB) | HTML iconHTML

    We introduce a new probabilistic specification of reliable broadcast communication primitives, called Δ - reliable broadcast. This specification captures in a precise way the reliability of practical broadcast algorithms that, on the one hand, were devised with some form of reliability in mind but, on the other hand, are not considered reliable according to "traditional" reliability specific... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • sFlow: towards resource-efficient and agile service federation in service overlay networks

    Publication Year: 2004, Page(s):628 - 635
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (389 KB) | HTML iconHTML

    Existing research work towards the composition of complex federated services has assumed that service requests and deliveries flow through a particular service path or tree. Here, we extend such a service model to a directed acyclic graph, allowing services to be delivered via parallel paths and interleaved with each other. Such an assumption of the service flow model has apparently introduced com... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A reliable mobile agent communication protocol

    Publication Year: 2004, Page(s):468 - 475
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (411 KB) | HTML iconHTML

    We first propose a generic framework for the design of mobile agent communication protocols. The framework uses a flexible and adaptive mailbox-based scheme that associates each mobile agent with a mailbox while allowing the decoupling between them. This flexible approach allows us to design a variety of protocols which can be made adaptive to specific applications. Based on the framework, we deri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Certificate dispersal in ad-hoc networks

    Publication Year: 2004, Page(s):616 - 623
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (310 KB) | HTML iconHTML

    We investigate how to disperse the certificates, issued in an ad-hoc network, among the network nodes such that the following condition holds. If any node u approaches any other node v in the network, then u can use the certificates stored either in u or in v to obtain the public key of v (so that u can securely send messages to v). We define the cost of certificate dispersal as the average number... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • End-to-end utilization control in distributed real-time systems

    Publication Year: 2004, Page(s):456 - 466
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (403 KB) | HTML iconHTML

    An increasing number of distributed real-time systems face the critical challenge of providing end-to-end quality of service (QoS) guarantees in open and unpredictable environments. In particular, such systems often need to guarantee the CPU utilization on multiple processors in order to achieve overload protection and meet end-to-end deadlines while task execution times are unpredictable. While t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Leak-free group signatures with immediate revocation

    Publication Year: 2004, Page(s):608 - 615
    Cited by:  Papers (6)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (342 KB) | HTML iconHTML

    Group signatures are an interesting and appealing cryptographic construct with many promising potential applications. This work is motivated by attractive features of group signatures, particularly, their potential to serve as foundation for anonymous credential systems. We reexamine the entire notion of group signatures from a systems perspective and identify two new security requirements: leak-f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linguistic support for distributed programming abstractions

    Publication Year: 2004, Page(s):244 - 251
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (300 KB) | HTML iconHTML

    We contribute to addressing context of Java and the type-based publish/subscribe (TPS) abstraction, an object-oriented variant of the publish/subscribe paradigm. We present an experience that compares implementations of TPS in (1) a variant of Java we designed to inherently support TPS, (2) standard Java, and (3) Java augmented with genericity. We derive from our implementation experience general ... View full abstract»

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

    Publication Year: 2004, Page(s):446 - 455
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (340 KB) | HTML iconHTML

    Distributed applications may use sophisticated runtime adaptation strategies to meet their performance or quality-of-service goals. Coordinating an adaptation that involves multiple processes can require complex communication or synchronization, in addition to communication in the base application. We propose conceptually simple high-level directives and a sophisticated runtime algorithm for coord... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Providing statistical delay guarantees in wireless networks

    Publication Year: 2004, Page(s):48 - 55
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (348 KB) | HTML iconHTML

    We study the delay performance of policed traffic to provide real-time guarantees over wireless networks. A number of models have been presented in the literature to describe wireless (radio or optical) networks in terms of the wireless channel and the underlying error control mechanisms. We describe a general framework to incorporate such models into delay guarantee computations for real-time tra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A clock synchronization algorithm for multi-hop wireless ad hoc networks

    Publication Year: 2004, Page(s):574 - 581
    Cited by:  Papers (21)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (699 KB) | HTML iconHTML

    In multihop wireless ad hoc networks, it is important that all mobile hosts are synchronized. Synchronization is necessary for power management and for frequency hopping spread spectrum (FHSS) operations. IEEE 802.11 standards specify a clock synchronization protocol but this protocol suffers from the scalability problem due to its inefficiency contention mechanism. We propose an automatic self-ti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Azim: direction based service using azimuth based position estimation

    Publication Year: 2004, Page(s):700 - 709
    Cited by:  Papers (1)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (420 KB) | HTML iconHTML

    Here, we propose a system named Azim that provides service based on both location and direction, which uses position estimation method based on azimuth data. In this system, a user's position is estimated by having the user point to and measure azimuths of several markers or objects whose positions are already known. Because the measurements are naturally associated with some degree of error, the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nash equilibria in parallel downloading with multiple clients

    Publication Year: 2004, Page(s):94 - 101
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (430 KB) | HTML iconHTML

    Recently, the scheme of parallel downloading has been proposed as a novel approach to expedite the reception of a large file from the Internet. Experiments with a single client have shown that the client can improve its performance significantly by using the scheme. Simulations and experiments with multiple clients using the scheme have been conducted in [Gkantsidis, C et al., (2003), Koo, S et al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Firewall design: consistency, completeness, and compactness

    Publication Year: 2004, Page(s):320 - 327
    Cited by:  Papers (75)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (303 KB) | HTML iconHTML

    A firewall is often placed at the entrance of each private network in the Internet. The function of a firewall is to examine each packet that passes through the entrance and decide whether to accept the packet and allow it to proceed or to discard the packet. A firewall is usually designed as a sequence of rules. To make a decision concerning some packets, the firewall rules are compared, one by o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CLASH: a protocol for Internet-scale utility-oriented distributed computing

    Publication Year: 2004, Page(s):273 - 281
    Cited by:  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (334 KB) | HTML iconHTML

    Distributed hash table (DHT) overlay networks offer an efficient and robust technique for wire-area data storage and queries. Workload from real applications that use DHT networks will likely exhibit significant skews that can result in bottlenecks and failures that limit the overall scalability of the DHT approach. We present the content and load-aware scalable hashing (CLASH) protocol that can e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the confidential auditing of distributed computing systems

    Publication Year: 2004, Page(s):600 - 607
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (555 KB) | HTML iconHTML

    We propose a confidential logging and auditing service for distributed information systems. We propose a cluster-based TTP (trusted third party) architecture for the event log auditing services, so that no single TTP node can have the full knowledge of the logs, and thus no single node can misuse the log information without being detected. On the basis of a relaxed form of secure distributed compu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DERMI: a decentralized peer-to-peer event-based object middleware

    Publication Year: 2004, Page(s):236 - 243
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (262 KB) | HTML iconHTML

    We present DERMI, a decentralized wide-area event-based object middleware built on top of a peer-to-peer substrate. Its main building block is the underlying publish/subscribe event notification system provided by the peer-to-peer layer. By using this methodology, innovative benefits like distributed interception, high performance synchronous/asynchronous one-to-one/one-to-many notifications and d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A feasible region for meeting aperiodic end-to-end deadlines in resource pipelines

    Publication Year: 2004, Page(s):436 - 445
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (485 KB) | HTML iconHTML

    This paper generalizes the notion of utilization bounds for schedulability of aperiodic tasks to the case of distributed resource systems. In the basic model, aperiodically arriving tasks are processed by multiple stages of a resource pipeline within end-to-end deadlines. The authors consider a multidimensional space in which each dimension represents the instantaneous utilization of a single stag... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new QoS point coordination function for multimedia wireless LANs

    Publication Year: 2004, Page(s):40 - 47
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (385 KB) | HTML iconHTML

    We propose a new MAC protocol, named Q-PCF (quality-of-service PCF), which provides QoS guarantees to real-time multimedia applications for WLANs. Specifically, Q-PCF has the following attractive features. First, it supports multiple priority levels and guarantees that high-priority stations always join the polling list earlier than low-priority stations. Second, it provides fast reservation schem... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PROP: a scalable and reliable P2P assisted proxy streaming system

    Publication Year: 2004, Page(s):778 - 786
    Cited by:  Papers (33)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB) | HTML iconHTML

    The demand of delivering streaming media content in the Internet has become increasingly high for scientific, educational, and commercial applications. Three representative technologies have been developed for this purpose, each of which has its merits and serious limitations. Infrastructure-based CDNs with dedicated network bandwidths and powerful media replicas can provide high quality streaming... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Subscription summarization: a new paradigm for efficient publish/subscribe systems

    Publication Year: 2004, Page(s):562 - 571
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (399 KB) | HTML iconHTML

    We contribute a new paradigm for publish/subscribe systems. It is centered on the novel notion of subscription summarization. We first present the summarization structures for a broker's subscriptions and accompanying algorithms, which operate on the summary structures to match incoming events to the brokers with relevant subscriptions and for the maintenance of subscriptions in the face of update... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spatial programming using smart messages: design and implementation

    Publication Year: 2004, Page(s):690 - 699
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (708 KB) | HTML iconHTML

    Spatial programming (SP) is a space-aware programming model for outdoor distributed embedded systems. Central to SP are the concepts of space and spatial reference, which provide applications with a virtual resource naming in networks of embedded systems. A network resource is referenced using its expected physical location and properties. Together with other SP features, such as reference consist... View full abstract»

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

    Publication Year: 2004, Page(s):86 - 93
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (843 KB) | HTML iconHTML

    Having small-sized logical clocks with high causal-ordering accuracy is useful, especially where (i) the precision of the knowledge of the causal dependencies among events implies savings in time overhead and (ii) the cost of transmitting full vector clock timestamps - that precisely characterise the causal relation - is high. Plausible clocks can be used as timestamps to order events in a distrib... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Slowing down Internet worms

    Publication Year: 2004, Page(s):312 - 319
    Cited by:  Papers (34)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (317 KB) | HTML iconHTML

    An Internet worm automatically replicates itself to vulnerable systems and may infect hundreds of thousands of servers across the Internet. It is conceivable that the cyber-terrorists may use a wide-spread worm to cause major disruption to our Internet economy. While much recent research concentrates on propagation models, the defense against worms is largely an open problem. We propose a distribu... View full abstract»

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