Sciweavers

2497 search results - page 98 / 500
» Requirements for models of achievable routing
Sort
View
IPPS
2010
IEEE
14 years 11 months ago
Stability of a localized and greedy routing algorithm
Abstract--In this work, we study the problem of routing packets between undifferentiated sources and sinks in a network modeled by a multigraph. We consider a distributed and local...
Christelle Caillouet, Florian Huc, Nicolas Nisse, ...
COMSWARE
2007
IEEE
15 years 8 months ago
On Optimal Performance in Mobile Ad hoc Networks
In this paper we are concerned with finding the maximum throughput that a mobile ad hoc network can support. Even when nodes are stationary, the problem of determining the capaci...
Tapas K. Patra, Joy Kuri, Pavan Nuggehalli
IHI
2010
197views Healthcare» more  IHI 2010»
14 years 8 months ago
Beyond safe harbor: automatic discovery of health information de-identification policy alternatives
Regulations in various countries permit the reuse of health information without patient authorization provided the data is "de-identified". In the United States, for ins...
Kathleen Benitez, Grigorios Loukides, Bradley Mali...
143
Voted
OSN
2011
14 years 8 months ago
A distributed impairment aware QoS framework for all-optical networks
—Different physical impairments can occur in optical transmission systems. Impairments such as fiber nonlinear effects are dependent on network state and vary with traffic and to...
Wenhao Lin, Timothy Hahn, Richard S. Wolff, Brenda...
TCAD
2010
105views more  TCAD 2010»
14 years 8 months ago
Fault Tolerant Network on Chip Switching With Graceful Performance Degradation
The structural redundancy inherent to on-chip interconnection networks [networks on chip (NoC)] can be exploited by adaptive routing algorithms in order to provide connectivity eve...
Adán Kohler, Gert Schley, Martin Radetzki