189 search results - page 18 / 38 » Bandwidth Scheduling and Path Computation Algorithms for Con... |
ICNP
2005
IEEE
14 years 1 months ago
2005
IEEE
Existing geographic routing algorithms depend on the planarization of the network connectivity graph for correctness, and the planarization process gives rise to a welldefined no...
ICNP
2003
IEEE
14 years 26 days ago
2003
IEEE
Path probing is essential to maintaining an efficient overlay network topology. However, the cost of a full-scale probing is as high as ¢¤£¦¥¨§© , which is prohibitive i...
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
New architectures have recently been proposed and deployed to support end-to-end advance reservation of network resources. These architectures rely on the use a centralized schedul...
LCN
2000
IEEE
13 years 11 months ago
2000
IEEE
Future computer networks are expected to carry bursty real-time traffic with stringent time-delay requirements. Popular shortest-path routing protocols have the disadvantage of ca...
IWCMC
2010
ACM
13 years 5 months ago
2010
ACM
This work presents a cross-layer modification to the DSR protocol which discovers high throughput paths on multi-hop wireless mesh networks. The modified DSR incorporates a metric...