114 search results - page 3 / 23 » Optimal Routing in Binomial Graph Networks |
APPROX
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
ICC
2007
IEEE
13 years 7 months ago
2007
IEEE
— In this paper, we study the performance of the 2-hop routing scheme proposed for ad hoc wireless networks with mobile nodes, considering realistic node mobility patterns. First...
ATMOS
2009
13 years 7 months ago
2009
We present a set of three new time-dependent models with increasing flexibility for realistic route planning in flight networks. By these means, we obtain small graph sizes while m...
ICCAD
2006
IEEE
14 years 2 months ago
2006
IEEE
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
IPSN
2004
Springer
13 years 11 months ago
2004
Springer
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...