計算機科學與工程學系江文傑同學，於2005年IFIP WG 7.3電腦性能、建模、度量及評價國際研討會」，榮獲最佳論文獎。
In the past few years, overlay networks have received much attention but there has been little study on the "interaction" of multiple, co-existing overlays on top of a physical network. In this work, we formulate the behaviors of the co-existing overlays under a game-theoretic framework, in which they seek to optimize their individual performance. We establish the existence of a Nash equilibrium, as well as the implications behind these interactions. We show that i) the interactions of multiple overlay routing may not be Pareto optimal, ii) some fairness anomalies of resource allocation may occur. This is worthy of attention since overlays may not know the existence of each other, and they will continue to operate at this sub-optimal point. We show that by incorporating a proper pricing mechanism, the overlay routing game can be led to the desired equilibrium and alleviate these anomalies mentioned above.