Sciweavers

2813 search results - page 390 / 563
» Formalizing Architectural Connection
Sort
View
LATIN
2010
Springer
16 years 1 months ago
Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization
Topological self-stabilization is an important concept to build robust open distributed systems (such as peer-to-peer systems) where nodes can organize themselves into meaningful n...
Dominik Gall, Riko Jacob, Andréa W. Richa, ...
INFOCOM
2009
IEEE
16 years 1 months ago
MARA: Maximum Alternative Routing Algorithm
—In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constr...
Yasuhiro Ohara, Shinji Imahori, Rodney Van Meter
INFOCOM
2009
IEEE
16 years 1 months ago
Analysis of Adaptive Incentive Protocols for P2P Networks
— Incentive protocols play a crucial role to encourage cooperation among nodes in networking applications. The aim of this paper is to provide a general analytical framework to a...
Ben Q. Zhao, John C. S. Lui, Dah-Ming Chiu
CIDM
2007
IEEE
16 years 24 days ago
Mining Subspace Correlations
— In recent applications of clustering such as gene expression microarray analysis, collaborative filtering, and web mining, object similarity is no longer measured by physical ...
Rave Harpaz, Robert M. Haralick
ICDCS
2007
IEEE
16 years 23 days ago
Uniform Data Sampling from a Peer-to-Peer Network
Uniform random sample is often useful in analyzing data. Usually taking a uniform sample is not a problem if the entire data resides in one location. However, if the data is distr...
Souptik Datta, Hillol Kargupta