1204 search results - page 32 / 241 » Optimal Routing in a Small-World Network |
INFOCOM
1995
IEEE
13 years 11 months ago
1995
IEEE
—In this paper, we derive a time-complexity bound for the gradient projection method for optimal routing in data networks. This result shows that the gradient projection algorith...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
—Multicast is an important communication paradigm, also a problem well known for its difficulty (NP-completeness) to achieve certain optimization goals, such as minimum network ...
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— 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 ...
JACIII
2008
13 years 7 months ago
2008
Abstract. One of the main functions of the traffic navigation systems is to find the optimal route to the destination. In this paper, we propose an iterative Q value updating algor...
ICOIN
2005
Springer
14 years 1 months ago
2005
Springer
Network mobility (NEMO) basic support protocol maintains the connectivity when mobile router (MR) changes its point of attachment to the Internet by establishing a bidirectional tu...