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.
Document type :
Book sections
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download
Contributor : Eitan Altman <>
Submitted on : Wednesday, December 18, 2019 - 10:15:21 AM
Last modification on : Tuesday, January 14, 2020 - 10:38:07 AM


Files produced by the author(s)



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⟩



Record views


Files downloads