Stochastic shortest path with unlimited hops

Information Processing Letters

Volumn 109, Issue 5, 2009, Pages 290-295

  Das, Ananya ^a   Martel, Charles ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Graph algorithms; Online algorithms; Shortest path; Stochastic network

Indexed keywords

EXPECTED COSTS; GRAPH ALGORITHMS; NEW RESULTS; NODE BASED; NODES AND LINKS; NP-HARD; NUMBER OF HOPS; ONLINE ALGORITHMS; OPTIMAL ROUTING; ROUTING PROBLEMS; SHORTEST PATH; STATES CHANGES; STOCHASTIC NETWORK; STOCHASTIC SHORTEST PATHS;

COMPUTER NETWORKS;

EID: 58149302831     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2008.11.003     Document Type: Article

References (12)

1. E. Ayanoglu, Signal flow graphs for path enumeration and deflection routing analysis in multihop networks, in: IEEE Global Telecommunications Conference, vol. 2, Nov. 1989, pp. 1022-1029
2. Fàbrega J., and Muñoz X. Minimum-cost QoS multicast and unicast routing in communication networks. Europar 2003. Lecture Notes in Computer Science vol. 2790 (2003) 989-994
3. Fan Y., Kalaba R., and Moore J. Arriving on time. Journal of Optimization Theory and Applications 127 3 (2005) 497-513
4. Fan Y., Kalaba R., and Moore J. Shortest paths in stochastic networks with correlated link costs. Computers and Mathematics with Applications 49 (2005) 1549-1564
5. Hsu C., Liu T., and Huang N. Performance analysis of deflection routing in optical burst-switched networks. IEEE/ACM Infocom 1 (2002) 66-73
6. Fu L., and Rillet L. Expected shortest paths in dynamic and stochastic traffic networks. Transportation Research 32 7 (1998) 499-516
7. E. Nikolova, M. Brand, D. Karger, Optimal route planning under uncertainty, in: Proceedings of International Conference on Planning and Scheduling, Lake District, England, June 2006
8. E. Nikolova, J. Kelner, M. Brand, M. Mitzenmacher, Stochastic shortest paths via quasi-convex maximization, in: Proceedings of European Symposium of Algorithms, Zurich, Switzerland, 2006, pp. 552-563
9. Thomas B., and White C. The dynamic shortest path problem with anticipation. European Journal of Operational Research 176 2 (2007) 836-854
10. Waller S., and Ziliaskopoulos A. On the online shortest path problem with limited arc cost dependencies. Networks 40 4 (2002) 216-227
11. X. Wang, H. Morikawa, T. Aoyama, Burst optical deflection routing protocol for wavelength routing WDM networks, in: Proceedings of SPIE/IEEE Opticom, 2000
12. Zalesky A., Vu H., Zukerman M., Rosberg Z., and Wong E. Evaluation of limited wavelength conversion and deflection routing as methods to reduce blocking probability in optical burst switched networks. IEEE International Conference on Communications vol. 3 (June 2004), IEEE 1543-1547