Sciweavers

1434 search results - page 214 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
CN
2007
154views more  CN 2007»
13 years 9 months ago
Disjoint multipath routing using colored trees
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
Srinivasan Ramasubramanian, Harish Krishnamoorthy,...
EOR
2007
69views more  EOR 2007»
13 years 9 months ago
Incorporating inventory and routing costs in strategic location models
We consider a supply chain design problem where the decision maker needs to decide the number and locations of the distribution centers (DCs). Customers face random demand, and ea...
Zuo-Jun Max Shen, Lian Qi
TPDS
2008
116views more  TPDS 2008»
13 years 9 months ago
A Dynamic Skip List-Based Overlay for On-Demand Media Streaming with VCR Interactions
Media distribution through application-layer overlay networks has received considerable attention recently, owing to its flexible and readily deployable nature. On-demand streaming...
Dan Wang, Jiangchuan Liu
SIGOPS
2010
127views more  SIGOPS 2010»
13 years 8 months ago
Optimizing information flow in the gossip objects platform
Gossip-based protocols are commonly used for diffusing information in large-scale distributed applications. GO (Gossip Objects) is a per-node gossip platform that we developed in...
Ymir Vigfusson, Ken Birman, Qi Huang, Deepak P. Na...
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
13 years 8 months ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
Christoph Lenzen, Roger Wattenhofer