Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
Bandwidth sharing: objectives and algorithms
IEEE/ACM Transactions on Networking (TON)
Precomputation schemes for QoS routing
IEEE/ACM Transactions on Networking (TON)
Stability of Data Networks: Stationary and Bursty Models
Operations Research
Congestion control for high performance, stability, and fairness in general networks
IEEE/ACM Transactions on Networking (TON)
International Journal of Communication Systems
OPQR-G: algorithm for efficient QoS partition and routing in multiservice IP networks
Computer Communications
Hi-index | 0.00 |
We propose a precomputation-based scheme offering Pareto optimal solutions to the network optimization problem. This scheme precomputes bandwidth allocation (rate vector) and end-to-end paths with QoS guarantees. It prepares a routing database, identifying an optimal path upon each connection request. We propose a mixed-integer optimization model with nonlinear utility functions. The purpose of this work is to choose the optimal solutions and to provide decision makers a set of solutions satisfying users' preferences with fairness. It prepares for a proportionally fair treatment of all competing connections. Numerical results show that the proposed model can provide each connection with its fair share of the bandwidth which is proportional to the target rate.