Concepts of Exact QoS Routing Algorithms, IEEE/ACM Transactions on Networking, vol.12, issue.5, pp.851-864, 2004. ,
DOI : 10.1109/TNET.2004.836112
Hop-by-hop quality of service routing, Computer Networks, vol.37, issue.3-4, pp.407-423, 2001. ,
DOI : 10.1016/S1389-1286(01)00222-5
Depth-First Search and Linear Graph Algorithms, SIAM Journal on Computing, vol.1, issue.2, pp.146-160, 1972. ,
DOI : 10.1137/0201010
TAMCRA: a tunable accuracy multiple constraints routing algorithm, Computer Communications, vol.23, issue.7, pp.667-679, 2000. ,
DOI : 10.1016/S0140-3664(99)00225-X
Multi-constrained optimal path selection, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213), pp.834-843, 2001. ,
DOI : 10.1109/INFCOM.2001.916274
BGP Extended Community Attribute for QoS Marking, draft-knoll-idr-qos-attribute-02, work in progress, 2009. ,
Interdomain routing through QoS-class planes, IEEE Commun. Mag, vol.45, issue.2, p.8895, 2007. ,
Towards coordinated interdomain traffic engineering, SIGCOMM Workshop on Hot Topics in Networking (HotNets), 2004. ,
Pré-calcul de chemins inter-domaines soumisàsoumis`soumisà plusieurs contraintes de qualité de service Tech, IRISA, pp.2102-6327, 1935. ,
A Backward-Recursive PCE-Based Computation (BRPC) Procedure to Compute Shortest Constrained Inter-Domain Traffic Engineering Label Switched Paths, 2009. ,
DOI : 10.17487/rfc5441