摘要: In this chapter network path problems arising in several different domains have been discussed. Based on the characteristics of paths typical to nature application domain, a general classification has made. The goal computation may be finding single or multiple between source-destination node pair network. case computation, one seek find totally disjoint partially paths. chapter, two corresponding scenario and discussed four subsections. these subsections, formally defined first, followed by discussion proposed algorithms for solution problems, complexity analysis experimental results.
springer.com
elsevier.com
sci-hub.st 参考文章(2)
Aditya Akella, Srinivasan Seshan, Anees Shaikh, An empirical evaluation of wide-area internet bottlenecks internet measurement conference. ,vol. 31, pp. 316- 317 ,(2003) , 10.1145/781027.781075
S. Savage, T. Anderson, A. Aggarwal, D. Becker, N. Cardwell, A. Collins, E. Hoffman, J. Snell, A. Vahdat, G. Voelker, J. Zahorjan, Detour: informed Internet routing and transport IEEE Micro. ,vol. 19, pp. 50- 59 ,(1999) , 10.1109/40.748796