Global optimization using local information with applications to flow control
暂无分享,去创建一个
Danny Raz | John W. Byers | Yair Bartal | J. Byers | Y. Bartal | D. Raz
[1] Nathan Linial,et al. Distributive graph algorithms Global solutions from local data , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[2] Amos Fiat,et al. On-line load balancing with applications to machine scheduling and virtual circuit routing , 1993, STOC.
[3] Yishay Mansour,et al. Convergence Complexity of Optimistic Rate-Based Flow-Control Algorithms , 1999, J. Algorithms.
[4] Dimitri P. Bertsekas,et al. Data Networks , 1986 .
[5] Jeffrey M. Jaffe,et al. Bottleneck Flow Control , 1981, IEEE Trans. Commun..
[6] Yossi Azar,et al. Local optimization of global objectives: competitive distributed deadlock resolution and resource allocation , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[7] Baruch Awerbuch,et al. Converging to approximated max-min flow fairness in logarithmic time , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.
[8] Noam Nisan,et al. A parallel approximation algorithm for positive linear programming , 1993, STOC.
[9] Éva Tardos,et al. Fast Approximation Algorithms for Fractional Packing and Covering Problems , 1995, Math. Oper. Res..
[10] Mihalis Yannakakis,et al. Linear programming without the matrix , 1993, STOC.
[11] A. Charny,et al. An Algorithm for Rate Allocation in a Packet-Switching Network With Feedback , 1994 .
[12] Yossi Azar,et al. Throughput-competitive on-line routing , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.