Infocompres

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: A Theoretical Framework for Hierarchical Routing Games Vijay Kamble (IIT Kharagpur) Eitan Altman (INRIA Sophia-Antipolis) Rachid El Azouzi (LIA, University of Avignon) Vinod Sharma (IISc Bangalore) UC Berkeley, Sept 9 2010 Vijay Kamble (IIT Kharagpur, INDIA) Hierarchical Routing Games MURI meeting, Sept 9 2010 1 / 21 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 2 / 21 Overview 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 3 / 21 Overview Non-Atomic Routing Games Consider Vijay Kamble (IIT Kharagpur, INDIA) Hierarchical Routing Games MURI meeting, Sept 9 2010 4 / 21 Overview Non-Atomic Routing Games Consider A Network of directed arcs without cycles Vijay Kamble (IIT Kharagpur, INDIA) Hierarchical Routing Games MURI meeting, Sept 9 2010 4 / 21 Overview Non-Atomic Routing Games Consider A Network of directed arcs without cycles A population of packets belonging to a finite number of classes Vijay Kamble (IIT Kharagpur, INDIA) Hierarchical Routing Games MURI meeting, Sept 9 2010 4 / 21 Overview Non-Atomic Routing Games Consider A Network of directed arcs without cycles A population of packets belonging to a finite number of classes A source node and a destination node for each class with the packets arriving at the source nodes in the form of a flow. Vijay Kamble (IIT Kharagpur, INDIA) Hierarchical Routing Games MURI meeting, Sept 9 2010 4 / 21 Overview Non-Atomic Routing Games Consider A Network of directed arcs without cycles A population of packets belonging to a finite number of classes A source node and a destination node for each class with the packets arriving at the source nodes in the form of a flow. A delay function per packet on each...
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