【摘要】 面对内外众多客户对Web服务信息的频繁访问请求,容易形成访问瓶颈,需有效合理地组织、分配和规划内部网(Intranet)信息资源,以减轻服务器的负担;为避免过多地重复访问同一信息而浪费通信费用和增加信道负担,必须设法降低访问费用,提高Intranet网的使用效率。通过引入集合划分问题(setpartitioningproblem,SPP)和背包问题(KNAPSACK)的数学模型及相应算法,定量地解决了互联网通信中访问瓶颈和通信费用的问题,并为解决类似问题开辟了一条新的途径。更多还原

【Abstract】 On account of the frequent information access from the users by the Intranet, the Web servers sometimes are overburdened. Consequently the access bottleneck occurs at times. It is necessary to organize and allocate the Intranet information resources properly on the Web servers. In order to avoid too many unnecessary accesses to the same extranet information resources from the Intranet, some ways should be found to reduce the communication cost and channel burdens, and to enhance the efficiency of Intranet. Two problems are put forwand, i.e. access bottleneck and communication cost of Internet communications. And then two mathematical models and their algorithms——set partitioning problem(SPP) and KNAPSACK problem are introduced to construct the models of the two problems mentioned above, and solve these problems successfully. Moreover, a new idea is provided for solving the similar problem of distributed systems.更多还原