The dynamic modeling algorithm of information organization and allocation problem on internet communications

• Published in: Wuhan University journal of natural sciences Vol. 8; no. 1; pp. 265 - 268
• Main Authors: Yuan-xiang, Li, Dong-mei, Liu
• Format: Journal Article
• Language: English
• Published: Heidelberg Springer Nature B.V 01.03.2003
• Subjects: Algorithms; Computer applications; Dynamic models; Genetic algorithms; Information resources; Internet; Servers
• ISSN: 1007-1202; 1993-4998
• DOI: 10.1007/BF02899491

With the frequent information accesses from users to the Internet, it is important to organize and allocate information resources properly on different web servers. This paper considers the following problem: Due to the capacity limitation of each single web server, it is impossible to put all information resources on one web server. Hence it is an important problem to put them on several different servers such as: (1) the amount of information resources assigned on any server is less than its capacity; (2) the access bottleneck can be avoided. In order to solve the problem in which the access frequency is variable. this paper proposes a dynamic optimal modeling. Based on the computational complexity results, the paper further focuses on the genetic algorithm for solving the dynamic problem. Finally we give the simulation results and conclusions.