92 search results - page 15 / 19 » Restricted Shortest Path Routing with Concave Costs |
MASS
2010
13 years 7 months ago
2010
Abstract--In a delay tolerant network (DTN), nodes are connected intermittently and the future node connections are mostly unknown. Since in these networks, a fully connected path ...
NOMS
2006
IEEE
14 years 3 months ago
2006
IEEE
— Open Shortest Path First (OSPF) is a routing protocol which is widely used in the Industry. Its functionality mainly depends on the weights assigned to the links. Given the tra...
ICPP
2006
IEEE
14 years 3 months ago
2006
IEEE
— Due to resource scarcity, a paramount concern in ad hoc networks is to utilize the limited resources efficiently. The self-organized nature of ad hoc networks makes the social...
SODA
1998
ACM
13 years 11 months ago
1998
ACM
We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of reque...
NETWORKING
2004
13 years 11 months ago
2004
Abstract. In computer networks (and, say, transportation networks), we can consider the situation where each user has its own routing decision so as to minimize noncooperatively th...