[1] D. G. Andersen, H. Balakrishnan, M. F. Kaashoek, R. Morris, “Resilient Overlay Networks,” Proceedings of the 18th ACM SOSP, Banff, Canada, Oct. 2001.

[2] E. Rosen and Y. Rekhter, “BGP/MPLS IP Virtual Private Networks (VPNs),” IETF RFC 4364, Feb. 2006.

[3] G. R. Ash, Dynamic Routing in Telecommunication Networks (New York: McGraw-Hill, 1997).

[4] J. M. Akinpelu, “The Overload Performance of Engineered Networks with Nonhierarchical and Hierarchical Routing,” AT & T Bell Labs Technical Journal 63(1984): 1261–1281.

[5] R. S. Krupp, “Stabilization of Alternate Routing Networks,” Proceedings of IEEE ICC’82, Philadelphia, PA, June 1982, pp. 31.2.1–31.2.5.

[6] J. H. Weber, “A Simulation Study of Routing and Control in Communication Networks,” Bell Systems Technical Journal 43(1964): 2639–2676.

[7] D. Medhi and K. Ramasamy, Network Routing: Algorithms, Protocols, and Architectures (San Francisco: Morgan Kaufmann, 2007).

[8] D. Medhi, et al., “MuSDyR: Multi-Service Dynamic Routing simulator, v 1.1.,” Computer Networking Research Lab, University of Missouri–Kansas City, at http://conrel.sice.umkc.edu/simulator/Musdyr1.1.pdf.

[9] R. Braden, D. Clark, and S. Shenker, “Integrated Services in the Internet Architecture: An Overview,” IETF RFC 1633, July 1994.

[10] S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, W. Weiss “An Architecture for Differentiated Services,” IETF RFC 2475, Dec. 1998.

[11] R. W. Shirey, “Internet Security Glossary,” RFC 2828, May 2000.

[12] D. Huang, A. Sinha, and D. Medhi, “A Double Authentication Scheme to Detect Impersonation Attack in Link State Routing Protocols,” Proceedings of IEEE International Conference on Communications (ICC), Anchorage, AK, 2003, pp. 1723–1727.

[13] J. Moy, “OSPF Version 2,” RFC 2328, Apr. 1998.

[14] S. Murphy, M. Badger, and B. Wellington, “OSPF with Digital Signatures,” RFC 2154, June 1997.

[15] M. Gupta and N. S. Melam, “Authentication/Confidentiality for OSPFv3,” at http://www.ietf.org/internet-drafts/draft-ietf-ospf-ospfv3-auth-05.txt, Oct. 2004.

[16] H. Krawczyk, M. Bellare, and R. Canetti, “HMAC: Keyed-Hashing for Message Authentication,” RFC 2104, Feb. 1997.

[17] D. Huang, Q. Cao, A. Sinha, M. Schniederjans, C. Beard, L. Harn, and D. Medhi, “New Architecture for Intra-Domain Network Security Issues,” Communications of the ACM 49, No. 11 (2006): 64–72.

[18] D. Huang and D. Medhi, “A Key-Chain Based Keying Scheme for Many-to-Many Secure Group Communication,” ACM Transactions on Information and System Security 7, No. 4 (2004): 523–552.

[19] R. Coltun, “The OSPF Opaque LSA Option,” RFC 2370, July 1998.

[20] A. Shaikh and A. Greenberg, “Experience in Black-Box OSPF Measurement,” Proceedings of ACM SIGCOMM Internet Measurement Workshop (IMW), San Francisco, CA, Nov. 2001.

[21] T. Li, “Virtual Route: An Analysis to Ensure Resource Availability for Critical Services in a Dynamic Routing Environment,” M.S. thesis, University of Missouri–Kansas City, May 2005.

[22] D. Huang, A. Sinha, and D. Medhi, “On Providing Confidentiality in Link State Routing Protocol,” Proceedings of IEEE Consumer Communications and Networking Conference, Las Vegas, NV, 2006, pp. 671–675.

[23] F. Harary, Graph Theory (Boston: Addison-Wesley, 1969).

[24] D. Naor, M. Naor, and J. Lotspiech, “Revocation and Tracing Schemes for Stateless Receivers,” Lecture Notes in Computer Science 2139 (2001): 41–62.

[25] A. T. Sherman and D. A. McGrew, “Key Establishment in Large Dynamic Groups Using One-Way Function Trees,” IEEE Transactions on Software Engineering 29, No. 5, (2003): 444–458.