Sciweavers

132 search results - page 25 / 27
» On a Resequencing Model for High Speed Networks
Sort
View
JCM
2010
126views more  JCM 2010»
13 years 5 months ago
Adding Redundancy to Replication in Window-aware Delay-tolerant Routing
— This paper presents a resource-efficient protocol for opportunistic routing in delay-tolerant networks (DTN). First, our approach exploits the context of mobile nodes (speed, ...
Gabriel Sandulescu, Simin Nadjm-Tehrani
ICS
2005
Tsinghua U.
14 years 27 days ago
Optimization of MPI collective communication on BlueGene/L systems
BlueGene/L is currently the world’s fastest supercomputer. It consists of a large number of low power dual-processor compute nodes interconnected by high speed torus and collect...
George Almási, Philip Heidelberger, Charles...
AAAI
1996
13 years 8 months ago
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
Craig Boutilier, David Poole
PE
2008
Springer
113views Optimization» more  PE 2008»
13 years 7 months ago
Joint uplink and downlink admission control to both streaming and elastic flows in CDMA/HSDPA systems
TCP-based data flows generate packets and ACKs in two directions, be it in the wireline or wireless networks. In the latter case, packets are typically found in the downlink where...
Tijani Chahed, Eitan Altman, Salah-Eddine Elayoubi
INFOCOM
2005
IEEE
14 years 1 months ago
Fairness in MIMD congestion control algorithms
The Mulitplicative Increase Multiplicative Decrease (MIMD) congestion control algorithm in the form of Scalable TCP has been proposed for high speed networks. We study fairness amo...
Eitan Altman, Konstantin Avrachenkov, B. J. Prabhu