transmit group membership lists, and hence group information must be disseminated through unreliable and potentially malicious nodes. In this paper, we propose a local and robust group information dissemination and consolidation protocol, called MembersOnly, that both quickly and accurately transmits group

, and leverages Pastry's reliability, self-organization, and locality properties. Pastry is used to create and manage groups and to build efficient multicast trees for the dissemination of messages to each group. Scribe provides best-effort reliability guarantees, but we outline how an application can extend

The strong bias in favor of domestic securities is a well-documented characteristic of international investment portfolios, yet we show that the preference for investing close to home also applies to portfolios of domestic stocks. Specifically, U.S. investment managers exhibit a strong preference

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

General-purpose operating systems provide inadequate support for resource management in large-scale servers. Applications lack sufficient control over scheduling and management of machine resources, which makes it difficult to enforce priority policies, and to provide robust and controlled service

this paper we introduce a system called Crowds for protecting users' anonymity on the worldwide -web. Crowds, named for the notion of "blending into a crowd", operates by grouping users into a large and geographically diverse group (crowd) that collectively issues requests on behalf

the robustness, portability and user-friendliness of the programs. New features include NEXUS and FASTA format output, printing range numbers and faster tree calculation. Although, Clustal was originally developed to run on a local computer, numerous Web servers have been set up, notably at the EBI

endto-end latencies and similar failure recovery properties. More importantly, it is able to achieve these results by using orders of magnitude lower control traffic. Finally, we present results from our wide-area testbed in which we experimented with 32-100 member groups distributed over 8 different

Heteroscedasticity biases tests for contagion based on correlation coefficients. When contagion is defined as a significant increase in market co-movement after a shock to one country, previous work suggests contagion occurred during recent crises. This paper shows that correlation coefficients are conditional on market volatility. Under certain assumptions, it is possible to adjust for this bias. Using this adjustment, there was virtually no increase in unconditional correlation coefficients (i.e., no contagion) during the 1997 Asian crisis, 1994 Mexican devaluation, and 1987 U.S. market crash. There is a high level of market co-movement in all periods, however, which we call interdependence.

global knowledge, efficient algorithms can be constructed for routing in such environments. To the best of our knowledge this is the first such investigation of routing issues in DTNs.