4446
правок
Маршрутизация: различия между версиями
Материал из WEGA
→Литература
Irina (обсуждение | вклад) |
Irina (обсуждение | вклад) |
||
| Строка 67: | Строка 67: | ||
==Литература== | ==Литература== | ||
* Толковый словарь по вычислительным системам. — М.: Машиностроение, 1991. | * Толковый словарь по вычислительным системам. — М.: Машиностроение, 1991. | ||
1. Applegate, D., Cohen, E.: Making routing robust to changing traffic demands: algorithms and evaluation. IEEE/ACM Trans Netw 14(6), 1193-1206 (2006). doi:10.1109/TNET.2006.886296 | |||
2. Aspnes, J., Azar, Y., Fiat, A., Plotkin, S., Waarts, O.: On-line routing of virtual circuits with applications to load balancing and machine scheduling. J. ACM 44(3), 486-504 (1997) | |||
3. Azar, Y., Chaiutin, Y.: Optimal node routing. In: Proceedings ofthe 23rd International Symposium on Theoretical Aspects of Computer Science, 2006, pp. 596-607 | |||
4. Azar, Y., Cohen, E., Fiat, A., Kaplan, H. Racke, H.: Optimal oblivious routing in polynomial time. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, 2003, pp. 383-388 | |||
5. Bansal, N., Blum, A., Chawla, S.: Meyerson, A.: Online oblivious routing. In: Proceedings of the 15th Annual ACM Symposium on Parallel Algorithms, 2003, pp. 44-49 | |||
6. Borodin, A., Hopcroft, J.E.: Routing, merging and sorting on parallel models of computation. J. Comput. Syst. Sci. 30(1), 130-145(1985) | |||
7. Hajiaghayi, M.T., Kleinberg, R.D., Leighton, T., Racke, H.: Oblivious routing on node-capacitated and directed graphs. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, 2005, pp. 782-790 | |||
8. Hajiaghayi, M.T., Kim, J.H., Leighton, T., Racke, H.: Oblivious routing in directed graphs with random demands. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005, pp. 193-201 | |||
9. Kaklamanis, C., Krizanc, D., Tsantilas, A.: Tight bounds for oblivious routing in the hypercube. In: Proc. 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, 1990, pp. 31-36 | |||
10. Leighton, F.T.: Introduction to Parallel Algorithms and Architectures Arrays,Trees, Hypercubes. Morgan Kaufmann Publishers, San Fransisco (1992) | |||
11. Leonardi, S.: On-line network routing. In: Fiat, A., Woeginger, G. (eds.) Online Algorithms - The State of the Art. Chap. 11, pp. 242-267. Springer, Heidelberg (1998) | |||
12. Racke, H.: Minimizing Congestions in General Networks. In: Proceedings of the 43rd Symposium on Foundations of Computer Science, 2002, pp. 43-52 | |||
13. Raghavan, P., Thompson, C.D.: Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica 7, 365-374 (1987) | |||
14. Spring, N., Mahajan, R., Wetherall, D.: Measuring ISP topologies with Rocketfuel. In: Proceedings of the ACM SIGCOMM'02 Conference. ACM, New York (2002) | |||
15. Valiant, L.G., Brebner, G.: Universal schemes for parallel communication. In: Proceedings of the 13th ACM Symposium on Theory of Computing, 1981, pp. 263-277 | |||
