92 search results - page 10 / 19 » Restricted Shortest Path Routing with Concave Costs |
ISCC
2003
IEEE
14 years 25 days ago
2003
IEEE
Multicasting is an efficient and effective approach for supporting content distribution based on the current Internet infrastructure. In this paper, we have proposes the source-in...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— Routing protocols have traditionally been based on finding shortest paths under certain cost metrics. A conventional routing metric models the cost of a path as the sum of the...
SIGCOMM
1999
ACM
13 years 12 months ago
1999
ACM
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...
ESA
2007
Springer
14 years 1 months ago
2007
Springer
In this paper we study several routing problems that generalize shortest paths and the Traveling Salesman Problem. We consider a more general model that incorporates the actual co...
MOBICOM
2006
ACM
14 years 1 months ago
2006
ACM
In many energy-constrained wireless sensor networks, nodes cooperatively forward correlated sensed data to data sinks. In order to reduce the communication cost (e.g. overall ener...