Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Data frame aggregation method with fault-tolerant function

A technology of aggregation method and fault-tolerant function, which is applied in the field of communication, can solve problems such as inability to restore correctly, high frame loss rate of effective data frames, and inability to restore subframes correctly, so as to improve effective data throughput, improve channel transmission efficiency, and reduce The effect of network frame loss rate

Active Publication Date: 2012-05-09
XIDIAN UNIV
View PDF3 Cites 12 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] The above mechanism provides a simple implementation method for the aggregation of data frames in the data communication network, but this method has deficiencies in fault tolerance performance
For example, when the aggregated frame has a bit error during network transmission and the error bit appears in the i-th subframe length field, when the receiving node splits the upper-layer data frame, it will wrongly determine the data length of the i-th subframe instead of The corresponding subframe cannot be correctly restored; and each subframe after the i-th subframe will be affected and cannot be restored correctly, because the length extraction of each field after the i-th subframe length field will have deviations and this error will Continues until the end of the aggregation frame
Therefore, the fault tolerance performance of the existing data frame aggregation mechanism is poor, resulting in a high frame loss rate of effective data frames, thereby reducing the effective data throughput of the data communication network to a certain extent

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Data frame aggregation method with fault-tolerant function
  • Data frame aggregation method with fault-tolerant function
  • Data frame aggregation method with fault-tolerant function

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0022] Define the maximum frame length of an aggregated frame as 4600 bytes; the type of business data unit carried is an Ethernet frame, and its maximum frame length is 1518 bytes; according to the above conditions, set the subframe header length to 3 bytes accordingly, including 13-bit offset value field and 11-bit length field to ensure that the maximum frame length after aggregation 4600 does not exceed 2 13 , the maximum length of each subframe 1518 does not exceed 2 11 ;Suppose the sending node generates an 8-byte header field and a 4-byte tail field for the aggregation frame, wherein the header field consists of a 2-byte address field, a 2-byte length field, a 1-byte type field, and a 1-byte The subframe number field and the 2-byte header check field are sequentially composed. The header check field adopts a 16-bit inverse code summation check method, and the tail field performs a 32-bit cyclic redundancy check on the aggregated frame; definition The delay threshold se...

Embodiment 2

[0045] Define the maximum frame length of the aggregated frame as 4600 bytes; the type of service data unit carried is IP packet, and its maximum length is limited to 1500 bytes; according to the above conditions, the length of the subframe header is set to 3 bytes accordingly, including 13-bit offset value field and 11-bit length field to ensure that the maximum frame length after aggregation 4600 does not exceed 2 13 , the maximum length of each subframe is 1500 and does not exceed 2 11 ;Suppose the sending node generates an 8-byte header field and a 4-byte tail field for the aggregation frame, wherein the header field consists of a 2-byte address field, a 2-byte length field, a 1-byte type field, and a 1-byte The subframe number field and the 2-byte header check field are sequentially composed. The header check field adopts a 16-bit cyclic redundancy check method, and the tail field performs a 32-bit cyclic redundancy check on the aggregated frame; define the sending The d...

Embodiment 3

[0068] Define the maximum frame length of the aggregated frame as 4600 bytes; the type of service data unit carried is ATM cell, and its length is fixed at 53 bytes; according to the above conditions, the length of the subframe header is set to 3 bytes accordingly, including 18-bit offset value field and 6-bit length field to ensure that the maximum frame length 4600 after aggregation does not exceed 218 , each subframe length 53 does not exceed 2 6 ;Suppose the sending node generates an 8-byte header field and a 4-byte tail field for the aggregation frame, wherein the header field consists of a 2-byte address field, a 2-byte length field, a 1-byte type field, and a 1-byte The subframe number field and the 2-byte header check field are sequentially composed. The header check field adopts a 16-bit cyclic redundancy check method, and the tail field performs a 32-bit cyclic redundancy check on the aggregated frame; define the sending The delay threshold value set at the node is 1...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a data frame aggregation method with a fault-tolerant function. The method mainly solves the problem of poor fault-tolerant performance caused by irrational frame structures in the existing data frame aggregation mechanism. The implementation process of the method is as follows: a transmitting node aggregates data frames when aggregation conditions are satisfied; the transmitting node generates a sub-frame header, comprising an offset value domain and a length domain, for each sub-frame, and combines each sub-frame header into a first part of the load; the transmitting node orderly stores the each combined sub-frame header, a filling domain and each sub-frame to form the complete load; the transmitting node adds a header field and a tail field for the load, and then transmits the aggregated frames; and a receiving node executes disassembly operations after receiving the aggregated frames, reads corresponding sub-frames according to the offset valve domain and the length domain of each sub-frame header, and forwards the sub-frames to an upper layer. The method effectively improves the fault-tolerant performance of the data frame aggregation mechanism for transmission error codes while improving the channel transmission efficiency, so that the method can be widely used in various data communication networks.

Description

technical field [0001] The invention belongs to the technical field of communication, relates to a data frame aggregation method, and can be applied to various data communication networks. Background technique [0002] In a data communication network, in order to improve channel utilization, it is usually necessary to adopt an aggregation / splitting mechanism on a certain link in the network, or between a sending node and a receiving node, that is, at the sending node, multiple Data frames are aggregated and split accordingly at the receiving node. Aggregating data frames at the sending node can effectively improve channel transmission efficiency: when there are a large number of data frames to be transmitted at the sending node, especially when the length of these data frames is relatively short, if the data frame aggregation mechanism is not used for transmission, Each data frame must be individually encapsulated, resulting in low transmission efficiency of valid data; at ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): H04L1/00
Inventor 张冰邱智亮陈雅菲赵伟伟胡广黄粉张平平郑昱姚珲何世辉
Owner XIDIAN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com