Ruen Chze Loh

According to our database, Ruen Chze Loh authored at least 4 papers between 2008 and 2011.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2011

Addressing the Most Reliable Edge-Disjoint Paths With a Delay Constraint.

Ruen Chze Loh, Sieteng Soh, Mihai M. Lazarescu

IEEE Trans. Reliab., 2011

2010

Maximizing Bandwidth Using Disjoint Paths.

Ruen Chze Loh, Sieteng Soh, Mihai M. Lazarescu

Proceedings of the 24th IEEE International Conference on Advanced Information Networking and Applications, 2010

2009

An Approach to Find Maximal Disjoint Paths with Reliability and Delay Constraints.

Ruen Chze Loh, Sieteng Soh, Mihai M. Lazarescu

Proceedings of the IEEE 23rd International Conference on Advanced Information Networking and Applications, 2009

2008

A Greedy Technique for Finding the Most Reliable Edge-Disjoint-Path-Set in a Network.

Ruen Chze Loh, Sieteng Soh, Mihai M. Lazarescu, Suresh Rai

Proceedings of the 14th IEEE Pacific Rim International Symposium on Dependable Computing, 2008