An Efficient Approximate Algorithm for Multi-Constrained Optimal-Path QoS Routing


Among all the quality of service (QoS) unicast routing problems, path-constrained path-optimization (PCPO) problem and multiple-path-constrained (MCP) problem [1] are the only two types of NP-complete problems and they are attracting a great deal of attention. Even though many previously proposed heuristics for the two problems have very good performance, a… (More)

3 Figures and Tables


  • Presentations referencing similar topics