DocumentCode
3230106
Title
QoS routing mechanisms and OSPF extensions
Author
Guérin, Roch A. ; Orda, Ariel ; Williams, Douglas
Author_Institution
IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
Volume
3
fYear
1997
fDate
3-8 Nov 1997
Firstpage
1903
Abstract
This paper presents and discusses path selection algorithms to support QoS routes in IP networks. The work is carried out in the context of extensions to the OSPF protocol, and the initial focus is on unicast flows, although some of the proposed extensions are also applicable to multicast flows. We first review the metrics required to support QoS, and then present and compare several path selection algorithms, which represent different trade-offs between accuracy and computational complexity. We also describe and discuss the associated link advertisement mechanisms, and investigate some options in balancing the requirements for accurate and timely information with the associated control overhead. The overall goal of this study is to identify a framework and possible approaches to allow deployment of QoS routing capabilities with the minimum possible impact to the existing routing infrastructure
Keywords
Internet; computational complexity; telecommunication network routing; transport protocols; IP networks; Internet protocol networks; OSPF extensions; QoS routing mechanisms; computational complexity; control overhead; link advertisement mechanisms; multicast flows; path selection algorithms; routing capabilities; routing infrastructure; unicast flow; Availability; Bandwidth; Computational complexity; Concrete; Delay; IP networks; Internet; Multicast algorithms; Multicast protocols; Quality of service; Routing; Routing protocols; Unicast;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference, 1997. GLOBECOM '97., IEEE
Conference_Location
Phoenix, AZ
Print_ISBN
0-7803-4198-8
Type
conf
DOI
10.1109/GLOCOM.1997.644603
Filename
644603
Link To Document