PERFORMANCE OF NON-COOPERATIVE ROUTING OVER PARALLEL NON-OBSERVABLE QUEUES
暂无分享,去创建一个
[1] Ariel Orda,et al. Achieving network optima using Stackelberg routing strategies , 1997, TNET.
[2] Ariel Orda,et al. The designer's perspective to atomic noncooperative networks , 1999, TNET.
[3] Bruno Gaujal,et al. The price of anarchy in parallel queues revisited , 2010, SIGMETRICS '10.
[4] Berthold Vöcking,et al. Selfish traffic allocation for server farms , 2002, STOC '02.
[5] Thomas A. Corbi,et al. The dawning of the autonomic computing era , 2003, IBM Syst. J..
[6] Athanasios D. Panagopoulos,et al. A survey on game theory applications in wireless networks , 2010, Comput. Networks.
[7] Tim Roughgarden,et al. The price of anarchy in an exponential multi-server , 2007, Oper. Res. Lett..
[8] Refael Hassin,et al. To Queue or Not to Queue: Equilibrium Behavior in Queueing Systems , 2002 .
[9] Ephraim Zehavi,et al. Cooperative Game Theory and the Gaussian Interference Channel , 2007, IEEE Journal on Selected Areas in Communications.
[10] Erol Gelenbe,et al. Experiments with Smart Workload Allocation to Cloud Servers , 2015, 2015 IEEE Fourth Symposium on Network Cloud Computing and Applications (NCCA).
[11] Dusit Niyato,et al. Competitive Pricing for Spectrum Sharing in Cognitive Radio Networks: Dynamic Game, Inefficiency of Nash Equilibrium, and Collusion , 2008, IEEE Journal on Selected Areas in Communications.
[12] S. Stidham,et al. Individual versus Social Optimization in the Allocation of Customers to Alternative Servers , 1983 .
[13] Scott Shenker,et al. Making greed work in networks: a game-theoretic analysis of switch service disciplines , 1994 .
[14] Srinivasan Seshan,et al. Selfish behavior and stability of the internet:: a game-theoretic analysis of TCP , 2002, SIGCOMM '02.
[15] Stephen B. Wicker,et al. Game theory in communications: motivation, explanation, and application to power control , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).
[16] Catherine Rosenberg,et al. A game theoretic framework for bandwidth allocation and pricing in broadband networks , 2000, TNET.
[17] E. Gelenbe,et al. Data Driven Self-Managing Routing in Intercontinental Overlay Networks , 2016 .
[18] Pierre Coucheney,et al. Penalty-Regulated Dynamics and Robust Learning Procedures in Games , 2013, Math. Oper. Res..
[19] L. Shapley,et al. Potential Games , 1994 .
[20] Eitan Altman,et al. A survey on networking games in telecommunications , 2006, Comput. Oper. Res..
[21] Linus Schrage,et al. Letter to the Editor - A Proof of the Optimality of the Shortest Remaining Processing Time Discipline , 1968, Oper. Res..
[22] Eitan Altman,et al. Routing into Two Parallel Links: Game-Theoretic Distributed Algorithms , 2001, J. Parallel Distributed Comput..
[23] Balakrishna J. Prabhu,et al. Price of anarchy in non-cooperative load balancing games , 2011, Perform. Evaluation.
[24] Ariel Orda,et al. Architecting noncooperative networks , 1995, Eighteenth Convention of Electrical and Electronics Engineers in Israel.
[25] Bruno Gaujal,et al. The price of forgetting in parallel and non-observable queues , 2011, Perform. Evaluation.
[26] Christos H. Papadimitriou,et al. Worst-case Equilibria , 1999, STACS.
[27] Idit Keidar,et al. EquiCast: scalable multicast with selfish users , 2006, PODC '06.
[28] José R. Correa,et al. The Impact of Oligopolistic Competition in Networks , 2009, Oper. Res..
[29] Urtzi Ayesta,et al. Load balancing in processor sharing systems , 2011, Telecommun. Syst..
[30] Fernando Paganini,et al. Game theoretic approach to power control in cellular CDMA , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).
[31] Balakrishna J. Prabhu,et al. On the convergence of the best-response algorithm in routing games , 2013, VALUETOOLS.
[32] Erol Gelenbe,et al. Self-aware networks and QoS , 2004, Proceedings of the IEEE.
[33] Antonio Fernández,et al. A mathematical model for the TCP Tragedy of the Commons , 2005, Theor. Comput. Sci..
[34] Tim Roughgarden,et al. Selfish routing and the price of anarchy , 2005 .
[35] Ariel Orda,et al. Competitive routing in multi-user communication networks , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.
[36] Erol Gelenbe,et al. Adaptive Dispatching of Tasks in the Cloud , 2015, IEEE Transactions on Cloud Computing.
[37] Balakrishna J. Prabhu,et al. Worst-case analysis of non-cooperative load balancing , 2014, Annals of Operations Research.
[38] Balakrishna J. Prabhu,et al. Is the Price of Anarchy the Right Measure for Load-Balancing Games? , 2014, TOIT.
[39] Rahul Garg,et al. A game-theoretic approach towards congestion control in communication networks , 2002, CCRV.
[40] Ariel Orda,et al. Capacity allocation under noncooperative routing , 1997, IEEE Trans. Autom. Control..
[41] Tim Roughgarden,et al. Algorithmic Game Theory , 2007 .
[42] Zhu Han,et al. Cooperative Game Theory for Distributed Spectrum Sharing , 2007, 2007 IEEE International Conference on Communications.
[43] Adam Wierman,et al. The effect of local scheduling in load balancing designs , 2008, PERV.
[44] Jeffrey O. Kephart,et al. The Vision of Autonomic Computing , 2003, Computer.
[45] Erol Gelenbe,et al. Random Neural Networks with Synchronized Interactions , 2008, Neural Computation.
[46] Ariel Orda,et al. Competitive routing in multiuser communication networks , 1993, TNET.
[47] Tao Wu,et al. A Comparative Analysis of Server Selection in Content Replication Networks , 2008, IEEE/ACM Transactions on Networking.
[48] Linus Schrage,et al. The Queue M/G/1 with the Shortest Remaining Processing Time Discipline , 1966, Oper. Res..
[49] Donald R. Smith. Technical Note - A New Proof of the Optimality of the Shortest Remaining Processing Time Discipline , 1978, Oper. Res..
[50] Zhu Han,et al. Non-cooperative resource competition game by virtual referee in multi-cell OFDMA networks , 2007, IEEE Journal on Selected Areas in Communications.
[51] R. Michael Buehrer,et al. A game-theoretic framework for interference avoidance , 2009, IEEE Transactions on Communications.
[52] Bruno Gaujal,et al. Optimal routing in parallel, non-observable queues and the price of anarchy revisited , 2010, 2010 22nd International Teletraffic Congress (lTC 22).
[53] Bruno Gaujal,et al. Control of parallel non-observable queues: asymptotic equivalence and optimality of periodic policies , 2014, ArXiv.
[54] L. Shapley,et al. REGULAR ARTICLEPotential Games , 1996 .
[55] George B. Mertzios,et al. Fast Convergence of Routing Games with Splittable Flows , 2008, TMFCS 2008.
[56] Erol Gelenbe,et al. Sensible decisions based on QoS , 2003, Comput. Manag. Sci..
[57] Dusit Niyato,et al. Competitive spectrum sharing in cognitive radio networks: a dynamic game approach , 2008, IEEE Transactions on Wireless Communications.