Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2001, Vol. 24 ›› Issue (2): 65-68.

Previous Articles     Next Articles

A New Algorithm for QoS Routing Extensions to OSPF

FAN Ming, MA Yue, JIANG Yan-jun   

  1. Computer Science and Application School, Beijing University of Posts and Telecommunications, Beijing 100876,China
  • Received:2000-09-20 Online:2001-03-10

PDF

248

Abstract: “On demand computation”, a new algorithm for QoS routing extensions to OSPF is discussed, which constructs a QoS path in an OSPF area dynamically while a resource reservation request is received from a host. Its reasonableness and performance is also discussed.

Key words: Shortest path, OSPF, QoS routing, on demand computation

CLC Number: 

Copyright © 2018 Journal of Beijing University of Posts and Telecommunications 京ICP备14033833号

Adress: BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS    Post Code: 100876    Tel: (010)62281995    QQ: 307514248    weibo    Message    E-mail: byxb@bupt.edu.cn