Fairness in routing and load balancing
暂无分享,去创建一个
[1] Clifford Stein,et al. Improved approximation algorithms for unsplittable flow problems , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[2] Nimrod Megiddo,et al. Optimal flows in networks with multiple sources and sinks , 1974, Math. Program..
[3] Frank Kelly,et al. Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..
[4] Dimitri P. Bertsekas,et al. Data Networks , 1986 .
[5] Jeffrey M. Jaffe,et al. Bottleneck Flow Control , 1981, IEEE Trans. Commun..
[6] Michel X. Goemans,et al. On the Single-Source Unsplittable Flow Problem , 1999, Comb..
[7] Serge A. Plotkin. Competitive Routing of Virtual Circuits in ATM Networks , 1995, IEEE J. Sel. Areas Commun..
[8] Donald F. Towsley,et al. The impact of multicast layering on network fairness , 1999, SIGCOMM '99.
[9] Richard M. Karp,et al. On the Computational Complexity of Combinatorial Problems , 1975, Networks.
[10] Jan Karel Lenstra,et al. Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[11] L. Shapley,et al. College Admissions and the Stability of Marriage , 1962 .
[12] Moti Yung,et al. Approximating max-min fair rates via distributed local scheduling with partial information , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.
[13] Lisa Zhang,et al. Fast, Fair and Frugal Bandwidth Allocation in ATM Networks , 1999, SODA '99.
[14] Jon M. Kleinberg,et al. Single-source unsplittable flow , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[15] Yishay Mansour,et al. Convergence complexity of optimistic rate based flow control algorithms (extended abstract) , 1996, STOC '96.
[16] Yishay Mansour,et al. Convergence Complexity of Optimistic Rate-Based Flow-Control Algorithms , 1999, J. Algorithms.
[17] Howard Paul Hayden,et al. Voice flow control in integrated packet networks , 1981 .