Sciweavers

866 search results - page 127 / 174
» On Dynamic Shortest Paths Problems
Sort
View
TRIDENTCOM
2006
IEEE
14 years 3 months ago
A testbed demonstrating optical IP switching (OIS) in disaggregated network architectures
: The lack of a unified control plane does not allow current optical networks to dynamically provision new optical paths. The IETF standardization body has proposed the Generalized...
Marco Ruffini, Donal O'Mahony, Linda Doyle
INFOCOM
2006
IEEE
14 years 3 months ago
Minimum User-Perceived Interference Routing in Service Composition
— Service Composition is a promising technology for providing on-demand services in dynamic and loosely coupled peerto-peer (P2P) networks. Because of system dynamics, such as th...
Li Xiao, Klara Nahrstedt
SIGCOMM
2004
ACM
14 years 3 months ago
Routing in a delay tolerant network
We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be kn...
Sushant Jain, Kevin R. Fall, Rabin K. Patra
CDC
2009
IEEE
147views Control Systems» more  CDC 2009»
14 years 2 months ago
A simulation-based method for aggregating Markov chains
— This paper addresses model reduction for a Markov chain on a large state space. A simulation-based framework is introduced to perform state aggregation of the Markov chain base...
Kun Deng, Prashant G. Mehta, Sean P. Meyn
ECAI
2010
Springer
13 years 10 months ago
EP for Efficient Stochastic Control with Obstacles
Abstract. We address the problem of continuous stochastic optimal control in the presence of hard obstacles. Due to the non-smooth character of the obstacles, the traditional appro...
Thomas Mensink, Jakob J. Verbeek, Bert Kappen