[1]Wang Z, Crowcroft J. QualityofService Routing for Supporting Multimedia Application[J]. JSAC, 1996,14(7):12281234.
[2]Chen Shigang, Nahrstedt K. On Finding MultiConstrained Paths[C]∥Proc of Int’l Conference on Communications, 1998:874879.
[3]Feng G. Nonlinear Lagrange Relaxation Based QoS Routing Revisited[C]∥Proc of IEEE INFOCOM’04, 2004:504509.
[4]Juttner A, Balazs S, Mecs I,et al. Lagrange Relaxation Based Method for the QoS Routing Problem[C]∥Proc of IEEE INFOCOM’01, 2001:859868.
[5]Xue G, Sen A, Zhang W, et al. Finding a Path Subject to Many Additive QoS Constraints[J]. IEEE/ACM Trans on Netw,2007,15(1):201211.
[6]Xue G, Sen A, Banka R. Routing With Many Additive QoS Constraints[C]∥Proc of IEEE INFOCOM’03, 2003:223227.
[7]Yuan X. On the Extended BellmanFord Algorithm to Solve TwoConstrained Quality of Service Routing Problems[C]∥Proc of the 8th Int’l Conf on Communication,1999:304310.
[8]谢政.网络算法与复杂性理论[M]. 第二版.长沙: 国防科技大学出版社, 2003.
[9]Comer E. 用TCP/IP进行网际, 第1卷:原理、协议和体系结构[M]. 林瑶,等译. 北京: 电子工业出版社,1998.
[10]Khadivi P, Samavi S, Todd T,et al. MultiConstraint QoS Routing Using a New Single Mixed Metric[C]∥Proc of IEEE Int’l Conf on Communications,2004:20422046.
[11]Ahuja S, Krunz M, Korkmaz T. Optimal Path Selection for Ethernet Over SONET Under Inaccurate LinkState Information[C]∥Proc of Int’l Conf on Communications,2005:94103. |