Finding Good Candidate Cycles for Efficient p-Cycle Network Design. - Chang Liu 048; Lu Ruan 001 (ICCCN, 2004)

A dynamic routing algorithm with load balancing heuristics for restorable connections in WDM networks. - Lu Ruan 001; Haibo Luo; Chang Liu 048 (IEEE J. Sel. Areas Commun., 2004)

A heuristic algorithm for survivable mapping in IP-over-WDM networks. - Lu Ruan 001; Chang Liu 048 (Communications and Computer Networks, 2005)

p-cycle design in survivable WDM networks with shared risk link groups (SRLGs). - Chang Liu 048; Lu Ruan 001 (DRCN, 2005)

Logical topology augmentation for survivable mapping in IP-over-WDM networks. - Chang Liu 048; Lu Ruan 001 (GLOBECOM, 2005)

Dynamic Provisioning of Survivable Services Using Path-Segment Protecting p-Cycles in WDM Networks. - Chang Liu 048; Lu Ruan 001 (ICCCN, 2006)

Dynamic establishment of restorable connections using p. - Lu Ruan 001; Fangcheng Tang; Chang Liu 048 (Opt. Switch. Netw., 2006)

p-Cycle Design in Survivable WDM Networks with Shared Risk Link Groups (SRLGs). - Chang Liu 048; Lu Ruan 001 (Photonic Netw. Commun., 2006)

A new survivable mapping problem in IP-over-WDM networks. - Chang Liu 048; Lu Ruan 001 (IEEE J. Sel. Areas Commun., 2007)