A more efficient link-state routing algorithm for telecommunication networks
暂无分享,去创建一个
Lian Jian | Zeng Guangzhou | Song Yanwei | MingQu Fan | Zeng Guangzhou | Mingqu Fan | Lian Jian | Song Yanwei
[1] John Moy,et al. OSPF Version 2 , 1998, RFC.
[2] Kang G. Shin,et al. Understanding TCP dynamics in an integrated services Internet , 1997, Proceedings of 7th International Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV '97).
[3] Gang Liu,et al. A*Prune: an algorithm for finding K shortest paths subject to multiple constraints , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).
[4] A. Udaya Shankar,et al. Transient and steady-state performance of routing protocols: distance-vector versus link-state , 1992 .
[5] Subhash Suri,et al. Finding the k shortest simple paths , 2007, ALENEX.
[6] D. Estrin,et al. RSVP: a new resource reservation protocol , 2001 .
[7] W. Matthew Carlyle,et al. Near-shortest and K-shortest simple paths , 2005 .
[8] David Eppstein,et al. Finding the k shortest paths , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[9] Wayne D. Grover,et al. Optimized k‐shortest‐paths algorithm for facility restoration , 1994, Softw. Pract. Exp..
[10] J. Turner,et al. New directions in communications (or which way to the information age?) , 1986, IEEE Communications Magazine.
[11] Scott Shenker,et al. Specification of Guaranteed Quality of Service , 1997, RFC.
[12] Ariel Orda,et al. QoS Routing Mechanisms and OSPF Extensions , 1999, RFC.