Get 20M+ Full-Text Papers For Less Than $1.50/day. Subscribe now for You or Your Team.

Learn More →

MSDP with ACO: A maximal SRLG disjoint routing algorithm based on ant colony optimization

MSDP with ACO: A maximal SRLG disjoint routing algorithm based on ant colony optimization http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Network and Computer Applications CrossRef

MSDP with ACO: A maximal SRLG disjoint routing algorithm based on ant colony optimization

Journal of Network and Computer Applications , Volume 35 (1): 394-402 – Jan 1, 2012
Loading next page...
 
/lp/crossref/msdp-with-aco-a-maximal-srlg-disjoint-routing-algorithm-based-on-ant-t3A0YaDeAQ

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
CrossRef
ISSN
1084-8045
DOI
10.1016/j.jnca.2011.08.009
Publisher site
See Article on Publisher Site

Abstract

Journal

Journal of Network and Computer ApplicationsCrossRef

Published: Jan 1, 2012

References