F.A. Kuipers
210 records found
1
...
Authored
Quality of Service Routing is at present an active and remarkable research area, since most emerging network services require specialized Quality of Service (QoS) functionalities that cannot be provided by the current QoS-unaware routing protocols. The provisioning of QoS based n
...
A common approach to deal with NP-hard problems is to deploy polymonial-time e-approximation algorithms often resort to rounding and scaling to guarantee a solution that is within a factor ( 1+ypsilon) of the optimal solution. Usually, researchers either only round up or only dow
...
Finding a path in a network based on multiple constraints (the MCP problem) is often considered an integral part of quality of service (QoS) routing. QoS routing with constraints on multiple additive measures has been proven to be NP-complete. This proof has dramatically influenc
...
The Internet consists of many network elements that direct packets on the correct path leading towards the destination. This process of finding and following a path to the destination is called routing. Routing is not infallible and packets may get lost: the current Internet cann
...