Large margin shortest path routing |
| |
Authors: | Yadamsuren Lutbat Rentsen Enkhbat Won-Joo Hwang |
| |
Institution: | 1. The School of Computer Science and Management, Mongolian University of Science and Technology, Ulaanbaatar, Mongolia 2. The School of Economic Studies, National University of Mongolia, Ulaanbaatar, 210646, Mongolia 3. The Department of Information and Communications Engineering, UHRC, Inje University, Gyeongnam, 621-749, Korea
|
| |
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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|