Ranking method of virtual concatenation group member

Abstract

The invention discloses a sorting method for virtual concatenation group members which comprises: step S502 is that the state information and the sequence number SQ of a virtual container channel are stored by the channel number and the multiframe number of the virtual container channel and a sink end in a virtual concatenation group; step S504 is that the stored channel number of the virtual container channel is utilized to obtain the SQ of the virtual container channel and a corresponding channel state and the virtual container channel is carried out sequencing by the obtained SQ so as to obtain a first relation table consisting of the SQ from small to big and the corresponding channel number thereof; step S506 is that the channel number and the channel state in the first relation table is traversed from the smallest SQ to the largest SQ in an order of from small to large in the first relation table, the traversed channel the state information of which is loading effective data is accumulated from the smallest SQ and the new SQ obtained by accumulation is corresponding to the channel number and the state information of the currently traversed channels so as to obtain the new SQ and the channel number of the channel, the state information of which is loading the effective data in the first relation table, and a second relation table of the state information.

Description

Technical field [0001] The present invention relates to the field of communications, and in particular, to a method for sorting virtual concatenated group members. Background technique [0002] For the synchronous digital hierarchy (SDH), during the transmission of Ethernet data in the SDH network, the virtual container VC is used as the unit to load the Ethernet data stream. The data stream is mapped into the Cx container of SDH (x=12, 3, 4 is the level of the container), the Cx container adds overhead, and is combined into a virtual container VC for transmission in the SDH network. Generally, the capacity of a C-x container is constant. For example, common containers include: C-4, which is 149.760 Mbit / s; C-3, which is 48.384 Mbit / s; and C-12, which is 2.176 Mbit / s. [0003] Generally, in the process of data service transmission through the SDH network, the data flow rate does not match the capacity of the C container in SDH, and multiple VC channels need to be bundled together...

AI Technical Summary

Problems solved by technology

[0014] The present invention is made in consideration of the above-mentioned problems. The main purpose of the present invention is to provide a sorting scheme for virtual concatenation group members to solve the virtual concatenation caused by deleting virtual container channel members at the sink end in the related art. The problem of discontinuous group serial numbers

Images