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

QR Code

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

Similar Items

Addressing the most reliable edge-disjoint paths with a delay constraint
by: Loh, Rue-chze, et al.
Published: (2011)

Edge disjoint paths with minimum delay subject to reliability constraint
by: Loh, Rue-chze, et al.
Published: (2009)

Maximizing bandwidth using disjoint paths
by: Loh, R., et al.
Published: (2010)

Using edge-disjoint paths to improve the QoS in computer communications
by: Loh, Ruen Chze
Published: (2010)

Energy-Aware Two Link-Disjoint Paths Routing
by: Lin, Gongqi, et al.
Published: (2013)

Reliable Green Routing Using Two Disjoint Paths
by: Lin, GongQi, et al.
Published: (2014)

Energy Aware Two Disjoint Paths Routing
by: Lin, GongQi, et al.
Published: (2014)

A Practical Algorithm for Reliable Network Topology Design
by: Elshqeirat, B., et al.
Published: (2013)

A Dynamic Programming Algorithm for Reliable Network Design
by: Elshqeirat, Basima, et al.
Published: (2014)

Dynamic Programming for Minimal Cost Topology with Reliability Constraint
by: Elshqeirat, B., et al.
Published: (2013)

Dynamic Programming for Minimal Cost Topology with Two Terminal Reliability Constraint
by: Elshqeirat, B., et al.
Published: (2013)

On the effects of energy-aware traffic engineering on routing reliability
by: Lin, Gongqi, et al.
Published: (2013)

Reliability evaluation of time evolving Delay Tolerant Networks based on Sum-of-Disjoint products
by: Chaturvedi, S., et al.
Published: (2018)

Topology Design with Minimal Cost Subject to Network Reliability Constraint
by: Elshqeirat, Basima, et al.
Published: (2015)

An efficient cutset approach for evaluating communication-network reliability with heterogeneous link-capacities
by: Soh, Sieteng, et al.
Published: (2005)

Incongruent restricted disjoint covering systems
by: Myerson, G., et al.
Published: (2009)

Routing problem in rectangular mesh network using shortest path based Greedy method
by: Noraziah, Adzhar, et al.
Published: (2019)

Routing problem in rectangular mesh network using shortest path based Greedy method
by: Noraziah, Adzhar, et al.
Published: (2019)

Disjointed contact tracing aggravates covid-19
by: Azman, Nur Hanani
Published: (2021)

Greedy feature construction
by: Oglic, Dino, et al.
Published: (2016)

Efficient heuristics for energy-aware routing in networks with bundled links
by: Lin, Gongqi, et al.
Published: (2013)

Power-aware routing in networks with delay and link utilization constraints
by: Lin, GongQi, et al.
Published: (2012)

A comparison of domain decomposition techniques for analysing disjoint finite antenna arrays
by: Ludick, D., et al.
Published: (2014)

A memory efficient algorithm for network reliability
by: Herrmann, Johannes, et al.
Published: (2009)

Find your investment path
by: Chuah, Bee Kim
Published: (2021)

Greedy heuristic for the workforce scheduling and routing problem
by: Russell, Samuel
Published: (2017)

Optimum paths-finding algorithms for _+1 partial bandwidth path protection
by: Gan, Ming Lee
Published: (2013)

Comparison of binary and multi-variate hybrid decision diagram algorithms for k-terminal reliability
by: Herrmann, Johannes, et al.
Published: (2011)

Path planning for the Platonic solids on prescribed grids by edge-rolling
by: Lam, Ngoc Tam, et al.
Published: (2021)

Energy-aware traffic engineering with reliability constraint
by: Lin, GongQi, et al.
Published: (2015)

Cloud forensic: Technical challenges, solutions and comparative analysis
by: Pichan, A., et al.
Published: (2015)

Evaluating communication-network reliability with heterogeneous link-capacities using subset enumeration
by: Soh, Sieteng, et al.
Published: (2006)

A simple method to deduce minimal cut sets by tracing minimal paths for reliability assessment of power systems
by: Abdul Wahab, Noor Izzri, et al.
Published: (2015)

Battening Down / Greedy after this gossip / The town and river overflow
by: Kinsella, John
Published: (2011)

Analysis of Dijkstra’s and A* algorithm to find the shortest path
by: Alija, Amani Saleh
Published: (2015)

Discrete Path Planning for Convex Polyhedra through Edge-Rolling on a Plane
by: Lam, Ngoc Tam
Published: (2022)

Incremental learning for querying multimodal symbolic data.
by: Lazarescu, Mihai M.
Published: (2000)

Non-greedy minimum interference routing algorithm for bandwidth-guaranteed flows
by: Tan, Su Wei, et al.
Published: (2002)

The effects of CEO greediness and peer compensation on the quality of firms’ financial information
by: Alhossini, Abdullah A.
Published: (2024)

Greedy Interaction Elements Coverage Analysis for AI-Based T-Way Strategies
by: Kamal Z., Zamli, et al.
Published: (2013)