Routing on a Ring Network - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Book Sections Year : 2019

Routing on a Ring Network

Abstract

We study routing on a ring network in which traffic originates from nodes on the ring and is destined to the center. The users can take direct paths from originating nodes to the center and also multihop paths via other nodes. We show that routing games with only one and two hop paths and linear costs are potential games. We give explicit expressions of Nash equilibrium flows for networks with any generic cost function and symmetric loads. We also consider a ring network with random number of users at nodes, all of them having same demand, and linear routing costs. We give explicit characterization of Nash equilibria for two cases: (i) General i.i.d. loads and one and two hop paths, (ii) Bernoulli distributed loads. We also analyze optimal routing in each of these cases.
Fichier principal
Vignette du fichier
routing-ring-networks-shortened (1).pdf (347.47 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-02417278 , version 1 (18-12-2019)

Identifiers

Cite

Ramya Burra, Chandramani Singh, Joy Kuri, Eitan Altman. Routing on a Ring Network. Song, Ju Bin; Li, Husheng; Coupechoux, Marceau. Game Theory for Networking Applications, Springer International Publishing, pp.25-36, 2019, 978-3-319-93057-2. ⟨10.1007/978-3-319-93058-9_3⟩. ⟨hal-02417278⟩
100 View
215 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More