IP Library › Granted Patent US 12,323,334
Granted Patent B2
US 12,323,334 · App. 17/745,240 · Granted Jun 3, 2025

System and method for performing rate adaptation and multiplexing of constant bit rate (CBR) client data for transmission over a metro transport network (MTN)

Inventors: Steven Scott Gorshe (Beaverton, OR); Winston Mok (Vancouver, CA)
Assignee: Microchip Technology Inc.
H04L47/25
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,323,334
App. No.
17/745,240
Granted
Jun 3, 2025
Kind
B2
Abstract

A system and method for performing rate adaptation and multiplexing of constant bit rate (CBR) client data for transmission over a Metro Transport Network (MTN) by defining a plurality of plurality of generic mapping procedure (GMP) thread frames for a respective stream of two or more streams of 64B/66B-encoded blocks of CR client data, defining a plurality of pseudo-Ethernet packets, mapping the plurality of GMP thread frames into consecutive pseudo-Ethernet packets, assembling a stream of GMP multiplexing frames comprising the consecutive pseudo-Ethernet packets, inserting a fixed number of idle blocks between the consecutive pseudo-Ethernet packets of the stream of GMP multiplexing frames and inserting an MTN path overhead (POH) frame into the stream of GMP multiplexing frames to generate a stream of GMP multiplexing rate adapted frames.

Claims (64)

1. A method for performing rate adaptation, the method comprising:

receiving two or more streams of 64B/66B-encoded blocks of constant bit rate (CBR) client data at a source node;

defining a plurality of generic mapping procedure (GMP) thread frames, wherein respective GMP thread frames include a variable number of 64B/66B-encoded blocks of CBR client data, a variable number of pad blocks and GMP overhead for the respective stream of 64B/66B-encoded blocks of CBR client data;

defining a plurality of pseudo-Ethernet packets, wherein the respective pseudo-Ethernet packets include a plurality of data payload blocks divided into a plurality of interleaved threads and a plurality of interleaved GMP overhead data payload blocks;

mapping the plurality of GMP thread frames into consecutive pseudo-Ethernet packets of the plurality of pseudo-Ethernet packets, by mapping the variable number of 64B/66B-encoded blocks of CBR client data and the variable number of pad blocks into respective ones of the plurality of consecutive pseudo-Ethernet packets and mapping the GMP overhead into the plurality of interleaved GMP overhead data payload blocks;

assembling a stream of GMP multiplexing frames comprising the consecutive pseudo-Ethernet packets;

inserting a fixed number of idle blocks between the consecutive pseudo-Ethernet packets of the stream of GMP multiplexing frames; and

inserting an Metro Transport Network (MTN) path overhead (POH) frame that is aligned to the plurality of GMP multiplexing frames into the stream of GMP multiplexing frames to generate a stream of GMP multiplexing rate adapted frames.

2. The method of claim 1 , wherein the two or more streams of 64B/66B-encoded blocks of CBR client data are received substantially simultaneously.

3. The method of claim 1 , wherein the two or more streams of 64B/66B-encoded blocks of CBR client data are received non-simultaneously.

4. The method of claim 1 , wherein mapping the plurality of GMP thread frames into consecutive pseudo-Ethernet packets comprises mapping the 64B/66B-encoded blocks of CBR client data in a round-robin manner.

5. The method of claim 1 , wherein the number of data payload blocks in respective interleaved threads is an integer.

6. The method of claim 1 , wherein the fixed number of idle blocks inserted between the plurality pseudo-Ethernet packets of the stream of GMP multiplexing frames is known by a sink node of the MTN.

7. The method of claim 1 , wherein defining the plurality of GMP thread frames comprises:

deriving an MTN path signal rate based upon a reference clock at the source node; and

deriving a client data stream rate for the respective two or more streams of 64B/66B-encoded blocks of CBR client data relative to the reference clock rate,

wherein, for the respective two or more streams of 64B/66B-encoded blocks of CBR client data, the variable number of 64B/66B-encoded blocks of CBR client data and the variable number of pad blocks are based on a difference between the MTN path signal rate and the respective client data stream rate.

