QoS Routing in Communication Networks: Approximation Algorithms Based on the Primal Simplex Method of Linear Programming.
Ying XiaoKrishnaiyan ThulasiramanGuoliang XuePublished in: IEEE Trans. Computers (2006)
Keyphrases
- communication networks
- simplex method
- approximation algorithms
- linear programming
- qos routing
- np hard
- qos parameters
- linear program
- primal dual
- simplex algorithm
- quality of service
- routing algorithm
- special case
- qos requirements
- ip networks
- optimal solution
- ad hoc networks
- worst case
- network structure
- linear programming problems
- distributed databases
- feasible solution
- network topology
- computer networks
- column generation
- network design
- lower bound
- quadratic programming
- mobile ad hoc networks
- integer programming
- semidefinite programming
- interior point methods
- real time
- objective function
- wireless sensor networks
- computational complexity
- dynamic programming
- management system
- mobile networks
- upper bound
- resource management
- constraint satisfaction problems
- network traffic