Abstract
The assignment problem on networks is a fundamental problem associated with various methods such as distributed computing and data delivery. Especially, in order to perform efficient data delivery, the necessary resources should be assigned near users while accomplishing the high fairness among users. In order to accomplish such a user-aware resource assignment on large-scale and wide-area networks, an autonomous decentralized method is needed because of the computational complexity and the difficulty to gather information from the whole of them. In this paper, we design the autonomous decentralized method of the user-aware resource assignment without the global information of networks, and investigate the performance of the designed method through the experiment. From the results, we show that the designed method accomplishes the same performance of the centralized method using the global information.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Eugene, L.L.: The quadratic assignment problem. Manage. Sci. 9(4), 586–599 (1963)
Eliane, M.L., de Areu, N.M.M., Boaventura-Netto, P.O., Peter, H., Tania, Q.: A survey for the quadratic assignment problem. Eur. J. Oper. Res. 176(2), 657–690 (2007)
Yunhao, L., Li, X., Lionel, N.: Building a scalable bipartite P2P overlay network. IEEE Trans. Parallel Distrib. Syst. 18(9), 1296–1306 (2007)
Yonggong, W., Zhenyu, L., Gareth, T., Steve, U., Gaogang, X.: 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 10th IEEE International Conference on Computing, Networking and Communications, ICNC 2019, pp. 816–820 (February 2019)
Haozhe, W., Jia, H., Geyong, M., Wang, M., Nektarios, G.: Cost-aware optimisation of cache allocation for information-centric networking. In: Proceedings of the 60th IEEE Global Communications Conference, GLOBECOM 2017, pp. 1–6 (December 2017)
Vasilis, S., Paris, F., Georgios, S.P., Dimitrios, K., Leandros, T.: Storage planning and replica assignment in content-centric publish/subscribe networks. Comput. Netw. 55(18), 4021–4032 (2011)
Minghua, C., Soung, C.L., Ziyu, S., Kai, C.: Markov approximation for combinatorial network optimization. IEEE Trans. Inf. Theory 59(10), 6301–6327 (2013)
Yusuke, S., Masaki, A., Hideyuki, S.: Autonomous decentralized control for indirectly controlling system performance variable of large-scale and wide-area networks. IEICE Trans. Commun. E98-B, 2248–2258 (2015)
Acknowledgements
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
Kashimoto, T., Toyoda, F., Sakumoto, Y. (2022). A Study on Designing Autonomous Decentralized Method of User-Aware Resource Assignment in Large-Scale and Wide-Area Networks. In: Barolli, L., Chen, HC., Miwa, H. (eds) Advances in Intelligent Networking and Collaborative Systems. INCoS 2021. Lecture Notes in Networks and Systems, vol 312. Springer, Cham. https://doi.org/10.1007/978-3-030-84910-8_18
Download citation
DOI: https://doi.org/10.1007/978-3-030-84910-8_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-84909-2
Online ISBN: 978-3-030-84910-8
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)