Download now Free registration required
Multi-Constrained Path (MCP) selection, in which the key objective is to search for feasible paths satisfying multiple routing constraints simultaneously, is known to be an NP-Complete problem. Multi-Constrained Path Optimization (MCPO) is different from MCP mainly in that, the feasible paths selected should also be optimal with regard to an optimization metric, which makes path computation in MCPO even harder. This paper proposes a fully distributed Multi-constrained Path Optimization Routing (MPOR) protocol that solves the general k-constrained path selection and routing optimization problems.
- Format: PDF
- Size: 174.9 KB