189 search results - page 17 / 38 » Bandwidth Scheduling and Path Computation Algorithms for Con... |
LCN
2005
IEEE
14 years 1 months ago
2005
IEEE
— The problem of achieving fairness in the allocation of the bandwidth resource on a link shared by multiple flows of traffic has been extensively researched over the last deca...
PPSN
2004
Springer
14 years 28 days ago
2004
Springer
In this paper we present AntHocNet, a new algorithm for routing in mobile ad hoc networks. Due to the ever changing topology and limited bandwidth it is very hard to establish and ...
WIOPT
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract--We consider the problem of delay-efficient scheduling in general multihop networks. While the class of max-weight type algorithms are known to be throughput optimal for t...
MOBIHOC
2005
ACM
14 years 7 months ago
2005
ACM
Abstract-We present a novel framework for the provision of deterministic end-to-end bandwidth guarantees in wireless ad hoc networks. Guided by a set of local feasibility condition...
ICMCS
2005
IEEE
14 years 1 months ago
2005
IEEE
This paper presents a new routing strategy, that selects the best network paths in an overlay network, in order to minimize the distortion perceived by the end user. We first pro...