EP2533440B1 - Verfahren und vorrichtung zur sortierung der elemente mehrerer virtueller verknüpfungsgruppen - Google Patents

Verfahren und vorrichtung zur sortierung der elemente mehrerer virtueller verknüpfungsgruppen Download PDF

Info

Publication number
EP2533440B1
EP2533440B1 EP11823003.6A EP11823003A EP2533440B1 EP 2533440 B1 EP2533440 B1 EP 2533440B1 EP 11823003 A EP11823003 A EP 11823003A EP 2533440 B1 EP2533440 B1 EP 2533440B1
Authority
EP
European Patent Office
Prior art keywords
sequencing
time
members
vcgs
vcg
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
EP11823003.6A
Other languages
English (en)
French (fr)
Other versions
EP2533440A4 (de
EP2533440A1 (de
Inventor
Sidong Zhang
Jian Cheng
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
ZTE Corp
Original Assignee
ZTE Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by ZTE Corp filed Critical ZTE Corp
Publication of EP2533440A1 publication Critical patent/EP2533440A1/de
Publication of EP2533440A4 publication Critical patent/EP2533440A4/de
Application granted granted Critical
Publication of EP2533440B1 publication Critical patent/EP2533440B1/de
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J3/00—Time-division multiplex systems
    • H04J3/16—Time-division multiplex systems in which the time allocation to individual channels within a transmission cycle is variable, e.g. to accommodate varying complexity of signals, to vary number of channels transmitted
    • H04J3/1605—Fixed allocated frame structures
    • H04J3/1611—Synchronous digital hierarchy [SDH] or SONET
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J2203/00—Aspects of optical multiplex systems other than those covered by H04J14/05 and H04J14/07
    • H04J2203/0001—Provisions for broadband connections in integrated services digital network using frames of the Optical Transport Network [OTN] or using synchronous transfer mode [STM], e.g. SONET, SDH
    • H04J2203/0089—Multiplexing, e.g. coding, scrambling, SONET
    • H04J2203/0094—Virtual Concatenation

Definitions

  • the present invention relates to the virtual concatenation technology in the field of optical communications, and more particularly, to sequencing of members in LCAS processing in the case of a plurality of VCGs.
  • Synchronous Digital Hierarchy (SDH) system When a Synchronous Digital Hierarchy (SDH) system bears services, different levels of transfer rates corresponding to different levels of Synchronous Transfer Modules (STM) is shown in FIG. 1 .
  • SDH Synchronous Digital Hierarchy
  • STM Synchronous Transfer Modules
  • the concatenation technology which is divided into contiguous concatenation and virtual concatenation, can be used to dynamically adjust bandwidth of transmission services.
  • adjacent C-n is cascaded into C-n-XC for transmission as a whole structure in the same STM-N (a frame structure of a SDH signal, the ITU-T specifies that frames of STM-N uses a rectangular block structure taking byte as a unit, which is a block frame structure of 9rows ⁇ 270 ⁇ Ncolumns, as shown in FIG.2 ).
  • STM-N a frame structure of a SDH signal
  • the ITU-T specifies that frames of STM-N uses a rectangular block structure taking byte as a unit, which is a block frame structure of 9rows ⁇ 270 ⁇ Ncolumns, as shown in FIG.2 ).
  • contiguous bandwidth must be maintained in the entire transmission process. This technique requires that all network elements in the network which are passed through support processing of contiguous concatenation, so its application is limited.
  • multiple adjacent or non-adjacent small virtual containers are multiplexed into a relatively large virtual container, and these relatively small virtual containers are independent of each other in the transmission process and are recombined into an adjacent bandwidth at an end point of the transmission, as shown in a schematic diagram of VC-4-Xv virtual concatenation groups of FIG. 3 .
  • Only network elements at the beginning and end of a channel are required to support a virtual concatenation function, and there is no such requirement for intermediate network elements, therefore, the virtual concatenation has a more loose application environment and is also easy to generalize.
  • each of the mutually independent containers has a member serial number during the transmission to identify the order in which the containers loads data streams at a source end.
  • the order has been disorganized after the transmission, and member serial numbers are required to be restored at a destination end to restore the data streams.
  • LCAS information including the member serial number of each VCG is transmitted in the current multiframe to indicate state information of the next multiframe. Therefore, in the case where members of a single virtual concatenation group (VCG) are sequenced, the members may be sequenced after the LCAS information is obtained. After the sequencing is completed, the sequence begins to be used when the next multiframe begins.
  • VCG virtual concatenation group
  • a sequencing circuit is required to be configured for each of the VCGs such that the sequencing circuit sequences members of the VCG independently according to its respective LCAS information receiving progress.
  • this will consume more hardware logic resources, especially in the case that the number of VCGs is relatively large.
  • the document EP 1936849 A1 discloses a method for mapping data information (Ethernet) from an input port (PT(#X)) to multiple members of a concatenated group (VCG(#1)).
  • the method includes the steps of receiving configuration information indicating a rule for assigning the input port to the multiple members of the concatenated group, calculating (PU) a write address sequence taking into account the number of the multiple members of the concatenated group and calculating a read address sequence taking into account the configuration information and the write address sequence, storing the read address sequence into an address memory (AM), receiving the data information from the input port, storing at least part of the received data information into a data memory (DM) according to the write address sequence, reading, from the data memory, information of the multiple members of the concatenated group according to the read address sequence stored into the address memory.
  • AM address memory
  • a technical problem to be solved by the present invention is to provide a method and device for sequencing members of multiple VCGs so as to reduce hardware logic resource consumption in the case of multiple VCGs.
  • the present invention discloses a method for sequencing members of multiple virtual concatenation groups (VCG) comprising:
  • calling the member sequencing result of each of the VCGs comprises: when the starting time of a multiframe head in a read direction is reached, reading a member sequencing result of a VCG corresponding to the multiframe, wherein an interval between the starting time of the multiframe head in the read direction and the end time of a sub-frame corresponding to the latest member of the VCG corresponding to the multiframe is equal to the allowed time interval from sequencing to calling the sequencing result.
  • a value of the allowed time interval from sequencing to calling the sequencing result is the larger one of the total time T1 required to sequence the members when the members of all the VCGs arrive simultaneously and the total time T2 required to sequence the members when the members of all the VCGs arrive separately.
  • the total time T1 required to sequence the members when the members of all the VCGs arrive simultaneously is a product of the time required to sequence members of a VCG and the number of supported VCGs.
  • the total time T2 required to sequence the members when the members of all the VCGs arrive separately is a time interval between the time at which a H4 or K4 byte in the last sub-frame in a multiframe of a channel corresponding to the latest member in a VCG and the time at which the next multiframe head of the channel arrives.
  • the arrival time of the latest member in the VCG is the arrival time of a H4 or K4 byte in the latest subframe obtained by comparing the arrival time of the H4 or K4 byte in the last sub-frame in a multiframe corresponding to each member of the VCG.
  • the present invention also discloses a device for sequencing members of multiple virtual concatenation groups (VCG) comprising a queue sequencing module, a sequencing circuit module and a calling module, wherein the queue sequencing module is configured to determine a sequencing queue of all arrived members of the VCGs according to the order of arrival time of the latest member in each of the VCGs; the sequencing circuit module is configured to sequence members of each of the VCGs in the sequencing queue in turn; and the calling module is configured to call a member sequencing result of each of the VCGs when the time of calling the member sequencing result of each of the VCGs is reached, an interval between the time of calling the member sequencing result of each of the VCGs and the time of starting sequencing of the members of each of the VCGs being greater than or equal to a preset allowed time interval from sequencing to calling the sequencing result.
  • VCG virtual concatenation groups
  • the calling module when the starting time of a multiframe head in a read direction is reached, reads a member sequencing result of a VCG corresponding to the multiframe, wherein an interval between the starting time of the multiframe head in the read direction and the end time of a sub-frame corresponding to the latest member of the VCG corresponding to the multiframe is equal to the allowed time interval from sequencing to calling the sequencing result.
  • a value of the allowed time interval from sequencing to calling the sequencing result is the larger one of the total time T1 required to sequence the members when the members of all the VCGs arrive simultaneously and the total time T2 required to sequence the members when the members of all the VCGs arrive separately.
  • the total time T1 required to sequence the members when the members of all the VCGs arrive simultaneously is a product of the time required to sequence members of a VCG and the number of supported VCGs.
  • the total time T2 required to sequence the members when the members of all the VCGs arrive separately is a time interval between the time at which a H4 or K4 byte in the last sub-frame in a multiframe of a channel corresponding to the latest member in a VCG and the time at which the next multiframe head of the channel arrives.
  • the arrival time of the latest member in the VCG is the arrival time of a H4 or K4 byte in the latest subframe obtained by comparing the arrival time of the H4 or K4 byte in the last sub-frame in a multiframe corresponding to each member of the VCG.
  • the technical scheme of the present invention can implement effectively sequencing members in multiple VCGs through a sequencing circuit, thereby significantly reducing the logical resource consumption.
  • a device for sequencing members of multiple virtual concatenation groups comprises a queue sequencing module, a sequencing circuit module and a calling module.
  • the queue sequencing module is configured to determine a sequencing queue of all arrived members of the VCGs according to the order of arrival time of the latest member in each of the VCGs.
  • the arrival time of the latest member in the VCG is the arrival time of a H4 or K4 byte in the latest subframe obtained by comparing the arrival time of the H4 or K4 byte in the last sub-frame in a multiframe corresponding to each member of the VCG.
  • the sequencing circuit module is configured to sequence members of each of the VCGs in the sequencing queue in turn.
  • the calling module is configured to call a member sequencing result of each of the VCGs when the time of calling the member sequencing result of each of the VCGs is reached, an interval between the time of calling the member sequencing result of each of the VCGs and the time of starting sequencing of the members of each of the VCGs being greater than or equal to a preset allowed time interval from sequencing to calling the sequencing result.
  • the calling module when the starting time of a multiframe head in a read direction is reached, reads a member sequencing result of a VCG corresponding to the multiframe, wherein an interval between the starting time of the multiframe head in the read direction and the end time of a sub-frame corresponding to the latest member of the VCG corresponding to the multiframe is equal to the allowed time interval from sequencing to calling the sequencing result.
  • a value of the allowed time interval from sequencing to calling the sequencing result is the larger one of the total time T1 required to sequence the members when the members of all the VCGs arrive simultaneously and the total time T2 required to sequence the members when the members of all the VCGs arrive separately.
  • the total time T1 required to sequence the members when the members of all the VCGs arrive simultaneously is a product of the time required to sequence members of a VCG and the number of supported VCGs.
  • the total time T2 required to sequence the members when the members of all the VCGs arrive separately is a time interval between the time at which a H4 or K4 byte in the last sub-frame in a multiframe of a channel corresponding to the latest member in a VCG and the time at which the next multiframe head of the channel arrives.
  • the k virtual concatenation groups to be sequenced are VCG1, VCG2, ising, VCGk, as shown in FIG. 4 .
  • a member in each virtual concatenation group has two attributes, one is VC (channel number), and the other is member serial number. For example, in FIG.
  • VCG # 1 there are four members in VCG # 1, VC channel numbers corresponding to VCG #1 are 1, 2, 3 and 4 respectively, the member serial number corresponding to each VC channel is 0, 3, 2, 1 respectively; there are 5 members in VCG #2, VC channel number corresponding to VCG #2 are 5, 6, 7, 8, 9 respectively, and the member serial number corresponding to each VC channel is 3, 2, 4, 1, 0 respectively; ......; and there are three members in VCG #k, VC channel numbers corresponding to VCG #k are i-2, i-1, i respectively, the member sequence number corresponding to each VC channel is 0, 2, 1 respectively.
  • the member serial number is virtual concatenation information sent by the source end, and high-order virtual concatenation is stored in a H4 byte, while low-order virtual concatenation is stored in a K4 byte.
  • the process is shown in FIG. 5 and comprises the following steps.
  • a destination end extracts and stores sequence number (SQ) information of each member of the VCGs.
  • a virtual concatenation recovery module at the destination end extracts information of the H4 or K4 byte in a multiframe of each channel to acquire a member serial number to which each VC channel belongs, and stores the information into a RAM for reading at the beginning of sequencing.
  • the member serial numbers 0, 3, 2, 1 of the VC channels 1, 2, 3, 4 of VCG #1; the member serial numbers 3, 2, 4, 1, 0 of the VC channels 5, 6, 7, 8, 9 of VCG #2; ......; and the member serial numbers 0, 2, 1 of the VC channels i-2, i-1, i of VCG #k are extracted.
  • step 502 the destination end finds the last arrived channel in the same VCG (a member corresponding to this channel is the latest member) by comparing offsets in the multiframe and the ultiframe number of each channel in the same VCG as time information.
  • the time at which all the members of each VCG arrive at the destination end is not exactly the same, and has some delay. Only when all H4 or K4 bytes of all channels of one VCG arrive, the member sequence number information of all the channels of the VCG can be extracted to sequence the members. Therefore, the present invention controls the starting time of the sequencing using information of the last arrived channel (that is, the latest member).
  • the destination end might use multiframe information carried by each channel as large time information, and use a byte counter to record offset time information of each member in the multiframe to obtain the arrival time information of the member, and then compare all channels of the same VCG to acquire the last arrived VC channel, to which the member belongs is the latest member.
  • the last arrived VC channel of VCG #1 is 3; the last arrived VC channel of VCG #2 is 5; ising; and the last arrived VC channel of VCG #k is i, see FIG. 4 (a) .
  • step 503 the time at which the H4 or K4 byte in the last sub-frame in the multiframe of the last arrived channel in each VCG arrives (that is, the arrival time information of the latest member in each VCG) is used as a member sequencing permission flag of the VCG, and the VCG is listed into a waiting queue.
  • the VCC can be listed into the sequencing waiting queue according to a queuing strategy (that is, queuing according to the order of the time of determining the member sequencing permission flag of each VCG), and then exit the queue after the sequencing is completed.
  • the queuing order of the k VCGs is 1, ising, k, 2.
  • an allowed time interval from sequencing to calling the sequencing result is determined to ensure that all members of the VCG have been sequenced before the sequencing result is required to be called.
  • a value of the allowed time interval from sequencing to calling the sequencing result is the larger one of the total time T1 required to sequence the members when the members of all the VCGs arrive simultaneously and a time interval T2 between the H4 or K4 position in the last subframe in the multiframe of the last arrived channel in each VCG and the starting time of the next multiframe head. Therefore, when a time interval between the time of calling the sequencing result and the starting time of member sequencing is larger than or equal to the allowed time interval from sequencing to calling the sequencing result, it is ensured that the members of all VCGs have been sequenced before the sequencing result is called.
  • the time Vi required to sequence members of a VCG is calculated, and is multiplied by the number of supported VCGs (k in this embodiment) to obtain a time interval Vi ⁇ k (that is, T1).
  • a time interval between the time at which the H4 or K4 byte in the last sub-frame in the multiframe of the channel corresponding to the latest member in one VCG and the time at which the next multiframe head in the channel arrives is Ti (ie, T2).
  • T2 time interval between the time at which the H4 or K4 byte in the last sub-frame in the multiframe of the channel corresponding to the latest member in one VCG and the time at which the next multiframe head in the channel arrives.
  • the larger one of the time interval Vi ⁇ k and the time interval Ti is used as the allowed time interval from sequencing to calling the sequencing result.
  • the allowed time interval from sequencing to calling the sequencing result is determined, it should be ensured that in the most compact case (that is, the end time of the multiframe of the last arrived channel of each of the VCGs is reached simultaneously or successively) the members have been sequenced before the sequencing result is required to be called.
  • the allowed time interval from sequencing to calling the sequencing result is at least the total time T1 (that is, Vi ⁇ k) required to sequence the members of all the VCGs.
  • Another boundary condition also should be taken into account, where at the time at which the H4 or K4 byte of the last sub-frame in the multiframe of the last arrived channel of a certain VCG arrives, there are no other VCGs waiting to be sequenced (that is, the sequencing of the members of the VCG can be started immediately).
  • the allowed time interval form sequencing to calling the sequencing result is the time interval T2 (that is, Ti) between the time at which the H4 or K4 byte in the last sub-frame in the multiframe of the last arrived channel in the VCG and the time at which the next multiframe head of the earliest arrived channel in the VCG arrives.
  • Vi ⁇ k and Ti are required to be compared to choose the larger one as the allowed time interval from sequencing to calling the sequence result, and the sequencing result will be recalled when the allowed time interval is reached or exceeded.
  • Ti is determined by the frame structure and is a fixed value
  • Vi is determined by the sequencing algorithm
  • k is the number of the VCGs and is determined by the application environment.
  • the starting time of the multiframe head in a read direction might be adjusted to ensure implementation of the allowed time interval from sequencing tocalling the sequencing result, i.e., the starting time of the multiframe head in the read direction is adjusted such that the time interval between the adjusted starting time of the multiframe frame in the read direction and the time at which the H4 or K4 byte of the last sub-frame in the multiframe of the last arrived channel in the VCG equals to the allowed time interval form sequencing to calling the sequencing result.
  • step 505 each VCG is queried and members of the VCGs that have been listed into the waiting queue are sequenced.
  • a sequencing circuit module sequences the members of the VCGs in the waiting queue according to the queuing queue in turn.
  • the order of queuing of the k VCGs is 1, whil, k, 2, then the order of the VCGs to be sequenced in the step 505 is also 1, ising, k, 2.
  • members of VCG #1 are sequenced, and the sequencing result is that five members with SQs being 0, 1, 2, 3, 4 correspond to channels 9, 8, 6, 5, 7 respectively; and so on, and then members of VCG#k are sequenced, and the sequencing result is that three members with SQs being 0, 1, 2 correspond to channels i-2, i, i-1; ......; and finally, members of VCG#2 are sequenced, and the sequencing result is that four members with SQs being 0, 1, 2, 3 correspond to channels 1, 4, 3, 2.
  • step 506 after members of each VCG have sequenced, the sequencing results are stored in a RAM. When the determined allowed time interval from sequencing to calling the sequencing result is reached or exceeded, the sequencing result can be queried.
  • a member order recovery module reads the corresponding VC channel according to the recovered sequence number of each VCG in turn, to complete the whole process of sequencing the members.
  • meeting the determined allowed time interval from sequencing to calling the sequencing result means that: when the starting time of the multiframe head is the read direction is reached, the sequencing result is read, wherein the time interval between the starting time of the multiframe head in the read direction and the time of the end of the multiframe of the last arrived channel of the VCG equals to the allowed time interval from sequencing to calling the sequencing result.
  • determining the allowed time interval from sequencing to calling the sequencing result in step 504 might be any operation prior to step 501 or 502, that is, the allowed time interval from sequencing to calling the sequencing result can also be pre-configured.
  • the technical scheme of the present invention can use a member sequencing circuit to achieve sequencing of members of multiple VCGs, therefore, compared to the prior art, the hardware logic resource consumption in the case of multiple VCGs is decreased greatly.
  • the present invention provides a method and device which can implement sequencing of members of multiple virtual concatenation groups (VCG) by determining a sequencing queue of all arrived members of the VCGs according to the order of arrival time of the latest member in each of the VCGs and sequencing members of each of the VCGs in the sequencing queue in turn.
  • VCG virtual concatenation groups
  • the member sequencing result of each VCG is called, thereby solving the problem of high hardware logic resource consumption in the case of multiple VCGs.
  • the technical scheme of the present invention can use a member sequencing circuit to achieve sequencing of members of multiple VCGs, therefore, compared to the prior art, the hardware logic resource consumption in the case of multiple VCGs is decreased greatly.

Claims (8)

  1. Ein Verfahren zum Sortieren von Elementen von mehreren Gruppen virtueller Verkettung, die nachstehend als VCGs bezeichnet werden, beinhaltend:
    Bestimmen einer Sortierungswarteschlange aller angekommenen Elemente der VCGs gemäß der Reihenfolge der Ankunftszeit des neuesten Elements in jeder der VCGs und Sortieren von Elementen jeder der VCGs in der Sortierungswarteschlange nacheinander; und
    Aufrufen eines Elementensortierungsergebnisses jeder der VCGs, wenn die Zeit des Aufrufens eines Elementensortierungsergebnisses jeder der VCGs erreicht ist, wobei ein Abstand zwischen der Zeit des Aufrufens des Elementensortierungsergebnisses jeder der VCGs und der Zeit des Anfangens des Sortierens der Elemente jeder der VCGs größer als oder gleich einem festgelegten zulässigen Zeitabstand vom Sortieren bis zum Aufrufen des Sortierungsergebnisses ist,
    dadurch gekennzeichnet, dass in dem Schritt des Aufrufens eines Elementensortierungsergebnisses jeder der VCGs, wenn die Zeit des Aufrufens eines Elementensortierungsergebnisses jeder der VCGs erreicht ist,
    wenn die Anfangszeit eines Mehrfachrahmenkopfs in einer Leserichtung erreicht wird, ein Elementensortierungsergebnis einer VCG, die dem Mehrfachrahmen entspricht, gelesen wird, wobei ein Abstand zwischen der Anfangszeit des Mehrfachrahmenkopfs in der Leserichtung und der Endzeit eines Unterrahmens, der dem neuesten Element der VCG entspricht, die dem Mehrfachrahmen entspricht, gleich dem zulässigen Zeitabstand vom Sortieren bis zum Aufrufen des Sortierungsergebnisses ist.
  2. Verfahren gemäß Anspruch 1, wobei
    ein Wert des zulässigen Zeitabstands vom Sortieren bis zum Aufrufen des Sortierungsergebnisses der größere von der Gesamtzeit T1, die zum Sortieren der Elemente erforderlich ist, wenn die Elemente aller VCGs gleichzeitig ankommen, und der Gesamtzeit T2, die zum Sortieren der Elemente erforderlich ist, wenn die Elemente aller VCGs getrennt ankommen, ist.
  3. Verfahren gemäß Anspruch 2, wobei
    die Gesamtzeit T1, die zum Sortieren der Elemente erforderlich ist, wenn die Elemente aller VCGs gleichzeitig ankommen, ein Produkt der Zeit, die zum Sortieren von Elementen einer VCG erforderlich ist, und der Zahl an unterstützten VCGs ist.
  4. Verfahren gemäß Anspruch 2, wobei
    die Gesamtzeit T2, die zum Sortieren der Elemente erforderlich ist, wenn die Elemente aller VCGs getrennt ankommen, ein Zeitabstand zwischen der Zeit, zu der ein H4- oder K4-Byte in dem letzten Unterrahmen in einem Mehrfachrahmen eines Kanals, der dem neuesten Element in einer VCG entspricht, ankommt, und der Zeit, zu der der nächste Mehrfachrahmenkopf des Kanals ankommt, ist.
  5. Verfahren gemäß Anspruch 3 oder 4, wobei
    die Ankunftszeit des neuesten Elements in der VCG die Ankunftszeit eines H4- oder K4-Bytes in dem neuesten Unterrahmen ist, die durch Vergleichen der Ankunftszeit des H4- oder K4-Bytes in dem letzten Unterrahmen in einem Mehrfachrahmen, der jedem Element der VCG entspricht, erhalten wird.
  6. Eine Vorrichtung zum Sortieren von Elementen von mehreren Gruppen virtueller Verkettung, die nachstehend als VCGs bezeichnet werden, beinhaltend ein Warteschlangensortierungsmodul, ein Sortierungsschaltungsmodul und ein Aufrufmodul, wobei
    das Warteschlangensortierungsmodul konfiguriert ist, um eine Sortierungswarteschlange aller angekommenen Elemente der VCGs gemäß der Reihenfolge der Ankunftszeit des neuesten Elements in jeder der VCGs zu bestimmen; das Sortierungsschaltungsmodul konfiguriert ist, um Elemente jeder der VCGs in der Sortierungswarteschlange nacheinander zu sortieren; und
    das Aufrufmodul konfiguriert ist, um, wenn die Zeit des Aufrufens des Elementensortierungsergebnisses jeder der VCGs erreicht ist, ein Elementensortierungsergebnis jeder der VCGs aufzurufen, wobei ein Abstand zwischen der Zeit des Aufrufens des Elementensortierungsergebnisses jeder der VCGs und der Zeit des Anfangens des Sortierens der Elemente jeder der VCGs größer als oder gleich einem festgelegten zulässigen Zeitabstand vom Sortieren bis zum Aufrufen des Sortierungsergebnisses ist,
    dadurch gekennzeichnet, dass das Aufrufmodul konfiguriert ist, um, wenn die Anfangszeit eines Mehrfachrahmenkopfs in einer Leserichtung erreicht wird, ein Elementensortierungsergebnis einer VCG, die dem Mehrfachrahmen entspricht, zu lesen, wobei ein Abstand zwischen der Anfangszeit des Mehrfachrahmenkopfs in der Leserichtung und der Endzeit eines Unterrahmens, der dem neuesten Element der VCG entspricht, die dem Mehrfachrahmen entspricht, gleich dem zulässigen Zeitabstand vom Sortieren bis zum Aufrufen des Sortierungsergebnisses ist.
  7. Vorrichtung gemäß Anspruch 6, wobei
    ein Wert des zulässigen Zeitabstands vom Sortieren bis zum Aufrufen des Sortierungsergebnisses der größere von der Gesamtzeit T1, die zum Sortieren der Elemente erforderlich ist, wenn die Elemente aller VCGs gleichzeitig ankommen, und der Gesamtzeit T2, die zum Sortieren der Elemente erforderlich ist, wenn die Elemente aller VCGs getrennt ankommen, ist;
    die Gesamtzeit T1, die zum Sortieren der Elemente erforderlich ist, wenn die Elemente aller VCGs gleichzeitig ankommen, ein Produkt der Zeit, die zum Sortieren von Elementen einer VCG erforderlich ist, und der Zahl an unterstützten VCGs ist; und die Gesamtzeit T2, die zum Sortieren der Elemente erforderlich ist, wenn die Elemente aller VCGs getrennt ankommen, ein Zeitabstand zwischen der Zeit, zu der ein H4- oder K4-Byte in dem letzten Unterrahmen in einem Mehrfachrahmen eines Kanals, der dem neuesten Element in einer VCG entspricht, ankommt, und der Zeit, zu der der nächste Mehrfachrahmenkopf des Kanals ankommt, ist.
  8. Vorrichtung gemäß Anspruch 7, wobei
    die Ankunftszeit des neuesten Elements in der VCG die Ankunftszeit eines H4- oder K4-Bytes in dem neuesten Unterrahmen ist, die durch Vergleichen der Ankunftszeit des H4- oder K4-Bytes in dem letzten Unterrahmen in einem Mehrfachrahmen, der jedem Element der VCG entspricht, erhalten wird.
EP11823003.6A 2010-09-07 2011-04-20 Verfahren und vorrichtung zur sortierung der elemente mehrerer virtueller verknüpfungsgruppen Active EP2533440B1 (de)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201010276021.8A CN101938320B (zh) 2010-09-07 2010-09-07 一种实现多虚级联组成员排序的方法及装置
PCT/CN2011/073087 WO2012031480A1 (zh) 2010-09-07 2011-04-20 一种实现多虚级联组成员排序的方法及装置

Publications (3)

Publication Number Publication Date
EP2533440A1 EP2533440A1 (de) 2012-12-12
EP2533440A4 EP2533440A4 (de) 2017-12-27
EP2533440B1 true EP2533440B1 (de) 2018-12-19

Family

ID=43391473

Family Applications (1)

Application Number Title Priority Date Filing Date
EP11823003.6A Active EP2533440B1 (de) 2010-09-07 2011-04-20 Verfahren und vorrichtung zur sortierung der elemente mehrerer virtueller verknüpfungsgruppen

Country Status (4)

Country Link
EP (1) EP2533440B1 (de)
CN (1) CN101938320B (de)
BR (1) BR112012021225A2 (de)
WO (1) WO2012031480A1 (de)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101938320B (zh) * 2010-09-07 2014-11-05 中兴通讯股份有限公司 一种实现多虚级联组成员排序的方法及装置
CN116545573B (zh) * 2023-07-07 2023-09-08 杭州芯旗电子技术有限公司 一种基于fpga实现的虚级联组成员自动识别方法及系统

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100414899C (zh) * 2002-08-05 2008-08-27 华为技术有限公司 大传输延时的虚级联虚容器帧的处理方法
US7493392B1 (en) * 2002-12-20 2009-02-17 Cypress Semiconductor Corporation Method and apparatus for assembly of virtually concatenated data
CN100358327C (zh) * 2004-02-20 2007-12-26 华为技术有限公司 Lcas动态无损切换数据带宽的时延补偿方法
US20060126641A1 (en) * 2004-12-15 2006-06-15 Joobin Song Mapping system of virtual concatenation group signals
CN1929476B (zh) * 2005-09-05 2010-06-16 中兴通讯股份有限公司 一种实现无损伤虚级联恢复的方法
ATE472207T1 (de) * 2006-12-22 2010-07-15 Alcatel Lucent Verfahren zum mapping und demapping von dateninformationen über die mitglieder einer verketteten gruppe
CN101272212A (zh) * 2008-05-07 2008-09-24 中兴通讯股份有限公司 虚级联组成员的排序方法
CN101800615A (zh) * 2009-02-06 2010-08-11 诺基亚西门子通信公司 Eos中的高速交织和解交织方法与设备
CN101938320B (zh) * 2010-09-07 2014-11-05 中兴通讯股份有限公司 一种实现多虚级联组成员排序的方法及装置

Also Published As

Publication number Publication date
EP2533440A4 (de) 2017-12-27
WO2012031480A1 (zh) 2012-03-15
CN101938320A (zh) 2011-01-05
CN101938320B (zh) 2014-11-05
EP2533440A1 (de) 2012-12-12
BR112012021225A2 (pt) 2017-10-24

Similar Documents

Publication Publication Date Title
US9654419B2 (en) Fabric channel control apparatus and method
US7242686B1 (en) System and method for communicating TDM traffic through a packet switch fabric
US6631130B1 (en) Method and apparatus for switching ATM, TDM, and packet data through a single communications switch while maintaining TDM timing
US11843452B2 (en) Clock synchronization method and apparatus
US20050207436A1 (en) Switching device based on aggregation of packets
US7986713B2 (en) Data byte load based network byte-timeslot allocation
JPH05219098A (ja) フレーム変換方法及び装置
US6636515B1 (en) Method for switching ATM, TDM, and packet data through a single communications switch
EP1344355B1 (de) Verfahren und vorrichtung zum vermitteln von atm-, tdm- und paketdaten durch eine einzige kommunikationsvermittlung
CN102377678B (zh) 一种数据传输处理方法及装置
US7633971B1 (en) Method and system for transport of packet-based datastreams over frame-based transport systems employing physically diverse transmission channels
EP2533440B1 (de) Verfahren und vorrichtung zur sortierung der elemente mehrerer virtueller verknüpfungsgruppen
WO2021013025A1 (zh) 数据接收方法及装置、数据发送方法及装置
US7379467B1 (en) Scheduling store-forwarding of back-to-back multi-channel packet fragments
KR20060113834A (ko) 레지덴셜 이더넷에서 수퍼 프레임의 시작에 대한 주기적동기 방법
WO2012062093A1 (zh) 数据映射方法及装置
WO2016101555A1 (zh) 一种交叉调度方法及其装置、存储介质
US7349435B2 (en) Multiport overhead cell processor for telecommunications nodes
JP5409525B2 (ja) パケット多重化装置
US7944945B2 (en) Encapsulation of STM-n/STS-m frames under ethernet
US20050068986A1 (en) Universal switching centre, method for executing a switching task, input unit, output unit and connecting unit
US7385970B1 (en) Method and apparatus for balancing bandwidth among multiple ports of a network element
US20040008708A1 (en) Overhead engine for telecommunications nodes
CN110769125A (zh) 一种适用于处理芯片的通信协议选择方法及装置
US20040008673A1 (en) Overhead processing in telecommunications nodes

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20120903

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

DAX Request for extension of the european patent (deleted)
RA4 Supplementary search report drawn up and despatched (corrected)

Effective date: 20171124

RIC1 Information provided on ipc code assigned before grant

Ipc: H04J 3/16 20060101AFI20171120BHEP

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: GRANT OF PATENT IS INTENDED

INTG Intention to grant announced

Effective date: 20180719

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE PATENT HAS BEEN GRANTED

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: ZTE CORPORATION

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

RIN1 Information on inventor provided before grant (corrected)

Inventor name: ZHANG, SIDONG

Inventor name: CHENG, JIAN

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602011054999

Country of ref document: DE

REG Reference to a national code

Ref country code: AT

Ref legal event code: REF

Ref document number: 1079828

Country of ref document: AT

Kind code of ref document: T

Effective date: 20190115

REG Reference to a national code

Ref country code: NL

Ref legal event code: MP

Effective date: 20181219

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: HR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181219

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181219

Ref country code: NO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190319

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190319

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181219

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181219

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG4D

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 1079828

Country of ref document: AT

Kind code of ref document: T

Effective date: 20181219

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: RS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181219

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190320

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181219

Ref country code: AL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181219

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181219

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: PL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181219

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181219

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181219

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190419

Ref country code: IT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181219

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181219

Ref country code: SM

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181219

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181219

Ref country code: RO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181219

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190419

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602011054999

Country of ref document: DE

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181219

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181219

26N No opposition filed

Effective date: 20190920

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

REG Reference to a national code

Ref country code: BE

Ref legal event code: MM

Effective date: 20190430

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 20190420

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MC

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181219

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190420

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190430

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190430

Ref country code: GB

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190420

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181219

Ref country code: BE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190430

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190430

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: TR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181219

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190420

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181219

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: HU

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT; INVALID AB INITIO

Effective date: 20110420

Ref country code: MT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181219

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181219

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20230307

Year of fee payment: 13