Resource relocation on asymmetric networks
Journal of Graph Algorithms and Applications, Tome 14 (2010) no. 2, pp. 149-163.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

The necessary information to optimally serve sequential requests at the vertices of an undirected, unweighted graph with a single mobile resource is a known result of Chung, Graham, and Saks; however, generalizations of this concept to directed and weighted graphs present unforeseen and surprising changes in the necessary lookahead for strategic optimization. A pair of edges of unequal weights and opposite orientation can serve to simulate a communication or transportation connection with asymmetric costs, as may arise in a transportation network from prevailing winds or elevation changes, or in a communication network from aDSL or a similar technology. This research explores the complications introduced by asymmetric connections within even very small networks. We consider the dynamic relocation problem on a two-vertex system and find that, even in this simplest possible asymmetric graph, the necessary lookahead for optimal relocation may be arbitrarily large. This investigation also gives rise to a linear-time algorithm to determine the optimizing real-time response to any request sequence which uniquely determines an optimal response.
@article{JGAA_2010_14_2_a1,
     author = {D. Jacob Wildstrom},
     title = {Resource relocation on asymmetric networks},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {149--163},
     publisher = {mathdoc},
     volume = {14},
     number = {2},
     year = {2010},
     doi = {10.7155/jgaa.00202},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00202/}
}
TY  - JOUR
AU  - D. Jacob Wildstrom
TI  - Resource relocation on asymmetric networks
JO  - Journal of Graph Algorithms and Applications
PY  - 2010
SP  - 149
EP  - 163
VL  - 14
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00202/
DO  - 10.7155/jgaa.00202
LA  - en
ID  - JGAA_2010_14_2_a1
ER  - 
%0 Journal Article
%A D. Jacob Wildstrom
%T Resource relocation on asymmetric networks
%J Journal of Graph Algorithms and Applications
%D 2010
%P 149-163
%V 14
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00202/
%R 10.7155/jgaa.00202
%G en
%F JGAA_2010_14_2_a1
D. Jacob Wildstrom. Resource relocation on asymmetric networks. Journal of Graph Algorithms and Applications, Tome 14 (2010) no. 2, pp. 149-163. doi : 10.7155/jgaa.00202. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00202/

Cité par Sources :