Sciweavers

846 search results - page 43 / 170
» The stability of paths in a dynamic network
Sort
View
GLOBECOM
2006
IEEE
15 years 5 months ago
Optimal Routing Between Alternate Paths With Different Network Transit Delays
— We consider the path-determination problem in Internet core routers that distribute flows across alternate paths leading to the same destination. We assume that the remainder ...
Essia Hamouda Elhafsi, Mart Molle
CORR
2010
Springer
139views Education» more  CORR 2010»
14 years 10 months ago
Centrality Metric for Dynamic Networks
Centrality is an important notion in network analysis and is used to measure the degree to which network structure contributes to the importance of a node in a network. While many...
Kristina Lerman, Rumi Ghosh, Jeon Hyung Kang
SCL
2010
124views more  SCL 2010»
14 years 10 months ago
ISDS small-gain theorem and construction of ISDS Lyapunov functions for interconnected systems
We consider networks of input-to-state dynamically stable (ISDS) systems and use a small-gain condition to assure the ISDS property for their interconnection. Under this small-gai...
Sergey Dashkovskiy, Lars Naujok
NIPS
1993
15 years 1 months ago
Packet Routing in Dynamically Changing Networks: A Reinforcement Learning Approach
This paper describes the Q-routing algorithm for packet routing, in which a reinforcement learning module is embedded into each node of a switching network. Only local communicati...
Justin A. Boyan, Michael L. Littman
CISS
2008
IEEE
15 years 6 months ago
Optimal path planning for mobile backbone networks
— Mobile Backbone Networks are heterogeneous wireless networks in which a subset of the nodes are more capable than others. The more capable nodes are referred to as Mobile Backb...
Anand Srinivas, Eytan Modiano