Fundamental QoS Routing Experiment基本的QoS路由实验.pptVIP

2019 QoS Routing and Forwarding Benefits of QoS Routing Without QoS routing: must probe path backtrack; non optimal path, control traffic and processing OH, latency With QoS routing: optimal route; “focused congestion” avoidance efficient Call Admission Control (at the source) efficient bandwidth allocation (per traffic class) resource renegotiation easier Multiple Constraints QoS Routing Given: - a (real time) connection request with specified QoS requirements (e.g., Bdw, Delay, Jitter, packet loss, path reliability, etc) Find: - a min cost (typically min hop) path which satisfies such constraints - if no feasible path found, reject the connection Example of QoS Routing 2 Hop Path -- Fails (Total delay=55 25 and Min BW=20 30)3 Hop Path -- Succeeds (Total delay=24 25, Min BW=90 30)5 Hop Path -- Do not consider, although (Total Delay = 16 25, Min BW = 90 30) A B D = 30, BW = 20 D = 25, BW = 55 D = 5, BW = 90 D = 3, BW = 105 D = 5, BW = 90 D = 1, BW = 90 D = 5, BW = 90 D = 2, BW = 90 D = 5, BW = 90 D = 14, BW = 90 Constraints: Delay (D) = 25, Available BW = 30 We look for feasible path with least number of hops The Components of QoS Routing Q-OSPF: link state based protocol; it disseminates link state updates (including QoS parameters) to all nodes; it creates/maintains global topology map at each node OSPF (Open Shortest Path First): for intra-AS routing is a link-state protocol that uses flooding of link state information and a Dijkstra least cost path algorithm To replace the Dijkstra algorithm using Bellman-Ford constrained path computation algorithm: it computes constrained min hop paths to all destinations at each node based on topology map Call Acceptance Control (CAC) Packet Forwarding: source route or MPLS OSPF Overview 5 Message Types 1) “Hello” - lets a node know who the neighbors are 2) Link State Update - describes sender’s co