8. The method of claim 1 , comprising:

transmitting the stream of GMP multiplexing rate adapted frames, including the fixed number of idle blocks, over the MTN;

receiving the stream of GMP multiplexing rate adapted frames and the fixed number of idle blocks at a first intermediate node of the MTN;

performing idle mapping procedure (IMP) rate adaptation of the stream of GMP multiplexing rate adapted frames received at the first intermediate node to modify the fixed number of idle blocks; and

transmitting the stream of GMP multiplexing rate adapted frames and the modified fixed number of idle blocks from the first intermediate node to a next node of the MTN.

9. The method of claim 8 , wherein the next node of the MTN is selected from a next intermediate node and a sink node.

10. The method of claim 8 , wherein the next node is a sink node, the method comprising:

receiving the stream of GMP multiplexing rate adapted frames and the modified fixed number of idle blocks at the sink node;

determining, for the respective interleaved thread, a corresponding client data stream rate from the GMP overhead and a difference between the fixed number of idle blocks inserted between the consecutive pseudo-Ethernet packets of the stream of GMP multiplexing rate adapted frames by the source node and the modified fixed number of idle blocks received at the sink node; and

extracting the two or more streams of 64B/66B-encoded blocks of CBR client data from the stream of GMP multiplexing rate adapted frames using the corresponding client data stream rate for the respective interleaved thread.

11. A method for performing rate adaptation of two or more streams of client data for transmission over a Metro Transport Network (MTN), the method comprising:

receiving two or more streams of 64B/66B-encoded blocks of constant bit rate (CBR) client data at a source node;

defining a plurality of generic mapping procedure (GMP) thread frames, wherein respective GMP thread frames include a variable number of 64B/66B-encoded blocks of CBR client data, a variable number of pad blocks and GMP overhead for the respective stream of 64B/66B-encoded blocks of CBR client data;

defining a plurality of pseudo-Ethernet packets, wherein respective pseudo-Ethernet packets include a plurality of data payload blocks divided into a plurality of interleaved threads and a plurality of interleaved GMP overhead data payload blocks;

mapping the plurality of GMP thread frames into consecutive pseudo-Ethernet packets of the plurality of pseudo-Ethernet packets, by mapping the variable number of 64B/66B-encoded blocks of CBR client data and the variable number of pad blocks into respective ones of the plurality of consecutive pseudo-Ethernet packets and mapping the GMP overhead into the plurality of interleaved GMP overhead data payload blocks;

assembling a stream of GMP multiplexing frames comprising the consecutive pseudo-Ethernet packets;

inserting a fixed number of idle blocks between the consecutive pseudo-Ethernet packets of the stream of GMP multiplexing frames;

inserting an MTN path overhead (POH) frame that is aligned to the stream of GMP multiplexing frames to generate a stream of GMP multiplexing rate adapted frames;

transmitting the stream of GMP multiplexing rate adapted frames, including the fixed number of idle blocks, over the MTN;

receiving the stream of GMP multiplexing rate adapted frames and the fixed number of idle blocks at a first intermediate node of the MTN;

performing idle mapping procedure (IMP) rate adaptation of the stream of rate adapted GMP multiplexing rate adapted frames received at the first intermediate node to modify the fixed number of idle blocks;

transmitting the stream of GMP multiplexing rate adapted frames and the modified fixed number of idle blocks from the intermediate node to a sink node of the MTN;

receiving the stream of rate adapted GMP multiplexing rate adapted frames and the modified fixed number of idle blocks at the sink node;

determining, for respective interleaved threads, a corresponding client data stream rate from the GMP overhead and a difference between the fixed number of idle blocks inserted into the stream GMP multiplexing frames by the source node and the modified number of idle blocks received at the sink node; and

extracting the two or more streams of 64B/66B-encoded blocks of CBR client data from the stream of GMP multiplexing rate adapted frames using the corresponding client data stream rate for the respective interleaved thread.

12. The method of claim 11 , wherein mapping the plurality of GMP thread frames into consecutive pseudo-Ethernet packets comprises mapping the 64B/66B-encoded blocks of CBR client data in a round-robin manner.

