ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Routing on a ring network

Burra, R and Singh, C and Kuri, J and Altman, E (2019) Routing on a ring network. [Book Chapter]

EAI_spr_inn_25-36_2019.pdf - Published Version

Download (211kB) | Preview
Official URL: https://doi.org/10.1007/978-3-319-93058-9_3


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 loads. We also analyze optimal routing in each of these cases.

Item Type: Book Chapter
Publication: EAI/Springer Innovations in Communication and Computing
Publisher: Springer Science and Business Media Deutschland GmbH
Additional Information: The copyright for this article belongs to the Authors.
Keywords: Cost functions, Bernoulli; Direct paths; Multi-hop path; Nash equilibria; Optimal routing; Potential games; Random Numbers; Routing costs, Network routing
Department/Centre: Division of Electrical Sciences > Electronic Systems Engineering (Formerly Centre for Electronic Design & Technology)
Date Deposited: 27 Oct 2022 08:34
Last Modified: 27 Oct 2022 08:34
URI: https://eprints.iisc.ac.in/id/eprint/77599

Actions (login required)

View Item View Item