Abstract
In this paper, we proposed a novel Min-Max Ant System algorithm for dynamic resource allocation with many of service classes while maximizing the provider’s utility in service-oriented networks. The model considers a pricing scheme for the offered services and the quality of service (QoS) requirements of each service class, which operates under a probabilistic delay bound constraint. The goal is to investigate how the utility function and the resource allocation respond to changes of various parameters given the QoS requirements of each service class. Our algorithm performance is evaluated through numerical studies and our solution is approximated the optimal solution. The computational results showed that this approach is currently among the best performing algorithms and much better than previous studies for this problem.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Nahrstedt, K., et al.: Qos and resource management in distributed interactive multimedia environments. Multimedia Tools Appl. 51(1), 99–132 (2010)
Xu, P., et al.: Profit-oriented resource allocation using online scheduling in flexible heterogeneous networks. Telecommun. Syst. 31(3), 289–303 (2006)
Kalyanasundaram, S., et al.: Optimal resource allocation in multi-class networks with user-specified utility functions. Comput. Netw. 38(5), 613–630 (2002)
Savagaonkar, U., et al.: Online pricing for bandwidth provisioning in multi-class networks. Comput. Netw. 44(6), 835–853 (2004)
Chandra, A., Gong, W., Shenoy, P.D.: Dynamic resource allocation for shared data centers using online measurements. In: Jeffay, K., Stoica, I., Wehrle, K. (eds.) IWQoS 2003. LNCS, vol. 2707, pp. 381–400. Springer, Heidelberg (2003)
Knightly, E.W., Shroff, N.B.: Admission control for statistical QoS: theory and practice. IEEE Netw. 13(2), 20–29 (1999)
Lucas, J.M., et al.: Exponentially weighted moving average control schemes: properties and enhancements. Technometrics 32(1), 129 (1990)
Hung, Y., et al.: A measurement based dynamic policy for switched processing systems. In: IEEE International Conference on Communications, pp. 301–306 (2007)
Courcoubetis, C., Weber, R.: Pricing Communication Networks. Wiley, New York (2003)
Hayel, : Optimal measurement-based pricing for an M/M/1 queue. Netw. Spat. Econ. 7(2), 177–195 (2007)
Yeganeh, H., et al.: Optimal resource allocation in ngn services using engineering optimization with linear constraint particle swarm. IJCSNS 8, 238–334 (2008)
Le, D.N.: Optimizing resource allocation to support qos requirements in next generation networks using aco algorithm. IJCSIT 2(5), 931–938 (2012)
Stutzle, T., Ibanez, M.L., Dorigo, M.: A Concise Overview of Application of Ant Colony Optimization. Wiley, New York (2010)
Stutzle, T., Hoos, H.H.: Improving the ant system: a detailed report on the maxmin ant system. Technical report AIDA-96-12, FG Intellektik (1996)
Kallitsis, M.G.: Optimal resource allocation for next generation network services. Ph.D. Dissertation, Raleigh, North Carolina (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Le, DN. (2015). Applied MMAS Algorithm to Optimal Resource Allocation to Support QoS Requirements in NGNs. In: Mumtaz, S., Rodriguez, J., Katz, M., Wang, C., Nascimento, A. (eds) Wireless Internet. WICON 2014. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 146. Springer, Cham. https://doi.org/10.1007/978-3-319-18802-7_29
Download citation
DOI: https://doi.org/10.1007/978-3-319-18802-7_29
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18801-0
Online ISBN: 978-3-319-18802-7
eBook Packages: Computer ScienceComputer Science (R0)