Abstract
A new discriminative approach to routing inspired by the large margin criterion serving as a basis for support vector machines is presented. The proposed formulation uses the benefit of the dualization convex program, and it is possible for standard solvers to learn the weighting metrics of the shortest path routing. In order to demonstrate this and due to its simplicity, the single path flow allocation problem is considered in this article. It was found that the weight settings performed within a few percent of that of the optimal general routing where the flow for each demand was optimally distributed over all paths between the source and destination.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call