A theoretical framework for hierarchical routing games

  • Authors:
  • Vijay Kamble;Eitan Altman;Rachid El-Azouzi;Vinod Sharma

  • Affiliations:
  • Dept. of Industrial Engineering and Management, IIT - Kharagpur, West Bengal, India;INRIA, Sophia Antipolis, France;LIA, University of Avignon, Avignon, France;Dept. of Electrical Communication Engineering, Indian Institute of Science, Bangalore, India

  • Venue:
  • INFOCOM'10 Proceedings of the 29th conference on Information communications
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Most theoretical research on routing games in telecommunication networks has so far dealt with reciprocal congestion effects between routed entities. Yet in networks that support differentiation between flows, the congestion experienced by a packet depends on its priority level. Another differentiation is made by compressing the packets in the low priority flow while leaving the high priority flow intact. In this paper we study such kind of routing scenarios for the case of non-atomic users and we establish conditions for the existence and uniqueness of equilibrium.