2497 search results - page 54 / 500 » Requirements for models of achievable routing |
107
click to vote
ISCC
2005
IEEE
15 years 7 months ago
2005
IEEE
The problem of computing bandwidth guaranteed paths for given flow requests in an ad-hoc network is complicated because neighboring links share the medium. We define the path wi...
153
Voted
BROADNETS
2007
IEEE
15 years 8 months ago
2007
IEEE
— Traffic engineering has been extensively studied to maximize network resource utilization while minimizing call blocking [1]. As the the demand for high data rate services ove...
115
click to vote
DCOSS
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...
123
click to vote
SPAA
2004
ACM
15 years 7 months ago
2004
ACM
This paper introduces a new adaptive method, Channel Queue Routing (CQR), for load-balanced routing on k-ary n-cube interconnection networks. CQR estimates global congestion in th...
108
click to vote
NETWORK
2008
15 years 1 months ago
2008
Multihomed subscribers are increasingly adopting intelligent route control solutions to optimize the cost and end-to-end performance of the traffic routed among the different link...