Results 11 - 20 of 13,226

Group Protocol 333 Team

by Michael F. Para, David V. Glidden , 2000
"... AIDS Clinical Trials Group protocol 333 was an open-label trial of a switch from saquinavir (SQV) hard capsules (SQVhc) to indinavir (IDV) or saquinavir soft-gel capsules (SQVsgc) after 148 weeks of prior treatment with SQVhc. Eighty-nine subjects received IDV or SQVsgc or continued to receive SQVhc ..."
Abstract - Add to MetaCart
AIDS Clinical Trials Group protocol 333 was an open-label trial of a switch from saquinavir (SQV) hard capsules (SQVhc) to indinavir (IDV) or saquinavir soft-gel capsules (SQVsgc) after 148 weeks of prior treatment with SQVhc. Eighty-nine subjects received IDV or SQVsgc or continued to receive

Scalable Application Layer Multicast

by Suman Banerjee, Bobby Bhattacharjee, Christopher Kommareddy , 2002
"... We describe a new scalable application-layer multicast protocol, specifically designed for low-bandwidth, data streaming applications with large receiver sets. Our scheme is based upon a hierarchical clustering of the application-layer multicast peers and can support a number of different data deliv ..."
Abstract - Cited by 731 (21 self) - Add to MetaCart
delivery trees with desirable properties. We present extensive simulations of both our protocol and the Narada application-layer multicast protocol over Internet-like topologies. Our results show that for groups of size 32 or more, our protocol has lower link stress (by about 25%), improved or similar

An Architecture for Wide-Area Multicast Routing

by Stephen Deering , Deborah Estrin , Dino Farinacci , Van Jacobson , Ching-gung Liu, Liming Wei
"... Existing multicast routing mechanisms were intended for use within regions where a group is widely represented or bandwidth is universally plentiful. When group members, and senders to those group members, are distributed sparsely across a wide area, these schemes are not efficient; data packets or ..."
Abstract - Cited by 534 (22 self) - Add to MetaCart
is measured in terms of the state, control message processing, and data packet processing, required across the entire network in order to deliver data packets to the members of the group. Our Protocol Independent Multicast (PIM) architecture: (a) maintains the traditional IP multicast service model

Knowledge and Common Knowledge in a Distributed Environment

by Joseph Y. Halpern, Yoram Moses - Journal of the ACM , 1984
"... : Reasoning about knowledge seems to play a fundamental role in distributed systems. Indeed, such reasoning is a central part of the informal intuitive arguments used in the design of distributed protocols. Communication in a distributed system can be viewed as the act of transforming the system&apo ..."
Abstract - Cited by 578 (55 self) - Add to MetaCart
's state of knowledge. This paper presents a general framework for formalizing and reasoning about knowledge in distributed systems. We argue that states of knowledge of groups of processors are useful concepts for the design and analysis of distributed protocols. In particular, distributed knowledge

A Survey of Mobility Models for Ad Hoc Network Research

by Tracy Camp , Jeff Boleng, Vanessa Davies - WIRELESS COMMUNICATIONS & MOBILE COMPUTING (WCMC): SPECIAL ISSUE ON MOBILE AD HOC NETWORKING: RESEARCH, TRENDS AND APPLICATIONS , 2002
"... In the performance evaluation of a protocol for an ad hoc network, the protocol should be tested under realistic conditions including, but not limited to, a sensible transmission range, limited buffer space for the storage of messages, representative data traffic models, and realistic movements of t ..."
Abstract - Cited by 1213 (8 self) - Add to MetaCart
In the performance evaluation of a protocol for an ad hoc network, the protocol should be tested under realistic conditions including, but not limited to, a sensible transmission range, limited buffer space for the storage of messages, representative data traffic models, and realistic movements

Consensus Problems in Networks of Agents with Switching Topology and Time-Delays

by Reza Olfati Saber, Richard M. Murray , 2003
"... In this paper, we discuss consensus problems for a network of dynamic agents with fixed and switching topologies. We analyze three cases: i) networks with switching topology and no time-delays, ii) networks with fixed topology and communication time-delays, and iii) max-consensus problems (or leader ..."
Abstract - Cited by 1112 (21 self) - Add to MetaCart
leader determination) for groups of discrete-time agents. In each case, we introduce a linear/nonlinear consensus protocol and provide convergence analysis for the proposed distributed algorithm. Moreover, we establish a connection between the Fiedler eigenvalue of the information flow in a network (i

A group mobility model for ad hoc wireless networks

by Xiaoyan Hong, Mario Gerla, Guangyu Pei, Ching-chuan Chiang , 1999
"... In this paper, we present a survey of various mobility models in both cellular networks and multi-hop networks. We show that group motion occurs frequently in ad hoc networks, and introduce a novel group mobility model- Reference Point Group Mobility (RPGM)- to represent the relationship among mobil ..."
Abstract - Cited by 461 (27 self) - Add to MetaCart
In this paper, we present a survey of various mobility models in both cellular networks and multi-hop networks. We show that group motion occurs frequently in ad hoc networks, and introduce a novel group mobility model- Reference Point Group Mobility (RPGM)- to represent the relationship among

Multicast Operation of the Ad-hoc On-Demand Distance Vector Routing Protocol

by Elizabeth M. Royer, Charles E. Perkins , 1999
"... An ad-hoc network is the cooperative engagement of a collection of (typically wireless) mobile nodes without the required intervention of any centralized access point or existing infrastructure. To provide optimal communication ability, a routing protocol for such a dynamic self-starting network mu ..."
Abstract - Cited by 446 (3 self) - Add to MetaCart
An ad-hoc network is the cooperative engagement of a collection of (typically wireless) mobile nodes without the required intervention of any centralized access point or existing infrastructure. To provide optimal communication ability, a routing protocol for such a dynamic self-starting network

Receiver-driven Layered Multicast

by Steven McCanne, Van Jacobson, Martin Vetterli , 1996
"... State of the art, real-time, rate-adaptive, multimedia applications adjust their transmission rate to match the available network capacity. Unfortunately, this source-based rate-adaptation performs poorly in a heterogeneous multicast environment because there is no single target rate — the conflicti ..."
Abstract - Cited by 737 (22 self) - Add to MetaCart
receiver specifies its level of subscription by joining a subset of the groups. In this paper, we extend the multiple group framework with a rate-adaptation protocol called Receiver-driven Layered Multicast, or RLM. Under RLM, multicast receivers adapt to both the static heterogeneity of link bandwidths

A Reliable Multicast Framework for Light-weight Sessions and Application Level Framing

by Sally Floyd, Van Jacobson, Steven McCanne, Ching-gung Liu, Lixia Zhang , 1995
"... This paper... reliable multicast framework for application level framing and light-weight sessions. The algorithms of this framework are efficient, robust, and scale well to both very large networks and very large sessions. The framework has been prototype in wb, a distributed whiteboard application ..."
Abstract - Cited by 1085 (45 self) - Add to MetaCart
application, and has been extensively tested on a global scale with sessions ranging from a few to more than 1000 participants. The paper describes the principles that have guided our design, including the 1P multicast group delivery model, an end-to-end, receiver-based model of reliability
Results 11 - 20 of 13,226