OSPF-based adaptive and flexible security-enhanced QoS provisioning

2006 IEEE Sarnoff Symposium

Volumn , Issue , 2006, Pages

  Qin, Zhen ^a   Rojas Cessa, Roberto ^a   Ansari, Nirwan ^a  

^a NEW JERSEY INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

k shortest paths; Network security; OSPF; Quality of service; Service vector

Indexed keywords

INTERNET PROTOCOLS; NETWORK ARCHITECTURE; NETWORK PROTOCOLS; NETWORK ROUTING; ROUTING ALGORITHMS; ROUTING PROTOCOLS; VECTORS;

K SHORTEST PATHS; NETWORK SECURITY; OSPF; QUALITY OF SERVICE; SERVICE VECTOR;

COMPUTER NETWORKS;

EID: 50649101715     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SARNOF.2006.4534791     Document Type: Conference Paper

References (8)

1. J. Yang, J. Ye, and S. Papavassiliou, "A Flexible and Distributed Architecture for Adaptive End-to-End QoS Provisioning in Next Generation Networks," IEEE JSAC, Vol. 23, No. 2, pp. 321-333, Feb. 2005.
2. J. Moy, "OSPF version 2," in IETF, RFC2328, Apr. 1998.
3. G. Apostolopoulos, et al, "QoS Routing Mechanisms and OSPF Extensions," IETF, RFC 2676, Aug. 1999.
4. B. Fortz and M. Thorup, "Optimizing OSPF/IS-IS Weights in a Changing World," IEEE JSAC, Vol. 20, No. 4, pp. 756-767, May 2002.
5. G. Apostolopoulos, et al, "Quality-of-service based routing: A Performance Perspective," ACM SIGCOMM Computer Communication Review, Vol. 28, No. 4, pp. 17-28, Oct. 1998.
6. Z. Wang and J. Crowcroft, "Quality of Service Routing for Supporting Multimedia Applications," IEEE JSAC, Vol. 14, No. 7, pp. 1228-1234, Sep. 1996.
7. V. Jimenez and A. Marzal, "Computing the k Shortest Paths: A New Algorithm and an Experimental Comparison," Lecture Notes in Computer Science: 1668, pp. 15-29, 1999.
8. S. Chen and K. Nahrsted, "On Finding Multi-Constrained Paths," IEEE ICC, Vol. 2, pp. 874-899, June 1996.