Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Atov, I., Tran, H.T., Harris, R.J.: OPQR-G: Algorithm for efficient QoS partition and routing in multiservice IP Networks. Computer Communications 28, 1987–1996 (2005)
Bai, Y., Ito, M.R.: Class-Based Packet Scheduling to Improve QoS for IP Video. Telecommunication Systems 29(1), 47–60 (2005)
van Hoesel, S.: Optimization in telecommunication networks. Statistica Neerlandica 59(2), 180–205 (2005)
Kelly, F.P., Maulloo, A.K., Tan, D.K.H.: Rate control for communication networks: Shadow prices, proportional fairness and stability. Journal of the Operational Research Society 49, 237–252 (1998)
Kelly, F.P.: Fairness and stability of end-to-end congestion control. European Journal of Control 9, 159–176 (2003)
Low, S.H., Lapsley, D.E.: Optimization flow control–Part I: Basic algorithm and convergence. IEEE/ACM Transactions on Networking 7(6), 861–874 (1999)
Massoulié, L., Roberts, J.: Bandwidth sharing: objectives and algorithms. IEEE/ACM Transactions on Networking 10(3), 320–328 (2002)
Mo, J., Walrand, J.: Fair end-to-end window-based congestion control. IEEE/ACM Transactions on Networking 8(5), 556–567 (2000)
Orda, A., Sprintson, A.: Precomputation schemes for QoS routing. IEEE/ACM Transactions on Networking 11(4), 578–591 (2003)
Paganini, F., Wang, Z., Doyle, J.C., Low, S.H.: Congestion control for high performance, stability, and fairness in general networks. IEEE/ACM Transactions on Networking 13(1), 43–56 (2005)
The UMTS Forun: Enabling UMTS/Third Generation Services and Applications. UMTS Forun Report 11 (2000)
Wang, C.H., Luh, H.: Network Dimensioning Problems of Applying Achievement Functions. Lecture Notes in Operations Research: Operations Research and Its Applications 6, 35–59 (2006)
Wu, H., Jia, X., He, Y., Huang, C.: Bandwidth-guaranteed QoS routing of multiple parallel paths in CDMA/TDMA ad hoc wireless networks. International Journal of Communication Systems 18, 803–816 (2005)
Ye, H.Q., Qu, J.: Stability of data networks: Stationary and bursty models. Operations Research 53(1), 107–125 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, CH., Luh, H. (2006). A Precomputation-Based Scheme for QoS Routing and Fair Bandwidth Allocation. In: Robert, Y., Parashar, M., Badrinath, R., Prasanna, V.K. (eds) High Performance Computing - HiPC 2006. HiPC 2006. Lecture Notes in Computer Science, vol 4297. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11945918_56
Download citation
DOI: https://doi.org/10.1007/11945918_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68039-0
Online ISBN: 978-3-540-68040-6
eBook Packages: Computer ScienceComputer Science (R0)