Research on Big Datagram Problem of Hop Integrity
Zheng Weibin · Jisuanji gongcheng · 2005
The problem that the big datagram whose size is between MTU?X+1 and MTU can’t be sent with X bytes digest is solved as theadaptive Hash mapping of weak hop integrity (AHMWHI) is proposed. Furthermore, data replay detection and losing detection function areimproved in AHMWHI. The performance of AHMWHI is analysed and the experiments show that the average delay of big datagram is little.