13. The method of claim 11 , wherein the number of data payload blocks in respective interleaved threads is an integer.

14. The method of claim 11 , wherein the fixed number of idle blocks inserted between the plurality of pseudo-Ethernet packets of the stream of GMP multiplexing frames is known by the sink node of the MTN.

15. The method of claim 11 , wherein defining the plurality of GMP thread frames comprises:

deriving an MTN path signal rate based upon a reference clock at the source; and

deriving a client data stream rate from respective streams of the two or more streams of 64B/66B-encoded blocks of CBR client data relative to the reference clock rate,

wherein, for respective streams of the two or more streams of 64B/66B-encoded blocks of CBR client data, the variable number of 64B/66B-encoded blocks of CBR client data and the variable number of pad blocks are based on a difference between the MTN path signal rate and the respective client data stream rate.

16. A source node for transmitting a client data stream over a Metro Transport Network (MTN), the source node comprising circuitry to:

receive two or more streams of 64B/66B-encoded blocks of constant bit rate (CBR) client data;

define a plurality of generic mapping procedure (GMP) thread frames, wherein respective GMP thread frames include a variable number of the 64B/66B-encoded blocks of CBR client data, a variable number of pad blocks and GMP overhead for the respective stream of 64B/66B encoded blocks of CBR client data;

define a plurality of pseudo-Ethernet packets, wherein respective pseudo-Ethernet packets include a plurality of data payload blocks divided into a plurality of interleaved threads and a plurality of interleaved generic mapping procedure GMP overhead data payload blocks;

map the plurality of GMP thread frames into consecutive pseudo-Ethernet packets of the plurality of pseudo-Ethernet packets, by mapping the variable number of 64B/66B-encoded blocks of CBR client data and the variable number of pad blocks into respective ones of the plurality of consecutive pseudo-Ethernet packets and mapping the GMP overhead into the plurality of interleaved GMP overhead data payload blocks;

assemble a stream of GMP multiplexing frames comprising the consecutive pseudo-Ethernet packets;

insert a fixed number of idle blocks between the consecutive pseudo-Ethernet packets of the stream of GMP multiplexing frames; and

insert an MTN path overhead (POH) frame that is aligned to the stream of GMP multiplexing frames to generate a stream of GMP multiplexing rate adapted frames.

17. The source node of claim 16 , wherein the source node circuitry is to transmit the stream of GMP multiplexing rate adapted frames, including the fixed number of idle blocks to an intermediate node or to a sink node of the MTN.

18. The source node of claim 16 , wherein the source node circuitry is to map the plurality of GMP thread frames into consecutive pseudo-Ethernet packets by mapping the 64B/66B-encoded blocks of CBR client data in a round-robin manner.

19. The source node of claim 16 , wherein the number of payload blocks in respective interleaved threads is an integer.

20. The source node of claim 16 , wherein the source node circuitry is to define the plurality of GMP thread frames:

derives an MTN path signal rate based upon a reference clock at the source; and

derives a client data stream rate from respective streams of 64B/66B-encoded blocks of CBR client data relative to the reference clock rate,

