Amanote Research
Register
Sign In
QoS Routing in Communication Networks: Approximation Algorithms Based on the Primal Simplex Method of Linear Programming
IEEE Transactions on Computers
- United States
doi 10.1109/tc.2006.109
Full Text
Open PDF
Abstract
Available in
full text
Categories
Hardware
Architecture
Mathematics
Computational Theory
Theoretical Computer Science
Software
Date
July 1, 2006
Authors
Y. Xiao
G. Xue
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Related search
The Primal Simplex Approach to the QoS Routing Problem
Bounded Primal Simplex Algorithm for Bounded Linear Programming With Fuzzy Cost Coefficients
International Journal of Operations Research and Information Systems
Eliminating Columns in the Simplex Method for Linear Programming
QoS-based Routing Over Software Defined Networks
Performance Evaluation of Delay-Constrained Least-Cost QoS Routing Algorithms Based on Linear and Nonlinear Lagrange Relaxation
SDN-based Overlay Networks for QoS-aware Routing
Lagrangian Relaxation and Linear Intersection Based QoS Routing Algorithm
International Journal of Electronics and Telecommunications
A New Approach for Analyzing the Performance of the WiMAX Networks Based on QoS Traffic Prediction Routing Protocol Using Gene Expression Programming
International Journal of Applied Metaheuristic Computing
Control
Statistics
Probability
Optimization
Decision Sciences
Computational Theory
Simulation
Computer Science Applications
Computational Mathematics
Mathematics
Modeling
Evaluation of Multicast Routing Algorithms for Real-Time Communication on High-Speed Networks
