Sciweavers

4744 search results - page 71 / 949
» Connected Computing
Sort
View
ISPA
2005
Springer
15 years 8 months ago
ER-TCP: An Efficient Fault-Tolerance Scheme for TCP Connections
Abstract. This paper proposes a novel scheme, named ER-TCP, which transparently masks the failures happened on the server nodes in a cluster from clients at TCP connection granular...
Zhiyuan Shao, Hai Jin, Bin Cheng, Wenbin Jiang
MSWIM
2003
ACM
15 years 7 months ago
Connectivity of wireless multihop networks in a shadow fading environment
This article analyzes the connectivity of multihop radio networks in a log-normal shadow fading environment. Assuming the nodes have equal transmission capabilities and are randoml...
Christian Bettstetter, Christian Hartmann
TC
2008
15 years 2 months ago
Iterative Local Solutions for Connected Dominating Set in Ad Hoc Wireless Networks
We propose a general framework of the iterative local solution (ILS) for computing a connected dominating set (CDS) in ad hoc wireless networks, which include wireless sensor netwo...
Jie Wu, Fei Dai, Shuhui Yang
MOBIDE
2009
ACM
15 years 7 months ago
Data-aware connectivity in mobile replicated systems
Optimistic replication is a fundamental technique for supporting concurrent work practices in mobile environments. However, due to sudden and frequent transitions to weakly connec...
João Pedro Barreto, João Garcia, Lu&...
128
Voted
JCO
2011
113views more  JCO 2011»
14 years 9 months ago
Hardness and algorithms for rainbow connection
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, denoted r...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, ...