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

QoS Routing and Forwarding 2006 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 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 Implementation of OSPF in QoS Simulator Bellman-Ford Algorithm (with delay) B/F Algorithm Properties MC (multiple constraints) Bellman Ford algorithm replaces the Dijkstra algorithm of conventional OSPF implementations B/F slightly less efficient than Dijkstra ( O(NxN) instead of O (NlgN) ) However, B/F generates solutions by increasing hop distance; thus, the first found feasible solution is “hop” optimal (ie, min hop) Polynomial performance for most common sets of MC (multiple constraints e.g. bandwidth and delay ) CAC and Packet Forwarding CAC: if feasible path not found, call is rejected; alternatively, source is notified of constraint violation, and can resubmit with relaxed constraint (call renegotiation) Packet forwarding: (a) source routing (per flow) (b) MPLS (per class) Application I: IP Telephony M-CAC at source; no bandwidth reservation along path 36 node, highly connected network Trunk capacity = 15Mbps Non uniform traffic requirement Two