University of Wisconsin-Platteville

Displaying 1-1 of 1 results

  • White Papers // Jan 2010

    Exact Algorithms for Multi-Constrained QoS Routing

    The modern network service of finding a feasible or an optimal path subject to multiple constraints on performance metrics such as delay, jitter, loss probability, etc. gives rise to the Multi-Path Constrained (MCP) or Multi-Constrained Optimal-Path (MCOP) QoS routing problems, which are NP-complete. In this paper, these problems are solved...

    Provided By University of Wisconsin-Platteville

  • White Papers // Jan 2010

    Exact Algorithms for Multi-Constrained QoS Routing

    The modern network service of finding a feasible or an optimal path subject to multiple constraints on performance metrics such as delay, jitter, loss probability, etc. gives rise to the Multi-Path Constrained (MCP) or Multi-Constrained Optimal-Path (MCOP) QoS routing problems, which are NP-complete. In this paper, these problems are solved...

    Provided By University of Wisconsin-Platteville