Call scheduling in trees, rings and meshes
暂无分享,去创建一个
[1] Klaus Jansen,et al. Scheduling of Virtual Connections in Fast Networks , 1996, Universität Trier, Mathematik/Informatik, Forschungsbericht.
[2] Christos Kaklamanis,et al. Efficient Wavelength Routing on Directed Fiber Trees , 1996, ESA.
[3] Takao Nishizeki,et al. On the 1.1 Edge-Coloring of Multigraphs , 1990, SIAM J. Discret. Math..
[4] Satish Rao,et al. Efficient access to optical bandwidth , 1995, FOCS 1995.
[5] Anja Feldmann,et al. On-line Call Admission for High-Speed Networks , 1995 .
[6] Satish Rao,et al. Efficient access to optical bandwidth wavelength routing on directed fiber trees, rings, and trees of rings , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.