A decentralized team routing strategy among telecom operators in an energy-aware network

We consider a networking infrastructure, upon which various "large" users (e.g., Telecom Operators, data centers, etc.) have multiple paths to deliver an aggregated entry flow to a certain destination. The flow of each user can be split among the different paths that traverse energy-aware routers. The routers adopt a specific strategy to minimize the power-delay product for each link, which gives rise to quadratic link (in the aggregated link flows) cost functions. We seek person-by-person satisfactory (p.b.p.s.) strategies stemming from a team optimal control problem of the users. The team optimization problem is defined among Decision Makers (DMs-one for each user) that try to minimize a common aggregate cost function of their routes, each one acting solely on the basis of the knowledge of the amount of flow to be routed. We derive piecewise linear p.b.p.s. solutions, which are characterized by a set of parameters. The latter can be found by solving a set of nonlinear fixed point equations.