A new polynomial-time algorithm for linear programming
Combinatorica
Algorithms for provisioning virtual private networks in the hose model
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Resource management with hoses: point-to-cloud services for virtual private networks
IEEE/ACM Transactions on Networking (TON)
Traffic matrix estimation: existing techniques and new directions
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
A practical algorithm for constructing oblivious routing schemes
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Fast accurate computation of large-scale IP traffic matrices from link loads
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Worst-case Traffic for Oblivious Routing Functions
IEEE Computer Architecture Letters
Making routing robust to changing traffic demands: algorithms and evaluation
IEEE/ACM Transactions on Networking (TON)
Oblivious routing of highly variable traffic in service overlays and IP backbones
IEEE/ACM Transactions on Networking (TON)
Fine Two-Phase Routing with Traffic Matrix
ICCCN '09 Proceedings of the 2009 Proceedings of 18th International Conference on Computer Communications and Networks
F-TPR: fine two-phase IP routing scheme over shortest paths for hose model
IEEE Communications Letters
Traffic-Oblivious Routing for Guaranteed Bandwidth Performance
IEEE Communications Magazine
Optimizing OSPF/IS-IS weights in a changing world
IEEE Journal on Selected Areas in Communications
The Journal of Supercomputing
| Hi-index | 0.00 |
This paper presents an IP finely-distributed load-balanced routing scheme based on two-phase routing over shortest paths, where the traffic matrix is given. It is called the fine two-phase routing (F-TPR) scheme. F-TPR more finely distributes traffic from a source node to intermediate nodes than the original TPR. F-TPR determines the distribution ratios to intermediate nodes for each source-destination node pair independently. To determine an optimum set of distribution ratios, a linear programming (LP) formulation is derived. We compare the F-TPR scheme against the TPR scheme and the sophisticated traffic engineering (TE) scheme of Multi-Protocol Label Switching (MPLS-TE). Numerical results show that F-TPR greatly reduces the network congestion ratio compared to TPR. In addition, F-TPR provides almost the same network congestion ratios as MPLS-TE, the difference is surprisingly less than 0.1% for the various network topologies examined. In addition, considering the practical implementation of F-TPR for routers, we also investigate the case that traffic from a source node to a destination node is not allowed to be split over multiple routes. The non-split problem is formulated as an integer linear programming (ILP) problem. As it is difficult to solve the ILP problem within practical time, two heuristic algorithms are presented: Largest Traffic Demand First (LTDF) and a Random Selection (RS). The applicability of LTDF and RS are presented in terms of network size. We find that non-split F-TPR also matches the routing performance of MPLS-TE within an error of 1%, when network size is large enough.