分析了路由器在大报文流量下所面临的接收活锁问题和已有解决方法。
This paper analyses the receiving livelock problem faced by router at high packets arriving rate and its existing solutions.
报文的路由选择和各条链路的容量及流量分配(CFA)问题是计算机通信网络中性能优化的两个重要方面。
Route selection of the messages and capacity and flow assignment (CFA) of every link are two important factors on performance optimization in computer communication networks.
该模型采用报文分批处理的思想引入了两级缓冲区结构，使得缓存报文和流量统计两个过程同时进行。
Introducing the idea of processing in batches, the model designd two-stage buffer structure to conduct buffering packets and measuring traffic simultaneously.
提出了从抽样后的报文中估计一定时间刻度原始流量的大小、估计原始报文长度与协议分布的方法。
It offers the way of estimating the primitive traffic at some time and the length of primitive message aod the way of protocol distribution from the message sampled.
由于采用了基于事件的报文交换方式，使得 楼宇控制器之间以较小流量占用而获得信息的快速交换，保证了控制的实时 性。
Thanks to the event based packet exchange, the information exchange is quick with small flow rate occupation between the BA controllers, which guarantees the real time capability of the control.
报文的路由选择和各条链路的容量及流量分配(CFA)问题是计算机通信网络中性能优化的两个重要方面。
The problem of capacity and flow assignment (CFA) in computer communication networks is an extremely complex network optimization problem.
并使用该系统对实际的网络报文进行了初步的流量分析。
And the traffic analysis of real network traffic based on this system was briefly introduced.
协议的报文刷新机制会产生大量的报文，给网络带来很大的突发流量。
The OSPF (open shortest path first) refresh mechanism can cause periodic bursts of traffic on networks.
协议的报文刷新机制会产生大量的报文，给网络带来很大的突发流量。
The OSPF (open shortest path first) refresh mechanism can cause periodic bursts of traffic on networks.
应用推荐