default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLu Ruan 0001
Person information
- affiliation: Iowa State University, Ames, Department of Computer Science
- affiliation: University of Minnesota, Department of Computer Science, Minneapolis, MN, USA
Other persons with the same name
- Lu Ruan 0002 — Fudan University, Shanghai Key Laboratory of Data Science, Shanghai, China
- Lu Ruan 0003 — Wuhan University, School of Remote Sensing and Information Engineering, China
- Lu Ruan 0004 — China Telecom Corporation, Chongqing, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[c22]Jinu Susan Varghese, Lu Ruan:
Computing Customer Cones of Peering Networks. ANRW 2016: 35-37- [c21]Jinu Susan Varghese, Lu Ruan:
A machine learning approach to edge type inference in Internet AS graphs. INFOCOM Workshops 2016: 71-76 - 2014
- [j20]Lu Ruan, Yanwei Zheng:
Dynamic Survivable Multipath Routing and Spectrum Allocation in OFDM-Based Flexible Optical Networks. JOCN 6(1): 77-85 (2014) - 2013
- [j19]Lu Ruan, Nan Xiao:
Survivable Multipath Routing and Spectrum Allocation in OFDM-Based Flexible Optical Networks. JOCN 5(3): 172-182 (2013) - 2012
- [j18]Lu Ruan, Nan Xiao:
An efficient scheme for two-link failure protection/restoration in WDM mesh networks. J. High Speed Networks 18(3): 185-195 (2012) - [c20]Nan Xiao, Lu Ruan:
Survivable multipath provisioning in OFDM-based flexible optical networks. GLOBECOM Workshops 2012: 346-351 - 2011
- [j17]Taiming Feng
, Lu Ruan:
Design of a Survivable Hybrid Wireless-Optical Broadband-Access Network. JOCN 3(5): 458-464 (2011) - 2010
- [j16]Taiming Feng, Long Long, Ahmed E. Kamal, Lu Ruan:
Two-link failure protection in WDM mesh networks with p-cycles. Comput. Networks 54(17): 3068-3080 (2010) - [j15]Taiming Feng, Lu Ruan, Wensheng Zhang:
Intelligent p-Cycle Protection for Dynamic Multicast Sessions in WDM Networks. JOCN 2(7): 389-399 (2010) - [c19]Lu Ruan, Taiming Feng:
A Hybrid Protection/Restoration Scheme for Two-Link Failure in WDM Mesh Networks. GLOBECOM 2010: 1-5
2000 – 2009
- 2009
- [c18]Taiming Feng, Lu Ruan:
Design of Survivable Hybrid Wireless-Optical Broadband-Access Network. ICC 2009: 1-5 - [c17]Varun Srinivas, Lu Ruan:
An efficient reliable multicast protocol for 802.11-based wireless LANs. WOWMOM 2009: 1-6 - 2008
- [c16]Aditya Dhananjay, Lu Ruan:
PigWin: Meaningful Load Estimation in IEEE 802.11 Based Wireless LANs. ICC 2008: 2541-2546 - [c15]Taiming Feng, Lu Ruan, Wensheng Zhang:
Intelligent p-Cycle Protection for Multicast Sessions in WDM Networks. ICC 2008: 5165-5169 - [c14]Taiming Feng, Chuang Wang, Wensheng Zhang, Lu Ruan:
Confidentiality Protection for Distributed Sensor Data Aggregation. INFOCOM 2008: 56-60 - 2007
- [j14]Chang Liu, Lu Ruan:
A new survivable mapping problem in IP-over-WDM networks. IEEE J. Sel. Areas Commun. 25(S-3): 25-34 (2007) - [j13]Maggie Xiaoyan Cheng, Lu Ruan, Weili Wu:
Coverage breach problems in bandwidth-constrained sensor networks. ACM Trans. Sens. Networks 3(2): 12 (2007) - [c13]Lu Ruan, Zhi Liu:
A Capacity Efficient Local Protection Scheme for Bandwidth Guaranteed Connections. ICC 2007: 6368-6373 - 2006
- [j12]Lu Ruan, Fangcheng Tang:
Survivable IP network realization in IP-over-WDM networks under overlay model. Comput. Commun. 29(10): 1772-1779 (2006) - [j11]Lu Ruan, Fangcheng Tang, Chang Liu:
Dynamic establishment of restorable connections using p. Opt. Switch. Netw. 3(3-4): 191-201 (2006) - [j10]Chang Liu, Lu Ruan:
p-Cycle Design in Survivable WDM Networks with Shared Risk Link Groups (SRLGs). Photonic Netw. Commun. 11(3): 301-311 (2006) - [c12]Chang Liu, Lu Ruan:
Dynamic Provisioning of Survivable Services Using Path-Segment Protecting p-Cycles in WDM Networks. ICCCN 2006: 275-280 - 2005
- [j9]Lu Ruan, Weili Wu:
Broadcast Routing with Minimum Wavelength Conversion in WDM Optical Networks. J. Comb. Optim. 9(2): 223-235 (2005) - [c11]Lu Ruan, Fangcheng Tang:
Dynamic establishment of restorable connections using p-cycle protection in WDM networks. BROADNETS 2005: 147-154 - [c10]Lu Ruan, Chang Liu:
A heuristic algorithm for survivable mapping in IP-over-WDM networks. Communications and Computer Networks 2005: 164-170 - [c9]Chang Liu, Lu Ruan:
p-cycle design in survivable WDM networks with shared risk link groups (SRLGs). DRCN 2005: 207-212 - [c8]Chang Liu, Lu Ruan:
Logical topology augmentation for survivable mapping in IP-over-WDM networks. GLOBECOM 2005: 5 - [c7]Lu Ruan, Zhi Liu:
Upstream node initiated fast restoration in MPLS networks. ICC 2005: 959-964 - [c6]Zhi Liu, Lu Ruan:
Reducing restoration blocking in WDM optical networks. ICCCN 2005: 323-330 - [c5]Fangcheng Tang, Lu Ruan:
A Protection Tree Scheme for First-Failure Protection and Second-Failure Restoration in Optical Networks. ICCNMC 2005: 620-631 - [c4]Maggie Xiaoyan Cheng, Lu Ruan, Weili Wu:
Achieving minimum coverage breach under bandwidth constraints in wireless sensor networks. INFOCOM 2005: 2638-2645 - 2004
- [j8]Lu Ruan, Shitou Han, Deying Li, Hung Q. Ngo, Scott C.-H. Huang:
Transmission fault-tolerance of iterated line digraphs. J. Interconnect. Networks 5(4): 475-487 (2004) - [j7]Lu Ruan, Haibo Luo, Chang Liu:
A dynamic routing algorithm with load balancing heuristics for restorable connections in WDM networks. IEEE J. Sel. Areas Commun. 22(9): 1823-1829 (2004) - [j6]Lu Ruan, Hongwei Du, Xiaohua Jia, Weili Wu, Yingshu Li, Ker-I Ko:
A greedy approximation for minimum connected dominating sets. Theor. Comput. Sci. 329(1-3): 325-330 (2004) - [c3]Chang Liu, Lu Ruan:
Finding Good Candidate Cycles for Efficient p-Cycle Network Design. ICCCN 2004: 321-326 - 2003
- [j5]Maggie Xiaoyan Cheng, Xiufeng Du, Manki Min, Hung Q. Ngo, Lu Ruan, Jianhua Sun, Weili Wu:
Super link-connectivity of iterated line digraphs. Theor. Comput. Sci. 304(1-3): 461-469 (2003) - 2002
- [j4]Xiaohua Jia, Xiao-Dong Hu, Lu Ruan, Jianhua Sun:
Multicast routing, load balancing, and wavelength assignment on tree of rings. IEEE Commun. Lett. 6(2): 79-81 (2002) - [c2]Haibo Luo, Lu Ruan:
Load balancing heuristics for dynamic establishment of restorable lightpaths. ICCCN 2002: 472-477 - [c1]Lu Ruan, Haibo Luo:
A Fast Lightpath Restoration Method Using Two Backup Paths in WDM Networks. ICPP Workshops 2002: 183-192 - 2001
- [j3]Lu Ruan, Ding-Zhu Du, Xiao-Dong Hu, Xiaohua Jia, Deying Li, Zheng Sun:
Converter Placement Supporting Broadcast in WDM Optical Networks. IEEE Trans. Computers 50(7): 750-758 (2001) - 2000
- [j2]Bing Lu, Lu Ruan:
Polynomial Time Approximation Scheme for the Rectilinear Steiner Arborescence Problem. J. Comb. Optim. 4(3): 357-363 (2000) - [j1]Deying Li, Xiufeng Du, Xiao-Dong Hu, Lu Ruan, Xiaohua Jia:
Minimizing number of wavelengths in multicast routing trees in WDM networks. Networks 35(4): 260-265 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
