Multi-granularity Decomposition of Componentized Network Applications Based on Weighted Graph Clustering
DOI:
https://doi.org/10.13052/jwe1540-9589.21312Keywords:
componentized network application, weighted graph clustering, density peak clustering, multi-granularity task decompositionAbstract
With the development of mobile communication and network technology, smart network applications are experiencing explosive growth. These applications may consume different types of resources extensively, thus calling for the resource contribution from multiple nodes available in probably different network domains to meet the service quality requirements. Task decomposition is to set the functional components in an application in several groups to form subtasks, which can then be processed in different nodes. This paper focuses on the models and methods that decompose network applications composed of interdependent components into subtasks in different granularity. The proposed model characterizes factors that have important effects on the decomposition, such as dependency level, expected traffic, bandwidth, transmission delay between components, as well as node resources required by the components, and a density peak clustering (DPC) -based decomposition algorithm is proposed to achieve the multi-granularity decomposition. Simulation results validate the effect of the proposed approach on reducing the expected execution delay and balancing the computing resource demands of subtasks.
Downloads
References
J.X. Liu, Z.H. Xia, “An approach of web service organization using Bayesian network learning”, Journal of Web Engineering, Vol. 16, No. 3&4 (2017) 252–276
X. Larrucea, I. Santamaria, C. Ebert, et al., “Microservices,” IEEE Software, vol. 35, pp. 96–100, June 2018.
S.P. Yi, Z.Z. Tan, Z.L. Guo, P.H. Wen, J. Zhou, et al., “Optimization of manufacturing task decomposition mode in cloud manufacturing service platform,” Computer integrated manufacturing system, vol. 8, pp. 2201–2212, January 2015.
C.Z. Xia and S.L. Song, “Resource scheduling algorithm for hierarchical data grid based on quotient space,” Journal of communications, vol. 6, pp. 146–155, June 2013.
X. Liu, J. Yu, J. Wang, et al., “Resource Allocation with Edge Computing in IoT Networks via Machine Learning,” IEEE Internet of Things Journal, vol. 7, pp. 3415–3426, April 2020.
H. Li, H. Xu, C. Zhou, et al., “Joint Optimization Strategy of Computation Offloading and Resource Allocation in Multi-Access Edge Computing Environment,” IEEE Transactions on Vehicular Technology, vol. 69, pp. 10214–10226, June 2020.
S. E. Mahmoodi, K. Subbalakshmi, and R. N. Uma, “Spectrum-Aware Mobile Computing: Convergence of Cloud Computing and Cognitive Networking,”. Springer International Publishing, 2019.
M.Z. Liu, Q. Wang, et al., “Task decomposition method of cloud manufacturing based on Hierarchical Task Network”, China Mechanical Engineering, vol. 28, pp. 924–930, 2017.
Mohamad Roshanzamir, Maziar Palhang, et al., “Efficiency improvement of genetic network programming by tasks decomposition in different types of environments”, Genetic Programming and Evolvable Machines, 2021: 1–38.
G. Latif, N. Saravanakumar, J. Alghazo, et al., “Scheduling and resources allocation in network traffic using multi-objective multi-user joint traffic engineering,” Wireless Networks, vol. 26, pp. 5951–5963, November 2020.
P. Balakrishnan and C.K. Tham, “Energy-efficient mapping and scheduling of task interaction graphs for code offloading in mobile cloud computing,” 2013 IEEE/ACM 6th International Conference on Utility and Cloud Computing, vol. 23, pp. 34–41, December 2013.
W. Zhang, Y. Wen, D. Wu, et al., “Collaborative task execution in mobile cloud computing under a stochastic wireless channel,” IEEE Transactions on Wireless Communications, vol. 14, pp. 81–93, January 2015.
J. Han, J. Pei, M.Kamber, et al., “Data mining: Concepts and Techniques”, Elsevier, New York, 2011, pp. 228–321.
Y Li, W.J Zhou, H.K Wang. “F-DPC: Fuzzy Neighborhood-based Density Peak Algorithm”, IEEE Access, 2020.
T.N. Tran, K. Drab, M. Daszykowski, et al., “Revised DBSCAN algorithm to cluster data with dense adjacent clusters,” Chemometrics and Intelligent Laboratory Systems, vol. 120, pp. 92–96, January 2013.
M. Ankerst, M.M. Breunig, H. Kriegel, J. Sander, et al., “Optics: ordering points to identify the clustering structure,” Proc ACM Sigmod Rec, vol. 28, pp. 49–60, June 1999.
X.W. Xu, M. Ester, H.P. Kriegel, J. Sander, et al., “A distribution-based clustering algorithm for mining in large spatial databases,” Proceedings of the Fourteenth International Conference on Data Engineering, vol. 10, pp. 324–331, February 1998.
W. Wang, J. Yang, R. Muntz, et al., “STING: a statistical information grid approach to spatial data mining,” VLDB ’97: Proceedings of the 23rd International Conference on Very Large Data Bases, Athens, pp. 186–195, August 1997.
S. L’Yi, B. Ko, D.H. Shin, et al., “XCluSim: a visual analytics tool for interactively comparing multiple clustering results of bioinformatics data,” BMC Bioinformatics, vol. S11–S5, August 2015.
T. Li, H.W. Ge, S.Z. Su, et al., “Density Peaks Clustering Based on Density Adaptive Distance,” Microcomputer, vol. 6, pp. 1347–1352, June 2017.
X.X. Han, “Analysis of Chameleon Algorithm based on K-medoids,” Modern Trade Industry, vol. 34, pp. 195–196, November 2019.
D.S. Sun, Fast graph clustering in large-scale systems based on spectral coarsening, International Journal of Modern Physics B, 2021, 35(09).
H.H. Zhou, Z. Zhang, Q. Zhang, et al., “Density peak clustering combining shared nearest neighbour and shared inverse nearest neighbour”, Journal of China West Normal University, ISSN 1673-5072, CN 51-1699/N, October 2021.
Z.W. Gu, P. Li, X. Lang, et al., “A Multi-Granularity Density Peak Clustering Algorithm Based on Variational Mode Decomposition”, Chinese Journal of Electronics, Vol. 30, No. 4, July 2021.
Z.H. Lv, L. Qiao, A.K. Singh, et al., “Advanced Machine Learning on Cognitive Computing for Human Behavior Analysis,” IEEE Transactions on Computational Social Systems, vol. 10, pp. 1–9, July 2020.
