Abstract
The assignment problem on networks is a fundamental problem associated with various methods such as distributed computing and data delivery. In particular, it is essential for data delivery to assign resources (e.g., virtual servers, data replicas, and storages) to network nodes on the basis of the location of users. Today’s communication networks (e.g., the Internet) are large-scale and wide-area, and their states always fluctuate. Hence, assignment methods for data delivery should have scalability, robustness, and adaptability. In this paper, we discuss an autonomous adaptive mechanism for the method proposed in the previous work to gain robustness for the severe fluctuation in the demand amount of users. Through simulation results, we show that the autonomous adaptive mechanism is effective for changing the demand amount of users.
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
Eugene, L.L.: The quadratic assignment problem. Manag. Sci. 9(4), 586–599 (1963)
Loiola, E.M., de Abreu, N.M.M., Boaventura-Netto, P.O., Hahn, P., Querido, T.: A survey for the quadratic assignment problem. Eur. J. Oper. Res. 176(2), 657–690 (2007)
Sourlas, V., Flegkas, P., Paschos, G.S., Katsaros, D., Tassiulas, L.: Storage planning and replica assignment in content-centric publish/subscribe networks. Comput. Netw. 55(18), 4021–4032 (2011)
Wang, Y., Li, Z., Tyson, G., Uhlig, S., Xie, G.: Optimal cache allocation for content-centric networking. In: Proceedings of the 21st IEEE International Conference on Network Protocols (ICNP 2013), pp. 1–7, October 2013
Mai, V.S., Ioannidis, S., Pesavento, D., Benmohamed, L.: Optimal cache allocation under network-wide capacity constraint. In: Proceedings of the 8th International Conference on Computing, Networking and Communications (ICNC 2019), pp. 816–820, April 2019
Kashimoto, T., Toyoda, F., Sakumoto, Y.: A study on designing autonomous decentralized method of user-aware resource assignment in large-scale and wide-area networks. In: Barolli, L., Chen, H.-C., Miwa, H. (eds.) INCoS 2021. LNNS, vol. 312, pp. 169–182. Springer, Cham (2022). https://doi.org/10.1007/978-3-030-84910-8_18
Sakumoto, Y., Aida, M., Shimonishi, H.: Adaptive function to ensure robustness of MCMC-based autonomous decentralized control mechanism against changing environment. J. Inf. Process. (JIP) 24(6), 887–896 (2016)
Acknowledgement
This work was supported by JSPS KAKENHI Grant Number 19K11927.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Tatebe, K., Sakumoto, Y. (2022). A Study on an Autonomous Adaptive Mechanism for the Robustness of the User’s Location-Aware Resource Assignment Against Demand Fluctuation. In: Barolli, L., Miwa, H. (eds) Advances in Intelligent Networking and Collaborative Systems. INCoS 2022. Lecture Notes in Networks and Systems, vol 527. Springer, Cham. https://doi.org/10.1007/978-3-031-14627-5_18
Download citation
DOI: https://doi.org/10.1007/978-3-031-14627-5_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-14626-8
Online ISBN: 978-3-031-14627-5
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)