Sciweavers

1815 search results - page 209 / 363
» Path Planning for Network Performance
Sort
View
ICC
2009
IEEE
167views Communications» more  ICC 2009»
13 years 5 months ago
Efficient Adaptive Routing in Delay Tolerant Networks
Conventional routing algorithms in mobile ad hoc networks (MANETs), i.e., multi-hop forwarding, assume the existence of contemporaneous source-destination paths and are not scalabl...
Cong Liu, Jie Wu
FOCS
2000
IEEE
13 years 11 months ago
How Bad is Selfish Routing?
We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency ...
Tim Roughgarden, Éva Tardos
FOCS
1997
IEEE
14 years 7 days ago
General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate)
A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time t...
Matthew Andrews, Antonio Fernández, Mor Har...
JSAC
2011
184views more  JSAC 2011»
13 years 3 months ago
Goodput Enhancement of VANETs in Noisy CSMA/CA Channels
— The growing interest in vehicular ad hoc networks (VANETs) enables decentralized traveler information systems to become more feasible and effective in Intelligent Transportatio...
Yusun Chang, Christopher P. Lee, John A. Copeland
HICSS
2003
IEEE
119views Biometrics» more  HICSS 2003»
14 years 1 months ago
A First Person IP over HDSL Case Study
As many authors have articulated, the “last mile problem” is often cited as a persistent engineering obstacle in deploying residential broadband solutions. Additionally, some ...
Wayne Smith