Shortest route with time dependent length of edges and limited delay possibilities in nodes.
Jonathan HalpernPublished in: Math. Methods Oper. Res. (1977)
Keyphrases
- shortest path
- path length
- travel time
- weighted graph
- directed graph
- destination node
- road network
- edge weights
- routing table
- routing algorithm
- minimum length
- small world
- undirected graph
- packet delivery
- route discovery
- spanning tree
- end to end delay
- origin destination
- routing overhead
- multicast tree
- graph structure
- ad hoc networks
- end to end
- minimum cost
- routing protocol
- random walk
- social networks