论文部分内容阅读
在对Web网络数据进行调度的过程中,若网络时间信息中其它介质访问层通过竞争共享信道,则同一信道在传输数据时将造成干扰。针对上述弊端,提出一种基于密集小区域碰撞算法的Web网络数据调度方法,将POMDP模型作为Web网络数据调度模型,对上述模型的状态空间、状态转移概率以及性能函数进行了详细的分析。对信道特征进行采集,通过Web网络信道中的属性区域对Web网络数据进行分类,确定Web信道中是否有拥塞现象发生。基于Web网络数据属性区域的划分结果,对Web网络数据区域中的二维坐标(x,y)进行计算。若在一个信道中数据出现碰撞,则该位置将处于同一二维区域中。对位置进行计算,获取冲突点的位置,实现Web网络数据中密集小区域碰撞的分析。仿真实验结果表明,所提方法的平均吞吐量、无用包率及服务器负载率均优于传统方法,具有很高的实用性。
In the process of scheduling Web network data, if other media access layers in the network time information share the channel through competition, the same channel will cause interference when transmitting data. In view of the above drawbacks, this paper proposes a data scheduling method based on dense small-area collision algorithm in Web network. POMDP model is used as data scheduling model in Web. The state space, state transition probability and performance function of the model are analyzed in detail. The channel characteristics are collected, and the Web network data is classified according to the attribute area in the Web network channel to determine whether there is congestion in the Web channel. The two-dimensional coordinates (x, y) in the web data area are calculated based on the partition result of the data area of the web network. If there is a collision of data in one channel, the location will be in the same two-dimensional area. Calculate the position, get the position of the collision point, and realize the analysis of dense small area collisions in Web data. The simulation results show that the proposed method is superior to the traditional methods in terms of average throughput, unwanted packet rate and server load rate, and has high practicability.