We studying its characteristics vijay kamble iit

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: le (IIT Kharagpur, INDIA) Hierarchical Routing Games MURI meeting, Sept 9 2010 8 / 21 Overview Our Contributions A framework for modeling such Hierarchical Non-atomic Routing games with two priority levels Extending the concept of Wardrop equilibrium to such games: System Wardrop Equilibrium (S.W.E.) Studying its Characteristics Existence, Uniqueness, Computation Vijay Kamble (IIT Kharagpur, INDIA) Hierarchical Routing Games MURI meeting, Sept 9 2010 8 / 21 System Wardrop Equilibrium Outline 1 Overview System Wardrop Equilibrium Existence, Uniqueness Application and Conclusion 2 3 4 Vijay Kamble (IIT Kharagpur, INDIA) Hierarchical Routing Games MURI meeting, Sept 9 2010 9 / 21 System Wardrop Equilibrium The model Consider A Network Topology given by G = (E , {s, d }). |E | = K Vijay Kamble (IIT Kharagpur, INDIA) Hierarchical Routing Games MURI meeting, Sept 9 2010 10 / 21 System Wardrop Equilibrium The model Consider A Network Topology given by G = (E , {s, d }). |E | = K Total flow demand r (packets per sec). Two levels: High Priority, Low priority Low priority flow γ rp, High priority flow r (1 − p). p ∈ [0, 1], γ is the compression factor. Total flow routed: ¯(p) = r (γ p + (1 − p)) r ¯¯¯ Flows: xlH , xlL , xl = xlH + xlL , Profiles: x H , x L , x Vijay Kamble (IIT Kharagpur, INDIA) Hierarchical Routing Games MURI meeting, Sept 9 2010 10 / 21 System Wardrop Equilibrium The model Consider A Network Topology given by G = (E , {s, d }). |E | = K Total flow demand r (packets per sec). Two levels: High Priority, Low priority Low priority flow γ rp, High priority flow r (1 − p). p ∈ [0, 1], γ is the compression factor. Total flow routed: ¯(p) = r (γ p + (1 − p)) r Link delay per packet functions Tl . For High priority flow: Tl (xlH ), For Low priority flow: Tl (xl ) (High priority flow unaffected by Low priority flow) Cost per packet for routing as High priority: C H , Low Priority: C L Vijay Kamble (IIT Kharagpur, INDIA) Hierarchical Routing Games MURI meeting, Sept 9 2010 10 / 21 ¯¯¯ Flows: xlH , xlL , xl = xlH + xlL , Profiles: x H , x L , x System Wardrop Equilibrium Multilevel Wardrop equilibria For a fixed p, we find wardrop equilibrium for each level separately Vijay Kamble (IIT Kharagpur, INDIA) Hier...
View Full Document

This note was uploaded on 09/27/2010 for the course EE 229 taught by Professor R.srikant during the Spring '09 term at University of Illinois, Urbana Champaign.

Ask a homework question - tutors are online