Sciweavers

289 search results - page 16 / 58
» Simple COMA Node Implementations
Sort
View
JSA
2000
116views more  JSA 2000»
13 years 8 months ago
Distributed vector architectures
Integrating processors and main memory is a promising approach to increase system performance. Such integration provides very high memory bandwidth that can be exploited efficientl...
Stefanos Kaxiras
MOBICOM
2010
ACM
13 years 9 months ago
Inferring and mitigating a link's hindering transmissions in managed 802.11 wireless networks
In 802.11 managed wireless networks, the manager can address under-served links by rate-limiting the conflicting nodes. In order to determine to what extent each conflicting node ...
Eugenio Magistretti, Omer Gurewitz, Edward W. Knig...
COMSWARE
2007
IEEE
14 years 3 months ago
On the Effects of Cooperation in DTNs
— In a Delay Tolerant Network (DTN) the nodes may behave autonomously deciding on their own whether to implement or not the rules of a routing algorithm. In this paper, the effec...
Antonis Panagakis, Athanasios Vaios, Ioannis Stavr...
PPL
2002
93views more  PPL 2002»
13 years 8 months ago
Embedding of Fault-Tolerant Trees in the Josephus Cube
The tree interconnection network lends itself to several suitably structured applications. However, the low connectivity at each node, traffic congestion and single point of failu...
Peter K. K. Loh, Wen-Jing Hsu
CORR
2010
Springer
160views Education» more  CORR 2010»
13 years 5 months ago
Routing with Mutual Information Accumulation in Wireless Networks
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
Rahul Urgaonkar, Michael J. Neely