On Protecting WDM Networks with Valiant Load Balancing under Hose Uncertain Traffic Model

Ramamurthy S, Sahasrabuddhe L, and Mukherjee B.Survivable WDM mesh networks[J].IEEE/OSA Journal ofLightwave Technology.2003, 21(4):870-883[2]Vaughn M and Wagner R. Metropolitan network trafficdemand study[C]. 13th Annual Meeting of the Lasers andElectro-Optics Society 2000, LEOS: IEEE, Rio Grande, 2000:102-113.[3]Duffield N G, Goyal P, and Greenberg A G, et al.. A flexiblemodel for resource management in virtual private networks[J].ACM Sigcomm Computer Communication.1999, 29(4):95-98[4]Kodialam M, Lakshman T V, and Sengupta S. Efficient androbust routing of highly variable traffic[C]. Third Workshopon Hot Topics in Networks, San Diego, 2004.[5]Zhang-Shen R and McKeown N. Designing a fault-tolerantnetwork using Valiant load- balancing[C]. IEEE INFOCOM,Phoenix, 2008：2360-2368.[6]章小宁, 李乐民, 王晟, 杨飞. WDM 网状网在鲁棒资源配置下的抗毁设计[J]. 电子科技大学学报, 2008, 37(4): 519-522.Zhang Xiao-ning, Li Le-min, Wang Sheng, and Yang Fei.Design of resilient WDM mesh networks under robustresource provisioning[J]. Journal of University of ElectronicScience and Technology of China, 2008, 37(4): 519-522.[7]Ho P, Tapolcai J, and Cinkler T. Segment shared protectionin mesh communications networks with bandwidthguaranteed tunnels[J].IEEE/ACM Transactions onNetworking.2004, 12(6):1105-1118[8]Zhu K and Mukherjee B. Traffic grooming in an opticalWDM mesh network [J].IEEE Journal of Selected Areas onCommunications.2002, 20(1):122-133[9]Dutta R, Kamal A, and Rouskas G. Traffic Grooming forOptical Networks: Foundations and Techniques [M]. Germany,Springer, 2008: 73-88.[10]Chen B, Rouskas G, and Dutta R. On hierarchical trafficgrooming in WDM networks[J]. IEEE/ACM Transactions onNetworking, 2008, (5): 1226-1238.[11]Valiant L and Brebner G. Universal scheme for parallelcommunications[C]. Proceeding of the 13th AnnualSymposium on Theory Computing, Wisconsin, 1981:263-277.