2. Q.S BASED ON OSPF ROUTING BY : SHEMER SCHWARZ ZIV KEDEM

3. WHAT IS Q.S ROUTING? n Q.S ROUTING IS THE PROCESS OF SELECTING THE PATH TO BE USED BY PACKETS OF A FLOW BASED ON ITS Q.S REQUIREMENT, e.g., BANDWIDTH OR DELAY.

4. WHY Q.S? n OPTIMIZE NETWORK RESOURCE USAGE. n INTERGRATE NETWORKS FOR VOISE, DATE AND MULTIMEDIA.

5. WHY NOT? n INCREASED ROUTING PROTOCOL OVERHEAD. n MORE COMPLEX AND FREQUENT COMPUTATION.

6. PARAMETERS INFLUENCING THE COMPARISON n PATH SELECTION ALGORITHM. n ACCURACY OF INFORMATION. n CHARACTERISTIC OF NETWORK TRAFFIC. n NETWORK TOPOLOGY. n ADDMISSION CONTROL.

7. COMPUTATIONAL COST PARAMETERS n PATH SELECTION CRITIRIA. n TRIGGER FOR PATH SELECTION (periodically,on demand and on update). n FLEXIBILITY IN SUPPORTING ALTERNATE PATH SELECTION CHOISES.

8. PROTOCAOL OVERHEAD PARAMETERS n TRIGGERS FOR NETWORK STATE UPDATE m RELATIVE CHANGE. m ABSOLUTE CHANGE OR CLASS BASED TRIGGER. m TIMER BASED TRIGGER.

9. PROTOCAOL OVERHEAD PARAMETERS(2) n UPDATE CONTENTS

10. 2.EVALUATION ENVIRONMENT PATH SELECTION(1) n BASED ON BELLMAN-FORD. n S(d)= n S(d)= s(d,h)-set of paths from ‘s’ to ‘d’ of lop length ‘h’.

11. PATH SELECTION(2) n Feasible path. n Minimal hops. n Minimal cost.

12. UPDATE POLICIES n THRESHOLD BASED UPDATE. bw_c - the current value of available bandwidth. bw_o - the last advertised value. ||bw_o - bw_c||/bw_o > th.

13. UPDATE POLICIES n EQUAL BASED UPDATES. (0,B), (B,2B), (2B,3B), … n EXPONENTIAL CLASS BASED UPDATES. (0,B), (B,(f+1)B), ((f+1)B, (f^2+f+1)B), … (f^2+f+1)B), …

14. HIGHER LEVEL ADDMISSION(1) n A LOCAL PER NODE CHECK DETEMINES IF THE REQUEST IS ALLOWED TO CONTINUE. (b_avail(i) - b_req) / b_capacity(i) 5% - one hop longer. 10% - 2 hops longer. 20% - 3 and more hops longer.

15. HIGHER LEVEL ADDMISSION(2)

16. 3. PROTOCOL OVERHEAD FACTORS AFFECTING PROTOCOL OVERHEAD : n Trigger policy. n The sensitivity level of the triggering level. n The use of non-zero hold down timer.

17. E-Equal Class. T-Threshold based update.