From the news
- Chancellor Amma Addresses the Parliament of World’s Religions
- Amrita Students Qualify for the European Mars Rover Challenge
Publication Type : Conference Paper
Publisher : NetGCooP 2011
Source : International Conference on NETwork Games, Control and Optimization (NetGCooP 2011) (2011)
Keywords : bidirectional network, Cities and towns, Cost function, decision maker, Equations, Game theory, games, local area network, Local area networks, metropolitan area network, metropolitan area networks, Nash Equilibrium, noncooperative game, road traffic, road traffic network, roads, routing, routing decision, routing games, simple source-destination demand matrix, telecommunication network, telecommunication network routing, Topology
Campus : Bengaluru
School : School of Engineering
Department : Electronics and Communication
Year : 2011
Abstract : Rings are quite common in both road traffic networks as well as in telecommunication networks. In the road traffic context, we often find rings surrounding towns and cities. Traffic over these rings is either bidirectional or we may find two rings that surround the town carrying traffic in opposite directions (clockwise and anti-clockwise). Telecommunication networks based on rings have been often used both as local area networks as well as in metropolitan area networks and here too we find both bidirectional networks as well as networks consisting of two rings carrying traffic in opposite directions. Each decision maker (e.g. the drivers, in the case of road traffic, and perhaps Internet access providers, in the case of telecommunication) is faced with a simple routing decision: whether to go clockwise or anti-clockwise. Assuming a simple source-destination demand matrix, we analyze this problem as a non-cooperative game and derive several interesting characteristics of the equilibria.
Cite this Research Publication : E. Altman, Estanislao, A., and Manoj Kumar Panda, “Routing games on a circle”, in International Conference on NETwork Games, Control and Optimization (NetGCooP 2011), 2011.