Analysing Latency and Link Utilization of Selfish Overlay Routing
暂无分享,去创建一个
[1] Tim Roughgarden,et al. How bad is selfish routing? , 2002, JACM.
[2] Donald F. Towsley,et al. On the interaction between overlay routing and underlay routing , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..
[3] Mikkel Thorup,et al. Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).
[4] Carl M. Harris,et al. Internet-Type Queues with Power-Tailed Interarrival Times and Computational Methods for Their Analysis , 2000, INFORMS J. Comput..
[5] Carl M. Harris,et al. Fundamentals of queueing theory , 1975 .
[6] Ariel Orda,et al. Achieving network optima using Stackelberg routing strategies , 1997, TNET.
[7] Tim Roughgarden,et al. Selfish Routing , 2002 .
[8] Anthony Chen,et al. Computational study of state-of-the-art path-based traffic assignment algorithms , 2002, Math. Comput. Simul..
[9] Mikkel Thorup,et al. Traffic engineering with traditional IP routing protocols , 2002, IEEE Commun. Mag..