Infocompres - A Theoretical Framework for Hierarchical...

Info iconThis preview shows pages 1–11. Sign up to view the full content.

View Full Document Right Arrow Icon
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
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Outline 1 Overview 2 System Wardrop Equilibrium 3 Existence, Uniqueness 4 Application and Conclusion Vijay Kamble (IIT Kharagpur, INDIA) Hierarchical Routing Games MURI meeting, Sept 9 2010 2 / 21
Background image of page 2
Overview Outline 1 Overview 2 System Wardrop Equilibrium 3 Existence, Uniqueness 4 Application and Conclusion Vijay Kamble (IIT Kharagpur, INDIA) Hierarchical Routing Games MURI meeting, Sept 9 2010 3 / 21
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Overview Non-Atomic Routing Games Consider Vijay Kamble (IIT Kharagpur, INDIA) Hierarchical Routing Games MURI meeting, Sept 9 2010 4 / 21
Background image of page 4
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
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Overview Non-Atomic Routing Games Consider A Network of directed arcs without cycles A population of packets belonging to a Fnite number of classes Vijay Kamble (IIT Kharagpur, INDIA) Hierarchical Routing Games MURI meeting, Sept 9 2010 4 / 21
Background image of page 6
Overview Non-Atomic Routing Games Consider A Network of directed arcs without cycles A population of packets belonging to a Fnite 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 ±ow. Vijay Kamble (IIT Kharagpur, INDIA) Hierarchical Routing Games MURI meeting, Sept 9 2010 4 / 21
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Overview Non-Atomic Routing Games Consider A Network of directed arcs without cycles A population of packets belonging to a Fnite 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 ±ow. A delay function per packet on each arc of the Network due to congestion which depends on the ±ow through that arc. Vijay Kamble (IIT Kharagpur, INDIA) Hierarchical Routing Games MURI meeting, Sept 9 2010 4 / 21
Background image of page 8
Overview Non-Atomic Routing Games Consider A Network of directed arcs without cycles A population of packets belonging to a Fnite 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 ±ow. A delay function per packet on each arc of the Network due to congestion which depends on the ±ow through that arc. Problem How do we route the ±ow on the network so that the least delay path is chosen for each packet? Vijay Kamble (IIT Kharagpur, INDIA) Hierarchical Routing Games MURI meeting, Sept 9 2010 4 / 21
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Overview Non-Atomic Routing Games Consider A Network of directed arcs without cycles A population of packets belonging to a Fnite 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 ±ow.
Background image of page 10
Image of page 11
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 1

Infocompres - A Theoretical Framework for Hierarchical...

This preview shows document pages 1 - 11. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online