Survivable delay-constrained least cost routing
暂无分享,去创建一个
[1] Alpár Jüttner,et al. Lagrange relaxation based method for the QoS routing problem , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).
[2] Jon Crowcroft,et al. Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..
[3] Guoliang Xue,et al. Constrained shortest link-disjoint paths selection: a network programming based approach , 2006, IEEE Transactions on Circuits and Systems I: Regular Papers.
[4] Niki Pissinou,et al. Performance evaluation of delay-constrained least-cost QoS routing algorithms based on linear and nonlinear Lagrange relaxation , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).
[5] Dahai Xu,et al. Network Design and Architectures for Highly Dynamic Next-Generation IP-Over-Optical Long Distance Networks , 2009 .