Gao Lei,Zhang Deyun,Zhao Dongping,Zheng Weibin
(School of Electronics and Information Engineering,Xi'an Jiaotong University,Xi'an 710049,China)
Abstract:The method of adaptive hash mapping of weak hop integrity £¨AHMWHI£© was proposed.The main idea is as follows:hash mapping is performed in the datagram during verifying cycle time,i.e.caching the big datagram,and verifying the integrity of other datagram;the state information of datagram sequence and verification information of the big datagram are sent to the next hop router for verifying when the hash table collision occurs;the length of hash table is adaptively adjusted by current network throughput to make the delay of the big datagram within verifying cycle satisfying the expectation value.Theoretic analysis and experiments demonstrate that the problem that the big datagram packeted with X bytes verification can't be sent is solved by AHMWHI;the data replay and lose testing functions in weak integrity verification are improved.In demonstrations,the average delay of most big datagram is less than 0.9 ms while the expectation value is set to 5 ms£®
Keywords:hop integrity;adaptive hash;integrity verifying