92 search results - page 3 / 19 » Restricted Shortest Path Routing with Concave Costs |
JCO
2006
14 years 9 months ago
2006
Reliability is a very important issue in Mobile Ad hoc NETworks (MANETs). Shortest paths are usually used to route packets in MANETs. However, a shortest path may fail quickly, bec...
ICDCS
1999
IEEE
15 years 1 months ago
1999
IEEE
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
WINE
2005
Springer
15 years 2 months ago
2005
Springer
Abstract. In this paper we present a cooperative game theoretic interpretation of the shortest path problem. We consider a buying agent who has a budget to go from a specified sou...
EOR
2007
14 years 9 months ago
2007
This paper studies an arc routing problem with capacity constraints and time-dependent service costs. This problem is motivated by winter gritting applications where the ‘‘tim...
113
click to vote
INFOCOM
1997
IEEE
15 years 1 months ago
1997
IEEE
The paper addresses the issue of minimizing the number of nodes involved in routing over a multicast tree and in the maintenance of such a tree in a datagram network. It presents a...