Network traffic engineering with varied levels of protection in next generation internet, " GERAD 25th Anniversary Issue for Performance Evaluation and Planning Methods for the Next Generation Internet, 2005. ,
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities, SIAM Journal on Discrete Mathematics, vol.13, issue.4, pp.505-520, 2000. ,
DOI : 10.1137/S0895480199355754
Simulated allocation: a suboptimal solution to the multicommodity flow problem, Teletraffic Symposium on Performance Engineering in Telecommunications Networks, 1994. ,
Backup path restoration design using path generation technique, Fourth International Workshop on Design of Reliable Communication Networks, 2003. (DRCN 2003). Proceedings., 2003. ,
DOI : 10.1109/DRCN.2003.1275341
On finding disjoint paths in single and dual link cost networks, INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies, p.715, 2004. ,
Finding disjoint paths with different path-costs: Complexity and algorithms, Networks, vol.1, issue.7, pp.653-667, 1992. ,
DOI : 10.1002/net.3230220705
Spare capacity allocation method, analysis and algorithms, Ph.D. dissertation, School of Information Sciences, 2001. ,
Solving asymmetrically weighted optimal or nearoptimal disjoint path-pair for the survivable optical networks, Third International Workshop On Design of Reliable Communication Networks, 2001. ,
Dynamic routing of restorable bandwidth-guaranteed tunnels using aggregated network resource usage information, IEEE/ACM Transactions on Networking, vol.11, issue.3, pp.399-410, 2003. ,
DOI : 10.1109/TNET.2003.813044
A quick method for finding shortest pairs of disjoint paths, Networks, vol.3, issue.2, pp.325-336, 1986. ,
DOI : 10.1002/net.3230140209
Routing bandwidth guaranteed paths with local restoration in label switched networks Faster and simpler algorithms for multicommodity flow and other fractional packing problems, ICNP '02: Proceedings of the 10th IEEE International Conference on Network Protocols FOCS '98: Proceedings of the 39th Annual Symposium on Foundations of Computer Science, pp.110-121, 1998. ,
Fibonacci heaps and their uses in improved network optimization algorithms, Journal of the ACM, vol.34, issue.3, pp.596-615, 1987. ,
DOI : 10.1145/28869.28874
A scalable algorithm for the minimum expected cost restorable flow problem, 2004. ,
Survivable routing and flow allocation in next generation internet networks, 2006. ,