A MULTICONSTRAINT QOS ROUTING SCHEME USING A MODIFIED DIJKSTRA'S ALGORITHM

摘要

We propose a multiconstraint QoS routing scheme, MPMP (multi-prepaths multi-postpaths). MPMP achieves low EDR and polynomial worst-case time complexity using a modified Dijkstra's algorithm with a metric, called the minimum normalized margin. We show by simulation that MPMP has better performance than two competing schemes from the literature, TAMCRA and H_MCOP.