the stable paths problem and interdomain routing
play

The Stable Paths Problem and Interdomain Routing Rachit Agarwal - PowerPoint PPT Presentation

Problem Formulation A Sufficient Condition for Stability Food for thought! The Stable Paths Problem and Interdomain Routing Rachit Agarwal Results are by others, any errors are by me! Rachit Agarwal The Stable Paths Problem Problem


  1. Problem Formulation A Sufficient Condition for Stability Food for thought! The Stable Paths Problem and Interdomain Routing Rachit Agarwal Results are by others, any errors are by me! Rachit Agarwal The Stable Paths Problem

  2. Problem Formulation A Sufficient Condition for Stability Food for thought! Outline Problem Formulation 1 A Sufficient Condition for Stability 2 Food for thought! 3 Rachit Agarwal The Stable Paths Problem

  3. Problem Formulation Routing in the Internet A Sufficient Condition for Stability Problem Statement Food for thought! Internet Rachit Agarwal The Stable Paths Problem

  4. Problem Formulation Routing in the Internet A Sufficient Condition for Stability Problem Statement Food for thought! Internet Terminology Autonomous Systems AS ISPs, Companies Set of Routers and links Rachit Agarwal The Stable Paths Problem

  5. Problem Formulation Routing in the Internet A Sufficient Condition for Stability Problem Statement Food for thought! Internet Terminology Autonomous Systems Intra-domain Rachit Agarwal The Stable Paths Problem

  6. Problem Formulation Routing in the Internet A Sufficient Condition for Stability Problem Statement Food for thought! Internet Terminology Autonomous Systems Intra-domain Inter-domain Rachit Agarwal The Stable Paths Problem

  7. Problem Formulation Routing in the Internet A Sufficient Condition for Stability Problem Statement Food for thought! Internet Architecture Non-cooperative Rachit Agarwal The Stable Paths Problem

  8. Problem Formulation Routing in the Internet A Sufficient Condition for Stability Problem Statement Food for thought! Internet Architecture Non-cooperative Privacy : Do not share Internal Topology Rachit Agarwal The Stable Paths Problem

  9. Problem Formulation Routing in the Internet A Sufficient Condition for Stability Problem Statement Food for thought! Internet Architecture Non-cooperative Privacy : Do not share Internal Topology Policies : Which path to choose? Which path to advertise? Rachit Agarwal The Stable Paths Problem

  10. Problem Formulation Routing in the Internet A Sufficient Condition for Stability Problem Statement Food for thought! Internet Architecture Non-cooperative Privacy : Do not share Internal Topology Policies : Which path to choose? Which path to advertise? Autonomy : Decide policies independently! Rachit Agarwal The Stable Paths Problem

  11. Problem Formulation Routing in the Internet A Sufficient Condition for Stability Problem Statement Food for thought! Internet Architecture Non-cooperative Privacy : Do not share Internal Topology Policies : Which path to choose? Which path to advertise? Autonomy : Decide policies independently! Interactive Interact to coordinate Routing Rachit Agarwal The Stable Paths Problem

  12. Problem Formulation Routing in the Internet A Sufficient Condition for Stability Problem Statement Food for thought! Example: Good Gadgets { 13 d , 1 d } 1 2 { 21 d , 2 d } d { 3 d , 342 d } 3 4 { 42 d , 43 d } Rachit Agarwal The Stable Paths Problem

  13. Problem Formulation Routing in the Internet A Sufficient Condition for Stability Problem Statement Food for thought! Example: Good Gadgets { 13 d , 1 d } 1 2 { 21 d , 2 d } d { 3 d , 342 d } 3 4 { 42 d , 43 d } Rachit Agarwal The Stable Paths Problem

  14. Problem Formulation Routing in the Internet A Sufficient Condition for Stability Problem Statement Food for thought! Example: Good Gadgets { 13 d , 1 d } 1 2 { 21 d , 2 d } d { 3 d , 342 d } 3 4 { 42 d , 43 d } A path P = ( v 1 v 2 ) P ′ is said to be available for node v 1 if P ′ has been assigned to v 2 . Rachit Agarwal The Stable Paths Problem

  15. Problem Formulation Routing in the Internet A Sufficient Condition for Stability Problem Statement Food for thought! Example: Good Gadgets { 13 d , 1 d } 1 2 { 21 d , 2 d } d { 3 d , 342 d } 3 4 { 42 d , 43 d } Rachit Agarwal The Stable Paths Problem

  16. Problem Formulation Routing in the Internet A Sufficient Condition for Stability Problem Statement Food for thought! Example: Good Gadgets { 13 d , 1 d } 1 2 { 21 d , 2 d } d { 3 d , 342 d } 3 4 { 42 d , 43 d } Rachit Agarwal The Stable Paths Problem

  17. Problem Formulation Routing in the Internet A Sufficient Condition for Stability Problem Statement Food for thought! Example: Good Gadgets { 13 d , 1 d } 1 2 { 21 d , 2 d } d { 3 d , 342 d } 3 4 { 42 d , 43 d } Rachit Agarwal The Stable Paths Problem

  18. Problem Formulation Routing in the Internet A Sufficient Condition for Stability Problem Statement Food for thought! Example: Good Gadgets Notice { 13 d , 1 d } 1 2 { 21 d , 2 d } Each node behaves selfishly ! d { 3 d , 342 d } 3 4 { 42 d , 43 d } Rachit Agarwal The Stable Paths Problem

  19. Problem Formulation Routing in the Internet A Sufficient Condition for Stability Problem Statement Food for thought! Example: Good Gadgets Notice { 13 d , 1 d } 1 2 { 21 d , 2 d } Each node behaves selfishly ! Each node finds a stable path ! d { 3 d , 342 d } 3 4 { 42 d , 43 d } Stable Path No node can get a better path by deviating from the current assignment unilaterally! Rachit Agarwal The Stable Paths Problem

  20. Problem Formulation Routing in the Internet A Sufficient Condition for Stability Problem Statement Food for thought! Example: Good Gadgets Notice { 13 d , 1 d } 1 2 { 21 d , 2 d } Each node behaves selfishly ! Each node finds a stable path ! Network is stable! d { 3 d , 342 d } 3 4 { 42 d , 43 d } Stable Path No node can get a better path by deviating from the current assignment unilaterally! Nash Eqilibrium! Rachit Agarwal The Stable Paths Problem

  21. Problem Formulation Routing in the Internet A Sufficient Condition for Stability Problem Statement Food for thought! Example: Good Gadgets Notice { 13 d , 1 d } 1 2 { 21 d , 2 d } Each node behaves selfishly ! Each node finds a stable path ! Network is stable! d Stable Path Assignment! { 13 d , 2 d , 3 d , 42 d } { 3 d , 342 d } 3 4 { 42 d , 43 d } Stable Path No node can get a better path by deviating from the current assignment unilaterally! Nash Eqilibrium! Rachit Agarwal The Stable Paths Problem

  22. Problem Formulation Routing in the Internet A Sufficient Condition for Stability Problem Statement Food for thought! Bad Gadgets { 13 d , 1 d } 1 2 { 21 d , 2 d } d { 342 d , 3 d } 3 4 { 42 d , 43 d } Rachit Agarwal The Stable Paths Problem

  23. Problem Formulation Routing in the Internet A Sufficient Condition for Stability Problem Statement Food for thought! Bad Gadgets 1 d 2 d 342 d 42 d { 13 d , 1 d } 1 2 { 21 d , 2 d } d { 342 d , 3 d } 3 4 { 42 d , 43 d } Rachit Agarwal The Stable Paths Problem

  24. Problem Formulation Routing in the Internet A Sufficient Condition for Stability Problem Statement Food for thought! Bad Gadgets 1 d 2 d 342 d 42 d 1 d 2 d 342 d 42 d { 13 d , 1 d } 1 2 { 21 d , 2 d } d { 342 d , 3 d } 3 4 { 42 d , 43 d } Rachit Agarwal The Stable Paths Problem

  25. Problem Formulation Routing in the Internet A Sufficient Condition for Stability Problem Statement Food for thought! Bad Gadgets 1 d 2 d 342 d 42 d 1 d 2 d 342 d 42 d { 13 d , 1 d } 1 2 { 21 d , 2 d } 1 d 21 d 342 d 42 d d { 342 d , 3 d } 3 4 { 42 d , 43 d } Rachit Agarwal The Stable Paths Problem

  26. Problem Formulation Routing in the Internet A Sufficient Condition for Stability Problem Statement Food for thought! Bad Gadgets 1 d 2 d 342 d 42 d { 13 d , 1 d } 1 2 { 21 d , 2 d } 1 d 21 d 342 d 42 d 1 d 21 d 342 d ǫ d { 342 d , 3 d } 3 4 { 42 d , 43 d } Rachit Agarwal The Stable Paths Problem

  27. Problem Formulation Routing in the Internet A Sufficient Condition for Stability Problem Statement Food for thought! Bad Gadgets 1 d 2 d 342 d 42 d { 13 d , 1 d } 1 2 { 21 d , 2 d } 1 d 21 d 342 d ǫ 1 d 21 d 3 d ǫ d { 342 d , 3 d } 3 4 { 42 d , 43 d } Rachit Agarwal The Stable Paths Problem

  28. Problem Formulation Routing in the Internet A Sufficient Condition for Stability Problem Statement Food for thought! Bad Gadgets 1 d 2 d 342 d 42 d { 13 d , 1 d } 1 2 { 21 d , 2 d } 1 d 21 d 3 d ǫ 13 d 21 d 3 d 43 d d { 342 d , 3 d } 3 4 { 42 d , 43 d } Rachit Agarwal The Stable Paths Problem

  29. Problem Formulation Routing in the Internet A Sufficient Condition for Stability Problem Statement Food for thought! Bad Gadgets 1 d 2 d 342 d 42 d { 13 d , 1 d } 1 2 { 21 d , 2 d } 13 d 21 d 3 d 43 d d 13 d 2 d 3 d 43 d { 342 d , 3 d } 3 4 { 42 d , 43 d } Rachit Agarwal The Stable Paths Problem

  30. Problem Formulation Routing in the Internet A Sufficient Condition for Stability Problem Statement Food for thought! Bad Gadgets 1 d 2 d 342 d 42 d { 13 d , 1 d } 1 2 { 21 d , 2 d } d 13 d 2 d 3 d 43 d 13 d 2 d 3 d 42 d { 342 d , 3 d } 3 4 { 42 d , 43 d } Rachit Agarwal The Stable Paths Problem

  31. Problem Formulation Routing in the Internet A Sufficient Condition for Stability Problem Statement Food for thought! Bad Gadgets 1 d 2 d 342 d 42 d { 13 d , 1 d } 1 2 { 21 d , 2 d } d 13 d 2 d 3 d 42 d 13 d 2 d 342 d 42 d { 342 d , 3 d } 3 4 { 42 d , 43 d } Rachit Agarwal The Stable Paths Problem

  32. Problem Formulation Routing in the Internet A Sufficient Condition for Stability Problem Statement Food for thought! Bad Gadgets 1 d 2 d 342 d 42 d { 13 d , 1 d } 1 2 { 21 d , 2 d } d 13 d 2 d 342 d 42 d { 342 d , 3 d } 3 4 { 42 d , 43 d } 1 d 2 d 342 d 42 d Rachit Agarwal The Stable Paths Problem

Recommend


More recommend