wherein, for respective streams of 64B/66B-encoded blocks of CBR client data, the variable number of 64B/66B-encoded blocks of CBR client data and the variable number of pad blocks are based on a difference between the MTN path signal rate and the respective client data stream rate.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 16, 2022
From: GORSHE, STEVEN SCOTT; MOK, WINSTON
To: MICROCHIP TECHNOLOGY INC.
Reel/Frame 059919/0568 →
Continuity (3)
Provisional Application 63326989 · Apr 4, 2022
Provisional Application 63216938 · Jun 30, 2021
Related Publication 20230006938A1 · Jan 5, 2023
References Cited (176)
US 5343482A · Penner et al. · 1994 [cited by applicant]
US 5361277A · Grover · 1994 [cited by applicant]
US 5371765A · Guilford · 1994 [cited by applicant]
US 5600824A · Williams et al. · 1997 [cited by applicant]
US 5640398A · Carr et al. · 1997 [cited by applicant]
US 5838512A · Okazaki · 1998 [cited by applicant]
US 5850422A · Chen · 1998 [cited by applicant]
US 5905766A · Nguyen · 1999 [cited by applicant]
US 6044122A · Ellersick et al. · 2000 [cited by applicant]
US 6052073A · Carr et al. · 2000 [cited by applicant]
US 6138061A · McEnnan et al. · 2000 [cited by applicant]
US 6150965A · Carr et al. · 2000 [cited by applicant]
US 6188699B1 · Lang et al. · 2001 [cited by applicant]
US 6333935B1 · Carr et al. · 2001 [cited by applicant]
US 6345052B1 · Tse et al. · 2002 [cited by applicant]
US 6359479B1 · Oprescu · 2002 [cited by applicant]
US 6501340B1 · Flood · 2002 [cited by applicant]
US 6584521B1 · Dillabough et al. · 2003 [cited by applicant]
US 6603776B1 · Fedders et al. · 2003 [cited by applicant]
US 6668297B1 · Karr et al. · 2003 [cited by applicant]
US 6671758B1 · Cam et al. · 2003 [cited by applicant]
US 6744787B1 · Schatz et al. · 2004 [cited by applicant]
US 6820159B2 · Mok et al. · 2004 [cited by applicant]
US 6823001B1 · Chea · 2004 [cited by applicant]
US 6829717B1 · Roust · 2004 [cited by applicant]
US 6870831B2 · Hughes et al. · 2005 [cited by applicant]
US 7117112B2 · Mok · 2006 [cited by applicant]
US 7161999B2 · Parikh · 2007 [cited by applicant]
US 7165003B2 · Mok · 2007 [cited by applicant]
US 7187741B2 · Pontius et al. · 2007 [cited by applicant]
US 7203616B2 · Mok · 2007 [cited by applicant]
US 7239650B2 · Rakib et al. · 2007 [cited by applicant]
US 7239669B2 · Cummings et al. · 2007 [cited by applicant]
US 7295945B2 · Mok · 2007 [cited by applicant]
US 7388160B2 · Mok et al. · 2008 [cited by applicant]
US 7417985B1 · McCrosky et al. · 2008 [cited by applicant]
US 7468974B1 · Carr et al. · 2008 [cited by applicant]
US 7492760B1 · Plante et al. · 2009 [cited by applicant]
US 7593411B2 · McCrosky et al. · 2009 [cited by applicant]
US 7656791B1 · Mok et al. · 2010 [cited by applicant]
US 7668210B1 · Mok et al. · 2010 [cited by applicant]
US 7751411B2 · Cam et al. · 2010 [cited by applicant]
US 7772898B2 · Cheung · 2010 [cited by applicant]
US 7807933B2 · Mok et al. · 2010 [cited by applicant]
US 7817673B2 · Scott et al. · 2010 [cited by applicant]
US 8010355B2 · Rahbar · 2011 [cited by applicant]
US 8023641B2 · Rahbar · 2011 [cited by applicant]
US 8068559B1 · Butcher · 2011 [cited by applicant]
US 8085764B1 · McCrosky et al. · 2011 [cited by applicant]
US 8139704B2 · Heinrich · 2012 [cited by applicant]
US 8243759B2 · Rahbar · 2012 [cited by applicant]
US 8335319B2 · Rahbar · 2012 [cited by applicant]
US 8413006B1 · Mok et al. · 2013 [cited by applicant]
US 8428203B1 · Zortea et al. · 2013 [cited by applicant]
US 8483244B2 · Rahbar · 2013 [cited by applicant]
US 8542708B1 · Mok et al. · 2013 [cited by applicant]
US 8599986B2 · Rahbar · 2013 [cited by applicant]
US 8774227B2 · Rahbar · 2014 [cited by applicant]
US 8854963B1 · Muma et al. · 2014 [cited by applicant]
US 8913688B1 · Jenkins · 2014 [cited by applicant]
US 8957711B2 · Jin et al. · 2015 [cited by applicant]
US 8971548B2 · Rahbar et al. · 2015 [cited by applicant]
US 8976816B1 · Mok et al. · 2015 [cited by applicant]
US 8982910B1 · Zhang et al. · 2015 [cited by applicant]
US 8989222B1 · Mok et al. · 2015 [cited by applicant]
US 9019997B1 · Mok et al. · 2015 [cited by applicant]
US 9025594B1 · Mok et al. · 2015 [cited by applicant]
US 9209965B2 · Rahbar et al. · 2015 [cited by applicant]
US 9276874B1 · Mok et al. · 2016 [cited by applicant]
US 9313563B1 · Mok et al. · 2016 [cited by applicant]
US 9337960B2 · Zhong · 2016 [cited by applicant]
US 9374265B1 · Mok et al. · 2016 [cited by applicant]
US 9444474B2 · Rahbar et al. · 2016 [cited by applicant]
US 9473261B1 · Tse et al. · 2016 [cited by applicant]
US 9503254B2 · Rahbar et al. · 2016 [cited by applicant]
US 9525482B1 · Tse · 2016 [cited by applicant]
US 10069503B2 · Zhang et al. · 2018 [cited by applicant]
US 10079651B2 · Ramachandra · 2018 [cited by applicant]
US 10104047B2 · Muma et al. · 2018 [cited by applicant]
US 10128826B2 · Jin et al. · 2018 [cited by applicant]
US 10218823B2 · Gareau · 2019 [cited by applicant]
US 10250379B2 · Haddad et al. · 2019 [cited by applicant]
US 10397088B2 · Gareau · 2019 [cited by applicant]
US 10432553B2 · Tse · 2019 [cited by applicant]
US 10594329B1 · Elkholy · 2020 [cited by applicant]
US 10594423B1 · Anand et al. · 2020 [cited by applicant]
US 10608647B1 · Ranganathan et al. · 2020 [cited by applicant]
US 10797816B1 · Gorshe et al. · 2020 [cited by applicant]
US 10917097B1 · Meyer et al. · 2021 [cited by applicant]
US 11108895B2 · Mok et al. · 2021 [cited by applicant]
US 11128742B2 · Gorshe et al. · 2021 [cited by applicant]
US 11239933B2 · Mok et al. · 2022 [cited by applicant]
US 20010056512A1 · Mok et al. · 2001 [cited by applicant]
US 20020158700A1 · Nemoto · 2002 [cited by applicant]
US 20040082982A1 · Gord et al. · 2004 [cited by applicant]
US 20050110524A1 · Glasser · 2005 [cited by applicant]
US 20050182848A1 · Mcneil et al. · 2005 [cited by applicant]
US 20060056560A1 · Aweya et al. · 2006 [cited by applicant]
US 20060064716A1 · Sull et al. · 2006 [cited by applicant]
US 20060076988A1 · Kessels et al. · 2006 [cited by applicant]
US 20070036173A1 · McCrosky et al. · 2007 [cited by applicant]
US 20070064834A1 · Yoshizawa · 2007 [cited by applicant]
US 20070132259A1 · Ivannikov et al. · 2007 [cited by applicant]
US 20080000176A1 · Mandelzys et al. · 2008 [cited by applicant]
US 20080202805A1 · Mok et al. · 2008 [cited by applicant]
US 20100052797A1 · Carley et al. · 2010 [cited by applicant]
US 20100150271A1 · Brown et al. · 2010 [cited by applicant]
US 20110095830A1 · Tsangaropoulos et al. · 2011 [cited by applicant]
US 20120158990A1 · Losio et al. · 2012 [cited by applicant]
US 20130101292A1 · Lanzone et al. · 2013 [cited by applicant]
US 20140055179A1 · Gong et al. · 2014 [cited by applicant]
US 20140139275A1 · Dally et al. · 2014 [cited by applicant]
US 20140149821A1 · Zhou et al. · 2014 [cited by applicant]
US 20150078406A1 · Caggioni et al. · 2015 [cited by applicant]
US 20150117177A1 · Ganga et al. · 2015 [cited by applicant]
US 20150288538A1 · Fritschi et al. · 2015 [cited by applicant]
US 20160020872A1 · Zhong · 2016 [cited by applicant]
US 20160127072A1 · Chen et al. · 2016 [cited by applicant]
US 20160277030A1 · Burbano et al. · 2016 [cited by applicant]
US 20160301669A1 · Muma et al. · 2016 [cited by applicant]
US 20160315634A1 · Mei et al. · 2016 [cited by applicant]
US 20160330014A1 · Jain · 2016 [cited by applicant]
US 20170005949A1 · Gareau · 2017 [cited by applicant]
US 20170171163A1 · Gareau · 2017 [cited by examiner]
US 20170244648A1 · Tse · 2017 [cited by applicant]
US 20180131378A1 · Haroun et al. · 2018 [cited by applicant]
US 20180145928A1 · Zhong et al. · 2018 [cited by applicant]
US 20180159541A1 · Spijker · 2018 [cited by applicant]
US 20180159785A1 · Wu · 2018 [cited by examiner]
US 20180183708A1 · Farkas et al. · 2018 [cited by applicant]
US 20190097758A1 · Huang et al. · 2019 [cited by applicant]
US 20190173856A1 · Gareau et al. · 2019 [cited by applicant]
US 20190394309A1 · Caldwell et al. · 2019 [cited by applicant]
US 20200018794A1 · Uehara · 2020 [cited by applicant]
US 20200067827A1 · Mei et al. · 2020 [cited by applicant]
US 20200166912A1 · Schneider et al. · 2020 [cited by applicant]
US 20200287998A1 · Gorshe et al. · 2020 [cited by applicant]
US 20200295874A1 · Cheng et al. · 2020 [cited by applicant]
US 20200296486A1 · Xiang et al. · 2020 [cited by applicant]
US 20200396097A1 · Deng et al. · 2020 [cited by applicant]
US 20210385310A1 · Gorshe et al. · 2021 [cited by applicant]
US 20220407742A1 · Sergeev et al. · 2022 [cited by applicant]
US 20220416895A1 · Liu · 2022 [cited by examiner]
DE 60216803T2 · 2007 [cited by applicant]
DE 102017222442A1 · 2019 [cited by applicant]
EP 1145477A1 · 2001 [cited by applicant]
EP 3544210A1 · 2019 [cited by applicant]
JP 3565600B2 · 2004 [cited by applicant]
WO 2003039061A3 · 2003 [cited by applicant]
WO 2020185247A1 · 2020 [cited by applicant]
WO 2021040762A1 · 2021 [cited by applicant]
WO 2021151187A1 · 2021 [cited by applicant]
U.S. Appl. No. 62/953,301, filed Dec. 24, 2019, Peter Meyer. [cited by applicant]
“IEEE 802.3 IEEE Standard for Ethernet Clause 82”, IEEE, 2012. [cited by applicant]
“ITU-T Recommendation G.709 Interfaces for the Optical Transport Networks”, ITU-T G.709/Y.1331, International Telecommunication Union, Jun. 2016. [cited by applicant]
“MEF 8 Implementation Agreement for the Emulation of PDH Circuits over Metro Ethernet Networks”, Metro Ethernet Forum, Oct. 2004. [cited by applicant]
8A34003 Datasheet (Integrated Device Technology, Inc) Jun. 17, 2019 (Jun. 17, 2019). [cited by applicant]
Abdo Ahmad et al: “Low-Power Circuit for Measuring and Compensating Phase Interpolator Non-Linearity”, 2019 IEEE 10th Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON), IEEE, Oct. 1… [cited by applicant]
Eyal Oren Broadcom Limited USA, “MTN Section Layer frame and Path layer format considerations;C1522”, ITU-T Draft; Study Period 2017-2020; Study Group 15; Series C1522, International Telecommunication Union, Geneva ; CH… [cited by applicant]
ITU-T G.8013/Y.1731, “Operation, administration and maintenance (OAM) functions and mechanisms for Ethernet-based networks”, International Telecommunication Union, Geneva, Switzerland, Aug. 2015. [cited by applicant]
Maarten Vissers, “FlexE aware mapping method 6B text proposal;CD11-I06”, ITU-T Draft; Study Period 2013-2016, International Telecommunication Union, Geneva; CH, vol. 11/15, Jan. 12, 2016 (Jan. 12, 2016), pp. 1-3, Last p… [cited by applicant]
Malcolm Johnson et al., “Optical Transport Networks from TDM to packet”, ITU-T Manual 2010; ITU-T Draft; Study Period 2009-2012, International Telecommunication Union, Geneva, Switzerland, Feb. 22, 2011, pp. 91-122. [cited by applicant]
Qiwen Zhong, Huawei Technologies Co., Ltd. China, “Discussion and proposal for G.mtn terminologies regarding Ethernet client signal;WD11-39”, ITU-T Draft; Study Period 2017-2020; Study Group 15; Series WD11-39, Internat… [cited by applicant]
Qiwen Zhong, Huawei Technologies Co., Ltd. P. R. China, “Analysis for IPG based G.mtn path layer OAM insertion impact on IEEE 802.3 PCS state machine;C1195”, ITU-T Draft; Study Period 2017-2020; Study Group 15; Series C… [cited by applicant]
Steve Gorshe, Microsemi Corp. U.S.A., “Analysis of the G.mtn A.1 Scope Relative to IEEE 802.3 Clause 82 State Diagrams;C1179”, ITU-T Draft; Study Period 2017-2020; Study Group 15; Series C1179, International Telecommuni… [cited by applicant]
Trowbridge, Steve, “G.mtn Section and Path Overhead Options,” ITU-T WD11-10, International Telecommunication Union, Geneva, Switzerland, Apr. 2019. [cited by applicant]
Ximing Dong CICT P.R. China, “Feasibility Analysis: the Use of Idle as a Resources to Carry Path layer OAM; WD11-16”, ITU-T Draft; Study Period 2017-2020; Study Group 15; Series WD11-16, International Telecommunication … [cited by applicant]
Yang, Jian, Betts, Malkcolm, Gu, Yuan, “SCL OAM solution”, ITU-T WD11-65 Submission, International Telecommunication Union, Geneva, Switzerland, Jun. 2018. [cited by applicant]
Zhang Sen et al, “Hybrid Multiplexing over FlexE Group,” 2018 23rd Opto-Electronics and Communications Conference (OECC), IEEE, Jul. 2, 2018, pp. 1-2. [cited by applicant]
Steve Gorshe, “MTN Path Overhead Proposal—Overhead Frame Structure; WD11-13”, ITU-T Draft; Study Period 2017-2020; Study Group 15; Series C1181, International Telecommunication Union, Beneva; Switzerland, vol. 11/15 , A… [cited by applicant]
Steve Gorshe, “MTN Path Overhead Proposal—Overhead Method and Frame Structure;CII81”, ITU-T Draft; Study Period 2017-2020; Study Group 15; Series C1181, International Telecommunication Union, Geneva; Switzerland, vol. 1… [cited by applicant]
Steve Trowbridge Nokia USA: “Sample common sub-IG TDM multiplexing and switching mechanism for use over MTN and OTN networks;C2812”, ITU-T Draft; Study Period 2021-2024; Study Group 15; Series C2812, International Telec… [cited by applicant]
PCT/US2022/029563, International Search Report and Written Opinion, European Patent Office, mailed Sep. 12, 2022. [cited by applicant]
“Interfaces for the metro transport network;g8312”, ITU-T Draft; Study Period 2017-2020; Study Group 15; Series G8312, International Telecommunication Union, Geneva ; CH vol. 11/15, Nov. 25, 2020 (Nov. 25, 2020), pp. 1-… [cited by applicant]
PCT/US22/29600, International Search Report and Written Opinion, European Patent Office, mailed Sep. 13, 2022. [cited by applicant]
ITU-T Draft, “Interfaces for the metro transport network; g8312”, Study period 2017-2020; Study Group 15; Series 8312, International Telecommunication Union, Geneva, Switzerland, Nov. 2020. [cited by applicant]