Sciweavers

625 search results - page 98 / 125
» Routing in Trees
Sort
View
CIAC
2010
Springer
246views Algorithms» more  CIAC 2010»
14 years 1 months ago
Capacitated Confluent Flows: Complexity and Algorithms
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
Daniel Dressler and Martin Strehler
GLVLSI
2010
IEEE
154views VLSI» more  GLVLSI 2010»
13 years 12 months ago
Resource-constrained timing-driven link insertion for critical delay reduction
For timing-driven or yield-driven designs, non-tree routing has become more and more popular and additional loops provide the redundant paths to protect against the effect of the ...
Jin-Tai Yan, Zhi-Wei Chen
DEBS
2007
ACM
13 years 11 months ago
Chained forests for fast subsumption matching
Content delivery is becoming increasingly popular on the Internet. There are many ways to match content to subscribers. In this paper, we focus on subsumption-based matching. We p...
Sasu Tarkoma
MOBIHOC
2007
ACM
14 years 9 months ago
The multicast capacity of large multihop wireless networks
We consider wireless ad hoc networks with a large number of users. Subsets of users might be interested in identical information, and so we have a regime in which several multicas...
Srinivas Shakkottai, Xin Liu, R. Srikant
MOBIQUITOUS
2007
IEEE
14 years 4 months ago
A Low-delay Protocol for Multihop Wireless Body Area Networks
—Wireless Body Area Networks (WBANs) form a new and interesting area in the world of remote health monitoring. An important concern in such networks is the communication between ...
Benoît Latré, Bart Braem, Ingrid Moer...