Sciweavers

364 search results - page 51 / 73
» Shortest-path network interdiction
Sort
View
ESA
2010
Springer
185views Algorithms» more  ESA 2010»
13 years 8 months ago
Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns
We show how to route on very large public transportation networks (up to half a billion arcs) with average query times of a few milliseconds. We take into account many realistic fe...
Hannah Bast, Erik Carlsson, Arno Eigenwillig, Robe...
ADHOC
2007
173views more  ADHOC 2007»
13 years 7 months ago
QoS multicast routing by using multiple paths/trees in wireless ad hoc networks
In this paper, we investigate the issues of QoS multicast routing in wireless ad hoc networks. Due to limited bandwidth of a wireless node, a QoS multicast call could often be blo...
Huayi Wu, Xiaohua Jia
CORR
2002
Springer
92views Education» more  CORR 2002»
13 years 7 months ago
Source Routing and Scheduling in Packet Networks
We study routing and scheduling in packet-switched networks. We assume an adversary that controls the injection time, source, and destination for each packet injected. A set of pat...
Matthew Andrews, Antonio Fernández, Ashish ...
CDC
2009
IEEE
210views Control Systems» more  CDC 2009»
13 years 5 months ago
On maximum lifetime routing in Wireless Sensor Networks
Abstract-- Lifetime maximization is an important optimization problem specific to Wireless Sensor Networks (WSNs) since they operate with limited energy resources which are therefo...
Xu Ning, Christos G. Cassandras
ISCC
2002
IEEE
101views Communications» more  ISCC 2002»
14 years 17 days ago
Partial path protection for WDM networks: end-to-end recovery using local failure information
In this paper, we propose a new protection scheme, which we term partial path protection (PPP), to select endto-end backup paths using local information about network failures. PP...
Hungjen Wang, Eytan Modiano, Muriel Médard