A greedy technique for finding the most reliable edge-disjoint-path-set in a network.

A greedy technique for finding the most reliable edge-disjoint-path-set in a network.

Bibliographic Details
Main Authors: Loh, Rue-chze, Soh, Sieteng, Lazarescu, Mihai, Suresh, R.
Other Authors: Not known
Format: Conference Paper
Published: IEEE 2008
Online Access:http://hdl.handle.net/20.500.11937/4780

Internet

http://hdl.handle.net/20.500.11937/4780

Similar Items