English translation for "分组长度"

block length

Related Translations:

随机分组:  blind assignment

分组间隔:  class intervalinterval of grouping

分组终结:  block end

分组网络:  pbn packet based network

分组接口:  packet interface

分组排序:  ps packet sequencing

分组数据:  group datagrouped dataintegrated data

分组规则:  rule of classification

分组记录:  grouped record

诊断分组:  clinical grouping

Example Sentences:

	1.	Impact of ip packet length distribution on self - similarity of traffic in obs networks 分组长度分布对业务流自相似性的影响
	2.	The issue about optimal udp packet size for mobile ad hoc networks when transmitting cbr traffic is studied 基于场景，用仿真方法研究网络传输cbr业务时的最佳udp分组长度问题。
	3.	The simulation results show that the type of routing protocols , traffic intension and the ber of the wireless channel are all important factors affecting the optimal udp packet size 研究了aodv和dsr两种路由协议，业务强度以及信道误码对最佳udp分组长度的影响。
	4.	We also compare the detailed performance with the two protocols in different statistic period , node number , packets size and packet interval . the conclusion show adaptive p - persistent having a better performance 同时从统计周期、站点数、分组长度和分组突发间隔等角度对比了两种协议的性能，得到的结果显示出自适应p -持续csma / cd较好的性能。
	5.	This scheme is based on the elliptic curve discrete logarithm , which is one of the mathematic puzzles . compared with other cipher systems , it has shorter length of secret key and grouping in the same security intensity 该体制是建立在椭圆曲线离散对数问题这一数学难题之上的，和其它密码体制相比较而言在同等安全强度下具有小得多的秘钥长度及分组长度。
	6.	Starting from the intensely active area of research in mobile ad hoc networks , multiple access control ( mac ) protocols , performance comparison of routing protocols , cost - efficient qos routing protocol for mobile ad hoc networks and the issue about the optimal udp packet size are studied in this paper 本文从无线adhoc网络研究领域中的研究热点出发，分别研究了多址接入技术、不同路由协议的性能分析、高效利用能源的qos路由协议以及最佳udp分组长度问题。
	7.	You can choose different encipher algorithms according to requirement . aes is a symmetric block cipher that can process data blocks of 128 bits , using cipher keys with lengths of 128 , 192and 256 bits . because the length of block and key has been expanded , security has been enhanced Aes ( advancedencryptionstandard )是fip ( federalinformationprocessingstandardspublication )在2001年6月发布的草案，它是分组加密算法，消息分组为128bit ，有三种密钥长度128bit 、 192bit 、 256bit ，由于分组长度和密钥长度加长使得安全性大大的提高，它有望成为21世纪的加密标准。
	8.	When studying the network performance , flow control and resource provisioning of communication networks , traffic model plays a very important role . the recent studies show that the date network traffic is self - similar , so the markovian model , which describes telephone networks accurately , is not suitable for date networks . the self - similarity of the network traffic has severe impact on flow control and queuing analysis in date networks , therefore it has received significant attention . in this paper , g m 1 queuing model is used to analyze the queuing performance of generic variable length packet networks for the first time . the self - similar traffic is generated by multiplexing a large set of independent pareto heavy - tailed interarrival on off sources . the simulation results show that the heavy - tailed traffic results in queuing performance deterioration for variable length packet networks , which is in accordance with the analytical results for atm switches 业务量的自相似特征显著影响网络的流量控制与排队分析，已经引起人们的极大重视。采用g m 1排队模型对分组长度可变的网络的排队性能进行了分析和仿真，其中自相似业务量是通过叠加大量独立的到达间隔为pareto重尾分布的on off源来生成的。仿真结果表明，自相似业务量导致网络的排队性能劣化，这与有关文献对atm交换的分析结果一致。
	9.	In 2001 , rijndael is declared to be the new aes . gilbert h and minier m presented collision attack on rijndael whose plaintext block length is 128 bits , which can attack 7 round rijndael - 192 / 256 with attack complexity 2140 . in this paper we analyse collision attack on rijndael and make use of the shortcomings of rijndael ’ s key schedule to improve collision attack . the improvement makes 7 rounds of rijndael - 128 be broken successfully and attack complexity is 2124 Gilberth和minierm针对明文分组长度为128比特的rijndael提出了碰撞攻击,可以攻击7轮rijndael - 192 / 256 ,攻击复杂度为2140 。我们分析了对rijndael实施的碰撞攻击,并根据rijndael密钥扩展算法的特点,对碰撞攻击的算法进行了改进,使得该攻击可以攻击7轮rijndael - 128 ,攻击复杂度为2124 ,低于穷尽攻击。

Similar Words：

"分组插入率" English translation, "分组差错概率" English translation, "分组差错率" English translation, "分组拆装器" English translation, "分组拆装设备" English translation, "分组长度, 块长" English translation, "分组长度选择" English translation, "分组沉淀" English translation, "分组称重法" English translation, "分组成本制" English translation