论文部分内容阅读
面对内外众多客户对Ｗｅｂ服务信息的频繁访问请求，容易形成访问瓶颈，须有效合理地组织、分配和规划内部网信息资源，以达到减轻服务器的负担；为避免对同一信息过多的重复的访问，引起通信费用不必要的浪费和信道负担的增加，因此必须设法降低访问费用，提高Ｉｎｔｒａｎｅｔ网使用效率．本文通过引入集合划分问题（ＳｅｔＰａｒｔｉｔｉｏｎｉｎｇＰｒｏｂｌｅｍ，ＳＰＰ）和背包问题（ＫＮＡＰＳＡＣＫ）数学模型及相应算法，定量地解决了“访问瓶颈”和“通信费用”两个关于互联网通信中的问题，并为解决类似问题开辟了一条新的途径．
Faced with frequent requests for access to Web service information by many customers both inside and outside the country, it is easy to form an access bottleneck. Organizational, allocation and planning of intranet information resources should be effectively and reasonably carried out in order to reduce the burden on the server. In order to avoid excessive duplication of the same information Access, causing unnecessary waste of communication costs and increased channel burden, it must try to reduce access costs and improve Intranet network efficiency. In this paper, by introducing the mathematical model of SetPartitioningProblem (SPP) and KNAPSACK (Backpack Problem) and corresponding algorithms, this paper solves the problems of “access bottleneck” and “communication fee” in Internet communication quantitatively and solves the similar problems Opened up a new way.