diff --git a/marked/E/T-REC-E.118-200605-I_PDF-E/a3dc41dc3df86ea68d266af2bf95cf5b_img.jpg b/marked/E/T-REC-E.118-200605-I_PDF-E/a3dc41dc3df86ea68d266af2bf95cf5b_img.jpg deleted file mode 100644 index 36cf51f8ba07e44aa7a4b009f3ba08eb2b570b1c..0000000000000000000000000000000000000000 --- a/marked/E/T-REC-E.118-200605-I_PDF-E/a3dc41dc3df86ea68d266af2bf95cf5b_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:11780faeee75ba39ab4ed9de67a9e67abec0d9ba3068ebec661dea70c16e29d3 -size 4338 diff --git a/marked/E/T-REC-E.118-200605-I_PDF-E/d0abac95583b52a3b35f74a215567334_img.jpg b/marked/E/T-REC-E.118-200605-I_PDF-E/d0abac95583b52a3b35f74a215567334_img.jpg deleted file mode 100644 index d948fa6fea3d3373bdfb689d66258ce6fd4ada3e..0000000000000000000000000000000000000000 --- a/marked/E/T-REC-E.118-200605-I_PDF-E/d0abac95583b52a3b35f74a215567334_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:c8d73e8f447b245f26656cf041815e11f8ff5d757e60f90495820aa104cc3b77 -size 79092 diff --git a/marked/E/T-REC-E.118-200605-I_PDF-E/raw.md b/marked/E/T-REC-E.118-200605-I_PDF-E/raw.md deleted file mode 100644 index cf72e3b495f07f4e4c88f47b3c62397e79877fe5..0000000000000000000000000000000000000000 --- a/marked/E/T-REC-E.118-200605-I_PDF-E/raw.md +++ /dev/null @@ -1,441 +0,0 @@ - - -**ITU-T** - -TELECOMMUNICATION -STANDARDIZATION SECTOR -OF ITU - -**E.118** - -(05/2006) - -SERIES E: OVERALL NETWORK OPERATION, -TELEPHONE SERVICE, SERVICE OPERATION AND -HUMAN FACTORS - -International operation – General provisions concerning -Administrations - ---- - -**The international telecommunication charge -card** - -ITU-T Recommendation E.118 - -# ITU-T E-SERIES RECOMMENDATIONS - -# OVERALL NETWORK OPERATION, TELEPHONE SERVICE, SERVICE OPERATION AND HUMAN FACTORS - -| | | -|---------------------------------------------------------------------------------------------------|--------------------| -| INTERNATIONAL OPERATION | | -| Definitions | E.100–E.103 | -| General provisions concerning Administrations | E.104–E.119 | -| General provisions concerning users | E.120–E.139 | -| Operation of international telephone services | E.140–E.159 | -| Numbering plan of the international telephone service | E.160–E.169 | -| International routing plan | E.170–E.179 | -| Tones in national signalling systems | E.180–E.189 | -| Numbering plan of the international telephone service | E.190–E.199 | -| Maritime mobile service and public land mobile service | E.200–E.229 | -| OPERATIONAL PROVISIONS RELATING TO CHARGING AND ACCOUNTING IN THE INTERNATIONAL TELEPHONE SERVICE | | -| Charging in the international telephone service | E.230–E.249 | -| Measuring and recording call durations for accounting purposes | E.260–E.269 | -| UTILIZATION OF THE INTERNATIONAL TELEPHONE NETWORK FOR NON-TELEPHONY APPLICATIONS | | -| General | E.300–E.319 | -| Phototelegraphy | E.320–E.329 | -| ISDN PROVISIONS CONCERNING USERS | E.330–E.349 | -| INTERNATIONAL ROUTING PLAN | E.350–E.399 | -| NETWORK MANAGEMENT | | -| International service statistics | E.400–E.404 | -| International network management | E.405–E.419 | -| Checking the quality of the international telephone service | E.420–E.489 | -| TRAFFIC ENGINEERING | | -| Measurement and recording of traffic | E.490–E.505 | -| Forecasting of traffic | E.506–E.509 | -| Determination of the number of circuits in manual operation | E.510–E.519 | -| Determination of the number of circuits in automatic and semi-automatic operation | E.520–E.539 | -| Grade of service | E.540–E.599 | -| Definitions | E.600–E.649 | -| Traffic engineering for IP-networks | E.650–E.699 | -| ISDN traffic engineering | E.700–E.749 | -| Mobile network traffic engineering | E.750–E.799 | -| QUALITY OF TELECOMMUNICATION SERVICES: CONCEPTS, MODELS, OBJECTIVES AND DEPENDABILITY PLANNING | | -| Terms and definitions related to the quality of telecommunication services | E.800–E.809 | -| Models for telecommunication services | E.810–E.844 | -| Objectives for quality of service and related concepts of telecommunication services | E.845–E.859 | -| Use of quality of service objectives for planning of telecommunication networks | E.860–E.879 | -| Field data collection and evaluation on the performance of equipment, networks and services | E.880–E.899 | -| OTHER | E.900–E.999 | - -For further details, please refer to the list of ITU-T Recommendations. - -## **ITU-T Recommendation E.118** - -## **The international telecommunication charge card** - -## **Summary** - -Telecommunication charge cards may be issued by Operating Agencies (OAs) to allow customers to use their card in connection with various international services at appropriate charges for each transaction and have the charges billed to their account in the country where the OA issued the charge card. Cards issued by OAs in accordance with this Recommendation conform to the appropriate ISO standards. - -This Recommendation has been revised to allow alternative, application-specific standards for IC cards where unique form factors require such alternatives. - -## **Source** - -ITU-T Recommendation E.118 was approved on 11 May 2006 by ITU-T Study Group 2 (2005-2008) under the Resolution 1 approval process. - -## **History** - -| | | | -|-----|-------|------------| -| 1.0 | E.118 | 1988-11-25 | -| 2.0 | E.118 | 1992-08-04 | -| 3.0 | E.118 | 1996-07-19 | -| 4.0 | E.118 | 2001-02-02 | -| 5.0 | E.118 | 2006-05-11 | - -## FOREWORD - -The International Telecommunication Union (ITU) is the United Nations specialized agency in the field of telecommunications. The ITU Telecommunication Standardization Sector (ITU-T) is a permanent organ of ITU. ITU-T is responsible for studying technical, operating and tariff questions and issuing Recommendations on them with a view to standardizing telecommunications on a worldwide basis. - -The World Telecommunication Standardization Assembly (WTSA), which meets every four years, establishes the topics for study by the ITU-T study groups which, in turn, produce Recommendations on these topics. - -The approval of ITU-T Recommendations is covered by the procedure laid down in WTSA Resolution 1. - -In some areas of information technology which fall within ITU-T's purview, the necessary standards are prepared on a collaborative basis with ISO and IEC. - -### NOTE - -In this Recommendation, the expression "Administration" is used for conciseness to indicate both a telecommunication administration and a recognized operating agency. - -Compliance with this Recommendation is voluntary. However, the Recommendation may contain certain mandatory provisions (to ensure e.g. interoperability or applicability) and compliance with the Recommendation is achieved when all of these mandatory provisions are met. The words "shall" or some other obligatory language such as "must" and the negative equivalents are used to express requirements. The use of such words does not suggest that compliance with the Recommendation is required of any party. - -## INTELLECTUAL PROPERTY RIGHTS - -ITU draws attention to the possibility that the practice or implementation of this Recommendation may involve the use of a claimed Intellectual Property Right. ITU takes no position concerning the evidence, validity or applicability of claimed Intellectual Property Rights, whether asserted by ITU members or others outside of the Recommendation development process. - -As of the date of approval of this Recommendation, ITU had not received notice of intellectual property, protected by patents, which may be required to implement this Recommendation. However, implementors are cautioned that this may not represent the latest information and are therefore strongly urged to consult the TSB patent database. - -© ITU 2006 - -All rights reserved. No part of this publication may be reproduced, by any means whatsoever, without the prior written permission of ITU. - -## CONTENTS - -| | Page | -|----------------------------------------------------------------------------------------------|------| -| 1 Scope ..... | 1 | -| 2 References..... | 1 | -| 3 Abbreviations..... | 1 | -| 4 Numbering system..... | 1 | -| 4.1 Card numbering structure ..... | 1 | -| 4.2 Issuer identifier number assignment and registration procedure..... | 2 | -| 4.3 Information content ..... | 5 | -| 5 Printed cards ..... | 5 | -| 6 Magnetic stripe cards..... | 5 | -| 6.1 Encoding requirements..... | 5 | -| 6.2 Expiration date..... | 6 | -| 6.3 Service code..... | 6 | -| 6.4 Discretionary data..... | 6 | -| 7 Integrated Circuit (IC) cards..... | 6 | -| Annex A – Service code assignments ..... | 7 | -| Appendix I – Implementation guidelines for the assignment of issuer identifier numbers ..... | 8 | - - - -## The international telecommunication charge card - -## 1 Scope - -Telecommunication charge cards may be issued by Operating Agencies (OAs) to allow customers to use their card in connection with various international services at appropriate charges for each transaction and have the charges billed to their account in the country where the OA issued the charge card. Cards issued by OAs in accordance with this Recommendation conform to the appropriate ISO Standards. - -## 2 References - -The following ITU-T Recommendations and other references contain provisions which, through reference in this text, constitute provisions of this Recommendation. At the time of publication, the editions indicated were valid. All Recommendations and other references are subject to revision; users of this Recommendation are therefore encouraged to investigate the possibility of applying the most recent edition of the Recommendations and other references listed below. A list of the currently valid ITU-T Recommendations is regularly published. The reference to a document within this Recommendation does not give it, as a stand-alone document, the status of a Recommendation. - -- [1] ISO/IEC 7812-1:2000, *Identification cards – Identification of issuers – Part 1: Numbering system*. -- [2] ITU-T Recommendation E.164 (2005), *The international public telecommunication numbering plan*. -- [3] ISO/IEC 7812-2:2000, *Identification cards – Identification of issuers – Part 2: Application and registration procedures*. - -## 3 Abbreviations - -This Recommendation uses the following abbreviations: - -- IC Integrated Circuit -- IIN Issuer Identifier Number -- MII Major Industry Identifier - -## 4 Numbering system - -### 4.1 Card numbering structure - -The numbering of the card to be issued by OAs shall be as follows based on ISO/IEC 7812-1 [1] (Identification cards – Identification of issuers – Part 1: Numbering system) and ISO/IEC 7812-2 [3] (Identification cards – Identification of issuers – Part 2: Application and registration procedures). - -The maximum length of the visible card number (primary account number) shall be 19 characters and is composed of the following subparts (see Figure 1): - -- Major Industry Identifier (MII); -- country code; -- issuer identifier; -- individual account identification number; -- parity check digit computed according to the Luhn formula (see ISO/IEC 7812-1, Annex B [1]). In addition to the parity check digit, OAs may incorporate a validation check device in some location on the card which could be changed when new cards are issued. - -NOTE – Major industry and issuer identifier numbers of the form 66xxxx have already been assigned to some Administrations as a transitional measure. Charge cards of this type are fully compatible with ISO Standards. - -![Diagram of the charge card numbering system showing the structure of the 19-digit primary account number. The diagram is a horizontal bar divided into 19 cells. The first cell contains '8', the second contains '9'. Brackets above the bar label the first two cells as 'Issuer identification number (digits variable, maximum 7)'. A bracket above the entire 19-cell bar is labeled 'Primary account number 19 visible characters (maximum)'. Below the bar, arrows point from descriptive text to specific parts: 'Major industry identifier (MII) (ISO/IEC 7812-1) [1] "89" is assigned for telecommunication purposes' points to the first cell; 'Country code: ITU-T Rec. E.164 [2] (variable, 1 to 3 digits)' points to the second cell; 'Issuer identifier number (variable, but fixed number of digits within a country or world zone where appropriate)' points to a group of cells following the country code; 'Individual account identification number (variable, but fixed number of digits for each particular issuer identifier number)' points to the middle section of cells; and 'Luhn check digit' points to the final cell. The label 'E.118_F01' is in the bottom right.](d0abac95583b52a3b35f74a215567334_img.jpg) - -Diagram of the charge card numbering system showing the structure of the 19-digit primary account number. The diagram is a horizontal bar divided into 19 cells. The first cell contains '8', the second contains '9'. Brackets above the bar label the first two cells as 'Issuer identification number (digits variable, maximum 7)'. A bracket above the entire 19-cell bar is labeled 'Primary account number 19 visible characters (maximum)'. Below the bar, arrows point from descriptive text to specific parts: 'Major industry identifier (MII) (ISO/IEC 7812-1) [1] "89" is assigned for telecommunication purposes' points to the first cell; 'Country code: ITU-T Rec. E.164 [2] (variable, 1 to 3 digits)' points to the second cell; 'Issuer identifier number (variable, but fixed number of digits within a country or world zone where appropriate)' points to a group of cells following the country code; 'Individual account identification number (variable, but fixed number of digits for each particular issuer identifier number)' points to the middle section of cells; and 'Luhn check digit' points to the final cell. The label 'E.118\_F01' is in the bottom right. - -**Figure 1/E.118 – Charge card numbering system** - -### 4.2 Issuer identifier number assignment and registration procedure - -- The assignment of specific issuer identifier numbers should be the responsibility of a country or group of countries as appropriate. These numbers should only be assigned to OAs with the agreement of their Administrations. -- These issuer identifier numbers are normally used to distinguish among multiple OAs who issue cards within a country. However, these numbers may also be used to distinguish individual countries sharing the same country code (as defined in ITU-T Rec. E.164 [2]) or, if appropriate, to distinguish both countries and issuers. -- The Director of TSB is responsible for the registration and/or cancellation of issuer identifier numbers (IINs) for OAs with the approval of their Administrations. An illustrative registration form is contained in Figure 2. - -- d) A one-time fee shall be collected in order for an IIN to be assigned and registered by TSB. Applications shall be accompanied by evidence of payment to ITU of the one-time fee. -- e) In the event of technical or operational difficulties in allocating an IIN, the Director of TSB should consult the Chairman of Study Group 2. -- f) The TSB shall maintain a list of the allocated IINs. -- g) Additions, deletions and changes to this list should be published in the first available ITU Operational Bulletin. -- h) The consolidated list of allocated IINs should be published periodically in the ITU Operational Bulletin. - -#### Registration form for a single Issuer Identifier Number for the international telecommunication charge card - -To be returned with registration fee to: - -INTERNATIONAL TELECOMMUNICATION UNION -TELECOMMUNICATION STANDARDIZATION BUREAU -PLACE DES NATIONS, CH - 1211 GENEVE 20, SWITZERLAND -FAX: +41 22 730 5853 - -##### A. TO BE COMPLETED BY APPLICANT (Card Issuer) - -| | | | -|----------------------------------------------------------------------------------------------------------------------------------------------------------|-----------|-----------------| -| Name or organization | | | -| Address to be registered (maximum two lines, 30 characters per line) | | | -| Principal contact in organization | | | -| Telephone number
+ | E-mail | Fax number
+ | -| Address for correspondence | | | -| Effective date of usage or cancellation | | | -| Date | Signature | | -| In signing this form, the applicant accepts that further IINs will not be assigned to identify products, services, technologies or geographic locations. | | | - -##### B. TO BE COMPLETED AND APPROVED BY THE TELECOMMUNICATIONS ADMINISTRATIONa) OR DULY AUTHORIZED COORDINATING ORGANIZATION - -- a) Action requested (check appropriate box)   Registration   or Cancellation -- b) Major industry identifier (MII): 89 -- c) Country code (CC): (according to the List, Complement to ITU-T Rec. E.164) -- d) Issuer identifier number: (according to ITU-T Rec. E.118) - -| | | -|--------------------------------|-----------| -| Name of approving organization | | -| Date | Signature | - -##### C. TO BE COMPLETED BY ITU (CENTRAL REGISTRATION AUTHORITY) - -| | | | | | | | | | -|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|---|---|--|--|--|--|--|-------| -| Issuer Identification Number registered or cancelled
8 9
| 8 | 9 | | | | | | Date: | -| 8 | 9 | | | | | | | | - -a) and/or Operating Agency (OA). - -#### METHOD OF PAYMENT (Please specify the form of payment used) - -- Switzerland: to ITU's current postal account, Geneva 12-50-3; -- All other countries:   - by international money order, or -  - by bank transfer to UBS SA, ITU Geneva, Geneva (Switzerland) -  ITU Account No. 240-C8765565.0 - -(Payment may also be effected by a cheque made out in another currency freely convertible into Swiss francs, provided that the cheque, when cashed and converted, will cover the amount of the registration fee in Swiss francs.) - -- By credit card   EUROCARD-MASTERCARD VISA AMERICAN EXPRESS - -Credit card number: Valid date: -Holder's name: Signature: - -(This form must be signed if you pay by credit card.) **Please note:** Letters of credit are not accepted. - -**Figure 2/E.118 – Illustrative registration form** - -### 4.3 Information content - -The information on an international telecommunication charge card shall clearly include: - -- 1) the card number (on a combined national/international card, the national number, if different, should be appropriately designated); - -and should optionally include: - -- 2) the name of the issuing OA1 and, where appropriate, the country of issue; -- 3) the card holder's name and signature; -- 4) the date of expiry, in the format of either "MM/YY" or "MM-YY"; -- 5) instructions on how the card should be used. (Some OAs may prefer to issue instructions separately.) - -In addition, the logo of the ITU may, at the card issuer's option, appear somewhere on the card to facilitate recognition of the card by card acceptors where presentation of the card is required as a part of the service (i.e., bureau services). - -## 5 Printed cards - -The charge card should be designed to be conveniently carried. Current ISO Standards define the dimensions of financial transaction cards to be 85.60 mm × 53.98 mm (3.370 × 2.125 inches) and the ITU-T considers that telephone charge cards issued by OAs should have similar dimensions. - -## 6 Magnetic stripe cards - -For maximum flexibility, convenience of use and economic benefits, the magnetic stripe cards to be issued by OAs should conform to the relevant ISO Standards concerning materials, recording techniques, physical dimensions and the type and format of embossed information. - -These are: - -- ISO/IEC 7810: Identification cards – Physical characteristics. -- ISO/IEC 7811-1: Identification cards – Recording technique – Part 1: Embossing. -- ISO/IEC 7811-2: Identification cards – Recording technique – Part 2: Magnetic stripe – Low coercivity. -- ISO/IEC 7811-6: Identification cards – Recording technique – Part 6: Magnetic stripe – High coercivity. -- ISO/IEC 7813: Identification cards – Financial transaction cards. - -### 6.1 Encoding requirements - -Track 2 of the magnetic stripe on the telecommunication charge card shall be used as a primary means of communicating data encoded on the magnetic stripe. The Primary Account Number (PAN) is the only field that is required to be encoded. An example of the encoding of this minimum information is contained in Table 1. - ---- - -1 Although optional, card issuer OAs are encouraged to include their name, where possible, to avoid problems when the card is presented to an operator. - -**Table 1/E.118 – Minimum encoding requirements** - -| | | | -|-----|-------------------------------|--------------------------------| -| STX | Start Sentinel | BCD 11 | -| PAN | Primary Account Number | 89...(e.g., 8912538360010000L) | -| FS | Field Separator | BCD 13 | -| ED | Expiration Date | BCD 13 | -| SC | Service Code | BCD 13 | -| DD | Discretionary Data | null | -| ETX | End Sentinel | BCD 15 | -| LRC | Longitudinal Redundancy Check | [1 digit] | - -Card issuers may, at their own discretion, encode data on track 2 of the telecommunication charge card in addition to the required information. This data is defined below. An example of the encoding of all such information (except discretionary data) is contained in Table 2. - -**Table 2/E.118 – Full encoding requirements** - -| | | | -|-----|-------------------------------|----------------------------------------------------------------------------------------------------------------------------------------| -| STX | Start Sentinel | BCD 11 | -| PAN | Primary Account Number | 89...(e.g., 9812538360010000L) | -| FS | Field Separator | BCD 13 | -| ED | Expiration Date | YYMM (e.g., "9612" for December 1996) | -| SC | Service Code | XXX (e.g., "125" – International use, positive authorization is mandatory, telecommunications services only with a PIN being required) | -| DD | Discretionary Data | ... | -| ETX | End Sentinel | BCD 15 | -| LRC | Longitudinal Redundancy Check | [1 digit] | - -### 6.2 Expiration date - -If the expiration date is embossed on the front of the telecommunication charge card, it should also be encoded on track 2 of the magnetic stripe. The format is defined by ISO/IEC 7813 as YYMM. The position of the expiration date is shown in Table 2 and is dependent on encoding requirements and service agreements. If the expiration date is not embossed on the front of the card and it is not encoded on the magnetic stripe, a field separator shall be encoded in its place (see Table 1). - -### 6.3 Service code - -OAs are encouraged to encode information within the service code field. If it is not encoded on the magnetic stripe, a field separator shall be encoded in its place (see Table 1). There are three positions to the service code field. The positions and the interpretation for each of the possible values are contained in Annex A. - -### 6.4 Discretionary data - -Any information contained in the discretionary data field is for further study. - -## 7 Integrated Circuit (IC) cards - -The standard for the IC card is to be established by ISO/IEC JTC 1/SC 17. In addition, specific applications (e.g., SIM cards in GSM applications and USIM cards in UMTS/IMT-2000 applications) may make use of alternative standards to address unique form factors of their application. - -## Annex A - -### Service code assignments - -Tables A.1 to A.3 describe the various values that may be used in each of the three positions of the service code field. For each value, the second column of each table describes how the value is interpreted specifically for cards defined by this Recommendation. - -The first digit of the service code describes the type of interchange permissible for the card. The second digit describes the level of authorization processing required to validate the card. For this Recommendation, this value is only interpreted for card systems using fully automated validation (see ITU-T Rec. E.113). The third digit describes the types of services allowable by the card holder. - -**Table A.1/E.118 – Permissible interchange values – Position 1** - -| Values | Telecommunication usage | -|--------|---------------------------------------------------------------------------| -| 0 | Not used | -| 1 | International use is permitted | -| 2 | International use is permitted for integrated circuit cards | -| 3 | Not used | -| 4 | Not used | -| 5 | Restricted to use on national networks only | -| 6 | Restricted to use on national networks only, for integrated circuit cards | -| 7 | Restricted for use only on the card issuer's network | -| 8 | Not used | -| 9 | Usable for test purposes only | - -**Table A.2/E.118 – Level of authorization – Position 2** - -| Values | Telecommunication usage | -|--------|----------------------------------------------------------------------------------------------------------------------------------------------------| -| 0 | No specific authorization defined | -| 1 | Not used | -| 2 | Positive authorization is required when used in a full validation environment | -| 3 | Not used | -| 4 | Positive authorization is required when used in a full validation environment but special backup arrangements are defined in the service agreement | -| 5 | Not used | -| 6 | Not used | -| 7 | Not used | -| 8 | Not used | -| 9 | Not used | - -**Table A.3/E.118 – Service availability – Position 3** - -| Values | Telecommunication usage | -|---------------|---------------------------------------------------------------------| -| 0 | Card not restricted to telecommunication services; PIN required | -| 1 | Card not restricted to telecommunication services | -| 2 | Can be used to charge telecommunication services only | -| 3 | Not used within the scope of ITU-T Rec. E.116 | -| 4 | Not used within the scope of ITU-T Rec. E.116 | -| 5 | Can be used to charge telecommunication services only; PIN required | -| 6 | Not used | -| 7 | Not used | -| 8 | Not used | -| 9 | Not used | - -## **Appendix I** - -### **Implementation guidelines for the assignment of issuer identifier numbers** - -Card issuers will be assigned a single Issuer Identifier Number (IIN) from the ITU's block of "89" IINs. To assist card issuers in effectively planning card services and the TSB in processing applications, the following information may be helpful: - -- a) Separate Issuer Identifier Numbers should not be used to differentiate between different products or services for which the card may be used. -- b) Separate Issuer Identifier Numbers should not be used to differentiate between technologies implemented in the card (e.g., magnetic stripe versus integrated circuit cards) or for products and services based on or implemented using different technologies (e.g., IP-based voice services versus circuit switched voice services). -- c) Separate Issuer Identifier Numbers should not be used to differentiate between different branches or subsidiaries of the same corporation. However, situations where card issuers operating in different countries or regulatory environments where different accounting or settlement rates exist, the assignment of additional IINs to a specific card issuer may be justified. - -If card issuers need to make such differentiation, different values within the leading digits of the Individual Account Identification should be used. - - - -## SERIES OF ITU-T RECOMMENDATIONS - -| | | -|-----------------|---------------------------------------------------------------------------------------------| -| Series A | Organization of the work of ITU-T | -| Series D | General tariff principles | -| Series E | Overall network operation, telephone service, service operation and human factors | -| Series F | Non-telephone telecommunication services | -| Series G | Transmission systems and media, digital systems and networks | -| Series H | Audiovisual and multimedia systems | -| Series I | Integrated services digital network | -| Series J | Cable networks and transmission of television, sound programme and other multimedia signals | -| Series K | Protection against interference | -| Series L | Construction, installation and protection of cables and other elements of outside plant | -| Series M | Telecommunication management, including TMN and network maintenance | -| Series N | Maintenance: international sound programme and television transmission circuits | -| Series O | Specifications of measuring equipment | -| Series P | Telephone transmission quality, telephone installations, local line networks | -| Series Q | Switching and signalling | -| Series R | Telegraph transmission | -| Series S | Telegraph services terminal equipment | -| Series T | Terminals for telematic services | -| Series U | Telegraph switching | -| Series V | Data communication over the telephone network | -| Series X | Data networks, open system communications and security | -| Series Y | Global information infrastructure, Internet protocol aspects and next-generation networks | -| Series Z | Languages and general software aspects for telecommunication systems | \ No newline at end of file diff --git a/marked/E/T-REC-E.164-201011-I_PDF-E/4801720824e4b5e2361a5564f91cfb70_img.jpg b/marked/E/T-REC-E.164-201011-I_PDF-E/4801720824e4b5e2361a5564f91cfb70_img.jpg deleted file mode 100644 index 84eb20f399b8c19bce0b743b67aa2cf41582cbad..0000000000000000000000000000000000000000 --- a/marked/E/T-REC-E.164-201011-I_PDF-E/4801720824e4b5e2361a5564f91cfb70_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:6f538780dca53b572ad79b34267dd8d0ccb546b05dead31456ffcf5abefe3b76 -size 17076 diff --git a/marked/E/T-REC-E.164-201011-I_PDF-E/4cec89a753c447a050c0171c274f2acb_img.jpg b/marked/E/T-REC-E.164-201011-I_PDF-E/4cec89a753c447a050c0171c274f2acb_img.jpg deleted file mode 100644 index 6f999f68b9cea4396625e87231ebc77c3ba17639..0000000000000000000000000000000000000000 --- a/marked/E/T-REC-E.164-201011-I_PDF-E/4cec89a753c447a050c0171c274f2acb_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:ace13e36665876f39e9a710657ae0c5949da10f704936373a1e08a01fef2bc72 -size 161274 diff --git a/marked/E/T-REC-E.164-201011-I_PDF-E/60e9207be66a64332619bb4b667fe67b_img.jpg b/marked/E/T-REC-E.164-201011-I_PDF-E/60e9207be66a64332619bb4b667fe67b_img.jpg deleted file mode 100644 index 3999afd8f0a90555a4f85ef1868aec2fb757d659..0000000000000000000000000000000000000000 --- a/marked/E/T-REC-E.164-201011-I_PDF-E/60e9207be66a64332619bb4b667fe67b_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:42e13d250b3680178113abc0b9cc387d1d924432075ae61479f51ffda7e620c0 -size 65593 diff --git a/marked/E/T-REC-E.164-201011-I_PDF-E/7f17c430b9598e4d748a8041457810b3_img.jpg b/marked/E/T-REC-E.164-201011-I_PDF-E/7f17c430b9598e4d748a8041457810b3_img.jpg deleted file mode 100644 index aa3b0d1cb28562aa404373ea56482662138accff..0000000000000000000000000000000000000000 --- a/marked/E/T-REC-E.164-201011-I_PDF-E/7f17c430b9598e4d748a8041457810b3_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:cc2fa182df22ca21f40e8da4f1e069f84c69b8672a0fc16b52ce5a9d3e238475 -size 22218 diff --git a/marked/E/T-REC-E.164-201011-I_PDF-E/a3dc41dc3df86ea68d266af2bf95cf5b_img.jpg b/marked/E/T-REC-E.164-201011-I_PDF-E/a3dc41dc3df86ea68d266af2bf95cf5b_img.jpg deleted file mode 100644 index dad02182b30e94f721c7f50726f60641c96df521..0000000000000000000000000000000000000000 --- a/marked/E/T-REC-E.164-201011-I_PDF-E/a3dc41dc3df86ea68d266af2bf95cf5b_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:45bf920a7798c0111eed0c87f3f277105f8935167814eaedd42f96a3f983bba0 -size 4024 diff --git a/marked/E/T-REC-E.164-201011-I_PDF-E/af7916c89a458fdab6c3f443217388ae_img.jpg b/marked/E/T-REC-E.164-201011-I_PDF-E/af7916c89a458fdab6c3f443217388ae_img.jpg deleted file mode 100644 index ff5373b160b3b77708204da928166f09ab476c24..0000000000000000000000000000000000000000 --- a/marked/E/T-REC-E.164-201011-I_PDF-E/af7916c89a458fdab6c3f443217388ae_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:3ce3230bc368967ba038c8f4dcfa48a0c7fc99bae30bb211ea137011e1f144c8 -size 26123 diff --git a/marked/E/T-REC-E.164-201011-I_PDF-E/b0d322b2e75c75e1f21bfc0df841beaa_img.jpg b/marked/E/T-REC-E.164-201011-I_PDF-E/b0d322b2e75c75e1f21bfc0df841beaa_img.jpg deleted file mode 100644 index d3bdd1df8decdeed571829f903b974830cbafd45..0000000000000000000000000000000000000000 --- a/marked/E/T-REC-E.164-201011-I_PDF-E/b0d322b2e75c75e1f21bfc0df841beaa_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:a3e6cefb9af2aaafa3b04e59d0be145d7baec8454fc0df0c07eb5b2acee40a74 -size 19785 diff --git a/marked/E/T-REC-E.164-201011-I_PDF-E/bffdddb47fced140f8d17fdc2a29f592_img.jpg b/marked/E/T-REC-E.164-201011-I_PDF-E/bffdddb47fced140f8d17fdc2a29f592_img.jpg deleted file mode 100644 index fc88ba8d3332f91849226f555c84fdb054362208..0000000000000000000000000000000000000000 --- a/marked/E/T-REC-E.164-201011-I_PDF-E/bffdddb47fced140f8d17fdc2a29f592_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:5813905c30026ce03a882f30c71bb16b4c64b21c86d6c13ea94ecf12e77b8412 -size 19892 diff --git a/marked/E/T-REC-E.164-201011-I_PDF-E/d4af765160d04ecef538e5066006dc77_img.jpg b/marked/E/T-REC-E.164-201011-I_PDF-E/d4af765160d04ecef538e5066006dc77_img.jpg deleted file mode 100644 index 65ec5a9f11b4d15958a848d7ea4f65ed77a1e47d..0000000000000000000000000000000000000000 --- a/marked/E/T-REC-E.164-201011-I_PDF-E/d4af765160d04ecef538e5066006dc77_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:5daa0c1e4b02efd0f792757768d152b4082d283c87d3602a7c624cd24c91c02a -size 38805 diff --git a/marked/E/T-REC-E.164-201011-I_PDF-E/e9d825d87c5f85c8dba0664eace96ef4_img.jpg b/marked/E/T-REC-E.164-201011-I_PDF-E/e9d825d87c5f85c8dba0664eace96ef4_img.jpg deleted file mode 100644 index b1f3f19bf7ec3eade43c6d0a3cac57873c2e5c3d..0000000000000000000000000000000000000000 --- a/marked/E/T-REC-E.164-201011-I_PDF-E/e9d825d87c5f85c8dba0664eace96ef4_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:7b8b95d12e5f367eb59ef79edc87be169b4ef745c6c7f8a7bc1d31882979a03a -size 25708 diff --git a/marked/E/T-REC-E.164-201011-I_PDF-E/raw.md b/marked/E/T-REC-E.164-201011-I_PDF-E/raw.md deleted file mode 100644 index cdc923c2b052b433f3b688cd17e84ef8d034b25b..0000000000000000000000000000000000000000 --- a/marked/E/T-REC-E.164-201011-I_PDF-E/raw.md +++ /dev/null @@ -1,1062 +0,0 @@ - - -**ITU-T** - -TELECOMMUNICATION -STANDARDIZATION SECTOR -OF ITU - -**E.164** - -(11/2010) - -SERIES E: OVERALL NETWORK OPERATION, -TELEPHONE SERVICE, SERVICE OPERATION AND -HUMAN FACTORS - -International operation – Numbering plan of the -international telephone service - -# --- **The international public telecommunication numbering plan** - -Recommendation ITU-T E.164 - -## ITU-T E-SERIES RECOMMENDATIONS **OVERALL NETWORK OPERATION, TELEPHONE SERVICE, SERVICE OPERATION AND HUMAN FACTORS** - -| | | -|---------------------------------------------------------------------------------------------------|--------------------| -| INTERNATIONAL OPERATION | | -| Definitions | E.100–E.103 | -| General provisions concerning Administrations | E.104–E.119 | -| General provisions concerning users | E.120–E.139 | -| Operation of international telephone services | E.140–E.159 | -| Numbering plan of the international telephone service | E.160–E.169 | -| International routing plan | E.170–E.179 | -| Tones in national signalling systems | E.180–E.189 | -| Numbering plan of the international telephone service | E.190–E.199 | -| Maritime mobile service and public land mobile service | E.200–E.229 | -| OPERATIONAL PROVISIONS RELATING TO CHARGING AND ACCOUNTING IN THE INTERNATIONAL TELEPHONE SERVICE | | -| Charging in the international telephone service | E.230–E.249 | -| Measuring and recording call durations for accounting purposes | E.260–E.269 | -| UTILIZATION OF THE INTERNATIONAL TELEPHONE NETWORK FOR NON-TELEPHONY APPLICATIONS | | -| General | E.300–E.319 | -| Phototelegraphy | E.320–E.329 | -| ISDN PROVISIONS CONCERNING USERS | E.330–E.349 | -| INTERNATIONAL ROUTING PLAN | E.350–E.399 | -| NETWORK MANAGEMENT | | -| International service statistics | E.400–E.404 | -| International network management | E.405–E.419 | -| Checking the quality of the international telephone service | E.420–E.489 | -| TRAFFIC ENGINEERING | | -| Measurement and recording of traffic | E.490–E.505 | -| Forecasting of traffic | E.506–E.509 | -| Determination of the number of circuits in manual operation | E.510–E.519 | -| Determination of the number of circuits in automatic and semi-automatic operation | E.520–E.539 | -| Grade of service | E.540–E.599 | -| Definitions | E.600–E.649 | -| Traffic engineering for IP-networks | E.650–E.699 | -| ISDN traffic engineering | E.700–E.749 | -| Mobile network traffic engineering | E.750–E.799 | -| QUALITY OF TELECOMMUNICATION SERVICES: CONCEPTS, MODELS, OBJECTIVES AND DEPENDABILITY PLANNING | | -| Terms and definitions related to the quality of telecommunication services | E.800–E.809 | -| Models for telecommunication services | E.810–E.844 | -| Objectives for quality of service and related concepts of telecommunication services | E.845–E.859 | -| Use of quality of service objectives for planning of telecommunication networks | E.860–E.879 | -| Field data collection and evaluation on the performance of equipment, networks and services | E.880–E.899 | -| OTHER | E.900–E.999 | -| INTERNATIONAL OPERATION | | -| Numbering plan of the international telephone service | E.1100–E.1199 | -| NETWORK MANAGEMENT | | -| International network management | E.4100–E.4199 | - -For further details, please refer to the list of ITU-T Recommendations. - -# Recommendation ITU-T E.164 - -# The international public telecommunication numbering plan - -# Summary - -Recommendation ITU-T E.164 provides the number structure and functionality for the five categories of numbers used for international public telecommunication: geographic areas, global services, Networks, groups of countries (GoC) and resources for trials. For each of the categories, it details the components of the numbering structure and the digit analysis required to successfully route the calls. Annex A provides additional information on the structure and function of international public telecommunication numbers (hereafter referred to as "international ITU-T E.164-numbers"). Annex B provides information on network identification, service parameters, calling/connected line identity, dialling procedures and addressing for geographic-based ISDN calls. Specific ITU-T E.164-based applications, which differ in usage, are defined in separate ITU-T Recommendations. - -## History - -| Edition | Recommendation | Approval | Study Group | -|---------|-----------------------------|------------|-------------| -| 1.0 | ITU-T E.164/I.331 | 1984-10-19 | | -| 2.0 | ITU-T E.164/I.331/Q.11 bis | 1988-11-25 | | -| 3.0 | ITU-T E.164/I.331 | 1991-08-23 | II | -| 4.0 | ITU-T E.164 | 1997-05-30 | 2 | -| 4.1 | ITU-T E.164 Suppl. 2 | 1998-11-13 | 2 | -| 4.2 | ITU-T E.164 Suppl. 3 | 2002-05-16 | 2 | -| 4.3 | ITU-T E.164 Suppl. 4 | 2003-05-02 | 2 | -| 4.4 | ITU-T E.164 Suppl. 5 | 2008-05-15 | 2 | -| 5.0 | ITU-T E.164 | 2005-02-24 | 2 | -| 6.0 | ITU-T E.164 | 2010-11-18 | 2 | -| 6.1 | ITU-T E.164 Suppl. 1 | 1998-03-09 | 2 | -| 6.2 | ITU-T E.164 Suppl. 2 | 2009-11-24 | 2 | -| 6.3 | ITU-T E.164 Suppl. 3 | 2004-05-28 | 2 | -| 6.4 | ITU-T E.164 Suppl. 3 Amd. 1 | 2009-11-24 | 2 | -| 6.5 | ITU-T E.164 Suppl. 4 | 2004-05-28 | 2 | -| 6.6 | ITU-T E.164 Suppl. 4 Amd. 1 | 2009-11-24 | 2 | -| 6.7 | ITU-T E.164 Suppl. 5 | 2009-11-24 | 2 | - -## FOREWORD - -The International Telecommunication Union (ITU) is the United Nations specialized agency in the field of telecommunications, information and communication technologies (ICTs). The ITU Telecommunication Standardization Sector (ITU-T) is a permanent organ of ITU. ITU-T is responsible for studying technical, operating and tariff questions and issuing Recommendations on them with a view to standardizing telecommunications on a worldwide basis. - -The World Telecommunication Standardization Assembly (WTSA), which meets every four years, establishes the topics for study by the ITU-T study groups which, in turn, produce Recommendations on these topics. - -The approval of ITU-T Recommendations is covered by the procedure laid down in WTSA Resolution 1. - -In some areas of information technology which fall within ITU-T's purview, the necessary standards are prepared on a collaborative basis with ISO and IEC. - -## NOTE - -In this Recommendation, the expression "Administration" is used for conciseness to indicate both a telecommunication administration and a recognized operating agency. - -Compliance with this Recommendation is voluntary. However, the Recommendation may contain certain mandatory provisions (to ensure, e.g., interoperability or applicability) and compliance with the Recommendation is achieved when all of these mandatory provisions are met. The words "shall" or some other obligatory language such as "must" and the negative equivalents are used to express requirements. The use of such words does not suggest that compliance with the Recommendation is required of any party. - -## INTELLECTUAL PROPERTY RIGHTS - -ITU draws attention to the possibility that the practice or implementation of this Recommendation may involve the use of a claimed Intellectual Property Right. ITU takes no position concerning the evidence, validity or applicability of claimed Intellectual Property Rights, whether asserted by ITU members or others outside of the Recommendation development process. - -As of the date of approval of this Recommendation, ITU had not received notice of intellectual property, protected by patents, which may be required to implement this Recommendation. However, implementers are cautioned that this may not represent the latest information and are therefore strongly urged to consult the TSB patent database at . - -© ITU 2011 - -All rights reserved. No part of this publication may be reproduced, by any means whatsoever, without the prior written permission of ITU. - -# CONTENTS - -| | | Page | -|------|----------------------------------------------------------------------------------------------------|------| -| 1 | Introduction ..... | 1 | -| 2 | Scope ..... | 1 | -| 3 | References..... | 1 | -| 4 | Definitions ..... | 3 | -| 4.1 | country code (CC) for geographic areas..... | 3 | -| 4.2 | country code (CC) for global services..... | 3 | -| 4.3 | country code (CC) for groups of countries..... | 3 | -| 4.4 | country code (CC) for networks ..... | 3 | -| 4.5 | country code (CC) for trials..... | 3 | -| 4.6 | destination network (DN) code ..... | 3 | -| 4.7 | global service..... | 3 | -| 4.8 | global subscriber number (GSN)..... | 3 | -| 4.9 | group identification code (GIC) ..... | 3 | -| 4.10 | group identification code administrator (GICA) ..... | 3 | -| 4.11 | groups of countries (GoC)..... | 4 | -| 4.12 | identification code (IC)..... | 4 | -| 4.13 | Network ..... | 4 | -| 4.14 | trial identification codes ..... | 4 | -| 4.15 | trials ..... | 4 | -| 5 | Abbreviations..... | 4 | -| 6 | International ITU-T E.164-number structure ..... | 5 | -| 6.1 | International ITU-T E.164-number length ..... | 5 | -| 6.2 | Structure of the international ITU-T E.164-number..... | 5 | -| 6.3 | Assignment of country codes (CCs)..... | 8 | -| 6.4 | Assignment of identification codes, group identification codes and trial identification codes..... | 8 | -| 7 | International ITU-T E.164-number for geographic areas..... | 8 | -| 7.1 | Country code for geographic areas..... | 8 | -| 7.2 | National (significant) number..... | 9 | -| 7.3 | Prefixes ..... | 9 | -| 7.4 | National numbering plan ..... | 10 | -| 7.5 | Digit analysis ..... | 11 | -| 8 | International ITU-T E.164-number for global services..... | 11 | -| 8.1 | Country code for global services..... | 11 | -| 8.2 | Global subscriber number..... | 12 | -| 8.3 | Digit analysis ..... | 12 | -| 8.4 | Evolution path to an international ITU-T E.164-number for global services ..... | 12 | - -| | Page | | -|---------|-------------------------------------------------------------------------------------------------------------|----| -| 9 | International ITU-T E.164-number for Networks ..... | 12 | -| 9.1 | Country code for Networks ..... | 12 | -| 9.2 | Identification code ..... | 12 | -| 9.3 | Subscriber numbers ..... | 12 | -| 9.4 | Digit analysis ..... | 13 | -| 10 | International ITU-T E.164-number for groups of countries..... | 13 | -| 10.1 | Country code for groups of countries..... | 13 | -| 10.2 | Group identification code ..... | 13 | -| 10.3 | Subscriber numbers ..... | 13 | -| 10.4 | Digit analysis ..... | 13 | -| 11 | International ITU-T E.164-numbering resources for Trials ..... | 14 | -| 12 | International prefix ..... | 14 | -| 13 | Recommendation history ..... | 14 | -| Annex A | – Clarification and explanation of the structure and function of international
ITU-T E.164-numbers ..... | 15 | -| A.1 | Scope ..... | 15 | -| A.2 | Structure ..... | 15 | -| A.3 | Number length ..... | 15 | -| A.4 | Unique identification of international ITU-T E.164-number for
geographic areas ..... | 17 | -| A.5 | Unique identification of international ITU-T E.164-number for global
services ..... | 17 | -| A.6 | Unique identification of international ITU-T E.164-number for Networks... | 17 | -| A.7 | Unique identification of international ITU-T E.164-number for groups of
countries ..... | 18 | -| A.8 | Non-ITU-T E.164 numbers ..... | 18 | -| Annex B | – Application of international ITU-T E.164-numbers for ISDN ..... | 20 | -| B.1 | Scope ..... | 20 | -| B.2 | ISDN numbers ..... | 20 | -| B.3 | Addressing ..... | 20 | -| B.4 | Dialling procedures ..... | 21 | -| B.5 | Network identification..... | 21 | -| B.6 | Service parameters..... | 22 | -| B.7 | Calling/connected line identity ..... | 22 | - -# Recommendation ITU-T E.164 - -# The international public telecommunication numbering plan - -# 1 Introduction - -The rapid advances in telecommunication technology coupled with increased diversification of customer demands served by a number of different types of dedicated public switched networks (fixed and mobile telephone, data, etc.) have created a need to provide a uniform customer access to the multitude of network structures (i.e., circuit, packet, IP-based, etc.). Implementation of these network architectures is ongoing in a number of countries and eventually these will be able to carry the full range of existing and new services. - -To provide a broad base for these new arrangements, numbering has been kept compatible with that originally established for international telephone service. - -# 2 Scope - -This Recommendation provides the number structure and functionality for the five categories of numbers used for international public telecommunication: geographic areas, global services, networks, groups of countries (GoC) and resources for trials. For each of the categories, it details the components of the numbering structure and the digit analysis required to successfully route the calls. Annex A provides additional information on the structure and function of international public telecommunication numbers (hereafter referred to as "international ITU-T E.164-numbers"). Annex B provides information on network identification, service parameters, calling/connected line identity, dialling procedures and addressing for geographic-based ISDN calls. Specific ITU-T E.164-based applications, which differ in usage, are defined in separate ITU-T Recommendations, e.g., [ITU-T E.168], Application of E.164 numbering plan for UPT. - -# 3 References - -The following ITU-T Recommendations and other references contain provisions which, through reference in this text, constitute provisions of this Recommendation. At the time of publication, the editions indicated were valid. All Recommendations and other references are subject to revision; users of this Recommendation are therefore encouraged to investigate the possibility of applying the most recent edition of the Recommendations and other references listed below. A list of the currently valid ITU-T Recommendations is regularly published. The reference to a document within this Recommendation does not give it, as a stand-alone document, the status of a Recommendation. - -- [ITU-T E.101] Recommendation ITU-T E.101 (2009), *Definitions of terms used for identifiers (names, numbers, addresses and other identifiers) for public telecommunication services and networks in the E-series Recommendations.* -- [ITU-T E.123] Recommendation ITU-T E.123 (2001), *Notation for national and international telephone numbers, e-mail addresses and web addresses.* -- [ITU-T E.129] Recommendation ITU-T E.129 (2002), *Presentation of national numbering plans.* -- [ITU-T E.131] Recommendation ITU-T E.131 (1988), *Subscriber control procedures for supplementary telephone services.* -- [ITU-T E.164.1] Recommendation ITU-T E.164.1 (2005), *Criteria and procedures for the reservation, assignment and reclamation of E.164 country codes and associated identification codes (ICs).* - -- [ITU-T E.164.2] Recommendation ITU-T E.164.2 (2001), *E.164 numbering resources for trials.* -- [ITU-T E.164.3] Recommendation ITU-T E.164.3 (2001), *Principles, criteria and procedures for the assignment and reclamation of E.164 country codes and associated identification codes for groups of countries.* -- [ITU-T E.166] Recommendation ITU-T E.166/X.122 (1998), *Numbering plan interworking for the E.164 and X.121 numbering plans.* -- [ITU-T E.168] Recommendation ITU-T E.168 (2002), *Application of E.164 numbering plan for UPT.* -- [ITU-T E.169] Recommendation ITU-T E.169 (2002), *Application of Recommendation E.164 numbering plan for universal international numbers for international telecommunications services using country codes for global services.* -- [ITU-T E.169.1] Recommendation ITU-T E.169.1 (2001), *Application of Recommendation E.164 numbering plan for universal international freephone numbers for international freephone service.* -- [ITU-T E.169.2] Recommendation ITU-T E.169.2 (2000), *Application of Recommendation E.164 numbering plan for universal international premium rate numbers for the international premium rate service.* -- [ITU-T E.169.3] Recommendation ITU-T E.169.3 (2000), *Application of Recommendation E.164 numbering plan for universal international shared cost numbers for international shared cost service.* -- [ITU-T E.190] Recommendation ITU-T E.190 (1997), *Principles and responsibilities for the management, assignment and reclamation of E-series international numbering resources.* -- [ITU-T E.191] Recommendation ITU-T E.191 (2000), *B-ISDN addressing.* -- [ITU-T E.213] Recommendation ITU-T E.213 (1988), *Telephone and ISDN numbering plan for land mobile stations in public land mobile networks (PLMN).* -- [ITU-T E.214] Recommendation ITU-T E.214 (2005), *Structure of the land mobile global title for the signalling connection control part (SCCP).* -- [ITU-T E.331] Recommendation ITU-T E.331 (1991), *Minimum user-terminal interface for a human user entering address information into an ISDN terminal.* -- [WTSA Res.20] ITU WTSA (Florianopolis, 2004) *Resolution 20, Procedures for allocation and management of international telecommunication numbering, naming, addressing and identification resources.* -- [ETSI ETS 300 738] ETSI ETS 300 738 ed.1 (1997-06), *Human Factors (HF); Minimum Man-Machine Interface (MMI) to public network based supplementary services.* -- [ETSI TS 100 907] ETSI TS 100 907 V7.1.0 (1999-08), *Digital cellular telecommunications system (Phase 2+) (GSM); Man-Machine Interface (MMI) of the Mobile Station (MS) (GSM 02.30 version 7.1.0 Release 1998).* - -# 4 Definitions - -Within the integrated service environment, the terms used for all networks and services must be compatible and consistent. The following definitions can be found in [ITU-T E.101]. - -"Address", "dialling plan", "international prefix", "international public telecommunication number", "name", "national (significant) number", "national trunk prefix", "national destination code", "numbering plan", "prefix", "subscriber number" and "trunk code". - -This Recommendation defines the following terms. - -## 4.1 country code (CC) for geographic areas - -The combination of one, two or three digits identifying a specific country, countries in an integrated numbering plan, or a specific geographic area. - -## 4.2 country code (CC) for global services - -A 3-digit country code used to identify the global service. - -## 4.3 country code (CC) for groups of countries - -A shared 3-digit country code used in combination with a group identification code to identify a group of countries. - -## 4.4 country code (CC) for networks - -A shared 3-digit country code used in combination with an identification code to identify an international Network. - -## 4.5 country code (CC) for trials - -A shared 3-digit country code used in combination with a 3-digit trial identification code to identify a trial. - -## 4.6 destination network (DN) code - -An optional code field within the international ITU-T E.164-numbering plan which identifies the destination network serving the destination subscriber. It performs the destination network selection function of the NDC. In some instances, it can be combined with a trunk code to form the NDC. The DN code can be a decimal digit or a combination of decimal digits (not including any prefix). - -## 4.7 global service - -A service defined by ITU-T, provisioned on the public switched network, to which ITU-T has assigned a specific country code to enable the provision of that international service between two or more countries and/or integrated numbering plans. - -## 4.8 global subscriber number (GSN) - -The portion of the international ITU-T E.164-number that identifies a subscriber for a particular global service. - -## 4.9 group identification code (GIC) - -A one-digit identification code assigned to a group of countries. - -## 4.10 group identification code administrator (GICA) - -The organization entrusted by the assignee with the administration and management of the numbering resources behind a specific CC+GIC. - -## **4.11 groups of countries (GoC)** - -Several ITU- or UN-recognized countries sharing the same CC+GIC. - -## **4.12 identification code (IC)** - -The code subsequent to a country code for Networks that uniquely identifies an international Network. - -## **4.13 Network** - -Internationally interconnected physical nodes and operational systems operated and maintained by one or more ROAs to provide public telecommunications services. Private networks are not included in this definition. Note that the use of capital "N" in Networks indicates that this definition applies. - -## **4.14 trial identification codes** - -Three-digit identification codes that uniquely identify international public correspondence service trial participants. - -## **4.15 trials** - -The temporary implementation of a proposed new international public correspondence service for the purpose of determining its technical, operational, and business viability. - -# **5 Abbreviations** - -This Recommendation uses the following abbreviations: - -| | | -|-------|----------------------------------------------------------------------------------| -| CC | Country Code | -| CCITT | International Telegraph and Telephone Consultative Committee | -| CDLI | Called Line Identity | -| CLI | Calling Line Identity | -| COLI | Connected Line Identity | -| DN | Destination Network | -| GoC | Groups of Countries | -| GIC | Group Identification Code | -| GICA | Group Identification Code Administrator | -| GSN | Global Subscriber Number | -| IC | Identification Code | -| ISDN | Integrated Services Digital Network | -| ITU | International Telecommunication Union | -| ITU-T | International Telecommunication Union – Telecommunication Standardization Sector | -| NDC | National Destination Code | -| NPI | Numbering Plan Identifier | -| N(S)N | National (Significant) Number | -| NT2 | Network Termination 2 | -| PSTN | Public Switched Telephone Network | - -| | | -|------|------------------------------------------| -| ROA | Recognized Operating Agency | -| SA | Sub-Address | -| SN | Subscriber Number | -| TC | Trunk Code | -| TIC | Trial Identification Code | -| TON | Type of Number | -| TSB | Telecommunication Standardization Bureau | -| UIFN | Universal International Freephone Number | - -# 6 International ITU-T E.164-number structure - -This clause identifies five different structures for the international ITU-T E.164-number: - -- International ITU-T E.164-number for geographic areas. -- International ITU-T E.164-number for global services. -- International ITU-T E.164-number for Networks. -- International ITU-T E.164-number for groups of countries. -- International ITU-T E.164-number for trials. - -## 6.1 International ITU-T E.164-number length - -ITU-T recommends that the maximum number of digits for the international geographic, global services, Network and groups of countries applications should be 15 (excluding the international prefix). Administrations are invited to do their utmost to limit the digits to be dialled to the degree possible consistent with the service needs. - -## 6.2 Structure of the international ITU-T E.164-number - -The international ITU-T E.164-number is composed of a variable number of decimal digits arranged in specific code fields. The international ITU-T E.164-number code fields are the country code (CC) and remaining fields are specific to the use being made of the international ITU-T E.164 number as shown in Figures 1 to 5. - -A numbering plan does not include prefixes, suffixes, and additional information required to complete a call. - -**6.2.1** The international ITU-T E.164-number for geographic areas is composed of decimal digits arranged in two code fields: the country code (CC) and the national (significant) number N(S)N. The national (significant) number may be further subdivided into national destination code and subscriber number fields, according to national requirements, and is explained further in clause 7.2. This further subdivision is outside the scope of this Recommendation (see clause 7.4). - -Figure 1 shows the international ITU-T E.164-number structure for geographic areas. - -![Figure 1: International ITU-T E.164-number structure for geographic areas. The diagram shows three fields: CC (Country Code for geographic area), NDC (National Destination Code), and SN (Subscriber Number). CC is 1 to 3 digits. NDC is Max (15 - n) digits. SN is National (significant) number. The total length is Max 15 digits. The entire number is the International ITU-T E.164-number for geographic areas. E.164_F1](d4af765160d04ecef538e5066006dc77_img.jpg) - -CC Country Code for geographic area - NDC National Destination Code - SN Subscriber Number - n Number of digits in the country code - -Figure 1: International ITU-T E.164-number structure for geographic areas. The diagram shows three fields: CC (Country Code for geographic area), NDC (National Destination Code), and SN (Subscriber Number). CC is 1 to 3 digits. NDC is Max (15 - n) digits. SN is National (significant) number. The total length is Max 15 digits. The entire number is the International ITU-T E.164-number for geographic areas. E.164\_F1 - -NOTE – National and international prefixes are not part of the international ITU-T E.164-number for geographic areas. - -**Figure 1 – International ITU-T E.164-number structure for geographic areas** - -**6.2.2** The international ITU-T E.164-number for global services (Figure 2) is composed of decimal digits arranged in two fields. The international service number code fields are the 3-digit country code for global services and the global subscriber number (GSN) that can vary depending on the specific service. - -Figure 2 shows the international ITU-T E.164-number structure for global services. The use of this format is service specific and is dependent on the numbering requirements as detailed in the appropriate Recommendation, e.g., [ITU-T E.169], Application of Recommendation E.164 numbering plan for universal international numbers for international telecommunications services using country codes for global services. - -![Figure 2: International ITU-T E.164-number structure for global services. The diagram shows two fields: CC (Country Code for global services) and GSN (Global Subscriber Number). CC is 3 digits. GSN is Max 12 digits. The total length is Max 15 digits. The entire number is the International ITU-T E.164-number for global services. E.164_F2](7f17c430b9598e4d748a8041457810b3_img.jpg) - -CC Country Code for global services - GSN Global Subscriber Number - -Figure 2: International ITU-T E.164-number structure for global services. The diagram shows two fields: CC (Country Code for global services) and GSN (Global Subscriber Number). CC is 3 digits. GSN is Max 12 digits. The total length is Max 15 digits. The entire number is the International ITU-T E.164-number for global services. E.164\_F2 - -NOTE – National and international prefixes are not part of the international ITU-T E.164-number for global services. - -**Figure 2 – International ITU-T E.164-number structure for global services** - -**6.2.3** The international ITU-T E.164-number for Networks (Figure 3) is composed of decimal digits arranged in three code fields. The code fields are the three-digit country code (CC) for Networks field, the IC field, which varies in length from one to four digits, and the subscriber number (SN), which can be up to 15 digits minus the number of digits in the CC and IC fields. - -Figure 3 shows the international ITU-T E.164-number for Networks. - -![Diagram of International ITU-T E.164-number structure for Networks. It shows three fields: CC (Country Code for Networks) with 3 digits, IC (Identification Code) with 1 to 4 digits, and SN (Subscriber Number) with Max (12 - x) digits. The total length is Max 15 digits. The IC and SN fields together have a maximum length of 12 digits. The diagram is labeled E.164_F3.](af7916c89a458fdab6c3f443217388ae_img.jpg) - -E.164\_F3 - -Diagram of International ITU-T E.164-number structure for Networks. It shows three fields: CC (Country Code for Networks) with 3 digits, IC (Identification Code) with 1 to 4 digits, and SN (Subscriber Number) with Max (12 - x) digits. The total length is Max 15 digits. The IC and SN fields together have a maximum length of 12 digits. The diagram is labeled E.164\_F3. - -CC Country Code for Networks - -IC Identification Code - -SN Subscriber Number - -x Number of digits in Identification Code - -NOTE – National and international prefixes are not part of the international ITU-T E.164-number for Networks. - -**Figure 3 – International ITU-T E.164-number structure for Networks** - -**6.2.4** The international ITU-T E.164-number for groups of countries (Figure 4) is composed of decimal digits arranged in three code fields. The code fields are the three-digit country code (CC) for groups of countries field, the group identification code (GIC) field, which is fixed at one digit, and the subscriber number (SN) field which can be up to 15 digits minus the number of digits in the CC and GIC fields. - -Figure 4 shows the international ITU-T E.164-number for groups of countries. - -![Diagram of International ITU-T E.164-number structure for groups of countries. It shows three fields: CC (Country Code for Groups of Countries) with 3 digits, GIC (Group Identification Code) with 1 digit, and SN (Subscriber Number) with Max 11 digits. The total length is Max 15 digits. The GIC and SN fields together have a maximum length of 12 digits. The diagram is labeled E.164_F4.](e9d825d87c5f85c8dba0664eace96ef4_img.jpg) - -E.164\_F4 - -Diagram of International ITU-T E.164-number structure for groups of countries. It shows three fields: CC (Country Code for Groups of Countries) with 3 digits, GIC (Group Identification Code) with 1 digit, and SN (Subscriber Number) with Max 11 digits. The total length is Max 15 digits. The GIC and SN fields together have a maximum length of 12 digits. The diagram is labeled E.164\_F4. - -CC Country Code for Groups of Countries - -GIC Group Identification Code - -SN Subscriber Number - -NOTE – National prefixes are not part of the international ITU-T E.164-number for groups of countries. - -**Figure 4 – International ITU-T E.164-number structure for groups of countries** - -**6.2.5** The international ITU-T E.164 number for Trials (Figure 5) is composed of decimal digits arranged in two mandatory and one optional code fields. The code fields are the three-digit country code (CC) for trials and a one-digit trial identification code (TIC) field. An additional, optional subscriber number field may be deployed which can be up to 15 digits minus the number of digits in the CC and TIC fields. - -![Diagram showing the International ITU-T E.164-number structure for Trials. It consists of three main parts: 991 (3 digits), TIC (1 digit), and SN (Max 11 digits). The total length is Max 15 digits. The diagram also shows the relationship between the parts: 991 is 3 digits, TIC is 1 digit, SN is Max 11 digits, and the total length is Max 15 digits. The International ITU-T E.164-number for trials is the combination of all three parts.](4801720824e4b5e2361a5564f91cfb70_img.jpg) - -| | | | -|---------------------------------------------|---------|---------------| -| 991 | TIC | SN | -| 3 digits | 1 digit | Max 11 digits | -| Max 12 digits | | | -| Max 15 digits | | | -| International ITU-T E.164-number for trials | | | - -Diagram showing the International ITU-T E.164-number structure for Trials. It consists of three main parts: 991 (3 digits), TIC (1 digit), and SN (Max 11 digits). The total length is Max 15 digits. The diagram also shows the relationship between the parts: 991 is 3 digits, TIC is 1 digit, SN is Max 11 digits, and the total length is Max 15 digits. The International ITU-T E.164-number for trials is the combination of all three parts. - -TIC Trial Identification Code -SN Subscriber Number - -E.134(10)\_F5 - -NOTE – National prefixes are not part of the international ITU-T E.164-number for Trials. - -**Figure 5 – International ITU-T E.164-number structure for Trials** - -## 6.3 Assignment of country codes (CCs) - -6.3.1 Country codes may be assigned to either geographic areas, global services, Networks or groups of countries. - -6.3.2 The status of country codes for geographic areas, global services, Networks and groups of countries is published periodically by TSB. - -6.3.3 All spare country codes will be assigned on a three-digit basis. - -6.3.4 The assignment and reservation of country codes shall follow the criteria and procedures, as defined in [ITU-T E.164.1], for geographic areas, global services and Networks; in [ITU-T E.164.3] for groups of countries. - -6.3.5 The CC for trials (i.e., 991) has already been allocated and is not considered further. - -## 6.4 Assignment of identification codes, group identification codes and trial identification codes - -6.4.1 The list of assigned and reserved identification codes with their associated country codes is published periodically by TSB. - -6.4.2 The assignment and reservation of identification codes shall follow the criteria and procedures, as defined in [ITU-T E.164.1], or [ITU-T E.164.2], or [ITU-T E.164.3] as appropriate. - -# 7 International ITU-T E.164-number for geographic areas - -Principles, criteria and procedures for the assignment of international ITU-T E.164-numbers for geographic areas may be found in [ITU-T E.190], and [ITU-T E.164.1]. - -## 7.1 Country code for geographic areas - -The country code is used to select the destination country1 (i.e., the country where the identified subscriber is registered or the country containing a point where the service is provided) and varies in length from 1 to 3 digits. - -1 Whenever the term "country", "destination country" or "originating country" is used in this clause, it identifies a specific country, a group of countries in an integrated numbering plan or a specific geographical area. - -## 7.2 National (significant) number - -7.2.1 ITU-T recommends that the maximum number of digits of the national (significant) number, N(S)N, should be equal to $15 - n$ , where $n$ is the number of digits of the country code. - -7.2.2 The N(S)N is used to select the destination subscriber (in clause 7, the term "subscriber" means a human subscriber or a point where a service is provided). In selecting the destination subscriber, however, it may be necessary to select a destination network. To accomplish this selection, the N(S)N code field comprises a national destination code (NDC) followed by the subscriber's number (SN). The NDC and SN may be inseparably connected in some national applications to form a single composite dialling sequence. - -7.2.3 The NDC field, if used, will be variable in length depending upon the requirements of the destination country. Each NDC may have one of the following structures: - -- a) a destination network (DN) code, which can be used to select a destination network serving the destination subscribers; -- b) a trunk code (TC); -- c) any combination of destination network (DN) code and trunk code (TC). - -The NDCs of a geographic country code may consist of one of the above structures or others as defined by national numbering plan administrators. - -NOTE – The sequences DN-TC and TC-DN are a national matter. The various NDC options (TC/DN) are reflected in Figure 6. - -![](bffdddb47fced140f8d17fdc2a29f592_img.jpg) - -| | | | | -|---------------|--------|----|----| -| NDC Structure | Type 1 | DN | | -| NDC Structure | Type 2 | TC | | -| NDC Structure | Type 3 | DN | TC | -| NDC Structure | Type 4 | TC | DN | - -E:164(10)\_F6 - -**Figure 6 – Options for NDC structure** - -7.2.4 The SN varies in length depending on the requirements of the destination country. - -7.2.5 Where appropriate, identification of a specific network within the destination country shall be through the use of a NDC incorporated into the international ITU-T E.164-number. - -## 7.3 Prefixes - -### 7.3.1 Applications - -Prefixes are not part of the international ITU-T E.164-number and are not signalled over international boundaries. It is a national matter to decide whether prefixes can be signalled between domestic networks. - -Prefixes can also be used for carrier network and service selection nationally. - -### 7.3.2 National (trunk) prefix - -The national (trunk) prefix is not included in N(S)N. Accordingly, in the international service, the national (trunk) prefix of the country of destination must not be dialled. - -It should be noted that, in some countries, it is customary to consider for national purposes that the national (trunk) prefix is included in the national dialling plan, which is then not the N(S)N. A careful distinction must therefore be made between such national definition or practice and the ITU-T definition, which is internationally valid. In order to avoid misunderstanding, the ITU-T definition includes the word "significant" between brackets, reading as follows: "national (significant) number". - -It is recommended by ITU-T that the national numbering plan administrator of countries that have not yet adopted a trunk prefix for access to their national automatic trunk network adopt a prefix composed of a single digit, preferably 0. Irrespective of what digit is adopted as a trunk prefix, this digit should be precluded from being used also as a first digit of the N(S)N. - -The reasons for this recommendation are: - -- to provide the maximum degree of standardization of the national (trunk) prefixes used in different countries, so that dialling is made as easy as possible for a person travelling from one country to another; -- to minimize the number of digits to be dialled; -- to reduce user problems which arise because of the requirement, in automatic international operation, that the trunk prefix of the country of destination must not be dialled. - -In the automatic international service, following the international prefix and country code of the called country, the caller should dial the N(S)N of the called subscriber (i.e., without dialling the national (trunk) prefix). - -The use and printing of symbols and separators in national and international ITU-T E.164-numbers are detailed in [ITU-T E.123]. - -## **7.4 National numbering plan** - -### **7.4.1 Characteristics of a national numbering plan** - -Each national numbering plan administrator should give the most careful consideration to the preparation of a national numbering plan for its own network. This plan should be designed: - -- a) to allow generous provision for future growth in the number of subscribers and services to the national system; -- b) with the consideration that the national network will ultimately be accessible to subscribers in other countries by means of international dialling procedures; -- c) so that subscribers would always be called by either the same N(S)N or SN, a national matter, regardless of where the call originated from within the national numbering plan. - -The numbering plan will be based on and evolve from the existing numbering plans applicable to national and international public telephone networks. - -Where multiple destinations (e.g., ROAs or operators) serve the called party's geographical area, the national numbering plan in the country of destination shall provide for discrimination between these ROAs or operators. - -The ten-digit decimal character set 0-9 is used throughout the numbering plan format including the subscriber number, national (significant) number and the country code. - -Prefixes and other information concerned with identifying selection procedures or network service parameters (such as quality of service or transit delay) do not form part of the international number. - -An integrated numbering plan shall include an unambiguous identification of a particular country. In addition, the number will identify networks within these countries, if required. - -### **7.4.2 Notification of national numbering changes** - -National numbering plan administrators should advise ITU-T, on a non-binding informational basis, of significant national numbering plan changes well in advance of the event, so that this information can be published by TSB. It is recommended that this notification be submitted at least 2 years in advance to ensure formal and timely information to the widest possible distribution. - -National numbering plan administrators are encouraged to inform other national numbering plan administrators of significant national numbering plan changes well in advance of its implementation. [ITU-T E.129] provides a standardized method for presenting the national numbering plans of all countries (i.e., each country's national implementation of the international ITU-T E.164-numbering plan) as well as a method by which this information (and changes to this information) is made available to all interested parties. - -## **7.5 Digit analysis** - -### **7.5.1 In order to determine:** - -- the country of destination; -- the most appropriate network routing; -- the proper charging, - -the originating country must analyse a number of digits of the international ITU-T E.164-number. The length of the national destination code (NDC) increases the potential requirement for number analysis because it provides for a combination of either a trunk code (TC) and/or a network identification function. Careful consideration should be given to the preparation of the national destination code (NDC) assignments. - -### **7.5.2 On international calls, the number analysis performed at the originating country need not be more than the country code and:** - -- four digits of the N(S)N in the case of a country with a three-digit country code; -- five digits of the N(S)N in the case of a country with a two-digit country code; -- six digits of the N(S)N in the case of a country with a one-digit country code. - -#### **7.5.3 The national numbering plan of a country should be such that digit analysis for incoming international calls need not exceed established limits applicable to the N(S)N but allows:** - -- a) determination of routing that reflects economic and other appropriate network factors; -- b) distinctions for charging in those countries where distinctions are applicable. - -# **8 International ITU-T E.164-number for global services** - -The numbering plan for global services is service specific. Each use of an ITU-T E.164 country code for a global service needs to comply with numbering assignment principles, as specified in [ITU-T E.190], as identified for the specific service, and the criteria and procedures, as specified in [ITU-T E.164.1]. Refer to the appropriate numbering Recommendation for documentation regarding the numbering scheme and any service specific principles, e.g., [ITU-T E.168], Application of E.164 numbering plan for UPT. - -The international ITU-T E.164-number for global services is composed of the 3-digit country code applied for the global service and the global subscriber number (GSN). The maximum length is 15 digits (see Figure 2). - -## **8.1 Country code for global services** - -The country code for a global service is used to identify the global service and is three digits in length. - -## **8.2 Global subscriber number** - -The global subscriber number (GSN) consists of the digits following the country code for the global service. The structure and functionality of these digits is application dependent and will be addressed in the appropriate global service numbering Recommendations, e.g., [ITU-T E.169], Application of Recommendation E.164 numbering plan for universal international numbers for international telecommunications services using country codes for global services. - -## **8.3 Digit analysis** - -Digit analysis for global services is service specific. In order to determine the specific global service, and the call routing and charging, the digit analysis should not exceed seven digits, e.g., three-digit CC + 4 digits of N(S)N. Refer to the appropriate ITU-T numbering Recommendation for documentation regarding the number analysis requirements for the specific global service. - -## **8.4 Evolution path to an international ITU-T E.164-number for global services** - -The development of a numbering plan for a global service should consider the possibility for the subscribers, who already have a number for the same comparable domestic service, to evolve their domestic subscriber number (SN) to the global subscriber number (GSN). - -It is assumed that ITU-T recognized global services would be location independent. - -If in the implementation of the global service there are duplicate numbering requests and there are no service specific resolution procedures, then the duplicate request procedures should be invoked, as defined in [ITU-T E.169], Application of Recommendation E.164 numbering plan for universal international numbers for international telecommunications services using country codes for global services. - -# **9 International ITU-T E.164-number for Networks** - -Principles, criteria and procedures for the assignment of international ITU-T E.164-numbers for international Networks may be found in [ITU-T E.164.1] and [ITU-T E.190]. - -International ITU-T E.164-numbers used by Networks consist of three parts: a shared three-digit ITU-T E.164 country code for Networks, an identification code, and a subscriber number (see Figure 3). The maximum length of international ITU-T E.164-numbers used by Networks is fifteen (15) digits. - -## **9.1 Country code for Networks** - -These digits are the first three digits of international ITU-T E.164-numbers for Networks. A country code for Networks is a shared combination of three digits and is used in combination with the identification code to identify Networks. - -## **9.2 Identification code** - -An identification code (IC) is a combination of one to four digits used for identification of Networks. These digits follow the shared country code field within international ITU-T E.164-numbers for Networks. - -## **9.3 Subscriber numbers** - -Subscriber numbers are the remaining digits that follow the shared country code and the IC. The structure and functionality is determined by the operator. The maximum length of the subscriber number is 15 minus the total of the CC and IC digits. The minimum length of the subscriber number is: - -- nine digits with a one-digit IC; - -- eight digits with a two-digit IC; -- seven digits with a three-digit IC; -- six digits with a four-digit IC. - -Additionally, resources shorter in length than the required minimum number of digits are authorized following the CC + IC, on condition that the quantity of these resources is limited to 10% of the total capacity of the numbering resources for Networks determined by the operator. - -## 9.4 Digit analysis - -For calls utilizing the international ITU-T E.164-number for Networks, the maximum number of digits to be analysed is seven, which includes the three digits of the ITU-T E.164 country code, the identification code, and the initial significant digits (if any) of the subscriber number. A minimum of the 3-digit country code and IC must always be analysed to determine the appropriate routing and charging. - -# 10 International ITU-T E.164-number for groups of countries - -Principles, criteria and procedures for the assignment of international ITU-T E.164-numbers for groups of countries may be found in [ITU-T E.164.3] and [ITU-T E.190]. - -International ITU-T E.164-numbers used by groups of countries consist of three fields: a shared three-digit ITU-T E.164 country code for groups of countries; a one-digit group identification code; and a subscriber number to a maximum length of eleven digits (see Figure 4). The maximum length of international ITU-T E.164-number used by groups of countries is 15 digits. - -## 10.1 Country code for groups of countries - -These are the first three digits of international ITU-T E.164-number for groups of countries. A country code for groups of countries is a shared (i.e., shared between GoCs) three-digit CC used in combination with a single-digit GIC to uniquely identify a group of countries. - -## 10.2 Group identification code - -A group identification code (GIC) is a single-digit code used to uniquely identify a group of countries. The GIC immediately follows the shared country code field within the international ITU-T E.164-number for groups of countries. - -## 10.3 Subscriber numbers - -Subscriber numbers (SN) are the digits (to a maximum of eleven) which follow the CC + GIC fields and are used to identify individual subscribers or a point where a service is provided with the GoC. The minimum length of the subscriber number is nine digits, although a maximum of 10% of the total capacity of the numbering resources following the CC + GIC determined by the GoC is authorized to be shorter than nine digits in length. The structure and functionality of subscriber numbers is determined by the GoC and are administered and managed by the group identification code administrator (GICA). - -## 10.4 Digit analysis - -The maximum number of digits to be analysed for the processing of calls to international ITU-T E.164-numbers for groups of countries is seven. This includes the CC field (three-digit) plus the GIC field (one-digit) plus the first three digits of the subscriber number (SN). A minimum of four digits (i.e., CC + GIC) must always be analysed to determine the appropriate routing and charging. - -# **11 International ITU-T E.164-numbering resources for Trials** - -An ITU-T E.164 country code (i.e., 991) has been allocated to enable the conduct of trials of new international public correspondence services. Additionally, a three-digit trial identification code (TIC) field will be used in conjunction with the shared country code to uniquely designate trial numbers and participants. Details pertaining to the use of and the restrictions associated with this resource are contained in [ITU-T E.164.2]. - -# **12 International prefix** - -It is recommended by ITU-T that national numbering plan administrators that have not yet introduced automatic international operation, or national numbering plan administrators and international operators that are, for various reasons, defining or revising their numbering plans, adopt an international prefix (a code for access to the international automatic network) composed of the two digits 002. - -In accordance with [ITU-T E.123], the symbol "+" is recommended to indicate that an international prefix is required. - -# **13 Recommendation history** - -Recommendation ITU-T E.29, first issued in 1960 and subsequently revised. The first version was a renumbering of CCIF no. 26. - -Recommendation ITU-T E.161, first issued in 1964, was a renumbering of Recommendation ITU-T E.29. It was subsequently revised several times. - -Recommendation ITU-T E.163, first published in 1980, was the result of removing the number-related content from the 1976 version of Recommendation ITU-T E.161 and moving it to the new Recommendation ITU-T E.163. - -Recommendation ITU-T E.163 was withdrawn and its content merged with Recommendation ITU-T E.164 in 1991 (see below). - -Recommendation ITU-T E.164, first issued 1984. - -Recommendation ITU-T E.164, second issue 1988. - -Recommendation ITU-T E.164, third issue 1991 – merged with Recommendation ITU-T E.163 - -Recommendation ITU-T E.164, fourth issue 1997 – incorporates Recommendations ITU-T E.160 and E.162. - -Recommendation ITU-T E.164, fifth issue 2005. - -Recommendation ITU-T E.164, sixth issue 2010. - ---- - -2 Where there is a requirement for further discrimination between international operators and/or the different network services they provide, the method for accommodating this need is a national matter. - -# Annex A - -## Clarification and explanation of the structure and function of international ITU-T E.164-numbers - -(This annex forms an integral part of this Recommendation) - -## A.1 Scope - -**A.1.1** International ITU-T E.164-numbers are the basis for global addressing in fixed and mobile terminal networks. These numbering resources uniquely identify user-network interfaces, e.g., PSTN/ISDN, mobile terminals, and individuals utilizing specific global services, e.g., universal international freephone numbers (UIFNs). Most of the services/subscribers can be addressed directly, but in cases where indirect addressing is used, number translation is required, e.g., for UIFNs. - -**A.1.2** This annex provides clarification and explanation to the structure and functionality of international ITU-T E.164-numbers. These structures/functions are independent of the technical arrangement to record, charge or route the calls. - -## A.2 Structure - -**A.2.1** The international ITU-T E.164-number, which is the foundation of the hierarchy, consists of the country code plus the necessary additional elements (NDC + SN, GSN, IC + SN, or GIC+SN). The international ITU-T E.164-number exists only at the international level, i.e., the CC and GSN are combined to form a single dialling sequence. - -**A.2.2** In countries where NDC and SN are combined to form a single dialling sequence or where the NDC does not exist, the local and national levels are integrated and there is no difference between the subscriber number and the national (significant) number. - -**A.2.3** International ITU-T E.164-numbers have hierarchical structures as shown in Figure A.1. - -**A.2.4** When in the local level, typically the use of a national (trunk) prefix provides access to the national level, and the use of an international prefix provides access to the international level. - -**A.2.5** Numbers that only exist in the local, intraNetwork and/or national level are not considered international ITU-T E.164-numbers. - -## A.3 Number length - -### A.3.1 International ITU-T E.164-number for geographic areas - -**A.3.1.1** International ITU-T E.164-numbers for geographic areas have a maximum length of 15 digits. - -**A.3.1.2** The maximum length of national (significant) numbers is 15 digits minus the length of the country code. - -**A.3.1.3** The maximum length of subscriber numbers is 15 digits minus the length of the country code and the national destination code. - -![](60e9207be66a64332619bb4b667fe67b_img.jpg) - -**International ITU-T E.164-number for geographic areas** - -Local level SN -Subscriber number - -National level NDC SN -National (significant) number - -International level CC NDC SN - -**International ITU-T E.164-number for global services** - -International level CC GSN - -**International ITU-T E.164-number for Networks** - -IntraNetwork level SN - -International level CC IC SN - -**International ITU-T E.164-number for groups of countries** - -International level CC GIC SN - -E.164\_FA.1 - -NDC National Destination Code - CC Country Code - IC Identification Code - SN Subscriber Number - GSN Global Subscriber Number - GIC Group Identification Code - -NOTE – IntraNetwork level is used when calling and called parties are within the same network. - -**Figure A.1 – Hierarchical structures of international ITU-T E.164-numbers** - -**A.3.2 International ITU-T E.164-number for global services** - -The maximum length of a global subscriber number is 12 digits, since the country code assigned to global services is always three digits in length. - -**A.3.3 International ITU-T E.164-number for Networks** - -The maximum length of the combined identification code and subscriber number is 12 digits, since the country code for Networks is always three digits in length. - -**A.3.4 International ITU-T E.164-number for groups of countries** - -The maximum length of a subscriber number is 11 digits since the country code for groups of countries is always three digits in length and the group identification code is fixed at one digit. - -16 **Rec. ITU-T E.164 (11/2010)** - -### A.3.5 Summary of number length - -Table A.1 summarizes the maximum number length on each level for the four categories of international ITU-T E.164-numbers. - -**Table A.1 – Maximum number length** - -| Level | Geographic areas | Global services | Networks | Groups of Countries | -|---------------|--------------------------------------------|-----------------|----------------------------------------------|---------------------| -| Local | 15 minus
(number of digits in CC + NDC) | NA | NA | NA | -| National | 15 minus
(number of digits in CC) | NA | NA | NA | -| IntraNetwork | NA | NA | 15 minus
(number of digits
in CC + IC) | NA | -| International | 15 | 15 | 15 | 15 | - -NA Not Applicable - -## A.4 Unique identification of international ITU-T E.164-number for geographic areas - -**A.4.1** An international ITU-T E.164-number for geographic areas uniquely identifies a subscriber within a geographical area locally, nationally and internationally, i.e., dialling the subscriber number locally, the national (significant) number nationally and the international ITU-T E.164-number internationally always provides identification of the same subscriber. - -**A.4.2** The national (significant) number provides unique identification of one subscriber irrespective of where the call is generated from within the country or geographical area characterized by CC. - -**A.4.3** The subscriber number provides unique identification of one subscriber irrespective of where the call is generated from within a local area identified by NDC, where applicable. The subscriber number is a complete number and, therefore, cannot be separated. - -**A.4.4** Use of prefixes to distinguish the national (significant) number and the international number from the subscriber number does not alter the uniqueness of international ITU-T E.164-numbers. - -## A.5 Unique identification of international ITU-T E.164-number for global services - -The international ITU-T E.164-number for global services uniquely identifies subscribers only at the international level. The international ITU-T E.164-number for global services is a complete number, and, therefore, cannot be separated. - -## A.6 Unique identification of international ITU-T E.164-number for Networks - -For illustrative purposes only, it is assumed that intraNetwork dialling is by subscriber number. - -**A.6.1** An international ITU-T E.164-number for Networks uniquely identifies a subscriber within a Network, and internationally, i.e., dialling the subscriber number and the international ITU-T E.164-number, always provides identification of the same subscriber. - -**A.6.2** The subscriber number provides unique identification of one subscriber irrespective of where the call is generated from within the Network identified by CC + IC. The subscriber number is a complete number and, therefore, cannot be separated. - -**A.6.3** Use of an international prefix to distinguish the subscriber number and the international ITU-T E.164-number for Networks does not alter the uniqueness of international ITU-T E.164-numbers. - -## **A.7 Unique identification of international ITU-T E.164-number for groups of countries** - -The international ITU-T E.164-number for groups of countries uniquely identifies subscribers only at the international level. The international number for groups of countries is a complete number, and, therefore, cannot be separated. - -## **A.8 Non-ITU-T E.164 numbers** - -**A.8.1** Any number for geographical areas, global services, networks or groups of countries which does not conform to the structure, length and uniqueness as defined in this annex or in the main body of this Recommendation is not an international ITU-T E.164-number. - -**A.8.2** Non-ITU-T E.164 numbers may not be passed across any network boundaries without a specific bilateral agreement. - -**A.8.3** Listed below are some examples of non-ITU-T E.164 numbers from the first category of numbers. These examples are not exhaustive. - -#### **A.8.3.1 Local special purpose numbers** - -For example, local special purpose numbers (LSPNs) are numbers with significantly fewer digits than subscriber numbers, and which are valid for a specific purpose only, within a limited part of the same NDC area. - -The LSPNs are part of a hierarchical structure with three levels as follows: - -- Local level: LSPN. -- IntraNetwork level: NDC + LSPN. -- International level: CC + NDC + LSPN. - -Since LSPNs are significantly shorter than the subscriber numbers, they are within the limits of Table A.1. - -If LSPNs and NDC + LSPN terminate at the same service, then LSPN would be an international ITU-T E.164-number, but this is not the case in this example. In our example the LSPN terminates at, for instance, two different services within the NDC area, depending upon from where the calling user is located. LSPN and NDC + LSPN are ambiguous and therefore not international ITU-T E.164-numbers. - -#### **A.8.3.2 International special purpose numbers used nationally** - -In this example, the international special purpose numbers (ISPNs) are numbers with significantly fewer digits than ordinary subscriber numbers, and which only exist in an international format within the country which provides it. The digits of ISPN are identical to the leading digits of one or more subscriber numbers. - -Nationally, the ISPNs exist only at the international level as follows: - -- International level: CC + NDC + ISPN. - -Since ISPNs are significantly shorter than the subscriber numbers, they are within the limits of Table A.1. - -Nationally the CC + NDC + ISPN could terminate at a service center. As the digits of ISPN are identical to the leading digits of a subscriber number, all incoming international calls to the service center will fail because the CC + NDC + ISPN and the leading digits of CC + NDC + SN are ambiguous, and therefore not international ITU-T E.164-numbers. - -#### A.8.3.3 Network-specific numbers - -In this example, network-specific numbers are numbers that belong to subscribers connected to one network operator in a country with more than one operator, but where the network operator demands that the calling user dials some additional digits. - -The network-specific numbers have a hierarchical structure with 3 levels as follows: - -- Local level: SN. -- National level: NDC + SN. -- International level: CC + AD + NDC + SN (see Note). - -NOTE – ADs (additional digits) are the network operator identification digits that would have to be added by the calling users abroad to remove ambiguity and reach a particular subscriber in specific national network. - -The network-specific number does not fit in the hierarchical structure because it consists of more than the country code plus the national (significant) number. AD is not part of the national (significant) number, but may be part of a national prefix used to distinguish the national (significant) numbers from the subscriber numbers. - -The numbers are not unique because NDC + SN and CC + NDC + SN lead to two different subscribers. - -Network-specific numbers that are manipulated in this way are not international ITU-T E.164-numbers. - -#### A.8.3.4 National (significant) numbers with excessive length - -In this example, the national (significant) numbers (NDC + SN) as used nationally have differing lengths, and the longest national (significant) numbers violate the maximum given in Table A.1. - -The numbers have a hierarchical structure as follows. The structure is independent of the number length. - -- Local level: SN. -- National level: NDC + SN. -- International level: CC + NDC + SN. - -Some of the national (significant) numbers (NDC + SN) and international numbers (CC + NDC + SN) are longer than the maximum given in Table A.1. These numbers are not international ITU-T E.164-numbers. The most significant part of the national (significant) numbers, truncated to the limits given in Table A.1, are international ITU-T E.164-numbers provided that they are unique. - -# Annex B - -## Application of international ITU-T E.164-numbers for ISDN - -(This annex forms an integral part of this Recommendation) - -## B.1 Scope - -This annex describes the application of international ITU-T E.164-numbers to ISDN numbering and addressing. Additional numbering and addressing requirements are covered in separate Recommendations, e.g., B-ISDN is contained in [ITU-T E.191]. - -## B.2 ISDN numbers - -Numbering for ISDN is an integral part of the international ITU-T E.164-numbering plan. - -The ISDN number is an application of international ITU-T E.164-numbering for geographic areas and for international networks, to the ISDN user-network interface/network termination. - -## B.3 Addressing - -### B.3.1 Identification - -Identification within a subscriber's installation of a point beyond the ISDN boundary requires the transfer of address information from the public network to the subscriber's equipment. Two cases can apply: - -- identification by an ISDN number; -- identification by an ISDN number plus additional address information. - -### B.3.2 Addressing by an ISDN number - -When selecting a destination in the subscriber installation, digits forming the end of the ISDN subscriber number are transferred to the called subscriber's installation as a partial number (see Figure B.1). The number of digits used depends upon the requirements of the called subscriber's equipment and the capacity of the numbering plan used. - -In instances where a partial number is utilized, e.g., network termination 2 (NT2), the number will be used in the context of the direct-dialling-in supplementary service. - -If the subscriber's installation consists of terminal equipment only, the transferred digits will be used in the context of the multiple-subscriber-number supplementary service. - -![Diagram of ISDN number structure showing NDC, N(S)N, and SA components.](b0d322b2e75c75e1f21bfc0df841beaa_img.jpg) - -The diagram illustrates the structure of an ISDN number. At the top, a bracket labeled 'N(S)N' spans over two boxes: 'NDC' and 'S N'. Below the 'S N' box, a bracket labeled 'Partial number' is shown. To the right of the 'S N' box is a box labeled 'SA'. Below the 'SA' box, a bracket labeled 'Combined partial number and sub-address' spans over the 'S N' and 'SA' boxes. The text 'E.164\_FB.1' is located to the right of the 'Combined partial number and sub-address' bracket. - -Diagram of ISDN number structure showing NDC, N(S)N, and SA components. - -NDC National Destination Code (optional) -N(S)N National (Significant) Number -SA Sub-Address -SN Subscriber Number - -NOTE – The multiple-subscriber-number is not covered in the diagram. - -Figure B.1 – Addressing by an ISDN number - -### **B.3.3 Sub-addressing (network address extension)** - -Sub-addressing provides an additional addressing capacity outside the ISDN numbering plan but constitutes an intrinsic part of the ISDN addressing capabilities. The sub-address is a sequence of digits, following the ISDN number. The maximum length should be 20 octets (40 digits). As shown in Figure B.1, the sub-address may follow the ISDN number and form the ISDN address, which is transferred to the equipment at the subscriber's premises. - -When required, the sub-address is sent by the calling party within the call set-up procedure and is passed transparently through the network as a separate entity from both the ISDN number and user-to-user information. Sub-address information is not required to be processed within the public network. - -### **B.3.4 Combination of addressing and sub-addressing** - -Sub-addressing may be used separately or in combination with a partial number (see Figure B.1). - -## **B.4 Dialling procedures** - -**B.4.1** The subscriber dialling procedures for local, national and international calls shall be in accordance with clause 7. However, subscriber's control procedures for supplementary services is defined in [ITU-T E.131] (for Europe, also see [ETSI ETS 300 738] and [ETSI TS 001 907]) or in separate Recommendations for each service. - -**B.4.2** ISDN subscribers will always be called by the same subscriber number, irrespective of where in the public network the call originates. For calls in the same numbering area or local network, the subscriber number alone is dialled. For national calls between numbering areas or local networks, the subscriber number may be preceded by the national prefix and the national destination code. - -**B.4.3** The addressing procedures for calls using sub-addressing are described in clause B.3. - -## **B.5 Network identification** - -### **B.5.1 Geographic areas** - -In countries served by more than one ISDN and/or public switched telephone network (PSTN), the network identification of each is a national matter. - -Network identification within the national (significant) number shall be such that: - -- in a country all destination ISDN and PSTN networks shall operate under a single country code; -- the international ITU-T E.164-number maximum length of 15 digits shall not be exceeded, nor shall it be necessary for the number of digits for number analysis to exceed that specified in clause 7.5; -- provision of network identification is not mandatory for countries using a single integrated numbering plan arrangement for their ISDNs and PSTNs. - -### **B.5.2 Networks** - -In all cases when Network codes are assigned, they are supplemented with identification codes (ICs) which uniquely identify each international Network. - -Digit analysis of the CC + IC provides the required network identification. - -## **B.6 Service parameters** - -The ISDN number by itself will not identify the particular nature of the service, which is derived from particular signalling parameters that are not part of the numbering plan. For example, for ISDN calls, in addition to a number and possible prefix, there is a requirement to provide a choice of bearer capability in the signalling protocol. One number can therefore facilitate access to more than one service. - -## **B.7 Calling/connected line identity** - -Calling/connected line identity (CLI/COLI) is address information that is passed across the network to provide supplementary services such as calling (or connected) line identification presentation. The format of the CLI and COLI for international calls should be the full international ITU-T E.164-number, i.e., country code (CC), national destination code (NDC) and subscriber number (SN). No other information, such as prefixes or symbols (e.g., "+"), should be included, although a sub-address may be associated with the CLI/COLI. However, in a country where network-specific numbers are utilized for identifying customers or network services, it remains a national matter. When implemented, the NPI (numbering plan identifier) TON (type of number) mechanism should define the numbering status of the calling/connected line. The authorization to pass CLI/COLI across an international boundary is a national matter. - -![Timeline of E.164 evolution history from 1956 to 2010, showing the progression from CCIF and CCITT recommendations to ITU-T standards. The timeline includes color-coded books (Red, Blue, White, Green, Orange, Yellow) and key milestones like the ISDN era starting in 1996.](4cec89a753c447a050c0171c274f2acb_img.jpg) - -**Former Recommendations N° 26 bis and N° 26 ter of volume VI of CCIF green book** - -**Timeline:** - -- 1956:** 1st PA -- 1958:** 10 E.29 -- 1960:** 2.0 E.29/Q.11 (IInd PA, RED BOOK) -- 1964:** 30 E.29/Q.11 (IIIrd PA, BLUE BOOK) -- 1968:** 40 E.161/Q.11 (IVth PA, WHITE BOOK) -- 1972:** 50 E.161/Q.11 (Vth PA, GREEN BOOK) -- 1976:** 80 E.161/Q.11 (VIth PA, ORANGE BOOK) -- 1980:** 7.0 E.161/Q.11 (Dials and keypads) / 7.0 E.163/Q.11 bis (Numbering plan for telephone service) -- 1984:** 8.0 E.161/Q.11 (VIIIth PA, RED BOOK) / 8.0 E.163/Q.11 bis / 1.0 E.164/I.331 (Numbering plan for ISDN era) -- 1988:** 9.0 E.161 (IXth PA, BLUE BOOK) / 9.0 E.163/Q.11 / 2.0 E.164/I.331 / Q.11 bis -- 1991:** 3.0 E.164/I.331 -- 1993:** 10.0 E.161 (WTSC) -- 1995:** 11.0 E.161 (WTSC 96) -- 1996-12-31 23:59 UTC:** ISDN era start (Time T) -- 1997:** 4.0 E.164 (Public Telecom. numbering plan) -- 2001:** 12.0 E.161 (WTSA 00) -- 2005:** 5.0 E.164 (WTSA 04) -- 2010:** 6.0 E.164 (WTSA 08) - -Timeline of E.164 evolution history from 1956 to 2010, showing the progression from CCIF and CCITT recommendations to ITU-T standards. The timeline includes color-coded books (Red, Blue, White, Green, Orange, Yellow) and key milestones like the ISDN era starting in 1996. - -E.164(10)\_Flast - -E.164 evolution history - - - - - -# SERIES OF ITU-T RECOMMENDATIONS - -| | | -|-----------------|---------------------------------------------------------------------------------------------| -| Series A | Organization of the work of ITU-T | -| Series D | General tariff principles | -| Series E | Overall network operation, telephone service, service operation and human factors | -| Series F | Non-telephone telecommunication services | -| Series G | Transmission systems and media, digital systems and networks | -| Series H | Audiovisual and multimedia systems | -| Series I | Integrated services digital network | -| Series J | Cable networks and transmission of television, sound programme and other multimedia signals | -| Series K | Protection against interference | -| Series L | Construction, installation and protection of cables and other elements of outside plant | -| Series M | Telecommunication management, including TMN and network maintenance | -| Series N | Maintenance: international sound programme and television transmission circuits | -| Series O | Specifications of measuring equipment | -| Series P | Terminals and subjective and objective assessment methods | -| Series Q | Switching and signalling | -| Series R | Telegraph transmission | -| Series S | Telegraph services terminal equipment | -| Series T | Terminals for telematic services | -| Series U | Telegraph switching | -| Series V | Data communication over the telephone network | -| Series X | Data networks, open system communications and security | -| Series Y | Global information infrastructure, Internet protocol aspects and next-generation networks | -| Series Z | Languages and general software aspects for telecommunication systems | \ No newline at end of file diff --git a/marked/E/T-REC-E.164.1-200809-I_PDF-E/14a22f23ced8ba1d63ece69861dbaacc_img.jpg b/marked/E/T-REC-E.164.1-200809-I_PDF-E/14a22f23ced8ba1d63ece69861dbaacc_img.jpg deleted file mode 100644 index d5a35041124e73f88d6638cd17f42a2eb4f6781a..0000000000000000000000000000000000000000 --- a/marked/E/T-REC-E.164.1-200809-I_PDF-E/14a22f23ced8ba1d63ece69861dbaacc_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:8f24b214263bab4142643453a604fb5196f9397e2500c675cde79d53ce5e5d8e -size 3645 diff --git a/marked/E/T-REC-E.164.1-200809-I_PDF-E/4801720824e4b5e2361a5564f91cfb70_img.jpg b/marked/E/T-REC-E.164.1-200809-I_PDF-E/4801720824e4b5e2361a5564f91cfb70_img.jpg deleted file mode 100644 index 353810b5ad3a8c555d7a865d1480624f3a7aa6c7..0000000000000000000000000000000000000000 --- a/marked/E/T-REC-E.164.1-200809-I_PDF-E/4801720824e4b5e2361a5564f91cfb70_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:5893a3d6d5fa2ce6ed1cf1c5d8f70731e0c1eef59b01486c056b2f9d1c42e416 -size 62803 diff --git a/marked/E/T-REC-E.164.1-200809-I_PDF-E/552265bdbcf6d43d341fd018a9076269_img.jpg b/marked/E/T-REC-E.164.1-200809-I_PDF-E/552265bdbcf6d43d341fd018a9076269_img.jpg deleted file mode 100644 index b0e23b9c1791416da4cfc540bd2fa5950dfb8d44..0000000000000000000000000000000000000000 --- a/marked/E/T-REC-E.164.1-200809-I_PDF-E/552265bdbcf6d43d341fd018a9076269_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:c6d1fc9a273eb9da5a8e30a7b0d74df256dca9f30fd4b1434ac629badf8b3988 -size 92757 diff --git a/marked/E/T-REC-E.164.1-200809-I_PDF-E/8307f6b04df072c9332f9987e034272c_img.jpg b/marked/E/T-REC-E.164.1-200809-I_PDF-E/8307f6b04df072c9332f9987e034272c_img.jpg deleted file mode 100644 index 5fad02d4325251e848173fcace697bde8c86b3b8..0000000000000000000000000000000000000000 --- a/marked/E/T-REC-E.164.1-200809-I_PDF-E/8307f6b04df072c9332f9987e034272c_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:e04c8584355afc4beee5cf74aeb5667b8777f65d09af559b33c490114de06800 -size 33134 diff --git a/marked/E/T-REC-E.164.1-200809-I_PDF-E/c85ded401105f62f2d6ff26b3b5eb4af_img.jpg b/marked/E/T-REC-E.164.1-200809-I_PDF-E/c85ded401105f62f2d6ff26b3b5eb4af_img.jpg deleted file mode 100644 index ff898d895cad867a060cd46ab13fa59ec6c5a571..0000000000000000000000000000000000000000 --- a/marked/E/T-REC-E.164.1-200809-I_PDF-E/c85ded401105f62f2d6ff26b3b5eb4af_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:c57561ab39c6faaf715d6ea22d2a73754301b4ac68208e9d6f881f93a422e61f -size 48896 diff --git a/marked/E/T-REC-E.164.1-200809-I_PDF-E/raw.md b/marked/E/T-REC-E.164.1-200809-I_PDF-E/raw.md deleted file mode 100644 index 146026ea989b374220f52f416cf9c88c5dcb4c75..0000000000000000000000000000000000000000 --- a/marked/E/T-REC-E.164.1-200809-I_PDF-E/raw.md +++ /dev/null @@ -1,989 +0,0 @@ - - -**ITU-T** - -**E.164.1** - -TELECOMMUNICATION -STANDARDIZATION SECTOR -OF ITU - -(09/2008) - -SERIES E: OVERALL NETWORK OPERATION, -TELEPHONE SERVICE, SERVICE OPERATION -AND HUMAN FACTORS - -International operation – Numbering plan of the -international telephone service - ---- - -**Criteria and procedures for the reservation, -assignment and reclamation of E.164 country -codes and associated identification codes (ICs)** - -Recommendation ITU-T E.164.1 - -# ITU-T E-SERIES RECOMMENDATIONS - -# OVERALL NETWORK OPERATION, TELEPHONE SERVICE, SERVICE OPERATION AND HUMAN FACTORS - -| | | -|---------------------------------------------------------------------------------------------------|--------------------| -| INTERNATIONAL OPERATION | | -| Definitions | E.100–E.103 | -| General provisions concerning Administrations | E.104–E.119 | -| General provisions concerning users | E.120–E.139 | -| Operation of international telephone services | E.140–E.159 | -| Numbering plan of the international telephone service | E.160–E.169 | -| International routing plan | E.170–E.179 | -| Tones in national signalling systems | E.180–E.189 | -| Numbering plan of the international telephone service | E.190–E.199 | -| Maritime mobile service and public land mobile service | E.200–E.229 | -| OPERATIONAL PROVISIONS RELATING TO CHARGING AND ACCOUNTING IN THE INTERNATIONAL TELEPHONE SERVICE | | -| Charging in the international telephone service | E.230–E.249 | -| Measuring and recording call durations for accounting purposes | E.260–E.269 | -| UTILIZATION OF THE INTERNATIONAL TELEPHONE NETWORK FOR NON-TELEPHONY APPLICATIONS | | -| General | E.300–E.319 | -| Phototelegraphy | E.320–E.329 | -| ISDN PROVISIONS CONCERNING USERS | E.330–E.349 | -| INTERNATIONAL ROUTING PLAN | E.350–E.399 | -| NETWORK MANAGEMENT | | -| International service statistics | E.400–E.404 | -| International network management | E.405–E.419 | -| Checking the quality of the international telephone service | E.420–E.489 | -| TRAFFIC ENGINEERING | | -| Measurement and recording of traffic | E.490–E.505 | -| Forecasting of traffic | E.506–E.509 | -| Determination of the number of circuits in manual operation | E.510–E.519 | -| Determination of the number of circuits in automatic and semi-automatic operation | E.520–E.539 | -| Grade of service | E.540–E.599 | -| Definitions | E.600–E.649 | -| Traffic engineering for IP-networks | E.650–E.699 | -| ISDN traffic engineering | E.700–E.749 | -| Mobile network traffic engineering | E.750–E.799 | -| QUALITY OF TELECOMMUNICATION SERVICES: CONCEPTS, MODELS, OBJECTIVES AND DEPENDABILITY PLANNING | | -| Terms and definitions related to the quality of telecommunication services | E.800–E.809 | -| Models for telecommunication services | E.810–E.844 | -| Objectives for quality of service and related concepts of telecommunication services | E.845–E.859 | -| Use of quality of service objectives for planning of telecommunication networks | E.860–E.879 | -| Field data collection and evaluation on the performance of equipment, networks and services | E.880–E.899 | -| OTHER | E.900–E.999 | - -For further details, please refer to the list of ITU-T Recommendations. - -## **Recommendation ITU-T E.164.1** - -# **Criteria and procedures for the reservation, assignment and reclamation of E.164 country codes and associated identification codes (ICs)** - -## **Summary** - -Recommendation ITU-T E.164 describes the international public telecommunication numbering plan. Recommendation ITU-T E.190 describes the general principles to be utilized in the assignment of ITU-T E-series international numbering resources. This Recommendation describes the procedures and criteria for the reservation, assignment and reclamation of E.164 country codes and associated identification code (IC) assignments. The criteria and procedures are provided as a basis for the effective and efficient utilization of the available E.164 numbering resources. Such assignments require a collaborative effort between TSB and the appropriate ITU-T study group to endeavour to ensure that the assignments meet the needs of the telecommunication community. The development of these criteria and procedures are in accordance with the principles contained in Recommendation ITU-T E.190 and the numbering plan formats detailed in Recommendation ITU-T E.164. While processing E.164 resource applications, any conflicts between these Recommendations that are identified will be resolved by the following: Those statements contained in Recommendation ITU-T E.190 take precedence over Recommendation ITU-T E.164, and those statements contained in Recommendation ITU-T E.164 take precedence over this Recommendation. - -The Director of the Telecommunication Standardization Bureau (TSB) assigns and reclaims E.164 country codes for geographic areas, global services and for Networks. The Director is also responsible for the assignment and reclamation of identification codes (ICs) for Networks. The assignment of subsequent digits is normally not the purview of ITU-T, but is the purview of the assignee. However, there may be unique circumstances by which it is jointly agreed by TSB and the appropriate ITU-T study group that subsequent digits are to be centrally administered, e.g., UIFNs. - -###### **Source** - -Recommendation ITU-T E.164.1 was approved on 23 September 2008 by ITU-T Study Group 2 (2005-2008) under the WTSA Resolution 1 procedure. - -## FOREWORD - -The International Telecommunication Union (ITU) is the United Nations specialized agency in the field of telecommunications, information and communication technologies (ICTs). The ITU Telecommunication Standardization Sector (ITU-T) is a permanent organ of ITU. ITU-T is responsible for studying technical, operating and tariff questions and issuing Recommendations on them with a view to standardizing telecommunications on a worldwide basis. - -The World Telecommunication Standardization Assembly (WTSA), which meets every four years, establishes the topics for study by the ITU-T study groups which, in turn, produce Recommendations on these topics. - -The approval of ITU-T Recommendations is covered by the procedure laid down in WTSA Resolution 1. - -In some areas of information technology which fall within ITU-T's purview, the necessary standards are prepared on a collaborative basis with ISO and IEC. - -### NOTE - -In this Recommendation, the expression "Administration" is used for conciseness to indicate both a telecommunication administration and a recognized operating agency. - -Compliance with this Recommendation is voluntary. However, the Recommendation may contain certain mandatory provisions (to ensure e.g., interoperability or applicability) and compliance with the Recommendation is achieved when all of these mandatory provisions are met. The words "shall" or some other obligatory language such as "must" and the negative equivalents are used to express requirements. The use of such words does not suggest that compliance with the Recommendation is required of any party. - -### INTELLECTUAL PROPERTY RIGHTS - -ITU draws attention to the possibility that the practice or implementation of this Recommendation may involve the use of a claimed Intellectual Property Right. ITU takes no position concerning the evidence, validity or applicability of claimed Intellectual Property Rights, whether asserted by ITU members or others outside of the Recommendation development process. - -As of the date of approval of this Recommendation, ITU had not received notice of intellectual property, protected by patents, which may be required to implement this Recommendation. However, implementers are cautioned that this may not represent the latest information and are therefore strongly urged to consult the TSB patent database at . - -© ITU 2009 - -All rights reserved. No part of this publication may be reproduced, by any means whatsoever, without the prior written permission of ITU. - -## CONTENTS - -| | | Page | -|-----|-------------------------------------------------------------------------------------------------------------------------------------|------| -| 1 | Scope ..... | 1 | -| 2 | References..... | 1 | -| 3 | Terms and definitions ..... | 2 | -| 4 | General section ..... | 2 | -| 5 | Country codes for geographic areas ..... | 3 | -| 5.1 | Reservation..... | 3 | -| 5.2 | Criteria for assignment ..... | 3 | -| 5.3 | Criteria for reclamation ..... | 4 | -| 5.4 | Procedures for the reservation, assignment and reclamation of country codes for geographic areas ..... | 4 | -| 5.5 | Procedures flow chart..... | 5 | -| 6 | Country code for global services ..... | 6 | -| 6.1 | Criteria for reservation ..... | 7 | -| 6.2 | Criteria for assignment ..... | 7 | -| 6.3 | Criterion for reclamation ..... | 7 | -| 6.4 | Procedures for the reservation, assignment, and reclamation of country codes for global service ..... | 7 | -| 6.5 | Procedures flow chart..... | 8 | -| 7 | Country code for other global services..... | 9 | -| 7.1 | Criteria for reservation for other global services..... | 10 | -| 7.2 | Criteria for assignment for other global services ..... | 11 | -| 7.3 | Criterion for reclamation for other global services ..... | 11 | -| 7.4 | Procedures for the reservation, assignment, and reclamation of country codes for other global services ..... | 12 | -| 7.5 | Reclamation for other global services ..... | 12 | -| 7.6 | Appeals process for other global services ..... | 12 | -| 8 | Country codes and associated identification codes for Networks ..... | 13 | -| 8.1 | Criteria for reservation ..... | 13 | -| 8.2 | Criteria for assignment ..... | 14 | -| 8.3 | Criteria for reclamation ..... | 14 | -| 8.4 | Procedures for the reservation, assignment, and reclamation of country codes and associated identification codes for Networks ..... | 15 | -| 8.5 | Appeals process ..... | 16 | -| 8.6 | Procedures flow chart..... | 17 | -| 9 | Country codes and associated identification codes for multi-use Networks ..... | 17 | -| 9.1 | Criteria for reservation for multi-use Networks ..... | 18 | -| 9.2 | Criteria for assignment for multi-use Networks..... | 19 | -| 9.3 | Criteria for reclamation for multi-use Networks ..... | 20 | - -| | Page | | -|--------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|----| -| 9.4 | Procedures for the reservation, assignment, and reclamation of country codes and associated identification codes for multi-use Networks ..... | 20 | -| 9.5 | Appeals process for multi-use Networks..... | 22 | -| Annex A – | Country code and length of associated ICs ..... | 23 | -| Appendix I – | Review process for the reservation and assignment of identification codes (ICs) associated with the category of E.164 codes titled "shared country codes (CC) for Networks" ..... | 24 | -| I.1 | Introduction ..... | 24 | -| I.2 | General procedures ..... | 24 | -| I.3 | Specific CC + IC reservation and assignment procedures ..... | 25 | -| I.4 | Application resubmission and appeals processes ..... | 26 | - -## Introduction - -Recommendation ITU-T E.164 describes the international public telecommunication numbering plan. Recommendation ITU-T E.190 describes the general principles to be utilized in the assignment of ITU-T E-series international numbering resources. This Recommendation describes the procedures and criteria for the reservation, assignment, and reclamation of E.164 country codes and associated identification code (IC) assignments. The criteria and procedures are provided as a basis for the effective and efficient utilization of the available E.164 numbering resources. Such assignments require a collaborative effort between TSB and the appropriate ITU-T study group to endeavour to ensure that the assignments meet the needs of the telecommunication community. (See WTSA-04 Resolution 20). The development of these criteria and procedures is in accordance with the principles contained in Recommendation ITU-T E.190 and the numbering plan formats detailed in Recommendation ITU-T E.164. While processing E.164 resource applications, any conflicts between these Recommendations that are identified will be resolved by the following: Those provisions contained in Recommendation ITU-T E.190 take precedence over Recommendation ITU-T E.164, and those provisions contained in Recommendation ITU-T E.164 take precedence over this Recommendation. - -The Director of the Telecommunication Standardization Bureau (TSB) assigns and reclaims E.164 country codes for geographic areas, global services and for Networks. The Director is also responsible for the assignment and reclamation of identification codes (ICs) for Networks1. The assignment of subsequent digits is normally not the purview of the ITU-T, but is the purview of the assignee. However, there may be unique circumstances by which it is jointly agreed by TSB and the appropriate ITU-T study group that subsequent digits are to be administered by TSB, e.g., UIFNs. - ---- - -1 Internationally interconnected physical nodes and operational systems operated and maintained by one or more Recognized Operating Agencies (ROAs) to provide public telecommunication services. Private networks are not included in this definition. Note that the use of capital "N" in Networks indicates that this definition applies. - - - -## Recommendation ITU-T E.164.1 - -## Criteria and procedures for the reservation, assignment and reclamation of E.164 country codes and associated identification codes (ICs) - -## 1 Scope - -This Recommendation provides criteria and procedures for the reservation, assignment, and reclamation of E.164 country codes for geographic areas, global services, and Networks. Additional criteria and procedures for the assignment of identification codes (ICs) are also provided with respect to Networks. - -## 2 References - -The following ITU-T Recommendations and other references contain provisions which, through reference in this text, constitute provisions of this Recommendation. At the time of publication, the editions indicated were valid. All Recommendations and other references are subject to revision; users of this Recommendation are therefore encouraged to investigate the possibility of applying the most recent edition of the Recommendations and other references listed below. A list of the currently valid ITU-T Recommendations is regularly published. The reference to a document within this Recommendation does not give it, as a stand-alone document, the status of a Recommendation. - -- [ITU-T E.156] Recommendation ITU-T E.156 (2006), *Guidelines for ITU-T action on reported misuse of E.164 number resources.* -- [ITU-T E.164] Recommendation ITU-T E.164 (2005), *The international public telecommunication numbering plan.* -- [ITU-T E.168] Recommendation ITU-T E.168 (2002), *Application of E.164 numbering plan for UPT.* -- [ITU-T E.168.1] Recommendation ITU-T E.168.1 (2005), *Assignment procedures for universal personal telecommunications (UPT) numbers in the provisioning of the international UPT service.* -- [ITU-T E.169] Recommendation ITU-T E.169 (2002), *Application of Recommendation E.164 numbering plan for universal international numbers for international telecommunications services using country codes for global services.* -- [ITU-T E.169.1] Recommendation ITU-T E.169.1 (2001), *Application of Recommendation E.164 numbering plan for universal international freephone numbers for international freephone service.* -- [ITU-T E.169.2] Recommendation ITU-T E.169.2 (2000), *Application of Recommendation E.164 numbering plan for universal international premium rate numbers for the international premium rate service.* -- [ITU-T E.169.3] Recommendation ITU-T E.169.3 (2000), *Application of Recommendation E.164 numbering plan for universal international shared cost numbers for international shared cost service.* -- [ITU-T E.190] Recommendation ITU-T E.190 (1997), *Principles and responsibilities for the management, assignment and reclamation of E-series international numbering resources.* - -[ITU-T E.191] Recommendation ITU-T E.191 (2000), *B-ISDN addressing*. - -[ITU-T E.191.1] Recommendation ITU-T E.191.1 (2001), *Criteria and procedures for the allocation of ITU-T International Network Designator addresses*. - -## 3 Terms and definitions - -All terms and definitions related to this Recommendation are contained in [ITU-T E.164] and [ITU-T E.190]. - -This Recommendation also defines the following terms: - -**3.1 other global services:** A service that has and agrees to comply with recognized and accepted international standards and is provisioned on the public telecommunications network by one or more Recognized Operating Agencies (ROAs) using ubiquitous network identifiers in two or more countries that are in addition to the global services as defined in clause 6.02. - -**3.2 multi-use international Networks:** An international network of internationally interconnected physical nodes that enables one or more Recognized Operating Agencies (ROAs) to provide several significantly different services simultaneously in two or more countries and where sub-allocation of numbering resources is allowed. - -## 4 General section - -**4.1** Assignment of an E.164 resource by TSB to an eligible applicant is made with the understanding that the applicant does and will comply with all relevant national and international telecommunication regulatory, legal and licensing requirements. A national Administration can determine whether or not the requested number can be implemented within its territory. - -It is a national matter whether requests for E.164.1 resources require national Administration review or approval, or to associate the implementation of the codes with supplementary conditions or restrictions. The assignment of an E.164.1 resource by TSB does not grant the applicant the right to implement its resource assignment without obtaining and meeting the requirements of the involved national Administration, including the Administrations of any subsequent countries in which the applicant wishes to provide service after the resource assignment has been made by the Director of TSB. - -**4.2** In view of the evolutionary nature of telecommunication services and networks, the country codes, the ICs, and the format of the subsequent digits following the IC should provide adequate capacity to accommodate current and future requirements. - -**4.3** All newly assigned country codes will be three digits in length, the maximum allowable under the existing numbering plan structure, as defined in [ITU-T E.164]. - -**4.4** Country codes should first be assigned from decade blocks with country codes already assigned until all codes in such decades are exhausted, e.g., reserved or assigned. - -**4.5** TSB will wait for a period of at least two years before reassigning a previously assigned country code unless a shorter time interval is mutually agreed by the previous code holder, the applicant, the TSB and so advised by the appropriate ITU-T study group. - -**4.6** Although there may be exceptions, the assignment of E.164 country codes in any one of the following categories is not intended to supplement assignments made in another of these categories: - -- i) geographic areas; -- ii) global services; -- iii) Networks. - -- 4.7 The application process normally will have two sequential stages: -- a) reservation; - - b) assignment. -- 4.8 Applications for the reservation and assignment of E.164 country codes and Network ICs will be considered on an individual basis and on their own merits. -- 4.9 TSB and the relevant ITU-T study group maintains the right, at any time during the application process, to request from the applicant additional information considered necessary to validate an application. -- 4.10 TSB reserves the right to audit: -- 4.10.1 the information provided in the application; - - 4.10.2 the use of existing numbering resources if and when applying for supplementary resources; - - 4.10.3 the reserved or assigned numbering resources if it is suspected that they are not being utilized in conformance with the application. -- 4.11 All numbering resources that are assigned will be in conformance with the format and function of [ITU-T E.164], and with the principles in [ITU-T E.190]. -- 4.12 The assignee must inform TSB when any of the conditions under which the assignment or reservation was made are no longer applicable or have changed. -- 4.13 Reserved or assigned numbering resources are subject to reclamation if not utilized in conformance with the reservation and assignment criteria. -- 4.14 The assignee must return the assigned numbering resource if it is no longer being utilized in conformance with the reservation and assignment criteria. -- 4.15 Prior to code assignment or reclamation, the Director of TSB is requested to implement adequate procedures to provide timely Recognized Operating Agency (ROA) and Administration access to this assignment and reclamation information regarding proposed code assignments in order to identify any adverse impact. - -## **5 Country codes for geographic areas** - -- 5.01 This clause provides specific information on the process by which the TSB Director, based on advice of the appropriate ITU-T study group, determines whether E.164 resources should be reserved for, assigned to, and reclaimed from country codes for geographic areas. -- 5.02 Country codes for geographic areas vary in length from one to three digits and are used to identify either a specific country, countries in an integrated numbering plan, or a specific geographic area. -- 5.1 Reservation** -- 5.1.1 Normally, the reservation of a country code for a geographic area is not required. -- 5.2 Criteria for assignment** -- 5.2.1 The applicant country(ies) must either be recognized by ITU or by the UN. -- 5.2.2 Although TSB ultimately determines what specific code to assign, the applicant can request a specific code. -- 5.2.3 A geographic area should only be identified by one geographic country code. However, a country code used for services covering a regional area, which may already be served by a number of geographic country codes, will be considered for assignment process. - -**5.2.4** An integrated numbering plan identifies multiple countries served by a single country code. When a country leaves an integrated numbering plan, and does not join or form a new integrated numbering plan, it may be assigned a new country code. The countries remaining in the integrated numbering plan shall retain the existing country code. - -**5.2.5** The assignment of a subsequent geographic E.164 country code to the same geographic area served by an existing geographic country code is not normally considered, except when the existing code is approaching exhaustion. If the initial country code assignment is approaching exhaustion, and has been efficiently managed (e.g., fill rate, size of NDC, etc.), an additional assignment would be considered by TSB, in consultation with the appropriate ITU-T study group and relevant Administrations. - -### **5.3 Criteria for reclamation** - -**5.3.1** The creation of a new country or countries from a previously existing country should result in the return of the original country code and the assignment of a new country code, or codes, to the new country or countries. This is applicable unless the original code is used by one or more of the newly formed countries. - -**5.3.2** The political unification of multiple countries into one country or the integration of separate countries into one national or integrated numbering plan, where each country was previously assigned a unique country code, should result in a review of the potential for the return of one or more of the previously assigned codes, at a time mutually agreeable to TSB, the appropriate ITU-T study group, and the involved Administrations. The continued assignment and use of the codes in that geographic area will be determined by consultation between the affected countries, and TSB, as advised by the appropriate ITU-T study group. - -**5.3.3** A returned country code will be identified as being "returned to spare" by TSB until such time as it has been reassigned. - -**5.3.4** In circumstances where a numbering resource is needed from a specific geographic region, a returned country code will not be reassigned by the Director of TSB unless there is no other alternative available. TSB should not use a returned country code for any reason without exhausting all available spare codes. - -### **5.4 Procedures for the reservation, assignment and reclamation of country codes for geographic areas** - -**5.4.1** The code application process is initiated by a written request to the Director of TSB. The application can be submitted by a single country or the appropriate entity representing multiple countries. The application should include the reason for the code request and may indicate a preferred specific code. The request should also include a projected code activation date and/or date of exhaustion of an existing country code so that the relative urgency of the request may be determined. - -**5.4.1.1** When transitioning from one country code to another, the original and newly assigned country codes may temporarily coexist. Both concerned Administrations should agree on a transition plan and send that transition plan to TSB, with a request that it be published as appropriate. The transition plan will contain the agreed to date in which the original country code will be returned to TSB. In principle, such coexistence should not exceed two years from the date the new country code was assigned by TSB. The Director of TSB should take the agreed transition plan into account when determining the date of assignment of the new code and the date of reclamation of the old code. - -**5.4.2** It is the responsibility of the ITU-TSB to: - -**5.4.2.1** communicate with the applicant when necessary; - -**5.4.2.2** consult with the chairman of the appropriate ITU-T study group to seek their advice on resolving any technical and operational issues associated with the code application process and reclamation. - -**5.4.3** Applications for country codes for geographic areas do not normally require consultation among TSB, the applicant, the Administration(s), and the appropriate ITU-T study group. However, when such consultation is appropriate, the chairman of the appropriate ITU-T study group, or a delegated representative(s), may advise TSB directly regarding such requests on any technical or operational requirements. The following meeting of the appropriate ITU-T study group will be given a status report of any such consultations and to confirm such advice. - -**5.4.4** TSB and the appropriate ITU-T study group should ensure that consultation occurs without causing unnecessary delay in the application process. Where no technical or operational issues are identified, advice from the appropriate ITU-T study group should normally be given to TSB within one month of the consultation. Where technical or operational issues are identified, the ITU-T study group chairman, or delegated representative(s), should advise TSB to that effect as soon as possible and then consult to achieve issue resolution. - -**5.4.5** Where issues are identified or a code application is rejected, the Director of TSB should promptly advise the applicant. The Director of TSB should consult with the appropriate ITU-T study group and the applicant to achieve issue resolution. When communicating with the applicant to resolve the issue, TSB should propose a specific issue resolution. - -**5.4.6** If no issues with the application are identified, the Director of TSB will post the new or amended code assignments on the website where it will be available to any entity that needs to effect the changes. - -### **5.5 Procedures flow chart** - -In order to aid the understanding of how steps in the assignment procedure fit together, the following flow chart is presented in Figure 1. The chart is for clarity only, and any differences between the interpretation of the charts and the interpretation of the text should be settled in favour of the text. - -![Flowchart illustrating the procedures for the reservation/assignment of country codes for geographic areas. The process starts with the Director of TSB receiving a written request for an E.164 geographic country code. It then enters a decision loop: 'Consultation appropriate?'. If 'Yes', a 'Study/Evaluation within 1 month' is conducted. If 'No', it proceeds to 'Assignment approved?'. If 'Yes', the applicant is notified and the TSB is advised, leading to 'Publication of code with activation date'. If 'No', the Director notifies the applicant and proposes a resolution. This leads to 'Issue resolved?'. If 'Yes', it proceeds to 'Publication of code with activation date'. If 'No', the application is denied. A label 'E.164.1_F1' is present at the bottom right of the flowchart.](4801720824e4b5e2361a5564f91cfb70_img.jpg) - -``` - -graph TD - A[Director of TSB receives written request for E.164 geographic country code] --> B{Consultation appropriate?} - B -- Yes --> C[Study/Evaluation within 1 month] - B -- No --> D{Assignment approved?} - C --> D - D -- Yes --> E[Applicant notified and TSB advised] - D -- No --> F[Director notifies applicant and proposes issue resolution] - F --> G{Issue resolved?} - G -- Yes --> E - G -- No --> H[Application denied] - E --> I[Publication of code with activation date] - G -- Yes --> I - E.164.1_F1[E.164.1_F1] - -``` - -Flowchart illustrating the procedures for the reservation/assignment of country codes for geographic areas. The process starts with the Director of TSB receiving a written request for an E.164 geographic country code. It then enters a decision loop: 'Consultation appropriate?'. If 'Yes', a 'Study/Evaluation within 1 month' is conducted. If 'No', it proceeds to 'Assignment approved?'. If 'Yes', the applicant is notified and the TSB is advised, leading to 'Publication of code with activation date'. If 'No', the Director notifies the applicant and proposes a resolution. This leads to 'Issue resolved?'. If 'Yes', it proceeds to 'Publication of code with activation date'. If 'No', the application is denied. A label 'E.164.1\_F1' is present at the bottom right of the flowchart. - -**Figure 1 – Procedures for the reservation/assignment of country codes for geographic areas** - -## 6 Country code for global services - -**6.01** This clause provides specific information on the process by which TSB and the appropriate ITU-T study group determine whether E.164 resources should be reserved for, assigned to, and reclaimed from global services. - -**6.02** Global service codes allow subscribers a single worldwide number. These numbers are typically called "universal service numbers", for example universal international freephone numbers. Prior to this concept, subscribers required the assignment of national numbering resources within each country. The introduction of these global services allows service providers to offer ubiquitous access in countries where the service is being offered. - -**6.03** Country codes for global services can be assigned to ITU-T recognized global services to provide subscribers a unique recognizable number that enables call termination, call routing, or call charging which may differ from geographically based national numbers. - -**6.04** Country codes for global services will be assigned from spare E.164 codes. The structure and functions of the digits following the country code are dependent on the particular service and may or may not include additional digit(s) to define these functions. The use, structure, and assignment of any of these digits within the full number will be determined on a service-by-service basis and will be documented in an appropriate Recommendation. - -**6.05** TSB, in consultation with the appropriate ITU-T study group seeking its advice, determines the specific country code to be assigned. Consideration will be given to pertinent information provided from other appropriate sources. - -### **6.1 Criteria for reservation** - -**6.1.1** The application for the reservation of a country code for a global service has been received by TSB. - -**6.1.2** The country code will be reserved by TSB after the appropriate ITU-T study group has advised that: - -**6.1.2.1** use of a global service country code is an appropriate, efficient, and effective method for providing the service; - -**6.1.2.2** the service is technically feasible, implementable, and for public correspondence by using the requested country code; - -**6.1.2.3** there is sufficient global, but not necessarily ubiquitous, demand; - -**6.1.2.4** a Recommendation for the global service has been developed to a stage where the appropriate ITU-T study group has enough information to initiate the development of a numbering plan or is already stable; - -**6.1.2.5** any necessary assignment guidelines for the digits subtending the country code are in development by the ITU-T study group. - -### **6.2 Criteria for assignment** - -Assignment of an E.164 country code for a global service, which has previously been reserved, is based on meeting the following criteria: - -**6.2.1** The availability of written notification by one or more Recognized Operating Agencies (ROAs), of their intention to provision the new global service application, to users of the public network, in at least two countries, that do not share an integrated numbering plan. - -**6.2.2** A Recommendation for that service has been approved or declared stable. - -**6.2.3** A Recommendation for the numbering plan and registrar function with the assignment guidelines for that global service has been approved or declared stable. - -### **6.3 Criterion for reclamation** - -If determined by TSB, or advised by the appropriate ITU-T study group, that the assigned code is either not implemented, or no longer in use, then the country code is subject to reclamation by TSB. - -### **6.4 Procedures for the reservation, assignment, and reclamation of country codes for global service** - -#### **6.4.1 Reservation** - -**6.4.1.1** A proposal for the reservation of a country code for a global service should be addressed in writing to the Director of TSB. This written request should include: - -- a) the preferred country code, if any; and -- b) acknowledgment that the criteria provided in clause 6.1 have been met. - -**6.4.1.2** If the criteria are not met, the Director of TSB, in consultation with the appropriate ITU-T study group, would detail the areas of non-conformance. Every effort will be made to resolve the issues of non-conformance in a timely manner. - -**6.4.1.3** If the requested reservation for a country code is denied, a supplement to the original application can be submitted to the Director of TSB providing new or clarifying information. - -**6.4.1.4** A country code reservation is made for a specific time period mutually agreeable between the applicant and TSB, and in consultation with the appropriate ITU-T study group(s). The reservation period is based on the expected implementation date of the service and the expected approval dates of the service definition Recommendation, the appropriate numbering Recommendation, and the assignment guidelines Recommendations. - -**6.4.1.5** After the reservation has been made, TSB will publish the reservation in the appropriate media. - -**6.4.1.6** In anticipation of the exhaustion of an existing country code, an additional country code will be reserved. - -#### **6.4.2 Assignment** - -**6.4.2.1** TSB in consultation with the appropriate ITU-T study group(s) will ensure that the criteria in clause 6.2 have been met. - -**6.4.2.2** If the assignment criteria are no longer being met, the country code is not assigned. - -**6.4.2.3** After the Recommendation for that service, numbering format and assignment guidelines have been approved or declared stable, TSB will publish the assignment in the appropriate media. - -**6.4.2.4** In the event of exhaustion of the existing country code, an additional country code will be assigned. - -#### **6.4.3 Reclamation** - -**6.4.3.1** When TSB, or the ITU-T study group, determines that a global service to which the country code was reserved or assigned, and will no longer be offered or implemented in two or more countries, TSB will notify the Administrations and ROAs that the code will be reclaimed. - -**6.4.3.2** At the time of reclamation, TSB should publish the date of reclamation and the country code should not be reassigned for a period of two years. - -### **6.5 Procedures flow chart** - -In order to aid the understanding of how steps in the assignment procedure fit together, the following flow chart is presented in Figure 2. The chart is for clarity only, and any differences between the interpretation of the charts and the interpretation of the text should be settled in favour of the text. - -#### Step 1: Reservation - -![Flowchart for Step 1: Reservation. The process starts with a circle, leading to a box 'Director of TSB receives written request for reservation of E.164 country code for global service'. This leads to a decision diamond 'Criteria met?'. If 'Yes', it goes to 'TSB publishes reservation'. If 'No', it goes to 'Notification of non-conformance'. From 'Notification of non-conformance', it goes to a decision diamond 'Resubmission of amended application?'. If 'Yes', it loops back to the 'Director of TSB' box. If 'No', it goes to 'Process terminates'.](c85ded401105f62f2d6ff26b3b5eb4af_img.jpg) - -``` - -graph TD - Start(( )) --> A[Director of TSB receives written request for reservation of E.164 country code for global service] - A --> B{Criteria met?} - B -- Yes --> C[TSB publishes reservation] - B -- No --> D[Notification of non-conformance] - D --> E{Resubmission of amended application?} - E -- Yes --> A - E -- No --> F[Process terminates] - -``` - -Flowchart for Step 1: Reservation. The process starts with a circle, leading to a box 'Director of TSB receives written request for reservation of E.164 country code for global service'. This leads to a decision diamond 'Criteria met?'. If 'Yes', it goes to 'TSB publishes reservation'. If 'No', it goes to 'Notification of non-conformance'. From 'Notification of non-conformance', it goes to a decision diamond 'Resubmission of amended application?'. If 'Yes', it loops back to the 'Director of TSB' box. If 'No', it goes to 'Process terminates'. - -#### Step 2: Assignment - -![Flowchart for Step 2: Assignment. The process starts with a circle, leading to a decision diamond 'Assignment criteria met?'. If 'No', it goes to 'Code is not assigned'. If 'Yes', it goes to a decision diamond 'Recommendation, numbering format, assignment guidelines, approved/declared stable?'. If 'No', it goes to 'Code is not assigned'. If 'Yes', it goes to 'Code assigned and published'.](8307f6b04df072c9332f9987e034272c_img.jpg) - -``` - -graph TD - Start(( )) --> A{Assignment criteria met?} - A -- No --> B[Code is not assigned] - A -- Yes --> C{Recommendation, numbering format, assignment guidelines, approved/declared stable?} - C -- No --> B - C -- Yes --> D[Code assigned and published] - -``` - -Flowchart for Step 2: Assignment. The process starts with a circle, leading to a decision diamond 'Assignment criteria met?'. If 'No', it goes to 'Code is not assigned'. If 'Yes', it goes to a decision diamond 'Recommendation, numbering format, assignment guidelines, approved/declared stable?'. If 'No', it goes to 'Code is not assigned'. If 'Yes', it goes to 'Code assigned and published'. - -E.164.1\_F2 - -**Figure 2 – Procedures for the reservation/assignment of country codes for global services** - -## 7 Country code for other global services - -Notwithstanding the provisions of clause 6 above, codes may also be assigned for global services which are not documented in an ITU Recommendation. Such services must be based on well recognized and widely implemented international standards, and must satisfy a potential international public interest. - -**7.01** The E.164 resources assigned to other global services will consist of a three-digit shared country code (CC) followed by an identification code (IC). The IC digits assigned for other global services will be at least three digits and the actual number assigned by TSB, taking into account Annex A as appropriate, might contain additional digits after the IC. - -**7.02** For any specific shared code, the length of the associated ICs shall be between one to four digits, within the shared country code the number of digits in the associated ICs will be as follows: CC 881 the IC is one-digit, CC 882 the IC is two-digits, CC 883 the IC can be either three-digits or four-digits. The specific country code(s) and IC assigned for other global services are to be assigned by the Director of TSB. - -Subsequent ICs can be assigned in the event of exhaustion or another substantiated reason. - -### **7.1 Criteria for reservation for other global services** - -The Director of TSB receives a written request from an applicant. - -**7.1.1** The applicant must be a Member State or Sector Member of the ITU or an Associate of the appropriate ITU-T study group and must maintain its membership as long as it has reserved or is assigned the requested resource. - -**7.1.2** The applicant must provide a list of the relevant international standards on which the service is based, a description of the proposed service, and the rationale for why the proposed service is in the public interest. - -The study group would then need to review the descriptions, ensuring that they do not overlap with existing global services, and provide some mechanism to maintain these service descriptions for current and future applicants to refer to in their requests for numbering resources. - -**7.1.3** The applicant must demonstrate that its international network infrastructure to support its global service would provide connectivity in two or more countries, which are not within the same integrated numbering plan. - -**7.1.4** The applicant requesting the numbering resource must affirm that it has overall responsibility and control, through contractual arrangements for the management, operation, countering misuse and maintenance of the other type of global service that would utilize the requested numbering resource. - -**7.1.5** The applicant must state that it accepts that any infringement of the reservation and assignment criteria and directly related ITU-T Recommendations, by any third party which the applicant through a contract subsequently sub-allocates part of the assigned resource to, may result in the total assigned resource being reclaimed. The responsibility for the resource that is reserved lies with the applicant and any subsequent misuse by the applicant or by a third party under contract to the applicant to whom a numbering resource has been sub-allocated could place that allocation in jeopardy, see clause 7.3. - -**7.1.6** It is a national matter whether requests for codes require national Administration review or approval. The assignee has ultimate responsibility for the allocation and is expected to establish whether this is required and, if so, to conform with the applicable national procedures. - -**7.1.7** The applicant must demonstrate that its international network infrastructure would contain connecting physical nodes in two or more countries, which are not within the same integrated numbering plan to support its global service. - -**7.1.8** The applicant affirms that all national regulatory, licensing and legal requirements of the countries in which the applicant will provide its global service would be met, including, among others, compliance with applicable restrictions on sub-allocation of the resource, as well as ITU-T Recommendations listed in clause 2. - -**7.1.9** The applicant will affirm that the requested resources would be used for the offering of public correspondence services between two or more countries, which are not within the same integrated numbering plan, and that: - -- a) the use of a global service country code is an appropriate, efficient, and effective method for providing the global service; -- b) the global service is technically feasible, implementable, and for public correspondence by using the requested country code and IC; and -- c) there is sufficient global, but not necessarily ubiquitous, demand for the service; -- d) they will comply with all applicable ITU-T Recommendations. - -**7.1.10** The applicant will affirm that the requested resource would not be utilized for provisioning a service substantially similar to an ITU-T-approved global service for which a country code has already been reserved or assigned. - -**7.1.11** The applicant must demonstrate that the requested E.164 numbering resource would be utilized for access to the subscribers of the global service for which the resource is being requested. - -**7.1.12** The applicant must demonstrate that other reasonable technical and operational numbering alternatives, e.g., use of national numbers, are not appropriate. (The applicant must attach substantiating materials.) - -**7.1.13** The applicant must demonstrate that the use of CC + IC is an appropriate, efficient and effective method to identify the global service for routing, addressing and charging purposes. (The applicant must attach substantiating materials.) - -**7.1.14** The applicant is required to state the planned date of commercial implementation in at least two countries not within the same integrated numbering plan. - -**7.1.15** The applicant will annually certify that the resource reserved for it is planned to be used and will also reaffirm its prime contact details through the submission of a status notification to the Director of TSB. - -### **7.2 Criteria for assignment for other global services** - -Assignment of an E.164 country code and IC for other global services, which has previously been reserved, is based on meeting the criteria in clause 7.1 in addition to the following criteria: - -**7.2.1** The availability of written notification by one or more Recognized Operating Agencies (ROAs), of their intention to provision the other global service application, to users of the public network, in at least two countries, that do not share an integrated numbering plan. - -**7.2.2** The applicant will annually certify that the resource which has been assigned to it continues to be in operation and has complied with the application criteria, and will also reaffirm its prime contact details through the submission of a status notification to the Director of TSB. - -**7.2.3** The responsibility for the resource that is assigned lies with the applicant, and any subsequent misuse by the assignee or sub-allocation to a third party under contract to the assignee could place that assignment in jeopardy, see clause 7.3 - -**7.2.4** The applicant must affirm that all involved third parties will manage numbering resources in an efficient manner as indicated in the number administration resource plan that must be included with its application. - -**7.2.5** It is the responsibility of the applicant to provide its contact details and a process to address complaints regarding misuse of the resource upon the request of the Director of TSB and the requesting national Administrations. - -**7.2.6** The applicant is required to maintain a current list of parties to which its resource has been sub-allocated. This list is to be provided to the Director of TSB upon request. - -**7.2.7** The applicant affirms that all involved third parties will inform the relevant users how to complain in case that they have been infringed, and provide the mechanism with which they will respond to complaints. - -### **7.3 Criterion for reclamation for other global services** - -If determined by TSB, or advised by the appropriate ITU-T study group, that the assigned CC + IC is either not implemented, or no longer in use, then the specified IC resource is subject to reclamation by TSB. - -### **7.4 Procedures for the reservation, assignment, and reclamation of country codes for other global services** - -See Figure 2 Procedures for the reservation/assignment of country codes for global services for the procedures flow chart (see clause 5.5). - -#### **7.4.1 Reservation for other global services** - -**7.4.1.1** A proposal for the reservation of an IC for other global services should be addressed in writing to the Director of TSB. This written request should include: - -- a) the preferred IC, if any; and -- b) acknowledgment that the criteria provided in clause 7.1 have been met. - -**7.4.1.2** If the criteria are not met, the Director of TSB, in consultation with the appropriate ITU-T study group, would detail the areas of non-conformance. Every effort will be made to resolve the issues of non-conformance in a timely manner. - -**7.4.1.3** If the requested reservation for an IC is denied, a supplement to the original application can be submitted to the Director of TSB providing new or clarifying information. - -**7.4.1.4** An IC reservation is made for a specific time period mutually agreeable between the applicant and the TSB, and in consultation with the appropriate ITU-T study group(s). The reservation period is based on the expected implementation date of the service. - -**7.4.1.5** After the reservation has been made, TSB will publish the reservation in the appropriate media. - -**7.4.1.6** In anticipation of the exhaustion of an existing IC, an additional IC will be reserved. - -#### **7.4.2 Assignment for other global services** - -**7.4.2.1** TSB, in consultation with the appropriate ITU-T study group(s), will ensure that the criteria in clause 7.2 have been met. - -**7.4.2.2** If the assignment criteria are no longer being met, the IC is not assigned. - -**7.4.2.3** In the event of exhaustion of the existing IC, an additional country code and IC may be assigned. - -### **7.5 Reclamation for other global services** - -**7.5.1** When TSB, or the appropriate ITU-T study group, determines that a global service to which the IC was reserved or assigned will no longer be offered or implemented in two or more countries, TSB will notify the Administrations and ROAs that the code will be reclaimed. - -**7.5.2** When TSB, or the appropriate ITU-T study group, determines that there is an infringement of the assignment criteria or directly related ITU-T Recommendations, by the party the CC + IC is assigned to, or any third party it has subsequently sub-allocated part of the assigned resource to, the code becomes liable for reclamation. - -**7.5.3** At the time of reclamation, TSB should publish the date of reclamation and the IC should not be reassigned for a period of two years. - -### **7.6 Appeals process for other global services** - -If the IC applicant has been denied an IC reservation or assignment, the applicant can appeal the denial to the Director of TSB, see clause 8.5. - -## **8 Country codes and associated identification codes for Networks** - -**8.01** This clause provides specific information on the process by which the Director of TSB, in consultation with the appropriate ITU-T study group and/or its delegated representatives (e.g., for Study Group 2, the numbering coordination team (NCT), which is a group giving advice to the Director on the matter), determines whether international E.164 resources should be reserved for, assigned to, and reclaimed from Networks not services. The internal TSB review procedures are contained in Appendix I. - -**8.02** The E.164 resources assigned to Networks consist of a three-digit shared country code (CC) followed by a one-to four-digit identification code (IC). For any specific shared code, the length of the associated ICs shall be constant, that is, the number of digits in the associated ICs will be the same. The specific country code(s) and IC assigned for Networks are to be assigned by the Director of TSB. - -**8.03** Subsequent ICs can be assigned in the event of exhaustion or another substantiated reason. - -**8.04** Throughout this clause, when using the term "applicant", it is assumed that the applicant is either a network operator or a group of network operators. - -### **8.1 Criteria for reservation** - -**8.1.1** The Director of TSB receives a written request from an applicant. - -**8.1.2** The applicant must be a Member State or Sector Member of the ITU or an Associate of ITU-T Study Group 2 and must maintain its membership as long as it has reserved or is assigned the requested resource. - -**8.1.3** The applicant requesting the numbering resource must affirm that it has overall responsibility for the management, operation, and maintenance of the Network that would utilize the requested numbering resource. It is a national matter whether requests for codes require national Administration review or approval. - -**8.1.4** The applicant must demonstrate that its international network infrastructure would contain connecting physical nodes in two or more countries, which are not within the same integrated numbering plan. - -**8.1.5** The applicant will affirm that the requested resources would be used for the offering of public correspondence services between two or more countries, which are not within the same integrated numbering plan (Geneva Constitution 1992, No. 1004 in the Annex). - -**8.1.6** The applicant will affirm that the requested resource would not be utilized for provisioning a service substantially similar to an ITU-T-approved global service for which a country code has already been reserved or assigned. - -**8.1.7** The applicant must demonstrate that the requested E.164 numbering resource would be utilized for access to the subscribers of the Network. - -**8.1.8** The applicant must demonstrate that other reasonable technical and operational numbering alternatives, e.g., use of national numbers, are not appropriate. (The applicant must attach substantiating materials.) - -**8.1.9** The applicant must demonstrate that the use of CC + IC is an appropriate, efficient and effective method to identify the Network for routing, addressing and charging purposes. (The applicant must attach substantiating materials.) - -**8.1.10** The applicant affirms that the country code and associated IC will not be used for carrier selection, i.e., followed by an existing international public telecommunication number; CC + N(S)N, CC + GSN, CC + IC + SN. - -**8.1.11** The applicant is required to state the planned date of commercial implementation in at least two countries not within the same integrated numbering plan. - -**8.1.12** The applicant may apply for a subsequent IC under the following circumstances: - -- The current assignment is approaching exhaustion: - - An additional assignment would be based on confirmation that the existing resource is being used in an efficient manner, e.g., the format and length of the numbering plan is appropriate. - - The applicant must provide substantiated information that the resource is approaching exhaustion. -- Other substantiated reasons: - - any additional criteria that is listed in clauses 8.1.1 to 8.1.11; - - the applicant must demonstrate that the resource will be utilized by a distinct Network. Such a request is to be treated as a new application. - -**8.1.13** The applicant will annually certify that the resource reserved for it is planned to be used and will also reaffirm its prime contact details through the submission of a status notification to the Director of TSB. - -### **8.2 Criteria for assignment** - -**8.2.1** Assignment of E.164 resource(s) to Networks is based on the following criteria: - -**8.2.1.1** TSB has received a written request for assignment. - -**8.2.1.2** The applicant must be a Member State, or a Sector Member of the ITU or an Associate of ITU-T Study Group 2. - -**8.2.1.3** The applicant must satisfy or have already complied with the resource reservation process. - -**8.2.1.4** The applicant affirms that all national regulatory and legal requirements of the countries in which the applicant's Network will operate and provide service would be met. - -**8.2.1.5** The applicant affirms that it does and will continue to satisfy the criteria for reservation. - -**8.2.1.6** The applicant affirms that the Network and its intended public correspondence services will be implemented between two or more countries, which are not within the same integrated numbering plan, within a maximum of one year from the date of assignment. - -**8.2.2** Assignment of subsequent CC + ICs to the same network requires confirmation that the current assignment is approaching exhaustion and that existing codes have been used in an efficient manner, as stated in clause 8.1.12. - -**8.2.3** The applicant will annually certify that the resource which has been assigned to it continues to be in operation and will also reaffirm its prime contact details through the submission of a status notification to the Director of TSB. - -### **8.3 Criteria for reclamation** - -**8.3.1** The reserved IC is to be reclaimed in the event that the applicant no longer meets the reservation criteria, the applicant no longer requires the reserved resource, or if the reservation period expires without the code being assigned. - -**8.3.2** The assigned IC is subject to reclamation if it is either not implemented, or the Network no longer satisfies the assignment criteria, or the Network is not operational between at least two countries not within the same numbering plan, or the IC is not in use for a period of two years. - -**8.3.3** The reserved or assigned IC will be subject to reclamation if the status notifications mentioned in clauses 8.1.13 and 8.2.3 above are not submitted annually to the Director of TSB. - -### **8.4 Procedures for the reservation, assignment, and reclamation of country codes and associated identification codes for Networks** - -#### **8.4.1 Reservation** - -**8.4.1.1** Requests for the reservation of a CC + IC to a network should be addressed in writing and electronically2 to the Director of TSB. The written request should be submitted on official company letterhead and signed by an appropriate company representative. The signature of the appropriate company representative affirms that, in the applicant's view, all the criteria are met. This written request should include: - -- a) a planned code activation date in order to determine the relevant urgency of the request; -- b) sufficient non-proprietary information so that the request can be analysed to satisfy the criteria given in clause 8.1, e.g., planned network architecture and call flows; and -- c) an affirmation that the applicant is a Member State, a Sector Member or an Associate of Study Group 2. - -**8.4.1.2** In making decisions, the Director of TSB consults with the chairman of the relevant ITU-T study group or his delegated representatives. - -**8.4.1.3** A CC + IC reservation is made for up to a three-year period, beyond which annual extensions, up to a maximum of two, may be permitted. This allows a maximum reservation period of up to five years. The reservation period ends at the beginning of the assignment period. The Director of TSB would re-evaluate the reservation at the end of the time period if an assignment of the CC + IC has not been made. In order for the extension to be approved, the applicant must demonstrate that difficulties have prevented the implementation of services on its Network. - -**8.4.1.4** Provided the criteria in clause 8.1 are met, an applicant's request for reservation of a CC + IC would be granted by the Director of TSB with consultation from the appropriate ITU-T study group and/or its delegated representatives. Within a CC, the applicants receive ICs in sequential order. - -**8.4.1.5** If the criteria are not met, TSB shall detail the areas of non-conformance. The applicant can submit a supplement to its original application to the Director of TSB that responds with new or clarifying information. (For detailed procedures, please refer to clause 8.5 and Appendix I.) - -**8.4.1.6** After the reservation has been made, the Director of TSB would respond in writing to the applicant and include appropriate information for its ongoing responsibility as contained in [ITU-T E.164] and [ITU-T E.190]. In addition, the reservation would be published in the appropriate media, e.g., the ITU website (TIES) and the Operational Bulletin. - -**8.4.1.7** During the reservation period, the applicant can only use the CC + IC for non-commercial trial and testing purposes. - -#### **8.4.2 Assignment** - -**8.4.2.1** Requests for the assignment of a CC + IC to a Network is to be addressed in writing to the Director of TSB. - ---- - -2 Examples of "electronically" include: - -- 1) e-mail to the ITU-TSB; -- 2) posting on the SG 2 FTP informal area (including proprietary information); -- 3) any other methods determined to be appropriate by TSB. - -In the electronic version, proprietary information should be highlighted so that it will not be published with the non-proprietary information. - -**8.4.2.2** The request would provide evidence that the criteria in clause 8.2 have been, or will be complied with, by the activation date. In the latter case, TSB must be informed of the full compliance with the criteria prior to the assignment of the code. - -**8.4.2.3** If the criteria are not met, the CC + IC will not be assigned. - -**8.4.2.4** After the assignment has been made, the Director of TSB will respond in writing to the applicant and the assignment will be published in the appropriate media, e.g., the ITU website (TIES) and the Operational Bulletin. - -#### **8.4.3 Reclamation** - -**8.4.3.1** The Director of TSB will notify the assignee in writing that the code is subject to reclamation. - -**8.4.3.2** The Director of TSB will return a reserved code to spare if the criteria for reclamation of a reserved code have been met. - -**8.4.3.3** At the time of IC reclamation of an assigned code, the Director of TSB should publish the date of IC reclamation and the IC should not be reassigned for a period of two years and will be indicated as "spare". - -**8.4.3.4** If an applicant or assignee determines that the IC is no longer required, the Director of TSB is to be notified in writing. The Director will respond in writing to the applicant and publish the reclamation in the appropriate media, e.g., the ITU website (TIES) and the Operational Bulletin. - -**8.4.3.5** A code is to be reclaimed if the applicant has not certified on an annual basis that the code is being used in accordance with the reservation or assignment request or has not also provided the applicant's prime contact details and an affirmation that the applicant is a Member State, a Sector Member or an Associate of Study Group 2. - -### **8.5 Appeals process** - -If the IC applicant has been denied an IC reservation or assignment, the applicant can appeal the denial to the Director of TSB in the following manner. The appeal could include a presentation by the applicant to Study Group 2. - -**8.5.1** In response to a letter of denial from the Director of TSB, the applicant can submit a supplement to its original application that responds to the reason(s) for denial contained in the letter. The applicant should submit its appeal, in writing, to the Director of TSB. In order to be considered by the Director of TSB, the response must include new or clarifying information. The submission should present the position of the applicant regarding the application and its denial, including its justification for this appeal. The applicant must attach to the submission a copy of the original application, the supplement to it, and the letter of denial from the Director of TSB. The applicant may also present the appeal at the study group meeting. If the appeal is to be presented to Study Group 2, it should be submitted at least two months prior to the ITU-T study group meeting. - -**8.5.2** The Director of TSB will consult with the ITU-T study group and/or its delegated representatives. The ITU-T study group and/or its delegated representatives will then provide advice to the Director of TSB regarding the amended application and the contents of the submitted supplement to the original application. - -**8.5.3** If the Director of TSB determines that, based on the new information, the reservation or assignment should be made, the applicant will be so informed as per the procedures in clause 8.4. - -**8.5.4** If the Director of TSB determines that the application is still to be denied after proper consultation with the concerned study group, the applicant will be so informed and the reason(s) for the denial will be provided. - -### 8.6 Procedures flow chart - -In order to aid the understanding of how steps in the assignment procedure fit together, the flow chart is presented in Figure 3. The chart is for clarity only, and any differences between the interpretation of the charts and the interpretation of the text should be settled in favour of the text. - -![Flowchart for Step 1: Reservation. It starts with a circle, leading to 'Director of TSB receives written request for reservation of E.164 CC + IC'. This leads to a decision 'Criteria met?'. If 'Yes', it goes to 'TSB publishes reservation'. If 'No', it goes to 'Notifies applicant of non-conformance'. From there, it goes to a decision 'Applicant resubmits amended application?'. If 'Yes', it loops back to the 'Director of TSB' step. If 'No', it goes to 'Process terminates'. Flowchart for Step 2: Assignment. It starts with a circle, leading to 'Director of TSB receives written request for reservation of E.164 CC + IC'. This leads to a decision 'Assignment criteria met?'. If 'Yes', it goes to 'Code assigned and published'. If 'No', it goes to a decision 'Applicant resubmits amended application?'. If 'Yes', it loops back to the 'Director of TSB' step. If 'No', it goes to 'Code is not assigned'.](552265bdbcf6d43d341fd018a9076269_img.jpg) - -Step 1: Reservation - -``` -graph TD; Start(( )) --> D1[Director of TSB receives written request for reservation of E.164 CC + IC]; D1 --> C1{Criteria met?}; C1 -- Yes --> T1[TSB publishes reservation]; C1 -- No --> N1[Notifies applicant of non-conformance]; N1 --> A1{Applicant resubmits amended application?}; A1 -- Yes --> D1; A1 -- No --> P1[Process terminates]; -``` - -Step 2: Assignment - -``` -graph TD; Start(( )) --> D2[Director of TSB receives written request for reservation of E.164 CC + IC]; D2 --> C2{Assignment criteria met?}; C2 -- Yes --> T2[Code assigned and published]; C2 -- No --> A2{Applicant resubmits amended application?}; A2 -- Yes --> D2; A2 -- No --> P2[Code is not assigned]; -``` - -E.164.1\_F3 - -Flowchart for Step 1: Reservation. It starts with a circle, leading to 'Director of TSB receives written request for reservation of E.164 CC + IC'. This leads to a decision 'Criteria met?'. If 'Yes', it goes to 'TSB publishes reservation'. If 'No', it goes to 'Notifies applicant of non-conformance'. From there, it goes to a decision 'Applicant resubmits amended application?'. If 'Yes', it loops back to the 'Director of TSB' step. If 'No', it goes to 'Process terminates'. Flowchart for Step 2: Assignment. It starts with a circle, leading to 'Director of TSB receives written request for reservation of E.164 CC + IC'. This leads to a decision 'Assignment criteria met?'. If 'Yes', it goes to 'Code assigned and published'. If 'No', it goes to a decision 'Applicant resubmits amended application?'. If 'Yes', it loops back to the 'Director of TSB' step. If 'No', it goes to 'Code is not assigned'. - -**Figure 3 – Procedures for the reservation/assignment of and associated identification codes for Networks** - -## 9 Country codes and associated identification codes for multi-use Networks - -The E.164 resources assigned to Networks consist of a three-digit shared country code (CC) followed by a three-digit to four-digit identification code (IC). For any specific shared code, the length of the associated ICs shall be constant, that is, the number of digits in the associated ICs will be the same. The specific country code(s) and IC assigned for Networks are to be assigned by the Director of TSB, taking into accord Annex A as appropriate. - -It is a national matter whether requests for multi-network CC + IC resources, including any involved third parties, require national Administration review and approval. The assignee has ultimate responsibility for the allocation, which must be based on well-recognized and widely implemented international standards, and must satisfy a potential international public interest. - -### **9.1 Criteria for reservation for multi-use Networks** - -**9.1.1** The Director of TSB receives a written request from an applicant. - -**9.1.1.1** The applicant must be a Member State or Sector Member of the ITU or an Associate of the appropriate ITU-T study group and must maintain its membership as long as it has reserved or is assigned the requested resource. - -**9.1.1.2** The applicant affirms that all relevant national regulatory, licensing and legal requirements of the countries in which the applicant's Network will operate and provide service would be met, including compliance with applicable restrictions on sub-allocation of the resource, as well as ITU-T Recommendations listed in clause 2. - -**9.1.2** The applicant requesting the numbering resource must affirm that it has overall responsibility, through contractual arrangements for the management, operation, countering misuse and maintenance of the Network that would utilize the requested numbering resource. - -**9.1.3** The applicant must state it accepts that any infringement of the assignment criteria or directly related ITU-T Recommendations, by any third party it subsequently sub-allocates part of the assigned resource to, may result in the total assigned resource being reclaimed. - -**9.1.4** The applicant must affirm and provide evidence, for example through contractual arrangements, that it has full responsibility over any involved third parties to ensure that the resource will be used only in accordance with the application. - -– For example, the applicant could provide samples of contractual language that it will use to bind any involved third parties. Appropriate use implies full adherence to all national laws and regulations where the network is actually implemented and accessed, whether any third parties are involved. And that those third parties will comply with this ITU-T Recommendation. - -**9.1.5** The applicant must affirm that all involved third parties will manage numbering resources in an efficient manner, as indicated in the number administration resource plan that must be included with its application. - -**9.1.6** The applicant must demonstrate that its international network infrastructure would contain connecting physical nodes in two or more countries, which are not within the same integrated numbering plan. - -**9.1.7** The applicant will affirm that the requested resources would be used for the offering of public correspondence services between two or more countries, which are not within the same integrated numbering plan (Geneva Constitution 1992, No. 1004 in the Annex). - -**9.1.8** The applicant will affirm that the requested resource would not be utilized for provisioning a service substantially similar to an ITU-T-approved global service for which a country code has already been reserved or assigned. - -**9.1.9** The applicant must demonstrate that the requested E.164 numbering resource would be utilized for access to the subscribers of the Network. - -**9.1.10** The applicant must demonstrate that other reasonable technical and operational numbering alternatives, e.g., use of national numbers, are not appropriate. (The applicant must attach substantiating materials.) - -**9.1.11** The applicant must demonstrate that the use of CC + IC is an appropriate, efficient and effective method to identify the Network for routing, addressing and charging purposes. (The applicant must attach substantiating materials.) - -**9.1.12** The applicant affirms that the country code and associated IC will not be used for carrier selection, i.e., followed by an existing international public telecommunication number; CC + N(S)N, CC + GSN, CC + IC + SN. - -**9.1.13** The applicant is required to state the planned date of commercial implementation in at least two countries not within the same integrated numbering plan. - -**9.1.14** The applicant may apply for a subsequent IC under the following circumstances: - -- The current assignment is approaching exhaustion: - - An additional assignment would be based on confirmation that the existing resource is being used in an efficient manner, e.g., the format and length of the numbering plan is appropriate. - - The applicant must provide substantiated information that the resource is approaching exhaustion. -- Other substantiated reasons: - - any additional criteria that is listed in clauses 9.1.1 to 9.1.13; - - the applicant must demonstrate that the resource will be utilized by a distinct Network. Such a request is to be treated as a new application. - -**9.1.15** The applicant will annually certify that the resource reserved for it is planned to be used and will also reaffirm its prime contact details through the submission of a status notification to the Director of TSB. This certification should also include a list of any third parties who will be administering the resource on behalf of the applicant. The responsibility for the resource that is reserved lies with the applicant and any subsequent misuse by the applicant or by a third party under contract to the applicant to whom a numbering resource has been sub-allocated could place that allocation in jeopardy, see clause 9.3. - -**9.1.16** It is the responsibility of the applicant to provide its prime contact details and a process to address complaints regarding misuse of the resource upon request of the Director of TSB and the requesting national Administrations. - -**9.1.17** The applicant is required to maintain a current list of third parties to which its resource has been sub-allocated. This list is to be provided to the Director of TSB upon request. - -### **9.2 Criteria for assignment for multi-use Networks** - -Assignment of E.164 resource(s) to multi-use Networks is based on the following criteria: - -**9.2.1** TSB has received a written request for assignment. - -**9.2.2** The applicant must be a Member State, or a Sector Member of the ITU or an Associate of the appropriate ITU-T study group. - -**9.2.3** The applicant must satisfy or have already complied with the resource reservation process. - -**9.2.4** The applicant affirms that all national regulatory, licensing and legal requirements of the countries in which the applicant's Network will operate and provide service would be met, including compliance with applicable restrictions on sub-allocation of the resource, as well as ITU-T Recommendations listed in clause 2. - -**9.2.5** The applicant affirms that it does and will continue to satisfy the criteria for reservation. - -**9.2.6** The applicant affirms that the Network and its intended public correspondence services will be implemented between two or more countries, which are not within the same integrated numbering plan, within a maximum of one year from the date of assignment. - -**9.2.7** Assignment of subsequent CC + ICs to the same network requires confirmation that the current assignment is approaching exhausting and that existing codes have been used in an efficient manner. - -**9.2.8** The applicant will annually certify that the resource which has been assigned to it continues to be in operation, that all third parties who are administering the resource have been identified to TSB and have complied with the application criteria, and will also reaffirm its prime contact details through the submission of a status notification to the Director of TSB. - -**9.2.9** The responsibility for the resource that is assigned lies with the applicant and any subsequent misuse by the assignee or sub-allocation to a third party under contract to the assignee could place that allocation in jeopardy, see clause 9.3. - -**9.2.10** The applicant is required to provide its prime contact details and to maintain a process to address complaints regarding misuse of the resource which must be made available to TSB and requesting Administrations, see clause 9.1.15. - -**9.2.11** The applicant is required to maintain a current list of third parties to which its resource has been sub-allocated. This list is to be provided to the Director of TSB upon request. - -**9.2.12** The applicant affirms that all involved third parties will inform relevant users how to complain in case that they have been infringed and provide the mechanism with which they will respond to complaints. - -### **9.3 Criteria for reclamation for multi-use Networks** - -The reserved IC is to be reclaimed in the event that the applicant no longer meets the reservation criteria, the applicant no longer requires the reserved resource, or if the reservation period expires without the code being assigned. - -**9.3.1** The assigned IC is subject to reclamation if it is either not implemented, or the Network no longer satisfies the assignment criteria, or the Network is not operational between at least two countries not within the same numbering plan, or the IC is not in use for a period of two years. - -**9.3.2** The assigned IC is subject to reclamation if TSB or the appropriate ITU-T study group determines there is an infringement of the assignment criteria or directly related ITU-T Recommendations, by the assignee or any third party administering the resource. - -**9.3.3** The reserved or assigned IC will be subject to reclamation if the status notifications mentioned in clause 9.2.8 and above are not submitted annually to the Director of TSB. - -### **9.4 Procedures for the reservation, assignment, and reclamation of country codes and associated identification codes for multi-use Networks** - -#### **9.4.1 Reservation** - -**9.4.1.1** Requests for the reservation of a CC + IC to a multi-use Networks should be addressed in writing and electronically to the Director of TSB. The written request should be submitted on official company letterhead and signed by an appropriate company representative. The signature of the appropriate company representative affirms that, in the applicant's view, all the criteria are met. This written request should include: - -- a) a planned code activation date in order to determine the relevant urgency of the request; -- b) sufficient non-proprietary information so that the request can be analysed to satisfy the criteria given in clause 9.1, e.g., planned network architecture and call flows; and - -- c) an affirmation that the applicant is a Member State, a Sector Member or an Associate of the appropriate ITU study group. - -**9.4.1.2** In making decisions, the Director of TSB consults with the chairman of the relevant ITU-T study group or their delegated representatives. - -**9.4.1.3** A CC + IC reservation is made for up to a three-year period, beyond which annual extensions, up to a maximum of two, may be permitted. This allows a maximum reservation period of up to five years. The reservation period ends at the beginning of the assignment period. The Director of TSB would re-evaluate the reservation at the end of the time period if an assignment of the CC + IC has not been made. In order for the extension to be approved, the applicant must demonstrate that difficulties have prevented the implementation of services on its Network. - -**9.4.1.4** Provided the criteria in clause 9.1 are met, an applicant's request for reservation of a CC + IC would be granted by the Director of TSB with consultation from the appropriate ITU-T study group and/or its delegated representatives. Within a CC, the applicants receive ICs in sequential order. - -**9.4.1.5** If the criteria are not met, TSB shall detail the areas of non-conformance. The applicant can submit a supplement to its original application to the Director of TSB that responds with new or clarifying information. (For detailed procedures, please refer to 9.5 and Appendix I.) - -**9.4.1.6** After the reservation has been made, the Director of TSB would respond in writing to the applicant and include appropriate information for its ongoing responsibility as contained in [ITU-T E.164] and [ITU-T E.190]. In addition, the reservation would be published in the appropriate media, e.g., the ITU website (TIES) and the Operational Bulletin. - -**9.4.1.7** During the reservation period, the applicant can only use the CC + IC for non-commercial trial and testing purposes. - -#### **9.4.2 Assignment** - -Requests for the assignment of a CC + IC to a multi-use Network are to be addressed in writing to the Director of TSB. - -**9.4.2.1** The request would provide evidence that the criteria in clause 9.2 have been, or will be complied with, by the activation date. In the latter case, TSB must be informed of the full compliance with the criteria prior to the assignment of the code. - -**9.4.2.2** If the criteria are not met, the CC + IC will not be assigned. - -**9.4.2.3** After the assignment has been made, the Director of TSB will respond in writing to the applicant and the assignment will be published in the appropriate media, e.g., the ITU website (TIES) and the Operational Bulletin. - -#### **9.4.3 Reclamation** - -The Director of TSB will notify the assignee in writing that the code is subject to reclamation. - -**9.4.3.1** The Director of TSB will return a reserved code to spare if the criteria for reclamation of a reserved code have been met. - -**9.4.3.2** At the time of IC reclamation of an assigned code, the Director of TSB should publish the date of IC reclamation and the IC should not be reassigned for a period of two years and will be indicated as "spare". - -**9.4.3.3** If an applicant or assignee determines that the IC is no longer required, the Director of TSB is to be notified in writing. The Director will respond in writing to the applicant and publish the reclamation in the appropriate media, e.g., the ITU website (TIES) and the Operational Bulletin. - -**9.4.3.4** A code is to be reclaimed if the applicant has not certified on an annual basis that the code is being used in accordance with the reservation or assignment request or has not also provided the applicant's prime contact details and an affirmation that the applicant is a Member State, a Sector Member or an Associate of the appropriate ITU-T study group. - -### **9.5 Appeals process for multi-use Networks** - -If the IC applicant has been denied an IC reservation or assignment, the applicant can appeal the denial to the Director of TSB in accordance with clause 8.5. - -## Annex A - -## Country code and length of associated ICs - -(This annex forms an integral part of this Recommendation) - -The E.164 resources assigned to Networks consist of a three-digit shared country code (CC) followed by a variable length identification code (IC). - -**CC 881** ICs are 1 digit in length - -**CC 882** ICs are 2 digits in length - -**CC 883** - -Note that the shared E.164 country code 883 will be reserved and assigned by TSB as follows: - -- 883 0 through 883 4 for assignment of 3-digit ICs -- 883 5 through 883 8 for assignment of 4-digit ICs -- 883 9 is reserved for future use - -## Appendix I - -## **Review process for the reservation and assignment of identification codes (ICs) associated with the category of E.164 codes titled "shared country codes (CC) for Networks"** - -(This appendix does not form an integral part of this Recommendation) - -### **I.1 Introduction** - -This appendix details the process to be used by an applicant, the TSB, and Study Group 23 (SG 2) (henceforth known as the study group), for the reservation and assignment of E.164 identification codes (ICs) associated with the category of E.164 country codes titled "Shared Country Codes (CCs) for Networks", the combination of which is known as the "CC + IC". This process is derived from WTSA Resolution 20. For Study Group 2, the Numbering Coordination Team (NCT)4 is a permanent group giving advice to the Director in accordance with this Resolution. - -Resolution 20 states that the Director of TSB has the responsibility to administer E.164 resources, and should consult with the study group in the course of these responsibilities, as appropriate. It is recommended that an instance of such consultation is the administration of the shared E.164 country codes and associated identification codes for Networks. - -Terms, criteria, and definitions appropriate to this appendix are contained in [ITU-T E.190] and [ITU-T E.164]. - -### **I.2 General procedures** - -**I.2.1** All members of the NCT should be present for advice to be given regarding the reservation or assignment of a CC + IC. - -**I.2.2** The assignment or denial of a CC + IC requires unanimous agreement of the NCT. In the absence of a unanimous agreement, the CC + IC application is referred to the working party or study group (whichever meets first) for advice. - -**I.2.3** If the NCT, in the processing of an application, is in receipt of information classified as "proprietary" by the applicant, this information will not become a part of the ITU public domain. Additionally, all NCT members will treat the information provided to them as proprietary and for the sole purpose of application processing. Once the application decision has been reached, the NCT members will return all documents containing proprietary information to TSB for proper handling. - -**I.2.4** The NCT will advise on all applications within 45 days of the end of the application comment cycle, i.e., 75 days from the posting of the application on the FTP site. If the NCT requires further clarifying information from the applicant for resolution, 20 additional days may be added to the process. - ---- - -3 Study Group 2 was responsible for the maintenance of numbering resources within ITU-T when this appendix was approved, and is therefore shown as the "appropriate Study Group". If this maintenance responsibility is transferred to another study group, that study group will then be the "appropriate Study Group". - -4 The NCT, at the time of the development of this appendix, included the SG 2 chairman (NCT chairman), the SG 2 counsellor, the WP 1/2 chairman, the WP 1/2 vice-chairman, the Q.1/2 rapporteur (NCT secretary), and the Q.1/2 associate rapporteur. The SG 2 can, however, revise the membership of the NCT, as appropriate and necessary, without the revision of this appendix. - -**I.2.5** The NCT will report the results of its activities, if any, at each working party and study group meeting. The report will be written and will contain (as a minimum) the list of current reservations and assignments and the results of reservation and assignment requests received and processed since the last report. If an application is denied, an explanation of the reason for the denial is provided to the applicant and may also be published for the study group's information at the applicant's discretion. - -### **I.3 Specific CC + IC reservation and assignment procedures** - -#### **I.3.1 Step 1 – Reservation request process** - -**I.3.1.1** The applicant submits an application in writing and electronically2, for the reservation of a CC + IC (3D + 2D), to TSB (preferably via the TSB EDH Group) identifying and describing its network, and certifying5 its network's conformance with this Recommendation's IC reservation criteria for shared E.164 country codes for Networks. - -**I.3.1.2** Upon receipt of an application, when justified, TSB forwards a copy of the application to the NCT members and establishes the date and time for advice (normally by a conference call). - -**I.3.1.3** TSB announces receipt of the application, and publishes the application itself (excluding proprietary information), utilizing the ITU-T SG 2 EDH-FTP capability, and notifies the NCT when justified. The comment cycle (the period during which comments on an application will be received by TSB) will be for 30 days from the FTP posting. All comments will be forwarded, by TSB upon receipt, to the NCT members for consideration along with the application itself. Only comments directly relating to the IC reservation criteria, contained in this Recommendation, will be considered by the NCT. - -#### **I.3.2 Step 2 – Reservation process** - -**I.3.2.1** TSB will act immediately upon receipt of a request for reservation and assignment. The NCT, when justified, normally by conference call, reviews the reservation application and the related comments. If the NCT agrees that the applicant and its network are in conformance with all IC reservation criteria, the NCT recommends that TSB reserve an appropriate IC for the applicant's network. - -**I.3.2.2** Unless TSB identifies a compelling reason that the reservation should not be made, the reservation will be made and the appropriate records (including TSB databases and website) modified. When the reservation is made, TSB informs the applicant by letter. - -**I.3.2.3** If the NCT identifies any criteria with which the applicant, or the applicant's network, is not in conformance, the NCT will deny the reservation request. If the NCT is in doubt, based on the information provided, whether the applicant, or the applicant's network, are in conformance with a reservation criteria, the NCT chairman will send a letter to the applicant identifying the criteria in question and will request that additional clarifying information be transmitted to TSB within ten days. Upon receipt of the clarifying information, TSB will provide the information to all NCT members and will establish the date and time for an additional conference call. The NCT will meet within ten days of receipt of the additional information to resolve the application. - -If the application still does not conform to the reservation criteria, TSB will send a letter to the applicant reporting the code denial together with an explanation of the reason for denial. - ---- - -5 Certification includes an explanation regarding how the applicant's network conforms to each criterion. - -#### **I.3.3 Step 3 – Assignment request process** - -**I.3.3.1** The applicant submits an application (where possible, via electronic means), for the assignment of the previously reserved CC + IC, to TSB (preferably via the TSB EDH Group) certifying5 its network's conformance with this Recommendation's IC assignment criteria for shared E.164 country codes for Networks. - -**I.3.3.2** TSB will act immediately upon receipt of a request for reservation and assignment. Upon receipt of an application, when justified, TSB forwards a copy of the application to the NCT members and establishes the date and time for an application resolution meeting (normally by a conference call). - -**I.3.3.3** TSB announces receipt of the application, and publishes the application itself (excluding proprietary information), utilizing the ITU-T SG 2 EDH-FTP capability, and notifies the Q.1/2 collaborator's list for comment. The comment cycle (the period during which comments on an application will be received by TSB) will be for 30 days from the FTP site posting. All comments will be forwarded, by TSB upon receipt, to the NCT members for consideration along with the application itself. Only comments directly relating to the IC assignment criteria, contained in this Recommendation, will be considered by the NCT. - -#### **I.3.4 Step 4 – Assignment process** - -**I.3.4.1** TSB will act immediately upon receipt of a request for reservation and assignment. The NCT, when justified, normally by conference call, reviews the assignment application and the related comments. If the NCT agrees that the applicant and its network are in conformance with all IC assignment criteria, the NCT recommends that TSB assign the reserved IC for the applicant's network. - -**I.3.4.2** Unless TSB identifies a compelling reason that the assignment should not be made, the assignment will be made and the appropriate records (including TSB databases and website) modified. When the assignment is made, TSB informs the applicant by letter. - -**I.3.4.3** If the NCT identifies any criteria with which the applicant, or the applicant's network, is not in conformance, the NCT will deny the assignment request. If the NCT is in doubt, based on the information provided, whether the applicant, or the applicant's network, are in conformance with an assignment criteria, the NCT chairman will send a letter to the applicant identifying the criteria in question and will request that additional clarifying information be transmitted to TSB within ten days. Upon receipt of the clarifying information, TSB will provide the information to all NCT members and will establish the date and time for an additional conference call. The NCT will meet within ten days of receipt of the additional information to resolve the application. If the application still does not conform to the assignment criteria, TSB will send a letter to the applicant reporting the code assignment denial together with an explanation of the reason for denial. - -### **I.4 Application resubmission and appeals processes** - -If an application for the reservation or assignment of a CC + IC is denied, the applicant may either: - -- revise the application in response to the denial and the associated reason(s) for denial and resubmit it to the Director of TSB as a new application; or -- appeal against the denial, utilizing the original application with a supplement to it that responds to the reasons for denial. - - - -# SERIES OF ITU-T RECOMMENDATIONS - -| | | -|-----------------|---------------------------------------------------------------------------------------------| -| Series A | Organization of the work of ITU-T | -| Series D | General tariff principles | -| Series E | Overall network operation, telephone service, service operation and human factors | -| Series F | Non-telephone telecommunication services | -| Series G | Transmission systems and media, digital systems and networks | -| Series H | Audiovisual and multimedia systems | -| Series I | Integrated services digital network | -| Series J | Cable networks and transmission of television, sound programme and other multimedia signals | -| Series K | Protection against interference | -| Series L | Construction, installation and protection of cables and other elements of outside plant | -| Series M | Telecommunication management, including TMN and network maintenance | -| Series N | Maintenance: international sound programme and television transmission circuits | -| Series O | Specifications of measuring equipment | -| Series P | Telephone transmission quality, telephone installations, local line networks | -| Series Q | Switching and signalling | -| Series R | Telegraph transmission | -| Series S | Telegraph services terminal equipment | -| Series T | Terminals for telematic services | -| Series U | Telegraph switching | -| Series V | Data communication over the telephone network | -| Series X | Data networks, open system communications and security | -| Series Y | Global information infrastructure, Internet protocol aspects and next-generation networks | -| Series Z | Languages and general software aspects for telecommunication systems | \ No newline at end of file diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/000a505684f871e191bad335434f58a9_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/000a505684f871e191bad335434f58a9_img.jpg deleted file mode 100644 index 73f2b20c653c4830bf74af2596b58a66ef56eee1..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/000a505684f871e191bad335434f58a9_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:5fbe2dbc575dbd8b32f9391691d4ac705a3f4e3d22c08f44415c4df77e904e7f -size 24395 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/0070d5ae6e586c9cfa20085d26d3eb2e_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/0070d5ae6e586c9cfa20085d26d3eb2e_img.jpg deleted file mode 100644 index bccf23b1fe2bc0390a721f5608221b9e6e8bd504..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/0070d5ae6e586c9cfa20085d26d3eb2e_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:bf7475cbe022baf6c0a1acdb5adab35431e142b9a906d119d815dc9de56bd59d -size 12296 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/014daefdecf9d847ca82cb5b9f50731f_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/014daefdecf9d847ca82cb5b9f50731f_img.jpg deleted file mode 100644 index a720b840197ab10fa7ab110ba5f35dfb77f7da63..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/014daefdecf9d847ca82cb5b9f50731f_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:eda575e45ced907fa91b1f5a116432452ce51ab069d8f897064e250b8cc9c791 -size 15698 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/024914144d624b7f5dc22aaa5c3967b9_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/024914144d624b7f5dc22aaa5c3967b9_img.jpg deleted file mode 100644 index 272730021efa56c4ca4413befd45dc065a7474c5..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/024914144d624b7f5dc22aaa5c3967b9_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:655d53d0ec4d6342ae622be366d3eb1c58199626a36a19c9248ed4ca7b8f4935 -size 121825 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/02dfdcd208dbdc8fa4f645885e59dd17_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/02dfdcd208dbdc8fa4f645885e59dd17_img.jpg deleted file mode 100644 index 78fdd2019bbc2b43a62adb7ff6f9b21d3bf2e99a..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/02dfdcd208dbdc8fa4f645885e59dd17_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:db51c084e0fc4fece87fd6182a4897edbed9c7805ad10d8f2860cb3849d8b257 -size 14653 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/031de8ea6c5568a02faffd59b5c337f7_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/031de8ea6c5568a02faffd59b5c337f7_img.jpg deleted file mode 100644 index 681d9b9e3cbd7389e2f508ec210480df99119961..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/031de8ea6c5568a02faffd59b5c337f7_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:773ba9c227093c8372d764696642747028c3a01ad867d0c075cf4b4aaeed6671 -size 210070 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/04244205ef763574ac5ef2df0513c14d_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/04244205ef763574ac5ef2df0513c14d_img.jpg deleted file mode 100644 index 5768e0e39db36c20c408eb90d4befbb25b701fc4..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/04244205ef763574ac5ef2df0513c14d_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:8a1c542448ac2d07f175bbc7dd9b89fd24621510ec7c1d02f4bd0699bf9be862 -size 7506 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/04a21eb4cd167fac602b875e961ded35_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/04a21eb4cd167fac602b875e961ded35_img.jpg deleted file mode 100644 index 11b8c71a09c303011cc5ad47bcc16e3c92df640f..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/04a21eb4cd167fac602b875e961ded35_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:3de5c542b6c909d40b2722d8b416c37a4b3272152d55094eaa7f4ef065a0a19a -size 61018 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/0603e0bad64a10c96372bbcf8c5d0d14_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/0603e0bad64a10c96372bbcf8c5d0d14_img.jpg deleted file mode 100644 index 016cba698fbd9e6ea34a9746c32c0197880363f3..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/0603e0bad64a10c96372bbcf8c5d0d14_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:97b37d42b3a662a4ce1abdfdbd3dfdbcda3e2879752701467197404edfe70dbd -size 19889 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/0697b56d281df40b93c568be995cb884_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/0697b56d281df40b93c568be995cb884_img.jpg deleted file mode 100644 index 4ebb5fcc7e227e75341f0fdee7facf5bb3c45eeb..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/0697b56d281df40b93c568be995cb884_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:e894b5518fe1289b7cba251f29fd2507724687303650a0661845b6db29894374 -size 58578 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/06ab63c9cae7ba781705155c8911f0b7_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/06ab63c9cae7ba781705155c8911f0b7_img.jpg deleted file mode 100644 index 3e0dd1167c94ea912b4592ae869fec29a14be615..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/06ab63c9cae7ba781705155c8911f0b7_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:18be71a2f101ee8d150fe0d8bc6c0bde5c33eba488d273b487f49c05c44ad37e -size 28095 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/07b57db1227a83b659cd2def7b8ba5ea_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/07b57db1227a83b659cd2def7b8ba5ea_img.jpg deleted file mode 100644 index a6c2cd04336bf723e9da1a3566c1896ea2d6573c..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/07b57db1227a83b659cd2def7b8ba5ea_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:84718a4fb258729f87c4dd94d295655bfbab0843c56d0fc10c2b317171498c25 -size 9282 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/0823130a6e07569e2fdb6bbdfc355d39_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/0823130a6e07569e2fdb6bbdfc355d39_img.jpg deleted file mode 100644 index 3df28f26707913fde8db2c12d71505159704c1b5..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/0823130a6e07569e2fdb6bbdfc355d39_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:a6a0423074d8de509f2e3131a843229e79711da6eb843d7a23c7f422fe79affe -size 10262 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/08246879b7e3340f5c7af67ca43e48ff_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/08246879b7e3340f5c7af67ca43e48ff_img.jpg deleted file mode 100644 index e20bd61bf12ccd8534fbecde080382b082d50dbf..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/08246879b7e3340f5c7af67ca43e48ff_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:7c888f72266622f9645ad42e06f6292b6970f265c8a534990d42f97afb454f66 -size 75964 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/0850300da6b28250eb47881da35cabad_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/0850300da6b28250eb47881da35cabad_img.jpg deleted file mode 100644 index 67aadb6253c2842f4f62cc14e18d2294398ffbf8..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/0850300da6b28250eb47881da35cabad_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:39dae85ed5c5cd3105dd156db1576b1e02007b813ff1fb6c56c351fe7a28e635 -size 44367 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/088fd744940924d37de4d237e53bb684_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/088fd744940924d37de4d237e53bb684_img.jpg deleted file mode 100644 index f4b1fad350fc78e54f524e8376245f21598075f6..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/088fd744940924d37de4d237e53bb684_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:4527cca557abc82b8e2c2a08a8f7b3006a7abb0fa63468a7d8bb6846155da16c -size 74449 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/0897c77315bfe37a098f6b4ea39570d2_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/0897c77315bfe37a098f6b4ea39570d2_img.jpg deleted file mode 100644 index bca9b5ebf6f516791309f46e65eda4ee4543e9c1..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/0897c77315bfe37a098f6b4ea39570d2_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:4784d373b1bde8541bde98ad5810385ce85cc69bf089f31421c5640ce49c3165 -size 13871 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/09cac7f879d0ec76600a5aeae680b95b_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/09cac7f879d0ec76600a5aeae680b95b_img.jpg deleted file mode 100644 index 6f2b3d3f1f02532a7c2918e585c16d123fbdd6c5..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/09cac7f879d0ec76600a5aeae680b95b_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:7b792786eed1cf402410f28eb43209b75824cb4acba946b716756131e9b9c595 -size 21082 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/09e709f61c6ce948e16ddcc0f7efebcb_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/09e709f61c6ce948e16ddcc0f7efebcb_img.jpg deleted file mode 100644 index c2c972fb5a858e0bded9ce048302b5f011829b04..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/09e709f61c6ce948e16ddcc0f7efebcb_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:5e9df3011a6a09d4dddab2bb876e12164aaa7d44b90675004cb94e6bdcf9d2e2 -size 7797 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/0af1ba85ab6e4e50befbef3d63e017dc_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/0af1ba85ab6e4e50befbef3d63e017dc_img.jpg deleted file mode 100644 index 5b59ec36a13f444f4f1224c03df84c6b3551886e..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/0af1ba85ab6e4e50befbef3d63e017dc_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:04aa8c13f3d97458d740cbb07a5602941086aee96b92b2bfb1379469c4a7cbd1 -size 12770 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/0b733c1407312c5b063e9bb458ef99db_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/0b733c1407312c5b063e9bb458ef99db_img.jpg deleted file mode 100644 index 4bbec99b5e1656d4fb1f9de957cbe5487ff33e36..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/0b733c1407312c5b063e9bb458ef99db_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:9b8019ebf424876d1652b82c7fe82128e29f7b03a800febe2aa70b6d7274b164 -size 89374 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/0b998e3ad8f9d104768642612605cb35_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/0b998e3ad8f9d104768642612605cb35_img.jpg deleted file mode 100644 index a85ac15699552c1d2bc9cc4909ca28d8d8856d38..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/0b998e3ad8f9d104768642612605cb35_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:d669aa2affae2e6dffa2aa34c414fb9334cf6427e4cb0770db96f22a75b4ee87 -size 42328 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/0bce130a8686477232911728d05b4b13_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/0bce130a8686477232911728d05b4b13_img.jpg deleted file mode 100644 index 19f1f083b203aa90abe7d309c43e219a0eced54d..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/0bce130a8686477232911728d05b4b13_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:3d8785d15606345789b3a20758ac168d1672532b2d32944912127f05844906f0 -size 186539 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/0c360dc1fae48be6b928e626f9e7569b_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/0c360dc1fae48be6b928e626f9e7569b_img.jpg deleted file mode 100644 index 9a07a81e4a6def975b4e9debc4d0b5020ca4ad02..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/0c360dc1fae48be6b928e626f9e7569b_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:c3a404ca1e018289182462686abd5fe6b904d050c37595591d261b405bd6e90f -size 130806 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/0fa5b60804100c3aead10404f9f226f9_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/0fa5b60804100c3aead10404f9f226f9_img.jpg deleted file mode 100644 index 030619ec770d7c2cf106786294c6dbeae037188d..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/0fa5b60804100c3aead10404f9f226f9_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:d718a70087bc06406e7af91eb6d56739f7f0770ea27147a32ebd3dcd851217a1 -size 29379 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/0fdef87ff1fd322c626d1ff8df725749_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/0fdef87ff1fd322c626d1ff8df725749_img.jpg deleted file mode 100644 index 7fa7f29e35b3f167ea255c61c6d1d5c78cfadcbc..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/0fdef87ff1fd322c626d1ff8df725749_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:57bea94a86a60fe303a49f1c09a6087c98eb00035ce80587d8dc2d2494dbc2ec -size 99054 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/1033dc9fde75540d224c907681b1b7aa_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/1033dc9fde75540d224c907681b1b7aa_img.jpg deleted file mode 100644 index 8f9a5134052d7c1ec479eee3e986ead0c9800f0d..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/1033dc9fde75540d224c907681b1b7aa_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:c02821fd80c2ac618bd86fa25fd56f3fd245ba2e860ee2c413a13ad277c7cede -size 112362 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/107cbeda15ddd53da92c2f677b441c93_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/107cbeda15ddd53da92c2f677b441c93_img.jpg deleted file mode 100644 index 548e5058e6e20af43e76e0bb6e4476108224e12e..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/107cbeda15ddd53da92c2f677b441c93_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:e8e8536f0e50c047992b2ec79957dc9e38685f0a1c8c0613dd7d561c27c900c3 -size 75159 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/10f4e3a2f3c016555ee12a5b556ba834_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/10f4e3a2f3c016555ee12a5b556ba834_img.jpg deleted file mode 100644 index 90d78380111009b8058f48455a0c54d39fc0fdc6..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/10f4e3a2f3c016555ee12a5b556ba834_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:2dcc2aa410b8de833a9ae00933b80627df1af10d947eebb727dd19fa447273f8 -size 67327 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/11edb7fcedf09ac6a817f8d7b8c61eec_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/11edb7fcedf09ac6a817f8d7b8c61eec_img.jpg deleted file mode 100644 index 37aa2915888b8a37e445334673a990d3b3ba534e..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/11edb7fcedf09ac6a817f8d7b8c61eec_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:98248647ef26060321d20f0b985b016b81616ea01f878dccad51ef47465e2513 -size 17178 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/13df7f8b1a0bebbe3b52a35d9af93631_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/13df7f8b1a0bebbe3b52a35d9af93631_img.jpg deleted file mode 100644 index 10fc4223b96e634a8278f814e3c6c1d152d4b048..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/13df7f8b1a0bebbe3b52a35d9af93631_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:16834aa63ac43143098774fa9151aa483969a9b33d57869ae2edd33a31296043 -size 10680 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/143c8ee1010bf7669caabfbed815df1b_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/143c8ee1010bf7669caabfbed815df1b_img.jpg deleted file mode 100644 index ecc10e24999318d6981a24d5015213c9979abec6..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/143c8ee1010bf7669caabfbed815df1b_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:cf4bf809fc5e488e198d4f0a61a6d30e9be3330c3af71f3a0319be2371ba5573 -size 51853 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/14d497ab16a07c50b3215ffef2149ab9_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/14d497ab16a07c50b3215ffef2149ab9_img.jpg deleted file mode 100644 index b8448225502923d12a7b30ed3e307dab6da5557e..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/14d497ab16a07c50b3215ffef2149ab9_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:b9a2286a49476efef4d44c8746b3739ff3fc819db55c6789a81e49d4c69a8758 -size 42258 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/15de63f0b5df62e6ab9164f2a72e2e33_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/15de63f0b5df62e6ab9164f2a72e2e33_img.jpg deleted file mode 100644 index c958f8b9be468102786f9fa84d35e09767398daa..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/15de63f0b5df62e6ab9164f2a72e2e33_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:70379b5be8dbdcbf3f52fce71fea7bbb26da6d26d093f4d023395ba3b46f5a3a -size 28438 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/1684f5f8c34bd0ef6e933664d88b9d86_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/1684f5f8c34bd0ef6e933664d88b9d86_img.jpg deleted file mode 100644 index 4d905857112a0503b50ce19b989d09670cb32bd1..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/1684f5f8c34bd0ef6e933664d88b9d86_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:278eebf41163ac1bc0ff255d0ab5dc02f45f87914d005d8af571437297a596e8 -size 79444 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/169044aee9e8adb39eed822364eed8aa_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/169044aee9e8adb39eed822364eed8aa_img.jpg deleted file mode 100644 index fca607e741ceaecc65dd0669c6d2b09a394c9d65..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/169044aee9e8adb39eed822364eed8aa_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:df5d55490fd116bbbaccc376806b0228745797db522b4f1098f3604202dbeb88 -size 78915 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/1846b9e1673ade53caa7358696bc1794_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/1846b9e1673ade53caa7358696bc1794_img.jpg deleted file mode 100644 index cbc78ca6a12e736fc9b6fd8b1a037f578cf289e5..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/1846b9e1673ade53caa7358696bc1794_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:c5fe5be8b57906bb5e63ab8914b08f84f4c9abc8a15fabf7acda25ef73378847 -size 103465 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/189062b6daff39a4a33fb150b0aca878_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/189062b6daff39a4a33fb150b0aca878_img.jpg deleted file mode 100644 index 44e95d0ba86927f8d4d277f6307ce5da5bfd2e6c..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/189062b6daff39a4a33fb150b0aca878_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:092b26219b7287643960a2c2bd2c92e0229c82a6e216229bc3d04ec439625ed7 -size 20409 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/18d75b5fb1019ed4bc5384d14f8d1b7a_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/18d75b5fb1019ed4bc5384d14f8d1b7a_img.jpg deleted file mode 100644 index 2491909bacf3d52fc2edf971894c4af2b1e427f4..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/18d75b5fb1019ed4bc5384d14f8d1b7a_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:86c0e73d73fbf526dba0d1283d94cb3bcd28685463cd9eaca86ba54a25482de4 -size 32354 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/18e10a200cbafecb4114d25fa128b703_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/18e10a200cbafecb4114d25fa128b703_img.jpg deleted file mode 100644 index 662221df7dfcc2fd6cc328419186a2595a3c6669..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/18e10a200cbafecb4114d25fa128b703_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:303b37e143cd2d038756178b65950080e5e09a7212fd863f5e13dbdc5312972d -size 8840 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/18fb2f2a7bdbb03074578da43004abaa_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/18fb2f2a7bdbb03074578da43004abaa_img.jpg deleted file mode 100644 index 266d2e2b0ab0f423616ecac105622b619d4dcfab..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/18fb2f2a7bdbb03074578da43004abaa_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:3876cd4314f3512a535c86ffacff4868c89104bc4cde6d35cf8dce5ff4aa3ee1 -size 9995 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/1a05c3cbf9fd7b2a8873cad13d10cdb6_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/1a05c3cbf9fd7b2a8873cad13d10cdb6_img.jpg deleted file mode 100644 index c363eae4cd8e0aa015fc2dcb66314fa106dd9724..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/1a05c3cbf9fd7b2a8873cad13d10cdb6_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:0fe3899c8f8cecda47d2519aa291658088b147d5ae064098e4fcdcccefb40c2a -size 136391 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/1a1c6e97fdffe8ffed7b997b7e682d3c_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/1a1c6e97fdffe8ffed7b997b7e682d3c_img.jpg deleted file mode 100644 index ff8b0fdcc4fed4339accd0212c3a0bb54dab7527..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/1a1c6e97fdffe8ffed7b997b7e682d3c_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:1d619bb15f4cb8c784b98779e44f17ad37aba89c6a806e8c57cbfe15d3c51d23 -size 154357 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/1b683c1801ad8e24cf113cede25b36f0_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/1b683c1801ad8e24cf113cede25b36f0_img.jpg deleted file mode 100644 index 75de017cf05b8c4cb8bd30caf76569cd739023af..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/1b683c1801ad8e24cf113cede25b36f0_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:e001cff98c3daa2f6102e5d4597ddb976fdf69410ffebbe16aa836a46b0c0bcc -size 174372 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/1ba9045eb6dc22039a16b92b1427e696_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/1ba9045eb6dc22039a16b92b1427e696_img.jpg deleted file mode 100644 index 2db2b7d13a76bbc99ec849bbffd32b92b0822a91..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/1ba9045eb6dc22039a16b92b1427e696_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:a87938669d32057a2508066fb5ff88f9079917f1d1a0aa67493a74d3dbb30295 -size 21024 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/1c453289f9bc736ca66bdaf7178601c3_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/1c453289f9bc736ca66bdaf7178601c3_img.jpg deleted file mode 100644 index ec37edf73e875444d4ecafc2c03916b6f4b6a160..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/1c453289f9bc736ca66bdaf7178601c3_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:6b8ad762d4f8e2c20cd379b6157536531ca04e4b6f2dcace43717e2596835f8b -size 14232 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/1cf7488717213a910c805cf83ee186ee_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/1cf7488717213a910c805cf83ee186ee_img.jpg deleted file mode 100644 index acd93d3e510202b8660899e4e2bdec8e6607e574..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/1cf7488717213a910c805cf83ee186ee_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:dca0858f3d7d23fa72466b9a8855a26cdb9fd8e2a9f3ae8136bf1c3340997818 -size 13223 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/1ff7740e14c18789657d277030fb69ce_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/1ff7740e14c18789657d277030fb69ce_img.jpg deleted file mode 100644 index 16d9469e48eb493337fee50c29de2f1576716388..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/1ff7740e14c18789657d277030fb69ce_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:ecda96722d5a0ebe538835b906656be659bec9a9747557c255d712c8c90df6f5 -size 10307 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/21327313f7b18a481da0c87a6472a80d_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/21327313f7b18a481da0c87a6472a80d_img.jpg deleted file mode 100644 index 2c0434e15687432125840647590cc69a5ceb2017..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/21327313f7b18a481da0c87a6472a80d_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:4c97c30eb97b184c00fccba8f7b5f5551b337f4f32ca99828911e1e61e8ed7de -size 6403 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/228db097d546afebf934a1befb86a0a6_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/228db097d546afebf934a1befb86a0a6_img.jpg deleted file mode 100644 index a7418edc973e45a93a244421f9a36a69b5b7508e..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/228db097d546afebf934a1befb86a0a6_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:9028edefb936b192839a1ef2a77d7b26d435e07ebcd1b2574e96d091378b2d19 -size 33154 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/2339cc41fe4145cad3d90c1cd295dfd3_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/2339cc41fe4145cad3d90c1cd295dfd3_img.jpg deleted file mode 100644 index fcb6df06e4486ebe41aad8bb2b6390c088c8af4b..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/2339cc41fe4145cad3d90c1cd295dfd3_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:57d17e183efffed3cb82ea59a644971add8287f2d29fa9c8c5eb46a904203f0f -size 16012 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/236b5a83f488c361479b9b44e462f978_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/236b5a83f488c361479b9b44e462f978_img.jpg deleted file mode 100644 index 24034264767a6456aceede4d6ec5b565283264db..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/236b5a83f488c361479b9b44e462f978_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:999189bd541282c7eacfab59aab03714fa470d8a96cef0548e4be0419d5487ac -size 19960 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/236f674770a03c918c0375a74fe950db_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/236f674770a03c918c0375a74fe950db_img.jpg deleted file mode 100644 index df00edbc8aba2f480ba80269e7114c541d64150d..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/236f674770a03c918c0375a74fe950db_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:481cfec1f73b0c0f436383eec3e1702441d355b61283926d082ac7bb0ac23057 -size 14729 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/238754529581b74f0696943d436494bb_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/238754529581b74f0696943d436494bb_img.jpg deleted file mode 100644 index cf0f93ddff9275ec7d96c26d7d01ad3f4d8ece9f..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/238754529581b74f0696943d436494bb_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:c43db2010725ad040ac61a506b3127057d8005d5e1f75a290486f6f83271a2e5 -size 28250 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/24ee23a8f3995ecfd3aae31a37a1d40c_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/24ee23a8f3995ecfd3aae31a37a1d40c_img.jpg deleted file mode 100644 index 3eb355fe5b6102f8fd3263dd00b04cf71deda01f..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/24ee23a8f3995ecfd3aae31a37a1d40c_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:c03ded7a63c67bfa03b5244ca6e8617dc79718c56ba0f7eba75fa91125c1e9a4 -size 80792 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/2576306a75b1ca6180aa172236c1ca07_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/2576306a75b1ca6180aa172236c1ca07_img.jpg deleted file mode 100644 index a3aef4798e9a496531d19b2a8b2dc0ea042b5cd7..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/2576306a75b1ca6180aa172236c1ca07_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:337e57e380e0da5c025eb765b5e1f3ef6383b931dd39a23c6c3e5ddf33a50ff8 -size 54717 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/25b2ef5bcf30bfa9a31d59f48fddb3a7_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/25b2ef5bcf30bfa9a31d59f48fddb3a7_img.jpg deleted file mode 100644 index f50fa3c6203d5d6eab51dedc647ae90c6255a501..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/25b2ef5bcf30bfa9a31d59f48fddb3a7_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:e81288d4c8276463c96480936553ce2ba9623e4babb58f427f51e51452ff1e82 -size 20068 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/26c5c426f93cf66d35d87228668dac68_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/26c5c426f93cf66d35d87228668dac68_img.jpg deleted file mode 100644 index 1632a638cf47b4b536c0bb7e2a17a03465ebbb2d..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/26c5c426f93cf66d35d87228668dac68_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:838d66b120dacd69cbd7b088e9c4a41343d0e5f0e080d291035c88cf92f347e3 -size 20206 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/278814bf2c6d42b5817a334979f10bc0_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/278814bf2c6d42b5817a334979f10bc0_img.jpg deleted file mode 100644 index 177334619eab0dbf4fe84ed51a3f87ee9bd3717f..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/278814bf2c6d42b5817a334979f10bc0_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:c005e10c7cfc8ee2b7c2a5da8f1666bb96e7d6b358127c03dd62b7315abe488c -size 12024 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/27c0455a3b08749fed8057467366b0ce_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/27c0455a3b08749fed8057467366b0ce_img.jpg deleted file mode 100644 index eb9098244fb1873db647a8cd4ad5004775cd4b2d..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/27c0455a3b08749fed8057467366b0ce_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:bf301b85cd1132d9be3dc2be6496fe4d9fb0fbe56108df8c80d6cde407d69aad -size 13496 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/28583b06f211df822423d245dfad776f_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/28583b06f211df822423d245dfad776f_img.jpg deleted file mode 100644 index effcaeea5de59e876851b64a889933bf974dfe5f..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/28583b06f211df822423d245dfad776f_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:fcda1989e39bebd69eac6c835802abdf73a65ec344693a85bea868db2cd009c0 -size 184869 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/2977acb9333aa9e25450fff36691806b_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/2977acb9333aa9e25450fff36691806b_img.jpg deleted file mode 100644 index 1468f17bcca2ae23b9dc42b4e00bf61d54edd1fa..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/2977acb9333aa9e25450fff36691806b_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:e48a3793c02bd21c8f7a9243c8294f0e002a4e9457a777eeefb058374f4e1545 -size 8223 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/29a5f4072e91dc4857fce0ace805e0d4_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/29a5f4072e91dc4857fce0ace805e0d4_img.jpg deleted file mode 100644 index 2fef29c722abb3e9aee0b7170e73001605ccc785..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/29a5f4072e91dc4857fce0ace805e0d4_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:adda38b6f4f5e783292ae15ae1864c7ce78ff01d5e423812d462b75411da6047 -size 147227 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/29aa6165ccf449dee0b4335676fa7b1a_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/29aa6165ccf449dee0b4335676fa7b1a_img.jpg deleted file mode 100644 index 8fcff86e828310710873266843cce3a51e146863..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/29aa6165ccf449dee0b4335676fa7b1a_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:643d0d6e86a743d2de860a643d1df0b3ded93d1c3fd022d496e899662ccf9332 -size 106173 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/29e446c8e2363d27e282737c3d7c3421_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/29e446c8e2363d27e282737c3d7c3421_img.jpg deleted file mode 100644 index c7650a59b8b3b65b2598df3793ef712b8dae7138..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/29e446c8e2363d27e282737c3d7c3421_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:cb13d7b2bf369e6715ed9f59d53f9ade1c035a041e46b231789ac97deac5cf37 -size 21301 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/2b817d2912f95cb0ab93ff621a3f0a5b_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/2b817d2912f95cb0ab93ff621a3f0a5b_img.jpg deleted file mode 100644 index 98aecb54e8697ccd085305b175497fbcbdd7952e..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/2b817d2912f95cb0ab93ff621a3f0a5b_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:eed7fe0d15200276e3625b163028889508dca6ec6a5ca0571441c5ab5e77f9e3 -size 14445 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/2bb36c10542436112c2e54d97771bf32_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/2bb36c10542436112c2e54d97771bf32_img.jpg deleted file mode 100644 index f3b1bcd1ecb9021ce94a8a3358d8f20fd45f91f3..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/2bb36c10542436112c2e54d97771bf32_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:38a118fb0dcf942b5dffaa4a2c0dd3a0fc2dae53fbcbccbc01d4b2de70a6ec6c -size 45711 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/2bcc7de24074ca97717d10c8c4bfe3ba_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/2bcc7de24074ca97717d10c8c4bfe3ba_img.jpg deleted file mode 100644 index 572128a072b53f8ea3407e78f5dabd47f4c586e2..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/2bcc7de24074ca97717d10c8c4bfe3ba_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:95b2e16d222debb10d1db0b8c879548a4c4e6df37ce2fdf1163d2f22c0648155 -size 63259 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/2e3b1ae09da2cba02f0bb8a531f1515e_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/2e3b1ae09da2cba02f0bb8a531f1515e_img.jpg deleted file mode 100644 index 7691ddfc573bb0b74c9e6039925335f347ea2028..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/2e3b1ae09da2cba02f0bb8a531f1515e_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:a2a079dabde713a74125646602ece3c4d47b21e14b31a6cba23ba33b26132ccd -size 31777 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/2fa686ed8033ac35efddee0c7be47d59_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/2fa686ed8033ac35efddee0c7be47d59_img.jpg deleted file mode 100644 index 453787c96f1c12c2fe0a6d836f0a420c6722385e..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/2fa686ed8033ac35efddee0c7be47d59_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:ff97b2e60d124c16f64af838942eceb92675ff2e784213a41f1f1c1f2872f72f -size 43506 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/2ffdb0621c4918479cd1ac7a531b1b92_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/2ffdb0621c4918479cd1ac7a531b1b92_img.jpg deleted file mode 100644 index 8349f98f80b3c3c8f383b3d2a0c8da74f5e2c39e..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/2ffdb0621c4918479cd1ac7a531b1b92_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:ba912864c479d3fb6ff5d9bea3de5528dd97959d659f67df79d783fed6c466f0 -size 20961 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/30b76717cca15621840d1c16fff50f89_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/30b76717cca15621840d1c16fff50f89_img.jpg deleted file mode 100644 index 74561f6ee64d351a7dbcbf58978ba6c6a3eee5d2..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/30b76717cca15621840d1c16fff50f89_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:c0c778d3f3c3f84aa63c62383820b6b5a7bb8e4d0d895ff580afc6dd450f73ea -size 17553 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/32ce3ed5531f18aba05215c8f474bf49_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/32ce3ed5531f18aba05215c8f474bf49_img.jpg deleted file mode 100644 index 8fc3460033684da1502cc7374c85153254f9ce47..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/32ce3ed5531f18aba05215c8f474bf49_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:6145a0d5fffee5890a97f796ce3dd320f7f5ccd93fdbdf0778f2cf98eccb25d0 -size 164574 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/32fef1546b300cd971dacf02ca1d21d7_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/32fef1546b300cd971dacf02ca1d21d7_img.jpg deleted file mode 100644 index a0e3dfec7a1eb45bf3b7820d1c2706f052364d17..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/32fef1546b300cd971dacf02ca1d21d7_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:d572f9c3551fc235fc6a17979c04d9fe882318c4bf00935599e780acb4bf6d37 -size 13766 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/33859177822cce0c1b03fd3d37de14f6_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/33859177822cce0c1b03fd3d37de14f6_img.jpg deleted file mode 100644 index 36fdc772f2a4a32a15d066eb11d72641122daa47..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/33859177822cce0c1b03fd3d37de14f6_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:b41e283cb14548e448f4276b987786c72c977a514cf6cde8c9833fc6643799a9 -size 63869 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/3440b6ff4ee9fed9b432fee67868ae8e_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/3440b6ff4ee9fed9b432fee67868ae8e_img.jpg deleted file mode 100644 index 002e76f847927b392a3ccd9e111be26f88f5160a..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/3440b6ff4ee9fed9b432fee67868ae8e_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:fb0887929a98eaf8b511c72270cf7f13ee6135d648c633dd336992042c4bfd74 -size 23193 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/34921caa1996eef32dd520e93a1e64b8_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/34921caa1996eef32dd520e93a1e64b8_img.jpg deleted file mode 100644 index 5aa144ccb38d101ed3fc7dc055aa42b89ed1939c..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/34921caa1996eef32dd520e93a1e64b8_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:e8534f5e464859a0d5a4d062ebeada151e286cebc544ae7c8e038704cf1f6dac -size 60368 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/34f46103a0c07981b0b51490ea639e25_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/34f46103a0c07981b0b51490ea639e25_img.jpg deleted file mode 100644 index 5121c785111376b7dad2b340ba92db1f7aabb451..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/34f46103a0c07981b0b51490ea639e25_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:fcf948762430f7fc009ec963790919151cc2004773827734ae725ea661f3fb59 -size 9797 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/34f4f0a61ba9563367acac205416e28c_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/34f4f0a61ba9563367acac205416e28c_img.jpg deleted file mode 100644 index 5e249afd2dfe6d2594747d4fb4b11b3e545aaebf..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/34f4f0a61ba9563367acac205416e28c_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:82d658183e8b92215ff954f02c1ce29792ad5c638b11a7c6cf2c6cef6bc3a512 -size 13720 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/352d21d1e740e4a58cb17ab8656cfad8_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/352d21d1e740e4a58cb17ab8656cfad8_img.jpg deleted file mode 100644 index 3869199f85c772f43b9ca4a6b1371137e3455375..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/352d21d1e740e4a58cb17ab8656cfad8_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:9b81ff969dfe12e32b8ee8a92d49f020f37bc0604a99ebb1a48f64046ce0e7ff -size 110031 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/36a1eab8868d8db81c6b28fbd0d5730f_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/36a1eab8868d8db81c6b28fbd0d5730f_img.jpg deleted file mode 100644 index 69a7c377691bd4f0c8102d0c6c3b250964a8e582..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/36a1eab8868d8db81c6b28fbd0d5730f_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:e0f0930e1eba03b065541be9ae56140f36049387ae85546ea15ec45cfa79650e -size 113631 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/381b701baf194171a242aa2b1741f4a9_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/381b701baf194171a242aa2b1741f4a9_img.jpg deleted file mode 100644 index a2c3ca8823498e84e557d479ba4ae8f6f4ac098c..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/381b701baf194171a242aa2b1741f4a9_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:0ae61eeeb386fb1c22180873145d2ce8736946dd13bc5a3821199f6e78086db2 -size 77837 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/385c524299e3256900f891bc068d62b6_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/385c524299e3256900f891bc068d62b6_img.jpg deleted file mode 100644 index 92467d03f7ed6a5cc7987f0237922228d0db7784..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/385c524299e3256900f891bc068d62b6_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:a5afb2f192df5b52cb3c50a056c112f6343920c3f13632fa4b5622eb60e80557 -size 92428 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/38cbce07f83fba6d5a7c46605bd5743f_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/38cbce07f83fba6d5a7c46605bd5743f_img.jpg deleted file mode 100644 index 2f942c90f19f51b69e93ad71436bd89b3fcefb90..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/38cbce07f83fba6d5a7c46605bd5743f_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:939d43162fc4d84d385267d2a46d01edc9712dab46e0d129da66d2881a21fbc0 -size 67576 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/39729be7ec83c3de8e480061966e4505_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/39729be7ec83c3de8e480061966e4505_img.jpg deleted file mode 100644 index 82408549de65f7ae686348e286de6b4bceab90d9..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/39729be7ec83c3de8e480061966e4505_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:e00247bd2ff29678e174b416028ef05df845abc4c95bc2df485640b353169119 -size 66635 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/3b1646c728aab109f7312ecb46537a4a_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/3b1646c728aab109f7312ecb46537a4a_img.jpg deleted file mode 100644 index eec3ac139e9de03b2ecfe7f6fe7bb46d59759deb..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/3b1646c728aab109f7312ecb46537a4a_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:fe6fe375aa51d742918ef40c0180d70ce15bb2240e630146830f97c70c62d140 -size 25972 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/3b330f29256259f2a9854f1c371ed269_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/3b330f29256259f2a9854f1c371ed269_img.jpg deleted file mode 100644 index f8c6ea486fb37b4be185bc4dbb44c29828f9eb71..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/3b330f29256259f2a9854f1c371ed269_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:587f121cfd78ece31060cf5bd536ec2b279b9545b02f63ec954b8c531ac959cb -size 14273 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/3bf1696c3034743b5ab07a0b5e398347_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/3bf1696c3034743b5ab07a0b5e398347_img.jpg deleted file mode 100644 index db4b1224fc4837163f27498688b6aeb382be97f0..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/3bf1696c3034743b5ab07a0b5e398347_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:2c067eeb7e079da97ec17d611fe04ee596940a00f4411e2a868a2eda1fa7018b -size 74272 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/3c721884a92b102becb43b52f6110e47_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/3c721884a92b102becb43b52f6110e47_img.jpg deleted file mode 100644 index 946ca891f11af2d8e344362c5fa6dd3fc9a2140b..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/3c721884a92b102becb43b52f6110e47_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:21818165dada82588e1bf5f29382bad70dde3c35a5ac4b0553598a24d78ffe1a -size 69679 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/3ce6b213ec556257e32ff7451182369d_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/3ce6b213ec556257e32ff7451182369d_img.jpg deleted file mode 100644 index 9d20d31b650ab407c107392c9aae62af0db50de6..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/3ce6b213ec556257e32ff7451182369d_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:4860203e3dc920f64a4157b079cfaedc98a10225daad4cc88f44315a28dac96c -size 89338 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/3d1817e8551f9c226a5f561108d3b3f9_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/3d1817e8551f9c226a5f561108d3b3f9_img.jpg deleted file mode 100644 index 59d27f22c63c162e53c9d90630ee130908aa553b..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/3d1817e8551f9c226a5f561108d3b3f9_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:b66ef0da7b5682c0c8031802065fd479df192525ff3d1da8b52853e42260dacc -size 39788 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/3d590ad29ecfe728f07432e6fcb59064_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/3d590ad29ecfe728f07432e6fcb59064_img.jpg deleted file mode 100644 index d5885cbe3736503516a72649751d615b966350ac..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/3d590ad29ecfe728f07432e6fcb59064_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:db6ea48a89d12bc61e6cacfbebb00f8dfeecdbba15246f43df037ade3b44ee5c -size 24173 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/40043f81129f46859efbb0379984a286_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/40043f81129f46859efbb0379984a286_img.jpg deleted file mode 100644 index 8b9b622cb877fa0013b0454a5acc5c193053253e..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/40043f81129f46859efbb0379984a286_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:5181899e58534f05bda7b207888c6ad62c78519e5b4f7c680f498fe9867e3688 -size 42583 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/40b685b3ae31d84f5f9edf37cbb945bb_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/40b685b3ae31d84f5f9edf37cbb945bb_img.jpg deleted file mode 100644 index a19e3fe6c2311212f3ea052205c30df60c5f2a85..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/40b685b3ae31d84f5f9edf37cbb945bb_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:8bdc345091d87c1a3799acff176ef54b5d5fb1e79a6f902e8653ce2e63107e17 -size 102947 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/40c6fe38cf97a637027a6a1806b5546a_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/40c6fe38cf97a637027a6a1806b5546a_img.jpg deleted file mode 100644 index 2c95704b28d9d266126b21f43fe975d3a734d729..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/40c6fe38cf97a637027a6a1806b5546a_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:d530e7a9065dc38f4210b5feb7005d11c92ba7d3be4073d71d66d39beef06a98 -size 12812 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/40d0aaaa3afa0a9fabe637941ca250bb_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/40d0aaaa3afa0a9fabe637941ca250bb_img.jpg deleted file mode 100644 index a81fa8630d5932ac71c1913f3185f874827bec45..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/40d0aaaa3afa0a9fabe637941ca250bb_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:2eee1d161a3c5822a4891a5a17a384ed5e6e5d1104768d6358912aef38f3c008 -size 82538 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/40e222d90fe6d142ea9c2c893d7de5df_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/40e222d90fe6d142ea9c2c893d7de5df_img.jpg deleted file mode 100644 index 84358f69cbedf06957fb39057376a459d535d873..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/40e222d90fe6d142ea9c2c893d7de5df_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:ac7031b0ed9ab0926a68f915ac9e3d642c26daeee72fb236c0b6a1f2f0e955ea -size 17438 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/4162c218fc7881cd90fc9574e07d2327_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/4162c218fc7881cd90fc9574e07d2327_img.jpg deleted file mode 100644 index 2ad5ddd376b55f45e68e52cd4d7b7dd19965fe5a..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/4162c218fc7881cd90fc9574e07d2327_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:1f004aa2f144417f7c534fc7025a74b037dcd6aafcadc6dcbe606b39ad807eb4 -size 119356 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/426116a38cef1a4b575e63bcd65c676d_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/426116a38cef1a4b575e63bcd65c676d_img.jpg deleted file mode 100644 index 597be363ef4742c823c46dbcf0fabbe4455d3208..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/426116a38cef1a4b575e63bcd65c676d_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:5e12838ab3a8db703f2beda8bb26e407b514be762726619db6a45d2f770b8cd4 -size 10211 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/43100f35a10f651fb3685f9eb7abdf9d_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/43100f35a10f651fb3685f9eb7abdf9d_img.jpg deleted file mode 100644 index ef431547cb7bb985921af72f3d548f0f0b08d656..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/43100f35a10f651fb3685f9eb7abdf9d_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:f61238cd0bcbad8dfb7ef9ff7b44702a67b900eb3e29da0eaecfff907c94eedb -size 9698 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/43aeecf3cbc60c4418d560d8a4512ebb_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/43aeecf3cbc60c4418d560d8a4512ebb_img.jpg deleted file mode 100644 index 8566a2aae53b68b4945d197b6b50d3374f5823a9..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/43aeecf3cbc60c4418d560d8a4512ebb_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:11e7b6c2099e74dec3ba1d2941fc2ad1bd5e6428e2bbc2cdbd0e4535c9ded5b1 -size 93274 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/43b05bd1b6ee31fba18d3eb683903504_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/43b05bd1b6ee31fba18d3eb683903504_img.jpg deleted file mode 100644 index 555d8e910f0ea720dcd863274b0176bcf0e598aa..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/43b05bd1b6ee31fba18d3eb683903504_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:757cdd0df89b3e5a200c9e07792b56038bf66ed4a62588b030e4bdfde5c1e6df -size 17379 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/43ff52fe5a7c6990f4f0d5e0ca55d4b4_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/43ff52fe5a7c6990f4f0d5e0ca55d4b4_img.jpg deleted file mode 100644 index cc14fd6f4c1a04b5f4dbf38b4d0c760707da85d0..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/43ff52fe5a7c6990f4f0d5e0ca55d4b4_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:b20cdc53a705ba8e4737ba76b573c3134fdb2cd9c10ccb39f1071b37b796a9ee -size 19713 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/45b71f54324c8fd8c2830610b367dced_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/45b71f54324c8fd8c2830610b367dced_img.jpg deleted file mode 100644 index e0b1d39d28166c7ca21b5689e2dd7b381f30a3e1..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/45b71f54324c8fd8c2830610b367dced_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:a002944552b2834a1426e90e5b89a941c0f865898c254b1242e5b579e8c62d4d -size 14110 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/47aaa88afec21e26eb33420078f4936a_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/47aaa88afec21e26eb33420078f4936a_img.jpg deleted file mode 100644 index 4f82f82ac6d324bf446924501c2e5d2cff9d0fa0..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/47aaa88afec21e26eb33420078f4936a_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:5559b743c6a24ddb4253d2f54f2094ec9c043b76100d1f053e23546ee2cae85f -size 109277 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/48090d8f1db2e826aaa740035aa12ecb_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/48090d8f1db2e826aaa740035aa12ecb_img.jpg deleted file mode 100644 index 77750ede5cec914ba9b056e67973a8213ffc631a..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/48090d8f1db2e826aaa740035aa12ecb_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:2ed3544c5e8316757b6bdcc0b5e65d14f6a539fbeed8bd45b24d18cfa485ee00 -size 67788 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/4834b6d862f59622ea6314c723c7572f_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/4834b6d862f59622ea6314c723c7572f_img.jpg deleted file mode 100644 index f43c79aa6ea2db0d1cdf9c6cdcf0fccfd761fd7f..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/4834b6d862f59622ea6314c723c7572f_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:e558b2b744409af7af77ccb7d9f636a4387e0d263483437399bcb086fb8d2531 -size 41381 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/48b17e34bf39cb8a801a634c791250c0_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/48b17e34bf39cb8a801a634c791250c0_img.jpg deleted file mode 100644 index 0b1aa64ba678392f85385dc83685fdd1470aff0e..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/48b17e34bf39cb8a801a634c791250c0_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:54d87b5b5a08455fd84198293e69078cbc2d002495d8a97926e62241832d731f -size 39055 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/48fecf94dd9fb955caddbf2fb01b7b9b_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/48fecf94dd9fb955caddbf2fb01b7b9b_img.jpg deleted file mode 100644 index bf575afa363deb45c8c1304ede27cffe853daf9e..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/48fecf94dd9fb955caddbf2fb01b7b9b_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:8a94acdc30c75af86e39bd33316c1f7d2e2f2eb1736e5c0a093d34764e830a55 -size 11209 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/491e41fb7612d41cb9c24448ce144eda_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/491e41fb7612d41cb9c24448ce144eda_img.jpg deleted file mode 100644 index e6a05d03ace0dc9f0bb135a422c647930f4ac4a6..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/491e41fb7612d41cb9c24448ce144eda_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:9e3ede966e5898eed59831a15da4c486c70ea15035cffa480528fb684b50467c -size 16696 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/49fe8fe978c0f7e73112d231feb377eb_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/49fe8fe978c0f7e73112d231feb377eb_img.jpg deleted file mode 100644 index 9d13eddae96b5a1480cbf1ecc56e923830c8b35a..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/49fe8fe978c0f7e73112d231feb377eb_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:7e1bceb38ec2678de8fe8b3b3d59216181fcc120a946266d8f70b516faee17c7 -size 7973 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/4a390493f601ce1ac6b9201db4e28b5a_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/4a390493f601ce1ac6b9201db4e28b5a_img.jpg deleted file mode 100644 index 1d0f41544d9d319d80ad8e99f8e311ce5b67e586..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/4a390493f601ce1ac6b9201db4e28b5a_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:2cc1fce1fa353f58f2113b0f927f9f184acfb2481a2ef55d3f6506404885abcf -size 11471 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/4a5c1280cac5c4924f49158846cde66c_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/4a5c1280cac5c4924f49158846cde66c_img.jpg deleted file mode 100644 index 645d2e56e4c95c44f13aa651c5e735ec8cb9b9f3..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/4a5c1280cac5c4924f49158846cde66c_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:ab419a4cc7a33c549c361f02d38a1fdbaf77a3e8f2cb65c898050be1cfbf281a -size 15836 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/4a5c6fefcac9340ea7f9df373873cae9_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/4a5c6fefcac9340ea7f9df373873cae9_img.jpg deleted file mode 100644 index 4032630732e3f6b72ef45ef78f3f6299f0e0d4e6..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/4a5c6fefcac9340ea7f9df373873cae9_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:e4244955cac10ad72f986a5bab574f1e4650143fdef52364ed3f6b2e0420015a -size 84830 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/4afdd54473731079bf51f7d1acf72187_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/4afdd54473731079bf51f7d1acf72187_img.jpg deleted file mode 100644 index 58fa84a37b0ccef3d5e8a77ab6eadbee8674158e..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/4afdd54473731079bf51f7d1acf72187_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:af8f59534d4d6894cb06ad15ae5e5c5babb5e02d5e682fa490e8edbe412a6be7 -size 12827 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/4b4b9c9c016880edb872f25cefc85eb1_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/4b4b9c9c016880edb872f25cefc85eb1_img.jpg deleted file mode 100644 index 0e26e2def8be30e0e7aebaca7612693ee3e6267e..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/4b4b9c9c016880edb872f25cefc85eb1_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:37ee1120b6cf722f667e607850c5d120440c7a66209e91d87dad044155cd2ba0 -size 13129 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/4b9e2f848d66a0b3c2d4553b965933c7_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/4b9e2f848d66a0b3c2d4553b965933c7_img.jpg deleted file mode 100644 index e7396ee22abb461914f80d83a788b7596a58cb38..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/4b9e2f848d66a0b3c2d4553b965933c7_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:3ef05a4bf49923442278e521dc670488c8b80e50c5723df21d88bea053b7c932 -size 66782 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/4c1ea859b93043f2fa17a8fe72fb6176_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/4c1ea859b93043f2fa17a8fe72fb6176_img.jpg deleted file mode 100644 index 778d36d8a0d28f7962192a4fb19b1d5721a50a8e..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/4c1ea859b93043f2fa17a8fe72fb6176_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:d855e731d9951285cb5503ead894772871138cf6f535021cc5dbefc8a74466e9 -size 47497 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/4c63a0e17b54c7e61d512c276932114c_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/4c63a0e17b54c7e61d512c276932114c_img.jpg deleted file mode 100644 index 9fa95d74793d440c1f0ee3438b72002d006350a7..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/4c63a0e17b54c7e61d512c276932114c_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:cba41f0f4f908d36860f052ca563d312d2cee6822adabfa2ce12603f24923b29 -size 61370 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/4d9c52be1198628362ec7871f6e0f530_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/4d9c52be1198628362ec7871f6e0f530_img.jpg deleted file mode 100644 index 6294ca84ac75117a1de72118846195aa2eb4384d..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/4d9c52be1198628362ec7871f6e0f530_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:51811f60ac0b2a68e0351362e57d68a9761d6f6eb17f90aca74ddb674748a1f5 -size 87934 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/4df70569f4cc27db5625fc75bdff68cf_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/4df70569f4cc27db5625fc75bdff68cf_img.jpg deleted file mode 100644 index 9e09a70752c3a7d9fca77d78f07b44518afe5af1..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/4df70569f4cc27db5625fc75bdff68cf_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:d47ef5885b8ccff8946796edda60880ed5d3cf7e289b72094cfbda0c3dc21b0b -size 21274 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/4e09aad97504825adf16d63ace42b461_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/4e09aad97504825adf16d63ace42b461_img.jpg deleted file mode 100644 index 6378c54bf66e980fc412a5ce493719fd6b603b5f..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/4e09aad97504825adf16d63ace42b461_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:d9edf09debe3e96b7bd3135aa08b481997a8adee678362ee723ebc387ba836c1 -size 81072 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/4e716e2091c1c947b7a687ed4e6dae2f_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/4e716e2091c1c947b7a687ed4e6dae2f_img.jpg deleted file mode 100644 index 517f7cf61dddb06f462cb78fbda42aee09b3b642..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/4e716e2091c1c947b7a687ed4e6dae2f_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:d4fe98ee338f282b862f9846987d7b85add80b35c2b69deda285990c2f97ce7b -size 32994 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/4eab0234f29827bae0c6e71fe650aa63_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/4eab0234f29827bae0c6e71fe650aa63_img.jpg deleted file mode 100644 index cb61c4e99485cc67053b23007b98950a4d89a9df..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/4eab0234f29827bae0c6e71fe650aa63_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:121098895c02fb0539e6ce7adebfbe6ad0b61a4cf461da414da1836418ae4c05 -size 30114 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/4eda1b9e9c4f581b9747ffacabeae936_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/4eda1b9e9c4f581b9747ffacabeae936_img.jpg deleted file mode 100644 index 1a200be65fd723375ad076e3da03a72031726da3..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/4eda1b9e9c4f581b9747ffacabeae936_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:5cadc6638d20bd71e7038adb445f19a45cd5ea276c3283699e98c57e181799ab -size 135191 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/4ef412e08808c40e0beb7808d36b9379_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/4ef412e08808c40e0beb7808d36b9379_img.jpg deleted file mode 100644 index a803ca3a02f7b71461d7f2daffbe8624ec83176b..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/4ef412e08808c40e0beb7808d36b9379_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:3d1a666acf0f79f9d5cf3f1d0eb1e405043673835c34e2f9adde95f4abaeefb7 -size 21472 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/5083128e335a383c042e15d2d8795c95_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/5083128e335a383c042e15d2d8795c95_img.jpg deleted file mode 100644 index 1f16232d051524ed0a7d7db69b6287c4c1cdb047..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/5083128e335a383c042e15d2d8795c95_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:ed676e52e981a097cd0fcefe16542c1759531e9df9803030a913ac88235cfb32 -size 45305 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/50d5b503f4b41d7a601c1340dfd6aa74_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/50d5b503f4b41d7a601c1340dfd6aa74_img.jpg deleted file mode 100644 index 2455a21342628788df68c898c1f8b4dcccb2d77b..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/50d5b503f4b41d7a601c1340dfd6aa74_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:85d761dd4bef5a63411272008c7c7f914df0ae5b07b34128631893681f14e6ae -size 22090 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/50f72073c616cb3d3ca3af04a0c3a221_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/50f72073c616cb3d3ca3af04a0c3a221_img.jpg deleted file mode 100644 index 93cc6b47b19187e767a7b950ed34fa2ff763d00a..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/50f72073c616cb3d3ca3af04a0c3a221_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:efd8d1174ecd424b5aee563c115ca6393ab55ba2d53d1ee02df5a338d347b3ba -size 25777 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/51b3f989269d40b52bbf69c7a448bf52_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/51b3f989269d40b52bbf69c7a448bf52_img.jpg deleted file mode 100644 index dd0fc1a6a7a99ddb64dbbb30b497a1f91acb277e..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/51b3f989269d40b52bbf69c7a448bf52_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:2eddf30034f772d2e4dda3fd9d990903ad8e980caa444555ab5bab3a12268de0 -size 210319 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/527fb299e6996504538a9cb5ef733d84_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/527fb299e6996504538a9cb5ef733d84_img.jpg deleted file mode 100644 index ab5cf9021b2942e1b5941e26903588a26a0939c2..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/527fb299e6996504538a9cb5ef733d84_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:d154c5cb3f3a199d7e10d5a6f9caff521ee105b2fd516f9517c90c1446249993 -size 7900 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/52fe5bc3ba967e0e8f56f1a3ab9d9c3e_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/52fe5bc3ba967e0e8f56f1a3ab9d9c3e_img.jpg deleted file mode 100644 index a8c0014a9b49e44aab6152a896904f676e88dabe..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/52fe5bc3ba967e0e8f56f1a3ab9d9c3e_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:bf3d83d8e3613228025c34a6bc8bb614d5727a3c0cd8fb893486055517adf652 -size 88199 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/539dff67945f344becfdd7bebd3b7d69_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/539dff67945f344becfdd7bebd3b7d69_img.jpg deleted file mode 100644 index 2380fd14b2642e774aaf6f81f57cd48e5311bb98..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/539dff67945f344becfdd7bebd3b7d69_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:64911b9433c9f5d25cfe25ccc774e9971f037c704f681959df0f945b0f2b676b -size 79651 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/53c60f255aa58c330efd23c77dfdc762_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/53c60f255aa58c330efd23c77dfdc762_img.jpg deleted file mode 100644 index 8e0fc8b798894398112e0d293ad8017f6bbe667f..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/53c60f255aa58c330efd23c77dfdc762_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:c9c2717b6c284c4722fe05c453d14a288cc4a789b7fddf1cc3d3473b34662790 -size 13997 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/54f73f693f36dcbd300fa21ac4e410e8_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/54f73f693f36dcbd300fa21ac4e410e8_img.jpg deleted file mode 100644 index f5bc3ab096f9548f0eb85f5a35a8129e972f89f3..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/54f73f693f36dcbd300fa21ac4e410e8_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:c7ad611427d4b1af289db212e9644296edc76655159c286e23c727c1c5923aae -size 57323 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/5546020e0c70645fd46b8829e2e3c43b_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/5546020e0c70645fd46b8829e2e3c43b_img.jpg deleted file mode 100644 index f82a5c8d7cc0fabc85c71e0f0cd7882ab705cb55..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/5546020e0c70645fd46b8829e2e3c43b_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:2854caec41823975e0829a2ab7e099d3cf5614316614bed1f85a774bc456aff3 -size 26864 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/55c1c9a102f0828aa242f4e934dbcac5_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/55c1c9a102f0828aa242f4e934dbcac5_img.jpg deleted file mode 100644 index 28c5f98c2186ba04f9e1ecb8f9bee703babab7c3..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/55c1c9a102f0828aa242f4e934dbcac5_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:c065cdd649c3682adf9290d2e5bf5f41362766d669d826204945ba9064774257 -size 30160 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/56587d8256f60b3022273b5d8a90dfa8_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/56587d8256f60b3022273b5d8a90dfa8_img.jpg deleted file mode 100644 index ced25b0ef554892740f3d2a2d542758997f71a8d..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/56587d8256f60b3022273b5d8a90dfa8_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:b306aa54338904b93dd3587bfb048a6100f8a1b011a7d4d21288aec04bed4a3c -size 13146 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/56a00f931e8602f822917af7fa379c0d_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/56a00f931e8602f822917af7fa379c0d_img.jpg deleted file mode 100644 index dc819e486ca9f956ecbe084f5a1a1207152958d9..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/56a00f931e8602f822917af7fa379c0d_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:92c2883eff5df244b408a8ce3e39f86174b30b75a2df505c94d790e351068ece -size 46726 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/5772ffa3b9089a69e25df5ec289ead55_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/5772ffa3b9089a69e25df5ec289ead55_img.jpg deleted file mode 100644 index 77eb7bf49ae127604f7f59584bf99f6489ae7751..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/5772ffa3b9089a69e25df5ec289ead55_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:aae4ce6914009244ee79f09ba6a3aef65e9b63c061aeac8c1e106874e1ff6537 -size 11253 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/5817c9e42aa8e99964a2845d4adee0d0_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/5817c9e42aa8e99964a2845d4adee0d0_img.jpg deleted file mode 100644 index 25c96d6521501118fb930fee963d9d5210aaf9fb..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/5817c9e42aa8e99964a2845d4adee0d0_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:24e4594f4ac8c3cfc435eb752ffcfe8f646e279c7bfc2a326ef561a098bdddef -size 10512 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/592c06cc12480f3bcfcbe826668abfa4_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/592c06cc12480f3bcfcbe826668abfa4_img.jpg deleted file mode 100644 index ae7219e06b58046ab4b6cf743caeca077015f05a..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/592c06cc12480f3bcfcbe826668abfa4_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:0d311b3cfa5d6a77ed2011efc6fe7aad93efb6c947dedf7ffa7f6c31277b71dc -size 16464 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/5aa9a1f9f87b2e03c5a516b13ee62612_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/5aa9a1f9f87b2e03c5a516b13ee62612_img.jpg deleted file mode 100644 index 62aba0cd2cea95758214c5fde9a4b6b34d9f57f3..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/5aa9a1f9f87b2e03c5a516b13ee62612_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:fbffffb400f0c47a134c70261b62d1988f9992d81aa4cc41ce344691aae414ad -size 26934 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/5b6e139e89c6ce90107ea7d7d77620a0_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/5b6e139e89c6ce90107ea7d7d77620a0_img.jpg deleted file mode 100644 index 96e13328cfca669f9399c39a468c6d4d70950fe4..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/5b6e139e89c6ce90107ea7d7d77620a0_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:ecc8c4ee94a0420dfc3c38492f556ad52ca2f59315dc8371fd1f85eb004a0431 -size 27878 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/5b9a924d48ea39458bd16a3c89a576d5_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/5b9a924d48ea39458bd16a3c89a576d5_img.jpg deleted file mode 100644 index 872daa4ec0bcbcdff3ede5e90cd6dff21201d7ac..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/5b9a924d48ea39458bd16a3c89a576d5_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:fba0dce218892b39a8d75433350bd3879209468c918d7e2f33955d3f254f1e84 -size 9789 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/5bab55ee2db5fd011c7dc277224026d7_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/5bab55ee2db5fd011c7dc277224026d7_img.jpg deleted file mode 100644 index 28096cc4351b4afc028eda8b8385d81f1a695ce1..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/5bab55ee2db5fd011c7dc277224026d7_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:c83543840e0f1f7f4b5d9e493cc195a9b167695913f02f7e1670a8a901382254 -size 128391 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/5cb3b242ac7ea1fa7007ebd51b80e5b9_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/5cb3b242ac7ea1fa7007ebd51b80e5b9_img.jpg deleted file mode 100644 index bc777910a4d08261a75b0fc7d1152ceee6902872..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/5cb3b242ac7ea1fa7007ebd51b80e5b9_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:f30e2b7b431384cd75d612998f169267add0aadc7ebde6cb5a2af5b754988f42 -size 7642 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/5cc9a312ebe733ae244e3b93cfea67e1_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/5cc9a312ebe733ae244e3b93cfea67e1_img.jpg deleted file mode 100644 index 4e90c0f25a5ddd88924f0202ca4dad1a93344ae7..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/5cc9a312ebe733ae244e3b93cfea67e1_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:f23aa00d2628268813ed185d68665efbcb4f269ae88aa36a702c98250b79d6e3 -size 65443 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/5d70cb9af3e025f57d437dc84524e9a4_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/5d70cb9af3e025f57d437dc84524e9a4_img.jpg deleted file mode 100644 index 49dbe2e825ab3edc18702668a49a036da3a1f279..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/5d70cb9af3e025f57d437dc84524e9a4_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:f5ef822fddc65de5a0fa178007b32e7759e89fc97e1194fe85e8d63296e62a15 -size 136035 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/5e90ca04dc493a9f9aabbdbb720d39d6_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/5e90ca04dc493a9f9aabbdbb720d39d6_img.jpg deleted file mode 100644 index 60861a430d36f9f3c99b2e2eee40085972d5a373..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/5e90ca04dc493a9f9aabbdbb720d39d6_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:02fb25b3aeceefc7b22410b34f8b5ce1297607fe91acda337ecc1476a670ab24 -size 57592 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/5ee80a63ec53c60d7306b5a44984afcf_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/5ee80a63ec53c60d7306b5a44984afcf_img.jpg deleted file mode 100644 index 31818388be585a17d753db623b7bcdf43b72581d..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/5ee80a63ec53c60d7306b5a44984afcf_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:5e06582e5535c4addeffe90ea27d7a8ff2d51551961ba2bf6f6c146a9c3de943 -size 68329 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/5f1f8e1973a0dd08d313a5aab38502ad_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/5f1f8e1973a0dd08d313a5aab38502ad_img.jpg deleted file mode 100644 index 2a6f4aeb53466a0537cef11992b05554077eb426..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/5f1f8e1973a0dd08d313a5aab38502ad_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:1e6e17ecd81c2c43db51dc7ec8cf58c3689dafae590bdd0f6f8d593f2bfb7a6e -size 11203 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/600c8f9d34f98c395e29c266aebfbd8e_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/600c8f9d34f98c395e29c266aebfbd8e_img.jpg deleted file mode 100644 index 6e939946fdc958f44a4ef2f712cbc513d090e8d4..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/600c8f9d34f98c395e29c266aebfbd8e_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:88530eb8a11d283c40e24d212df0da0842b9bdade8bd388d144a57cd87f001df -size 139008 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/601a4295d83c115fcd66101f49de0c4e_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/601a4295d83c115fcd66101f49de0c4e_img.jpg deleted file mode 100644 index 19ab081168a3a116b9fa4d4a49ec3d166173eb9c..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/601a4295d83c115fcd66101f49de0c4e_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:88e657fffc528702b0228ae5baac9fd649ca444d86947589a1a05965e9690107 -size 178928 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/60590b20ec9994e388840f5fc4572e39_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/60590b20ec9994e388840f5fc4572e39_img.jpg deleted file mode 100644 index 8aedf424b38b3fdfec325656ba3c39e0bd164a88..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/60590b20ec9994e388840f5fc4572e39_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:c0196590a4940d7bd71f59a539fc7c1bac28383ff59d9ec9e4c1763ab30b7a7b -size 10725 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/61474739fd197587cfea52af9b6a3885_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/61474739fd197587cfea52af9b6a3885_img.jpg deleted file mode 100644 index 3b25e6289101a7375ad30b90658b990c448a6334..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/61474739fd197587cfea52af9b6a3885_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:14c1889c9335321ec473b4278b7490e5c3f736306d41c8629927694d812a15d5 -size 83605 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/61b2e15aedbb8a8dffc5426c0a284eb1_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/61b2e15aedbb8a8dffc5426c0a284eb1_img.jpg deleted file mode 100644 index 749a918bc0729155199ae7f6dd9271103410c383..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/61b2e15aedbb8a8dffc5426c0a284eb1_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:4d672516ee49a07e70883a325f52e5754fe6b1296c9d5657c172528702cc14b5 -size 42883 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/625663deae3d429f79ae6d2781986e2c_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/625663deae3d429f79ae6d2781986e2c_img.jpg deleted file mode 100644 index 9b9b584e997f50ac1ff8652590954df667bca730..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/625663deae3d429f79ae6d2781986e2c_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:3053bbbee795fc1d308df2fc4ddff048f136d686a7e26c80b95fe6f33e47efec -size 16970 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/6347ebb7bc58aba4272fc340a410bd97_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/6347ebb7bc58aba4272fc340a410bd97_img.jpg deleted file mode 100644 index 2671f4a1c1bfe630d5cfaf3f237c2e297f2d41c6..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/6347ebb7bc58aba4272fc340a410bd97_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:06199c2b4439e2a7dea67859eacc972e6ee502fb110b4398e13e68eadcd5e194 -size 36359 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/637fa2ec2e8639bc53dea306e19b7c05_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/637fa2ec2e8639bc53dea306e19b7c05_img.jpg deleted file mode 100644 index 50f85914f2c9ee531b768da90b6ec380aad45b47..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/637fa2ec2e8639bc53dea306e19b7c05_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:64f9ae57d507dc6cd89fbb658e8978392a95f27def91a25c100bc22101cf7dc8 -size 86015 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/640d28a694bbdbaf9b11a3bfdcc800fc_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/640d28a694bbdbaf9b11a3bfdcc800fc_img.jpg deleted file mode 100644 index 5a13e4e2242808c45f6ef21dd892d757d07e413f..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/640d28a694bbdbaf9b11a3bfdcc800fc_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:724f590b64dc1d09ded1b660b8c7a1d697720a5fdc376c4440f69daf22f0378e -size 34865 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/64323b705244afc70bf77babdacb6ce5_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/64323b705244afc70bf77babdacb6ce5_img.jpg deleted file mode 100644 index 116938b287afa2ad89bc745c2002a5ca5ce82b81..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/64323b705244afc70bf77babdacb6ce5_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:e792bba8c0bdccdf7ed6ed0e319d2a5dce6810eeafae57ff249e91aefd853ff6 -size 7589 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/649f424fd35ea31f622163506a6148ed_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/649f424fd35ea31f622163506a6148ed_img.jpg deleted file mode 100644 index 11a417ba931f476f3b909688fc9067f7dd56c426..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/649f424fd35ea31f622163506a6148ed_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:2059dac4010a35713bfeb9783894e297d8bee4a71dfde17506119b5225654749 -size 19457 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/64b6966c073f3c3789a8070dbd6106c5_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/64b6966c073f3c3789a8070dbd6106c5_img.jpg deleted file mode 100644 index a467a0a63a45bba08bc83cf97e0e37efa43285f0..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/64b6966c073f3c3789a8070dbd6106c5_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:76bfee97385a29d5acc5f95559b9c65f5be507995025191c974c747eb0b8cb5d -size 149970 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/65e8c0628536d6d4245e9ab46ba070c3_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/65e8c0628536d6d4245e9ab46ba070c3_img.jpg deleted file mode 100644 index 2824bdc4090881c5bab621216f0a75f778910a1d..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/65e8c0628536d6d4245e9ab46ba070c3_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:ea5ed49f742ac8efe74e301e5829a7204374e3eef89d4b64e18c1fbd633f7762 -size 12576 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/66bf96eec8f739d5e7c9957a178e34e2_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/66bf96eec8f739d5e7c9957a178e34e2_img.jpg deleted file mode 100644 index 0018d5b1ebc534e5890e9144f62c718e1e6b6f4e..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/66bf96eec8f739d5e7c9957a178e34e2_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:f813d1d61efc063bb6765623a7b5d297a1399b0b0d2ddce15956e67e46571ebb -size 58347 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/66decd3c38c5f918f528096090219e15_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/66decd3c38c5f918f528096090219e15_img.jpg deleted file mode 100644 index aaff979045addd5fdd99f47b78927cb0d51f135e..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/66decd3c38c5f918f528096090219e15_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:b2d117bf0b85b06bd265a6722e652cce5b12c7416dda53af7b221930e2cff618 -size 9149 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/675b316a907e66765fd392b545e60854_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/675b316a907e66765fd392b545e60854_img.jpg deleted file mode 100644 index bcb9a4663dc78646a32d9f2b9fc93b1c77092064..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/675b316a907e66765fd392b545e60854_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:340587d195f76cb92e741c2123b641a09b8f06cf8e86a7e1534738ea5ebd7a8e -size 11698 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/6762c05f927b2b9c2404c465ef0a8d01_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/6762c05f927b2b9c2404c465ef0a8d01_img.jpg deleted file mode 100644 index d1f730ff97adf87ba5effe3df8b196151f3ff762..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/6762c05f927b2b9c2404c465ef0a8d01_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:ea3eb74289397b2483e085681d66ffc36b0ca6e72965d38a5cf07dd341718b53 -size 30669 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/67cbb5a621a69ab58534bb3376bbb724_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/67cbb5a621a69ab58534bb3376bbb724_img.jpg deleted file mode 100644 index b3621e04fd6f1244e4483ad716b88e513fc1e8fc..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/67cbb5a621a69ab58534bb3376bbb724_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:9bcdf042f5a8cdaf3846bd3d5339dde7e30b417cf1606124ab1b56ad73a31670 -size 9720 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/69161330e28765ad34d95262a79d7b7d_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/69161330e28765ad34d95262a79d7b7d_img.jpg deleted file mode 100644 index cdf6f6ba961c66be9af01a1302bd7661be40d82c..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/69161330e28765ad34d95262a79d7b7d_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:2ee9743d423e6ba9484c4f0046b21d3c2f93d649c020fb30ef3fdf3c47b95f8f -size 11965 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/6d7989325053731fda7ae4de0e946b24_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/6d7989325053731fda7ae4de0e946b24_img.jpg deleted file mode 100644 index 616aa2ae1c0a80783a3722b5c6d97ba94fcd775f..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/6d7989325053731fda7ae4de0e946b24_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:0c9e6675d55f9396bed8f2cfac343286eb1af506c8c17f2fb77879e99a62581c -size 34692 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/6f7f18cd6ddcabd5553b75ef3dc97d15_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/6f7f18cd6ddcabd5553b75ef3dc97d15_img.jpg deleted file mode 100644 index b52bd9e981095b018533bc3ea0ddab29f868428c..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/6f7f18cd6ddcabd5553b75ef3dc97d15_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:d4786da0df430b128958e9a9763fb711cfbe6d33f84d4c018f2e9f192b842dab -size 76578 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/708e7ef81dbf726e558047afe57d6ff7_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/708e7ef81dbf726e558047afe57d6ff7_img.jpg deleted file mode 100644 index f582c3f14329c7fa9b0d594005bf2cbea14e5172..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/708e7ef81dbf726e558047afe57d6ff7_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:ffa8cd733c22b088ea573d11624bcc73188e15f7278255c3048c2c01f9b766e8 -size 15204 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/70a8d66363cce832376711b7ede4f94e_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/70a8d66363cce832376711b7ede4f94e_img.jpg deleted file mode 100644 index 5dde454046dae37b3ccfef4c3b18939816b2196b..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/70a8d66363cce832376711b7ede4f94e_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:82515b1d7ad65d7ab375a0821428c3627895c0e5b2987d2b1589defc9c609b4b -size 8117 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/70fd9003b407d059f32275b212482817_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/70fd9003b407d059f32275b212482817_img.jpg deleted file mode 100644 index ab60c8581c5a9f7e561348c62355f12c9fb3a3d1..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/70fd9003b407d059f32275b212482817_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:f03a26ad2e8e8b5bc82ec667c215d9bcebf9d9944b715a3b72998bc809f50ef7 -size 154091 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/719ef0f734259484038b2434e5dc3f24_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/719ef0f734259484038b2434e5dc3f24_img.jpg deleted file mode 100644 index 4dd0f2324cdaf76d9587b80738b047f9c2c1a4d6..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/719ef0f734259484038b2434e5dc3f24_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:9046b0b07a3e22489fa5a6a2e639bd869c6093f8386bcd7380508126481aa2cf -size 26142 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/733da1815169d31c06238e8cd6ae23f2_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/733da1815169d31c06238e8cd6ae23f2_img.jpg deleted file mode 100644 index 9f90086c1e7361de83f43191d0a7821658fd802f..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/733da1815169d31c06238e8cd6ae23f2_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:fb671a48f57c4f42eb3d657810f9f5cabf2bd4e826b6a537b658951df30eef0c -size 87736 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/744acfe8d4e31bcf03f95714c2f6e567_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/744acfe8d4e31bcf03f95714c2f6e567_img.jpg deleted file mode 100644 index dbdaca6fd36e1411c5cc2924987bdcad8a753d0f..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/744acfe8d4e31bcf03f95714c2f6e567_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:c0422e809953eca47ae1cc1127935cf0ed40b5ba7cc5bead3b242d5b1d9d33ea -size 18108 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/7450203d6606590615fbbeaf2f663b36_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/7450203d6606590615fbbeaf2f663b36_img.jpg deleted file mode 100644 index dd14d2ffb4b75c1de61597135e8a7e55bc64cedf..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/7450203d6606590615fbbeaf2f663b36_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:9a992793d216a3b35dd3506f4d219f93e31ca400af534b376ab1c9a1c1178540 -size 13001 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/747516f5861a0ddf31e3851da8e34b95_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/747516f5861a0ddf31e3851da8e34b95_img.jpg deleted file mode 100644 index 24e5da9efa4ba439930f7d6fba9ee218d83286a2..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/747516f5861a0ddf31e3851da8e34b95_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:d634fc4316607451f7e2600480d640923d48bd7f6f86154159eb9cbf9328f58d -size 7109 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/74c3f93d2f82f78de6a3925bb8e15977_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/74c3f93d2f82f78de6a3925bb8e15977_img.jpg deleted file mode 100644 index e04dcb595a58adb6b270d938810a0f9034208686..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/74c3f93d2f82f78de6a3925bb8e15977_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:aa8d40ab81e92148829ba54f64c293dee6af31a5fd5b02d92f292024025643c3 -size 47910 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/773bb1698c96c3aea54d138ddcc7cfd5_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/773bb1698c96c3aea54d138ddcc7cfd5_img.jpg deleted file mode 100644 index e4ff8214a5c31c7439e621bc1865ad062cc8747a..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/773bb1698c96c3aea54d138ddcc7cfd5_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:205d294e450e7d532e622f68e59191df7bdda4d0e32e8868231e4d350448cd66 -size 136363 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/782eaa616e0b199419dde477a878be7d_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/782eaa616e0b199419dde477a878be7d_img.jpg deleted file mode 100644 index afde347564fb3e1346798f95f7c886579e004f39..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/782eaa616e0b199419dde477a878be7d_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:578b5d2a30eaa54338194769b8c21ec979d8c13b1a2c437f66fa7d493d84a71e -size 62722 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/793b6344c79e3e858d29ef190b2c014f_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/793b6344c79e3e858d29ef190b2c014f_img.jpg deleted file mode 100644 index f1fd9ee48e9bc778966b15b739a2309b390fb6b2..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/793b6344c79e3e858d29ef190b2c014f_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:2465ee036774019a25f5fe5b0cc59d593fd7fc78777c40639e436b876f9fa322 -size 174582 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/79e6576a312f8ddac8c706d78fae4bcf_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/79e6576a312f8ddac8c706d78fae4bcf_img.jpg deleted file mode 100644 index ed3d23ece91e6df9c53275dfe94c5280dd77baa5..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/79e6576a312f8ddac8c706d78fae4bcf_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:1c74fac33600cbf2a04ec27d1d73cfbb733641711627b6579740c656faa4eff0 -size 109439 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/7a24dd6d3d2059e1251e5cac12dabbd0_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/7a24dd6d3d2059e1251e5cac12dabbd0_img.jpg deleted file mode 100644 index 23642398b9005f9e7b991edba0223f360de6ec78..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/7a24dd6d3d2059e1251e5cac12dabbd0_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:9a550f576f7a02878fd45624cef19955b0868c330e13be7dfa8e6b638ef39a27 -size 172659 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/7a4168ad9aed51fc9c5f121a863b8dbb_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/7a4168ad9aed51fc9c5f121a863b8dbb_img.jpg deleted file mode 100644 index 5f8e63d1a109febe0c5699b9eb6284d95c536a83..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/7a4168ad9aed51fc9c5f121a863b8dbb_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:b15fa9e1cc48b43452bddfb202c6f4353e6302f5913fd5d0abbcba4613170358 -size 87873 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/7aaba112378eb1ada76b4c7ae2f7ab83_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/7aaba112378eb1ada76b4c7ae2f7ab83_img.jpg deleted file mode 100644 index 58f335a3b23c1e9558be34222d72cc06bf9e256e..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/7aaba112378eb1ada76b4c7ae2f7ab83_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:297f38c1cbb242916261953f1d4538dbe2d1195c299f1401ed594696f12c4883 -size 110239 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/7ac0d7b4763471d7c6dee8a2ce125b6a_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/7ac0d7b4763471d7c6dee8a2ce125b6a_img.jpg deleted file mode 100644 index 56519634e1c8f5507243d5c3e4d9b275a19f4971..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/7ac0d7b4763471d7c6dee8a2ce125b6a_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:b43613978b269a5062f75705c17d73df1ba90d386f3986201e514f5b69cf570f -size 31428 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/7c19fc92dc74a74ec346d46bc39a3946_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/7c19fc92dc74a74ec346d46bc39a3946_img.jpg deleted file mode 100644 index 408d5521f2a25fa08bcc9b2188f832985139afbc..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/7c19fc92dc74a74ec346d46bc39a3946_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:2547fdfda00e19370be43461e0beb5cf6854a05497a0c09e115979b6603e59b3 -size 27587 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/7c1f9e78e0f033d391b687f1652f6e47_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/7c1f9e78e0f033d391b687f1652f6e47_img.jpg deleted file mode 100644 index 764ae611d3c58c39e9dce9bbda0127552118d28b..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/7c1f9e78e0f033d391b687f1652f6e47_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:b8845cac217e33bd4d02bc15a1f9ed21e90b8bf480d1e0992b62ddda5858f87d -size 77597 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/7c414f2c4afc45fae028f3d82cc6dbdf_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/7c414f2c4afc45fae028f3d82cc6dbdf_img.jpg deleted file mode 100644 index c6d168368526a7cbee153b5a4d8750681a8d9a32..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/7c414f2c4afc45fae028f3d82cc6dbdf_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:4f34112948e32af020d145d0449e0ba8a3650f88ea1f11effdc2a982c9385e63 -size 97228 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/7c6fd006fc4d304794392d41fab4ee10_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/7c6fd006fc4d304794392d41fab4ee10_img.jpg deleted file mode 100644 index b21d6591467b24d1d5451d55a7af5d513a30f4ad..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/7c6fd006fc4d304794392d41fab4ee10_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:60e011af643600f958630e1a49161f50722e804bd74bc7bf32376a36b35a3e48 -size 6087 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/7d2489babb3bf789de160fddd90c535b_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/7d2489babb3bf789de160fddd90c535b_img.jpg deleted file mode 100644 index 7bf5c2984011bd79b9f790f86d937770667c1003..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/7d2489babb3bf789de160fddd90c535b_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:9c8b78be665d9a13ea64b9ae2f0a0651632ae6c8416c40a0ced1f88be48b8a6a -size 37588 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/7d78469417c76901ecf6e36600a721cb_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/7d78469417c76901ecf6e36600a721cb_img.jpg deleted file mode 100644 index b803510d9f5dc23cb387d05811c9a26acda7467a..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/7d78469417c76901ecf6e36600a721cb_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:ab2512ca24417ed53a20b78b6e11e67c59eadea1b9a7f206d57e51b4a4325674 -size 25757 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/7e14467740b2570a44379b347a697921_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/7e14467740b2570a44379b347a697921_img.jpg deleted file mode 100644 index 9817673539c6d86e2083701cd1db48fef5569d5a..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/7e14467740b2570a44379b347a697921_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:a98bb55f3a2a89f0b31988c3ca8c42441870f931f3094dcadc49479dd5bfa098 -size 15011 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/7e19e42b9cf476a0c228935fa4d635d5_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/7e19e42b9cf476a0c228935fa4d635d5_img.jpg deleted file mode 100644 index 50837fde1b645f3dac9db1abc5aa8569bf3983e2..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/7e19e42b9cf476a0c228935fa4d635d5_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:bc5ad367257ab15f9e53a16876f736bb7a6d0d378dea954b909836fa024ffa51 -size 24521 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/7e1f88e0cc7be8060240e12252a833d1_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/7e1f88e0cc7be8060240e12252a833d1_img.jpg deleted file mode 100644 index 8829181d178dfc74cfc510dcb839a2e416315f6f..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/7e1f88e0cc7be8060240e12252a833d1_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:c6770dbe332a9477447a6e79bb759676bfaae44a16aafb088a997e07b4f9aa73 -size 57028 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/806faec01366b8a02de54ed0de2b6a83_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/806faec01366b8a02de54ed0de2b6a83_img.jpg deleted file mode 100644 index ec4557cff3232f38670026fb0715b1a2aa1f9417..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/806faec01366b8a02de54ed0de2b6a83_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:6c9fb7af3202370b16fa359840d154857ee4b45aa0e89a9343236882e9ea53c2 -size 17586 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/811d62d08ce934a2a7e5bd877abff7ad_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/811d62d08ce934a2a7e5bd877abff7ad_img.jpg deleted file mode 100644 index fbca24dc48f4253d0a049f128f06d46df334960c..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/811d62d08ce934a2a7e5bd877abff7ad_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:054c84adca6ca265ae77c2c0d4e40020bab605366298df89ebc091e8aaa5c2a5 -size 15909 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/8181865f1fd5e629dbe12ed89d22dc83_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/8181865f1fd5e629dbe12ed89d22dc83_img.jpg deleted file mode 100644 index 35236a9199b9a8691189453612eb4c9214ff723b..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/8181865f1fd5e629dbe12ed89d22dc83_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:fc098d9f4c3e789d8b8da8df70227ece52cf6ca0342eee9e2e83db307a744846 -size 50101 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/81e0bc85cbb6bdb4779d4af6d86e80cd_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/81e0bc85cbb6bdb4779d4af6d86e80cd_img.jpg deleted file mode 100644 index 56cc9b3a2768682a702d18da162f003af4874644..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/81e0bc85cbb6bdb4779d4af6d86e80cd_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:fb9bd1545b6746a7ae52b1c4054b5e1ef1bbdaa1deafcb9ecb7533f9ace74adf -size 49969 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/82a7d47fd0aee910d598c30998c23e08_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/82a7d47fd0aee910d598c30998c23e08_img.jpg deleted file mode 100644 index d132e0bc6756acc962a72e0552c983d1cce88a9d..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/82a7d47fd0aee910d598c30998c23e08_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:7b000c0c39691b4aded9ee9ad072bda1664b3eef1303a39cc7fb619b68c28add -size 33869 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/8453d7dc9225bb210abd09f5d0af3c9b_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/8453d7dc9225bb210abd09f5d0af3c9b_img.jpg deleted file mode 100644 index e55767f0c5a6a6a6cf5ba05d36d5e3509372c050..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/8453d7dc9225bb210abd09f5d0af3c9b_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:3a0f7c3d7ee104ccf9a7f13f1b0e4a6f895d820ea66fac9f9423d797def9f2b9 -size 110654 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/845e014e3b8677eb735d0e21f21206be_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/845e014e3b8677eb735d0e21f21206be_img.jpg deleted file mode 100644 index bd7b391b38a0e39c28fa781acf0bcdf7fa3ca7fe..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/845e014e3b8677eb735d0e21f21206be_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:440fb1268d147f07d75ccf71bd0134f24855b9da05f17e6820f2172d51e44933 -size 76653 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/84a1d09fb489061482111515543b60dc_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/84a1d09fb489061482111515543b60dc_img.jpg deleted file mode 100644 index abda52cbb1047d6649f89e40c898a1c33bed7267..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/84a1d09fb489061482111515543b60dc_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:6f3b7e07231c0f3e116c99c493bdda98ecd52313b6735faa6cea23815cf3162b -size 7190 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/85680f3dcbe15424dd54fa3fd9e1c90d_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/85680f3dcbe15424dd54fa3fd9e1c90d_img.jpg deleted file mode 100644 index 5ff5fb6913729e713b79dd08ca2a1c885536ab1f..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/85680f3dcbe15424dd54fa3fd9e1c90d_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:913be6a518a9cc3ceb3f5f759bca3fca6afcdcdcf505a44717cbd688aa6795e3 -size 12371 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/87253027e8bb658bf7d211cb23248bcb_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/87253027e8bb658bf7d211cb23248bcb_img.jpg deleted file mode 100644 index a68ee8fdc3454161687ea55de5af05b1bad3cc2a..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/87253027e8bb658bf7d211cb23248bcb_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:678bf45fecc1fe4b1673d18d13b72e1f52202d96b154ed05fcdb00cbdd52b51c -size 35926 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/87f2c7d96e398885a4108ecbf1aa9499_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/87f2c7d96e398885a4108ecbf1aa9499_img.jpg deleted file mode 100644 index 3c76ae87de2354c2200fdf48e5c1f70eb2a90765..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/87f2c7d96e398885a4108ecbf1aa9499_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:7a12a0a52f293b0c2945db731c4b5f8c0c920e67a0d6a9530ff3a76d64b28d7a -size 185920 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/8862d966c9597ffc01bd5013ca9885bb_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/8862d966c9597ffc01bd5013ca9885bb_img.jpg deleted file mode 100644 index 475782c84c15a0b3d7843a8b129c50dfb5aa59fe..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/8862d966c9597ffc01bd5013ca9885bb_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:3b2a38abc6b2b6e762b3c6ea48bc2f432e1163db516d0847fbca64ba16b60aea -size 24642 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/88fa0e6558e55b5d54f4d3029b21aabb_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/88fa0e6558e55b5d54f4d3029b21aabb_img.jpg deleted file mode 100644 index afda49cb8ebeaedfd14f49131664b657c85a7e87..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/88fa0e6558e55b5d54f4d3029b21aabb_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:9baeaf3981b5b9a567805399b6c1605c6fcc90e849f50da2d52127be37e94a5d -size 15216 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/89f8aefc01866631793087542316cef2_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/89f8aefc01866631793087542316cef2_img.jpg deleted file mode 100644 index 018951bd49633fb7e33b49f2262741fb3c4a135c..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/89f8aefc01866631793087542316cef2_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:da210d26f5ba45831d37a7c1753c08972526c99df096a5ae3ffd9bb8c4f49271 -size 52604 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/8b964751bc72fac53d873c674d3fa937_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/8b964751bc72fac53d873c674d3fa937_img.jpg deleted file mode 100644 index aec4f7a14cfbef91842cace8f33298d8158fda31..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/8b964751bc72fac53d873c674d3fa937_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:cf700fc7f3ca73b2c7dbba0486acaa68bfa5fde0aba4a37ce250902db0698a23 -size 125443 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/8c43614237e5bb57f1d5cf614291b32e_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/8c43614237e5bb57f1d5cf614291b32e_img.jpg deleted file mode 100644 index 281948cbc4a4b3178281f3b295ad05bf35ab609f..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/8c43614237e5bb57f1d5cf614291b32e_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:6cb2f17318c55ec652d6319ca9f44a3579024abf75415c98b0e74791189f4dac -size 144552 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/8f0dbc9a3fca3bcfa8574edb6061b03c_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/8f0dbc9a3fca3bcfa8574edb6061b03c_img.jpg deleted file mode 100644 index d69ca4bdeabd313227498cc1e33c22c2717e2a64..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/8f0dbc9a3fca3bcfa8574edb6061b03c_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:593a5d32ec61c9cbec0e9606a87e675827f07b93f5cd5d66d798a66e9d9de364 -size 10929 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/9271a5ab5252d6176287e699f600d2fb_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/9271a5ab5252d6176287e699f600d2fb_img.jpg deleted file mode 100644 index 261252a4eecbfe704db1d22604436ba8b0280311..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/9271a5ab5252d6176287e699f600d2fb_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:a32c9c12219fb17e605df1401a87882983ea14b4e384e5d018659d2705131a42 -size 21919 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/95ca5789af2916f3ebaf64172683c29b_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/95ca5789af2916f3ebaf64172683c29b_img.jpg deleted file mode 100644 index 74364c7d1d349cb0f433e8bf7a58f94e8827d9ec..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/95ca5789af2916f3ebaf64172683c29b_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:b53dd5f4e184c0db00731bead6f2a526ee7911a8251b3aa3f6aaaa58d3b3128f -size 10065 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/96be3e8be94c247917bab0d91881b5dc_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/96be3e8be94c247917bab0d91881b5dc_img.jpg deleted file mode 100644 index c752b7a3e3ccf67cd71f06f7d619b40616b808fd..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/96be3e8be94c247917bab0d91881b5dc_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:0bead476f10f0e5847e677a8d8ce6f4772322649e4d9cff94573ee5c46de5ee8 -size 12573 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/9704c16b28b4ab44f3edc6e729b9a8b4_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/9704c16b28b4ab44f3edc6e729b9a8b4_img.jpg deleted file mode 100644 index 894eab9056208959a68b1e95aec45626516aed12..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/9704c16b28b4ab44f3edc6e729b9a8b4_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:b224d495207e029556527afc2ba639d9f788da4a44a874399d185010df99d49e -size 10923 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/9707839366bb5cf01a4a5b4abd8c1264_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/9707839366bb5cf01a4a5b4abd8c1264_img.jpg deleted file mode 100644 index 186b7c61e8bce139fafc8569f3f8d905bfa0b479..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/9707839366bb5cf01a4a5b4abd8c1264_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:69d1b505f31e89b6e176aed0f0d79433415769bf00feacbb35346676d1ea5042 -size 13251 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/97f616c98c1526454f9a6c183492b2b5_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/97f616c98c1526454f9a6c183492b2b5_img.jpg deleted file mode 100644 index a9b4921c2dc511c8e18be2ecd8cdf979605d0fbb..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/97f616c98c1526454f9a6c183492b2b5_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:ed55771c3134d5371dfdcf98ffc30755d4dc89b138ed088437993bea2a457812 -size 14146 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/987a8ea27d373fa66433e6b8cb2e98ab_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/987a8ea27d373fa66433e6b8cb2e98ab_img.jpg deleted file mode 100644 index 4107b5d70b657070c7feff27c62556125d9b1157..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/987a8ea27d373fa66433e6b8cb2e98ab_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:91d57ac10ba121f91b350e25401274c39d3d3dca3a4c9d8502d2140b49873d37 -size 45148 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/98a6715208267336f8339163b005c28f_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/98a6715208267336f8339163b005c28f_img.jpg deleted file mode 100644 index d8de52d250e97b4d41bc19ff302b91d7fab4c563..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/98a6715208267336f8339163b005c28f_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:9e435c735e083514a7b188eca93c2f23c0e09a25d0a24a5c0f7cec439b4a62c6 -size 64486 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/9947dd291b40f299948b56f3190ec7b0_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/9947dd291b40f299948b56f3190ec7b0_img.jpg deleted file mode 100644 index b539fedbbab531b7165d3527981932b3483cc1cd..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/9947dd291b40f299948b56f3190ec7b0_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:61d5de27b88c9df7b306d4442ce6a21f7610b3997753ed9969bfadc4a05a7f9d -size 9285 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/99698c448635861b7dc8d352f87a1b2b_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/99698c448635861b7dc8d352f87a1b2b_img.jpg deleted file mode 100644 index 9dc8ac1ccadada798e012c2024c17679ee129632..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/99698c448635861b7dc8d352f87a1b2b_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:bc9f7ac54d8c0772fc10b5c67f806d2e8c7feb909229ae93e54f857a84d72c49 -size 33203 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/9a53cf0c36d7542a25d60835be986e5a_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/9a53cf0c36d7542a25d60835be986e5a_img.jpg deleted file mode 100644 index e67f062e76231c510416c48d30038f047816543a..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/9a53cf0c36d7542a25d60835be986e5a_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:70f90a72b7df06e549b4157b031b534d6de2a3868bccf7a7a928ac7650c17dfa -size 13178 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/9af97997b7d3fbca90b8ddba0ea39c6c_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/9af97997b7d3fbca90b8ddba0ea39c6c_img.jpg deleted file mode 100644 index a5c5125ad1248715ff63c665346af94366c4b762..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/9af97997b7d3fbca90b8ddba0ea39c6c_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:6cff337e263c9bddd5236b3324c6b78ee65bdca0b2b1bec31b1ccb86764fb744 -size 88654 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/9c12d7993e786817c8c569e6f2d5a0a9_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/9c12d7993e786817c8c569e6f2d5a0a9_img.jpg deleted file mode 100644 index 94854d6edc5eef8e3f6ae4d16e2bb007915a8ebe..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/9c12d7993e786817c8c569e6f2d5a0a9_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:19d2b5812ff2c9c441dec23ae00599edc51839262d9bd3417fb2c634f61bd3f6 -size 60671 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/9d47fe89bc71acebde670ea760ee6ffb_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/9d47fe89bc71acebde670ea760ee6ffb_img.jpg deleted file mode 100644 index 69db4c7332a994e4a1357e1f67392e373b02692c..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/9d47fe89bc71acebde670ea760ee6ffb_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:c3b528f902eda5ac477f9330479b68833fd6870e1fe70251ce5342ca988b593b -size 64476 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/9d81a26facbcf05a73cb7c027e66c1c8_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/9d81a26facbcf05a73cb7c027e66c1c8_img.jpg deleted file mode 100644 index b3dfe4e9a3b532d8d1811634025341163e5cf8fc..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/9d81a26facbcf05a73cb7c027e66c1c8_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:108ea2c58e02c2bcb41963ad1f8671f7bbdd9cdfd66a053d04c80f443b82c0be -size 7406 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/9dc88fb2c48bc64047fc3e79814f1d47_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/9dc88fb2c48bc64047fc3e79814f1d47_img.jpg deleted file mode 100644 index 29fbdad1926098486c3daa523da60d6e555144d8..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/9dc88fb2c48bc64047fc3e79814f1d47_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:696e6e6e7b3bd293c51b42c89f04ee10e76ab368698001c300ae829f15816fd7 -size 55728 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/9e290fa7e4578ba0a8b8c5008c99b564_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/9e290fa7e4578ba0a8b8c5008c99b564_img.jpg deleted file mode 100644 index d4e92283ad379477b4ae182ef812a4ebeb78050a..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/9e290fa7e4578ba0a8b8c5008c99b564_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:350f9ae35e6727e6cb8fd9ef116e01c63074cb66012b31ce0c5f551f699059f3 -size 162962 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/9ef8e686bf7d4fdc4504d136e1b350f0_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/9ef8e686bf7d4fdc4504d136e1b350f0_img.jpg deleted file mode 100644 index 8cd4a8792feb1f003d36fd17602eb092d3dd5525..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/9ef8e686bf7d4fdc4504d136e1b350f0_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:35c6252185d70d2f9481d06430971ec2447970f247e9e91d4cdc3b3e124f3ed8 -size 123969 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/9f1b05b6b77146b0d62dbc084ebbe162_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/9f1b05b6b77146b0d62dbc084ebbe162_img.jpg deleted file mode 100644 index e9a93f085b9282157c06f9ca925fd4d5b3225644..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/9f1b05b6b77146b0d62dbc084ebbe162_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:b46df20b81b4fe604b415cd3b6d15253be1191b9b0790bf1b94ea68291411e36 -size 167287 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/9faa3512b2ff7973283e76192e91bf65_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/9faa3512b2ff7973283e76192e91bf65_img.jpg deleted file mode 100644 index ce4cd9b4ffa7380773395ef86cdd997a860883d1..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/9faa3512b2ff7973283e76192e91bf65_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:da8049fd230f1060e2e65dee141b475f3786f424b536ed33eaea3d1f8ff8f783 -size 121615 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/9fd6d80e1aab4be30024f5d67f3a4a53_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/9fd6d80e1aab4be30024f5d67f3a4a53_img.jpg deleted file mode 100644 index 087e6d30dacb9a708ce1bc2f562a00c156ba4142..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/9fd6d80e1aab4be30024f5d67f3a4a53_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:4df10a5d20ac23dbd610c8a76627128360e707e1e1a11d334eacb67baf5fe405 -size 171003 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/a02b188a5fd52c99f84255322873bf29_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/a02b188a5fd52c99f84255322873bf29_img.jpg deleted file mode 100644 index 1fc3c53d8b5e626ebb73d48733b76d9a128eb46e..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/a02b188a5fd52c99f84255322873bf29_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:6bf59f035e32813ba8b4f0d7b1fb062f65658fa0363406918647d99735372651 -size 8565 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/a265aba1737da6f0200faac85366b163_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/a265aba1737da6f0200faac85366b163_img.jpg deleted file mode 100644 index 3efca594bfad891176b141932e5085643d846da3..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/a265aba1737da6f0200faac85366b163_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:9e5cd1145bb04a724aa5b54e743827800d87a4e8255433d27276a82fd620aa05 -size 25618 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/a279b24bee8e82a60177168f08cce415_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/a279b24bee8e82a60177168f08cce415_img.jpg deleted file mode 100644 index a45b098aff8e30df5dd27a182bb7b72830c63ec8..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/a279b24bee8e82a60177168f08cce415_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:d5b6834a2e4ad6c9be751b30eccc553e1d7e762c7c35b71affcf5a01b8212639 -size 118650 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/a4a23a6cfd603aea55a02bae13456e8e_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/a4a23a6cfd603aea55a02bae13456e8e_img.jpg deleted file mode 100644 index 7cde5b319a6958862edb1e1acc016b909bb94f63..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/a4a23a6cfd603aea55a02bae13456e8e_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:d90b97f69cf50a6d55bc2f1dfbac170e511fb3095be010e85ad2f2ce073c6692 -size 53000 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/a5ee5c23b6dc52ec1d724b76d5a5f58f_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/a5ee5c23b6dc52ec1d724b76d5a5f58f_img.jpg deleted file mode 100644 index 1f4ac94db53675c4cdcc6478d138f729245cb06f..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/a5ee5c23b6dc52ec1d724b76d5a5f58f_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:123dbe206967ad82e57006927e50377f05d99eca5ad3977ecdfedb3d92392695 -size 72026 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/a6a834290f84822c2d026a3da95617c5_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/a6a834290f84822c2d026a3da95617c5_img.jpg deleted file mode 100644 index 2575b94d3fac8a3d5cd67f6a854b456dde76669c..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/a6a834290f84822c2d026a3da95617c5_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:0fc13e52d88bfe093d804906c5cc8bbde098a453b6630d50559ab8a0fc82b535 -size 33529 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/a70d42d1621bc4d20c0f9d2e396222c1_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/a70d42d1621bc4d20c0f9d2e396222c1_img.jpg deleted file mode 100644 index 8a6eb159a559d37cd8f2e6b43599d97cd0454a2a..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/a70d42d1621bc4d20c0f9d2e396222c1_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:fc6e8782cd893e8778dc0d5c1aa0d73dba796ca19d466f1e0890c0ee0a844afc -size 19854 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/a7450c80e88ad3f6ca1427ad84020998_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/a7450c80e88ad3f6ca1427ad84020998_img.jpg deleted file mode 100644 index 7780fae197fc0d8f7ccaf26093417162f348e349..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/a7450c80e88ad3f6ca1427ad84020998_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:1da54e294e68f809279166525e00307900b8a78ae2e4428b695ce32cd5e554c1 -size 59581 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/a815ab84d8edcfc7061d7e8456ac7013_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/a815ab84d8edcfc7061d7e8456ac7013_img.jpg deleted file mode 100644 index ae80cb4ea467c95855af83b97b2ae47261e64853..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/a815ab84d8edcfc7061d7e8456ac7013_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:b4bc3754bec8713ce71dcea9c266bdd58b8fcf1448a9253ad254c9393b409eb4 -size 7251 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/a890c88f5a03b77a0de8feaac5313821_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/a890c88f5a03b77a0de8feaac5313821_img.jpg deleted file mode 100644 index 697817262ef9de7a2ee686ea1e49fc3bbaa140e2..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/a890c88f5a03b77a0de8feaac5313821_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:e7a184608e8022fd3e62c5e01a386e08182cd9f90e38704cb9970de319fe4dc8 -size 63739 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/abf91c0fe8bc45562f2bc9adc2d5d58a_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/abf91c0fe8bc45562f2bc9adc2d5d58a_img.jpg deleted file mode 100644 index 0327dc10de3f782a188a8b81cf00214afdfd25f5..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/abf91c0fe8bc45562f2bc9adc2d5d58a_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:64f7ef3de600ae3ee8170d7f96317d0180749061f5f8913be62a9c1afab7a8de -size 24249 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/ac1b4040daa037941f51deeedbcd585a_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/ac1b4040daa037941f51deeedbcd585a_img.jpg deleted file mode 100644 index e4202f39d00c23d675df1aa1bee4a1a1236b1b85..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/ac1b4040daa037941f51deeedbcd585a_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:149f5b5f66d332fd141d38e52bb0da165ead3064a7d0a240d21f404a281204c4 -size 8733 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/ad4da36431850ac19ba59bb74ec29dc9_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/ad4da36431850ac19ba59bb74ec29dc9_img.jpg deleted file mode 100644 index 59bb5369e4a33511842d8d15d6819fb4ec498b64..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/ad4da36431850ac19ba59bb74ec29dc9_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:a93ec14b630aa2c0d5bce0339f361351ba872ed39d54517c1cfe52b585297150 -size 13673 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/ad555483986d7170a46ce72d164b5bc8_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/ad555483986d7170a46ce72d164b5bc8_img.jpg deleted file mode 100644 index fbff5749ea25d94c3d7465ae1675c751fb7b12d8..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/ad555483986d7170a46ce72d164b5bc8_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:97cb091f9833b672ccea36e01c7e4b3a75ddf54179867cbe4979d8d4679d512c -size 19139 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/ad9b0c8d0d3fc421b0dbc2ecc61376f4_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/ad9b0c8d0d3fc421b0dbc2ecc61376f4_img.jpg deleted file mode 100644 index 64337f29531c4d0234e9c42d295cd5ff445c4764..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/ad9b0c8d0d3fc421b0dbc2ecc61376f4_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:e298ad59af0fe2120ad30bb5f81594f0f969756078cb4735c57a4dec968f8e26 -size 58115 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/ade808c7cde5b576488a326d288f29eb_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/ade808c7cde5b576488a326d288f29eb_img.jpg deleted file mode 100644 index 4538ede0ca5c48c997db65ebf85e044c57f5021b..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/ade808c7cde5b576488a326d288f29eb_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:1926fcca1201dae328bf426abf02d21df2db9f1413358a7c428e7fddadab2d2c -size 82798 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/aeb2a26a07219661191294dba528067a_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/aeb2a26a07219661191294dba528067a_img.jpg deleted file mode 100644 index d1526cf115e7749129c424ef72b0f9e596acb124..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/aeb2a26a07219661191294dba528067a_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:2559e7b6aa04f3e3880a61d8fe6a5d342d7b420ea44d87f31a41c2e8913190d3 -size 90698 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/af664ceebdaf69ac46f3af52f51df20e_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/af664ceebdaf69ac46f3af52f51df20e_img.jpg deleted file mode 100644 index 0c6c27875271d340f80c3385327351720cd0f236..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/af664ceebdaf69ac46f3af52f51df20e_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:091fd41af0f1acc9ff05d2a396e7aed960eb5b4c0ff318ad2f794edeeb26da60 -size 17139 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/af7916c89a458fdab6c3f443217388ae_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/af7916c89a458fdab6c3f443217388ae_img.jpg deleted file mode 100644 index 61d0ce285a9f364333dbb614dd5b2c9859612e19..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/af7916c89a458fdab6c3f443217388ae_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:edcaf0d0e24441fae0d9f518d7be25bd9ec62eace6d78dbd940f8b0325824ed3 -size 151899 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/af90aabfe3c8c65617da060d82bf99c5_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/af90aabfe3c8c65617da060d82bf99c5_img.jpg deleted file mode 100644 index 68079f3d64fa2bb5d233c585ab64a9982b4091e2..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/af90aabfe3c8c65617da060d82bf99c5_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:7728c81292a15582774803093bd07a1c875276a3bb90a9dd017c4ce8f37692f1 -size 41048 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/b20942bb14022381a243971ab9790dd9_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/b20942bb14022381a243971ab9790dd9_img.jpg deleted file mode 100644 index b7ced55412729a836dd320c5280ba680ac9314db..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/b20942bb14022381a243971ab9790dd9_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:0056e8418c00bb198b67817cba2b2fcf68b2e5751b748ff8f1fffe6295e124ff -size 108812 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/b297f64b2487ded933870098ad287bce_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/b297f64b2487ded933870098ad287bce_img.jpg deleted file mode 100644 index db3cfd70e234faab9eea5dfb1d4a458cb209670f..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/b297f64b2487ded933870098ad287bce_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:60ae4249ad2a6c2f97ef8700dbd8ddef94b1916abb4b3ee387ee8d63e0b714e2 -size 27545 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/b35608e925cb6a7c0aa0db30d2db9d66_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/b35608e925cb6a7c0aa0db30d2db9d66_img.jpg deleted file mode 100644 index 1eeb6989c7f09323c521b3c48a017dc4283976f4..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/b35608e925cb6a7c0aa0db30d2db9d66_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:da614f691b74376019017a879e10509b05af4cd7a268eb135f28aea16414c934 -size 127148 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/b3cd59f24a21fab4cd8ac6fe743ab3a9_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/b3cd59f24a21fab4cd8ac6fe743ab3a9_img.jpg deleted file mode 100644 index 22bdba8169fe15129c3ac2ecf7349d7e4783c343..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/b3cd59f24a21fab4cd8ac6fe743ab3a9_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:f94915d5b516ad1bb0de20bb6f8da60a648fb99c17660ba96008a3a945d5eac7 -size 8129 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/b4231d923aa1b23a3d9e7a2aa2942d1e_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/b4231d923aa1b23a3d9e7a2aa2942d1e_img.jpg deleted file mode 100644 index d69d04e29a97326fd19eeff1003cec6b29e35a18..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/b4231d923aa1b23a3d9e7a2aa2942d1e_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:27b98c24d65333bb3f2b50b4c0114427d948f781b816201088ed97d524b2a89f -size 20585 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/b43ec8e53bbe827c4572d9fd80ebc21a_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/b43ec8e53bbe827c4572d9fd80ebc21a_img.jpg deleted file mode 100644 index b42c056fb60da3abd2cb31e40b445ab695f8b343..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/b43ec8e53bbe827c4572d9fd80ebc21a_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:b4939caf74598e5c2676e5e0b35d0560800ca8db6a7e53882fe66c85c6cf9dac -size 12429 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/b49477e8f148b5ef044a2fd5a43528f6_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/b49477e8f148b5ef044a2fd5a43528f6_img.jpg deleted file mode 100644 index 7ae06fb719d06a6354e0677bd5d84b1c8afa413e..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/b49477e8f148b5ef044a2fd5a43528f6_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:22f82ce4d8e22a75d1940944666937231fde758bb67ac540fd08b7e989939d12 -size 40914 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/b49ab452107df6572ea43e1be0912bd0_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/b49ab452107df6572ea43e1be0912bd0_img.jpg deleted file mode 100644 index bb0304d28895962491f817c2e37be19a7d21f21f..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/b49ab452107df6572ea43e1be0912bd0_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:fcc769822046424fb511d63d8dc373453a77d7d7fd4951f93097d2e647e95544 -size 105833 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/b55656f01d98097862b9e6d8461ec59b_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/b55656f01d98097862b9e6d8461ec59b_img.jpg deleted file mode 100644 index 3c101395e1672c000fd4b68030321d9a1ccf85f6..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/b55656f01d98097862b9e6d8461ec59b_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:5b63099b6f78b4f3c88dfe334bcd6781bf513ef859a3f47c4edc17701fe43ab4 -size 55777 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/b56ccd10a090e772debb888ae457727b_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/b56ccd10a090e772debb888ae457727b_img.jpg deleted file mode 100644 index ab2782373a21e150518e5b54a5218b113b154b38..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/b56ccd10a090e772debb888ae457727b_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:ca5514033b9d797e57ce81d3d983b1bbc698de0a5038cbab39729273e20acccc -size 39621 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/b5b908b453ca50ed3b4cca88aef080fa_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/b5b908b453ca50ed3b4cca88aef080fa_img.jpg deleted file mode 100644 index 3e54250b46dd1f5755f333e651e5fd5920ebbdd2..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/b5b908b453ca50ed3b4cca88aef080fa_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:1571c5eadb952ca7fdefb44716c242718b74ee7797093c129bee0b743a98e911 -size 25542 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/b68ed2f7c90787b2fcfeb6be5640ecd4_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/b68ed2f7c90787b2fcfeb6be5640ecd4_img.jpg deleted file mode 100644 index a9e12c7e167c65f0f5b427bc93176b8cb93ed7ed..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/b68ed2f7c90787b2fcfeb6be5640ecd4_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:c629f2805851775fa9a3caf9db3ba23152cf9c2b08b64b1be89f23409d954c59 -size 10573 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/b71ad9fc874230de9ba4480e12a216f7_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/b71ad9fc874230de9ba4480e12a216f7_img.jpg deleted file mode 100644 index 42b2684142872f8ae5b0bae5645b87fae391db2a..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/b71ad9fc874230de9ba4480e12a216f7_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:3562c28098ef6598b3a39defd91c97f28b204ffe30207648c9624549eea3140a -size 9985 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/b98b6c7cbdaae63ffe90f117e507e81a_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/b98b6c7cbdaae63ffe90f117e507e81a_img.jpg deleted file mode 100644 index cd23c34e5b7dd123d03dbf666fc6b8b78c9371ff..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/b98b6c7cbdaae63ffe90f117e507e81a_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:128c0a72f7890d6d1a89a57899e7845169eca2e289ad9b5e402e59243aa56612 -size 14377 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/ba596ecf0bd3f3520b7b5c2c857a9ec3_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/ba596ecf0bd3f3520b7b5c2c857a9ec3_img.jpg deleted file mode 100644 index 4337ddda09dcaa884e4b86136f7b9e7f47125607..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/ba596ecf0bd3f3520b7b5c2c857a9ec3_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:00e1188d4d6b6cbfe57cd70f2d7646e23d19504d29c619c48305f85118d48778 -size 70268 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/bae1bd2b5dec0c7f0717e710ad5a3412_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/bae1bd2b5dec0c7f0717e710ad5a3412_img.jpg deleted file mode 100644 index 87c7b83c61287451fce302933d0ce64802ce6226..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/bae1bd2b5dec0c7f0717e710ad5a3412_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:0af58be6f61972cf230b15f55afc3f046c7b00642ca1c28499b7755ece98faf0 -size 107028 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/bb0e323a672fa2f89e0132b1db61cfb3_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/bb0e323a672fa2f89e0132b1db61cfb3_img.jpg deleted file mode 100644 index 808edbe39e3a45e37182b7185fc2be9c0f52a45c..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/bb0e323a672fa2f89e0132b1db61cfb3_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:bff35f80cb2769bbcbfc9926e5eb35ca2f868bca5ca49578759c24c447b94b88 -size 30707 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/bb8035cd106b4d77b3615e90645f8e37_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/bb8035cd106b4d77b3615e90645f8e37_img.jpg deleted file mode 100644 index 76871964c1208df9b9275d952765030845d31866..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/bb8035cd106b4d77b3615e90645f8e37_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:0e7acce0b9e61a680ca290d480694fb9015d2f4cae65248013a9054bf3b112e7 -size 24969 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/bd0fe87fe6e236bc4778830b4f26d9e2_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/bd0fe87fe6e236bc4778830b4f26d9e2_img.jpg deleted file mode 100644 index 4761816751c805151a69d1c190318294cf68b291..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/bd0fe87fe6e236bc4778830b4f26d9e2_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:778e373153058e08b3c9ca1fd1efabe1e6a3c7481faf7e7744673bd634413d22 -size 60889 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/be9225da20b1fa284d0ed4b44fd633a3_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/be9225da20b1fa284d0ed4b44fd633a3_img.jpg deleted file mode 100644 index bcfca6efe212d07ac5732cd701d2021d0756a81e..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/be9225da20b1fa284d0ed4b44fd633a3_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:14bd6f7ca07576249359cb0dae9ab86b89ebd27a664ed9b2c81a97986fd4fc5c -size 12543 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/beb1af5db94ec438ceeab4ef895ffb48_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/beb1af5db94ec438ceeab4ef895ffb48_img.jpg deleted file mode 100644 index ecd8ff620eee3fcdb4597174155572f264023b72..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/beb1af5db94ec438ceeab4ef895ffb48_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:3ab5cacbe6ba3d788eaf9b5fd3f913691fac0d9b5013fa20b3b70bb45c600244 -size 9118 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/bef134816f55f50b735c92ac0c01da38_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/bef134816f55f50b735c92ac0c01da38_img.jpg deleted file mode 100644 index edc7267a084b37bc37faaeb978b1df8a52e67b52..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/bef134816f55f50b735c92ac0c01da38_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:cd17c8f94155d8b7d844dc4fe75edf46866b86ef69a1b7f62ce99ad78a11f655 -size 24960 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/c1b762c358fd423d6686563b3fde7750_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/c1b762c358fd423d6686563b3fde7750_img.jpg deleted file mode 100644 index 62af8491baeb6466ed3b537bd9ad2099f7aafd34..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/c1b762c358fd423d6686563b3fde7750_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:33869ea987906df345e583b9ae9543651a7e31e8c1e6483fa639e0dd673b203b -size 129355 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/c1bf17571f9cedf76c4072121295d10e_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/c1bf17571f9cedf76c4072121295d10e_img.jpg deleted file mode 100644 index 1dd41d835383e7a5003287186c42c24c89bfc70c..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/c1bf17571f9cedf76c4072121295d10e_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:61b8af44e690940b36724f0f930120736c2b0f0b350eeca2f78b69e185be72f1 -size 23865 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/c1df61cc3717e878a48e530218403403_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/c1df61cc3717e878a48e530218403403_img.jpg deleted file mode 100644 index 6ee3d58eaef24f7a3747ea68f8eec125e10e8193..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/c1df61cc3717e878a48e530218403403_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:427c5143a50b7285676ed32e08b11690bc80f7d9e20d9be9d43e0773d3aa73a5 -size 59803 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/c2f36c545b190860d04e1d84e58d22cc_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/c2f36c545b190860d04e1d84e58d22cc_img.jpg deleted file mode 100644 index 52b190f20a06f4503ec43dcb72d514a09607f383..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/c2f36c545b190860d04e1d84e58d22cc_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:88c5b3cd0c8d7dfe900ba013c08715a37ba2393fcca601f58729ffe0118bde79 -size 88065 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/c40bbeb66e1572660694c68dcb5734e1_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/c40bbeb66e1572660694c68dcb5734e1_img.jpg deleted file mode 100644 index 934bb197e30c6ddfe357992651437c8590e4f9ee..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/c40bbeb66e1572660694c68dcb5734e1_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:15435ea4f9aaceef4d41e120a547304c73b5c9bf44e2227703d48f2fd7702751 -size 16175 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/c425a7b76be3f887bb251606c2a7ce9a_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/c425a7b76be3f887bb251606c2a7ce9a_img.jpg deleted file mode 100644 index 0f0312d6f87493323c7e266cf7fc653f52eda4a0..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/c425a7b76be3f887bb251606c2a7ce9a_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:05dd98c37e7b3eaac65b40257269fc184facc7bac2a5bf6d4f303722aa8bcd01 -size 14619 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/c5945ab1332e6611e9e4d64bafdc3455_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/c5945ab1332e6611e9e4d64bafdc3455_img.jpg deleted file mode 100644 index b40ebb8abe6b5f2bd1c99a634620d69ddae0192a..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/c5945ab1332e6611e9e4d64bafdc3455_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:f588163e27ae8a8d0319b10b666d9abd5da326e1b7779e58c03afe9dfa48492e -size 9910 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/c6212a3b14736d6a8c81ace75ae94ccf_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/c6212a3b14736d6a8c81ace75ae94ccf_img.jpg deleted file mode 100644 index 28e102f4912a5cb73b400ce21e017a8ec2f57c46..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/c6212a3b14736d6a8c81ace75ae94ccf_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:51648b38563eab78f10356885f1b185f77242f46a1d0e15b323e36f6f1bcb5ce -size 51514 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/c6e449481a4deebff8ada290c22a77d9_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/c6e449481a4deebff8ada290c22a77d9_img.jpg deleted file mode 100644 index c6f3c0f1fdd5c3409c88963016c867cd7c2ac429..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/c6e449481a4deebff8ada290c22a77d9_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:eec6fd601a36ba73ae04a2c801cd5f532ed498825a369ced17898d69223a69a3 -size 18781 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/c79d10d97e1f525e9c85e96e91616923_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/c79d10d97e1f525e9c85e96e91616923_img.jpg deleted file mode 100644 index 2019b1c5fbd813af9be926452da5d96ec0ad6f41..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/c79d10d97e1f525e9c85e96e91616923_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:cfe01cc6fb6cad585fcdb41fc0372ea96f06d72fac6bdd9ad13e5e52f02d47c4 -size 13085 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/c8262867e39639276066c34941705aed_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/c8262867e39639276066c34941705aed_img.jpg deleted file mode 100644 index 80d90242c7e74fe20ec242295caed323567a086e..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/c8262867e39639276066c34941705aed_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:0cb4329d47adf02d603d03acb25eabac1368b55fe179638f84e416e9910500d6 -size 33848 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/c8b66b38ad7369d0771b91b51c155b32_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/c8b66b38ad7369d0771b91b51c155b32_img.jpg deleted file mode 100644 index ea9fb6cc744786d2aa4b68c6407f51d1782677f1..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/c8b66b38ad7369d0771b91b51c155b32_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:7f2144352b3b9535786c64e4db19b7b6ce2876c0b8315f308f6d6e4b87587884 -size 33059 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/ca29ffd592187cc2b1719b98a5417521_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/ca29ffd592187cc2b1719b98a5417521_img.jpg deleted file mode 100644 index ba7759301b238a81d0f76f74903bef31932a2473..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/ca29ffd592187cc2b1719b98a5417521_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:a871e8f5835474973fe190bd1d93e52bdd45d6a6ae6c11e632e1e51850b5e621 -size 155121 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/ca86f53f9735fe98b6c6003d1b759f64_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/ca86f53f9735fe98b6c6003d1b759f64_img.jpg deleted file mode 100644 index f7da04b19571e0836134b284ecf48c4e161d4b5b..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/ca86f53f9735fe98b6c6003d1b759f64_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:d27ebf5b9dee11580d5967de95e5d24a01a398adfef5d1d1263ffcdd789b570c -size 64820 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/cacc4ff5c441e0eb6fbd5e14a083eb05_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/cacc4ff5c441e0eb6fbd5e14a083eb05_img.jpg deleted file mode 100644 index 79f1c8626519ef3dea135f249d7a46a0a9b89b89..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/cacc4ff5c441e0eb6fbd5e14a083eb05_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:ec469204cfbf9e5e8f503226bed84ec207b49cdf57f1132b6c6e64e80795c779 -size 22651 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/cbab05075b3d7dc0d27c4cbb0c914a94_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/cbab05075b3d7dc0d27c4cbb0c914a94_img.jpg deleted file mode 100644 index 1850e50ad817a6bd8c51a5e36399f5c2013e7bf9..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/cbab05075b3d7dc0d27c4cbb0c914a94_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:7ad6b78ebec5ceed012e0cf0d1e4de9afee5e320f1520e1b7a669d08535f52f9 -size 56576 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/ce0669b928f93ab068d8874de19c133a_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/ce0669b928f93ab068d8874de19c133a_img.jpg deleted file mode 100644 index 030b62060ede9c8e3d3fa765bb835f5a599e7636..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/ce0669b928f93ab068d8874de19c133a_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:238d4adf22a4b95be656e41974b2257a384c5ad17f055a3a5f26856ccf092de5 -size 15081 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/ce4432c76d20b370ebecb57e59afc2ee_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/ce4432c76d20b370ebecb57e59afc2ee_img.jpg deleted file mode 100644 index 9cf2a45584401a0bdb3df80163d1bf208bc8e31d..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/ce4432c76d20b370ebecb57e59afc2ee_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:1aface27b9246cad5ee0490dd881638756c4d49a30c29012c3cfe77eced4f650 -size 76461 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/ce543c6123474723be64e31597330590_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/ce543c6123474723be64e31597330590_img.jpg deleted file mode 100644 index 737a08f2bb3aa7f8b31bf049ea03665142434245..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/ce543c6123474723be64e31597330590_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:44a92d09412215f96fde351368c2c661acc045245f685a3447c1965fa0b203dc -size 8281 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/cfc2672ccfdf7b47212ef2b8d72c0ff3_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/cfc2672ccfdf7b47212ef2b8d72c0ff3_img.jpg deleted file mode 100644 index ac78e32452c50d021914a5c8062c78e5891e89aa..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/cfc2672ccfdf7b47212ef2b8d72c0ff3_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:35f334ee1b6bb55dc6a38a12633d74230525f0aab429572ee1865b8d45b620b9 -size 14127 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/cfda9df1319e04207eb28bcefd1dab7b_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/cfda9df1319e04207eb28bcefd1dab7b_img.jpg deleted file mode 100644 index aaf2adae0768f95589d37da846da9acc7ea480bb..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/cfda9df1319e04207eb28bcefd1dab7b_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:411d6e6b6aa3bfc083c168324ab7834690e92532c0f93b5b0e80d16cc9aa7248 -size 45690 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/cfef993dcc8fb513de79eb1f93cf26ae_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/cfef993dcc8fb513de79eb1f93cf26ae_img.jpg deleted file mode 100644 index 591bfe0da48aadd9bf3fda577a3b9746eaf85c0b..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/cfef993dcc8fb513de79eb1f93cf26ae_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:551128151bf88b3712deb1e7bdfe55df55c3b01274e4b7ce75e465ebd427a1a7 -size 115460 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/d081abfd06a4b868f797e5669c6dff78_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/d081abfd06a4b868f797e5669c6dff78_img.jpg deleted file mode 100644 index 07017003bf4aeccd99db323f653434deb5bd9354..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/d081abfd06a4b868f797e5669c6dff78_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:37359925511adff228f5eaa72d375aa9cfc77c4520126076ad88dacdb5980f37 -size 196068 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/d11039755489421fdcdad3ed6edd05d8_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/d11039755489421fdcdad3ed6edd05d8_img.jpg deleted file mode 100644 index b9bbbe0555abed45b4e1272817cde4e248d3a63d..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/d11039755489421fdcdad3ed6edd05d8_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:0d6c654664882be5669567aa0483e7050bea4102d53fffd2a08598601ae0d237 -size 146332 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/d15e2d3e8dd9157eb7f0cc120097484a_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/d15e2d3e8dd9157eb7f0cc120097484a_img.jpg deleted file mode 100644 index 056e90acb0c9d1449e96e84511e1df4a34c318d0..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/d15e2d3e8dd9157eb7f0cc120097484a_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:515b00cc43872f6d11dfcd7696d91d342c5c1dc1677a71fa542cdbb8257e37ea -size 12887 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/d186ab1411a29b6f0938ab43178e9f0d_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/d186ab1411a29b6f0938ab43178e9f0d_img.jpg deleted file mode 100644 index c91425b77e0025c0cf1d71a0786f52f9372e268a..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/d186ab1411a29b6f0938ab43178e9f0d_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:36dd5805f14cdb72663aafcc9445dad1965f8ebbf5d4b7535bd68849383a249c -size 56059 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/d1ad05f1189b0d80188fee24ae33c112_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/d1ad05f1189b0d80188fee24ae33c112_img.jpg deleted file mode 100644 index e12477cf2bbf1d9204d8b61143dbb0858e0e977a..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/d1ad05f1189b0d80188fee24ae33c112_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:ee7e106b479e6e659ed96105079507de61a05abbee6c3c3d80f583910019f5a8 -size 105080 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/d23fe5b7e93dc24c2ffa70b743025c5b_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/d23fe5b7e93dc24c2ffa70b743025c5b_img.jpg deleted file mode 100644 index 9af60b2cca59173b1f4e4c755f22cf4cbcb0e5d6..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/d23fe5b7e93dc24c2ffa70b743025c5b_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:390427ba7b14b01f0134581de0975d7fe1fe13de0fc6f70eeab1e5770d10ddcd -size 55824 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/d3253d5db64378db6e72b66b41067a5b_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/d3253d5db64378db6e72b66b41067a5b_img.jpg deleted file mode 100644 index 44d446d10fac4ff91d1a80e617ae4849bb8f340c..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/d3253d5db64378db6e72b66b41067a5b_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:6a5169bab4bc7cb91783ef5115a3e80855ec3ce403ba7ab7e01534b5669bc712 -size 67807 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/d3581354fc6f1b5e27d3c990e41cc805_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/d3581354fc6f1b5e27d3c990e41cc805_img.jpg deleted file mode 100644 index b43938bc7c84c89acb6f6007cb2d80752a758b01..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/d3581354fc6f1b5e27d3c990e41cc805_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:071022cc4ba4a37cb6266a92f1f001f1038f13d932ed918a7e0291323522a7de -size 191755 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/d4af765160d04ecef538e5066006dc77_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/d4af765160d04ecef538e5066006dc77_img.jpg deleted file mode 100644 index b2e43eb2980a6e14cfe6c8b648e75e0efd92bee6..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/d4af765160d04ecef538e5066006dc77_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:63b1844653f19928bf0d362591256dd995dbfc48bc9c730c1e2a288cffb9b12e -size 81098 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/d5de4c1d2f0b71aa339b6b2118268fbb_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/d5de4c1d2f0b71aa339b6b2118268fbb_img.jpg deleted file mode 100644 index 81c8ac82e1c094bfbbb1bc9c57cfb10a510c7747..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/d5de4c1d2f0b71aa339b6b2118268fbb_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:a21f4010911bdd77036db39b1072ce7a459d373bca1d7688e76f7a19dfe89a46 -size 131442 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/d7a98a717edbc26ca1508aaab7a566f4_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/d7a98a717edbc26ca1508aaab7a566f4_img.jpg deleted file mode 100644 index cb5e45d1abd729a69d53517052a40c086972ea35..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/d7a98a717edbc26ca1508aaab7a566f4_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:130b4bed28b5fd668d25d76200f122eaa56d106fba2921d56fad66b8634985e0 -size 12737 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/d884367c84ba50f250499f79c4b4b950_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/d884367c84ba50f250499f79c4b4b950_img.jpg deleted file mode 100644 index b0e4db2fba41c6058562e00efd459892406cbca0..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/d884367c84ba50f250499f79c4b4b950_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:cf549ce2915ddf53b3a3c1eefe2f50eeb8998b3cfc33c36df5ba42cb8749f11e -size 13011 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/d94747f06bbc2d98d92f9ca113ab737e_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/d94747f06bbc2d98d92f9ca113ab737e_img.jpg deleted file mode 100644 index 98bcdf271c20bdd32820812833f7cf7a4fd6a7be..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/d94747f06bbc2d98d92f9ca113ab737e_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:44345d26a1f7762866f5b0dd9c8a3f84a5a27a790a3f1cce0ff22310b9b783fb -size 73925 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/d9862ac8473902e7dfe441c5e88d47d8_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/d9862ac8473902e7dfe441c5e88d47d8_img.jpg deleted file mode 100644 index a6093fcb5c47758635cad3c23a36fd578671520e..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/d9862ac8473902e7dfe441c5e88d47d8_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:92124432cc801ac2ddd9e3ddb183c0c741b95b292043e24f8db4124840ad6cd4 -size 108906 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/d988db7a59b060ff3406236569343e4f_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/d988db7a59b060ff3406236569343e4f_img.jpg deleted file mode 100644 index 81a88f54dcd8a5c8810b71c5a42d76e4ad2760ef..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/d988db7a59b060ff3406236569343e4f_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:502cea8f584c172a471f2459b199686c7809ed47147687918b4754a9d3065338 -size 28754 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/da5a8f834706c8119a47c5eb732feabe_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/da5a8f834706c8119a47c5eb732feabe_img.jpg deleted file mode 100644 index 90687ca208511e9db320e26e8ef3b94b1a426666..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/da5a8f834706c8119a47c5eb732feabe_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:c078d46d660b844e190a909556b93dd329b9369c333fdc1bd4a206e73e068c83 -size 59435 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/dae88eec6d1005984029b794ff8b7a9e_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/dae88eec6d1005984029b794ff8b7a9e_img.jpg deleted file mode 100644 index 0785938431bd8e709b0fe36a6f7f721d19a1215c..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/dae88eec6d1005984029b794ff8b7a9e_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:db3349a9e23f668669d516181f25141e66c2fde363af9d7e891ab59fa82f3587 -size 8627 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/db395493033edacd83e212049fd55715_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/db395493033edacd83e212049fd55715_img.jpg deleted file mode 100644 index c27d89992bfcfd1262e5569a6b5684f510e75fc7..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/db395493033edacd83e212049fd55715_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:f537ddd22f1fabce8b4559c8371cc1c1bb484ab10b105f61ed893ecc1a6dc41a -size 6603 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/dbfe5a97dc7e71fd9ae813d4bb865e29_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/dbfe5a97dc7e71fd9ae813d4bb865e29_img.jpg deleted file mode 100644 index dece9f9a25743a8f83c3b9398e4e6f25da319b25..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/dbfe5a97dc7e71fd9ae813d4bb865e29_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:6086d1bfd114f353d6f90e75d8904daffd0054248bb2a0ceb37b72d81cbcc1cb -size 23884 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/dc075f714892571abc5f74f1a76b80dc_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/dc075f714892571abc5f74f1a76b80dc_img.jpg deleted file mode 100644 index b3157698dacc15aab6ab1fe371e26ee4f5f6d680..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/dc075f714892571abc5f74f1a76b80dc_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:3997d7517c7aaddff5c3fce6645394c3606b733d8fce9c2c120f5d67e10dc25d -size 8824 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/df1e7f3029a414245762364710a6a63e_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/df1e7f3029a414245762364710a6a63e_img.jpg deleted file mode 100644 index 3e6db4e184515252e243da4461959f683ef28e03..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/df1e7f3029a414245762364710a6a63e_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:c429747bc64ebc7c579af1ceab65c78db4678d918bc26c7581337d0d7184d29f -size 11232 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/dfb76390c9b698db558781fdba549ab3_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/dfb76390c9b698db558781fdba549ab3_img.jpg deleted file mode 100644 index 3a9bf820ebc9bc4a44b1bd3bee7643c5460b79b1..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/dfb76390c9b698db558781fdba549ab3_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:823787de0db4ea84fef55b36bbc3670c8d9e25131aa809c5ad2893a8ab228b52 -size 30382 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/e09924f32278bb6a47909ae24bbea647_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/e09924f32278bb6a47909ae24bbea647_img.jpg deleted file mode 100644 index 2be1dfdcf9551e34ec9655eaa8f8022fa5794fcb..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/e09924f32278bb6a47909ae24bbea647_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:cf70e0e71a89a316fb9dc68ae3496a4d5bef95ea09e3b5f4a19d71d8d069312a -size 7652 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/e0eba715b26e99c0beececdd6112ee58_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/e0eba715b26e99c0beececdd6112ee58_img.jpg deleted file mode 100644 index 7f837c2019f3b34e0053f733ae4fd06a96081096..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/e0eba715b26e99c0beececdd6112ee58_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:2a329c3a2334e7252fb4d4dbe273d1c1ff20fb7e8764c3d498c6d822dbe93da5 -size 33004 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/e404de9a69c05473fbd6af28ee32311b_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/e404de9a69c05473fbd6af28ee32311b_img.jpg deleted file mode 100644 index d79b9181732edb1e6bddc117866e5c89d3f45498..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/e404de9a69c05473fbd6af28ee32311b_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:a47c3e4474b6481c7930e6da014bbf742b0a5259e58835b4b1ccf659be99f1a2 -size 96151 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/e579f4085bfb7766ce76d03036f97e36_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/e579f4085bfb7766ce76d03036f97e36_img.jpg deleted file mode 100644 index 4aa36d89b1cdaa31e7f24b3a468612f5cf2da9c7..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/e579f4085bfb7766ce76d03036f97e36_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:6cb82d947b185b21799c4d101303869ba35ac33d166f74b3666425312f8d2c22 -size 21454 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/e5df094ac4c47bcbef86dece9332a417_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/e5df094ac4c47bcbef86dece9332a417_img.jpg deleted file mode 100644 index ef2175ad0909fdd6344b9b068bc78b3907f6371a..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/e5df094ac4c47bcbef86dece9332a417_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:b32deb4c120f678b4cfa752ab98a40e492dd402ba838d1994d64ce61f4a4208d -size 27121 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/e5eedb1e90a22814f090917b3411be8f_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/e5eedb1e90a22814f090917b3411be8f_img.jpg deleted file mode 100644 index b0e96ece3f7034b0c18472c4d7cdb530202f16aa..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/e5eedb1e90a22814f090917b3411be8f_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:72a8b26d9143a5293b8b926df9f1a48170a0c923489c3a93a92f030b830b108c -size 69211 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/e67401bb970e10780dd4086d67c8195f_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/e67401bb970e10780dd4086d67c8195f_img.jpg deleted file mode 100644 index 7a7b82f1134611400fea0f895e50e02e9be38707..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/e67401bb970e10780dd4086d67c8195f_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:eb227d26aa3ecfd56fbdbebfa65f9dd7a6816d1bb9d955e1cbedbbde7730e72e -size 23915 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/e7b45a567404ef205acf9b0ae262216f_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/e7b45a567404ef205acf9b0ae262216f_img.jpg deleted file mode 100644 index 8e0def898ffa6d8822e64d87e9178f11f1b63ce1..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/e7b45a567404ef205acf9b0ae262216f_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:f4ae396de21f63335eab76c952eec3a9e11f1afd16438ab4c1a670f4c7811458 -size 62980 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/e96884b4726abd1ef715e32b100b05e6_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/e96884b4726abd1ef715e32b100b05e6_img.jpg deleted file mode 100644 index 4a341038290d3a4bebe04cbace75c131a07b5e35..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/e96884b4726abd1ef715e32b100b05e6_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:d503930588ecfd0bc7fdb68fe7befe6c5ff55989168ff85d4d7d18e882eb00d8 -size 6121 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/e9f6a9e6beb9ae97b392bf38b93ad748_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/e9f6a9e6beb9ae97b392bf38b93ad748_img.jpg deleted file mode 100644 index cd3064412e9c80cca624d1172a4f82793a720879..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/e9f6a9e6beb9ae97b392bf38b93ad748_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:ae1ae20d61f3e769da55d7ed201a95cd4c9ea132b16a96fd6fb196dd93505ded -size 95274 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/ea3fc2de81f3b1ff5c2f12cdeadcf831_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/ea3fc2de81f3b1ff5c2f12cdeadcf831_img.jpg deleted file mode 100644 index b431bac6e964adbb597a1779c2b0f2c54b0abc00..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/ea3fc2de81f3b1ff5c2f12cdeadcf831_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:fb4ca0438362bc9c1d0bd446f6e21cb44070e848a4ab4a17c9c6a4876be5e712 -size 13765 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/ea4d1f05669860c1f910e6cb1e7a22b6_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/ea4d1f05669860c1f910e6cb1e7a22b6_img.jpg deleted file mode 100644 index d817d59d96896e0f9d73d10930632552196252ba..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/ea4d1f05669860c1f910e6cb1e7a22b6_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:dcd14ab239d85a885bc0ea9532f7dd19f96a19f2b6c9971a9add6ee6793cc6d7 -size 108594 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/ea6b9ace0ed0694c2ce8dcdb8b5ea52b_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/ea6b9ace0ed0694c2ce8dcdb8b5ea52b_img.jpg deleted file mode 100644 index 4d6819c229f7cfd27fd6c7d106301f2cbb398ed2..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/ea6b9ace0ed0694c2ce8dcdb8b5ea52b_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:e42b7dca166f905d936ba24097f00680ffdadb8f90a1718363b931fce51bc5e9 -size 136890 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/ea72687397bac53eb690650f371bfd63_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/ea72687397bac53eb690650f371bfd63_img.jpg deleted file mode 100644 index 2c1b805df0c1cd7896f75c65d078ae38bd028c24..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/ea72687397bac53eb690650f371bfd63_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:5d89f8d056b7a4e331460c6493c7fdb505ce2a12f6186bd73826d9e26debd3be -size 21277 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/eaa8ee2530516c47ef4dcc8a5db20fd0_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/eaa8ee2530516c47ef4dcc8a5db20fd0_img.jpg deleted file mode 100644 index c76729f85ffab56f447a96482ee00d2404146a51..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/eaa8ee2530516c47ef4dcc8a5db20fd0_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:2d777421c8064ffb176549a27b1fe70191b8febc37d9712b3ba93d27e95fad4e -size 21500 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/eaaf53ac65d77e590778a391a25b92e4_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/eaaf53ac65d77e590778a391a25b92e4_img.jpg deleted file mode 100644 index 32c479ff5f3c6c104a06dacf1ba0bcd611f70291..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/eaaf53ac65d77e590778a391a25b92e4_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:28fa7288091bac9415b2fcf65f421ea253555f7af1930be023b935356138f16a -size 16847 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/eb8cac9fb65d601ab50405472e408156_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/eb8cac9fb65d601ab50405472e408156_img.jpg deleted file mode 100644 index 214e2b0a903988bf54561e082904822c3ffbd2e5..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/eb8cac9fb65d601ab50405472e408156_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:84b7eab012e4ef208f97b203854faba091f54c2a051c792d0d0a54ace490c760 -size 97070 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/ec27906099ab5da32f29b89d2764cf0c_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/ec27906099ab5da32f29b89d2764cf0c_img.jpg deleted file mode 100644 index 19b2fdc131a471038d640f048c5c1fe06b2793c3..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/ec27906099ab5da32f29b89d2764cf0c_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:24961b74ca4453d0341f628a18112a0d0358f3644d0735c91dd6774481632226 -size 16720 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/eda1a0f033926f48febc095bce470c58_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/eda1a0f033926f48febc095bce470c58_img.jpg deleted file mode 100644 index 55eb13379cc6e84d09aab6b6058a2f1fc2734703..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/eda1a0f033926f48febc095bce470c58_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:d001dcf846ca29dd5d9804d00076587b523ab5466c732612072d27b83667fd16 -size 158344 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/efcb78ce7df315911219258bc2132f8c_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/efcb78ce7df315911219258bc2132f8c_img.jpg deleted file mode 100644 index e6ae7940a10ec5bd3a5e799a39d84086689e09ae..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/efcb78ce7df315911219258bc2132f8c_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:24d5ddbe2eef950aeff40b3c8e093abbc83d84bf6833f2b6ce93ab47ad14c339 -size 24561 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/f01f6190861749ff3bb7749fd05d4a18_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/f01f6190861749ff3bb7749fd05d4a18_img.jpg deleted file mode 100644 index 6dd7561336a8843c84a2448dd4c6a3c1d6b70f7f..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/f01f6190861749ff3bb7749fd05d4a18_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:969df82e82aeea4d8786851b887dc907dc8e1073522fae7bca7652f9ca135764 -size 14054 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/f2a6c46fa05d5588ce4c6e1a3ee194c7_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/f2a6c46fa05d5588ce4c6e1a3ee194c7_img.jpg deleted file mode 100644 index ede21a12569ddab7c974c3416ae1e2103cba25bf..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/f2a6c46fa05d5588ce4c6e1a3ee194c7_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:c926b8ad1815dcde23c390c157c8fb7aa8b69af1dc1f4f27a7cc3c0a3899aa36 -size 143171 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/f2a96e73ee1821c72d24ae4e0a4d7c46_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/f2a96e73ee1821c72d24ae4e0a4d7c46_img.jpg deleted file mode 100644 index d18c15ab400e14f16a644104a2f539d9b2921f7b..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/f2a96e73ee1821c72d24ae4e0a4d7c46_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:53c91fade9bb1aa3c775953d4af32789cf5812ac2305805673069379d91ab543 -size 17139 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/f2e1a8f6118f3a062702aae017e04753_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/f2e1a8f6118f3a062702aae017e04753_img.jpg deleted file mode 100644 index fae22165ed8f614fdbee1d06699a94629877c799..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/f2e1a8f6118f3a062702aae017e04753_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:ba0536da32909ea1881b84beb5fe1639a2198ad1b9743a877ef9c221eebc5902 -size 82552 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/f3d0615dd9e87088a29786cc6a1c8a35_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/f3d0615dd9e87088a29786cc6a1c8a35_img.jpg deleted file mode 100644 index 2b93865ba60ff979dc7da7297f00b9a4214b9ca3..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/f3d0615dd9e87088a29786cc6a1c8a35_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:4eed153d641ccdaa081fe4103afc6e64d9e3f5b20bc15695312acffabfdab84d -size 14225 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/f4b570ddd089f54943d46e9f8776f9f9_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/f4b570ddd089f54943d46e9f8776f9f9_img.jpg deleted file mode 100644 index ab855d312d8819a211dd937848173145324abe77..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/f4b570ddd089f54943d46e9f8776f9f9_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:259515982e315fa91daa073b02fe1f47f98dca064237ee7ffeb06efe47f5a2ec -size 22013 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/f4b7c84516339d37b6c63b18287d1493_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/f4b7c84516339d37b6c63b18287d1493_img.jpg deleted file mode 100644 index fbbb10da413d72f7770c806445043c4771e0759e..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/f4b7c84516339d37b6c63b18287d1493_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:d531274068dcfd63c184029155c0d86074705abc65aa47fd0a5f8bf449eaec3e -size 156702 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/f4bcd6496e0add3544afc0a70f7973ec_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/f4bcd6496e0add3544afc0a70f7973ec_img.jpg deleted file mode 100644 index b211b7618d89266a34619f46d06658db9aa6290b..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/f4bcd6496e0add3544afc0a70f7973ec_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:e16a3e5b0eb2569a67ec50aea7aa67c5f274dd1d88930c8b9236e77b2f70d8c0 -size 12558 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/f512ae9c630f2fb53197fa77a1bda0e8_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/f512ae9c630f2fb53197fa77a1bda0e8_img.jpg deleted file mode 100644 index 2c88b9f73ea25fd3c2c078013a28d4986727848f..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/f512ae9c630f2fb53197fa77a1bda0e8_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:8f2a2de94574e737f51cd415c4cf20616b02adf3dea0f1d0c7b6e94079406852 -size 152985 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/f61d0925551545b5938b3a4d1bbf63c3_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/f61d0925551545b5938b3a4d1bbf63c3_img.jpg deleted file mode 100644 index 446ec93b9e8095abd00543970e79c3c8948bfe25..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/f61d0925551545b5938b3a4d1bbf63c3_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:8b94e6b3a402711823bc805e005a012cef213d5464cab3de7dfd972868e15daa -size 7108 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/f6dcf82b673244b5b8c95616ca0d0556_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/f6dcf82b673244b5b8c95616ca0d0556_img.jpg deleted file mode 100644 index 8159f0d0f06896685d9e9a39fd44bfd4b10a3170..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/f6dcf82b673244b5b8c95616ca0d0556_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:0ae5746e8d801ddf5730e496610be8bd144779aa52e4ed3c3557a97a5f29e207 -size 108884 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/f79cb254efa2e37d7facb055cf90086e_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/f79cb254efa2e37d7facb055cf90086e_img.jpg deleted file mode 100644 index 216cd6681ffda595b8f9d4d80d73fce58f36cf6d..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/f79cb254efa2e37d7facb055cf90086e_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:037db1db7c4ebe286e925f779510b95559eb5fe5c4308471fde7a215b8105d1d -size 9837 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/f863cb8837fe502a913bc2be8d1afd8a_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/f863cb8837fe502a913bc2be8d1afd8a_img.jpg deleted file mode 100644 index 4a8828ad55b82802b03a4a8c58fd0d33b29a614d..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/f863cb8837fe502a913bc2be8d1afd8a_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:901984cb83d5404ba27ad97e52af9d585c42e13c95b43c71df28c38e982fe35a -size 14248 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/f88e403864388f59871586472847bbd0_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/f88e403864388f59871586472847bbd0_img.jpg deleted file mode 100644 index 2528b85af6924a443a35dfef110dbaaffd59f61f..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/f88e403864388f59871586472847bbd0_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:bad2c364841ddad76a2c6823db94f72b91af8d0c18b432634fb8906badbef959 -size 26418 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/f92133ff7727978a12d89b8426245b85_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/f92133ff7727978a12d89b8426245b85_img.jpg deleted file mode 100644 index 2b06523626ecddfb0e8ce1c382f66f545d987c24..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/f92133ff7727978a12d89b8426245b85_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:4fc73549facc52926c72c065532d9ad6843e86c054fbfe632a0597caa13ef279 -size 79963 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/f96a0911100a9ea2097d9d2e88a9ca3e_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/f96a0911100a9ea2097d9d2e88a9ca3e_img.jpg deleted file mode 100644 index 2959763c22620eeaed5b36b0f78f40061734aa9d..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/f96a0911100a9ea2097d9d2e88a9ca3e_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:47e5c49760200c6b72d025f0b4b533b706bf6ade95f7c2bd0ae558b3d0ddf069 -size 9844 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/f98ddc2253ad41b4130f6042e77f1460_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/f98ddc2253ad41b4130f6042e77f1460_img.jpg deleted file mode 100644 index 45db8a65fa82b9f1e9423eedd05ec7bbc755eaab..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/f98ddc2253ad41b4130f6042e77f1460_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:a25f1960856e5c6d72a243affcd08e6b7056c0c3828a4f329c96f67023487360 -size 20389 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/fd3cbb53e991f8209ba17b398f426e13_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/fd3cbb53e991f8209ba17b398f426e13_img.jpg deleted file mode 100644 index 7c317372bcebd6114381b60897cbe02a0e7b9101..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/fd3cbb53e991f8209ba17b398f426e13_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:4e02b9fe8e169db601a2b4f6d8f93186e4c2555f1ebac5ee3adc598b54730f8e -size 39806 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/fd4b2ee19b709bcb11190893e23f8453_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/fd4b2ee19b709bcb11190893e23f8453_img.jpg deleted file mode 100644 index 9b0d9fcd083d21e0f994bbd61f22eb0b7ddf76bd..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/fd4b2ee19b709bcb11190893e23f8453_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:d9882e087285f2840f4e9b5373968d0de65f53f13512ba29321dc7c2fa437bd6 -size 91185 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/fd6100880c96880a39d994338c9d5f36_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/fd6100880c96880a39d994338c9d5f36_img.jpg deleted file mode 100644 index c925b2afabf894dd2f703da76bfc1614586c7144..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/fd6100880c96880a39d994338c9d5f36_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:6e93224f26b8b3b4e4d2c831927b1e6e9912cbc341c1688a9af388d2c77a09f3 -size 39037 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/fda85db2e355bb8e3edcd5a74bf3d673_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/fda85db2e355bb8e3edcd5a74bf3d673_img.jpg deleted file mode 100644 index 6cb22186af99a7e179c5f4d881b80d73e1f001fc..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/fda85db2e355bb8e3edcd5a74bf3d673_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:2e5bc1cacad20d9ab66987d08244b611e81c2db1bf17056b6fdc70486364cfc4 -size 65794 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/ff86a9199e2ee52e0a198605699d277d_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/ff86a9199e2ee52e0a198605699d277d_img.jpg deleted file mode 100644 index d8466524283e814ab6291283056821a7fd0b2cd0..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/ff86a9199e2ee52e0a198605699d277d_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:e7d497ad11aa993dd86c87badcd4b59e8fca51f41764bff18d48828d72a18b28 -size 48123 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/ffd430265e73d833a0aa30a5dd8261e3_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/ffd430265e73d833a0aa30a5dd8261e3_img.jpg deleted file mode 100644 index 34809f7c60ca88e52b593fac739bb3c01b5cef98..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/ffd430265e73d833a0aa30a5dd8261e3_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:37ab39097dedc205ef422147deb4cf30bbcaa8fb2ce3183db5323f1152266082 -size 185077 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/fffcd82cf1347760ecef4f2db3059360_img.jpg b/marked/G/T-REC-G.798-202309-I_PDF-E/fffcd82cf1347760ecef4f2db3059360_img.jpg deleted file mode 100644 index 34dae8b2ab917a8604d60bbf2c722bc6cb9a8bdf..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/fffcd82cf1347760ecef4f2db3059360_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:3a1d57ff0199c9274f614df559cdba0ec51c7f9ab3a5245537fd95bc3f7904bf -size 106679 diff --git a/marked/G/T-REC-G.798-202309-I_PDF-E/raw.md b/marked/G/T-REC-G.798-202309-I_PDF-E/raw.md deleted file mode 100644 index 32ff87f00a9a30a91a467d3d997eb52be074bf3d..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.798-202309-I_PDF-E/raw.md +++ /dev/null @@ -1,15298 +0,0 @@ - - -# Recommendation - -## **ITU-T G.798 (09/2023)** - -SERIES G: Transmission systems and media, digital systems and networks - -Digital terminal equipments – Other terminal equipment - ---- - -# **Characteristics of optical transport network hierarchy equipment functional blocks** - -![ITU logo](84a1d09fb489061482111515543b60dc_img.jpg) - -The logo of the International Telecommunication Union (ITU) is located in the bottom right corner. It features a blue globe with white lines representing latitude and longitude, and the letters 'ITU' in a bold, blue, sans-serif font superimposed on the globe. - -ITU logo - -## ITU-T G-SERIES RECOMMENDATIONS **Transmission systems and media, digital systems and networks** - -| | | -|----------------------------------------------------------------------------------------------------------------------------------------------|--------------------| -| INTERNATIONAL TELEPHONE CONNECTIONS AND CIRCUITS | G.100-G.199 | -| GENERAL CHARACTERISTICS COMMON TO ALL ANALOGUE CARRIER-TRANSMISSION SYSTEMS | G.200-G.299 | -| INDIVIDUAL CHARACTERISTICS OF INTERNATIONAL CARRIER TELEPHONE SYSTEMS ON METALLIC LINES | G.300-G.399 | -| GENERAL CHARACTERISTICS OF INTERNATIONAL CARRIER TELEPHONE SYSTEMS ON RADIO-RELAY OR SATELLITE LINKS AND INTERCONNECTION WITH METALLIC LINES | G.400-G.449 | -| COORDINATION OF RADIOTELEPHONY AND LINE TELEPHONY | G.450-G.499 | -| TRANSMISSION MEDIA AND OPTICAL SYSTEMS CHARACTERISTICS | G.600-G.699 | -| DIGITAL TERMINAL EQUIPMENTS | G.700-G.799 | -| General | G.700-G.709 | -| Coding of voice and audio signals | G.710-G.729 | -| Principal characteristics of primary multiplex equipment | G.730-G.739 | -| Principal characteristics of second order multiplex equipment | G.740-G.749 | -| Principal characteristics of higher order multiplex equipment | G.750-G.759 | -| Principal characteristics of transcoder and digital multiplication equipment | G.760-G.769 | -| Operations, administration and maintenance features of transmission equipment | G.770-G.779 | -| Principal characteristics of multiplexing equipment for the synchronous digital hierarchy | G.780-G.789 | -| Other terminal equipment | G.790-G.799 | -| DIGITAL NETWORKS | G.800-G.899 | -| DIGITAL SECTIONS AND DIGITAL LINE SYSTEM | G.900-G.999 | -| MULTIMEDIA QUALITY OF SERVICE AND PERFORMANCE – GENERIC AND USER-RELATED ASPECTS | G.1000-G.1999 | -| TRANSMISSION MEDIA CHARACTERISTICS | G.6000-G.6999 | -| DATA OVER TRANSPORT – GENERIC ASPECTS | G.7000-G.7999 | -| PACKET OVER TRANSPORT ASPECTS | G.8000-G.8999 | -| ACCESS NETWORKS | G.9000-G.9999 | - -*For further details, please refer to the list of ITU-T Recommendations.* - -# Recommendation ITU-T G.798 - -# Characteristics of optical transport network hierarchy equipment functional blocks - -## Summary - -Recommendation ITU-T G.798 specifies both the components and the methodology that should be used in order to specify the optical transport network (OTN) functionality of network elements; it does not specify individual optical transport network equipment. - -Edition 7.0 of this Recommendation includes the text of Amendments 1, 2, 3 and 4, as well as Corrigenda 1 and 2 to Edition 6.0 of this Recommendation, the addition of the ODUkP to ETH adaptation function using Idle Mapping Procedure (IMP) and a number of editorial enhancements. - -## History \* - -| Edition | Recommendation | Approval | Study Group | Unique ID | -|---------|---------------------------|------------|-------------|--------------------| -| 1.0 | ITU-T G.798 | 2002-01-06 | 15 | 11.1002/1000/5604 | -| 1.1 | ITU-T G.798 (2002) Amd. 1 | 2002-06-13 | 15 | 11.1002/1000/6057 | -| 2.0 | ITU-T G.798 | 2004-06-13 | 15 | 11.1002/1000/7329 | -| 3.0 | ITU-T G.798 | 2006-12-14 | 15 | 11.1002/1000/8983 | -| 3.1 | ITU-T G.798 (2006) Amd. 1 | 2008-12-12 | 15 | 11.1002/1000/9669 | -| 3.2 | ITU-T G.798 (2006) Cor. 1 | 2009-01-13 | 15 | 11.1002/1000/9647 | -| 4.0 | ITU-T G.798 | 2010-10-22 | 15 | 11.1002/1000/10877 | -| 4.1 | ITU-T G.798 (2010) Cor. 1 | 2011-04-13 | 15 | 11.1002/1000/11117 | -| 4.2 | ITU-T G.798 (2010) Amd. 1 | 2011-07-22 | 15 | 11.1002/1000/11116 | -| 4.3 | ITU-T G.798 (2010) Cor. 2 | 2012-02-13 | 15 | 11.1002/1000/11488 | -| 4.4 | ITU-T G.798 (2010) Amd. 2 | 2012-04-06 | 15 | 11.1002/1000/11487 | -| 5.0 | ITU-T G.798 | 2012-12-22 | 15 | 11.1002/1000/11778 | -| 5.1 | ITU-T G.798 (2012) Amd. 1 | 2014-05-14 | 15 | 11.1002/1000/12179 | -| 5.2 | ITU-T G.798 (2012) Amd. 2 | 2015-01-13 | 15 | 11.1002/1000/12367 | -| 5.3 | ITU-T G.798 (2012) Cor. 1 | 2015-08-13 | 15 | 11.1002/1000/12529 | -| 5.4 | ITU-T G.798 (2012) Amd. 3 | 2017-01-12 | 15 | 11.1002/1000/13081 | -| 6.0 | ITU-T G.798 | 2017-12-07 | 15 | 11.1002/1000/13335 | -| 6.1 | ITU-T G.798 (2017) Cor. 1 | 2018-08-06 | 15 | 11.1002/1000/13524 | -| 6.2 | ITU-T G.798 (2017) Amd. 1 | 2018-08-22 | 15 | 11.1002/1000/13518 | -| 6.3 | ITU-T G.798 (2017) Amd. 2 | 2019-12-07 | 15 | 11.1002/1000/13996 | -| 6.4 | ITU-T G.798 (2017) Amd. 3 | 2021-01-13 | 15 | 11.1002/1000/14520 | -| 6.5 | ITU-T G.798 (2017) Cor. 2 | 2021-05-29 | 15 | 11.1002/1000/14621 | -| 6.6 | ITU-T G.798 (2017) Amd. 4 | 2022-05-22 | 15 | 11.1002/1000/14896 | -| 7.0 | ITU-T G.798 | 2023-09-06 | 15 | 11.1002/1000/15552 | - -## Keywords - -Atomic functions, equipment functional blocks, functional specification, optical transport network, OTN. - ---- - -\* To access the Recommendation, type the URL in the address field of your web browser, followed by the Recommendation's unique ID. - -## FOREWORD - -The International Telecommunication Union (ITU) is the United Nations specialized agency in the field of telecommunications, information and communication technologies (ICTs). The ITU Telecommunication Standardization Sector (ITU-T) is a permanent organ of ITU. ITU-T is responsible for studying technical, operating and tariff questions and issuing Recommendations on them with a view to standardizing telecommunications on a worldwide basis. - -The World Telecommunication Standardization Assembly (WTSA), which meets every four years, establishes the topics for study by the ITU-T study groups which, in turn, produce Recommendations on these topics. - -The approval of ITU-T Recommendations is covered by the procedure laid down in WTSA Resolution 1. - -In some areas of information technology which fall within ITU-T's purview, the necessary standards are prepared on a collaborative basis with ISO and IEC. - -## NOTE - -In this Recommendation, the expression "Administration" is used for conciseness to indicate both a telecommunication administration and a recognized operating agency. - -Compliance with this Recommendation is voluntary. However, the Recommendation may contain certain mandatory provisions (to ensure, e.g., interoperability or applicability) and compliance with the Recommendation is achieved when all of these mandatory provisions are met. The words "shall" or some other obligatory language such as "must" and the negative equivalents are used to express requirements. The use of such words does not suggest that compliance with the Recommendation is required of any party. - -## INTELLECTUAL PROPERTY RIGHTS - -ITU draws attention to the possibility that the practice or implementation of this Recommendation may involve the use of a claimed Intellectual Property Right. ITU takes no position concerning the evidence, validity or applicability of claimed Intellectual Property Rights, whether asserted by ITU members or others outside of the Recommendation development process. - -As of the date of approval of this Recommendation, ITU had received notice of intellectual property, protected by patents/software copyrights, which may be required to implement this Recommendation. However, implementers are cautioned that this may not represent the latest information and are therefore strongly urged to consult the appropriate ITU-T databases available via the ITU-T website at . - -© ITU 2024 - -All rights reserved. No part of this publication may be reproduced, by any means whatsoever, without the prior written permission of ITU. - -## Table of Contents - -###### Page - -| | | | -|------|-------------------------------------------------------------------------------------------------------|----| -| 1 | Scope ..... | 1 | -| 2 | References..... | 6 | -| 3 | Definitions ..... | 8 | -| 3.1 | Terms defined elsewhere ..... | 8 | -| 3.2 | Terms defined in this Recommendation..... | 10 | -| 4 | Abbreviations and acronyms ..... | 11 | -| 5 | Conventions ..... | 19 | -| 6 | Supervision ..... | 20 | -| 6.1 | Alarm reporting control..... | 20 | -| 6.2 | Defects..... | 20 | -| 6.3 | Consequent actions..... | 31 | -| 6.4 | Defect correlations..... | 31 | -| 6.5 | Performance filters ..... | 32 | -| 7 | Information flow across reference points ..... | 33 | -| 8 | Generic processes ..... | 34 | -| 8.1 | Blank clause..... | 34 | -| 8.2 | Alignment processes..... | 34 | -| 8.3 | Signal quality supervision ..... | 38 | -| 8.4 | Blank clause..... | 40 | -| 8.5 | Forward error correction (FEC) processing ..... | 40 | -| 8.6 | Trail trace identifier (TTI) processing..... | 42 | -| 8.7 | Payload structure indication (PSI) acceptance processes..... | 42 | -| 8.8 | Status information (STAT) acceptance process ..... | 44 | -| 8.9 | Generic AIS generation and detection..... | 44 | -| 8.10 | Generic layer fault processing..... | 44 | -| 8.11 | OTSi modulator and demodulator processes..... | 47 | -| 8.12 | FlexO maintenance signal information (MAINT) acceptance process ..... | 48 | -| 8.13 | FlexO instance signals interleaving processes ..... | 48 | -| 8.14 | FlexOsec processing for encryption and authentication of fixed-length
FlexO frame structures ..... | 48 | -| 9 | OTS-O layer functions..... | 53 | -| 9.1 | Connection functions..... | 53 | -| 9.2 | Termination functions ..... | 53 | -| 9.3 | Adaptation functions ..... | 58 | -| 10 | OMS-O layer functions ..... | 60 | -| 10.1 | Connection functions..... | 61 | -| 10.2 | Termination functions ..... | 61 | -| 10.3 | Adaptation functions ..... | 66 | - -| | | | -|---------|----------------------------------------------------------------------------------|-----| -| 10.4 | Sub-layer functions..... | 73 | -| 11 | OSC (layer) functions ..... | 73 | -| 11.1 | Connection functions..... | 76 | -| 11.2 | Termination functions ..... | 76 | -| 11.3 | Adaptation functions ..... | 77 | -| 12 | OTSiA and OCh (layer) functions..... | 81 | -| 12.1 | Connection functions..... | 83 | -| 12.2 | Termination functions ..... | 89 | -| 12.3 | Adaptation functions ..... | 99 | -| 12.4 | Sub-layer functions..... | 99 | -| 13 | OTU (layer) functions..... | 100 | -| 13.1 | Connection functions..... | 101 | -| 13.2 | Termination functions ..... | 101 | -| 13.3 | Adaptation functions ..... | 114 | -| 13.4 | Sub-layer functions..... | 127 | -| 14 | ODU (layer) functions ..... | 127 | -| 14.1 | Connection functions..... | 130 | -| 14.2 | Termination functions ..... | 140 | -| 14.3 | Adaptation functions ..... | 147 | -| 14.4 | COMMS functions ..... | 290 | -| 14.5 | Sub-layer functions..... | 297 | -| 14.6 | Blank clause..... | 318 | -| 15 | FlexO functions ..... | 318 | -| 15.1 | Connection functions..... | 321 | -| 15.2 | Termination functions ..... | 321 | -| 15.3 | Adaptation functions ..... | 328 | -| 15.4 | Compound functions ..... | 348 | -| 16 | OTSi adaptation functions ..... | 352 | -| 16.1 | OTSi to OTUk or OTUk-RS adaptation function (OTSi/OTUk_A or OTSi/OTUk-RS_A)..... | 352 | -| 16.2 | OTSi to OTUkV adaptation function (OTSi/OTUkV_A)..... | 361 | -| 16.3 | OTSiG to OTUk adaptation function (OTSiG/OTUk_A)..... | 364 | -| 16.4 | OTSiG to OTUkV adaptation function (OTSiG/OTUkV_A)..... | 371 | -| 16.5 | OTSi to OTUCn adaptation function (OTSi/OTUCn_A)..... | 374 | -| 16.6 | OTSiG to OTUCn adaptation function (OTSiG/OTUCn_A)..... | 376 | -| 16.7 | OTSi to FlexO-x adaptation function (OTSi/FlexO-x_A)..... | 378 | -| 16.8 | OTSiG to FlexO-x adaptation function (OTSiG/FlexO-x_A)..... | 404 | -| 16.9 | OTSi to OSC adaptation function (OTSi/OSC_A)..... | 412 | -| 17 | Media element ..... | 414 | -| Annex A | Optical section (OSx) and constant bit rate (CBRx) layer functions ..... | 417 | - -| | | | -|---------------|-------------------------------------------------------------------------------------------------------------|-----| -| A.1 | Connection functions..... | 418 | -| A.2 | Termination functions ..... | 418 | -| A.3 | Adaptation functions ..... | 421 | -| Annex B | Generic FlexE and FlexO supervision and processes..... | 434 | -| B.1 | Supervision ..... | 434 | -| B.2 | Generic processes ..... | 435 | -| Appendix I | Applications and functional diagrams ..... | 437 | -| I.1 | Transparent CBRx tributary interface port with optional SDH RS non-intrusive monitor on OTN equipment ..... | 437 | -| I.2 | OTU tributary interface port on OTN equipment ..... | 438 | -| I.3 | Selectable CBRx/OTUk tributary interface port on OTN equipment ..... | 440 | -| I.4 | OTU interface ports on non-OTN equipment ..... | 442 | -| I.5 | Multi-channel interface port with 3-R regeneration functionality for an ODUk connection function ..... | 443 | -| Appendix II | Blank appendix ..... | 445 | -| Appendix III | Performance of processes ..... | 446 | -| III.1 | Introduction ..... | 446 | -| III.2 | OTUk frame alignment process..... | 446 | -| III.3 | STAT acceptance process and related defect detection ..... | 448 | -| III.4 | OTU dIAE, OTU dBDI, ODU dBDI detection ..... | 449 | -| III.5 | PT acceptance process and ODUPdPLM detection ..... | 450 | -| III.6 | Generic AIS and OTUk-AIS (k = 1, 2, 3) detection..... | 451 | -| III.7 | OTU and ODUT dBIAE detection process ..... | 452 | -| Appendix IV | TTI processing examples ..... | 454 | -| IV.1 | Example 1 ..... | 454 | -| IV.2 | Example 2 ..... | 455 | -| Appendix V | Blank appendix ..... | 459 | -| Appendix VI | Blank appendix ..... | 460 | -| Appendix VII | Examples of media elements ..... | 461 | -| Appendix VIII | Trail protection of OTS-O/OMS-O layers in support of media layer protection ..... | 463 | -| VIII.1 | OxS-O trail protection sub-layer functions ..... | 463 | -| Appendix IX | Examples of compound adaptation functions without SM monitoring ..... | 470 | -| Bibliography | ..... | 472 | - - - -# Characteristics of optical transport network hierarchy equipment functional blocks - -# 1 Scope - -This Recommendation covers the functional requirements of optical transport network functionality within equipment. - -This Recommendation uses the specification methodology defined in [ITU-T G.806], in general for transport network equipment, and is based on the architecture of optical transport networks defined in [ITU-T G.872] and the interfaces for optical transport networks defined in [ITU-T G.709]. The description is generic and no particular physical partitioning of functions is implied. The input/output information flows associated with the functional blocks serve for defining the functions of the blocks and are considered to be conceptual, not physical. - -The functionality defined in this Recommendation can be applied at user-to-network interfaces (UNIs) and network node interfaces (NNIs) of the optical transport network. It is recognized that for interfaces used within optical subnetworks, aspects of the interface are optical technology dependent and subject to change as technology progresses. Therefore, optical-technology dependent aspects (for transverse compatibility) are not defined for functional blocks used for these interfaces to allow for technology changes. The overhead processing functionality necessary for operations and management of optical subnetworks is defined. - -Not every functional block defined in this Recommendation is required for every application. Different subsets of functional blocks from this Recommendation and others (e.g., [ITU-T G.783]) may be assembled in different ways according to the combination rules given in these Recommendations to provide a variety of different capabilities. Network operators and equipment suppliers may choose which functions must be implemented for each application. - -The internal structure of the implementation of this functionality (equipment design) need not be identical to the structure of the functional model, as long as all the details of the externally observable behaviour comply with the equipment functional specification (EFS). - -Equipment developed prior to the production of this Recommendation may not comply in all details with this Recommendation. - -Equipment which is normally stated to be compliant with this Recommendation may not fulfil all the requirements in the case that it is interworking with old equipment that is not compliant with this Recommendation. - -Figures 1-1, 1-2, 1-3, 1-4, and 1-5 present the set of atomic functions associated with traffic signal transport. The functions for the processing of communication channels (COMMS) are not shown in these figures in order to reduce the complexity of the figures. For the COMMS functions, refer to the specific layer network descriptions. - -![Figure 1-1: OTN atomic functions specific for the single and multi-channel interface. The diagram shows five configurations. The first three are 'Single-channel interfaces': 1) OTUk_(T)CP connects to OTSi/OTUk, which connects to OTSi and NC, which then connect to a Media element. 2) OTUCn_(T)CP connects to OTSiG/OTUCn, which connects to multiple OTSi (labeled 1 to m) and NC, which then connect to a Media element. 3) FlexO-x_(T)CP connects to OTSiG/FlexO-x, which connects to multiple OTSi (labeled 1 to m) and NC, which then connect to a Media element. The last two are 'Multi-channel interface': 4) OTUk_(T)CP connects to OTSi/OTUk, which connects to OTSi and NC, which then connect to a wide Media element. 5) OTUCn_(T)CP connects to OTSiG/OTUCn, which connects to multiple OTSi (labeled 1 to m) and NC, which then connect to the same wide Media element. A legend indicates 'NC = Not connected' and the diagram is labeled 'G.798(23)_F1-1'.](a5ee5c23b6dc52ec1d724b76d5a5f58f_img.jpg) - -Figure 1-1: OTN atomic functions specific for the single and multi-channel interface. The diagram shows five configurations. The first three are 'Single-channel interfaces': 1) OTUk\_(T)CP connects to OTSi/OTUk, which connects to OTSi and NC, which then connect to a Media element. 2) OTUCn\_(T)CP connects to OTSiG/OTUCn, which connects to multiple OTSi (labeled 1 to m) and NC, which then connect to a Media element. 3) FlexO-x\_(T)CP connects to OTSiG/FlexO-x, which connects to multiple OTSi (labeled 1 to m) and NC, which then connect to a Media element. The last two are 'Multi-channel interface': 4) OTUk\_(T)CP connects to OTSi/OTUk, which connects to OTSi and NC, which then connect to a wide Media element. 5) OTUCn\_(T)CP connects to OTSiG/OTUCn, which connects to multiple OTSi (labeled 1 to m) and NC, which then connect to the same wide Media element. A legend indicates 'NC = Not connected' and the diagram is labeled 'G.798(23)\_F1-1'. - -**Figure 1-1 – OTN atomic functions specific for the single and multi-channel interface** - -![Figure 1-2: OTN atomic functions specific for the multi-channel interface with management. The diagram shows a multi-channel interface configuration. At the top, OTUk_(T)CP and OTUCn_(T)CP connect to a block labeled OTSi[G]/OTUk and OTSi[G]/OTUCn. This block connects to two OTSi blocks. These OTSi blocks connect to an OTSiG block (labeled 1 to m), which in turn connects to an OTSiA or OCh block. This block connects to a Media element. To the right, the OTSi[G]/OTUk and OTSi[G]/OTUCn block also connects to an OTSiG-O/OCh-O block, which connects to an OTSiA|OCh block. This OTSiA|OCh block connects to a dashed box labeled OMS-O/OTSiG/OCh-O. There are also dashed lines labeled AI_TSF-P and AI_TSF-O between the top block and the OTSiG-O/OCh-O block. The diagram is labeled 'Multi-channel interfaces' and 'G.798(23)_F1-2'.](cfda9df1319e04207eb28bcefd1dab7b_img.jpg) - -Figure 1-2: OTN atomic functions specific for the multi-channel interface with management. The diagram shows a multi-channel interface configuration. At the top, OTUk\_(T)CP and OTUCn\_(T)CP connect to a block labeled OTSi[G]/OTUk and OTSi[G]/OTUCn. This block connects to two OTSi blocks. These OTSi blocks connect to an OTSiG block (labeled 1 to m), which in turn connects to an OTSiA or OCh block. This block connects to a Media element. To the right, the OTSi[G]/OTUk and OTSi[G]/OTUCn block also connects to an OTSiG-O/OCh-O block, which connects to an OTSiA|OCh block. This OTSiA|OCh block connects to a dashed box labeled OMS-O/OTSiG/OCh-O. There are also dashed lines labeled AI\_TSF-P and AI\_TSF-O between the top block and the OTSiG-O/OCh-O block. The diagram is labeled 'Multi-channel interfaces' and 'G.798(23)\_F1-2'. - -**Figure 1-2 – OTN atomic functions specific for the multi-channel interface with management** - -NOTE 1 – OCh is used when the non-associated overhead is OCh-O; OTSiA is used when it is OTSiG-O. - NOTE 2 – An OTSiG has one or more members. A single-member OTSiG may be called 'OTSi'. - -![Diagram of OTN atomic functions for non-associated overhead information. The diagram shows a hierarchy of layers: OCh-O, OTSiG-O, OMS-O, OTS-O, and OSC. At the top, OCh-O and OTSiG-O layers are shown with their respective overhead (OCh-O_AP, AI_TSF, OCh-O_CP) and their connection to a central OTSiA | OCh layer. Below this, OMS-O layers are shown, with OMS-O_AP and OMS-O_CP overhead. The OMS-O layers are connected to OTS-O layers, which in turn are connected to OSC layers. The OSC layers have OSC_AP and OSC_CP overhead. The diagram also indicates signal flow from media elements in source and sink directions, with labels like OMS-P_LOS, OMS-O_RP, OTS-P_LOS, and OTS-O_RP.](cfef993dcc8fb513de79eb1f93cf26ae_img.jpg) - -The diagram illustrates the OTN atomic functions for non-associated overhead information across multiple layers: - -- OCh-O Layer:** Shows overhead OCh-O\_AP, AI\_TSF, and OCh-O\_CP. It connects to the OTSiA | OCh layer. -- OTSiG-O Layer:** Shows overhead OTSiG-O\_AP, AI\_TSF, and OTSiG-O\_CP. It also connects to the OTSiA | OCh layer. -- OMS-O Layer:** Shows overhead OMS-O\_AP and OMS-O\_CP. It receives signals from the OTSiA | OCh layer and sends signals to the OTS-O layer. -- OTS-O Layer:** Shows overhead OTS-O\_CP. It receives signals from the OMS-O layer and sends signals to the OSC layer. -- OSC Layer:** Shows overhead OSC\_AP and OSC\_CP. It receives signals from the OTS-O layer. - -Signal flow is indicated from media elements in source and sink directions, with labels such as OMS-P\_LOS, OMS-O\_RP, OTS-P\_LOS, and OTS-O\_RP. - -Diagram of OTN atomic functions for non-associated overhead information. The diagram shows a hierarchy of layers: OCh-O, OTSiG-O, OMS-O, OTS-O, and OSC. At the top, OCh-O and OTSiG-O layers are shown with their respective overhead (OCh-O\_AP, AI\_TSF, OCh-O\_CP) and their connection to a central OTSiA | OCh layer. Below this, OMS-O layers are shown, with OMS-O\_AP and OMS-O\_CP overhead. The OMS-O layers are connected to OTS-O layers, which in turn are connected to OSC layers. The OSC layers have OSC\_AP and OSC\_CP overhead. The diagram also indicates signal flow from media elements in source and sink directions, with labels like OMS-P\_LOS, OMS-O\_RP, OTS-P\_LOS, and OTS-O\_RP. - -NOTE 1 – OMS-O trail protection functions are not shown - -G.798(17)-Cor.1(18)\_F1-3 - -**Figure 1-3 – OTN atomic functions specific for the non-associated overhead information** - -![Diagram of OTN atomic functions specific for FlexO showing data flow between SD_CP, OTUCn_(T)CPs, FlexO-SD, FlexO-n/OTUCn, FlexO, FCC_CP, FlexO-x/FCC, FlexO-x/FlexO, and FlexO-x.](d4af765160d04ecef538e5066006dc77_img.jpg) - -The diagram illustrates the OTN atomic functions specific for FlexO, showing data flow between various components: - -- SD\_CP** (Service Data Contract Point) connects to **FlexO/SD**. -- OTUCn\_(T)CPs** (OTUCn Transport Contract Points, indexed 1, 2, 3, ..., N) connect to **FlexO-n/OTUCni**. -- OTUCn\_(T)CP** connects to **FlexO-n/OTUCn**. -- FlexO/SD**, **FlexO-n/OTUCni**, and **FlexO-n/OTUCn** all connect to a common horizontal bus labeled **FlexO\_AP**. -- FlexO-n/OTUCn** also connects to a **FlexO** block. -- FCC\_CP** (Framer Contract Point) connects to **FlexO-x/FCC**. -- FlexO** connects to **FlexO-x/FlexO**. -- FlexO-x/SD**, **FlexO-n/OTUCni**, and **FlexO-n/OTUCn** all connect to another common horizontal bus labeled **FlexO-x\_AP**. -- FlexO-x/SD** connects to a **FlexO-x** block. -- FlexO-x/SD** and **FlexO-x/OTUCn** both connect to a dashed oval labeled **FlexO-x\_(T)CP**. -- FlexO-x/SD** and **FlexO-x/OTUCn** both connect to a dashed oval labeled **FlexO-x\_AP**. -- FlexO-x/SD** and **FlexO-x/OTUCn** both connect to a dashed oval labeled **FlexO-x\_RP**. -- FlexO-x/SD** and **FlexO-x/OTUCn** both connect to a dashed oval labeled **FlexO-x\_(T)CP**. -- FlexO-x/SD** and **FlexO-x/OTUCn** both connect to a dashed oval labeled **FlexO-x\_AP**. -- FlexO-x/SD** and **FlexO-x/OTUCn** both connect to a dashed oval labeled **FlexO-x\_RP**. -- FlexO-x/SD** and **FlexO-x/OTUCn** both connect to a dashed oval labeled **FlexO-x\_(T)CP**. - -Diagram of OTN atomic functions specific for FlexO showing data flow between SD\_CP, OTUCn\_(T)CPs, FlexO-SD, FlexO-n/OTUCn, FlexO, FCC\_CP, FlexO-x/FCC, FlexO-x/FlexO, and FlexO-x. - -G.798(17)-Amd.3(21)\_F1-4 - -Figure 1-4 – OTN atomic functions specific for FlexO - -![Diagram of OTUk/ODUk atomic functions showing the hierarchy of client signals, overhead processing, and the central ODUk multiplexing function.](af7916c89a458fdab6c3f443217388ae_img.jpg) - -The diagram illustrates the atomic functions for OTUk and ODUk, organized into three main vertical sections: Client Signals (top), ODUk Processing (middle), and OTUk Processing (bottom). - -- Client Signals (Top):** - - Left side (downward flow):** FC-1200\_CP, ERS10G\_CP, MT\_CP (with ellipsis), SCC\_CP, ETH\_FP, ETH\_TFP. These connect to ODU2eP/FC-1200, ODU2P/ERS10G, ODUkP-hJ/MT, and ODUkP-hJ/ETH respectively. These then connect to RSn\_CP, CBRx\_CP, CBRx\_CP, and CBRx\_CP. These further connect to ODUkP/RSn, ODU0P/CBRx, ODUkP-g/CBRx, and ODUkP/CBRx. These then connect to ODUk\_CP (with ellipsis) and ODUkP-hJ/ODUj-21, and ODUkP/ODUjij. These then connect to COMMS\_CP. These then connect to ODUkP/PRBS, ODUkP/NULL, and ODUkP/COMMS. These then connect to the ODUk\_AP. - - Right side (upward flow):** ETH\_TFP, ETH\_FP, SCC\_CP, MT\_CP (with ellipsis), ERS10G\_CP, FC-1200\_CP. These connect to ODUkP-hJ/ETH, ODUkP-hJ/MT, ODU2P/ERS10G, and ODU2eP/FC-1200 respectively. These then connect to CBRx\_CP, CBRx\_CP, CBRx\_CP, and RSn\_CP. These further connect to ODUkP/CBRx, ODUkP-g/CBRx, ODU0P/CBRx, and ODUkP/RSn. These then connect to ODUk\_CP (with ellipsis) and ODUkP/ODUjij, and ODUkP-hJ/ODUj-21. These then connect to COMMS\_CP. These then connect to ODUkP/COMMS, ODUkP/NULL, and ODUkP/PRBS. These then connect to the ODUk\_AP. -- ODUk Processing (Middle):** - - The central element is an oval labeled **ODUk**. - - On the left, an **ODUkT** block connects to the central ODUk via **ODUkT\_AP**. Above it, an **ODUkT/ODUk** block connects via **ODUkT\_AP**. To the far left, an **ODUkT\_TCMC** block connects to the ODUkT block. Above the ODUkT/ODUk block, an **ODUkT non-intrusive monitor** is shown. - - On the right, an **ODUkT** block connects to the central ODUk via **ODUkT\_AP**. Above it, an **ODUkT/ODUk** block connects via **ODUkT\_AP**. To the far right, an **ODUkT\_TCMC** block connects to the ODUkT block. Above the ODUkT/ODUk block, an **ODUkP non-intrusive monitor** is shown. - - At the top of the ODUk oval, **ODUk\_TCP** and **ODUk\_CP** are indicated. - - Below the ODUk oval, **ODUkT\_TCMC** blocks connect via **ODUkT\_AP** to **ODUkT** blocks, which connect to **OTUk[V]/ODUk** blocks via **ODUkT\_AP**. - - There are dashed lines representing reverse paths: **ODUkT\_TCMC** to **ODUkT** (left), **ODUkT** to **ODUkT/ODUk** (left), **ODUkT** to **ODUkT/ODUk** (right), and **ODUkT/ODUk** to **ODUkT\_TCMC** (right). -- OTUk Processing (Bottom):** - - The **OTUk[V]/ODUk** blocks connect to **OTUk[V]** blocks via **OTUk[V]\_AP**. - - Between the **OTUk[V]/ODUk** and **OTUk[V]** blocks, **OTUk[V]\_CP** and **OTUk[V]\_RP** are indicated. - - At the bottom, **OTUk[V]** blocks connect to **OTUk[V]\_TCP** and **OTUk[V]\_CP**. - -Diagram of OTUk/ODUk atomic functions showing the hierarchy of client signals, overhead processing, and the central ODUk multiplexing function. - -G.798(23)\_F1-5 - -Figure 1-5 – OTUk/ODUk atomic functions - -![Figure 1-6 – OTUCn/ODUCn atomic functions](7c1f9e78e0f033d391b687f1652f6e47_img.jpg) - -The diagram illustrates the functional architecture of OTUCn and ODUCn atomic functions according to ITU-T standards. At the top, multiple adaptation functions (trapezoids) for ODUCnP/PRBS, ODUCnP/NULL, ODUCnP/COMMS, and ODUCnP/ODUk are shown, feeding into ODUCn\_AP (Access Points). Below these are termination functions (triangles) for ODUCnT non-intrusive monitor, ODUCnTm, and ODUCn. These connect to a central ODUCn connection point (circle) which also interfaces with ODUCn\_TCP and ODUCn\_CP. Below the central connection point, adaptation functions for OTUCn/ODUCn lead to OTUCn termination functions, which finally interface with OTUCn\_TCP and OTUCn\_CP at the bottom. Side blocks for ODUCnT\_TCMC are also present, indicating tandem connection monitoring. Arrows indicate the flow of signals and management information between these functional blocks. - -**Figure 1-6 – OTUCn/ODUCn atomic functions** - -Figure 1-6 – OTUCn/ODUCn atomic functions - -**2 References** - -The following ITU-T Recommendations and other references contain provisions which, through reference in this text, constitute provisions of this Recommendation. At the time of publication, the editions indicated were valid. All Recommendations and other references are subject to revision; users of this Recommendation are therefore encouraged to investigate the possibility of applying the most recent edition of the Recommendations and other references listed below. A list of the currently valid ITU-T Recommendations is regularly published. The reference to a document within this Recommendation does not give it, as a stand-alone document, the status of a Recommendation. - -- [ITU-T G.664] Recommendation ITU-T G.664 (2012), *Optical safety procedures and requirements for optical transport systems.* -- [ITU-T G.691] Recommendation ITU-T G.691 (2006), *Optical interfaces for single channel STM-64 and other SDH systems with optical amplifiers.* -- [ITU-T G.694.1] Recommendation ITU-T G.694.1 (2020), *Spectral grids for WDM applications: DWDM frequency grid.* -- [ITU-T G.694.2] Recommendation ITU-T G.694.2 (2003), *Spectral grids for WDM applications: CWDM wavelength grid.* -- [ITU-T G.695] Recommendation ITU-T G.695 (2018), *Optical interfaces for coarse wavelength division multiplexing applications.* -- [ITU-T G.696.1] Recommendation ITU-T G.696.1 (2010), *Longitudinally compatible intra-domain DWDM applications.* -- [ITU-T G.697] Recommendation ITU-T G.697 (2016), *Optical monitoring for dense wavelength division multiplexing systems.* -- [ITU-T G.698.1] Recommendation ITU-T G.698.1 (2023), *Multichannel DWDM applications with single-channel optical interfaces.* - -6 Rec. ITU-T G.798 (09/2023) - -- [ITU-T G.698.2] Recommendation ITU-T G.698.2 (2018), *Amplified multichannel dense wavelength division multiplexing applications with single channel optical interfaces.* -- [ITU-T G.705] Recommendation ITU-T G.705 (2000), *Characteristics of plesiochronous digital hierarchy (PDH) equipment functional blocks.* -- [ITU-T G.707] Recommendation ITU-T G.707/Y.1322 (2007), *Network node interface for the synchronous digital hierarchy (SDH).* -- [ITU-T G.709] Recommendation ITU-T G.709/Y.1331 (2020), *Interfaces for the optical transport network.* -- [ITU-T G.709.1] Recommendation ITU-T G.709.1/Y.1331.1 (2018), *Flexible OTN short-reach interface.* -- [ITU-T G.709.2] Recommendation ITU-T G.709.2/Y.1331.2 (2018), *OTU4 long-reach interface.* -- [ITU-T G.709.3] Recommendation ITU-T G.709.3/Y.1331.3 (2020), *Flexible OTN long-reach interfaces.* -- [ITU-T G.709.4] Recommendation ITU-T G.709.4/Y.1331.4 (2020), *OTU25 and OTU50 short-reach interfaces.* -- [ITU-T G.780] Recommendation ITU-T G.780/Y.1351 (2010), *Terms and definitions for synchronous digital hierarchy (SDH) networks.* -- [ITU-T G.781] Recommendation ITU-T G.781 (2020), *Synchronization layer functions.* -- [ITU-T G.783] Recommendation ITU-T G.783 (2006), *Characteristics of synchronous digital hierarchy (SDH) equipment functional blocks.* -- [ITU-T G.784] Recommendation ITU-T G.784 (2008), *Synchronous digital hierarchy (SDH) management.* -- [ITU-T G.805] Recommendation ITU-T G.805 (2000), *Generic functional architecture of transport networks.* -- [ITU-T G.806] Recommendation ITU-T G.806 (2012), *Characteristics of transport equipment – Description methodology and generic functionality.* -- [ITU-T G.807] Recommendation ITU-T G.807 (2020), *Generic functional architecture of the optical media network.* -- [ITU-T G.808] Recommendation ITU-T G.808 (2016), *Terms and definitions for network protection and restoration.* -- [ITU-T G.808.1] Recommendation ITU-T G.808.1 (2014), *Generic protection switching – Linear trail and subnetwork protection.* -- [ITU-T G.825] Recommendation ITU-T G.825 (2000), *The Control of jitter and wander within digital networks which are based on the synchronous digital hierarchy (SDH).* -- [ITU-T G.831] Recommendation ITU-T G.831 (2000), *Management capabilities of transport networks based on the synchronous digital hierarchy (SDH).* -- [ITU-T G.841] Recommendation ITU-T G.841 (1998), *Types and characteristics of SDH network protection architectures.* -- [ITU-T G.872] Recommendation ITU-T G.872 (2019), *Architecture of optical transport networks.* -- [ITU-T G.873.1] Recommendation ITU-T G.873.1 (2017), *Optical transport network: Linear protection.* - -- [ITU-T G.873.2] Recommendation ITU-T G.873.2 (2015), *ODUk shared ring protection*. -- [ITU-T G.874] Recommendation ITU-T G.874 (2020), *Management aspects of optical transport network elements*. -- [ITU-T G.957] Recommendation ITU-T G.957 (2006), *Optical interfaces for equipments and systems relating to the synchronous digital hierarchy*. -- [ITU-T G.959.1] Recommendation ITU-T G.959.1 (2018), *Optical transport network physical layer interfaces*. -- [ITU-T G.7041] Recommendation ITU-T G.7041/Y.1303 (2016), *Generic framing procedure*. -- [ITU-T G.7044] Recommendation ITU-T G.7044/Y.1347 (2011), *Hitless adjustment of ODUflex (GFP)*. -- [ITU-T G.8021] Recommendation ITU-T G.8021/Y.1341 (2022), *Characteristics of Ethernet transport network equipment functional blocks*. -- [ITU-T G.8023] Recommendation ITU-T G.8023 (2018), *Characteristics of equipment functional blocks supporting Ethernet physical layer and flex Ethernet interfaces*. -- [ITU-T G.8121] Recommendation ITU-T G.8121/Y.1381 (2018), *Characteristics of MPLS-TP equipment functional blocks*. -- [ITU-T G.8251] Recommendation ITU-T G.8251 (2022), *The control of jitter and wander within the optical transport network (OTN)*. -- [ITU-T O.150] Recommendation ITU-T O.150 (1996), *General requirements for instrumentation for performance measurements on digital transmission equipment*. -- [ITU-T O.151] Recommendation ITU-T O.151 (1992), *Error performance measuring equipment operating at the primary rate and above*. -- [IEEE 802.3] IEEE Std 802.3-2022, *IEEE standard for Ethernet*. -- [ETSI TR 101 290] ETSI TR 101 290 V1.3.1 (2014), *Digital Video Broadcasting (DVB); Measurement guidelines for DVB systems*. -- [ETSI TR 101 891] ETSI TR 101 891 V1.1.1 (2001), *Digital Video Broadcasting (DVB); Professional Interfaces: Guidelines for the implementation and usage of the DVB Asynchronous Serial Interface (ASI)*. -- [OIF FlexE] OIF-FLEXE-02.2 (2021), *FlexE 2.2 Implementation Agreement*. - -# 3 Definitions - -## 3.1 Terms defined elsewhere - -This Recommendation uses the following terms defined elsewhere: - -### 3.1.1 Terms defined in [ITU-T G.709] - -- completely standardized OTUk (OTUk). -- connection monitoring end point (CMEP) -- functionally standardized OTUk (OTUkV) -- ODUk path (ODUkP) -- ODUk TCM (ODUkT) -- optical channel (OCh) -- optical data unit (ODU) - -- optical payload unit (OPU) -- optical transport unit (OTU) -- optical transport network (OTN) -- optical tributary signal assembly (OTSiA) -- optical tributary signal group (OTSiG) -- optical tributary signal overhead (OTSiG-O) - -### **3.1.2 Terms defined in [ITU-T G.780]** - -- BIP-X -- switching -- bidirectional (protection) switching -- unidirectional (protection) switching - -### **3.1.3 Terms defined in [ITU-T G.805]** - -- access point (AP) -- adapted information (AI) -- characteristic information (CI) -- connection point (CP) -- network -- subnetwork -- subnetwork connection (SNC) - -### **3.1.4 Terms defined in [ITU-T G.806]** - -- adaptation function (A) -- compound function -- connection function (C) -- connection matrix (CM) -- defect -- fault cause -- function -- management information (MI) -- management point (MP) -- process -- remote information (RI) -- remote point (RP) -- server signal degrade (SSD) -- server signal fail (SSF) -- termination connection point (TCP) -- trail signal degrade (TSD) -- trail signal fail (TSF) -- trail termination function (TT) - -### **3.1.5 Terms defined in [ITU-T G.807]** - -- media layer access point (M-AP) - -- media layer adapted information (M-AI) - -### **3.1.6 Terms defined in [ITU-T G.808]** - -- APS channel -- APS protocol -- 1:n (protection) architecture -- 1+1 (protection) architecture -- bridge -- broadcast bridge -- permanent bridge -- selector -- selective selector -- non-revertive (protection) operation -- revertive (protection) operation -- protection -- protection class -- subnetwork connection protection -- protection group -- extra traffic signal -- normal traffic signal -- null signal -- traffic signal - -### **3.1.7 Terms defined in [ITU-T G.831]** - -- access point identifier (API) - -### **3.1.8 Terms defined in [ITU-T G.872]** - -- optical supervisory channel (OSC) - -### **3.1.9 Terms defined in [ITU-T G.959.1]** - -- optical tributary signal (OTSi) - -### **3.1.10 Terms defined in [ITU-T G.7044]** - -- GMP normal mode -- GMP special mode - -## **3.2 Terms defined in this Recommendation** - -This Recommendation defines the following terms: - -**3.2.1 access function (AC):** An access function provides access (add, drop, drop and continue) at CPs to communication channels transported in the overhead. - -**3.2.2 CBRx:** A CBR signal with the approximate bit rate x. - -**3.2.3 TCM control function (TCMC):** A TCM control function is responsible for the activation/deactivation of a TCM trail. - -**3.2.4 TCM control information (TCMCI):** The TCMCI is the information that passes over a TCMCP for activation/deactivation of a TCM trail. - -**3.2.5 TCM control point (TCMCP):** A reference point where the output of an atomic function is bound to the input of the TCM control function, or where the output of the TCM control function is bound to the input of an atomic function. - -**3.2.6 tributary slot map:** The list of tributary slots to be added to (increase) or removed from (decrease) an ODUflex(GFP) during resizing. - -**3.2.7 tributary slot number:** The target capacity of a resized ODUflex(GFP), expressed in number of tributary slots. - -# 4 Abbreviations and acronyms - -This Recommendation uses the following abbreviations and acronyms: - -| | | -|------------|-----------------------------------------| -| 1second | one second pulse | -| 1+1u | 1+1 unidirectional protection | -| A | Adaptation function | -| AC | Access function | -| ACK | Acknowledge | -| AcMSI | Accepted Multiplex Structure Identifier | -| AcPT | Accepted Payload Type | -| AcSTAT | Accepted Status Field | -| AcTI | Accepted Trail Trace Identifier | -| AdminState | Administrative State | -| AI | Adapted Information | -| AIS | Alarm Indication Signal | -| AM | Alignment Marker | -| AMP | Asynchronous Mapping Procedure | -| AP | Access Point | -| API | Access Point Identifier | -| APS | Automatic Protection Switching | -| ARC | Alarm Reporting Control | -| ASI | Asynchronous Serial Interface for DVB | -| AT | Authentication Tag | -| BCH | Bose-Chaudhuri-Hocquengham | -| BDI | Backward Defect Indication | -| BDI-O | Backward Defect Indication Overhead | -| BDI-P | Backward Defect Indication Payload | -| BEI | Backward Error Indicator | -| BIAE | Backward Incoming Alignment Error | -| BIP | Bit Interleaved Parity | -| BOH | Basic Overhead area | - -| | | -|-----------------|-------------------------------------------------------------| -| BWR | Bandwidth Resize | -| C | Connection function | -| CBR | Constant Bit Rate signal | -| CBRx | Constant Bit Rate signal of bit rate [range] x | -| CC | Calendar Configuration | -| CCA | Client Calendar A | -| CCB | Client Calendar B | -| CDI | Client Defect Indication | -| CI | Characteristic Information | -| CID | Consecutive Identical Digits | -| CK | Clock | -| C m | number of m-bit client data entities | -| C n | number of n-bit client data entities | -| C nD | difference between C n and $(m/n \times C_m)$ | -| COMMS | Communications channel | -| CP | Connection Point | -| CP n | Connection Point normal | -| CP p | Connection Point protection | -| CP w | Connection Point working | -| CRC | Cyclic Redundancy Check | -| CS | Calendar Slot | -| CSACM | Calendar Slot Availability Count Mismatch | -| CST | Cipher Suite Type | -| CSTM | Cipher Suite Type Mismatch | -| CSUM | Calendar Slot Unavailibility Mismatch | -| CSF | Client Signal Fail | -| CSUM | Calendar Slot Unavailability Mismatch | -| CTRL | Control | -| D | Data | -| DAPI | Destination Access Point Identifier | -| DEG | Degraded defect | -| DEGM | Degraded defect consecutive one-second Monitoring intervals | -| DEGThr | Degraded defect one-second errored block count Threshold | -| DI | Defect Information | -| DMGSI | Demapping Granularity Switch Indication | -| DMod | Demodulation | -| DM p | Delay Measurement of ODUk path monitoring | - -| | | -|------------|---------------------------------------------------------------------| -| DMti | Delay Measurement of ODUk tandem connection monitoring instance (i) | -| DP | Defect Point | -| DS | Defect Second | -| DS-O | Defect Second Overhead | -| DS-P | Defect Second Payload | -| DVB | Digital Video Broadcast | -| EBC | Errored Block Count | -| EFS | Equipment Functional Specification | -| EMF | Equipment Management Function | -| EOH | Extended Overhead area | -| ERSy | Ethernet Reconciliation sublayer for PHY y | -| ETCy | Ethernet Coding sublayer for PHY y | -| ETH | Ethernet MAC layer | -| ExDAPI | Expected Destination Access Point Identifier | -| ExMSI | Expected Multiplex Structure Identifier | -| ExSAPI | Expected Source Access Point Identifier | -| ExtCMD | External Command | -| F | Far-end | -| FAS | Frame Alignment Signal | -| F_B | Far-end Block | -| FC | Fibre Channel | -| FCC | FlexO Communications Channel | -| FCWS | FEC code word start | -| FDI | Forward Defect Indication | -| FDI-O | Forward Defect Indicator Overhead | -| FDI-P | Forward Defect Indicator Payload | -| F_DS | Far-end Defect Second | -| F_EBC | Far-end Errored Block Count | -| FEC | Forward Error Correction | -| FECcorrErr | Forward Error Correction Corrected Errors | -| FECEn | Forward Error Correction Enabled | -| FlexESG | FlexE Sub-Group | -| FlexESGM | FlexE Sub-Group Member | -| FlexO-x | FlexO interface information structure of order x | -| FlexO-x-SC | FlexO interface signal of order x with Staircase FEC | -| FM | Fault Management | -| FMAP | FlexO Map | - -| | | -|-----------|-------------------------------------------| -| | FlexE Map | -| FMM | FlexO Map Mismatch | -| | FlexE Map Mismatch | -| FN | Frame Number | -| FOI | FlexO Interface | -| FOICx.k | FlexO Interface of order Cx with k lanes | -| FOP | Failure Of Protocol | -| FOP-NR | Failure Of Protocol No Response | -| FOP-PM | Failure Of Protocol Provisioning Mismatch | -| FS | Frame Start | -| FSS | Frequency Slot Structure | -| GCC | Generic Communication Channel | -| GCCAccess | Generic Communication Channel Access | -| GCCCont | Generic Communication Channel Continue | -| GID | Group Identification | -| GIDM | Group Identification Mismatch | -| GMP | Generic Mapping Procedure | -| HAO | Hitless Adjustment of ODUflex | -| HEC | Header Error Control | -| HoTime | Hold-off Time | -| IAE | Incoming Alignment Error | -| IF | In-Frame | -| IID | FlexO Instance Identification | -| ILA | In-Lane-Alignment | -| IM | In-Multiframe | -| IR | In Recovery | -| IV | Initialization Vector | -| KCC | Key exchange Communication Channel | -| KI | Key Index | -| LCK | Locked defect | -| LCR | Link Connection Resize | -| LCS | Loss of Character Synchronization | -| LFA | Loss of FEC word Alignment defect | -| LLM | Logical Lane Marker | -| LOA | Loss Of Alignment | -| LOCA | Loss Of Client Alignment defect | -| LOF | Loss Of Frame | - -| | | -|---------|-----------------------------------------| -| LOFLANE | Loss of Frame of logical Lane | -| LOFLOM | Loss Of Frame and Loss Of Multiframe | -| LOL | Loss of Lane alignment | -| LOM | Loss of Multiframe | -| LOR | Loss of Recovery | -| LOS | Loss Of Signal | -| LOS-O | Loss Of Signal Overhead | -| LOS-P | Loss Of Signal Payload | -| LSB | Least Significant Bit | -| LSS | Loss of pseudo-random bit sequence lock | -| LTC | Loss of Tandem Connection | -| m | non-intrusive monitor | -| M-AI | Media Layer Adapted Information | -| M-AP | Media Layer Access Point | -| MBAS | Multi Block Alignment Signal | -| MCP | Media Channel Point | -| ME | Maintenance Entity | -| MECI | Media Element Configuration Information | -| MECP | Media Element Configuration Point | -| MFAS | Multiframe Alignment Signal | -| MFI | Multiframe Indicator | -| MFS | Multiframe Start | -| MGSI | Mapping Granularity Switch Indication | -| MI | Management Information | -| Mod | Modulation | -| MP | Management Point | -| MSI | Multiplex Structure Identifier | -| MSIM | Multiplex Structure Identifier Mismatch | -| n | normal | -| N | Near-end | -| N/A | Not Applicable | -| NACK | Negative Acknowledge | -| N_B | Near-end Block | -| NC | Network Connection | -| NCS | Network Connectivity Status | -| N_DS | Near-end Defect Second | -| N_EBC | Near-end Errored Block Count | - -| | | -|-----------|-----------------------------------------------------------------| -| NJO | Negative Justification Opportunity byte | -| NNI | Network Node Interface | -| NOS | Not_Operational | -| OAM | Operation, Administration, Maintenance | -| OCh | Optical Channel | -| OCI | Open Connection Indication | -| OCTDk[V]m | OCh, OTU and ODU Tandem Connection Monitoring Compound function | -| OCTk[V]m | OCh and OTU non-intrusive monitor | -| ODCx | ODU clock of type "x", where "x" is "a", "b", "r", or "p" | -| ODU | Optical Data Unit | -| ODUi | Optical Data Unit of level i | -| ODU[i]j | Optical Data Unit of level j and i (i is optional; i < j) | -| ODUj | Optical Data Unit of level j | -| ODUj[i] | Optical Data Unit of level j or i (i is optional; i < j) | -| ODUk | Optical Data Unit of level k | -| ODUkP | Optical Data Unit of level k, Path | -| ODUKT | Optical Data Unit of level k, Tandem connection sub-layer | -| ODUP | Optical Data Unit, Path | -| ODUT | Optical Data Unit, Tandem connection sub-layer | -| OH | Overhead | -| OLA | Out-of-Lane-Alignment | -| OM | Optical Multiplexing | -| OMFI | OPU Multiframe Identifier | -| OMFS | OPU Multiframe Start | -| OMS-O | Optical Multiplex Section – Overhead | -| OMSnP | Optical Multiplex Section Protection sub-layer of level n | -| OOF | Out-Of-Frame | -| OOM | Out-Of-Multiframe | -| OOR | Out-Of-Recovery | -| OperType | Operation Type | -| OPM | Optical Parameter Monitor | -| OPU | Optical Payload Unit | -| OPUk | Optical Payload Unit of level k | -| OS | Optical Section | -| OSC | Optical Supervisory Channel | -| OSMC | OTN synchronization messaging channel | -| OSME | Optical Signal Maintenance Entity | - -| | | -|----------|----------------------------------------------------------------------------------------------------| -| OSn | Optical Section of order n | -| OSx | Optical Section of bit rate [range] x | -| OTL | Optical Transport Lane | -| OTLk.n | Optical Transport Lane of OTUk lane number n | -| OTN | Optical Transport Network | -| OTS | Optical Transmission Section | -| OTSi | Optical Tributary Signal | -| OTSiA | Optical Tributary Signal Assembly | -| OTSiG | Optical Tributary Signal Group | -| OTSiG-O | Optical Tributary Signal Group – Overhead | -| OTU | Optical Transmission Unit | -| OTUk | Optical Transmission Unit of level k | -| OTUkV | Optical Transmission Unit of level k, functionally standardized | -| OTU4-SC | Completely standardized 100G Optical Transport Unit for long-reach applications with Staircase FEC | -| p | protection; performance data | -| PCS | Physical Coding Sub-layer | -| PCSL | Physical Coding Sub-layer of Lane | -| PHY | Physical Layer | -| PID | Physical Identification | -| PJO | Positive Justification Opportunity byte | -| PLD | Payload | -| PLM | Payload Mismatch | -| PM | Performance Management | -| PMI | Payload Missing Indication | -| PMOH | Path Monitoring Overhead | -| ppm | parts per million | -| ProtType | Protection Type | -| PRBS | Pseudo-Random Bit Sequence | -| PSI | Payload Structure Indication | -| PT | Payload Type | -| PTI | Payload Type Identifier | -| RCOH | Resize Control Overhead | -| RCOHM | Resize Control Overhead Mismatch | -| RES | Reserved overhead | -| RI | Remote Information | -| RMF | Resize Multiframe | - -| | | -|-----------|-------------------------------------------------------------| -| RP | Resizing Protocol | -| RP | Remote Point | -| RPF | Remote Physical Layer Fault | -| RS | Regenerator Section | -| RSn | Regenerator Section of level n | -| SAPI | Source Access Point Identifier | -| SC FEC | Staircase FEC | -| SD | Synchronization Distribution | -| SDH | Synchronous Digital Hierarchy | -| SF | Signal Fail | -| Sk | Sink | -| SKI | Secure Key Information | -| SMOH | Section Monitoring Overhead | -| SNC | SubNetwork Connection | -| SNC/I | SubNetwork Connection with Inherent monitoring | -| SNC/N | SubNetwork Connection with Non-intrusive monitoring | -| SNC/S | SubNetwork Connection with Sub-layer monitoring | -| So | Source | -| SRP-n | Shared Ring Protection of n ODU per Lambda (n=1, p) | -| SSD | Server Signal Degraded | -| SSF | Server Signal Fail | -| SSF-O | SSF Overhead | -| SSF-P | SSF Payload | -| STAT | Status field | -| STM | Synchronous Transport Module | -| TCM | Tandem Connection Monitoring | -| TCMC | Tandem Connection Monitoring Control function | -| TCMCI | Tandem Connection Monitoring Control Information | -| TCMCP | Tandem Connection Monitoring Control Point | -| TCMOH | Tandem Connection Monitoring Overhead | -| TCP | Termination Connection Point | -| TIM | Trail trace Identifier Mismatch | -| TIMActDis | Trail trace Identifier Mismatch consequent Actions Disabled | -| TIMDetMo | Trail trace Identifier Mismatch Detection Mode | -| TPID | Tributary Port ID | -| TrPT | Transmitted Payload Type | -| TSCC | Tributary Slot Connectivity Check | - -| | | -|-------|--------------------------------------------| -| TSD | Trail Signal Degraded | -| TSE | Test Sequence Error | -| TSF | Trail Signal Fail | -| TSF-O | Trail Signal Fail Overhead | -| TSF-P | Trail Signal Fail Payload | -| TSGS | Tributary Slot Group Status | -| TSI | Transmitter Structure Identifier | -| TSMAP | Tributary Slot Map | -| TSNUM | Tributary Slot Number | -| TT | Trail Termination function | -| TTI | Trail Trace Identifier | -| TxMSI | Transmitted Multiplex Structure Identifier | -| TxTI | Transmitted Trail Identifier | -| UNI | User Network Interface | -| w | working | -| WA | Wavelength Assignment | -| WTR | Wait To Restore | -| xI | CI or MI or AI | - -# 5 Conventions - -For the basic methodology to describe transport network functionality of network elements, refer to clause 5 of [ITU-T G.806]. - -**OTU layer** is used whenever the specification applies to both the OTUk and OTUCn layers. - -**ODU layer** is used whenever the specification applies to both the ODUk and ODUCn layers. - -**ODUP layer** is used whenever the specification applies to both the ODUkP and ODUCnP layers. - -**ODUT layer** is used whenever the specification applies to both the ODUkT and ODUCnT layers. - -**x**: Gives the approximate bit rate for a CBR signal. It is used in the form "unit value, unit, [fractional unit value]". The currently defined unit value is "G" for gigabit/s. Examples for x are "40G" for 40 Gbit/s and "2G5" for 2.5 Gbit/s. - -**y** is used as a variable for the client layer in the adaptation functions, specifically: - -- Ethernet Reconciliation sublayer for PHY y (ERSy) indicates a reconciliation sublayer of an Ethernet PHY and Ethernet Coding sublayer for PHY y (ETCy) indicates a coding sublayer of an Ethernet PHY, with 'y' describing the PHY using IEEE nomenclature, minus the word BASE. For example, the coding sublayer for 1000BASE-X PHY would be ETC1000X. - -**[1..n]**: Suffix indicating the signal consists of an array of n elements indexed from 1 to n. - -**[i]**: Suffix indicating element #i in an array of signals. - -**OTSi/\_A** and **OTSiG/\_A** are used to refer to the M-AI/\_A function identified in [ITU-T G.807]. - -**OTSi\_AP** and **OTSi\_AI** are used to refer to the media layer access point (M-AP) and media layer adapted information (M-AI) identified in [ITU-T G.807]. - -NOTE – The management interfaces connecting the various atomic functions defined in this Recommendation are not restricted to the use of management systems only but are available also for example control plane functions. - -# 6 Supervision - -The generic supervision functions are defined in clause 6 of [ITU-T G.806]. Specific supervision functions for the OTN are defined in this clause. - -## 6.1 Alarm reporting control - -Trail termination point mode and port modes are not supported by OTN equipment; instead alarm reporting control (ARC) is used. Refer to [ITU-T G.874] for the OTN ARC functionality. - -## 6.2 Defects - -### 6.2.1 Continuity supervision (loss of continuity defect) - -Continuity supervision refers to the set of processes for monitoring the integrity of the continuity of a trail. Generic continuity supervision defects are described in clause 6.2.1 of [ITU-T G.806]. OTN-specific continuity supervision defects are described here. The continuity supervision requirements for the OTN are defined in [ITU-T G.872]. - -#### 6.2.1.1 Loss of optical signal defect (dLOS-P) - -Loss of optical signal (LOS-P) defect is monitored by an optical parameter monitor (OPM) function on the OMS optical signal maintenance entity (OSME), or OTS OSME. - -The purpose of this optical parameter monitor is to indicate either: - -- i) transmitter failure, i.e., failure of the optical signal of the OTSi; or -- ii) optical path break on the OMS\_ME or OTS\_ME. - -The specific detection process, including the detection time, is out of the scope of this Recommendation. - -NOTE – Monitoring of other optical parameters, defined in [ITU-T G.697], may be defined in the future. - -An additional hold-off time is defined for the dLOS-P activation at the OTS-O\_TT\_Sk and OMS-O\_TT\_Sk. This time is introduced in order to avoid false dLOS-P activation in case the payload signal is already missing at the related trail termination source. The PMI signal is used to signal this information from the trail termination source to the sink (see clauses 6.2.6.7 and 8.10). The hold-off time has to cover the propagation, processing and detection delay of the PMI signal between the source and the sink. The hold-off time depends on the specific implementation of the PMI signalling and LOS-P detection and is not configurable. Its value is for further study. - -#### 6.2.1.2 Loss of signal payload defect (dLOS-P) - -Loss of signal payload (LOS-P) defect is monitored at the OTSi or OTSiG to OTU or FlexO adaptation functions. - -The purpose of monitoring this parameter is to indicate either: - -- i) OTSi transmitter failure; or -- ii) OTSi optical path break (this could be a result of misconfigured or broken media elements in the optical path). - -The specific detection process, including the detection time, is for further study. - -#### 6.2.1.3 Loss of signal overhead defect (dLOS-O) - -Loss of signal overhead (LOS-O) defect is monitored at the OTSi to OSC adaptation function. - -The purpose of monitoring this parameter is to indicate either: - -- i) OSC transmitter failure; or -- ii) OSC optical path break (this could be a result of misconfigured or broken media elements in the optical path). - -The specific detection process, including the detection time, is for further study. - -#### 6.2.1.4 Open connection indication defect (dOCI) - -See clause 6.2.6.8. - -#### 6.2.1.5 Loss of tandem connection defect (dLTC) - -##### 6.2.1.5.1 dLTC at the ODUT layer - -dLTC shall be declared if the accepted STAT information (AcSTAT) is "000". dLTC shall be cleared if the accepted STAT information is not equal to "000". For the STAT information acceptance process, see clause 8.8. - -During signal fail conditions of the data signal, dLTC shall be set to false. For details on the signal fail conditions, see the specific atomic functions. - -### 6.2.2 Connectivity supervision/trail trace identifier mismatch defect (dTIM) - -For the generic connectivity supervision requirements of the OTN, refer to [ITU-T G.872]. - -#### 6.2.2.1 dTIM at the OTS-O, OTSiG-O, OTU, ODUT and ODUP layer - -The TTI mismatch process reports the trail trace identifier mismatch defect (dTIM). The process is based on the comparison of expected APIs (i.e., SAPI and DAPI) with the APIs in the incoming signal. The APIs are part of the 64-byte TTI as defined in [ITU-T G.709]. - -Depending on the topology, only the SAPI, the DAPI or both are taken into account for the mismatch detection. These topologies are: - -##### Point-to-point - -In a point-to-point topology, either unidirectional or bidirectional, only the SAPI is taken into account for the comparison at the trail termination sink as shown in Figure 6-1. - -![Diagram of a point-to-point configuration showing a transmitter (TxTI) and a receiver (ExSAPI) connected by a single line. The receiver is labeled G.798(10)_F6-1.](db395493033edacd83e212049fd55715_img.jpg) - -The diagram illustrates a point-to-point configuration. On the left, a label 'TxTI' is positioned above a triangle symbol representing a transmitter. On the right, a label 'ExSAPI' is positioned above a triangle symbol representing a receiver. A horizontal line with an arrow pointing from the transmitter to the receiver connects the two symbols. Below the receiver symbol, the text 'G.798(10)\_F6-1' is displayed. - -Diagram of a point-to-point configuration showing a transmitter (TxTI) and a receiver (ExSAPI) connected by a single line. The receiver is labeled G.798(10)\_F6-1. - -**Figure 6-1 – Point-to-point configuration** - -##### Point-to-multipoint - -In a point-to-multipoint topology, only the SAPI is taken into account for the comparison at the trail termination sink as shown in Figure 6-2. - -![Figure 6-2: Point-to-multipoint configuration diagram. A single TxTI input on the left enters a 'Broadcast' ellipse. Three arrows exit the ellipse to three separate 'ExSAPI' outputs on the right. The diagram is labeled G.798(10)_F6-2.](11edb7fcedf09ac6a817f8d7b8c61eec_img.jpg) - -Figure 6-2: Point-to-multipoint configuration diagram. A single TxTI input on the left enters a 'Broadcast' ellipse. Three arrows exit the ellipse to three separate 'ExSAPI' outputs on the right. The diagram is labeled G.798(10)\_F6-2. - -**Figure 6-2 – Point-to-multipoint configuration** - -##### **Multipoint-to-point** - -In a multipoint-to-point topology, only the DAPI is taken into account for the comparison at the trail termination sink as shown in Figure 6-3. - -![Figure 6-3: Multipoint-to-point configuration diagram. Three inputs labeled TxTI-a, TxTI-b, and TxTI-c enter from the left. Arrows from these inputs converge into a 'One selected' ellipse. An arrow exits the ellipse to an 'ExDAPI' output on the right. The diagram is labeled G.798(10)_F6-3.](744acfe8d4e31bcf03f95714c2f6e567_img.jpg) - -Figure 6-3: Multipoint-to-point configuration diagram. Three inputs labeled TxTI-a, TxTI-b, and TxTI-c enter from the left. Arrows from these inputs converge into a 'One selected' ellipse. An arrow exits the ellipse to an 'ExDAPI' output on the right. The diagram is labeled G.798(10)\_F6-3. - -**Figure 6-3 – Multipoint-to-point configuration** - -In addition, the mismatch detection can be disabled. - -A functional decomposition of the TTI mismatch detection process is given in Figure 6-4. - -![Figure 6-4: TTI mismatch detection process functional decomposition diagram. A large grey box contains three main components: 'SAPI compare', 'Control', and 'DAPI compare'. 'RxTI[SAPI]' enters 'SAPI compare' from the left, and 'MI_ExSAPI' enters from the right. 'SAPI compare' sends a 'Match/mismatch' signal to 'Control'. 'RxTI[DAPI]' enters 'DAPI compare' from the left, and 'MI_ExDAPI' enters from the right. 'DAPI compare' sends a 'Match/mismatch' signal to 'Control'. 'Control' sends a 'dTIM' output to the right and receives a 'MI_TIMDetMo' input from the right. The diagram is labeled G.798(10)_F6-4.](5b6e139e89c6ce90107ea7d7d77620a0_img.jpg) - -Figure 6-4: TTI mismatch detection process functional decomposition diagram. A large grey box contains three main components: 'SAPI compare', 'Control', and 'DAPI compare'. 'RxTI[SAPI]' enters 'SAPI compare' from the left, and 'MI\_ExSAPI' enters from the right. 'SAPI compare' sends a 'Match/mismatch' signal to 'Control'. 'RxTI[DAPI]' enters 'DAPI compare' from the left, and 'MI\_ExDAPI' enters from the right. 'DAPI compare' sends a 'Match/mismatch' signal to 'Control'. 'Control' sends a 'dTIM' output to the right and receives a 'MI\_TIMDetMo' input from the right. The diagram is labeled G.798(10)\_F6-4. - -**Figure 6-4 – TTI mismatch detection process** - -The SAPI/DAPI compare process compares the SAPI/DAPI part of the TTI in the incoming signal (RxTI) (see clause 15.2 of [ITU-T G.709]) with the equivalent expected SAPI/DAPI values set via the MP (MI\_ExSAPI/DAPI). The comparison result is "match" if all 16 bytes are equal, and "mismatch" if one or more bytes are unequal. "match/mismatch" conditions shall be detected within 100 ms of changes to the RxTI, ExSAPI or ExDAPI in the absence of bit errors. A persistence check shall be used in order to prevent wrong/toggling dTIM information during bit errors. - -Based on the TIM detection mode set via the MP (MI\_TIMDetMo) the defect dTIM is generated as listed in Table 6-1 in the control process. - -During signal fail conditions of the data/overhead signal, dTIM shall be set to false. For details on the signal fail conditions, see the specific atomic functions. - -**Table 6-1 – dTIM generation** - -| MI_TIMDetMo | SAPI compare | DAPI compare | dTIM | -|--------------------|---------------------|---------------------|-------------| -| Off | Don't care | Don't care | Clear | -| SAPI | Match | Don't care | Clear | -| SAPI | Mismatch | Don't care | Raise | -| DAPI | Don't care | Match | Clear | -| DAPI | Don't care | Mismatch | Raise | -| SAPI + DAPI | Match | Match | Clear | -| SAPI + DAPI | Match | Mismatch | Raise | -| SAPI + DAPI | Mismatch | Match | Raise | -| SAPI + DAPI | Mismatch | Mismatch | Raise | - -### 6.2.3 Signal quality supervision - -#### 6.2.3.1 Blank clause - -NOTE – This clause is intentionally left blank. - -#### 6.2.3.2 Blank clause - -NOTE – This clause is intentionally left blank. - -#### 6.2.3.3 Blank clause - -NOTE – This clause is intentionally left blank. - -#### 6.2.3.4 OTU and ODU signal degrade defect (dDEG) - -The algorithm for the OTU, ODUP and ODUT dDEG detection is defined in clause 6.2.3.1.2 of [ITU-T G.806]. For case of OTU and ODUT dDEG, the current and previous errored second count is discarded (assumed as 0 errored blocks) if the defect dIAE was active at any time during the second. - -Bursty distribution of errors is assumed and only the degraded signal defect (dDEG) is supported. - -For the errored block definition and the number of blocks per one-second interval, see Table 6-2. - -#### 6.2.3.5 Blank clause - -NOTE – This clause is intentionally left blank. Its text is included in clause 6.2.3.4. - -### 6.2.4 Payload mismatch supervision (dPLM) - -#### 6.2.4.1 dPLM at the ODUP layer - -dPLM shall be declared if the accepted payload type (AcPT) is not equal to the expected payload type(s) as defined by the specific adaptation function. dPLM shall be cleared if the accepted payload type is equal to the expected payload type(s), as defined by the specific adaptation function. - -NOTE – An adaptation function may support more than one payload type. - -For the payload type acceptance process, see clauses 8.7.1.1. - -#### 6.2.4.2 dPLM at the FlexO layer - -For a FlexO group of n FlexO instances, dPLM shall be declared if the accepted payload type (AcPT) is not equal to the expected payload type(s), as defined by the specific adaptation function, in any of the n FlexO instances. dPLM shall be cleared if the accepted payload type is equal to the expected payload type(s), as defined by the specific adaptation function, in all of the n FlexO instances. - -NOTE – An adaptation function may support more than one payload type. - -For the payload type acceptance process, see clause 8.7.1.2. - -### 6.2.5 Alignment supervision - -#### 6.2.5.1 Loss of frame defect (dLOF) - -dLOF is generated based on the state of the frame alignment process defined in clause 8.2.1 for OTU, in clause 8.2.9 for OTU25(u) or OTU50(u) and in clause 8.2.8 for FlexO-x. - -If the frame alignment process is in the out-of-frame (OOF) state for 3 ms, dLOF shall be declared. To provide for the case of intermittent OOFs, the integrating timer shall not be reset to zero until an in-frame (IF) condition persists continuously for 3 ms. dLOF shall be cleared when the IF state persists continuously for 3 ms. - -#### 6.2.5.2 Loss of multiframe defect (dLOM) - -dLOM is generated based on the state of the multiframe alignment process defined in clause 8.2.2. - -If the multiframe alignment process is persistently in the out-of-multiframe (OOM) state for 3 ms, dLOM shall be declared. dLOM shall be cleared immediately when the multiframe alignment process is in the in-multiframe (IM) state. - -#### 6.2.5.3 Loss of frame and multiframe defect (dLOFLOM) - -dLOFLOM is generated based on the state of the frame and multiframe alignment process defined in clause 8.2.3. - -If the process is in the out-of-frame (OOF) state for 3 ms, dLOFLOM shall be declared. To provide for the case of intermittent OOFs, the integrating timer shall not be reset to zero until an in-frame (IF) condition persists continuously for 3 ms. dLOFLOM shall be cleared when the IF state persists continuously for 3 ms. - -#### 6.2.5.4 Blank clause - -NOTE – This clause is intentionally left blank. - -#### 6.2.5.5 Loss of lane alignment defect (dLOL) - -dLOL is generated for multilane interfaces based on the state of the lane alignment process of the multilane signals defined in clause 8.2.6. - -If the multilane alignment process is in the out-of-alignment (OLA) state, dLOL shall be declared. dLOL shall be cleared when the multilane alignment process is in the ILA state. - -#### **6.2.5.6 Loss of frame defect of logical lane (dLOFLANE)** - -The loss of frame defect of lane on a multilane signal dLOFLANE is generated based on the state of the frame alignment process defined in clause 8.2.5. - -If the frame alignment process is in the out-of-frame (OOF) state for 3 ms, dLOFLANE shall be declared. To provide for the case of intermittent OOFs, the integrating timer shall not be reset to zero until an in-frame (IF) condition persists continuously for 3 ms. dLOFLANE shall be cleared when the IF state persists continuously for 3 ms. - -#### **6.2.5.7 Loss of character synchronization (dLCS)** - -##### **6.2.5.7.1 Loss of character synchronization of 66b blocks (dLCS)** - -The defect dLCS is generated based on the lock state machine of 66b block synchronization defined in Figure 82-12 of [IEEE 802.3]. dLCS shall be cleared if the block synchronization process has achieved block lock (rx\_block\_lock is true); dLCS shall be declared if the block synchronization process has lost block lock (rx\_block\_lock is false). - -##### **6.2.5.7.2 Loss of character synchronization of 1027b blocks (dLCS)** - -The defect dLCS is generated based on the lock state machine of 1027b block synchronization defined in Annex F of [ITU-T G.709]. dLCS shall be cleared if the block synchronization process has achieved block lock (1027B\_block\_lock is true); dLCS shall be declared if the block synchronization process has lost block lock (1027B\_block\_lock is false). - -### **6.2.6 Maintenance signal supervision** - -#### **6.2.6.1 Forward defect indication payload defect (dFDI-P)** - -##### **6.2.6.1.1 dFDI-P at the OMS-O, OCh-O and OTSiG-O layer** - -The FDI-P maintenance signal is inserted into the non-associated overhead for the client layer maintenance entity(ies) in response to detection of defects in the media element for which the maintenance entity is providing monitoring. E.g., an OTS-O termination sink inserts OMS-P FDI in response to media element failures. - -Forward defect indication payload (FDI-P) defect is monitored at the OMS-O, OCh-O and OTSiG-O layers. The purpose of monitoring this parameter is to suppress downstream alarms at the client layer caused by upstream defects detected by the server layer, which interrupt the client payload signal. - -FDI-P defect (dFDI-P) shall be declared at the trail termination sink function within X ms of detecting the upstream defect causing the insertion of FDI-P into the appropriate portion of the OSC. - -FDI-P defect (dFDI-P) shall be cleared at the trail termination sink function within Y ms of detecting that the upstream defect, which caused the insertion of FDI-P, has cleared. - -X and Y are for further study. - -#### **6.2.6.2 Forward defect indication overhead defect (dFDI-O)** - -##### **6.2.6.2.1 dFDI-O at the OMS-O and OTSiG-O layer** - -The FDI-O maintenance signal is inserted into the non-associated overhead for the client layer maintenance entity(ies) in response to detection of defects in a server maintenance entity. E.g., an OTS-O termination sink inserts OMS-O FDI in response to OTS-O faults. - -Forward defect indication overhead (FDI-O) defect is monitored at the OMS-O, OCh-O and OTSiG-O layers. The purpose of monitoring this parameter is to suppress downstream alarms at the client layer caused by upstream defects detected by the server layer which interrupt the OSC. - -FDI-O defect (dFDI-O) shall be declared at the trail termination sink function within X ms of detecting the upstream defect causing the insertion of FDI-O into the appropriate portion of the OSC. - -FDI-O defect (dFDI-O) shall be cleared at the trail termination sink function within Y ms of detecting that the upstream defect, which caused the insertion of FDI-O, has cleared. - -X and Y are for further study. - -#### 6.2.6.3 Alarm indication signal defect (dAIS) - -##### 6.2.6.3.1 dAIS at OTUk layer (generic AIS; k = 1, 2, 3) - -The OTUk dAIS defect detection is identical to the CBR client signal dAIS detection defined in clause 6.2.6.3.3. - -NOTE – OTUk-AIS (k = 1, 2, 3) is defined to support a future server layer application. OTN equipment should be capable of detecting the presence of such signal, except in the case of OTSiG/OTUk\_A; it is not required to generate such a signal. - -##### 6.2.6.3.2 dAIS at OTUCn, ODUT and ODUP layer - -dAIS shall be declared if the accepted STAT information (AcSTAT) is "111". dAIS shall be cleared if the accepted STAT information is not equal to "111". For the STAT information acceptance process, see clause 8.8. - -##### 6.2.6.3.3 dAIS for CBR client signals (generic AIS) - -For the CBR dAIS detection, the reverse PN-11 process is applied to the data signal, as shown in Figure 6-5. At the output of this process (OUT), an all-ZEROs pattern will occur if the input data (IN) is the PN-11 generic AIS sequence. Note that an all-ZEROs output pattern will also occur in case of an all-ZEROs input pattern. Both the output (OUT) and input (IN) signals are constantly checked over an 8192-bit interval for the number of non ZERO bits (= ONE bits). If the number of ONE bits per interval at OUT is less than 256 and the number of ONE bits per interval at IN is above or equal to 256 in three consecutive intervals, dAIS is raised. If the number of ONE bits at OUT is above or equal to 256 or the number of ONE bits at IN is below 256 in three consecutive intervals, dAIS is cleared. - -NOTE – Generic AIS forwarded to SDH interfaces will lead to LOF in OSn/RSn\_A\_Sk functions not capable of detecting this AIS signal. In the case where an SDH input interface is connected to an STM-N output signal of a network-element terminating the OTN transport where this AIS signal is inserted, a dLOF defect could be interpreted as an AIS indication. - -![Figure 6-5: Inverse PN-11 process for generic AIS detection. The diagram shows an input signal (IN) entering a series of 11 D flip-flops (D Q) connected in sequence. A common clock signal is provided to all flip-flops. The output of the last flip-flop is labeled OUT. Above the flip-flops, there are two summation nodes (circles with a plus sign). The first summation node takes the output of the 11th flip-flop and a feedback signal from the output of the 10th flip-flop. The second summation node takes the output of the 10th flip-flop and a feedback signal from the output of the 9th flip-flop. The outputs of these two summation nodes are connected to the OUT signal line.](0fa5b60804100c3aead10404f9f226f9_img.jpg) - -The diagram illustrates the Inverse PN-11 process for generic AIS detection. An input signal (IN) enters a chain of 11 D flip-flops (D Q) connected in series. A common clock signal is provided to all flip-flops. The output of the 11th flip-flop is labeled OUT. Above the flip-flops, there are two summation nodes (circles with a plus sign). The first summation node takes the output of the 11th flip-flop and a feedback signal from the output of the 10th flip-flop. The second summation node takes the output of the 10th flip-flop and a feedback signal from the output of the 9th flip-flop. The outputs of these two summation nodes are connected to the OUT signal line. The diagram is labeled G.798(10)\_F6-5. - -Figure 6-5: Inverse PN-11 process for generic AIS detection. The diagram shows an input signal (IN) entering a series of 11 D flip-flops (D Q) connected in sequence. A common clock signal is provided to all flip-flops. The output of the last flip-flop is labeled OUT. Above the flip-flops, there are two summation nodes (circles with a plus sign). The first summation node takes the output of the 11th flip-flop and a feedback signal from the output of the 10th flip-flop. The second summation node takes the output of the 10th flip-flop and a feedback signal from the output of the 9th flip-flop. The outputs of these two summation nodes are connected to the OUT signal line. - -Figure 6-5 – Inverse PN-11 process for generic AIS detection - -#### 6.2.6.4 Backward defect indication payload defect (dBDI-P) - -##### 6.2.6.4.1 dBDI-P at OTS-O and OMS-O layer - -The BDI-P maintenance signal is inserted into the non-associated overhead for a maintenance entity by the source function in response to reception of the FDI-P maintenance signal by the corresponding sink function or detection of a defect in the media element that is being monitored by the maintenance entity. - -Backward defect indication payload defect (dBdi-P) is monitored at the OTS-O and OMS-O layers. The purpose of monitoring this parameter is to allow for single-ended supervision of the trail. - -BDI-P defect (dBdi-P) shall be declared at the trail termination sink function within X ms of detecting the far-end defect causing the insertion of BDI-P into the appropriate portion of the OSC. - -BDI-P defect (dBdi-P) shall be cleared at the trail termination sink function within Y ms of detecting that the far-end defect, which caused the insertion of BDI-P, has cleared. - -X and Y are for further study. - -During signal fail conditions of the overhead signal, dBdi-P shall be set to false. For details on the signal fail conditions, see the specific atomic functions. - -#### **6.2.6.5 Backward defect indication overhead defect (dBdi-O)** - -##### **6.2.6.5.1 dBdi-O at OTS-O and OMS-O layer** - -The BDI-O maintenance signal is inserted into the non-associated overhead of a maintenance entity by the source function in response to reception of FDI-O or detection of a server layer maintenance entity defect in the corresponding sink function. - -Backward defect indication overhead defect (dBdi-O) is monitored at the OTS-O and OMS-O layers. The purpose of monitoring this parameter is to allow for single-ended supervision of the trail. - -BDI-O defect (dBdi-O) shall be declared at the trail termination sink function within X ms of detecting the far-end defect causing the insertion of BDI-O into the appropriate portion of the OSC. - -BDI-O defect (dBdi-O) shall be cleared at the trail termination sink function within Y ms of detecting that the far-end defect, which caused the insertion of BDI-O, has cleared. - -X and Y are for further study. - -During signal fail conditions of the overhead signal, dBdi-O shall be set to false. For details on the signal fail conditions, see the specific atomic functions. - -#### **6.2.6.6 Backward defect indication defect (dBdi)** - -##### **6.2.6.6.1 dBdi at OTU, ODUT and ODUP layer** - -dBdi shall be declared if the BDI bit in the SM/TCMi/PM overhead field (byte 3, bit 5) in the first overhead instance is "1" for X consecutive frames. dBdi shall be cleared if the BDI bit in the SM/TCMi/PM overhead field is "0" for X consecutive frames. For OTUk, ODUkT and ODUkP X shall be 5; for OTUCn, ODUCnT and ODUCnP X shall be 15. - -During signal fail conditions of the data signal, dBdi shall be set to false. For details on the signal fail conditions, see the specific atomic functions. - -#### **6.2.6.7 Payload missing indication defect (dPMI)** - -##### **6.2.6.7.1 dPMI at the OTS-O and OMS-O layer** - -Payload missing indication (PMI) defect is monitored at the OTS-O and OMS-O layers. The purpose of monitoring this parameter is to suppress downstream loss of signal alarms at the trail termination sink due to upstream defects causing missing payload at the start of the trail. - -PMI defect (dPMI) shall be declared at the trail termination sink function within X ms of detecting the missing payload condition causing the insertion of PMI into the appropriate portion of the OSC. - -PMI defect (dPMI) shall be cleared at the trail termination sink function within Y ms of detecting that the missing payload condition, which caused the insertion of PMI, has cleared. - -X and Y are for further study. Values in the range of a few milliseconds are proposed, as PMI has to suppress the payload defect at the sink immediately. - -During signal fail conditions of the overhead signal, dPMI shall be set to false. For details on the signal fail conditions, see the specific atomic functions. - -NOTE – The defect PMI will not result in a fault cause. It is used to suppress LOS-P defects-related consequent actions, defect correlations and performance monitoring data at the OTS-O and OMS-O trail termination sink in case of an already missing payload at the trail termination source (see clauses 6.2.1.1 and 8.10). - -#### **6.2.6.8 Open connection indication defect (dOCI)** - -Open connection indication defect (dOCI) is monitored at the OCh-O, OTSiG-O and ODUk layers. The purpose of monitoring this parameter is to qualify a downstream loss of signal defect by indicating that the loss of signal defect is due to an output connection point not connected to an input connection point. - -##### **6.2.6.8.1 dOCI at the OCh-O and OTSiG-O layer** - -OCI defect (dOCI) shall be declared at the OCh-O and OTSiG-O trail termination sink function within X ms of the OTSiA|OCh connection function having received the command via the MP to disconnect the output OTSiG or OTSi and OTSiG-O or OCh-O CP from an input OTSiG or OTSi and OTSiG-O or OCh-O CP. - -OCI defect (dOCI) shall be cleared at the OCh-O and OTSiG-O trail termination sink function within Y ms of the OCh connection function detecting that the output OTSiG or OTSi and OTSiG-O or OCh-O CP, which the OCI corresponded to, is connected to an input OTSiG or OTSi and OTSiG-O or OCh-O CP. - -X and Y are for further study. - -During signal fail conditions of the overhead signal, dOCI shall be set to false. For details on the signal fail conditions, see the specific atomic functions. - -##### **6.2.6.8.2 dOCI at the ODUkP and ODUkT layer** - -dOCI shall be declared if the accepted STAT information (AcSTAT) is "110". dOCI shall be cleared if the accepted STAT information is not equal to "110". For the STAT information acceptance process, see clause 8.8. - -During signal fail conditions of the data signal, dOCI shall be set to false. For details on the signal fail conditions, see the specific atomic functions. - -NOTE – dOCI is not detected at the ODUCnP and ODUCnT layer. - -#### **6.2.6.9 Locked defect (dLCK)** - -##### **6.2.6.9.1 dLCK at the ODUP and ODUT layer** - -dLCK shall be declared if the accepted STAT information (AcSTAT) is "101". dLCK shall be cleared if the accepted STAT information is not equal to "101". For the STAT information acceptance process, see clause 8.8. - -During signal fail conditions of the data signal, dLCK shall be set to false. For details on the signal fail conditions, see the specific atomic functions. - -#### **6.2.6.10 Incoming alignment error defect (dIAE)** - -NOTE – The defect IAE will not result in a fault cause. It is used to suppress wrong PM data (EBC and DS) at the OTU and ODUT trail termination sink in case of an incoming frame slip to the trail (see clause 8.10). - -##### **6.2.6.10.1 dIAE at the OTUk layer** - -dIAE shall be declared if the IAE bit in the SM overhead field (byte 3, bit 6) is "1" for X consecutive frames. dIAE shall be cleared if the IAE bit in the SM overhead field is "0" for X consecutive frames. X shall be 5. - -During signal fail conditions of the data signal, dIAE shall be set to false. For details on the signal fail conditions, see the specific atomic functions. - -##### **6.2.6.10.2 dIAE at the OTUCn and ODUT layer** - -dIAE shall be declared if the accepted STAT information (AcSTAT) is "010". dIAE shall be cleared if the accepted STAT information is not equal to "010". For the STAT information acceptance process, see clause 8.8. - -During signal fail conditions of the data signal, dIAE shall be set to false. For details on the signal fail conditions, see the specific atomic functions. - -#### **6.2.6.11 Backward incoming alignment error defect (dBIAE)** - -NOTE – The defect BIAE will not result in a fault cause. It is used to suppress wrong far-end PM data (EBC and DS) at the OTU and ODUT trail termination sink in case of an incoming frame slip to the trail (see clause 8.10). - -##### **6.2.6.11.1 dBIAE at the OTU and ODUT layer** - -dBIAE shall be declared if the BEI/BIAE bits in the SM/TCM overhead field (byte 3, bits 1 to 4) in the first overhead instance are "1011" for X consecutive frames. dBIAE shall be cleared if the BEI/BIAE bits in the SM/TCM overhead field are not equal to "1011" for X consecutive frames. X shall be 3. - -During signal fail conditions of the data signal, dBIAE shall be set to false. For details on the signal fail conditions, see the specific atomic functions. - -### **6.2.7 Protocol supervision** - -#### **6.2.7.1 Protection protocol supervision** - -##### **6.2.7.1.1 ODU linear protection failure of protocol provisioning mismatch (dFOP-PM)** - -ODUk dFOP-PM shall be declared when the B bit of the transmitted and accepted APS protocol do not match. - -ODUk dFOP-PM shall be cleared when the B bit of the transmitted and accepted APS protocols do match. - -For a description of the APS protocol, see [ITU-T G.873.1]. - -##### **6.2.7.1.2 ODU linear protection failure of protocol no response defect (dFOP-NR)** - -ODUk dFOP-NR shall be declared when the requested signal and the bridge signal in the APS protocol do not match within 1 s. - -NOTE – The time after which a response on a bridge request is received depends on the transmission delay between the protection switching nodes (and the processing delay in the nodes). - -ODUk dFOP-NR shall be cleared when the requested signal and the bridge signal in the APS protocol match. - -For a description of the APS protocol, see [ITU-T G.873.1]. - -#### **6.2.7.2 Security protocol supervision** - -##### **6.2.7.2.1 FlexOsec decryption unlock and replay defect (dUnlockSec)** - -The defect dUnlockSec shall be generated based on the state of the lock process within the FlexOsec sink processes (see clause 8.14.2). If the process is in the out-of-lock (OOL) or pre-lock (PL) state, dUnlockSec shall be declared. dUnlockSec shall be cleared immediately when the process is in the in-lock (IL) state. - -### 6.2.8 Optical supervisory channel (OSC) related defects - -As the specific format of the OSC is outside the scope of [ITU-T G.709], no specific defects, except for dLOS-O (see clause 6.2.1.3), are defined in this Recommendation either. However, depending on the specific OSC format, additional defect detection (e.g., loss of alignment) is required. These defects will contribute to the TSF-P, SSF-P, FDI-P and BDI-P consequent actions. - -### 6.2.9 Multiplex structure identifier mismatch supervision defect (dMSIM) - -#### 6.2.9.1 dMSIM[i] at the ODUkP layer - -Refer to clause 8.7.2.1 for a description of AcMSI[i] and ExMSI[i]. - -The defect dMSIM shall be declared if the AcMSI is not equal to the ExMSI. dMSIM shall be cleared if the AcMSI is equal to the ExMSI. - -ExMSI is either a fixed value or configured via the management interface in the applicable atomic functions. - -For the AcMSI acceptance process, see clause 8.7.2.1. - -dMSIM shall be detected within 100 ms of changes to the AcMSI or the ExMSI. - -NOTE – The dMSIM defect as detected on an OPUk multiplex structure does not detect all possible wrong configurations on both sides of the link. For instance, if there are unallocated tributary slots that are carrying an ODUj with a tributary port that is also not allocated, such a mismatch will not lead to dMSIM defect detection. Also, in cases where timeslots in a received multiplexed signal are part of a client ODU structure, which are not configured to be allocated as timeslots at the ODUkP/ODUj adaptation sink for that client ODUj, this condition will not be detected and alarmed. The dLOFLOM defect will be detected in such cases. - -#### 6.2.9.2 dMSIM[i] at the ODUCnP and FlexO layers - -The dMSIM defect for ODU tributaries is based on comparing the AcMSI and ExMSI of all OPU instances. - -Upon accepting a new AcMSI value for an OPU instances the nMSIM anomalies for all tributary ports are initialized to false. The AcMSI are then compared to the ExMSI for all OPU instances. For each case where the AcMSI and ExMSI values pertaining to the same tributary slot are not equal, - -- a) if the tributary slot is allocated in the ExMSI value, the nMSIM anomaly of the tributary port subfield of the ExMSI value is set, -- b) if the tributary slot is allocated in the AcMSI value, the nMSIM anomaly of the tributary port subfield of the AcMSI value is set. - -The dMSIM defect of each tributary port shall be set to the corresponding nMSIM anomaly. - -``` - -for trib_port = 1 to number_of_trib_ports - nMSIM[trib_port] = false - -for opu = 1 to number_of_instances - for trib_slot = 1 to number_of_trib_slots - if AcMSI[opu][trib_slot] != ExMSI[opu][trib_slot] - if ExMSI[opu][trib_slot].allocated - nMSIM[ ExMSI[trib_slot].trib_port ] = true - if AcMSI[opu][trib_slot].allocated - nMSIM[ AcMSI[trib_slot].trib_port ] = true - -for trib_port = 1 to number_of_trib_ports - dMSIM[trib_port] = nMSIM[trib_port] - -``` - -For the AcMSI acceptance process, see clause 8.7.2.2. - -dMSIM shall be detected within 100 ms of changes to the AcMSI or the ExMSI. - -#### 6.2.9.3 dMSIM[i] at the OMS-O layer - -The defect dMSIM shall be declared if the AcMSI is not equal to the ExMSI. dMSIM shall be cleared if the AcMSI is equal to the ExMSI. - -The format of the AcMSI and ExMSI and the AcMSI acceptance process depends on the specific implementation. - -### 6.2.10 Client signal fail defect (dCSF) - -dCSF shall be declared if the CSF bit in the OPUk PSI overhead (bit 1 of the PSI[2] byte) is "1" for X consecutive 256-frame multiframes. dCSF shall be cleared if the CSF bit is "0" for X consecutive 256-frame multiframes. X shall be 3. - -### 6.2.11 Cipher Suite Type mismatch supervision (dCSTM) - -#### 6.2.11.1 dCSTM at the FlexO layer - -For a FlexO-*x* frame of *x* FlexO instances, dCSTM shall be declared if the accepted cipher suite type (AcCST) is not equal to the expected cipher suite type(s), as defined by the specific adaptation function, in any of the *x* FlexO instances. dCSTM shall be cleared if the accepted cipher suite type is equal to the expected cipher suite type(s), as defined by the specific adaptation function, in all of the *x* FlexO instances. - -NOTE – An adaptation function may support more than one cipher suite type. - -For the cipher suite type acceptance process, see clause 8.14.2. - -## 6.3 Consequent actions - -For consequent actions, see [ITU-T G.806] and the specific atomic functions. - -## 6.4 Defect correlations - -For the defect correlations, see the specific atomic functions. - -## 6.5 Performance filters - -### 6.5.1 One-second performance monitoring filters associated with counts - -#### 6.5.1.1 Errored block count (EBC) - -The one-second performance monitoring filters pN\_EBC and pF\_EBC are defined in clause 6.5 of [ITU-T G.806]. For the application of these filters, see the specific atomic functions. - -The OTN errored block definitions are given in Tables 6-2 and 6-3. - -During signal fail conditions of the data signal, no errored blocks shall be counted. For details on the signal fail conditions, see the specific atomic functions. - -**Table 6-2 – OTN near-end errored blocks definition** - -| Layer | Errored block definition | Number of blocks per second (Note 4) | -|---------------------------|-------------------------------------------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| OTU
(Notes 1 and 3) | One or more errors detected by the OTU BIP-8 | OTU0: 10168
OTU1: 20421
OTU2: 82026
OTU3: 329492
OTU4: 856388
OTU25u: 205094
OTU25: 215823
OTU50u: 410187
OTU50: 431645
OTUCn: $n \times 860177$ | -| ODUT/P
(Notes 2 and 3) | One or more errors detected by the ODUT/P BIP-8 | ODU0 10168
ODU1: 20421
ODU2: 82026
ODU2e 84986
ODU3: 329492
ODU4: 856388
ODU25u: 205094
ODU25: 215823
ODU50u: 410187
ODU50: 431645
ODUflex: $ODUflex\_bit\_rate/122368$
ODUCn: $n \times 860177$ | - -NOTE 1 – The block size for OTUk, $k = 0, 1, 2, 3, 4$ is equal to the OTUk frame size, which is $4 \times 4080 \times 8 = 130\,560$ bits. The block size for OTU25 and OTU50 is equal to the OTU25 and OTU50 frame size, which is $4 \times 3824 \times 8 = 122\,368$ bits. The block size for OTUC is equal to the OTUC instance frame size, which is $4 \times 3824 \times 8 = 122\,368$ bits. An OTUCn has n OTUC instances and n blocks. - -NOTE 2 – The block size for ODUk, $k = 0, 1, 2, 2e, 3, 4, 25, 50, flex$ is equal to the ODUk frame size, which is $4 \times 3824 \times 8 = 122\,368$ bits. The block size for ODUC is equal to the ODUC instance frame size, which is $4 \times 3824 \times 8 = 122\,368$ bits. An ODUCn has n ODUC instances and n blocks. - -NOTE 3 – The EDC is BIP-8, and is computed over the OPU payload instance ( $4 \times 3808 \times 8$ bits) plus OPU overhead instance ( $4 \times 2 \times 8$ bits), for a total of $4 \times 3810 \times 8 = 121\,920$ bits. The EDC usage is $1 \times BIP-8$ . - -NOTE 4 – These values are rounded to the next larger integer value. - -**Table 6-3 – OTN far-end errored blocks definition** - -| Layer | Errored block definition | Number of blocks per second (Note) | -|-------------------------------------------------------------------|---------------------------------------------------------|--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| OTU | One or more errors indicated by BEI in the OTU frame | OTU0: 10168
OTU1: 20421
OTU2: 82026
OTU3: 329492
OTU4: 856388
OTU25u: 205094
OTU25: 215823
OTU50u: 410187
OTU50: 431645
OTUCn: $n \times 860177$ | -| ODUT/P | One or more errors indicated by BEI in the ODUT/P frame | ODU0 10168
ODU1: 20421
ODU2: 82026
ODU2e: 84986
ODU3: 329492
ODU4: 856388
ODU25u: 205094
ODU25: 215823
ODU50u: 410187
ODU50: 431645
ODUflex: $ODUflex\_bit\_rate / 122368$
ODUCn: $n \times 860177$ | -| NOTE – These values are rounded to the next larger integer value. | | | - -#### 6.5.1.2 Defect second (DS) - -The one-second performance monitoring filters pN\_DS and pF\_DS are defined in clause 6.5 of [ITU-T G.806]. For the application of these filters, see the specific atomic functions. - -#### 6.5.1.3 FEC corrected errors (FECcorrErr) - -The number of bits corrected by the FEC (see clause 8.5) are counted over one second and reported to the MI at the end of the second. For the application of this filter, see the specific atomic functions. - -During signal fail conditions of the data signal, no corrected bits shall be counted. For details on the signal fail conditions, see the specific atomic functions. - -#### 6.5.1.4 Authentication failures (AuthCheckErr) - -The number of received frames that have failed integrity check (i.e., authentication failures, see clause 8.14.2) are counted over one second and reported to the MI at the end of the second. For the application of this filter, see the specific atomic functions. - -During signal fail conditions of the data signal, no authentication failure shall be counted. For details on the signal fail conditions, see the specific atomic functions. - -# 7 Information flow across reference points - -See clause 7 of [ITU-T G.806] for a generic description of information flow. For the OTN-specific information flow, see the description of the functions in clauses 9 and following. - -# 8 Generic processes - -Generic processes are defined in clause 8 of [ITU-T G.806]. This clause defines the specific process for the OTN. - -## 8.1 Blank clause - -NOTE – This clause is intentionally left blank. - -## 8.2 Alignment processes - -### 8.2.1 OTU frame alignment - -The OTU frame alignment shall be found by searching for the OA1, OA2 FAS bytes (see [ITU-T G.709]) contained in the OTU frame. - -The process has two states, out-of-frame (OOF) and in-frame (IF). - -In the OOF state, the framing pattern searched for shall be a 4-byte subset of the OA1 and OA2 bytes. The IF state shall be entered if this subset is found and confirmed one frame period later. - -In the IF state, the frame signal shall be continuously checked with the presumed frame start position for correct alignment. The framing pattern checked for shall be the OA1OA2OA2 pattern (bytes 3, 4 and 5 of the first row of the OTU frame). The OOF state shall be entered if this subset is not found at the correct position in five consecutive frames. - -The frame start shall be maintained during the OOF state. - -### 8.2.2 OTU and FlexO multiframe alignment - -The OTU multiframe alignment shall be found based on the MFAS byte of the first instance of the OTU overhead (see [ITU-T G.709]) contained in the OTU frame. The FlexO multiframe alignment shall be found based on the MFAS byte (see clause 9.2.1 of [ITU-T G.709.1]) contained in the FlexO frame. - -The process has two states, out-of-multiframe (OOM) and in-multiframe (IM). - -In the IM state, OOM shall be assumed when the received MFAS does not match with the expected multiframe number in five consecutive frames. - -In the OOM state, multiframe alignment shall be assumed to be recovered, the multiframe counter shall be set to the new MFAS, and the IM state shall be entered, when a valid MFAS sequence is found in two consecutive frames. The MFAS sequence is valid if the MFAS of the second frame is the increment of the MFAS of the first frame. - -The multiframe start shall be maintained during the OOM state. - -### 8.2.3 Frame and multiframe alignment for OTUC or extended ODUj - -The OTUC or extended ODUj frame and multiframe alignment shall be found by searching for the framing pattern (OA1, OA2 FAS bytes) and checking the multiframe sequence (MFAS byte) (see [ITU-T G.709]) contained in the OTUC or extended ODUj frame structure. - -The process has two states, out-of-frame (OOF) and in-frame (IF). - -In the OOF state, the framing pattern searched for shall be the full set of the OA1 and OA2 bytes. The IF state shall be entered if this set is found and confirmed one frame period later and an error-free multiframe sequence is found in the MFAS bytes of the two frames. - -In the IF state, the frame alignment signal shall be continuously checked with the presumed frame start position and the expected multiframe sequence. The framing pattern checked for shall be the OA1OA2 pattern (bytes 3 and 4 of the first row of the OTUC or extended ODUj frame structure). The OOF state shall be entered if this subset is not found at the correct position within five consecutive - -frames, or the received MFAS does not match the expected multiframe number within five consecutive frames. - -The frame and multiframe start shall be maintained during the OOF state. - -### 8.2.4 Blank clause - -NOTE – This clause is intentionally left blank. - -### 8.2.5 OTU logical lane frame alignment - -OTU logical lane frame alignment shall be found by searching for the OA1, OA2 FAS bytes within the logical lane. As specified in Annex C of [ITU-T G.709], the OTU logical lane frame alignment signal consists of three OA1 followed by N OA2 bytes and is present periodically every 16320 bytes. N = 3 for the four-logical-lane (OTU3) interface and N = 2 for the 20-logical-lane (OTU4) interface. - -The process has two states, out-of-frame (OOF) and in-frame (IF). - -In the OOF state, the framing pattern searched for shall be a 4-byte subset of the OA1 and OA2 bytes. The IF state shall be entered if this subset is found and confirmed a period of 16320 bytes later. - -In the IF state, the frame signal shall be continuously checked with the presumed frame start position for correct alignment. The framing pattern checked for shall be the OA1OA2OA2 pattern (bytes 3, 4 and 5 of the first row of the logical lane frame). The OOF state shall be entered if this subset is not found at the correct position in five consecutive periods of 16320 bytes. - -The frame start shall be maintained during the OOF state. - -NOTE – This process is identical to the OTUk frame alignment process. - -### 8.2.6 OTU logical lane alignment - -The OTU logical lane alignment process is used to establish alignment of the lanes of the OTU multilane interface. - -The bytes of the OTUk signals (k = 3, 4) are distributed to the logical lanes in 16-byte increments as specified in Annex C of [ITU-T G.709]. - -For the OTU3 with four logical lanes, the MFAS is reused as logical lane marker information. The MFAS sequence 00000000, 00000001, ..., 11111111 (i.e., 0 to 255) is inserted before distribution of the OTU3 bytes over the four logical lanes. After distribution of the OTU3 16-byte increments over the four logical lanes, each lane will carry a subset of the MFAS values of which the two least significant bits are constant (either 00, 01, 10, or 11) and identifies the logical lane number. - -- Logical lane 0 will carry the following MFAS values: 00000000 – 00000100 – 00001000 – 00001100 – 00010000 – 00010100 – ... – 11111100. -- Logical lane 1 will carry the following MFAS values: 00000001 – 00000101 – 00001001 – 00001101 – 00010001 – 00010101 – ... – 11111101. -- Logical lane 2 will carry the following MFAS values: 00000010 – 00000110 – 00001010 – 00001110 – 00010010 – 00010110 – ... – 11111110. -- Logical lane 3 will carry the following MFAS values: 00000011 – 00000111 – 00001011 – 00001111 – 00010011 – 00010111 – ... – 11111111. - -For the OTU4 with twenty logical lanes the LLM carries the logical lane marker information. The LLM sequence 00000000, 00000001, ..., 11101111 (i.e., 0 to 239) is inserted before the distribution of the OTU4 bytes over the twenty logical lanes. After the distribution of the OTU4 16-byte increments over the twenty logical lanes, each logical lane will carry a subset of the LLM values of which the modulo 20 value is constant and identifies the logical lane number. - -- Logical lane 0 will carry the following LLM values (0, 20, 40, 60, ..., 200, 220): 00000000 – 00010100 – ... – 11011100. - -- Logical lane 1 will carry the following LLM values (1, 21, 41, 61, ..., 201, 221): 00000001 – 00010101 – ... – 11011101. -- ... -- Logical lane 18 will carry the following LLM values (18, 38, 58, 78, ..., 218, 238): 00010010 – 00100110 – ... – 11101110. -- Logical lane 19 will carry the following LLM values (19, 39, 59, 79, ..., 219, 239): 00010011 – 00100111 – ... – 11101111. - -#### 8.2.6.1 OTU3 multilane alignment - -The process has two sub-processes: - -- logical lane marker recovery (per lane); -- multilane alignment (composite signal). - -The logical lane marker signal is located in bits 7 and 8 of the MFAS byte of the logical lane frame. These bits are scrambled with the scrambler given in clause 11.2 of [ITU-T G.709]. - -A logical lane marker recovery process is present per logical lane to recover the logical lane marker value. A new value of the logical lane marker is accepted when in five consecutive 16320-byte periods the same value is present in bits 7 and 8 of the MFAS byte, and the recovery process will enter the in-recovery (IR) state. In the IR state, recovery will be lost, and the out-of-recovery (OOR) state will be entered, when in each of five consecutive 16320-byte periods a value is received that is not the same as the accepted logical lane marker value. During an OOR period, the last accepted LLM value has to be maintained as a lane marker value. - -If the logical lane marker recovery process is in the out-of-recovery (OOR) state for 3 ms, LOR state shall be entered. LOR shall be left when the IR state persists continuously for 3 ms. - -The value of the logical lane marker is available after descrambling. - -Each of the four lanes shall have recovered a unique logical lane marker value in the range 0 to 3. - -If all four logical lanes have different values, the bytes of each logical lane shall be written into an elastic store with the indication of the start of the logical lane 16320-byte period boundary in line with the logical lane marker. - -If the bytes of the lane signals can be written consistently into the elastic store in the presence of a differential delay in line with the particular adaptation function without exceeding the buffering time, the in-multilane-alignment (ILA) state shall be entered. In this case, the differential delay can be compensated. - -If two or more logical lanes have the same logical lane marker value, or if one or more logical lane marker recovery processes are in the LOR state, or if the differential delay between two logical lanes exceeds the maximum delay that can be compensated in accordance to the related sink function, multilane alignment is not possible and the out-of-multilane-alignment (OLA) state is entered. - -#### 8.2.6.2 OTU4 multilane alignment - -The process has two sub-processes: - -- logical lane marker recovery (per lane); -- multilane alignment (composite signal). - -The logical lane marker signal is located in the LLM byte of the logical lane frame. - -A logical lane marker recovery process is present per logical lane to recover the logical lane marker value. A new value of the logical lane marker is accepted when in five consecutive 16320-byte periods the same value is present after modulo 20 operation of the LLM byte value, and the recovery process will enter the in-recovery (IR) state. In the IR state, recovery will be lost and the out-of-recovery - -(OOR) state be entered, when in each of five consecutive 16320-byte periods a value is received that is not the same as the accepted logical lane marker value. During an OOR period, the last accepted LLM value has to be maintained as lane marker value. - -If the logical lane marker recovery process is in the out-of-recovery (OOR) state for 3 ms, LOR state shall be entered. LOR shall be left when the IR state persists continuously for 3 ms. - -Each of the twenty logical lanes shall have recovered a unique logical lane marker value in the range 0 to 19. - -The process shall in addition decode the MFAS signal as coded in the 7th byte following the lane identification byte and identify the position of the virtual lane data in relation to the OTU4 multiframe. This position needs to be descrambled according to the scrambler defined in clause 11.2 of [ITU-T G.709]. - -If the lane identification and MFA identification for all lanes is detected consistently in line with the modulo 20 operation of the LLM byte position together with the MFA value, the data shall be written into the elastic store for realignment with the indication of the start of the logical lane 16320-byte period boundary in line with the logical lane marker. - -If the bytes of the logical lane signals can be written consistently into the elastic store in the presence of a differential delay in line with the particular adaptation function without exceeding the buffering time, the ILA state shall be entered. In this case the differential delay can be compensated. - -If two or more logical lanes have the same logical lane marker value, or if one or more logical lane marker recovery processes are in the LOR state, or if the differential delay between two logical lanes exceeds the maximum delay that can be compensated in accordance to the related sink function, multilane alignment is not possible and the out-of-multilane-alignment (OLA) state is entered. - -### 8.2.7 Block Synchronization - -#### 8.2.7.1 66B Block synchronization - -The process shall recover the 66b block from the payload bytes in the OPU frame through the 66b block synchronization lock state machine as described in Figure 82-12 of [IEEE 802.3]. The lock process looks for 64 consecutive valid sync headers in the initial data stream to declare lock. A valid sync header is either a 01 or a 10. Once in lock, the lock process looks for 65 invalid sync headers within a 1024 sync window to declare out of lock. An invalid sync header is a 11 or 00. In case the mapping procedure preserves the 2-bit alignment of each 66b block to the OPUflex payload boundary the SLIP step of the lock process may be optimized using 2-bit slips. - -### 8.2.8 Frame alignment for FlexO-*x* (*x* = 1, 2, 4) - -The FlexO-*x* frame alignment shall be found by searching for the alignment markers pattern (AM field) contained in the FlexO-*x* frame structure (see clauses 9.1.1, 9.1.3 and 9.1.5 of [ITU-T G.709.1]). - -The process has two states, out-of-frame (OOF) and in-frame (IF). - -In the OOF state, the alignment pattern searched for shall be the full set of the AM bits. The IF state shall be entered if this set is found and confirmed one frame period later. - -In the IF state, the frame alignment signal shall be continuously checked with the presumed frame start position. The framing pattern checked for shall be the first 40 bits of alignment pattern. The OOF state shall be entered if this subset is not found at the correct position within five consecutive frames. - -The frame start shall be maintained during the OOF state. - -### 8.2.9 Frame alignment for OTU25(u) or OTU50(u) - -The OTU25(u) or OTU50(u) frame alignment shall be found by searching for the framing pattern (OA1, OA2 FAS bytes). - -The process has two states, out-of-frame (OOF) and in-frame (IF). - -In the OOF state, the framing pattern searched for shall be the full set of the OA1 and OA2 bytes. The IF state shall be entered if this set is found and confirmed one frame period later. - -In the IF state, the frame alignment signal shall be continuously checked with the presumed frame start position. The framing pattern checked for shall be the OA1OA2 pattern (bytes 3 and 4 of the first row of the OTU25(u) or OTU50(u) frame structure). The OOF state shall be entered if this subset is not found at the correct position within five consecutive frames. - -The frame start shall be maintained during the OOF state. - -## **8.3 Signal quality supervision** - -### **8.3.1 Blank clause** - -NOTE – This clause is intentionally left blank. - -### **8.3.2 Blank clause** - -NOTE – This clause is intentionally left blank. - -### **8.3.3 Blank clause** - -NOTE – This clause is intentionally left blank. - -### **8.3.4 OTU, ODUT and ODUP signal quality supervision** - -A BIP-8 is used for each of these layers as defined in clause 15 of [ITU-T G.709]. - -#### **8.3.4.1 BIP-8 source processing** - -The BIP-8 shall be computed over the OPU area of the OTU frame (columns 15 to 3824). The computed BIP-8 is inserted in the BIP-8 byte position of the relevant overhead field of the 2nd following frame as shown in Figure 8-1. - -The OTUk/ODUk contains one instance of the OTU, ODU PM and ODU TCMi BIP-8 overhead fields. The OTUCn/ODUCn contains n instances of the OTU, ODU PM and ODU TCMi BIP-8 overhead fields, numbered 1 to n (BIP-8 #1 to BIP-8 #n). - -![Diagram illustrating BIP-8 source processing across three frames (Frame #i, Frame #i+1, Frame #i+2). It shows the OPU instance area (columns 15-3824) and the BIP-8 byte position (column 14). For Frame #i, the BIP-8 value is computed from the OPU instance. For Frame #i+1, the BIP-8 value is inserted into the frame. For Frame #i+2, the BIP-8 value is extracted from the frame. The diagram includes a 'Compute' block for Frame #i and an 'Insert' block for Frame #i+1.](c1df61cc3717e878a48e530218403403_img.jpg) - -The diagram shows three OTU frames: Frame #i, Frame #i+1, and Frame #i+2. Each frame has columns 1, ..., 14, 15, ..., 3824. Columns 15 to 3824 form the OPU instance. Column 14 contains the BIP-8 byte. In Frame #i, the BIP-8 value is computed from the OPU instance. In Frame #i+1, the BIP-8 value is inserted into the frame. In Frame #i+2, the BIP-8 value is extracted from the frame. The diagram includes a 'Compute' block for Frame #i and an 'Insert' block for Frame #i+1. - -Diagram illustrating BIP-8 source processing across three frames (Frame #i, Frame #i+1, Frame #i+2). It shows the OPU instance area (columns 15-3824) and the BIP-8 byte position (column 14). For Frame #i, the BIP-8 value is computed from the OPU instance. For Frame #i+1, the BIP-8 value is inserted into the frame. For Frame #i+2, the BIP-8 value is extracted from the frame. The diagram includes a 'Compute' block for Frame #i and an 'Insert' block for Frame #i+1. - -G.798(17)\_F8-1 - -**Figure 8-1 – BIP-8 source processing (SMOH used as example)** - -#### 8.3.4.2 BIP-8 sink processing - -The BIP-8 is computed over the OPU area of the OTU frame (columns 15 to 3824). The BIP-8 value generated by the TT\_So shall be extracted from the BIP-8 byte position of the relevant overhead field. The computed BIP-8 value of the 2nd preceding frame is compared with the BIP-8 value extracted from the current frame, as shown in Figure 8-2. Per OPU instance, if there is a mismatch between the two values, one near-end errored block is detected and the number of BIP violations (nBIPV) for that instance is forwarded to the companion TT\_So function. The near-end errored block (nN\_B) count is the sum of the errored blocks over all OPU instances. - -![Figure 8-2 – BIP-8 sink processing (SMOH used as example). The diagram illustrates the BIP-8 sink processing flow for multiple OPU instances. It shows the extraction of BIP-8 bytes from the payload, computation of BIP-8 values, XORing with the extracted bytes, and counting violations to identify errored blocks. The final output is the total number of errored blocks (nN_B).](38cbce07f83fba6d5a7c46605bd5743f_img.jpg) - -The diagram shows the BIP-8 sink processing flow for multiple OPU instances (instance #1 to instance #n). The input consists of frames (Frame #i-2, Frame #i-1, Frame #i) with columns representing bytes (1, ..., 14, 15, ..., 3824). The payload area is labeled 'OPU instance #1' and 'OPU instance #n'. The processing steps are as follows: - -- Compute:** For each OPU instance, a BIP-8 value is computed from the payload. -- Extract:** The BIP-8 byte is extracted from the payload. -- XOR:** The extracted BIP-8 byte is XORed with the computed BIP-8 value. -- Number of BIP violations:** The result of the XOR operation is used to determine the number of BIP violations. -- ≥ 1:** If the number of BIP violations is greater than or equal to 1, it is an errored block. -- Σ:** The total number of errored blocks is summed across all OPU instances to produce the final output nN\_B. - -Reference: G.798(17)\_F8-2 - -Figure 8-2 – BIP-8 sink processing (SMOH used as example). The diagram illustrates the BIP-8 sink processing flow for multiple OPU instances. It shows the extraction of BIP-8 bytes from the payload, computation of BIP-8 values, XORing with the extracted bytes, and counting violations to identify errored blocks. The final output is the total number of errored blocks (nN\_B). - -Figure 8-2 – BIP-8 sink processing (SMOH used as example) - -## 8.4 Blank clause - -NOTE – This clause is intentionally left blank. - -## 8.5 Forward error correction (FEC) processing - -The FEC decoder shall report the number of corrected bits (nFECcorrErr). For further processing, see clause 6.5.1.3. - -### 8.5.1 No FEC - -The FEC encoder and decoder processes are null processes ignoring the FEC area and connecting their output signals to the corresponding input signals. - -### 8.5.2 RS(255,239,8) FEC for OTUk (k = 0, 1, 2, 3, 4) - -The RS(255,239,8) FEC algorithm is specified in Annex A of [ITU-T G.709]. - -Adaptation of the OTUk message data and FEC parity into the FEC frame is specified in Annex A of [ITU-T G.709]. - -The FEC encoder process shall generate the FEC code and insert it into the FEC area. - -The FEC decoder process shall extract the FEC data from the FEC area and perform error correction if FEC processing is enabled (i.e., FEC is mandatory or MI\_FECEn is true). Otherwise, if FEC is optional and MI\_FECEn is false, the FEC data is ignored, and no error correction is performed. The number of corrected bits shall be reported (nFECcorrErr). For further processing, see clause 6.5.1.3. - -### 8.5.3 Vendor-specific FEC for OTUk-v (k = 0, 1, 2, 3, 4) - -The FEC algorithm is vendor-specific. - -Adaptation of the OTUk message data and FEC parity into the FEC frame is specified in Annex A of [ITU-T G.709]. - -The FEC encoder process shall generate the FEC code and insert it into the FEC area. - -The FEC decoder process shall extract the FEC data from the FEC area and perform error correction if FEC processing is enabled (i.e., FEC is mandatory or MI\_FECEn is true). Otherwise, if FEC is optional and MI\_FECEn is false, the FEC data is ignored, and no error correction is performed. The number of corrected bits shall be reported (nFECcorrErr). For further processing, see clause 6.5.1.3. - -### **8.5.4 Staircase (SC) FEC for OTU4-SC and FlexO-*x*-SC (*x* = 1, 2, 4)** - -The SC FEC algorithm is specified in Annex A of [ITU-T G.709.2]. - -Adaptation of the OTU4-SC message data and FEC parity into the FEC frame is specified in Annex B of [ITU-T G.709.2]. Adaptation of the FlexO-1-SC message data and FEC parity into the FEC frame is specified in Annex B of [ITU-T G.709.3]. Adaptation of the FlexO-2-SC or FlexO-4-SC message data and FEC parity into the FEC frame is specified in Annex C of [ITU-T G.709.3]. - -The FEC encoder process shall generate the FEC code and insert it into the OTU4-SC or FlexO-*x*-SC FEC parity area. - -The FEC decoder process shall extract the FEC data from the FEC information and parity area and perform error correction. The number of corrected bits shall be reported (nFECcorrErr). For further processing, see clause 6.5.1.3. - -### **8.5.5 RS(544,514,10) FEC for FlexO-*x*-RS (*x* = 1, 2, 4)** - -The RS(544,514,10) FEC algorithm is specified in Annex A of [ITU-T G.709.1]. - -Adaptation of the FlexO-*x*-RS message data and FEC parity into the FEC frame is specified in clause 11.5 of [ITU-T G.709.1] for FlexO-1-RS, clause 12.5 of [ITU-T G.709.1] for FlexO-2-RS and clause 13.5 of [ITU-T G.709.1] for FlexO-4-RS. - -The FEC encoder process shall generate the FEC code and insert it into the FlexO-*x*-RS FEC area. - -The FEC decoder process shall extract the FEC data from the FEC area and perform error correction. The number of corrected bits shall be reported (nFECcorrErr). For further processing, see clause 6.5.1.3. - -### **8.5.6 RS(544,514,10) FEC for OTU*k*-RS (*k* = 25, 50u, 50)** - -The RS(544,514,10) FEC algorithm is specified in Annex A of [ITU-T G.709.4]. - -Adaptation of the OTU*k*-RS message data and FEC parity into the FEC frame is specified in clause 8.5 of [ITU-T G.709.4] for OTU25-RS and clause 9.5 of [ITU-T G.709.4] for OTU50(u)-RS. - -The FEC encoder process shall generate the FEC code and insert it into the OTU*k* FEC area. - -The FEC decoder process shall extract the FEC data from the FEC area and perform error correction if FEC processing is enabled (MI\_FECEn is true). Otherwise, the FEC data is ignored, and no error correction is performed. The number of corrected bits shall be reported (nFECcorrErr). For further processing, see clause 6.5.1.3. - -### **8.5.7 RS(528,514,10) FEC for OTU25u-RS** - -The RS(528,514,10) FEC algorithm is specified in Annex C of [ITU-T G.709.4]. - -Adaptation of the OTU25u message data and FEC parity into the FEC frame is specified in clause 8.5 of [ITU-T G.709.4]. - -The FEC encoder process shall generate the FEC code and insert it into the OTU*k* FEC area. - -The FEC decoder process shall extract the FEC data from the FEC area and perform error correction if FEC processing is enabled (MI\_FECEn is true). Otherwise, the FEC data is ignored, and no error correction is performed. The number of corrected bits shall be reported (nFECcorrErr). For further processing, see clause 6.5.1.3. - -### **8.5.8 Extended Hamming soft decision FEC for FlexO-*x*-DSH (*x* = 1, 2, 4)** - -The systematic (128,119) double-extended Hamming code algorithm for the FlexO-*x*-DSH is specified in clause 15.4.4 of [ITU-T G.709.3]. - -Adaptation of each 119-bit message data within the extended FlexO-*x*-SC FEC block group (FBG) structure and FEC parity into the 128-bit Hamming SD FEC blocks is specified in Annex D of [ITU-T G.709.3]. - -The FEC encoder process shall generate the FEC code and insert it into the FEC area. - -The soft decision FEC decoder process shall extract the FEC data from the FEC area and perform error correction. - -### **8.5.9 Extended BCH(256,239) soft decision OFEC code for FlexO-*x*-DO (*x* = 1, 2, 4)** - -The OFEC soft decision code algorithm for the FlexO-*x*-DO uses a spatially coupled TPC-like code with an extended BCH(256,239) constituent code as specified in clause 16.4.4 of [ITU-T G.709.3]. Adaptation of each message data within the OFBGz structure into the FEC codewords with parity bits is specified in clauses 16.4.3, 16.4.4 and Annex E of [ITU-T G.709.3]. - -The FEC encoder process shall generate the FEC code and insert it into the FEC area. - -The soft decision OFEC decoder process shall extract the FEC data from the FEC area and perform error correction (see Annex E of [ITU-T G.709.3]). The number of corrected bits shall be reported (nFECcorrErr). For further processing, see clause 6.5.1.3. - -## **8.6 Trail trace identifier (TTI) processing** - -On request via the management interface (MI\_GetAcTTI), the TTI shall be reported within 100 ms. It shall be an accepted TTI (AcTTI) instead of the received TTI (RxTTI). The acceptance process shall include a persistency check in order to avoid wrong/toggling TTI values during bit error conditions. - -For the TIM defect detection process, see clause 6.2.2.1. - -## **8.7 Payload structure indication (PSI) acceptance processes** - -### **8.7.1 Payload type (PT) acceptance process** - -#### **8.7.1.1 OPU PT** - -A new payload type is accepted (AcPT) if a new consistent value is received in the PSI[0] byte of the first instance of the OPU overhead in *X* consecutive multiframes. *X* shall be 3. - -#### **8.7.1.2 FlexO PT** - -A new payload type is accepted (AcPT) if a new value of the PT byte field of the FlexO overhead is received in an overhead frame with good CRC. - -### **8.7.2 Multiplex structure identifier (MSI) acceptance process** - -#### **8.7.2.1 ODUk multiplex structure identifier (MSI) acceptance process** - -The multiplex structure identifier (MSI) consists of 2, 4, 8, 16, 20, 32, 40 or 80 bytes, which are located in the multiframed PSI overhead as illustrated in Table 8-1. The MSI of an ODUk contains one byte per tributary slot. - -The MSI describes the allocation of tributary slots to ODTUs that contain the client ODUs. Each ODTU is identified by means of either a 2-tuple (*k* = 1, 2, 3), or (*k* = 4, 25u, 25, 50u, 50). - -An ODTU is carried in one or more tributary slots a, b, ..., n. The MSI byte(s) associated with this/those tributary slot(s) is/are configured with a common 2-tuple value in the adaptation source function. The value of these 2-tuples is the same for every MSI byte in this set. - -The adaptation sink function gets its ODTU to tributary slot allocation configured via the expected MSI (ExMSI) fields. The ExMSI fields with the same 2-tuple value specify in which tributary slots an ODTU is expected to be carried; e.g., A, B, ..., N ( $A < B < \dots < N$ ). - -A new multiplex structure identifier is accepted if a new consistent value is received in the MSI bytes of the PSI overhead for X consecutive multiframes. X shall be 3. - -**Table 8-1 – MSI bytes within PSI multiframe** - -| ODUk type | Payload type of tributary | Tributary slots | MSI bytes in PSI position range | -|-----------|---------------------------|-----------------|---------------------------------| -| ODU1 | 20 | TS[1..2] | PSI[2..3] | -| ODU2 | 20 | TS[1..4] | PSI[2..5] | -| ODU2 | 21 | TS[1..8] | PSI[2..9] | -| ODU3 | 20 | TS[1..16] | PSI[2..17] | -| ODU3 | 21 | TS[1..32] | PSI[2..33] | -| ODU4 | 21 | TS[1..80] | PSI[2..81] | -| ODU25(u) | 21 | TS[1..20] | PSI[2..21] | -| ODU50(u) | 21 | TS[1..40] | PSI[2..41] | - -For details on the ODUk MSI values, please refer to clause 19.4 of [ITU-T G.709]. - -#### 8.7.2.2 ODUCn multiplex structure identifier (MSI) acceptance process - -The ODUCn multiplex structure identifier (MSI) consists of 40 bytes per OPU instance, which are located in the PSI[2..41] bytes. The MSI of an ODUCn contains two bytes per tributary slot. - -A new multiplex structure identifier (AcMSI) for an OPU instance is accepted if a new consistent value is received in the MSI bytes of the PSI overhead of that OPU instance for 3 consecutive multi-frames. - -For details on the ODUCn MSI values, please refer to clause 20.4 of [ITU-T G.709]. - -#### 8.7.2.3 OMS-O multiplex structure identifier (MSI) acceptance process - -The format of the OMS-O MSI and the process for accepting a new value of the MSI are implementation specific. - -#### 8.7.2.4 FlexO multiplex structure identifier (MSI) acceptance process - -The multiplex structure identifier (MSI) of the n FlexO instances in a FlexO group consists of one byte per FlexO instance. - -A new multiplex structure identifier (AcMSI) for a FlexO instance is accepted if a new value of the MSI byte field of that FlexO instance is received in an overhead frame with good CRC. - -For details on the FlexO MSI values, please refer to clause F.3.1 of [ITU-T G.709.3]. - -### 8.7.3 Blank clause - -NOTE – This clause is intentionally left blank. - -## 8.8 Status information (STAT) acceptance process - -A new STAT value (AcSTAT) is accepted if a new consistent value is received in the STAT bits in the first OTU or ODU overhead instance in $X$ consecutive frames. For ODUk $X$ shall be 3; for OTUCn and ODUCn $X$ shall be 15. - -## 8.9 Generic AIS generation and detection - -Generic AIS including OTUk-AIS ( $k = 1, 2, 3$ ) is a PN-11 pseudo-random pattern as defined in [ITU-T G.709]. The pattern is generated by a pseudo-random generator. For the detection of generic AIS, the reverse process as shown in Figure 8-3 is used. As the flip-flops of the detector circuit are fed with the same data as the flip-flops of the generator circuit, data at point D1 is the same as data at G1 with a delay of 11 clock cycles. As the G1 data appears at the output of the generator ( $G_{out}$ ) and as such also at the input of the detector ( $D_{in}$ ) with a delay of 11 clock cycles, D1 and $D_{in}$ data is the same for each clock cycle. A PN-11 generic AIS pattern at the input of the detector ( $D_{in}$ ) should therefore result in an all-ZEROs pattern at point D2. The only other input pattern that will result in an all-ZEROs pattern at D2 is an all-ZEROs input pattern. - -The detection of an all-ZEROs pattern at D2 and a non-all-ZEROs pattern at $D_{in}$ is a criterion for the generic AIS defect. For the specific detection process, see clause 6.2.6.3.3. - -![Figure 8-3: Generic AIS generation and detection diagram. The top part shows a 'Generic AIS generator' with 11 D flip-flops (DQ) in series, clocked by 'Clock'. The output of the 11th flip-flop is labeled 'Gout' and 'Generic AIS'. This output is fed back through an XOR gate labeled 'G1' to the input of the first flip-flop. The bottom part shows a 'Generic AIS detector' with 11 D flip-flops (DQ) in series, also clocked by 'Clock'. The input is labeled 'Din'. The output of the 11th flip-flop is labeled 'D1'. 'Din' is also labeled at the input of the first flip-flop. Both 'D1' and 'Din' are inputs to an XOR gate labeled 'D2'. The output of 'D2' is fed into two parallel blocks: 'Non all ZEROs detection' and 'All ZEROs detection'. The outputs of these blocks are combined via an AND gate to produce the final output 'dAIS'. A small text 'G.798(17)-Cor.2(21)_F8-3' is in the bottom right corner.](aeb2a26a07219661191294dba528067a_img.jpg) - -Figure 8-3: Generic AIS generation and detection diagram. The top part shows a 'Generic AIS generator' with 11 D flip-flops (DQ) in series, clocked by 'Clock'. The output of the 11th flip-flop is labeled 'Gout' and 'Generic AIS'. This output is fed back through an XOR gate labeled 'G1' to the input of the first flip-flop. The bottom part shows a 'Generic AIS detector' with 11 D flip-flops (DQ) in series, also clocked by 'Clock'. The input is labeled 'Din'. The output of the 11th flip-flop is labeled 'D1'. 'Din' is also labeled at the input of the first flip-flop. Both 'D1' and 'Din' are inputs to an XOR gate labeled 'D2'. The output of 'D2' is fed into two parallel blocks: 'Non all ZEROs detection' and 'All ZEROs detection'. The outputs of these blocks are combined via an AND gate to produce the final output 'dAIS'. A small text 'G.798(17)-Cor.2(21)\_F8-3' is in the bottom right corner. - -**Figure 8-3 – Generic AIS generation and detection** - -## 8.10 Generic layer fault processing - -Layer fault processing is concerned with the detection of failures within a layer network, the generation of consequent actions (for suppression of unwanted downstream alarms and remote information for upstream single-ended maintenance), and the report of probable fault causes to the management system. - -Figure 8-4 illustrates in general the atomic functions connection, trail termination and adaptation of a layer which perform their specific fault-processing tasks. The connection function, if present, can interconnect the adaptation and trail termination functions according to the signal flow shown. Note that not all features are supported by all layers. For the specific fault processing, see the layer-specific functions. - -![Figure 8-4 – Generic layer fault processing diagram showing the flow of fault signals (SSF, FDI, AIS, LCK, IAE, PMI, BDI, BIAE) through various layers (Adaptation, Trail Termination, Connection) and components (Supervision process, Client-specific processes, Server-specific processes).](4162c218fc7881cd90fc9574e07d2327_img.jpg) - -The diagram illustrates the generic layer fault processing flow across four layers: Adaptation, Trail Termination, Connection, and another Adaptation layer. - -- Top Adaptation Layer:** - - Sink side (left):** Receives SSF from the layer below. It contains FDI AIS and LCK blocks, and two Supervision process blocks. Reports are sent from the supervision processes. It connects to the Trail Termination layer via TSF and TSD. - - Source side (right):** Receives input from above and contains LCK and IAE blocks. It connects to the Trail Termination layer via Source. - - Internal components:** Client-specific processes and Server-specific processes are shown between the supervision and adaptation blocks. -- Trail Termination Layer:** - - Sink side (left):** Receives from the Adaptation layer sink. It contains a Supervision process block that sends Reports and provides Remote information to the source side. It connects to the Connection layer via Sink. - - Source side (right):** Receives from the Adaptation layer source. It contains PMI, BDI, and BIAE blocks. It connects to the Connection layer via Source. -- Connection Layer:** - - Contains an OCI block. Arrows show the flow of signals between the Trail Termination layer and the bottom Adaptation layer. A dashed line labeled "No SSF" is also shown within this layer. -- Bottom Adaptation Layer:** - - Sink side (left):** Receives from the Connection layer. It contains FDI AIS and LCK blocks, and two Supervision process blocks. Reports are sent from the supervision processes. It connects to the layer below via TSF and TSD. - - Source side (right):** Receives from the Connection layer and contains LCK and IAE blocks. It connects to the layer below via Source. - - Internal components:** Client-specific processes and Server-specific processes are shown between the supervision and adaptation blocks. - -G.798(10)\_F8-4 - -Figure 8-4 – Generic layer fault processing diagram showing the flow of fault signals (SSF, FDI, AIS, LCK, IAE, PMI, BDI, BIAE) through various layers (Adaptation, Trail Termination, Connection) and components (Supervision process, Client-specific processes, Server-specific processes). - -**Figure 8-4 – Generic layer fault processing** - -In the sink direction, every layer receives a server signal fail indication (SSF) from its server layer, performs supervision of parameters pertaining to the layer, and generates a server signal fail indication to its client layer. In the optical layers, the payload and the overhead are separated; the monitoring for LOS is performed by the media element, while all other defect processing functions are performed by maintenance entity trail terminations that use non-associated overhead. Reports of probable fault causes are made to the management system. The signal fail state of the layer is forwarded/indicated via a forward defect indication (FDI) or an alarm indication signal (AIS). AIS is the term used when the signal is in the digital domain (ODU and OTU layer). FDI is the term used when the signal is in the optical domain; FDI is transported as a non-associated overhead in the OSC. - -The LCK maintenance signal is generated on the operator request in order to lock the signal from user access while the operator is, for example, performing set-up tests. In this case, the client signal is replaced by fixed data indicated as locked (LCK). It can be generated by the server layer adaptation sink and source functions. - -An open connection of a connection function generates the OCI maintenance signal in conjunction with a no SSF indication. - -The optical parameter monitors (OPM) in the media element monitor the optical payload signal to determine when the incoming signal is absent and relay this information to the OTS-O or OMS-O trail termination functions. Upon receiving the information that the incoming payload signal is absent (see Figure 8-5) this function inserts the payload missing indication (PMI) into the appropriate portion of the OSC. At the OTS-O or OMS-O trail termination sink, it is used to suppress the loss of payload signal defect-related actions (consequent actions, fault cause, PM data). - -![Diagram illustrating PMI processing. A 'Missing optical signal' enters the first 'Media element'. This element sends a 'LOS indication' to an 'OTS-O' block, which 'Inserts PMI in OSC'. The 'Media element' also outputs a signal to a second 'Media element', which is labeled 'LOS detected'. This second element sends its own 'LOS indication' to another 'OTS-O' block. The 'PMI' signal is shown being transmitted between the two 'OTS-O' blocks. The second 'OTS-O' block performs 'Hold off dLOS-P detection' and 'PMI suppresses actions related to dLOS-P'. The diagram is labeled G.798(17)_F8-5.](640d28a694bbdbaf9b11a3bfdcc800fc_img.jpg) - -Diagram illustrating PMI processing. A 'Missing optical signal' enters the first 'Media element'. This element sends a 'LOS indication' to an 'OTS-O' block, which 'Inserts PMI in OSC'. The 'Media element' also outputs a signal to a second 'Media element', which is labeled 'LOS detected'. This second element sends its own 'LOS indication' to another 'OTS-O' block. The 'PMI' signal is shown being transmitted between the two 'OTS-O' blocks. The second 'OTS-O' block performs 'Hold off dLOS-P detection' and 'PMI suppresses actions related to dLOS-P'. The diagram is labeled G.798(17)\_F8-5. - -**Figure 8-5 – PMI processing** - -NOTE 1 – A hold-off time to delay detection of dLOS-P has to be used at the trail termination sink functions to allow for the activation of the payload missing indication. The hold-off time has to cover the propagation, processing and detection delay of the PMI signal between the source and sink. - -In digital layers (ODU, OTU), the maintenance signals (ODU-AIS, ODU-LCK, and ODU-OCI) provide a replacement of the layer characteristic information except some OH as defined in [ITU-T G.709]. In the optical layers, the maintenance signals FDI and OCI consist only of overhead transported as non-associated overhead in the OSC. - -The trail termination sink function detects trail-specific defects (continuity, connectivity and maintenance signals). It correlates the defects and incoming SSF in order to determine the probable cause in failure reports. It activates trail signal fail (TSF) and trail signal degraded (TSD) indication towards the layer adaptation sink function on these defects and triggers the insertion of backward defect indications (BDI) at the trail termination source of upstream direction. Similarly, the adaptation sink function combines the result of its measurements with the TSF indication to generate the SSF indication, forwards TSD as SSD, and presents appropriate failure reports to the layer manager. These processes aim to present only probable causes pertaining to maintenance actions required at that layer, i.e., to perform suitable alarm suppression. - -The adaptation function is split into server (common) and client-specific supervision processes. The common supervision applies to the compound signal and checks for the correct payload structure on ODUP. The client-specific supervision performs alignment supervision. Note that several client signals may be transported by the same server signal. - -The adaptation source function of the OTU layer and ODU TCM sub-layers generates an incoming alignment error (IAE), if it detects a frame slip (see Figure 8-6). At the trail termination sink function, the IAE information is detected and is used to suppress near-end and far-end performance monitoring data (DS and EBC) and DEG defect data. Furthermore, the collocated trail termination source will insert in upstream the BIAE in order to suppress the far-end performance monitoring data (DS and EBC) at the remote end. - -NOTE 2 – Suppression of the performance monitoring data is performed in the equipment management function. - -![Figure 8-6 – IAE processing diagram. This diagram illustrates the In-Service Alarm End (IAE) processing in an optical transport network. It shows four ODUkTm (Optical Data Unit k Tributary Module) blocks arranged in a 2x2 grid. The top-left block has an input labeled 'Frame slip' and an output labeled 'Near-/far-end DS/EBC suppressed by IAE'. The top-right block has an input labeled 'Near-/far-end DS/EBC suppressed by IAE' and an output labeled 'Frame slip'. The bottom-left block has an input labeled 'Far-end DS/EBC suppressed by BIAE' and an output labeled 'Far-end DS/EBC suppressed by BIAE'. The bottom-right block has an input labeled 'Far-end DS/EBC suppressed by BIAE' and an output labeled 'Near-/far-end DS/EBC suppressed by IAE'. Red dashed lines represent the IAE and BIAE signals. The top-left and top-right blocks are connected by a horizontal red dashed line labeled 'IAE'. The bottom-left and bottom-right blocks are connected by a horizontal red dashed line labeled 'BIAE'. The top-left and bottom-left blocks are connected by a vertical red dashed line labeled 'IAE'. The top-right and bottom-right blocks are connected by a vertical red dashed line labeled 'BIAE'. The text 'G.798(10)_F8-6' is located in the bottom right corner of the diagram.](89f8aefc01866631793087542316cef2_img.jpg) - -Figure 8-6 – IAE processing diagram. This diagram illustrates the In-Service Alarm End (IAE) processing in an optical transport network. It shows four ODUkTm (Optical Data Unit k Tributary Module) blocks arranged in a 2x2 grid. The top-left block has an input labeled 'Frame slip' and an output labeled 'Near-/far-end DS/EBC suppressed by IAE'. The top-right block has an input labeled 'Near-/far-end DS/EBC suppressed by IAE' and an output labeled 'Frame slip'. The bottom-left block has an input labeled 'Far-end DS/EBC suppressed by BIAE' and an output labeled 'Far-end DS/EBC suppressed by BIAE'. The bottom-right block has an input labeled 'Far-end DS/EBC suppressed by BIAE' and an output labeled 'Near-/far-end DS/EBC suppressed by IAE'. Red dashed lines represent the IAE and BIAE signals. The top-left and top-right blocks are connected by a horizontal red dashed line labeled 'IAE'. The bottom-left and bottom-right blocks are connected by a horizontal red dashed line labeled 'BIAE'. The top-left and bottom-left blocks are connected by a vertical red dashed line labeled 'IAE'. The top-right and bottom-right blocks are connected by a vertical red dashed line labeled 'BIAE'. The text 'G.798(10)\_F8-6' is located in the bottom right corner of the diagram. - -**Figure 8-6 – IAE processing** - -In the optical layer, the media operates independently of the OTS-O, OMS-O, OCh-O and OTSiG-O overhead layers that are superimposed upon the media. This independence results in the need for separate SSF, TSF, FDI and BDI signals for the payload and the overhead (all of which are carried in the overhead channel since the media is not capable of inserting maintenance signalling). - -NOTE 3 – If a SSF input is not connected to any output, it is considered as a no SSF. - -## 8.11 OTSi modulator and demodulator processes - -Specific parameters of the OTSi modulator and demodulator processes depend on the interface type. Refer to [ITU-T G.959.1], [ITU-T G.694.2], [ITU-T G.696.1], [ITU-T G.695], [ITU-T G.698.1], [ITU-T G.698.2] and [ITU-T G.694.1] for the currently standardized OTN interfaces and central frequencies. The parameters are managed, if applicable, by the MI\_nominalCentralFrequencyOrWavelength (both input and output), MI\_selectedApplicationIdentifier, and MI\_supportableApplicationIdentifierList management interfaces. - -![Figure 8-7 – OTSi modulator and demodulator processes diagram. This diagram shows a vertical stack of three components. At the top is 'OTSi_AP', connected by a double-headed vertical arrow to a central block labeled 'OTSi'. Below the 'OTSi' block is another double-headed vertical arrow connecting it to 'OTSi_CP'. The text 'G.798(17)_F8-7' is located at the bottom right of the diagram.](21327313f7b18a481da0c87a6472a80d_img.jpg) - -Figure 8-7 – OTSi modulator and demodulator processes diagram. This diagram shows a vertical stack of three components. At the top is 'OTSi\_AP', connected by a double-headed vertical arrow to a central block labeled 'OTSi'. Below the 'OTSi' block is another double-headed vertical arrow connecting it to 'OTSi\_CP'. The text 'G.798(17)\_F8-7' is located at the bottom right of the diagram. - -**Figure 8-7 – OTSi modulator and demodulator processes** - -**Optical carrier modulation (Mod):** This process performs modulation of an optical carrier with the payload (PLD) signal by means of a defined modulation scheme. The modulation scheme and optical parameters (e.g., operating wavelength) depend on the specific interface type. - -**Optical carrier demodulation (DMod):** This process demodulates the PLD signal from the optical carrier. The modulation scheme depends on the specific interface type. - -## 8.12 FlexO maintenance signal information (MAINT) acceptance process - -A new MAINT value (AcMAINT) is accepted if a new value of the FlexO Maintenance Signal Identification field of the FlexO overhead is received in an overhead frame with good CRC. - -## 8.13 FlexO instance signals interleaving processes - -### 8.13.1 $x$ FlexO instance signals interleaving to FlexO- $x$ ( $x = 1, 2, 4$ ) - -The function shall interleave the $x$ FlexO instance signals, 10-bit at a time and in a round-robin fashion from FlexO- $x\_CI\_D[1]$ to FlexO- $x\_CI\_D[x]$ into a FlexO- $x$ frame as described in clauses 11.1, 12.1 or 13.1 of [ITU-T G.709.1] for 100G FlexO-1, 200G FlexO-2, or 400G FlexO-4, respectively. - -NOTE – The $x$ FlexO instances are interleaved in ascending FlexO instance identification (IID) value, so that after interleaving, the first 10-bit block in the FlexO- $x$ frame belong to the FlexO instance with lowest IID value and the last 10-bit block in the FlexO- $x$ frame belong to the FlexO instance with highest IID value. - -### 8.13.2 FlexO- $x$ de-interleaving to $x$ FlexO instance signals ( $x = 1, 2, 4$ ) - -The function shall 10-bit de-interleave the FlexO- $x$ frame into $x$ FlexO instance signals as described in clauses 11.1, 12.1 or 13.1 of [ITU-T G.709.1] for 100G FlexO-1, 200G FlexO-2, or 400G FlexO-4, respectively. The de-interleaving process is initiated by the FlexO- $x$ frame start and round-robin, so that the first FlexO instance (with lowest FlexO IID) is output towards FlexO- $x\_CI\_D[1]$ and the last FlexO instance (with highest FlexO IID value) is output towards FlexO- $x\_CI\_D[x]$ . - -## 8.14 FlexOsec processing for encryption and authentication of fixed-length FlexO frame structures - -The FlexOsec encryption and authentication processes are performed per individual FlexO instance frame signal. - -### 8.14.1 FlexOsec source processing - -A process diagram for the FlexOsec source processes per FlexO instance signal is shown in Figure 8-8. - -![Figure 8-8 – FlexOsec source processes (per FlexO instance signal). The diagram shows the flow of data and control signals through various processing blocks. Inputs include FS (Frame Synchronization), D (Data), and CK (Cipher Key). The 'FlexOsec MF generator' takes FS and CK to produce SMFS. 'Insert CST' and 'Insert KI' take FS and CK to produce intermediate signals. 'Process KI' takes SMFS and SKI_KI to produce TxKI. 'Generate/insert FN' takes FN, FS, and SMFS to produce FN. 'Generate IV' takes IV and SKI_IV_Fixed_ID to produce IV. All these signals (TxKI, FN, IV, and SKI_key[0, 1, 2, 3]) are inputs to the 'Encryption and authentication processes' block, which outputs AT (ICV). Finally, 'Insert AT' takes AT (ICV) and FS to produce the final output D_SEC.](cbab05075b3d7dc0d27c4cbb0c914a94_img.jpg) - -Figure 8-8 – FlexOsec source processes (per FlexO instance signal). The diagram shows the flow of data and control signals through various processing blocks. Inputs include FS (Frame Synchronization), D (Data), and CK (Cipher Key). The 'FlexOsec MF generator' takes FS and CK to produce SMFS. 'Insert CST' and 'Insert KI' take FS and CK to produce intermediate signals. 'Process KI' takes SMFS and SKI\_KI to produce TxKI. 'Generate/insert FN' takes FN, FS, and SMFS to produce FN. 'Generate IV' takes IV and SKI\_IV\_Fixed\_ID to produce IV. All these signals (TxKI, FN, IV, and SKI\_key[0, 1, 2, 3]) are inputs to the 'Encryption and authentication processes' block, which outputs AT (ICV). Finally, 'Insert AT' takes AT (ICV) and FS to produce the final output D\_SEC. - -**Figure 8-8 – FlexOsec source processes (per FlexO instance signal)** - -**Generic processes:** These generic processes are common to any type of cipher suite type code. - -- **FlexOsec MF generator:** The function shall generate 4-frame FlexOsec multi-frame starter identifier (SMFS) as described in clause 9.3.2.2 of [ITU-T G.709.1]. -- **Insert CST:** The function shall insert the appropriate cipher suite type code (corresponding to the specific FlexOsec encryption and authentication processes) into the cipher suite type (CST) byte position of the FlexOsec overhead in the extended overhead area, as defined in clause 9.3.2.4 and Table 9-6 of [ITU-T G.709.1]. -- **Process KI:** The function shall generate the 2-bit transmit key index value (TxKI) by sampling SKI\_KI 2-bit input value using the 4-frame FlexOsec multi-frame starter identifier (SMFS). It guarantees that TxKI is stable across that multi-frame, as defined in clause 9.3.2.3 of [ITU-T G.709.1]. TxKI is sampled again by SMFS to generate the 2-bit Key Index (KI) towards the encryption and authentication processes in order to select the current key among four possible keys. When it detects an increment of the TxKI value, this function triggers a key switching event at the next SMFS (i.e., next 4-frame FlexOsec multiframe boundary). -NOTE – The transmit KI value (TxKI) inserted in the current 4-frame FlexOsec multi-frame carries the Key Index (KI) value used by the encryption and authentication processes in the next 4-frame FlexOsec multi-frame. -- **Insert KI:** The function shall insert TxKI transmit key index value into the 2-bit KI field position of the FlexOsec overhead in the extended overhead area, as defined in clause 9.3.2.3 of [ITU-T G.709.1]. -- **Generate & Insert FN:** The function shall generate and insert the 64-bit frame number into the frame number (FN) field of the FlexOsec overhead in the extended overhead area, as defined in clause 9.3.2.2 of [ITU-T G.709.1]. FN is incremented every FlexO frame and the 4-frame FlexOsec multi-frame starter identifier corresponds to FN[63,64] = 00. FN is reset to zero when a key switching event is detected by KI process. - -- **Insert AT:** The function shall insert the 16-byte authentication tag resulting from the current FlexO frame specific authentication process (see clause 8.14.3) into the AT field of the FlexOsec overhead in the next FlexO frame extended overhead area, as defined in clause 9.3.2.1 of [ITU-T G.709.1]. - -**Specific processes:** These specific processes depend on the specific cipher suite type code. - -- **Generate IV:** See clause 8.14.3 for the encryption process with the cipher suite type code corresponding to the transmit CST value. -- **Encryption and authentication processes:** See clause 8.14.3 with the cipher suite type code corresponding to the transmit CST value. - -### 8.14.2 FlexOsec sink processing - -A process diagram for the FlexOsec sink processes per FlexO instance signal is shown in Figure 8-9. - -![Figure 8-9 – FlexOsec sink processes (per FlexO instance signal). This block diagram illustrates the data flow and processing steps for FlexOsec sink operations. At the top, a 'Selector' block receives inputs CK, FS, and D, and outputs MI_SquelchEn. Below it, a 'Squelch process' block contains 'Normal' and 'Delay buffer' sub-blocks, receiving CK, FS, and D, and outputting SquelchText and AuthCheckErr. A 'FlexOsec OH replace' block receives CK, FS, and D, and outputs CK, FS, and D. Below that, an 'Extract AT' block receives CK, FS, and D, and outputs RxAT. A 'Compare' block receives RxAT and AT (ICV), and outputs AuthCheckErr. A large 'Encryption and authentication processes' block receives CK, FS, and D, and outputs SKI_key[0, 1, 2, 3]. Below this, a 'Generate IV' block receives IV and outputs SKI_IV_Fixed_ID and SKI_KI. An 'Extract KI' block receives CK, FS, and D, and outputs RxKI. An 'Extract FN' block receives CK, FS, and D, and outputs TxFN. An 'Extract and process CST' block receives CK, FS, and D, and outputs AcCST. A central 'FN, KI lock and anti-replay process' block receives FN, KI, and FS, and outputs AuthCheckErr, dUnlockSec, and TSF (e.g., dLOL or (dLOF)). At the bottom, the final outputs are CK, FS, and D_SEC. The diagram is labeled G.798(17)-Amd.4(22)_F8-9.](1033dc9fde75540d224c907681b1b7aa_img.jpg) - -Figure 8-9 – FlexOsec sink processes (per FlexO instance signal). This block diagram illustrates the data flow and processing steps for FlexOsec sink operations. At the top, a 'Selector' block receives inputs CK, FS, and D, and outputs MI\_SquelchEn. Below it, a 'Squelch process' block contains 'Normal' and 'Delay buffer' sub-blocks, receiving CK, FS, and D, and outputting SquelchText and AuthCheckErr. A 'FlexOsec OH replace' block receives CK, FS, and D, and outputs CK, FS, and D. Below that, an 'Extract AT' block receives CK, FS, and D, and outputs RxAT. A 'Compare' block receives RxAT and AT (ICV), and outputs AuthCheckErr. A large 'Encryption and authentication processes' block receives CK, FS, and D, and outputs SKI\_key[0, 1, 2, 3]. Below this, a 'Generate IV' block receives IV and outputs SKI\_IV\_Fixed\_ID and SKI\_KI. An 'Extract KI' block receives CK, FS, and D, and outputs RxKI. An 'Extract FN' block receives CK, FS, and D, and outputs TxFN. An 'Extract and process CST' block receives CK, FS, and D, and outputs AcCST. A central 'FN, KI lock and anti-replay process' block receives FN, KI, and FS, and outputs AuthCheckErr, dUnlockSec, and TSF (e.g., dLOL or (dLOF)). At the bottom, the final outputs are CK, FS, and D\_SEC. The diagram is labeled G.798(17)-Amd.4(22)\_F8-9. - -**Figure 8-9 – FlexOsec sink processes (per FlexO instance signal)** - -**Generic processes:** These generic processes are common to any type of cipher suite type code. - -- **Extract & process CST:** The cipher suite type code is extracted from the CST byte position of the FlexOsec overhead in the FlexO frame extended overhead area, as defined in clause 9.3.2.4 of [ITU-T G.709.1]. A new CST value (AcCST) is accepted if a new consistent value is received in the CST in X consecutive frames. X shall be 15. -- **Extract KI:** The receive key index value (RxKI) is extracted from the 2-bit KI field position of the FlexOsec overhead in the FlexO frame extended overhead area, as defined in clause 9.3.2.3 of [ITU-T G.709.1]. -- **Extract FN:** The receive 64-bit frame number (RxFN) is extracted from the FN field of the FlexOsec overhead in the FlexO frame extended overhead area, as defined in clause 9.3.2.2 of [ITU-T G.709.1]. -- **FN, KI, lock & anti-replay process:** The process has three states, out-of-lock (OOL), pre-lock (PL), and in-lock (IL). - -In the OOL state, the authentication check failure (AuthCheckErr) is ignored, and the local FN 64-bit counter value is not incremented. A valid FlexOsec 4-frame multiframe is detected if an error-free multiframe sequence is found in the two LSBs of the extracted FN value from the receive FlexO frame, RxFN[63,64]. A new KI value (AcKI) is accepted during a valid FlexOsec 4-frame multiframe using a three out of four majority decision. To support anti-replay, the PL state shall be entered at the beginning of the FlexO frame following a valid FlexOsec multiframe, if the 64-bit RxFN value is greater than the local FN counter value or a new KI value (different from the prior one) has been accepted. - -In the PL state, the specific IV generation, decryption and authentication processes are performed over the current FlexO frame using the AcKI value from the prior FlexOsec 4-frame multiframe as KI and the RxFN value as FN, and per the specific and expected cipher suite type code processing (see clause 8.14.3). If the FlexO frame authentication passes (AuthCheckErr= 0) and an increment of the RxFN value is detected in the next FlexO frame, then the IL state shall be entered, the AcKI value is maintained, and the local FN counter is loaded with that RxFN value from the next FlexO frame. Otherwise, if authentication has failed (AuthCheckErr= 1) or no RxFN value increment is detected in the next FlexO frame, then the OOL state shall be re-entered. - -In the IL state, the local FN counter value increments every FlexO frame and is used as the FN value of the current FlexO frame for the specific IV generation, decryption and authentication processes (see clause 8.14), as well as to identify FlexOsec 4-frame multiframe boundaries. A new 2-bit KI value (AcKI) is accepted during a FlexOsec 4-frame multiframe using a three out of four majority decision of RxKI values extracted from at least three FlexO frames passing authentication. AcKI is used as the KI value over the next four FlexO frames (i.e., during next FlexOsec 4-frame multiframe) for the specific decryption and authentication processes (see clause 8.14). When an increment of AcKI is detected, it corresponds to a key switching event and the local FN counter is reset to value zero at the next FlexO frame boundary. The out-of-lock state is entered if authentication has failed (AuthCheckErr=1) in X consecutive frames or the RxFN value does not match with the local FN counter value (its expected value) in X consecutive frames passing authentication. X shall be 5. - -The OOL state shall be entered during TSF or when a loss of FlexO-x alignment is detected (e.g., dLOL or dLOF) within the specific atomic functions (see clause 16). - -The local FN 64-bit counter is set to the default value 0 (using MI\_ClearFNCounter) when a FlexOsec secure communication link is initially set-up by the EMF. - -NOTE – A detected key switching event triggers the generate IV, authentication and decryption processes to use a new cryptographic key corresponding to the newly accepted AcKI value, at the next FlexOsec 4-frame multiframe boundary. It is then expected that the old cryptographic key value (i.e., corresponding to prior AcKI value) is retired and not anymore selectable by these processes. - -- **Extract and process AT:** The receive 16-byte authentication tag (RxAT) is extracted from the AT field of the FlexOsec overhead in the current FlexO frame extended overhead area, as defined in clause 9.3.2.1 of [ITU-T G.709.1]. This extracted RxAT value is then compared with the 16-byte computed authentication tag (AT) resulting from the prior FlexO frame receive authentication specific process using the configured cipher suite type code (see clause 8.14.3). If there is a mismatch between the two values, one authentication failure is detected and reported (AuthChekErr). - - **FlexOsec OH replace:** After decryption and AT extraction, the 32-byte receive FlexOsec overhead is replaced with all-ZEROs in the FlexO frame extended overhead area. - - **Squelch process:** If the squelch processing is enabled (MI\_SquelchEn is true), the FlexO frame is buffered after decryption and authentication process, and after FlexOsec OH replacement. If this FlexO frame has failed authentication check (AuthChekErr is ONE), then the fields covered by authentication within its payload and overhead area are replaced with a repeating SquelchText = 0x04 byte pattern, as defined in clause 8.14.3 for the specific cipher suite type code in use (i.e., corresponding to the expected CST value). Squelching could be disabled (MI\_SquelchEn is false) to lower the receive latency, in which case the entire squelch process (including the FlexO frame buffer) is bypassed. -- Specific processes:** These specific processes depend on the specific cipher suite type code. -- **Generate IV:** See clause 8.14.3 for the decryption process using a specific cipher suite type code (i.e., corresponding to the expected CST value). - - **Decryption and authentication processes:** See clause 8.14.3 for the specific cipher suite type code in use (i.e., corresponding to the expected CST value). If an authentication failure is detected (AuthChekErr = 1) is detected - -### 8.14.3 FlexOsec encryption and authentication processes - -The receive authentication check shall report the per FlexO frame authentication failure (AuthCheckErr). For further processing, see clause 6.5.1.4. - -#### 8.14.3.1 GCM-AES-256 FlexOsec without OH encryption - -The GCM-AES-256 FlexOsec payload encryption algorithm with basic overhead area (BOH) and partial extended overhead area (EOH) authentication is specified in clause B.1 of [ITU-T G.709.1]. It corresponds to the cipher suite type (CST) code point value 000001, as defined in Table 9-6 of [ITU-T G.709.1]. - -The key is selected among four 256-bit key values SKI\_Key[0,1,2,3] input from the key exchange and agreement functions, using the 2-bit key index value (KI). For encryption at the source, KI is generated as described in clause 8.14.1. For decryption at the sink, KI is accepted from the incoming FlexOsec overhead as described in clause 8.14.2. - -The 96-bit initialization vector (IV) is generated on a FlexO frame-by-frame basis per clause B.1.3 of [ITU-T G.709.1] using a user configurable 32-bit fixed identifier SKI\_IV\_fixed\_ID from the key exchange and agreement functions, and the 64-bit Frame Number (FN) of that FlexO frame (See clause 8.14.1). For encryption at the source, FN is generated as described in clause 8.14.1. For decryption at the sink, FN is accepted and regenerated from the incoming FlexOsec overhead as described in clause 8.14.2. - -The encryption process is performed at the source for each transmitted FlexO frame using its payload area as PlainText, its generated IV and the selected Key, to replace the PlainText with CipherText. The authentication process is performed in parallel over that encrypted FlexO frame payload area, and its basic overhead (BOH) area plus a subset of its extended overhead (EOH) area as additional authenticated data, to create a 16-byte authentication tag (i.e., integrity check vector). - -The decryption process is performed at the sink for each received FlexO frame using its payload area as CipherText, its generated IV and the selected Key, to replace the CipherText with PlainText. The authentication process is performed in parallel over that received FlexO frame payload area, and its basic overhead (BOH) area plus a subset of its extended overhead (EOH) area as additional authenticated data, to regenerate a 16-byte authentication tag (i.e., integrity check vector). - -# 9 OTS-O layer functions - -Figure 9-1 illustrates the OTS-O layer network and client layer adaptation functions. The information crossing the OTS-O termination connection point (OTS-O\_TCP) is referred to as the OTS-O characteristic information (OTS-O\_CI). The information crossing the OTS-O access point (OTS-O\_AP) is referred to as the OTS-O adapted information (OTS-O\_AI). - -![Diagram of OTS-O layer network and client layer adaptation functions showing the hierarchy from OMS-O_CP down to OTS-O_TCP.](65e8c0628536d6d4245e9ab46ba070c3_img.jpg) - -The diagram illustrates the OTS-O layer hierarchy. At the top is OMS-O\_CP, which connects via a double-headed arrow to a trapezoidal block labeled OTS-O/OMS-O. Below this block is OTS-O\_AP, which connects via a double-headed arrow to a triangular block labeled OTS-O. At the bottom of the triangle is OTS-O\_TCP, which connects via a double-headed arrow to the label G.798(17)\_F9-1. - -Diagram of OTS-O layer network and client layer adaptation functions showing the hierarchy from OMS-O\_CP down to OTS-O\_TCP. - -Figure 9-1 – OTS-O layer network and client layer adaptation functions - -The OTS-O characteristic information (OTS-O\_CI) is a logical signal that contains the OTS-O information elements and the OTS-O adapted information. Figure 9-2 illustrates the overhead information elements that shall be supported across the OTS-O\_CP. - -The specific format is outside the scope of this Recommendation. - -![Diagram of information elements at the OTS-O_TCP showing OTS-O_CI and OTS-O_AI components.](ad555483986d7170a46ce72d164b5bc8_img.jpg) - -The diagram shows the structure of OTS-O characteristic information (OTS-O\_CI). It is divided into two main parts: OTS-O\_CI on the left and OTS-O\_AI on the right. OTS-O\_CI contains four stacked boxes labeled TTI, BDI-P, BDI-O, and PMI. OTS-O\_AI is a large shaded rectangular area. The label G.798(17)\_F9-2 is at the bottom right. - -Diagram of information elements at the OTS-O\_TCP showing OTS-O\_CI and OTS-O\_AI components. - -Figure 9-2 – Information elements at the OTS-O\_TCP - -## 9.1 Connection functions - -Not applicable. - -## 9.2 Termination functions - -### 9.2.1 OTS-O trail termination function (OTS-O\_TT) - -The OTS-O\_TT functions are responsible for the end-to-end supervision of the OTS-O trail. Figure 9-3 shows the combination of the unidirectional sink and source functions to form a bidirectional function. - -![Figure 9-3 – OTS-O_TT diagram showing two OTS-O triangles. The left triangle has an input OTS-O_AP at the top and an output OTS-O_TCP at the bottom. The right triangle has an output OTS-O_AP at the top and an input OTS-O_TCP at the bottom. A horizontal arrow labeled OTS-O_RP points from the right triangle to the left triangle. The text G.798(17)_F9-3 is at the bottom right.](7e14467740b2570a44379b347a697921_img.jpg) - -Figure 9-3 – OTS-O\_TT diagram showing two OTS-O triangles. The left triangle has an input OTS-O\_AP at the top and an output OTS-O\_TCP at the bottom. The right triangle has an output OTS-O\_AP at the top and an input OTS-O\_TCP at the bottom. A horizontal arrow labeled OTS-O\_RP points from the right triangle to the left triangle. The text G.798(17)\_F9-3 is at the bottom right. - -**Figure 9-3 – OTS-O\_TT** - -#### **9.2.1.1 OTS-O trail termination source function (OTS-O\_TT\_So)** - -The OTS-O\_TT\_So function adds overhead for the purpose of managing an OMS maintenance entity – including OTS-O TTI, PMI and BDI-P/O. - -The information flow and processing of the OTS-O\_TT\_So functions is defined with reference to Figures 9-4 and 9-5. - -##### **Symbol** - -![Figure 9-4 – OTS-O_TT_So function diagram showing an OTS-O triangle. Inputs include OTS-O_AP at the top, OTS-O_RP from the left, OTS-O_TT_So_MP from the right, and OTS-O_TT_So_DP from the right. The output is OTS-O_TCP at the bottom. The text G.798(17)_F9-4 is at the bottom right.](cfc2672ccfdf7b47212ef2b8d72c0ff3_img.jpg) - -Figure 9-4 – OTS-O\_TT\_So function diagram showing an OTS-O triangle. Inputs include OTS-O\_AP at the top, OTS-O\_RP from the left, OTS-O\_TT\_So\_MP from the right, and OTS-O\_TT\_So\_DP from the right. The output is OTS-O\_TCP at the bottom. The text G.798(17)\_F9-4 is at the bottom right. - -**Figure 9-4 – OTS-O\_TT\_So function** - -##### **Interfaces** - -**Table 9-1 – OTS-O\_TT\_So inputs and outputs** - -| Input(s) | Output(s) | -|--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|----------------------------------| -| OTS-O_AP:
OTS-O_AI_OH
OTS-O_RP:
OTS-O_RI_BDI-P
OTS-O_RI_BDI-O
OTS-O_TT_So_MP:
OTS-O_TT_So_MI_TxTI
OTS-O_TT_So_DP:
OTS-O_TT_So_DI_LOS-P | OTS-O_TCP:
OTS-O_CI_OH | - -##### **Processes** - -The processes associated with the OTS-O\_TT\_So function are as depicted in Figure 9-5. - -**TTI:** The trail trace identifier information (OTS-TTI) is inserted into the OTS-O portion of the OSC. Its value is derived from reference point OTS-O\_TT\_So\_MP. The trail trace format is described in clause 15.2 of [ITU-T G.709]. - -**BDI-P:** The BDI-P information (OTS-BDI-P) is inserted into the OTS-O portion of the OSC. Its value is derived from reference point OTS-O\_RP. Upon the declaration/clearing of aBDI-P at the termination sink function, the trail termination source function shall have inserted/removed the BDI-P indication within 50 ms. - -**BDI-O:** The BDI-O information (OTS-BDI-O) is inserted into the OTS-O portion of the OSC. Its value is derived from reference point OTS-O\_RP. Upon the declaration/clearing of aBDI-O at the termination sink function, the trail termination source function shall have inserted/removed the BDI-O indication within 50 ms. - -**PMI:** The PMI information (OTS-PMI) is inserted into the OTS-O portion of the OSC. Upon the declaration/clearing of aPMI, the function shall have inserted/removed the PMI indication. - -![Diagram of OTS-O_TT_So function showing internal components and interfaces.](fd3cbb53e991f8209ba17b398f426e13_img.jpg) - -The diagram illustrates the internal structure of the OTS-O\_TT\_So function. It is a rectangular block with a vertical 'OTS\_OH insertion' component on the left. Four horizontal boxes represent internal functions: 'Insert PMI', 'Insert BDI-P', 'Insert BDI-O', and 'Insert TTI'. Arrows point from each of these boxes to the 'OTS\_OH insertion' component. External input 'dLOS-P' points to the 'Insert PMI' box. External outputs 'RI\_BDI-P', 'RI\_BDI-O', and 'MI\_TxTTI' point from the 'Insert BDI-P', 'Insert BDI-O', and 'Insert TTI' boxes respectively. These three external outputs are grouped by a bracket labeled 'OTS-O\_TT\_So\_RP'. The entire block is labeled 'OTS-O\_TT\_So' at the bottom. The top interface is labeled 'AI\_OH' and 'OTS-O\_AP'. The bottom interface is labeled 'CI\_OH' and 'OTS-O\_TCP'. A vertical label on the right side indicates the output path as 'OTS-O\_TT\_So\_DP'. A small reference 'G.798(17)\_F9-5' is present at the bottom right of the block. - -Diagram of OTS-O\_TT\_So function showing internal components and interfaces. - -Figure 9-5 – OTS-O\_TT\_So - -##### Defects - -dLOS-P ← OTS-P\_DI\_LOS - -Loss of signal information from the media element is received via the OTS-O\_DP. - -##### Consequent actions - -aPMI ← dLOS-P - -**Defect correlations:** None. - -NOTE – dLOS-P is not reported as fault cause, as it is not a failure condition of the trail itself. It is an incoming failure condition to the trail. It is used to generate PMI to the trail termination sink function (see clause 8.10). - -**Performance monitoring:** None. - -#### 9.2.1.2 OTS-O trail termination sink function (OTS-O\_TT\_Sk) - -The OTS-O\_TT\_Sk reports the state of the OTS-O trail. The OTS-O\_TT\_Sk function extracts OTS-O overhead, including TTI, BDI and PMI. It detects dTIM, dPMI, dBdi-P and dBdi-O defects, receives information about dLOS-P defects from the media element, counts during one-second periods defects to feed performance monitoring when connected, makes the TTI available to network management, and forwards the defect information as backward defect indications to the companion OTS-O\_TT\_So function. - -The information flow and processing of the OTS-O\_TT\_Sk function is defined with reference to Figures 9-6 and 9-7. - -##### Symbol - -![Diagram of the OTS-O function symbol. It is a triangle pointing downwards. Inputs from the left are OTS-O_TT_Sk_MP (top) and OTS-O_TT_Sk_DP (bottom). Input from the bottom is OTS-O_TCP. Output to the top is OTS-O_AP. Output to the right is OTS-O_RP. The label G.798(17)_F9-6 is at the bottom right.](0897c77315bfe37a098f6b4ea39570d2_img.jpg) - -Diagram of the OTS-O function symbol. It is a triangle pointing downwards. Inputs from the left are OTS-O\_TT\_Sk\_MP (top) and OTS-O\_TT\_Sk\_DP (bottom). Input from the bottom is OTS-O\_TCP. Output to the top is OTS-O\_AP. Output to the right is OTS-O\_RP. The label G.798(17)\_F9-6 is at the bottom right. - -Figure 9-6 – OTS-O\_TT\_Sk function - -##### Interfaces - -Table 9-2 – OTS-O\_TT\_Sk inputs and outputs - -| Input(s) | Output(s) | -|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| OTS-O_TCP:
OTS-O_CI_OH
OTS-O_CI_SSF
OTS-O_TT_Sk_MP:
OTS-O_TT_Sk_MI_ExSAPI
OTS-O_TT_Sk_MI_ExDAPI
OTS-O_TT_Sk_MI_GetAcTI
OTS-O_TT_Sk_MI_TIMDetMo
OTS-O_TT_Sk_MI_TIMActDis
OTS-O_TT_Sk_MI_1second
OTS-O_TT_Sk_DP:
OTS-O_TT_Sk_DI_LOS-P | OTS-O_AP:
OTS-O_AI_OH
OTS-O_AI_TSF-P
OTS-O_AI_TSF-O
OTS-O_RP:
OTS-O_RI_BDI-P
OTS-O_RI_BDI-O
OTS-O_TT_Sk_MP:
OTS-O_TT_Sk_MI_AcTI
OTS-O_TT_Sk_MI_cTIM
OTS-O_TT_Sk_MI_cBDI
OTS-O_TT_Sk_MI_cBDI-P
OTS-O_TT_Sk_MI_cBDI-O
OTS-O_TT_Sk_MI_cLOS-P
OTS-O_TT_Sk_MI_pN_DS-P
OTS-O_TT_Sk_MI_pN_DS-O
OTS-O_TT_Sk_MI_pF_DS-P
OTS-O_TT_Sk_MI_pF_DS-O | - -##### Processes - -The processes associated with the OTS-O\_TT\_Sk function are as depicted in Figure 9-7. The specific implementation for extracting information elements from the OTS-O\_CI is outside the scope of this Recommendation. - -**TTI:** The trail trace identifier information (OTS-TTI) shall be recovered from the OTS-O portion of the OSC and processed as specified in clause 8.6. The accepted value of the TTI is available at the MP. The trail trace format is described in clause 15.2 of [ITU-T G.709]. - -**BDI-P:** The BDI-P information (OTS-BDI-P) shall be extracted from the OTS-O portion of the OSC. It shall be used for BDI-P defect detection. - -**BDI-O:** The BDI-O information (OTS-BDI-O) shall be extracted from the OTS-O portion of the OSC. It shall be used for BDI-O defect detection. - -**PMI:** The PMI information (OTS-PMI) shall be extracted from the OTS-O portion of the OSC. It shall be used for PMI defect detection. - -![Figure 9-7 – OTS-O_TT_Sk processes. A block diagram showing the internal processes of the OTS-O_TT_Sk function. The diagram is divided into three main sections: OTS-O_TT_Sk_RP, OTS-O_TT_Sk_MP, and OTS-O_TT_Sk_DP. The OTS-O_TT_Sk_RP section includes RI_BDI-O, RI_BDI-P, and MI_TIMActDis inputs. The OTS-O_TT_Sk_MP section includes MI_AcTI, MI_ExSAPI, MI_ExDAPI, MI_GetAcTI, MI_TIMDetMo, MI_cTIM, MI_cBDI-O, MI_cBDI-P, MI_cSSF, MI_cLOS-P, MI_cBDI, MI_pF_DS-O, MI_pF_DS-P, MI_1second, MI_pN_DS-O, and MI_pN_DS-P inputs. The OTS-O_TT_Sk_DP section includes DI_LOS-P input. The diagram shows various processing blocks: 'Consequent actions', 'Process TTI', 'Defect correlation', 'Performance monitoring', and 'LOS-P hold off'. These blocks interact with each other and with external interfaces: AI_TSF-P, AI_SSF-O, AI_OH, and OTS_OH access. The diagram also shows the relationship between OTS-O_TT_Sk and OTS-O_TCP (CI_SSF, CI_OH).](352d21d1e740e4a58cb17ab8656cfad8_img.jpg) - -The diagram illustrates the internal architecture of the OTS-O\_TT\_Sk function. It is organized into three vertical sections on the left, each with a bracket and label: **OTS-O\_TT\_Sk\_RP**, **OTS-O\_TT\_Sk\_MP**, and **OTS-O\_TT\_Sk\_DP**. - -- OTS-O\_TT\_Sk\_RP** (Top): Includes inputs RI\_BDI-O, RI\_BDI-P, and MI\_TIMActDis. RI\_BDI-O and RI\_BDI-P connect to a 'Consequent actions' block. MI\_TIMActDis connects to the same block. The 'Consequent actions' block outputs aTSF-P, aTSF-O, dTIM, CI\_SSF, dLOS-P, and dPMI. -- OTS-O\_TT\_Sk\_MP** (Middle): Includes two sub-sections. The top sub-section includes MI\_AcTI, MI\_ExSAPI, MI\_ExDAPI, MI\_GetAcTI, and MI\_TIMDetMo inputs, which connect to a 'Process TTI' block. 'Process TTI' outputs RxTTI to an 'Extract TTI' block. The bottom sub-section includes MI\_cTIM, MI\_cBDI-O, MI\_cBDI-P, MI\_cSSF, MI\_cLOS-P, MI\_cBDI, MI\_pF\_DS-O, MI\_pF\_DS-P, MI\_1second, MI\_pN\_DS-O, and MI\_pN\_DS-P inputs. MI\_cTIM, MI\_cBDI-O, MI\_cBDI-P, MI\_cSSF, MI\_cLOS-P, and MI\_cBDI connect to a 'Defect correlation' block. MI\_pF\_DS-O, MI\_pF\_DS-P, MI\_1second, MI\_pN\_DS-O, and MI\_pN\_DS-P connect to a 'Performance monitoring' block. 'Defect correlation' outputs dTIM, dBBDI-O, dBBDI-P, CI\_SSF, dLOS-P, and dPMI. 'Performance monitoring' outputs dBBDI-O, dBBDI-P, dPMI, aTSF-O, and aTSF-P. Both 'Extract TTI', 'Extract BDI-O', 'Extract BDI-P', and 'Extract PMI' blocks receive data from an 'OTS\_OH access' vertical bar and output to the 'Consequent actions' block. -- OTS-O\_TT\_Sk\_DP** (Bottom): Includes the DI\_LOS-P input, which connects to a 'LOS-P hold off' block. 'LOS-P hold off' outputs dLOS-P to the 'Consequent actions' block. - -External interfaces are shown at the top (AI\_TSF-P, AI\_SSF-O, AI\_OH) and bottom (CI\_SSF, CI\_OH) of the main processing area. The bottom interfaces are part of the **OTS-O\_TCP** layer. A reference G.798(17)\_F9-7 is noted in the bottom right. - -Figure 9-7 – OTS-O\_TT\_Sk processes. A block diagram showing the internal processes of the OTS-O\_TT\_Sk function. The diagram is divided into three main sections: OTS-O\_TT\_Sk\_RP, OTS-O\_TT\_Sk\_MP, and OTS-O\_TT\_Sk\_DP. The OTS-O\_TT\_Sk\_RP section includes RI\_BDI-O, RI\_BDI-P, and MI\_TIMActDis inputs. The OTS-O\_TT\_Sk\_MP section includes MI\_AcTI, MI\_ExSAPI, MI\_ExDAPI, MI\_GetAcTI, MI\_TIMDetMo, MI\_cTIM, MI\_cBDI-O, MI\_cBDI-P, MI\_cSSF, MI\_cLOS-P, MI\_cBDI, MI\_pF\_DS-O, MI\_pF\_DS-P, MI\_1second, MI\_pN\_DS-O, and MI\_pN\_DS-P inputs. The OTS-O\_TT\_Sk\_DP section includes DI\_LOS-P input. The diagram shows various processing blocks: 'Consequent actions', 'Process TTI', 'Defect correlation', 'Performance monitoring', and 'LOS-P hold off'. These blocks interact with each other and with external interfaces: AI\_TSF-P, AI\_SSF-O, AI\_OH, and OTS\_OH access. The diagram also shows the relationship between OTS-O\_TT\_Sk and OTS-O\_TCP (CI\_SSF, CI\_OH). - -Figure 9-7 – OTS-O\_TT\_Sk processes - -##### Defects - -The OTS-O\_TT\_Sk function shall detect dTIM, dBBDI-P, dBBDI-O and dPMI defects. - -**dLOS-P:** Loss of signal information from the media element is received via the DI\_LOS-P. - -NOTE 2 – A hold-off time has to be used for the activation of LOS-P. The hold-off time has to cover the propagation, processing and detection delay of the PMI signal between the source and sink. - -**dTIM:** See clause 6.2.2.1; dTIM shall be set to false during CI\_SSF. - -**dBBDI-P:** See clause 6.2.6.4.1; dBBDI-P shall be set to false during CI\_SSF. - -**dBBDI-O:** See clause 6.2.6.5.1; dBBDI-O shall be set to false during CI\_SSF. - -**dPMI:** See clause 6.2.6.7.1; dPMI shall be set to false during CI\_SSF. - -##### Consequent actions - -The OTS-O\_TT\_Sk function shall perform the following consequent actions. - -$aTSF-P \leftarrow (dLOS-P \text{ and (not } dPMI)) \text{ or } (dTIM \text{ and (not } TIMActDis))$ - -$aTSF-O \leftarrow CI\_SSF \text{ or } (dTIM \text{ and (not } TIMActDis))$ - -$aBDI-P \leftarrow (dLOS-P \text{ and (not } dPMI)) \text{ or } dTIM$ - -$aBDI-O \leftarrow CI\_SSF \text{ or } dTIM$ - -##### Defect correlations - -The OTS-O\_TT\_Sk function shall perform the following defect correlations. - -cBDI $\leftarrow$ dBDI-P and dBDI-O and (not CI\_SSF) and (not dTIM) - -cBDI-P $\leftarrow$ dBDI-P and (not CI\_SSF) and (not (dTIM and (not TIMActDis))) and (not dBDI-O) - -cBDI-O $\leftarrow$ dBDI-O and (not CI\_SSF) and (not (dTIM and (not TIMActDis))) and (not dBDI-P) - -cTIM $\leftarrow$ dTIM and (not CI\_SSF) - -cLOS-P $\leftarrow$ dLOS-P and (not dPMI) and (not CI\_SSF) - -##### Performance monitoring - -The OTS-O\_TT\_Sk function shall perform the following performance monitoring primitives. The performance monitoring primitives shall be reported to the EMF. - -pN\_DS-P $\leftarrow$ (dLOS-P and (not dPMI)) or dTIM - -pN\_DS-O $\leftarrow$ CI\_SSF or dTIM - -pF\_DS-P $\leftarrow$ dBDI-P - -pF\_DS-O $\leftarrow$ dBDI-O - -NOTE 4 – Performance monitoring primitives based on signal quality monitoring are for further study. Specific implementations are outside the scope of this Recommendation. - -## 9.3 Adaptation functions - -The OTS-O is server for the following clients: - -- optical multiplex section overhead (OMS-O). - -### 9.3.1 OTS-O to OMS-O adaptation function (OTS-O/OMS-O\_A) - -The OTS-O to OMS-O adaptation functions perform the adaptation between the OTS-O layer adapted information and the OMS-O layer characteristic information. - -#### 9.3.1.1 OTS-O to OMS-O adaptation source function (OTS-O/OMS-O\_A\_So) - -The information flow and processing of the OTS-O/OMS-O\_A\_So function is defined with reference to Figure 9-8. - -##### Symbol - -![Diagram of the OTS-O/OMS-O_A_So function symbol. It shows a vertical flow starting from a point labeled OMS-O_CP, entering a trapezoidal block labeled OTS-O/OMS-O, and exiting to a point labeled OTS-O_AP. Arrows indicate the downward direction of flow.](70a8d66363cce832376711b7ede4f94e_img.jpg) - -``` - -graph TD - OMS-O_CP --> OTS-O/OMS-O - OTS-O/OMS-O --> OTS-O_AP - -``` - -G.798(17)\_F9-8 - -Diagram of the OTS-O/OMS-O\_A\_So function symbol. It shows a vertical flow starting from a point labeled OMS-O\_CP, entering a trapezoidal block labeled OTS-O/OMS-O, and exiting to a point labeled OTS-O\_AP. Arrows indicate the downward direction of flow. - -**Figure 9-8 – OTS-O/OMS-O\_A\_So** - -##### Interfaces - -**Table 9-3 – OTS-O/OMS-O\_A\_So inputs and outputs** - -| Input(s) | Output(s) | -|---------------------------------|---------------------------------| -| OMS-O_CP:
OMS-O_CI_OH | OTS-O_AP:
OTS-O_AI_OH | - -##### Processes - -No information processing is required in the OTS-O/OMS-O\_A\_So, the OTS-O\_AI at its output being identical to the OMS-O\_CI at its input. - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -#### 9.3.1.2 OTS-O to OMS-O adaptation sink function (OTS-O/OMS-O\_A\_Sk) - -The information flow and processing of the OTS-O/OMS-O\_A\_Sk function is defined with reference to Figures 9-9 and 9-10. - -##### Symbol - -![Diagram of the OTS-O/OMS-O_A_Sk function symbol. It shows a trapezoidal block labeled 'OTS-O/OMS-O'. An arrow points into the block from the bottom, labeled 'OTS-O_AP'. An arrow points out of the block from the top, labeled 'OMS-O_CP'. Below the diagram is the text 'G.798(17)_F9-9'.](a02b188a5fd52c99f84255322873bf29_img.jpg) - -Diagram of the OTS-O/OMS-O\_A\_Sk function symbol. It shows a trapezoidal block labeled 'OTS-O/OMS-O'. An arrow points into the block from the bottom, labeled 'OTS-O\_AP'. An arrow points out of the block from the top, labeled 'OMS-O\_CP'. Below the diagram is the text 'G.798(17)\_F9-9'. - -**Figure 9-9 – OTS-O/OMS-O\_A\_Sk function** - -##### Interfaces - -**Table 9-4 – OTS-O/OMS-O\_A\_Sk inputs and outputs** - -| Input(s) | Output(s) | -|---------------------------------------------------------------------|---------------------------------------------------------------------| -| OTS-O_AP:
OTS-O_AI_OH
OTS-O_AI_TSF-P
OTS-O_AI_TSF-O | OMS-O_CP:
OMS-O_CI_OH
OMS-O_CI_SSF-P
OMS-O_CI_SSF-O | - -##### Processes - -The processes associated with the OTS-O/OMS-O\_A\_Sk function are as depicted in Figure 9-10. - -**FDI-O:** On declaration of aFDI-O, the function shall insert the FDI-O information (OMS-FDI-O) into the OMS-O portion of the OSC. Otherwise, the incoming OMS-FDI-O information is passed through. - -**FDI-P:** On declaration of aFDI-P, the function shall insert the FDI-P information (OMS-FDI-P) into the OMS-O portion of the OSC. Otherwise, the incoming OMS-FDI-P information is passed through. - -![Figure 9-10: OTS-O/OMS-O_A_Sk processes diagram. The diagram shows a shaded rectangular area representing the OMS-O_CP (top) and OTS-O_AP (bottom) boundary. Inside, there are two boxes: 'Insert FDI-O' and 'Insert FDI-P'. Arrows point from these boxes to a vertical box labeled 'OMS OH insertion'. Above the boxes, labels CI_OH, CI_SSF-O, and CI_SSF-P are present. Below the boxes, labels AI_OH, AI_SSF-O, and AI_TSF-P are present. Vertical arrows on the right are labeled aSSF-O and aSSF-P. The text G.798(17)_F9-10 is at the bottom right.](15de63f0b5df62e6ab9164f2a72e2e33_img.jpg) - -Figure 9-10: OTS-O/OMS-O\_A\_Sk processes diagram. The diagram shows a shaded rectangular area representing the OMS-O\_CP (top) and OTS-O\_AP (bottom) boundary. Inside, there are two boxes: 'Insert FDI-O' and 'Insert FDI-P'. Arrows point from these boxes to a vertical box labeled 'OMS OH insertion'. Above the boxes, labels CI\_OH, CI\_SSF-O, and CI\_SSF-P are present. Below the boxes, labels AI\_OH, AI\_SSF-O, and AI\_TSF-P are present. Vertical arrows on the right are labeled aSSF-O and aSSF-P. The text G.798(17)\_F9-10 is at the bottom right. - -**Figure 9-10 – OTS-O/OMS-O\_A\_Sk processes** - -**Defects:** None. - -##### **Consequent actions** - -The OTS-O/OMS-O\_A\_Sk function performs the following consequent actions. - -$$\text{aSSF-P} \leftarrow \text{AI\_TSF-P}$$ - -$$\text{aFDI-P} \leftarrow \text{AI\_TSF-P}$$ - -$$\text{aSSF-O} \leftarrow \text{AI\_TSF-O}$$ - -$$\text{aFDI-O} \leftarrow \text{AI\_TSF-O}$$ - -**Defect correlations:** None. - -**Performance monitoring:** None. - -# **10 OMS-O layer functions** - -Figure 10-1 illustrates the OMS-O layer network and client layer adaptation functions. The information crossing the OMS-O (termination) connection point (OMS-O\_CP/TCP) is referred to as the OMS-O characteristic information (OMS-O\_CI). The information crossing the OMS-O access point (OMS-O\_AP) is referred to as the OMS-O adapted information (OMS-O\_AI). - -![Figure 10-1: OMS-O layer network and client layer adaptation function diagram. The diagram shows three client layer connection points (OCh-O_CPs, OTSiG-O_CPs, OCh-O_CPs) at the top, each with vertical double-headed arrows. Below these are two trapezoidal shapes representing adaptation functions: 'OMS-O/OCh-O' and 'OMS-O/OTSiG | OCh-O'. These are connected to a central horizontal line labeled 'OMS-O_AP'. Below this line is a downward-pointing triangle labeled 'OMS-O', which is connected to 'OMS-O_TCP' at the bottom. The text G.798(17)_F10-1 is at the bottom right.](50f72073c616cb3d3ca3af04a0c3a221_img.jpg) - -Figure 10-1: OMS-O layer network and client layer adaptation function diagram. The diagram shows three client layer connection points (OCh-O\_CPs, OTSiG-O\_CPs, OCh-O\_CPs) at the top, each with vertical double-headed arrows. Below these are two trapezoidal shapes representing adaptation functions: 'OMS-O/OCh-O' and 'OMS-O/OTSiG | OCh-O'. These are connected to a central horizontal line labeled 'OMS-O\_AP'. Below this line is a downward-pointing triangle labeled 'OMS-O', which is connected to 'OMS-O\_TCP' at the bottom. The text G.798(17)\_F10-1 is at the bottom right. - -**Figure 10-1 – OMS-O layer network and client layer adaptation function** - -The OMS-O characteristic information (OMS-O\_CI) contains the logical information elements for maintenance and operational functions to support the OMS maintenance entity. Figure 10-2 illustrates the overhead information elements that shall be supported across the OMS-O\_CP. - -![Figure 10-2: OMS-O_CI information elements diagram. A box labeled OMS-O_CI contains six stacked elements: MSI, FDI-P, FDI-O, BDI-P, BDI-O, and PMI. To the right of this box is a large grey box labeled OMS-O_AI. The diagram is labeled G.798(17)_F10-2 at the bottom right.](b5b908b453ca50ed3b4cca88aef080fa_img.jpg) - -Figure 10-2: OMS-O\_CI information elements diagram. A box labeled OMS-O\_CI contains six stacked elements: MSI, FDI-P, FDI-O, BDI-P, BDI-O, and PMI. To the right of this box is a large grey box labeled OMS-O\_AI. The diagram is labeled G.798(17)\_F10-2 at the bottom right. - -Figure 10-2 – OMS-O\_CI information elements - -## 10.1 Connection functions - -Not applicable. - -## 10.2 Termination functions - -### 10.2.1 OMS-O trail termination function (OMS-O\_TT) - -The OMS-O\_TT functions are responsible for the end-to-end supervision of the OMS-O trail. Figure 10-3 shows the combination of the unidirectional sink and source functions to form a bidirectional function. - -![Figure 10-3: OMS-O_TT diagram. Two trapezoidal blocks labeled OMS-O are shown. The left block has an input OMS-O_AP at the top and an output OMS-O_TCP at the bottom. The right block has an output OMS-O_AP at the top and an input OMS-O_TCP at the bottom. A horizontal arrow labeled OMS-O_RP points from the right OMS-O block to the left OMS-O block. The diagram is labeled G.798(17)_F10-3 at the bottom right.](236f674770a03c918c0375a74fe950db_img.jpg) - -Figure 10-3: OMS-O\_TT diagram. Two trapezoidal blocks labeled OMS-O are shown. The left block has an input OMS-O\_AP at the top and an output OMS-O\_TCP at the bottom. The right block has an output OMS-O\_AP at the top and an input OMS-O\_TCP at the bottom. A horizontal arrow labeled OMS-O\_RP points from the right OMS-O block to the left OMS-O block. The diagram is labeled G.798(17)\_F10-3 at the bottom right. - -Figure 10-3 – OMS-O\_TT - -#### 10.2.1.1 OMS-O trail termination source function (OMS-O\_TT\_So) - -The OMS-O\_TT\_So function adds overhead for the purpose of managing an OMS maintenance entity – including OMS BDI-P/O and PMI. - -The information flow and processing of the OMS-O\_TT\_So function is defined with reference to Figures 10-4 and 10-5. - -##### Symbol - -![Symbol diagram for OMS-O function. A central triangle labeled 'OMS-O' has four input arrows pointing to it from the top (OMS-O_AP), left (OMS-O_TT_So_DP), and right (OMS-O_RP). An output arrow points downwards from the triangle to 'OMS-O_TCP'. The text 'G.798(17)_F10-4' is located to the right of the output arrow.](0af1ba85ab6e4e50befbef3d63e017dc_img.jpg) - -Symbol diagram for OMS-O function. A central triangle labeled 'OMS-O' has four input arrows pointing to it from the top (OMS-O\_AP), left (OMS-O\_TT\_So\_DP), and right (OMS-O\_RP). An output arrow points downwards from the triangle to 'OMS-O\_TCP'. The text 'G.798(17)\_F10-4' is located to the right of the output arrow. - -Figure 10-4 – OMS-O\_TT\_So function - -##### Interfaces - -Table 10-1 – OMS-O\_TT\_So inputs and outputs - -| Input(s) | Output(s) | -|-------------------------------------------------------------------------------------------------------------------------------------------|----------------------------------| -| OMS-O_AP:
OMS-O_AI_OH
OMS-O_RP:
OMS-O_RI_BDI-P
OMS-O_RI_BDI-O
OMS-O_TT_So_DP:
OMS-O_TT_So_DI_LOS-P | OMS-O_TCP:
OMS-O_CI_OH | - -##### Processes - -The processes associated with the OMS-O\_TT\_So function are as depicted in Figure 10-5. - -**BDI-P:** The BDI-P information is inserted into the OMS-O portion of the OSC. Its value is derived from reference point OMS-O\_RP. Upon the declaration/clearing of aBDI-P at the termination sink function, the trail termination source function shall have inserted/removed the BDI-P indication within 50 ms. - -**BDI-O:** The BDI-O information is inserted into the OMS-O portion of the OSC. Its value is derived from reference point OMS-O\_RP. Upon the declaration/clearing of aBDI-O at the termination sink function, the trail termination source function shall have inserted/removed the BDI-O indication within 50 ms. - -**PMI:** The PMI information is inserted into the OMS-O portion of the OSC Upon the declaration/clearing of aPMI, the function shall have inserted/removed the PMI indication. - -![Figure 10-5 – OMS-O_TT_So processes diagram. The diagram shows a shaded rectangular box representing the OMS-O_TT_So processes. At the top, 'AI_OH' points down into the box. At the bottom, 'CI_OH' points down out of the box. Inside the box, on the left, a vertical box labeled 'OMS OH insertion' has arrows pointing to three horizontal boxes: 'Insert PMI', 'Insert BDI-P', and 'Insert BDI-O'. These three boxes point to defect indicators on the right: 'dLOS-P', 'RI_BDI-P', and 'RI_BDI-O'. These three indicators are grouped by a bracket labeled 'OMS-O_TT_So_RP'. To the right of the bracket, the text 'OMS-O_TT_So_DP' is written vertically. The diagram is labeled 'G.798(17)_F10-5' at the bottom right of the box.](99698c448635861b7dc8d352f87a1b2b_img.jpg) - -Figure 10-5 – OMS-O\_TT\_So processes diagram. The diagram shows a shaded rectangular box representing the OMS-O\_TT\_So processes. At the top, 'AI\_OH' points down into the box. At the bottom, 'CI\_OH' points down out of the box. Inside the box, on the left, a vertical box labeled 'OMS OH insertion' has arrows pointing to three horizontal boxes: 'Insert PMI', 'Insert BDI-P', and 'Insert BDI-O'. These three boxes point to defect indicators on the right: 'dLOS-P', 'RI\_BDI-P', and 'RI\_BDI-O'. These three indicators are grouped by a bracket labeled 'OMS-O\_TT\_So\_RP'. To the right of the bracket, the text 'OMS-O\_TT\_So\_DP' is written vertically. The diagram is labeled 'G.798(17)\_F10-5' at the bottom right of the box. - -**Figure 10-5 – OMS-O\_TT\_So processes** - -##### **Defects** - -dLOS-P: Loss of signal information from the media element is received via the OMS-O\_DP. - -##### **Consequent actions** - -aPMI ← dLOS-P - -**Defect correlations:** None. - -NOTE – dLOS-P is not reported as fault cause, as it is not a failure condition of the trail itself. It is an incoming failure condition to the trail. It is used to generate PMI to the trail termination sink function (see clause 8.10). - -**Performance monitoring:** None. - -#### **10.2.1.2 OMS-O trail termination sink function (OMS-O\_TT\_Sk)** - -The OMS-O\_TT\_Sk reports the state of the OMS-O trail. The OMS-O\_TT\_Sk function extracts OMS-O monitoring overhead – including BDI, FDI-P, FDI-O and PMI. It detects dLOS-P, dPMI, dFDI-P, dFDI-O, dBDI-P and dBDI-O defects, receives information about dLOS-P defects from the media element, counts during one-second periods defects to feed performance monitoring when connected, and forwards the defect information as backward defect indications to the companion OMS-O\_TT\_So function. - -The information flow and processing of the OMS-O\_TT\_Sk function is defined with reference to Figures 10-6 and 10-7. - -##### **Symbol** - -![Figure 10-6 – OMS-O_TT_Sk function diagram. The diagram shows a triangle symbol labeled 'OMS-O'. Above the triangle, 'OMS-O_AP' points up. Below the triangle, 'OMS-O_TCP' points up. To the left of the triangle, 'OMS-O_TT_Sk_MP' and 'OMS-O_TT_Sk_DP' point right into the triangle. To the right of the triangle, an arrow points right to 'OMS-O_RP'. The diagram is labeled 'G.798(17)_F10-6' at the bottom right.](c425a7b76be3f887bb251606c2a7ce9a_img.jpg) - -Figure 10-6 – OMS-O\_TT\_Sk function diagram. The diagram shows a triangle symbol labeled 'OMS-O'. Above the triangle, 'OMS-O\_AP' points up. Below the triangle, 'OMS-O\_TCP' points up. To the left of the triangle, 'OMS-O\_TT\_Sk\_MP' and 'OMS-O\_TT\_Sk\_DP' point right into the triangle. To the right of the triangle, an arrow points right to 'OMS-O\_RP'. The diagram is labeled 'G.798(17)\_F10-6' at the bottom right. - -**Figure 10-6 – OMS-O\_TT\_Sk function** - -##### Interfaces - -**Table 10-2 – OMS-O\_TT\_Sk inputs and outputs** - -| Input(s) | Output(s) | -|----------------------------------------------------------------------------------------------------------------------------------------------------------------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| OMS-O_TCP:
OMS-O_CI_OH
OMS-O_CI_SSF-P
OMS-O_CI_SSF-O
OMS-O_TT_Sk_MP:
OMS-O_TT_Sk_MI_1second
OMS-O_TT_Sk_DP:
OMS-O_TT_Sk_DI_LOS-P | OMS-O_AP:
OMS-O_AI_OH
OMS-O_AI_TSF-P
OMS-O_AI_TSF-O
OMS-O_RP:
OMS-O_RI_BDI-P
OMS-O_RI_BDI-O
OMS-O_TT_Sk_MP:
OMS-O_TT_Sk_MI_cSSF-P
OMS-O_TT_Sk_MI_cSSF-O
OMS-O_TT_Sk_MI_cSSF
OMS-O_TT_Sk_MI_cBDI
OMS-O_TT_Sk_MI_cBDI-P
OMS-O_TT_Sk_MI_cBDI-O
OMS-O_TT_Sk_MI_cLOS-P
OMS-O_TT_Sk_MI_pN_DS-P
OMS-O_TT_Sk_MI_pN_DS-O
OMS-O_TT_Sk_MI_pF_DS-P
OMS-O_TT_Sk_MI_pF_DS-O | - -##### Processes - -The processes associated with the OMS-O\_TT\_Sk function are depicted in Figure 10-7. The specific implementation for extracting information elements from the OMS\_CI is outside the scope of this Recommendation. - -**FDI-P:** The FDI-P information (OMS-FDI-P) shall be extracted from the OMS-O portion of the OSC. It shall be used for FDI-P defect detection. - -**FDI-O:** The FDI-O information (OMS-FDI-O) shall be extracted from the OMS-O portion of the OSC. It shall be used for FDI-O defect detection. - -**BDI-P:** The BDI-P information (OMS-BDI-P) shall be extracted from the OMS-O portion of the OSC. It shall be used for BDI-P defect detection. - -**BDI-O:** The BDI-O information (OMS-BDI-O) shall be extracted from the OMS-O portion of the OSC. It shall be used for BDI-O defect detection. - -**PMI:** The PMI information (OMS-PMI) shall be extracted from the OMS-O portion of the OSC. It shall be used for PMI defect detection. - -![Figure 10-7 – OMS-O_TT_Sk processes. A block diagram showing the internal processes of the OMS-O_TT_Sk function. It is divided into three main sections: OMS-O_TT_Sk_RP, OMS-O_TT_Sk_MP, and OMS-O_TT_Sk_DP. The diagram shows various input and output signals, including defect correlation, performance monitoring, and consequent actions. Inputs include RI_BDI-O, RI_BDI-P, MI_cSSF-O, MI_cSSF-P, MI_cBDI-O, MI_cBDI-P, MI_cSSF, MI_cBDI, MI_cLOS-P, MI_pF_DS-O, MI_pF_DS-P, MI_1second, MI_pN_DS-O, MI_pN_DS-P, and DI_LOS-P. Outputs include aTSF-P, aTSF-O, aBDI-P, aBDI-O, dFDI-P, dFDI-O, dPMI, dLOS-P, and CI_OH. Internal blocks include 'Consequent actions', 'Defect correlation', 'Performance monitoring', 'LOS-P hold off', and 'Extract' blocks for BDI-O, BDI-P, FDI-O, FDI-P, and PMI. The diagram also shows interactions with OMS-O_TCP and OMS-O_AP.](b20942bb14022381a243971ab9790dd9_img.jpg) - -Figure 10-7 – OMS-O\_TT\_Sk processes. A block diagram showing the internal processes of the OMS-O\_TT\_Sk function. It is divided into three main sections: OMS-O\_TT\_Sk\_RP, OMS-O\_TT\_Sk\_MP, and OMS-O\_TT\_Sk\_DP. The diagram shows various input and output signals, including defect correlation, performance monitoring, and consequent actions. Inputs include RI\_BDI-O, RI\_BDI-P, MI\_cSSF-O, MI\_cSSF-P, MI\_cBDI-O, MI\_cBDI-P, MI\_cSSF, MI\_cBDI, MI\_cLOS-P, MI\_pF\_DS-O, MI\_pF\_DS-P, MI\_1second, MI\_pN\_DS-O, MI\_pN\_DS-P, and DI\_LOS-P. Outputs include aTSF-P, aTSF-O, aBDI-P, aBDI-O, dFDI-P, dFDI-O, dPMI, dLOS-P, and CI\_OH. Internal blocks include 'Consequent actions', 'Defect correlation', 'Performance monitoring', 'LOS-P hold off', and 'Extract' blocks for BDI-O, BDI-P, FDI-O, FDI-P, and PMI. The diagram also shows interactions with OMS-O\_TCP and OMS-O\_AP. - -G.798(17)\_F10-7 - -Figure 10-7 – OMS-O\_TT\_Sk processes - -##### Defects - -The OMS-O\_TT\_Sk function shall detect dLOS-P, dFDI-P, dFDI-O, dBDI-P, dBDI-O and dPMI defects. - -**dLOS-P:** Loss of signal information from the media element is received via the OMS-O\_DP. - -NOTE 2 – A hold-off time has to be used for the activation of LOS-P. The hold-off time has to cover the propagation, processing and detection delay of the PMI signal between the source and sink. - -**dFDI-P:** See clause 6.2.6.1.1. - -**dFDI-O:** See clause 6.2.6.2.1. - -**dBDI-P:** See clause 6.2.6.4.1; dBDI-P shall be set to false during CI\_SSF-O and dFDI-O. - -**dBDI-O:** See clause 6.2.6.5.1; dBDI-O shall be set to false during CI\_SSF-O and dFDI-O. - -**dPMI:** See clause 6.2.6.7.1; dPMI shall be set to false during CI\_SSF-O and dFDI-O. - -##### Consequent actions - -The OMS-O\_TT\_Sk function shall perform the following consequent actions. - -$aTSF-P \leftarrow (dLOS-P \text{ and (not } dPMI)) \text{ or } dFDI-P \text{ or } CI\_SSF-P$ - -$aTSF-O \leftarrow dFDI-O \text{ or } CI\_SSF-O$ - -$aBDI-P \leftarrow (dLOS-P \text{ and (not } dPMI)) \text{ or } dFDI-P \text{ or } CI\_SSF-P$ - -$aBDI-O \leftarrow dFDI-O \text{ or } CI\_SSF-O$ - -##### Defect correlations - -The OMS-O\_TT\_Sk function shall perform the following defect correlations. - -cSSF $\leftarrow$ (CI\_SSF-P or dFDI-P) and (CI\_SSF-O or dFDI-O) - -cSSF-P $\leftarrow$ (CI\_SSF-P or dFDI-P) and (not cSSF) - -cSSF-O $\leftarrow$ (CI\_SSF-O or dFDI-O) and (not cSSF) - -cBDI $\leftarrow$ (dBDI-P and (not dFDI-O)) and (dBDI-O and (not dFDI-O)) - -cBDI-P $\leftarrow$ (dBDI-P and (not dFDI-O)) and (not cBDI) - -cBDI-O $\leftarrow$ (dBDI-O and (not dFDI-O)) and (not cBDI) - -cLOS-P $\leftarrow$ dLOS-P and (not dPMI) and (not dFDI-P) and (not CI\_SSF-P) - -##### Performance monitoring - -The OMS-O\_TT\_Sk function shall perform the following performance monitoring primitives. The performance monitoring primitives shall be reported to the EMF. - -pN\_DS-P $\leftarrow$ aTSF-P - -pN\_DS-O $\leftarrow$ aTSF-O - -pF\_DS-P $\leftarrow$ dBDI-P - -pF\_DS-O $\leftarrow$ dBDI-O - -NOTE 3 – Performance monitoring primitives based on signal quality monitoring are for further study. - -## 10.3 Adaptation functions - -The OMS is server for the following clients: - -- OCh-O -- OTSiG-O. - -### 10.3.1 OMS-O to OCh-O adaptation function (OMS-O/OCh-O\_A) - -The OMS-O to OCh-O adaptation functions perform the adaptation between the OMS-O layer adapted information and the characteristic information of n OCh-O layer signals. - -#### 10.3.1.1 OMS-O to OCh-O adaptation source function (OMS-O/OCh-O\_A\_So) - -The OMS-O/OCh-O\_A\_So function multiplexes the individual OCh-O\_CIs to the OMS-O\_AI. The information flow and processing of the OMS-O/OCh-O\_A\_So function is defined with reference to Figures 10-8 and 10-9. - -##### Symbol - -![Diagram of the OMS-O/OCh-O_A_So function. It shows n input signals labeled OCh-O_CPs (1, 2, ..., n) entering a trapezoidal block labeled OMS-O/OCh-O. An output signal labeled OMS-O_AP exits the block. Below the diagram is the text G.798(17)-Amd.2(19)_F10-8.](426116a38cef1a4b575e63bcd65c676d_img.jpg) - -``` -graph TD - subgraph " " - direction TB - CP1[1] --> Block - CP2[2] --> Block - CPn[n] --> Block - Block[OMS-O/OCh-O] --> AP[OMS-O_AP] - end - style Block fill:none,stroke:#000,stroke-width:1px - classDef labelText fill:none,stroke:none - CP1:::labelText - CP2:::labelText - CPn:::labelText - AP:::labelText -``` - -G.798(17)-Amd.2(19)\_F10-8 - -Diagram of the OMS-O/OCh-O\_A\_So function. It shows n input signals labeled OCh-O\_CPs (1, 2, ..., n) entering a trapezoidal block labeled OMS-O/OCh-O. An output signal labeled OMS-O\_AP exits the block. Below the diagram is the text G.798(17)-Amd.2(19)\_F10-8. - -**Figure 10-8 – OMS-O/OCh-O\_A\_So function** - -##### Interfaces - -**Table 10-3 – OMS-O/OCh-O\_A\_So inputs and outputs** - -| Input(s) | Output(s) | -|------------------------------------------------------|---------------------------------| -| per OCh-O_CP:
OCh-O_CI_OH | OMS-O_AP:
OMS-O_AI_OH | -| NOTE – This function assumes a fixed frequency grid. | | - -##### Processes - -The processes associated with the OMS-O/OCh-O\_A\_So function are common processes for the compound (multiplexed) signal as depicted in Figure 10-9. - -##### Specific processes - -None. - -##### Common processes - -**Overhead multiplexing:** This process performs overhead multiplexing of the individual OCh-O signals. The specific multiplex function is outside the scope of this Recommendation. - -![Diagram of OMS-O/OCh-O_A_So processes showing overhead multiplexing of multiple OCh-O_CP signals into a single OMS-O_AP signal.](f4b570ddd089f54943d46e9f8776f9f9_img.jpg) - -The diagram illustrates the 'Overhead multiplexing' process. It shows multiple input signals, labeled OCh-O\_CP[1] and OCh-O\_CP[n], each with a CI\_OH component. These inputs are numbered 1, ..., n and enter a central box labeled 'Overhead multiplexing'. This box is situated within a larger grey area labeled 'Common processes'. An arrow points from the 'Overhead multiplexing' box to an output signal labeled AI\_OH, which is also labeled OMS-O\_AP. The diagram is identified by the code G.798(17)-Amd.2(19)\_F10-9. - -Diagram of OMS-O/OCh-O\_A\_So processes showing overhead multiplexing of multiple OCh-O\_CP signals into a single OMS-O\_AP signal. - -**Figure 10-9 – OMS-O/OCh-O\_A\_So processes** - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -#### 10.3.1.2 OMS-O to OCh-O adaptation sink function (OMS-O/OCh-O\_A\_Sk) - -The OMS-O/OCh-O\_A\_Sk function demultiplexes the OMS-O\_AI into the individual OCh-O\_CIs. Upon signal fail conditions, it generates FDI for the individual channels. - -The information flow and processing of the OMS-O/OCh-O\_A\_Sk function is defined with reference to Figures 10-10 and 10-11. - -##### Symbol - -![Symbol diagram for the OMS-O/OCh-O_A_Sk function. A trapezoidal block labeled 'OMS-O/OCh-O' has a single input arrow from below labeled 'OMS-O_AP'. Multiple output arrows point upwards from the top of the block, labeled 'OCh-O_CPs' with subscripts 1, 2, ..., n. Below the diagram is the text 'G.798(17)-Amd.2(19)_F10-10'.](b68ed2f7c90787b2fcfeb6be5640ecd4_img.jpg) - -Symbol diagram for the OMS-O/OCh-O\_A\_Sk function. A trapezoidal block labeled 'OMS-O/OCh-O' has a single input arrow from below labeled 'OMS-O\_AP'. Multiple output arrows point upwards from the top of the block, labeled 'OCh-O\_CPs' with subscripts 1, 2, ..., n. Below the diagram is the text 'G.798(17)-Amd.2(19)\_F10-10'. - -**Figure 10-10 – OMS-O/OCh-O\_A\_Sk function** - -##### Interfaces - -**Table 10-4 – OMS-O/OCh-O\_A\_Sk inputs and outputs** - -| Input(s) | Output(s) | -|---------------------------------------------------------------------|-------------------------------------------------------------------------| -| OMS-O_AP:
OMS-O_AI_OH
OMS-O_AI_TSF-P
OMS-O_AI_TSF-O | per OCh-O_CP:
OCh-O_CI_OH
OCh-O_CI_SSF-P
OCh-O_CI_SSF-O | -| NOTE – This function assumes a fixed frequency grid. | | - -##### Processes - -The processes associated with the OMS-O/OCh-O\_A\_Sk function are specific processes for each OCh-O signal and common processes for the compound (multiplexed) signal as depicted in Figure 10-11. - -##### Common processes - -**Overhead demultiplexing (OHDM):** This process performs the overhead demultiplexing and provides access to the individual OCh-O signals. The specific multiplex function is outside the scope of this Recommendation. - -##### OCh-O Specific processes - -**FDI-O:** On declaration of aFDI-O the function shall insert the FDI-O information (OCh-FDI-O) into each OCh-O. Otherwise, the incoming OCh-FDI-O information is passed through. - -**FDI-P:** On declaration of aFDI-P the function shall insert the FDI-P information (OCh-FDI-P) into each OCh-O. Otherwise, the incoming OCh-FDI-P information is passed through. - -![Diagram of OMS-O/OCh-O_A_Sk processes showing signal flow between OMS-O_AP and multiple OCh-O client ports (OCh-O_CP[1] to OCh-O_CP[n]).](3bf1696c3034743b5ab07a0b5e398347_img.jpg) - -The diagram illustrates the OMS-O/OCh-O\_A\_Sk processes. At the bottom, the OMS-O\_AP (Optical Multiplex Section Adaptation - Optical Payload) provides input signals: AI\_OH (Optical Overhead) and AI\_TSF-P (Payload Transport Signal - Payload). These signals enter a block labeled 'Common processes', which contains an 'Overhead multiplexing' unit. The output of this unit is split: one path goes to the 'OCh-O specific processes' for each client port, and the other path goes to an 'OCh-O OH insertion' block. The 'OCh-O OH insertion' block outputs CI\_OH (Optical Overhead). The 'OCh-O specific processes' for each port (OCh-O\_CP[1] to OCh-O\_CP[n]) receive the multiplexed overhead and the payload. They perform 'Insert FDI-O' and 'Insert FDI-P' actions, which are then processed by 'Consequent actions' blocks. The output of these blocks is aSSF-P (Payload Transport Signal - Payload) and aSSF-O (Optical Transport Signal - Overhead). These signals are then processed by 'CI\_SSF-P' and 'CI\_SSF-O' blocks, which output the final signals CI\_OH, CI\_SSF-P, and CI\_SSF-O for each client port. - -Diagram of OMS-O/OCh-O\_A\_Sk processes showing signal flow between OMS-O\_AP and multiple OCh-O client ports (OCh-O\_CP[1] to OCh-O\_CP[n]). - -Figure 10-11 – OMS-O/OCh-O\_A\_Sk processes - -**Defects:** None. - -##### **Consequent actions** - -The OMS-O/OCh-O\_A\_Sk function performs the following consequent actions. - -For each OCh-O client port #p: - -$$\text{aSSF-P}[p] \leftarrow \text{AI\_TSF-P}$$ - -$$\text{aFDI-P}[p] \leftarrow \text{AI\_TSF-P}$$ - -$$\text{aSSF-O}[p] \leftarrow \text{AI\_TSF-O}$$ - -$$\text{aFDI-O}[p] \leftarrow \text{AI\_TSF-O}$$ - -**Defect correlations:** None. - -**Performance monitoring:** None. - -### **10.3.2 OMS-O to OTSiG-O and OCh-O adaptation function (OMS-O/OTSiG|OCh-O\_A)** - -The OMS-O to OTSiG-O adaptation functions perform the adaptation between the OMS-O layer adapted information and the characteristic information of n OTSiG-O and m OCh-O layer signals. This includes the optical payload and the overhead. - -#### 10.3.2.1 OMS-O to OTSiG-O and OCh-O adaptation source function (OMS-O/OTSiG|OCh-O\_A\_So) - -The OMS-O/OTSiG|OCh-O\_A\_So function multiplexes the individual OTSiG-O\_CIs and OCh-O\_CIs to the OMS-O\_AI. The information flow and processing of the OMS-O/OTSiG|OCh-O\_A\_So function is defined with reference to Figures 10-12 and 10-13. - -##### Symbol - -![Figure 10-12: Symbol diagram for the OMS-O/OTSiG|OCh-O_A_So function. The central block is labeled 'OMS-O/OTSiG|OCh-O'. Inputs from the top are OTSiG-O_CPs (labeled 1, 2, ..., n) and [OCh-O_CPs] (labeled 1, 2, ..., m). An input from the left is OMS-O/OTSiG|OCh-O_A_So_MP. An output to the right is OMS-O/OTSiG|OCh-O_A_So_MECP. An output pointing down is OMS-O_AP. A reference code G.798(17)-Amd.2(19)_F10-12 is shown in the bottom right.](719ef0f734259484038b2434e5dc3f24_img.jpg) - -Figure 10-12: Symbol diagram for the OMS-O/OTSiG|OCh-O\_A\_So function. The central block is labeled 'OMS-O/OTSiG|OCh-O'. Inputs from the top are OTSiG-O\_CPs (labeled 1, 2, ..., n) and [OCh-O\_CPs] (labeled 1, 2, ..., m). An input from the left is OMS-O/OTSiG|OCh-O\_A\_So\_MP. An output to the right is OMS-O/OTSiG|OCh-O\_A\_So\_MECP. An output pointing down is OMS-O\_AP. A reference code G.798(17)-Amd.2(19)\_F10-12 is shown in the bottom right. - -Figure 10-12 – OMS-O/OTSiG|OCh-O\_A\_So function - -##### Interfaces - -Table 10-5 – OMS-O/OTSiG|OCh-O\_A\_So inputs and outputs - -| Input(s) | Output(s) | -|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------------------------------------| -| per OTSiG-O_CP:
OTSiG-O_CI_OH
per OCh-O_CP:
OCh-O_CI_OH
OMS-O/OTSiG OCh-O_A_So_MP:
OMS-O/OTSiG OCh-O_A_So_MI_TxMSI
OMS-O/OTSiG OCh-O_A_So_MECP:
OMS-O/OTSiG OCh-O_A_So_MECl_TxFSS | OMS-O_AP:
OMS-O_AI_OH
OMS-O/OTSiG OCh-O_A_So_MECP:
OMS-O/OTSiG OCh-O_A_So_MECl_TxFSS | - -##### Processes - -The processes associated with the OMS-O/OTSiG|OCh-O\_A\_So function are common processes for the compound (multiplexed) signal as depicted in Figure 10-13. - -**MSI:** See clause 8.7.2.3. - -##### Specific processes - -None. - -##### Common processes - -**Overhead multiplexing:** This process performs overhead multiplexing of the individual OTSiG-O and OCh-O signals. The specific multiplex function is outside the scope of this Recommendation. - -![Figure 10-13: OMS-O/OTSiG|OCh-O_A_So processes diagram. The diagram shows a central 'Overhead multiplexing' block receiving inputs from multiple channels: OTSiG-O_CP[1] to OTSiG-O_CP[n] and OCh-O_CP[1] to OCh-O_CP[m]. Each channel has a corresponding CI_OH input. The 'Overhead multiplexing' block outputs to a 'Common processes' block, which in turn outputs to MECl_TxFSS. A 'Multiplex structure identifier (MSI)' block is connected to the 'Common processes' block and receives input from MI_TxMSI. The 'Common processes' block also outputs to AI_OH, which is part of the OMS-O_AP. The diagram is labeled G.798(17)-Amd.2(19)_F10-13.](c6212a3b14736d6a8c81ace75ae94ccf_img.jpg) - -Figure 10-13: OMS-O/OTSiG|OCh-O\_A\_So processes diagram. The diagram shows a central 'Overhead multiplexing' block receiving inputs from multiple channels: OTSiG-O\_CP[1] to OTSiG-O\_CP[n] and OCh-O\_CP[1] to OCh-O\_CP[m]. Each channel has a corresponding CI\_OH input. The 'Overhead multiplexing' block outputs to a 'Common processes' block, which in turn outputs to MECl\_TxFSS. A 'Multiplex structure identifier (MSI)' block is connected to the 'Common processes' block and receives input from MI\_TxMSI. The 'Common processes' block also outputs to AI\_OH, which is part of the OMS-O\_AP. The diagram is labeled G.798(17)-Amd.2(19)\_F10-13. - -Figure 10-13 – OMS-O/OTSiG|OCh-O\_A\_So processes - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -#### 10.3.2.2 OMS-O to OTSiG-O and OCh-O adaptation sink function (OMS-O/OTSiG|OCh-O\_A\_Sk) - -The OMS-O/OTSiG|OCh-O\_A\_Sk function demultiplexes the OMS-O\_AI into the individual OTSiG-O\_CIs and OCh-O\_CIs. Upon signal fail conditions, it generates FDI for the individual channels. - -The information flow and processing of the OMS-O/OTSiG|OCh-O\_A\_Sk function is defined with reference to Figures 10-14 and 10-15. - -##### Symbol - -![Figure 10-14: OMS-O/OTSiG|OCh-O_A_Sk function diagram. The diagram shows a central block labeled 'OMS-O/OTSiG|OCh-O'. It receives an input from OMS-O_AP at the bottom. On the left, it has a bidirectional connection to OMS-O/OTSiG|OCh-O_A_Sk_MP. On the right, it has a bidirectional connection to OMS-O/OTSiG|OCh-O_A_Sk_MECP. Above the central block, there are two groups of outputs: OTSiG-O_CPs (labeled 1, 2, ..., n) and [OCh-O_CPs] (labeled 1, 2, ..., m). The diagram is labeled G.798(17)-Amd.2(19)_F10-14.](f88e403864388f59871586472847bbd0_img.jpg) - -Figure 10-14: OMS-O/OTSiG|OCh-O\_A\_Sk function diagram. The diagram shows a central block labeled 'OMS-O/OTSiG|OCh-O'. It receives an input from OMS-O\_AP at the bottom. On the left, it has a bidirectional connection to OMS-O/OTSiG|OCh-O\_A\_Sk\_MP. On the right, it has a bidirectional connection to OMS-O/OTSiG|OCh-O\_A\_Sk\_MECP. Above the central block, there are two groups of outputs: OTSiG-O\_CPs (labeled 1, 2, ..., n) and [OCh-O\_CPs] (labeled 1, 2, ..., m). The diagram is labeled G.798(17)-Amd.2(19)\_F10-14. - -Figure 10-14 – OMS-O/OTSiG|OCh-O\_A\_Sk function - -##### Interfaces - -**Table 10-6 – OMS-O/OTSiG|OCh-O\_A\_Sk inputs and outputs** - -| Input(s) | Output(s) | -|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| OMS-O_AP:
OMS-O_AI_OH
OMS-O_AI_TSF-P
OMS-O_AI_TSF-O
OMS-O/OTSiG OCh-O_A_Sk_MP:
OMS-O/OTSiG OCh-
O_A_Sk_MI_ExMSI[1..(n+m)]
OMS-O/OTSiG OCh-O_A_Sk_MECP:
OMS-O/OTSiG OCh-O_A_Sk_MECI_RxFSS | per OTSiG-O_CP:
OTSiG-O_CI_OH
OTSiG-O_CI_SSF-P
OTSiG-O_CI_SSF-O
per OCh-O_CP:
OCh-O_CI_OH
OCh-O_CI_SSF-P
OCh-O_CI_SSF-O
OMS-O/OTSiG OCh-O_A_Sk_MP:
OMS-O/OTSiG OCh-
O_A_Sk_MI_AcMSI[1..(n+m)]
OMS-O/OTSiG OCh-
O_A_Sk_MI_cMSIM[1..(n+m)]
OMS-O/OTSiG OCh-O_A_Sk_MECP:
OMS-O/OTSiG OCh-O_A_Sk_MECI_RxFSS | - -##### Processes - -The processes associated with the OMS-O/OTSiG|OCh-O\_A\_Sk function are specific processes for each OTSiG-O signal and for each OCh-O signal and common processes for the compound (multiplexed) signal as depicted in Figure 10-15. - -##### Common processes - -**Overhead demultiplexing (OHDM):** This process performs the overhead demultiplexing and provides access to the individual OTSiG-O and OCh-O signals. The specific multiplex function is outside the scope of this Recommendation. - -**MSI:** See clause 8.7.2.3. - -##### OTSiG-O Specific processes - -**FDI-O:** On declaration of aFDI-O the function shall insert the FDI-O information (OTSiG-FDI-O) into each OTSiG-O. Otherwise, the incoming OTSiG-FDI-O information is passed through. - -**FDI-P:** On declaration of aFDI-P the function shall insert the FDI-P information (OTSiG-FDI-P) into each OTSiG-O. Otherwise, the incoming OTSiG-FDI-P information is passed through. - -##### OCh-O Specific processes - -**FDI-O:** On declaration of aFDI-O the function shall insert the FDI-O information (OCh-FDI-O) into each OCh-O. Otherwise, the incoming OCh-FDI-O information is passed through. - -**FDI-P:** On declaration of aFDI-P the function shall insert the FDI-P information (OCh-FDI-P) into each OCh-O. Otherwise, the incoming OCh-FDI-P information is passed through. - -![Figure 10-15 – OMS-O/OTSiG|OCh-O_A_Sk processes. This block diagram illustrates the internal structure of the OMS-O/OTSiG|OCh-O_A_Sk function. At the top, four client ports are shown: OTSiG-O_CP[1], OTSiG-O_CP[n], OCh-O_CP[1], and OCh-O_CP[m]. Each port connects to a corresponding 'specific processes' block (OTSiG-O or OCh-O). These blocks contain 'Insert FDI-O', 'Insert FDI-P', and 'Consequent actions' sub-processes, which output various overhead signals (CI_OH, CI_SSF-P, CI_SSF-O). Below these, a central 'Overhead multiplexing' block (labeled 1...n and 1...m) receives inputs from the specific processes and outputs a 'Multiplex structure'. This structure is processed by 'Common processes', which include 'Extract MSI' and 'MSI process' blocks. The 'MSI process' outputs MI_cSIM[1..(n+m)], MI_cSIUM, MI_ExMSI[1..(n+m)], and MI_AcMSI[1..(n+m)]. A 'Defect correlation' block receives inputs from the 'Overhead multiplexing' and 'Common processes' and outputs MI_cSIM[1..(n+m)] and MI_cSIUM. The entire function is bounded by external interfaces: OMS-O/OTSiG|OCh-O_A_Sk_MECP on the left, OMS-O/OTSiG|OCh-O_A_Sk_MP on the right, and OMS-O_AP at the bottom. Internal signals include MECl_RxFSS, AL_TSF-P, and AL_TSF-O.](e404de9a69c05473fbd6af28ee32311b_img.jpg) - -Figure 10-15 – OMS-O/OTSiG|OCh-O\_A\_Sk processes. This block diagram illustrates the internal structure of the OMS-O/OTSiG|OCh-O\_A\_Sk function. At the top, four client ports are shown: OTSiG-O\_CP[1], OTSiG-O\_CP[n], OCh-O\_CP[1], and OCh-O\_CP[m]. Each port connects to a corresponding 'specific processes' block (OTSiG-O or OCh-O). These blocks contain 'Insert FDI-O', 'Insert FDI-P', and 'Consequent actions' sub-processes, which output various overhead signals (CI\_OH, CI\_SSF-P, CI\_SSF-O). Below these, a central 'Overhead multiplexing' block (labeled 1...n and 1...m) receives inputs from the specific processes and outputs a 'Multiplex structure'. This structure is processed by 'Common processes', which include 'Extract MSI' and 'MSI process' blocks. The 'MSI process' outputs MI\_cSIM[1..(n+m)], MI\_cSIUM, MI\_ExMSI[1..(n+m)], and MI\_AcMSI[1..(n+m)]. A 'Defect correlation' block receives inputs from the 'Overhead multiplexing' and 'Common processes' and outputs MI\_cSIM[1..(n+m)] and MI\_cSIUM. The entire function is bounded by external interfaces: OMS-O/OTSiG|OCh-O\_A\_Sk\_MECP on the left, OMS-O/OTSiG|OCh-O\_A\_Sk\_MP on the right, and OMS-O\_AP at the bottom. Internal signals include MECl\_RxFSS, AL\_TSF-P, and AL\_TSF-O. - -**Figure 10-15 – OMS-O/OTSiG|OCh-O\_A\_Sk processes** - -##### Defects: - -For each OTSiG-O or OCh-O client port #p: - -**dMSIM[p]:** See clause 6.2.9.3. - -##### Consequent actions - -The OMS-O/OTSiG|OCh-O\_A\_Sk function performs the following consequent actions. - -For each OTSiG-O or OCh-O client port #p: - -$aSSF-P[p] \leftarrow AI\_TSF-P \text{ or } dMSIM[p]$ - -$aFDI-P[p] \leftarrow AI\_TSF-P \text{ or } dMSIM[p]$ - -$aSSF-O[p] \leftarrow AI\_TSF-O \text{ or } dMSIM[p]$ - -$aFDI-O[p] \leftarrow AI\_TSF-O \text{ or } dMSIM[p]$ - -**Defect correlations:** None. - -**Performance monitoring:** None. - -## 10.4 Sub-layer functions - -For further study. - -# 11 OSC (layer) functions - -The supervision of the optical layer (as represented by the media element) is provided by non-associated overhead carried in an optical supervisory channel (OSC). This overhead is broken into multiple layers, in support of monitoring individual optical signals, an aggregated optical signal between a pair of optical multiplexers, and an aggregate optical signal between a pair of optical line amplifiers. This is analogous to the SDH concepts of a multiplex section and a regenerator section. - -The overhead for monitoring a single optical tributary signal is called Optical channel overhead (OCh-O). The overhead for monitoring a set of one or more optical tributary signals supporting one OTU is called Optical tributary signal group overhead (OTSiG-O). The overhead for monitoring the connection between a pair of optical multiplexers is called Optical Multiplex Section overhead (OMS-O). The overhead for monitoring the connection between an optical multiplexer and an optical amplifier, or a pair of optical amplifiers, is called Optical Transmission Section overhead (OTS-O). Figure 11-1 illustrates the relationship of the media element, the OSC, and the supervisory layers supporting the OTS and OMS maintenance entities. - -![Diagram illustrating the relationship of OSC and supervisory layers to media element. The diagram shows two main paths: one for OTU_TCP and one for OTUk_TCP, both converging on a central Media element. The OTU_TCP path includes layers OTSiG-O, OTSiG, OTSiA, and OTSi. The OTUk_TCP path includes layers OCh-O, OCh, and OTSi. Both paths lead to a common section labeled OTSiA | OCh. Below this, the diagram shows the hierarchy of supervisory layers: OMS-O, OTS-O, OSC, and OTSi, connected by various interfaces like OMS-P LOS, OTS-P LOS, and TCP layers.](e9f6a9e6beb9ae97b392bf38b93ad748_img.jpg) - -The diagram illustrates the relationship between the Media element and various supervisory layers. At the top, two paths are shown: - - -- OTU\_TCP path:** OTU\_TCP → OTSiA/OTU (1 to n) → OTSi (1 to n) → OTSiG → OTSiA → OTSi → Media element. -- OTUk\_TCP path:** OTUk\_TCP → OCh/OTUk → OTSi → OCh-O → OCh → Media element. - - Both paths converge at a section labeled **OTSiA | OCh**. Below this, the diagram shows the hierarchy of supervisory layers: - - -- From the Media element, an **OMS-P LOS** signal goes to **OMS-O**. -- From the Media element, an **OTS-P LOS** signal goes to **OTS-O**. -- The **Media element** is also connected to a section labeled **OTSIG-O\_CP or OCh-O\_CP**. -- From **OTSIG-O\_CP or OCh-O\_CP**, the signal goes to **OMS-O/OTSiG | OCh-O**. -- From **OMS-O/OTSiG | OCh-O**, the signal goes to **OMS-O**. -- From **OMS-O**, the signal goes to **OMS-O\_TCP**. -- From **OMS-O\_TCP**, the signal goes to **OTS-O/OMS-O**. -- From **OTS-O/OMS-O**, the signal goes to **OTS-O**. -- From **OTS-O**, the signal goes to **OTS-O\_TCP**. -- From **OTS-O\_TCP**, the signal goes to **OSC-O/OTS-O**. -- From **OSC-O/OTS-O**, the signal goes to **OSC**. -- From **OSC**, the signal goes to **OSC\_TCP**. -- From **OSC\_TCP**, the signal goes to **OTSi/OSC**. -- From **OTSi/OSC**, the signal goes to **OTSi**. -- Finally, the **OTSi** signal goes to the **WDM signal**. - - Additionally, there are labels for **AI\_TSF** and **OTSiG-O\_TCP** and **OCh-O\_TCP** associated with the top paths. - -Diagram illustrating the relationship of OSC and supervisory layers to media element. The diagram shows two main paths: one for OTU\_TCP and one for OTUk\_TCP, both converging on a central Media element. The OTU\_TCP path includes layers OTSiG-O, OTSiG, OTSiA, and OTSi. The OTUk\_TCP path includes layers OCh-O, OCh, and OTSi. Both paths lead to a common section labeled OTSiA | OCh. Below this, the diagram shows the hierarchy of supervisory layers: OMS-O, OTS-O, OSC, and OTSi, connected by various interfaces like OMS-P LOS, OTS-P LOS, and TCP layers. - -G.798(17)-Cor.1(18)\_F11-1 - -Figure 11-1 – Relationship of OSC and supervisory layers to media element - -Figure 11-2 illustrates the OSC layer network and client layer adaptation functions. The information crossing the OSC termination connection point (OSC\_TCP) is referred to as the OSC characteristic information (OSC\_CI). The information crossing the OSC access point (OSC\_AP) is referred to as the OSC adapted information (OSC\_AI). - -![Figure 11-2: OSC layer network and client layer adaptation functions diagram. It shows three client layers (OTS-O, COMMS, SD) connected to an OSC layer via their respective connection points (OTS-O_CP, COMMS_CP, SD_CP). The OSC layer is connected to the OSC_TCP at the bottom via the OSC_AP.](dbfe5a97dc7e71fd9ae813d4bb865e29_img.jpg) - -The diagram illustrates the adaptation functions at the OSC layer. At the top, three client layers are shown: OTS-O, COMMS, and SD. Each client layer has a connection point (OTS-O\_CP, COMMS\_CP, SD\_CP) that connects to a corresponding OSC client adaptation block (OSC/OTS-O, OSC/COMMS, OSC/SD). These blocks are connected to a central OSC layer. The OSC layer has an access point (OSC\_AP) at the top and a termination connection point (OSC\_TCP) at the bottom. - -Figure 11-2: OSC layer network and client layer adaptation functions diagram. It shows three client layers (OTS-O, COMMS, SD) connected to an OSC layer via their respective connection points (OTS-O\_CP, COMMS\_CP, SD\_CP). The OSC layer is connected to the OSC\_TCP at the bottom via the OSC\_AP. - -G.798(17)\_F11-2 - -**Figure 11-2 – OSC layer network and client layer adaptation functions** - -The OSC adapted information is a logical signal that contains the OTS-O, OMS-O, OCh-O and OTSiG-O logical information elements. The OSC\_AI may also contain general management communications and an OTN synchronization message channel (OSMC). - -The specific OSC\_AI format is outside the scope of this Recommendation. In addition, vendor-specific overhead might be supported via the OSC\_AI. This is outside the scope of this Recommendation. - -![Figure 11-3: OSC adapted information diagram. It shows the hierarchical structure of the OSC adapted information, starting with the OSC layer containing OSMC and COMMS. The OTS-O layer contains TTI, BDI-P, BDI-O, and PMI. The OMS-O layer contains MSI, FDI-P, FDI-O, BDI-P, BDI-O, and PMI. The OTSiG-O[n] layer contains OTSiG-O[2], OTSiG-O[1], TSI, TTI, FDI-P, FDI-O, OCI, BDI-P, and BDI-O. The OCh-O[n] layer contains OCh-O[2], OCh-O[1], FDI-P, FDI-O, and OCI.](c2f36c545b190860d04e1d84e58d22cc_img.jpg) - -The diagram shows the structure of the OSC adapted information. The OSC layer contains OSMC and COMMS. The OTS-O layer contains TTI, BDI-P, BDI-O, and PMI. The OMS-O layer contains MSI, FDI-P, FDI-O, BDI-P, BDI-O, and PMI. The OTSiG-O[n] layer contains OTSiG-O[2], OTSiG-O[1], TSI, TTI, FDI-P, FDI-O, OCI, BDI-P, and BDI-O. The OCh-O[n] layer contains OCh-O[2], OCh-O[1], FDI-P, FDI-O, and OCI. - -Figure 11-3: OSC adapted information diagram. It shows the hierarchical structure of the OSC adapted information, starting with the OSC layer containing OSMC and COMMS. The OTS-O layer contains TTI, BDI-P, BDI-O, and PMI. The OMS-O layer contains MSI, FDI-P, FDI-O, BDI-P, BDI-O, and PMI. The OTSiG-O[n] layer contains OTSiG-O[2], OTSiG-O[1], TSI, TTI, FDI-P, FDI-O, OCI, BDI-P, and BDI-O. The OCh-O[n] layer contains OCh-O[2], OCh-O[1], FDI-P, FDI-O, and OCI. - -G.798(17)\_F11-3 - -**Figure 11-3 – OSC adapted information** - -## 11.1 Connection functions - -Not applicable. - -## 11.2 Termination functions - -### 11.2.1 OSC trail termination function (OSC\_TT) - -The OSC\_TT functions are responsible for the end-to-end supervision of the OSC trail. Figure 11-4 shows the combination of the unidirectional sink and source functions to form a bidirectional function. - -![Diagram of OSC_TT function showing two unidirectional OSC blocks. The left block has an input OSC_AP at the top, an OSC block in the middle, and an output OSC_TCP at the bottom. The right block has an input OSC_TCP at the bottom, an OSC block in the middle, and an output OSC_AP at the top. The diagram is labeled G.798(17)_F11-4.](4a390493f601ce1ac6b9201db4e28b5a_img.jpg) - -Diagram illustrating the OSC\_TT function. It consists of two unidirectional OSC blocks. The left block shows an input OSC\_AP entering the OSC block from the top, and an output OSC\_TCP exiting from the bottom. The right block shows an input OSC\_TCP entering the OSC block from the bottom, and an output OSC\_AP exiting from the top. The diagram is labeled G.798(17)\_F11-4. - -Diagram of OSC\_TT function showing two unidirectional OSC blocks. The left block has an input OSC\_AP at the top, an OSC block in the middle, and an output OSC\_TCP at the bottom. The right block has an input OSC\_TCP at the bottom, an OSC block in the middle, and an output OSC\_AP at the top. The diagram is labeled G.798(17)\_F11-4. - -Figure 11-4 – OSC\_TT - -#### 11.2.1.1 OSC trail termination source function (OSC\_TT\_So) - -The information flow and processing of the OSC\_TT\_So functions is defined with reference to Figure 11-5. The OSC\_TT\_So function generates an optical signal. - -##### Symbol - -![Diagram of OSC_TT_So function showing a single OSC block. An input OSC_AP enters the OSC block from the top, and an output OSC_TCP exits from the bottom. The diagram is labeled G.798(17)_F11-5.](747516f5861a0ddf31e3851da8e34b95_img.jpg) - -Diagram illustrating the OSC\_TT\_So function. It shows a single OSC block. An input OSC\_AP enters the OSC block from the top, and an output OSC\_TCP exits from the bottom. The diagram is labeled G.798(17)\_F11-5. - -Diagram of OSC\_TT\_So function showing a single OSC block. An input OSC\_AP enters the OSC block from the top, and an output OSC\_TCP exits from the bottom. The diagram is labeled G.798(17)\_F11-5. - -Figure 11-5 – OSC\_TT\_So function - -##### Interfaces - -Table 11-1 – OSC\_TT\_So inputs and outputs - -| Input(s) | Output(s) | -|------------------------------------------|-------------------------------------------| -| OSC_AP:
OSC_AI_OH
OSC_AI_CK | OSC_TCP:
OSC_CI_OH
OSC_CI_CK | - -##### Processes - -The specific processes are outside the scope of this Recommendation. - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -#### 11.2.1.2 OSC trail termination sink function (OSC\_TT\_Sk) - -The OSC\_TT\_Sk reports the state of the OSC trail. - -The information flow and processing of the OSC\_TT\_Sk function is defined with reference to Figure 11-6. - -##### Symbol - -![Diagram of the OSC_TT_Sk function symbol. It shows a triangle labeled 'OSC'. An arrow points from 'OSC_TCP' at the bottom to the triangle. An arrow points from the triangle to 'OSC_AP' at the top. A double-headed arrow points from 'OSC_TT_Sk_MP' on the left to the triangle. The text 'G.798(17)_F11-6' is at the bottom right.](b71ad9fc874230de9ba4480e12a216f7_img.jpg) - -G.798(17)\_F11-6 - -Diagram of the OSC\_TT\_Sk function symbol. It shows a triangle labeled 'OSC'. An arrow points from 'OSC\_TCP' at the bottom to the triangle. An arrow points from the triangle to 'OSC\_AP' at the top. A double-headed arrow points from 'OSC\_TT\_Sk\_MP' on the left to the triangle. The text 'G.798(17)\_F11-6' is at the bottom right. - -**Figure 11-6 – OSC\_TT\_Sk function** - -##### Interfaces - -**Table 11-2 – OSC\_TT\_Sk inputs and outputs** - -| Input(s) | Output(s) | -|---------------------------------------------------------|----------------------------------------------------------| -| OSC_TCP:
OSC_CI_OH
OSC_CI_CK
OSC_CI_SSF | OSC_AP:
OSC_AI_OH
OSC_AI_CK
OSC_AI_TSF-O | - -##### Processes - -The specific processes are outside the scope of this Recommendation. - -**Defects:** None. - -##### Consequent actions - -The OSC\_TT\_Sk function shall perform the following consequent action: - -aTSF-O ← CI\_SSF - -**Defect correlations:** None. - -**Performance monitoring:** None. - -## 11.3 Adaptation functions - -The OSC is server for the following clients: - -- optical transport section overhead (OTS-O); -- general management communications (COMMS); -- OTN synchronization distribution channel. - -### 11.3.1 OSC to OTS-O adaptation function (OSC/OTS-O\_A) - -The OSC to OTS-O adaptation functions perform the adaptation between the OSC layer adapted information and the OTS-O layer characteristic information. - -#### 11.3.1.1 OSC to OTS-O adaptation source function (OSC/OTS-O\_A\_So) - -The information flow and processing of the OSC/OTS-O\_A\_So function is defined with reference to Figures 11-7 and 11-8. - -##### Symbol - -![Symbol diagram for OSC/OTS-O_A_So function. It shows a downward flow from OTS-O_CP to a trapezoidal block labeled OSC/OTS-O, which then outputs to OSC_AP. The reference G.798(17)_F11-7 is noted at the bottom right.](64323b705244afc70bf77babdacb6ce5_img.jpg) - -OTS-O\_CP - -OSC/OTS-O - -OSC\_AP - -G.798(17)\_F11-7 - -Symbol diagram for OSC/OTS-O\_A\_So function. It shows a downward flow from OTS-O\_CP to a trapezoidal block labeled OSC/OTS-O, which then outputs to OSC\_AP. The reference G.798(17)\_F11-7 is noted at the bottom right. - -Figure 11-7 – OSC/OTS-O\_A\_So function - -##### Interfaces - -Table 11-3 – OSC/OTS-O\_A\_So inputs and outputs - -| Input(s) | Output(s) | -|--------------------------|----------------------| -| OTS-O_CP:
OTS-O_CI_OH | OSC_AP:
OSC_AI_OH | - -##### Processes - -The processes associated with the OSC/OTS-O\_A\_So function are depicted in Figure 11-8. - -![Process diagram for OSC/OTS-O_A_So. It shows a rectangular block divided into two vertical sections. The left section is labeled OTS-O_CP and CI_OH. The right section is labeled AI_OH and OSC_AP. A downward arrow is shown in the right section. The reference G.978(17)_F11-8 is noted at the bottom right.](34f46103a0c07981b0b51490ea639e25_img.jpg) - -OTS-O\_CP - -CI\_OH - -AI\_OH - -OSC\_AP - -G.978(17)\_F11-8 - -Process diagram for OSC/OTS-O\_A\_So. It shows a rectangular block divided into two vertical sections. The left section is labeled OTS-O\_CP and CI\_OH. The right section is labeled AI\_OH and OSC\_AP. A downward arrow is shown in the right section. The reference G.978(17)\_F11-8 is noted at the bottom right. - -Figure 11-8 – OSC/OTS-O\_A\_So processes - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -#### 11.3.1.2 OSC to OTS-O adaptation sink function (OSC/OTS-O\_A\_Sk) - -The information flow and processing of the OSC/OTS-O\_A\_Sk function is defined with reference to Figure 11-9 and 11-10. - -##### Symbol - -![Symbol diagram for OSC/OTS-O_A_Sk function. It shows a trapezoidal block labeled 'OSC/OTS-O'. An arrow labeled 'OSC_AP' points into the block from below, and an arrow labeled 'OTS-O_CP' points out of the block from the top. The reference code 'G.798(17)_F11-9' is shown below the diagram.](49fe8fe978c0f7e73112d231feb377eb_img.jpg) - -Symbol diagram for OSC/OTS-O\_A\_Sk function. It shows a trapezoidal block labeled 'OSC/OTS-O'. An arrow labeled 'OSC\_AP' points into the block from below, and an arrow labeled 'OTS-O\_CP' points out of the block from the top. The reference code 'G.798(17)\_F11-9' is shown below the diagram. - -Figure 11-9 – OSC/OTS-O\_A\_Sk function - -##### Interfaces - -Table 11-4 – OSC/OTS-O\_A\_Sk inputs and outputs - -| Input(s) | Output(s) | -|---------------------------------------------|---------------------------------------------------| -| OSC_AP:
OSC_AI_OH
OSC_AI_TSF-O | OTS-O_CP:
OTS-O_CI_OH
OTS-O_CI_SSF-O | - -##### Processes - -The processes associated with the OSC/OTS-O\_A\_Sk function are depicted in Figure 11-10. - -![Process diagram for OSC/OTS-O_A_Sk. It shows a rectangular block with two vertical arrows pointing upwards. The left arrow is labeled 'AI_OH' at the bottom and 'CI_OH' at the top. The right arrow is labeled 'AI_TSF-O' at the bottom and 'CI_SSF-O' at the top. The label 'aSSF' is written vertically between the arrows. Below the block, the labels 'OSC_AP' and 'G.978(17)_F11-10' are present.](d15e2d3e8dd9157eb7f0cc120097484a_img.jpg) - -Process diagram for OSC/OTS-O\_A\_Sk. It shows a rectangular block with two vertical arrows pointing upwards. The left arrow is labeled 'AI\_OH' at the bottom and 'CI\_OH' at the top. The right arrow is labeled 'AI\_TSF-O' at the bottom and 'CI\_SSF-O' at the top. The label 'aSSF' is written vertically between the arrows. Below the block, the labels 'OSC\_AP' and 'G.978(17)\_F11-10' are present. - -Figure 11-10 – OSC/OTS-O\_A\_Sk processes - -**Defects:** None. - -##### Consequent actions - -The OSC/OTS-O\_A\_Sk function performs the following consequent actions. - -$aSSF \leftarrow AI\_TSF-O$ - -**Defect correlations:** None. - -**Performance monitoring:** None. - -### 11.3.2 OSC to COMMS adaptation function (OSC/COMMS\_A) - -The OSC to COMMS adaptation functions provide access to the Communication Channel overhead in the OSC for generic data communication. The format of the OSC Communication Channel overhead is outside the scope of this Recommendation. - -#### 11.3.2.1 OSC to COMMS adaptation source function (OSC/COMMS\_A\_So) - -The OSC/COMMS\_A\_So function maps the communication channel data into the OSC Communication Channel overhead. - -The information flow and processing of the OSC/COMMS\_A\_So functions is defined with reference to Figure 11-11. - -##### Symbol - -![Diagram of the OSC/COMMS_A_So function symbol. It shows an input labeled COMMS_CP entering a trapezoidal block labeled OSC/COMMS from the top. An output labeled OSC_AP exits the block from the bottom. The diagram is labeled G.798(17)_F11-11.](b3cd59f24a21fab4cd8ac6fe743ab3a9_img.jpg) - -``` -graph TD; COMMS_CP --> OSC_COMMS[OSC/COMMS]; OSC_COMMS --> OSC_AP; -``` - -Diagram of the OSC/COMMS\_A\_So function symbol. It shows an input labeled COMMS\_CP entering a trapezoidal block labeled OSC/COMMS from the top. An output labeled OSC\_AP exits the block from the bottom. The diagram is labeled G.798(17)\_F11-11. - -Figure 11-11 – OSC/COMMS\_A\_So function - -##### Interfaces - -Table 11-5 – OSC/COMMS\_A\_So inputs and outputs - -| Input(s) | Output(s) | -|----------------------------------------------------------------------------|----------------------------------------------------------------| -| COMMS_CP:
COMMS_CI_D
OSC_AP:
OSC_AI_CK
OSC_AI_FS | COMMS_CP:
COMMS_CI_CK
OSC_AP:
OSC_AI_OH | - -##### Processes - -The function shall insert the COMMS data into the OSC Communication Channel overhead. The specific processes are outside the scope of this Recommendation. - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -#### 11.3.2.2 OSC to COMMS adaptation sink function (OSC/COMMS\_A\_Sk) - -The OSC/COMMS\_A\_Sk extracts the COMMS data from the OSC Communication Channel overhead. - -The information flow and processing of the OSC/COMMS\_A\_Sk functions is defined with reference to Figure 11-12. - -##### Symbol - -![Symbol diagram for OSC/COMMS_A_Sk function. It shows a trapezoidal block labeled 'OSC/COMMS'. An arrow labeled 'OSC_AP' points into the block from below, and an arrow labeled 'COMMS_CP' points out of the block from the top. The reference 'G.798(17)_F11-12' is shown below the block.](dae88eec6d1005984029b794ff8b7a9e_img.jpg) - -Symbol diagram for OSC/COMMS\_A\_Sk function. It shows a trapezoidal block labeled 'OSC/COMMS'. An arrow labeled 'OSC\_AP' points into the block from below, and an arrow labeled 'COMMS\_CP' points out of the block from the top. The reference 'G.798(17)\_F11-12' is shown below the block. - -Figure 11-12 – OSC/COMMS\_A\_Sk function - -##### Interfaces - -Table 11-6 – OSC/COMMS\_A\_Sk inputs and outputs - -| Input(s) | Output(s) | -|---------------------------------------------------------------------|---------------------------------------------------------------| -| OSC_AP:
OSC_AI_CK
OSC_AI_OH
OSC_AI_FS
OSC_AI_TSF | COMMS_CP:
COMMS_CI_CK
COMMS_CI_D
COMMS_CI_SSF | - -##### Processes - -The function shall extract the COMMS data from the OSC communication channel overhead. The specific processes are outside the scope of this Recommendation. - -**Defects:** None. - -##### Consequent actions - -The function shall perform the following consequent actions: - -aSSF ← AI\_TSF - -**Defect correlations:** None. - -**Performance monitoring:** None. - -### 11.3.3 OSC to synchronization distribution adaptation functions - -OSC to synchronization distribution (SD) adaptation functions are given in clause 8.11 of [ITU-T G.781]. - -# 12 OTSiA and OCh (layer) functions - -Figure 12-1 illustrates the OTSiG-O|OCh-O layer network and connectivity to the OTSi|OTSiG to OTUk[V]|OTUCn|FlexO|OSC adaptation functions. - -![Figure 12-1: OTSiG-O and OCh-O layer network and client layer adaptation functions. This complex block diagram illustrates the functional architecture of optical transport network layers. At the top, multiple client layer inputs are shown: OTSi/OTUk, OTSiG/OTUk, OTSi/OTUCn, and OTSiG/OTUCn. These feed into OTSi blocks, which then connect to OCh-O and OTSiG-O adaptation functions. The diagram shows multiple parallel paths for these signals, labeled with '1...n' to indicate multiple instances. These paths converge into a central 'Media element' block. To the right of the media element, a vertical stack of monitoring and overhead processing blocks is shown, including OMS-P LOS, OMS-O, OTS-P LOS, OTS-O, OSC/OTS-O, OSC, OTSi/OSC, and OTSi. Various signal types like OTSiA, OCh, and OTSiG are labeled throughout the interconnection network. The label 'MOTUm' is at the bottom of the media element, and 'G.798(17)_F12-1' is in the bottom right corner.](d1ad05f1189b0d80188fee24ae33c112_img.jpg) - -Figure 12-1: OTSiG-O and OCh-O layer network and client layer adaptation functions. This complex block diagram illustrates the functional architecture of optical transport network layers. At the top, multiple client layer inputs are shown: OTSi/OTUk, OTSiG/OTUk, OTSi/OTUCn, and OTSiG/OTUCn. These feed into OTSi blocks, which then connect to OCh-O and OTSiG-O adaptation functions. The diagram shows multiple parallel paths for these signals, labeled with '1...n' to indicate multiple instances. These paths converge into a central 'Media element' block. To the right of the media element, a vertical stack of monitoring and overhead processing blocks is shown, including OMS-P LOS, OMS-O, OTS-P LOS, OTS-O, OSC/OTS-O, OSC, OTSi/OSC, and OTSi. Various signal types like OTSiA, OCh, and OTSiG are labeled throughout the interconnection network. The label 'MOTUm' is at the bottom of the media element, and 'G.798(17)\_F12-1' is in the bottom right corner. - -**Figure 12-1 – OTSiG-O and OCh-O layer network and client layer adaptation functions** - -The OCh-O characteristic information (OCh-O\_CI) contains the logical information elements for maintenance and operational functions to support the OCh maintenance entity. Figure 12-2 illustrates the overhead information elements that shall be supported across the OCh-O\_CP. - -![Figure 12-2: Information elements at OCh-O_CP/TCP. A rectangular box labeled 'OCh-O_CI' contains three vertically stacked smaller boxes labeled 'FDI-P', 'FDI-O', and 'OCI'. Below the main box is the reference 'G.798(17)_F12-2'.](f61d0925551545b5938b3a4d1bbf63c3_img.jpg) - -Figure 12-2: Information elements at OCh-O\_CP/TCP. A rectangular box labeled 'OCh-O\_CI' contains three vertically stacked smaller boxes labeled 'FDI-P', 'FDI-O', and 'OCI'. Below the main box is the reference 'G.798(17)\_F12-2'. - -G.798(17)\_F12-2 - -**Figure 12-2 – Information elements at OCh-O\_CP/TCP** - -The OTSiG-O characteristic information (OTSiG-O\_CI) contains the logical information elements for maintenance and operational functions to support the OTSiA maintenance entity. Figure 12-3 illustrates the overhead information elements that shall be supported across the OTSiG-O\_CP. - -![Diagram showing information elements at OTSiG-O_CP/TCP. A vertical stack of seven boxes is shown, labeled from top to bottom: TSI, TTI, FDI-P, FDI-O, OCI, BDI-P, and BDI-O. To the left of the stack is the label OTSiG-O_CI. Below the diagram is the text G.798(17)_F12-3.](811d62d08ce934a2a7e5bd877abff7ad_img.jpg) - -G.798(17)\_F12-3 - -Diagram showing information elements at OTSiG-O\_CP/TCP. A vertical stack of seven boxes is shown, labeled from top to bottom: TSI, TTI, FDI-P, FDI-O, OCI, BDI-P, and BDI-O. To the left of the stack is the label OTSiG-O\_CI. Below the diagram is the text G.798(17)\_F12-3. - -**Figure 12-3 – Information elements at OTSiG-O\_CP/TCP** - -## 12.1 Connection functions - -### 12.1.1 OTSiA|OCh connection function (OTSiA|OCh\_C) - -The OTSiA|OCh connection function represents an abstraction of two separate functions. The connection of the OTSiG or OTSi occurs inside a media element; the connection of the overhead is done via the OTSiG|OCh-O\_C. The MI\_MatrixControl signal configures both the OTSiG|OTSi and OTSiG|OCh-O. - -The information flow and processing of the OTSiA|OCh\_C function is defined with reference to Figures 12-4 and 12-5. The OTSiA|OCh\_C function connects media channel points (for the purpose to forward OTSiG or OTSi) and OCh-O or OTSiG-O connection points (for the purpose to forward OCh-O or OTSiG-O characteristic information) from its input ports to its output ports. As the process does not affect the nature of characteristic information, the reference points on either side of the OTSiA|OCh\_C function are the same as illustrated in Figure 12-4. - -The connection process is unidirectional and, as such, no differentiation in sink and source is required. In addition, the OTSiA|OCh\_C function supports the following subnetwork connection protection scheme: - -- 1+1 unidirectional SNC/N. - -Other protection schemes are for further study. - -NOTE 1 – The protection processes have a dedicated sink and source behaviour. - -##### Symbol - -![Diagram of the OTSiA|OCh_C function symbol. The central element is an oval labeled 'OTSiA|OCh_C'. Above and below this oval are horizontal lines of pink circles labeled 'Media channel points'. Above the top line of points is a pink rectangular box labeled 'Zero or more OTSi per MCP'. Above this box are input arrows labeled 'OTSiGs' and 'OTSis', each with a sub-label 'l' and 'm'. Below the bottom line of points is another pink rectangular box labeled 'Zero or more OTSi per MCP'. Below this box are output arrows labeled 'OTSiGs' and 'OTSis', each with a sub-label 'l' and 'm'. To the right of the central oval, there are input arrows labeled 'OTSiG-O_CP' and 'OCh_O_CP', and output arrows labeled 'OTSiG-O_CPs' and 'OCh_O_CPs'. An arrow points from the right side of the oval to a label 'OTSiA|OCh_C_MP'. A small text 'G.798(17)-Amd.2(19)_F12-4' is at the bottom right.](66bf96eec8f739d5e7c9957a178e34e2_img.jpg) - -Diagram of the OTSiA|OCh\_C function symbol. The central element is an oval labeled 'OTSiA|OCh\_C'. Above and below this oval are horizontal lines of pink circles labeled 'Media channel points'. Above the top line of points is a pink rectangular box labeled 'Zero or more OTSi per MCP'. Above this box are input arrows labeled 'OTSiGs' and 'OTSis', each with a sub-label 'l' and 'm'. Below the bottom line of points is another pink rectangular box labeled 'Zero or more OTSi per MCP'. Below this box are output arrows labeled 'OTSiGs' and 'OTSis', each with a sub-label 'l' and 'm'. To the right of the central oval, there are input arrows labeled 'OTSiG-O\_CP' and 'OCh\_O\_CP', and output arrows labeled 'OTSiG-O\_CPs' and 'OCh\_O\_CPs'. An arrow points from the right side of the oval to a label 'OTSiA|OCh\_C\_MP'. A small text 'G.798(17)-Amd.2(19)\_F12-4' is at the bottom right. - -Figure 12-4 – OTSiA|OCh\_C function - -##### Interfaces - -Table 12-1 – OTSiA|OCh\_C function inputs and outputs - -| Input(s) | Output(s) | -|----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| Per MCP
Zero or more OTSi_CI
Per OTSiG-O_CP:
OTSiG-O_CI_OH
OTSiG-O_CI_SSF-P
OTSiG-O_CI_SSF-O
OTSiG-O_CI_TSF-P (Note)
Per OCh-O_CP:
OCh-O_CI_OH
OCh-O_CI_SSF-P
OCh-O_CI_SSF-O
OCh-O_CI_TSF-P (Note)
OTSiA OCh_C_MP:
OTSiA OCh_C_MI_MatrixControl
Per protection group:
OTSiA OCh_C_MI_OperType
OTSiA OCh_C_MI_WTR
OTSiA OCh_C_MI_HoTime
OTSiA OCh_C_MI_ExtCMD
OTSiA OCh_C_MI_TSF-ODis | Per MCP
Zero or more OTSi_CI
Per OTSiG-O_CP:
OTSiG-O_CI_OH
OTSiG-O_CI_SSF-P
OTSiG-O_CI_SSF-O
Per OCh-O_CP:
OCh-O_CI_OH
OCh-O_CI_SSF-P
OCh-O_CI_SSF-O

OTSiA OCh_C_MP:
For further study | -| NOTE – In case of SNC/N protection. | | - -##### Processes - -The processes associated with the OTSi|OCh\_C function are as depicted in Figure 12-5. - -OTSi|OCh\_CI is routed between input and output media channel points and overhead and maintenance signal connection points by means of one or more matrix media channel connections and an overhead and maintenance signal a matrix connection. Connection points may be allocated within a protection group. - -NOTE 2 – Neither the number of input/output signals to the connection function, nor the connectivity, is specified in this Recommendation. That is a property of individual network elements. Examples of connectivity are given in Appendix I of [ITU-T G.806]. - -**Routing:** The function shall be able to connect a specific input with a specific output by means of establishing a matrix overhead/maintenance signal channel/connection (MOMSC) and/or a matrix media channel (MMC) between the specified input and output, and it shall be able to remove an established MOMSC and/or MMC as defined by MI\_MatrixControl. - -The matrix control in this case refers to both the configuration of the media element to achieve the desired payload connectivity and/or the configuration of the OTSi|OCh-O\_C to achieve the desired overhead and maintenance signal connectivity. - -Three cases are supported: - -- 1) **MMC** only command; -*this is the first portion of case 1 of [ITU-T G.872]. i.e., pre-configure matrix media channels* -- 2) **MOMSC** only command; -*this is the second portion of case 1 of [ITU-T G.872]. i.e., configure the overhead connectivity (given that there already exist the pre-configure matrix media channels)* -- 3) **MMC+MOMSC** command; -*this is case 2 of [ITU-T G.872], i.e., configure both the matrix media channels and overhead connectivity at the same time* - -by the following commands: - -- Command: Establish MMC - - Pre-condition: no MMC, no MOMSC - - Post-condition: MMC created, no MOMSC -- Command: Remove MMC - - Pre-condition: MMC exist, no MOMSC - - Post-condition: MMC removed, no MOMSC -- Command: Establish MOMSC - - Pre-condition: MMC exist, no MOMSC - - Post-condition: MMC exist, MOMSC created -- Command: Remove MOMSC - - Pre-condition: MMC exist, MOMSC exist - - Post-condition: MMC exist, MOMSC removed -- Command: Establish MMC + MOMSC - - Pre-condition: no MMC, no MOMSC - - Post-condition: MMC created, MOMSC created -- Command: Remove MMC + MOMSC - - Pre-condition: MMC exist, MOMSC exist - -- Post-condition: MMC removed, MOMSC removed - -Each (matrix) connection in the OTSiA|OCh\_C function should be characterized by the: - -- type of connection: unprotected, 1+1 unidirectional protected; -- traffic direction: unidirectional, bidirectional; -- input and output media channel points and/or overhead and maintenance signal connection points: set of media channel points and/or overhead and maintenance signal connection points. - -NOTE 3 – Broadcast connections are handled as separate connections to the same CP. - -NOTE 4 – For the case a network element supports 1+1 protected matrix connections in its OTSiA|OCh\_C function, this function may contain at any moment in time either all unprotected matrix connections, or all 1+1 protected matrix connections, or a mixture of unprotected and 1+1 protected matrix connections. The actual set of matrix connections and associated connection types and directions are operational parameters controlled by network management. - -Provided no protection switching action is activated/required, the following changes to (the configuration of) a connection shall be possible without disturbing the CI passing the connection: - -- addition and removal of protection; -- addition and removal of connections to/from a broadcast connection; -- change of WTR time; -- change of operation type; -- change of hold-off time. - -**Open connection indication (OCI):** If an output of the connection function is not connected to an input, the OCI maintenance signal is generated for the outgoing signal (CI\_OH). CI\_SSF-P and CI\_SSF-O are false. - -![Figure 12-5 – OTSiA|OCh-O_C function processes. The diagram illustrates the internal structure of an OTSiA|OCh-O_C function. On the left, OTSiGs and OTSis are shown entering and exiting a 'Media element' through 'Media channel points'. A 'Coordination To/from media element' is indicated. The central part is a 'Matrix connection' block, which is part of the OTSiA|OCh_C_MP function. This block has multiple input and output ports. Each port is associated with a set of signals: CI_OH, CI_SSF-P, and CI_SSF-O. The matrix connection itself is shown as a large rectangle with 'OCI' (Open Connection Indication) blocks at the input and output. The signals are labeled 'x-O_CP' at the top and bottom of the matrix connection. The diagram also shows 'Zero or more OTSi per MCP' (Media Channel Point) labels at the top and bottom of the media element. The overall structure shows the flow of signals through the matrix connection within the OTSiA|OCh_C_MP function.](4a5c6fefcac9340ea7f9df373873cae9_img.jpg) - -Figure 12-5 – OTSiA|OCh-O\_C function processes. The diagram illustrates the internal structure of an OTSiA|OCh-O\_C function. On the left, OTSiGs and OTSis are shown entering and exiting a 'Media element' through 'Media channel points'. A 'Coordination To/from media element' is indicated. The central part is a 'Matrix connection' block, which is part of the OTSiA|OCh\_C\_MP function. This block has multiple input and output ports. Each port is associated with a set of signals: CI\_OH, CI\_SSF-P, and CI\_SSF-O. The matrix connection itself is shown as a large rectangle with 'OCI' (Open Connection Indication) blocks at the input and output. The signals are labeled 'x-O\_CP' at the top and bottom of the matrix connection. The diagram also shows 'Zero or more OTSi per MCP' (Media Channel Point) labels at the top and bottom of the media element. The overall structure shows the flow of signals through the matrix connection within the OTSiA|OCh\_C\_MP function. - -Figure 12-5 – OTSiA|OCh-O\_C function processes - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -#### 12.1.1.1 Subnetwork connection protection process - -NOTE – This process is active in the OTSiA|OCh\_C function as many times as there are 1+1 protected matrix connections. - -The basic subnetwork connection protection mechanism is identical to the SDH subnetwork connection process described in [ITU-T G.841]. - -SNC protection with non-intrusive monitoring (SNC/N) is supported. - -Figure 12-6 gives the atomic functions involved in SNC/N protection. The working and protection OTSiG-O or OCh-O CI coming from an OMS-O/OTSiG|OCh-O\_A function are monitored by an OTSiG-O or OCh-O non-intrusive monitor, which provides the TSF-P protection switching criteria. - -![Diagram of SNC/N protection atomic functions showing signal flow between OTSiA|OCh_C, Media element, and OMS-O/OTSiG|OCh-O functions.](107cbeda15ddd53da92c2f677b441c93_img.jpg) - -The diagram illustrates the atomic functions for SNC/N protection. At the top, a central oval represents the **OTSiA|OCh\_C** function. Above it, under the heading **Normal (protected)**, are two sets of input signals labeled **1** and **m**, with text indicating they are **OTSiG or OTSia)** and **OTSiA or OCh**. Below the central oval, on the left, is a **Media element** block. To its left, **Working OTSiG or OTSia)** signals (labeled **1** and **m**) enter the media element. To its right, **Protection OTSiG or OTSia)** signals (also labeled **1** and **m**) exit the media element. Below the media element, four trapezoidal blocks represent **OMS-O/OTSiG|OCh-O** functions. The first and third blocks have downward-pointing arrows, while the second and fourth have upward-pointing arrows. Between the second and third blocks, a **Working x-O\_CI** signal is shown entering the second block. Between the third and fourth blocks, a **Protection x-O\_CI** signal is shown exiting the fourth block. Both **Working x-O\_CI** and **Protection x-O\_CI** signals pass through a non-intrusive monitor block labeled **x-Om**. Above each **x-Om** block is a **TSF-P** (Traffic Switching Function - Protection) block, connected by dashed lines. At the bottom, a note states **a) m equals 1 for OTSi**. Another note at the bottom right indicates **x = OTSiG or OCh**. The diagram is identified by the code **G.798(17)\_F12-6**. - -Diagram of SNC/N protection atomic functions showing signal flow between OTSiA|OCh\_C, Media element, and OMS-O/OTSiG|OCh-O functions. - -**Figure 12-6 – SNC/N protection atomic functions** - -The protection functions at both ends operate the same way, by monitoring working and protection subnetwork connections for defects, evaluating the system status taking into consideration the priorities of defect conditions and of external switch requests, and switching the appropriate channel to the protected (sub)network connection. - -The signal flow associated with the OTSiA|OCh\_C SNC protection process is described with reference to Figure 12-7. The protection process receives control parameters and external switch requests at the MP reference point. The report of status information at the MP reference point is for further study. - -![Diagram of SNC/N protection process showing signal flow between two nodes. Each node has a 'Normal (protected)' block containing 'Working' and 'Protection' sub-blocks. Signals from OTSiG or OTSi (with m parallel paths) enter the 'Normal (protected)' block and are distributed to both 'Working' and 'Protection' sub-blocks. The 'Working' sub-blocks output signals to OTSiG or OTSi (with m parallel paths). The 'Protection' sub-blocks output signals to x-O_CP (where x = OTSiG or OCh). A 'Coordination' link connects the two nodes. The right node also receives an OTSiA | OCh_C_MP signal. A note indicates 'a) m equals 1 for OTSi'.](ca86f53f9735fe98b6c6003d1b759f64_img.jpg) - -a) m equals 1 for OTSi - -G.798(17)\_F12-7 - -Diagram of SNC/N protection process showing signal flow between two nodes. Each node has a 'Normal (protected)' block containing 'Working' and 'Protection' sub-blocks. Signals from OTSiG or OTSi (with m parallel paths) enter the 'Normal (protected)' block and are distributed to both 'Working' and 'Protection' sub-blocks. The 'Working' sub-blocks output signals to OTSiG or OTSi (with m parallel paths). The 'Protection' sub-blocks output signals to x-O\_CP (where x = OTSiG or OCh). A 'Coordination' link connects the two nodes. The right node also receives an OTSiA | OCh\_C\_MP signal. A note indicates 'a) m equals 1 for OTSi'. - -**Figure 12-7 – SNC/N protection process** - -##### *Source direction* - -For 1+1 architecture, the CI coming from the normal (protected) OTSiG or OTSi and OTSiG-O or OCh-O CP is bridged permanently to both the working and protection OTSiG or OTSi and OTSiG-O or OCh-O CP. - -##### *Sink direction* - -For a 1+1 architecture, the CI coming either from the working or protection OTSiG or OTSi and OTSiG-O or OCh-O CP is switched to the normal (protected) OTSiG or OTSi and OTSiG-O or OCh-O CP. A switchover from working to protection OTSiG or OTSi and OTSiG-O or OCh-O CP, or vice versa, is initiated by the switch initiation criteria defined below. - -##### *Switch initiation criteria* - -Automatic protection switching is based on the defect conditions of the working and protection (sub)network connections. These condition(s) are for SNC/N trail signal fail payload (TSF-P) and trail signal fail overhead (TSF-O). The use of TSF-O as protection switching criteria can be disabled (MI\_TSF-ODis). The priority of TSF-P shall be equal to signal fail as defined in [ITU-T G.841]. The priority of TSF-O shall be equal to signal degrade as defined in [ITU-T G.841]. - -In order to allow interworking between nested protection schemes, a hold-off timer is provided. The hold-off timer delays switch initiation in case of signal fail in order to allow a nested protection to react and clear the fault condition. The hold-off timer is started by the activation of signal fail and runs for the hold-off time. Protection switching is only initiated if signal fail is still present at the end of the hold-off time. The hold-off time shall be provisionable between 0 and 10 s in steps of 100 ms. - -Protection switching can also be initiated by external switch commands received via the MP. - -Depending on the mode of operation, internal states (e.g., wait to restore) may also initiate a switch over. See the switch initiation criteria described in [ITU-T G.841]. - -##### *Switching time* - -Refer to [ITU-T G.841]. - -##### Switch restoration - -In the revertive mode of operation, the protected signal shall be switched back from the protection (sub)network connection to the working (sub)network connection when the working (sub)network connection has recovered from the fault. - -To prevent frequent operation of the protection switch due to an intermittent fault, a failed working (sub)network connection must become fault-free for a certain period of time before it is used again. This period, called wait to restore (WTR) period should be of the order of 5-12 minutes and should be capable of being set. - -In the non-revertive mode of operation, no switchback to the working (sub)network connection is performed when it has recovered from the fault. - -Protection switching notifications to the MP are for further study. - -## 12.2 Termination functions - -### 12.2.1 OTSiG-O trail termination function (OTSiG-O\_TT) - -The OTSiG-O\_TT functions are responsible for the end-to-end supervision of the OTSiG-O trail. Figure 12-8 shows the combination of the unidirectional sink and source functions to form a bidirectional function. - -![Diagram of OTSiG-O Trail Termination (TT) function showing sink and source components.](02dfdcd208dbdc8fa4f645885e59dd17_img.jpg) - -The diagram illustrates the OTSiG-O Trail Termination (TT) function as a combination of two unidirectional functions. On the left, a downward-pointing triangle labeled 'OTSiG-O' represents the sink function, with an input arrow from the top and an output arrow pointing to 'OTSiG-O\_TCP' at the bottom. On the right, an upward-pointing triangle labeled 'OTSiG-O' represents the source function, with an input arrow from 'OTSiG-O\_TCP' at the bottom and an output arrow pointing to 'OTSiG-O\_AP' at the top. The reference code 'G.798(17)\_F12-8' is located at the bottom right of the diagram. - -Diagram of OTSiG-O Trail Termination (TT) function showing sink and source components. - -Figure 12-8 – OTSiG-O\_TT - -#### 12.2.1.1 OTSiG-O trail termination source function (OTSiG-O\_TT\_So) - -The OTSiG-O\_TT\_So function adds overhead for the purpose of managing an OTSiG maintenance entity – including OTSiG-O TTI, OCI, TSI, FDI-P/O and BDI-P/O. - -The information flow and processing of the OTSiG-O\_TT\_So function is defined with reference to Figures 12-9 and 12-10. - -##### Symbol - -![Symbol for OTSiG-O Trail Termination Source (TT_So) function.](66decd3c38c5f918f528096090219e15_img.jpg) - -The diagram shows the symbol for the OTSiG-O Trail Termination Source (TT\_So) function. It consists of a downward-pointing triangle labeled 'OTSiG-O'. An input arrow labeled 'OTSiG-O\_TT\_So\_RP' enters the triangle from the right. An output arrow points from the bottom vertex of the triangle to 'OTSiG-O\_TCP'. The reference code 'G.798(17)\_F12-9' is located at the bottom right of the diagram. - -Symbol for OTSiG-O Trail Termination Source (TT\_So) function. - -Figure 12-9 – OTSiG-O\_TT\_So function - -##### Interfaces - -**Table 12-2 – OTSiG-O\_TT\_So inputs and outputs** - -| Input(s) | Output(s) | -|-------------------------------------------------------------------------------------------------------------------------------------------|--------------------------------------| -| OTSiG-O_RP:
OTSiG-O_RI_BDI-O
OTSiG-O_RI_BDI-P
OTSiG-O_TT_So_MP:
OTSiG-O_TT_So_MI_TxTI
OTSiG-O_TT_So_MI_TxTSI | OTSiG-O_TCP:
OTSiG-O_CI_OH | - -##### Processes - -The processes associated with the OTSiG-O\_TT\_So function are as depicted in Figure 12-10. - -**TTI:** The trail trace identifier information (OTSiG-TTI) is inserted into the OTSiG-O portion of the OSC. Its value is derived from reference point OTSiG-O\_TT\_So\_MP. The trail trace format is described in clause 15.2 of [ITU-T G.709]. - -**TSI:** The transmitter structure identifier information (OTSiG-TSI) is inserted into the OTSiG-O portion of the OSC. Its value is derived from reference point OTSiG-O\_TT\_So\_MP. - -**BDI-P:** The BDI-P information (OTSiG-BDI-P) is inserted into the OTSiG-O portion of the OSC. Its value is derived from reference point OTSiG-O\_TT\_So\_RP. Upon the declaration/clearing of aBDI-P at the termination sink function, the trail termination source function shall have inserted/removed the BDI-P indication within 50 ms. - -**BDI-O:** The BDI-O information (OTSiG-BDI-O) is inserted into the OTSiG-O portion of the OSC. Its value is derived from reference point OTSiG-O\_TT\_So\_RP. Upon the declaration/clearing of aBDI-O at the termination sink function, the trail termination source function shall have inserted/removed the BDI-O indication within 50 ms. - -The FDI-P, FDI-O and OCI information elements shall be set to false. - -![Diagram of OTSiG-O_TT_So processes showing overhead insertion steps and their associated reference points.](987a8ea27d373fa66433e6b8cb2e98ab_img.jpg) - -The diagram illustrates the 'Overhead insertion' process within the OTSiG-O\_TT\_So function. A central vertical bar labeled 'Overhead insertion' has arrows pointing to it from seven boxes: 'Insert BDI-P', 'Insert BDI-O', 'Insert OCI', 'Insert FDI-P', 'Insert FDI-O', 'Insert TTI', and 'Insert TSI'. These boxes are grouped into two sets by curly braces on the right. The top set, containing BDI-P, BDI-O, OCI, FDI-P, and FDI-O, is associated with the reference point 'OTSiG-O\_TT\_So\_RP' and has input arrows from 'RI\_BDI-P' and 'RI\_BDI-O'. The bottom set, containing TTI and TSI, is associated with the reference point 'OTSiG-O\_TT\_So\_MP' and has input arrows from 'MI\_TxTTI' and 'MI\_TxTSI'. An arrow points from the bottom of the 'Overhead insertion' bar to 'CI\_OH'. Below the diagram, the label 'OTSiG-O\_TCP' is present. In the bottom right corner, the text 'G.798(17)-Cor.1(18)\_F12-10' is visible. - -Diagram of OTSiG-O\_TT\_So processes showing overhead insertion steps and their associated reference points. - -**Figure 12-10 – OTSiG-O\_TT\_So processes** - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -#### 12.2.1.2 OTSiG-O trail termination sink function (OTSiG-O\_TT\_Sk) - -The OTSiG-O\_TT\_Sk function extracts the OTSiG-O overhead – including the FDI-P, FDI-O and OCI signals – from the OTSiG-O signal at its OTSiG-O\_TCP, detects for OCI, FDI-P and FDI-O defects. - -##### Symbol - -![Symbol diagram for OTSiG-O_TT_Sk function. A central triangle labeled 'OTSiG-O' has four interfaces: OTSiG-O_AP at the top (output), OTSiG-O_TT_Sk_MP on the left (input), OTSiG-O_TT_Sk_RP on the right (output), and OTSiG-O_TCP at the bottom (input).](014daefdecf9d847ca82cb5b9f50731f_img.jpg) - -G.798(17)-Amd.3(21)\_F12-11 - -Symbol diagram for OTSiG-O\_TT\_Sk function. A central triangle labeled 'OTSiG-O' has four interfaces: OTSiG-O\_AP at the top (output), OTSiG-O\_TT\_Sk\_MP on the left (input), OTSiG-O\_TT\_Sk\_RP on the right (output), and OTSiG-O\_TCP at the bottom (input). - -**Figure 12-11 – OTSiG-O\_TT\_Sk function** - -##### Interfaces - -**Table 12-3 – OTSiG-O\_TT\_Sk inputs and outputs** - -| Input(s) | Output(s) | -|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| OTSiG-O_TCP:
OTSiG-O_CI_OH
OTSiG-O_CI_SSF-P
OTSiG-O_CI_SSF-O
OTSiG-O_TT_Sk_MP:
OTSiG-O_TT_Sk_MI_ExSAPI
OTSiG-O_TT_Sk_MI_ExDAPI
OTSiG-O_TT_Sk_MI_GetAcTI
OTSiG-O_TT_Sk_MI_TIMDetMo
OTSiG-O_TT_Sk_MI_TIMActDis
OTSiG-O_TT_Sk_MI_1second | OTSiG-O_AP:
OTSiG-O_AI_TSF-P
OTSiG-O_AI_TSF-O
OTSiG-O_RP:
OTSiG-O_RI_BDI-P
OTSiG-O_RI_BDI-O
OTSiG-O_TT_Sk_MP:
OTSiG-O_TT_Sk_MI_AcTI
OTSiG-O_TT_Sk_MI_cTIM
OTSiG-O_TT_Sk_MI_cBDI
OTSiG-O_TT_Sk_MI_cBDI-P
OTSiG-O_TT_Sk_MI_cBDI-O
OTSiG-O_TT_Sk_MI_cOCI
OTSiG-O_TT_Sk_MI_cSSF
OTSiG-O_TT_Sk_MI_cSSF-P
OTSiG-O_TT_Sk_MI_cSSF-O
OTSiG-O_TT_Sk_MI_pN_DS-P
OTSiG-O_TT_Sk_MI_pN_DS-O
OTSiG-O_TT_Sk_MI_pF_DS-P
OTSiG-O_TT_Sk_MI_pF_DS-O | - -##### Processes - -The processes associated with the OTSiG-O\_TT\_Sk function are as depicted in Figure 12-12. The specific implementation for extracting information elements from the OTSiG-O\_CI is outside the scope of this Recommendation. - -**TTI:** The trail trace identifier information (OTSiG-TTI) shall be recovered from the OTSiG-O portion of the OSC and processed as specified in clause 8.6. The accepted value of the TTI is available at the MP. The trail trace format is described in clause 15.2 of [ITU-T G.709]. - -**BDI-P:** The BDI-P information (OTSiG-BDI-P) shall be extracted from the OTSiG-O portion of the OSC. It shall be used for BDI-P defect detection. - -**BDI-O:** The BDI-O information (OTSiG-BDI-O) shall be extracted from the OTSiG-O portion of the OSC. It shall be used for BDI-O defect detection. - -**FDI-P:** The FDI-P information (OTSiG-O-FDI-P) shall be extracted from the OTSiG-O portion of the OSC. It shall be used for FDI-P defect detection. - -**FDI-O:** The FDI-O information (OTSiG-O-FDI-O) shall be extracted from the OTSiG-O portion of the OSC. It shall be used for FDI-O defect detection. - -**OCI:** The OCI information (OTSiG-O-OCI) shall be extracted from the OTSiG-O portion of the OSC. It shall be used for OCI defect detection. - -**TSI:** The TSI information (OTSiG-O-TSI) shall be extracted from the OTSiG-O portion of the OSC. - -![Diagram of OTSiG-O_TT_Sk processes showing internal components and their interactions. The diagram is divided into three main sections: OTSiG-O_TT_Sk_RP (top), OTSiG-O_TT_Sk_MP (middle), and OTSiG-O_TCP (bottom). OTSiG-O_TT_Sk_RP includes RI_BDI-O, RI_BDI-P, and Consequent actions. OTSiG-O_TT_Sk_MP includes MI_TIMActDis, MI_AcTI, MI_ExSAPI, MI_ExDAPI, MI_GetAcTI, MI_TIMDetMo, Process TTI, Extract TTI, Defect correlation, Performance monitoring, and OTSiG OH access. OTSiG-O_TCP includes CI_SSF-P, CI_SSF-O, and CI_OH. Arrows show data flow between these components and external signals like AI_TSF-P, AI_SSF-O, dTIM, dOCI, dFDI-O, dFDI-P, dBDI-O, dBDI-P, CI_SSF-O, and CI_SSF-P.](9faa3512b2ff7973283e76192e91bf65_img.jpg) - -``` - -graph TD - subgraph OTSiG-O_TT_Sk_RP - RI_BDI_O[RI_BDI-O] - RI_BDI_P[RI_BDI-P] - ConsActions[Consequent actions] - end - - subgraph OTSiG-O_TT_Sk_MP - MI_Signals[MI_TIMActDis -MI_AcTI -MI_ExSAPI -MI_ExDAPI -MI_GetAcTI -MI_TIMDetMo] - ProcessTTI[Process TTI] - ExtractTTI[Extract TTI] - DefectCorr[Defect correlation] - PerfMon[Performance monitoring] - OHAccess[OTSiG OH access] - end - - subgraph OTSiG-O_TCP - CI_SSF_P[CI_SSF-P] - CI_SSF_O[CI_SSF-O] - CI_OH[CI_OH] - end - - OHAccess --> ExtractTTI - OHAccess --> ExtractBDI_O[Extract BDI-O] - OHAccess --> ExtractBDI_P[Extract BDI-P] - OHAccess --> ExtractFDI_O[Extract FDI-O] - OHAccess --> ExtractFDI_P[Extract FDI-P] - OHAccess --> ExtractOCI[Extract OCI] - - ExtractTTI --> ProcessTTI - ProcessTTI --> dTIM - ExtractBDI_O --> dBDI_O - ExtractBDI_P --> dBDI_P - ExtractFDI_O --> dFDI_O - ExtractFDI_P --> dFDI_P - ExtractOCI --> dOCI - - dTIM --> DefectCorr - dBDI_O --> DefectCorr - dBDI_P --> DefectCorr - dFDI_O --> DefectCorr - dFDI_P --> DefectCorr - dOCI --> DefectCorr - - DefectCorr --> MI_cSignals[MI_cSSF-O -MI_cSSF-P -MI_cBDI-O -MI_cBDI-P -MI_cSSF -MI_cBDI -MI_cTIM -MI_cOCI] - - dBDI_O --> PerfMon - dBDI_P --> PerfMon - PerfMon --> MI_pfSignals[MI_pF_DS-O -MI_pF_DS-P -MI_1second -MI_pN_DS-O -MI_pN_DS-P] - - ConsActions --> AI_TSF_P[AI_TSF-P] - ConsActions --> AI_SSF_O[AI_SSF-O] - -``` - -Diagram of OTSiG-O\_TT\_Sk processes showing internal components and their interactions. The diagram is divided into three main sections: OTSiG-O\_TT\_Sk\_RP (top), OTSiG-O\_TT\_Sk\_MP (middle), and OTSiG-O\_TCP (bottom). OTSiG-O\_TT\_Sk\_RP includes RI\_BDI-O, RI\_BDI-P, and Consequent actions. OTSiG-O\_TT\_Sk\_MP includes MI\_TIMActDis, MI\_AcTI, MI\_ExSAPI, MI\_ExDAPI, MI\_GetAcTI, MI\_TIMDetMo, Process TTI, Extract TTI, Defect correlation, Performance monitoring, and OTSiG OH access. OTSiG-O\_TCP includes CI\_SSF-P, CI\_SSF-O, and CI\_OH. Arrows show data flow between these components and external signals like AI\_TSF-P, AI\_SSF-O, dTIM, dOCI, dFDI-O, dFDI-P, dBDI-O, dBDI-P, CI\_SSF-O, and CI\_SSF-P. - -G.798(17)-Amd.3(21)\_F12-12 - -Figure 12-12 – OTSiG-O\_TT\_Sk processes - -##### Defects - -The function shall detect for dFDI-P, dFDI-O and dOCI. - -**dFDI-P:** See clause 6.2.6.1.1. - -**dFDI-O:** See clause 6.2.6.2.1. - -**dOCI:** See clause 6.2.6.8.1; dOCI shall be set to false during CI\_SSF-O and dFDI-O. - -**dTIM:** See clause 6.2.2.1; dTIM shall be set to false during CI\_SSF-O and dFDI-O. - -**dBDI-P:** See clause 6.2.6.4.1; dBDI-P shall be set to false during CI\_SSF-O and dFDI-O. - -**dBDI-O:** See clause 6.2.6.5.1; dBDI-O shall be set to false during CI\_SSF-O and dFDI-O. - -##### Consequent actions - -The function shall perform the following consequent actions: - -$aTSF\text{-}P \leftarrow CI\_SSF\text{-}P \text{ or } dOCI \text{ or } dFDI\text{-}P \text{ or } (dTIM \text{ and } (\text{not } TIMActDis))$ - -$aTSF\text{-}O \leftarrow CI\_SSF\text{-}O \text{ or } dFDI\text{-}O \text{ or } (dTIM \text{ and } (\text{not } TIMActDis))$ - -$aBDI\text{-}P \leftarrow CI\_SSF\text{-}P \text{ or } dFDI\text{-}P \text{ or } dTIM$ - -$aBDI\text{-}O \leftarrow CI\_SSF\text{-}O \text{ or } dFDI\text{-}O \text{ or } dTIM$ - -##### **Defect correlations** - -The function shall perform the following defect correlations to determine the most probable fault cause. This fault cause shall be reported to the EMF. - -$\text{cOCI} \leftarrow \text{dOCI and (not CI\_SSF-P) and (not CI\_SSF-O) and (not FDI-O) and (not FDI-P)}$ - -$\text{cSSF} \leftarrow \text{(CI\_SSF-P or dFDI-P) and (CI\_SSF-O or dFDI-O)}$ - -$\text{cSSF-P} \leftarrow \text{(CI\_SSF-P or dFDI-P) and (not cSSF)}$ - -$\text{cSSF-O} \leftarrow \text{(CI\_SSF-O or dFDI-O) and (not cSSF)}$ - -$\text{cBDI} \leftarrow \text{dBDI-P and dBDI-O and (not CI\_SSF) and (not dTIM)}$ - -$\text{cBDI-P} \leftarrow \text{dBDI-P and (not CI\_SSF) and (not (dTIM and (not TIMActDis))) and (not dBDI-O)}$ - -$\text{cBDI-O} \leftarrow \text{dBDI-O and (not CI\_SSF) and (not (dTIM and (not TIMActDis))) and (not dBDI-P)}$ - -$\text{cTIM} \leftarrow \text{dTIM and (not CI\_SSF)}$ - -##### **Performance monitoring** - -The OTSiG-O\_TT\_Sk function shall perform the following performance monitoring primitives. The performance monitoring primitives shall be reported to the EMF. - -$\text{pN\_DS-P} \leftarrow \text{CI\_SSF-P or dTIM}$ - -$\text{pN\_DS-O} \leftarrow \text{CI\_SSF-O or dTIM}$ - -$\text{pF\_DS-P} \leftarrow \text{dBDI-P}$ - -$\text{pF\_DS-O} \leftarrow \text{dBDI-O}$ - -NOTE – Performance monitoring primitives based on signal quality monitoring are for further study. Specific implementations are outside the scope of this Recommendation. - -### 12.2.2 OCh-O trail termination function (OCh-O\_TT) - -The OCh-O\_TT functions are responsible for the end-to-end supervision of the OCh-O trail. Figure 12-13 shows the combination of the unidirectional sink and source functions to form a bidirectional function. - -![Diagram of OCh-O trail termination function (OCh-O_TT) showing two unidirectional functions (sink and source) combined into a bidirectional function.](4afdd54473731079bf51f7d1acf72187_img.jpg) - -``` - -graph TD - subgraph Sink - A1[ ] --> B1[OCh-O] - B1 --> C1[OCh-O_TCP] - end - subgraph Source - C2[OCh-O_TCP] --> B2[OCh-O] - B2 --> A2[OCh-O_AP] - end - style B1 fill:none,stroke:#000,stroke-width:1px - style B2 fill:none,stroke:#000,stroke-width:1px - style A1 height:0px,width:0px - -``` - -The diagram illustrates the OCh-O trail termination function (OCh-O\_TT) as a combination of two unidirectional functions. On the left, a unidirectional sink function is shown as an inverted triangle labeled 'OCh-O' with an input arrow from the top and an output arrow pointing down to 'OCh-O\_TCP'. On the right, a unidirectional source function is shown as an inverted triangle labeled 'OCh-O' with an input arrow from 'OCh-O\_TCP' pointing up into the triangle and an output arrow pointing up to 'OCh-O\_AP'. Below the diagrams is the reference code G.798(17)\_F12-13. - -Diagram of OCh-O trail termination function (OCh-O\_TT) showing two unidirectional functions (sink and source) combined into a bidirectional function. - -**Figure 12-13 – OCh-O\_TT** - -#### 12.2.2.1 OCh-O trail termination source function (OCh-O\_TT\_So) - -The information flow and processing of the OCh-O\_TT\_So function is defined with reference to Figure 12-14. - -##### Symbol - -![Symbol for OCh-O_TT_So function](7c6fd006fc4d304794392d41fab4ee10_img.jpg) - -The diagram shows a downward-pointing triangle labeled "OCh-O". An arrow points from the bottom vertex of the triangle to the text "OCh-O\_TCP". Below the text "OCh-O\_TCP" is the reference code "G.798(17)\_F12-14". - -Symbol for OCh-O\_TT\_So function - -Figure 12-14 – OCh-O\_TT\_So function - -##### Interfaces - -Table 12-4 – OCh-O\_TT\_So inputs and outputs - -| Input(s) | Output(s) | -|----------|---------------------------| -| | OCh-O_TCP:
OCh-O_CI_OH | - -##### Processes - -The function shall generate the logical OCh-O signal. The FDI-P, FDI-O and OCI information elements shall be set to false. - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -#### 12.2.2.2 OCh-O trail termination sink function (OCh-O\_TT\_Sk) - -The OCh-O\_TT\_Sk function extracts the OCh-O overhead – including the FDI-P, FDI-O and OCI signals – from the OCh-O signal at its OCh-O\_TCP, detects for OCI, FDI-P and FDI-O defects. - -##### Symbol - -![Symbol for OCh-O_TT_Sk function](8f0dbc9a3fca3bcfa8574edb6061b03c_img.jpg) - -The diagram shows a downward-pointing triangle labeled "OCh-O". An arrow points from the bottom vertex of the triangle to the text "OCh-O\_TCP". An arrow points from the left side of the triangle to the text "OCh-O\_TT\_Sk\_MP". An arrow points from the top vertex of the triangle to the text "OCh-O\_AP". Below the text "OCh-O\_TCP" is the reference code "G.798(17)\_F12-15". - -Symbol for OCh-O\_TT\_Sk function - -Figure 12-15 – OCh-O\_TT\_Sk function - -##### Interfaces - -**Table 12-5 – OCh-O\_TT\_Sk inputs and outputs** - -| Input(s) | Output(s) | -|----------------------------------------------------------------------|--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| OCh-O_TCP:
OCh-O_CI_OH
OCh-O_CI_SSF-P
OCh-O_CI_SSF-O | OCh-O_AP:
OCh-O_AI_TSF-P
OCh-O_AI_TSF-O
OCh-O_TT_Sk_MP:
OCh-O_TT_Sk_MI_cOCI
OCh-O_TT_Sk_MI_cSSF
OCh-O_TT_Sk_MI_cSSF-P
OCh-O_TT_Sk_MI_cSSF-O | - -##### Processes - -The processes associated with the OCh-O\_TT\_Sk function are as depicted in Figure 12-16. The specific implementation for extracting information elements from the OCh-O\_CI is outside the scope of this Recommendation. - -**FDI-P:** The FDI-P information (OCh-O-FDI-P) shall be extracted from the OCh-O portion of the OSC. It shall be used for FDI-P defect detection. - -**FDI-O:** The FDI-O information (OCh-O-FDI-O) shall be extracted from the OCh-O portion of the OSC. It shall be used for FDI-O defect detection. - -**OCI:** The OCI information (OCh-O-OCI) shall be extracted from the OCh-O portion of the OSC. It shall be used for OCI defect detection. - -![Figure 12-16 – OCh-O_TT_Sk processes. This block diagram shows the internal processes of the OCh-O_TT_Sk function. Inputs from OCh-O_TCP (CI_SSF-P, CI_SSF-O, CI_OH) enter from the bottom. CI_SSF-P and CI_SSF-O feed into 'Extract FDI-O' and 'Extract FDI-P' respectively. CI_OH feeds into 'Extract OCI'. These three extraction blocks feed into an 'Overhead access' block. The 'Overhead access' block feeds into a 'Defect correlation' block. The 'Defect correlation' block outputs MI_cSSF-O, MI_cSSF-P, MI_cSSF, and MI_cOCI to OCh-O_TT_Sk_MP on the left. The 'Defect correlation' block also outputs CI_SSF-O, CI_SSF-P, dFDI-O, dFDI-P, and dOCI. CI_SSF-O and CI_SSF-P feed into 'Consequent actions'. dFDI-O, dFDI-P, and dOCI feed into 'Consequent actions' via intermediate blocks. 'Consequent actions' outputs aTSF-P and aTSF-O to OCh-O_AP at the top. A small note G.798(17)_F12-16 is in the bottom right.](da5a8f834706c8119a47c5eb732feabe_img.jpg) - -Figure 12-16 – OCh-O\_TT\_Sk processes. This block diagram shows the internal processes of the OCh-O\_TT\_Sk function. Inputs from OCh-O\_TCP (CI\_SSF-P, CI\_SSF-O, CI\_OH) enter from the bottom. CI\_SSF-P and CI\_SSF-O feed into 'Extract FDI-O' and 'Extract FDI-P' respectively. CI\_OH feeds into 'Extract OCI'. These three extraction blocks feed into an 'Overhead access' block. The 'Overhead access' block feeds into a 'Defect correlation' block. The 'Defect correlation' block outputs MI\_cSSF-O, MI\_cSSF-P, MI\_cSSF, and MI\_cOCI to OCh-O\_TT\_Sk\_MP on the left. The 'Defect correlation' block also outputs CI\_SSF-O, CI\_SSF-P, dFDI-O, dFDI-P, and dOCI. CI\_SSF-O and CI\_SSF-P feed into 'Consequent actions'. dFDI-O, dFDI-P, and dOCI feed into 'Consequent actions' via intermediate blocks. 'Consequent actions' outputs aTSF-P and aTSF-O to OCh-O\_AP at the top. A small note G.798(17)\_F12-16 is in the bottom right. - -**Figure 12-16 – OCh-O\_TT\_Sk processes** - -##### Defects - -The function shall detect for dFDI-P, dFDI-O and dOCI. - -**dFDI-P:** See clause 6.2.6.1.1. - -**dFDI-O:** See clause 6.2.6.2.1. - -**dOCI:** See clause 6.2.6.8.1; dOCI shall be set to false during CI\_SSF-O and dFDI-O. - -##### Consequent actions - -The function shall perform the following consequent actions: - -$a\text{TSF-P} \leftarrow \text{CI\_SSF-P or dOCI or dFDI-P}$ - -$a\text{TSF-O} \leftarrow \text{CI\_SSF-O or dFDI-O}$ - -##### Defect correlations - -The function shall perform the following defect correlations to determine the most probable fault cause. This fault cause shall be reported to the EMF. - -$c\text{OCI} \leftarrow \text{dOCI and (not CI\_SSF-P) and (not CI\_SSF-O) and (not FDI-O) and (not FDI-P)}$ - -$c\text{SSF} \leftarrow (\text{CI\_SSF-P or dFDI-P}) \text{ and } (\text{CI\_SSF-O or dFDI-O})$ - -$c\text{SSF-P} \leftarrow (\text{CI\_SSF-P or dFDI-P}) \text{ and (not cSSF)}$ - -$c\text{SSF-O} \leftarrow (\text{CI\_SSF-O or dFDI-O}) \text{ and (not cSSF)}$ - -##### Performance monitoring - -For further study. - -### 12.2.3 OTSiA|OCh non-intrusive monitor function - -As the functionality of the OTSiG-O and OCh-O non-intrusive monitor functions is identical to the OTSiG-O\_TT\_Sk and OCh-O\_TT\_Sk functions (see clauses 12.2.1.2 and 12.2.2.2), no dedicated non-intrusive monitoring functions OTSiGm\_TT\_Sk or OChm\_TT\_Sk are defined. For OTSiA and OCh non-intrusive monitoring, the OTSiG-O\_TT\_Sk and OCh-O\_TT\_Sk functions can be connected as shown in Figure 12-17. - -NOTE – Figure 12-17 shows the OCh case. The same principle can be applied for OTSiA. - -The TSF and TSD outputs can be connected to an OCh\_C connection function and used as protection switching trigger criteria for SNC/N protection. - -![Diagram showing the connection of OTSiG-O_TT_Sk and OCh-O_TT_Sk functions as non-intrusive monitors. A central oval labeled 'OCh' has two input arrows from the top labeled 'OCh_CP' and two output arrows to the bottom labeled 'OCh_CP'. Below the 'OCh' oval are two trapezoidal blocks labeled 'OMS/OCh'. To the left, an arrow points from the 'OMS/OCh' block to a triangular block labeled 'OCh', which then points to the 'OCh' oval. To the right, an arrow points from the 'OCh' oval to another triangular block labeled 'OCh', which then points to a dashed box labeled 'TSF'. Below this 'TSF' box is another dashed box labeled 'TSD'. The diagram is labeled G.798(10)_F12-17.](5546020e0c70645fd46b8829e2e3c43b_img.jpg) - -Diagram showing the connection of OTSiG-O\_TT\_Sk and OCh-O\_TT\_Sk functions as non-intrusive monitors. A central oval labeled 'OCh' has two input arrows from the top labeled 'OCh\_CP' and two output arrows to the bottom labeled 'OCh\_CP'. Below the 'OCh' oval are two trapezoidal blocks labeled 'OMS/OCh'. To the left, an arrow points from the 'OMS/OCh' block to a triangular block labeled 'OCh', which then points to the 'OCh' oval. To the right, an arrow points from the 'OCh' oval to another triangular block labeled 'OCh', which then points to a dashed box labeled 'TSF'. Below this 'TSF' box is another dashed box labeled 'TSD'. The diagram is labeled G.798(10)\_F12-17. - -**Figure 12-17 – Connection of OTSiG-O\_TT\_Sk and OCh-O\_TT\_Sk functions as non-intrusive monitor** - -### 12.2.4 Combined OTSiA|OCh and OTUk[V] non-intrusive monitor function (OCTk[V]m) - -As the OCh and OTUk[V] terminations are always collocated in an OTN network, a combined OCh and OTUk[V] non-intrusive monitor is defined as a compound function OCTk[V]m. The OCTk[V]m compound function is the combination of a OTSiG-O|OCh-O\_TT\_Sk (see clause 12.2.1.2 - -or 12.2.2.2), OTSi/OTUk[V]\_A\_Sk (see clauses 16.1.2 and 16.2.2) and OTUk[V]\_TT\_Sk (see clauses 13.2.1.2 and 13.2.2.2) as shown in Figure 12-18. For the OTSi/OTUk\_A, either an OTSi/OTUk-a\_A\_Sk with FEC or an OTSi/OTUk-b\_A\_Sk without FEC can be used (see clause 16.1.2). This depends on the specific application and OTUk signal. - -For non-intrusive monitoring, the OCTk[V]m function can be connected as shown in Figure 12-19. The OCTk[V]m function can be connected to any OCh\_CP in this manner. - -![Figure 12-18: OCTk[V]m compound function diagram. The diagram shows the internal structure of the OCTk[V]m function. On the left, an 'x-O' block (representing OTSiG-O or OCh-O) and an 'OTSi' block are connected to their respective client ports, 'x-O_CP' and 'OTSi_CP'. These are then connected to an 'OTSi/OTUk[V]' block via 'OTSi_AP'. This block is connected to an 'OTUk[V]_CP', which in turn connects to an 'OTUk[V]' block. A large arrow points to the right, showing the simplified representation of the 'OCTk[V]m' function. This function has two input ports: 'x-O_CP' and 'OTSi_CP'.](238754529581b74f0696943d436494bb_img.jpg) - -x = OTSiG-O or OCh-O -G.798(17)\_F12-18 - -Figure 12-18: OCTk[V]m compound function diagram. The diagram shows the internal structure of the OCTk[V]m function. On the left, an 'x-O' block (representing OTSiG-O or OCh-O) and an 'OTSi' block are connected to their respective client ports, 'x-O\_CP' and 'OTSi\_CP'. These are then connected to an 'OTSi/OTUk[V]' block via 'OTSi\_AP'. This block is connected to an 'OTUk[V]\_CP', which in turn connects to an 'OTUk[V]' block. A large arrow points to the right, showing the simplified representation of the 'OCTk[V]m' function. This function has two input ports: 'x-O\_CP' and 'OTSi\_CP'. - -**Figure 12-18 – OCTk[V]m compound function** - -![Figure 12-19: Connection OCTk[V]m compound function (non-intrusive monitor) diagram. This diagram shows the OCTk[V]m function connected within an OTSiA|OCh domain. At the top is an oval labeled 'OTSiA|OCh'. Below it, two 'OCTk[V]m' blocks are shown. Each block has an input port 'x-O_CP' connected to a line. These lines are connected to 'OMS-O/OTSiG-O' blocks. The 'OMS-O/OTSiG-O' blocks are connected to the 'OTSiA|OCh' domain. A dashed arrow labeled 'TSF' points from the 'OCTk[V]m' block to the 'OTSiA|OCh' domain. The diagram also shows 'OTSi' lines entering and leaving the domain. A label 'x = OTSiG-O or OCh-O' is present in the center.](af90aabfe3c8c65617da060d82bf99c5_img.jpg) - -G.798(17)-Amd.4(22)\_F12-19 - -Figure 12-19: Connection OCTk[V]m compound function (non-intrusive monitor) diagram. This diagram shows the OCTk[V]m function connected within an OTSiA|OCh domain. At the top is an oval labeled 'OTSiA|OCh'. Below it, two 'OCTk[V]m' blocks are shown. Each block has an input port 'x-O\_CP' connected to a line. These lines are connected to 'OMS-O/OTSiG-O' blocks. The 'OMS-O/OTSiG-O' blocks are connected to the 'OTSiA|OCh' domain. A dashed arrow labeled 'TSF' points from the 'OCTk[V]m' block to the 'OTSiA|OCh' domain. The diagram also shows 'OTSi' lines entering and leaving the domain. A label 'x = OTSiG-O or OCh-O' is present in the center. - -**Figure 12-19 – Connection OCTk[V]m compound function (non-intrusive monitor)** - -### 12.2.5 Combined OTSiA|OCh, OTUk[V] and ODUkT non-intrusive monitor function (OCTDk[V]m) - -To support detection of bit errors in a serial compound ODUk link connection carried through an OCh domain with 3R regeneration, it is necessary to deploy ODUk tandem connection monitoring between the ODUk connection points at the endpoints of the ODUk serial compound link connection. For this purpose, a combined OCh, OTUk[V] and ODUkT non-intrusive monitor is defined as a compound function OCTDk[V]m. The OCTDk[V]m compound function is the combination of OTSiG-O|OCh-O\_TT\_Sk (see clause 12.2.1.2 or 12.2.2.2), OTSi/OTUk[V]\_A\_Sk (see clauses 16.1.2 and 16.2.2), OTUk[V]\_TT\_Sk (see clauses 13.2.1.2 and 13.2.2.2), OTUk[V]/ODUk\_A (see clauses 13.3.1 and 13.3.2) and ODUkT\_TT (see clause 14.5.1.1) as shown in Figure 12-20. For - -the OTSi/OTUk\_A, either an OTSi/OTUk-a\_A\_Sk with FEC or an OTSi/OTUk-b\_A\_Sk without FEC can be used (see clause 16.1.2). This depends on the specific application and of the OTUk signal. For non-intrusive monitoring, the OCTDk[V]m function can be connected as shown in Figure 12-21. The OCTDk[V]m function can be connected to any OCh\_CP in this manner. - -![Figure 12-20: OCTDk[V]m compound function diagram. The diagram shows a signal flow from bottom to top: x-O_CP enters an x-O triangle, and OTSi_CP enters an OTSi triangle. These combine into an OTSi/OTUk[V] rectangle. Above it, an OTUk[V] triangle receives OTUk[V]_CP. This is followed by an OTUk[V]_AP and an OTUk[V]/ODUk rectangle, which finally connects to an ODUk triangle via an ODUk_CP. To the right, an arrow points to the OCTDk[V]m compound function, which is shown as a triangle receiving x-O_CP and OTSi_CP. Below the diagram, text indicates x = OTSiG-O or OCh-O and G.798(17)_F12-20.](48b17e34bf39cb8a801a634c791250c0_img.jpg) - -Figure 12-20: OCTDk[V]m compound function diagram. The diagram shows a signal flow from bottom to top: x-O\_CP enters an x-O triangle, and OTSi\_CP enters an OTSi triangle. These combine into an OTSi/OTUk[V] rectangle. Above it, an OTUk[V] triangle receives OTUk[V]\_CP. This is followed by an OTUk[V]\_AP and an OTUk[V]/ODUk rectangle, which finally connects to an ODUk triangle via an ODUk\_CP. To the right, an arrow points to the OCTDk[V]m compound function, which is shown as a triangle receiving x-O\_CP and OTSi\_CP. Below the diagram, text indicates x = OTSiG-O or OCh-O and G.798(17)\_F12-20. - -Figure 12-20 – OCTDk[V]m compound function - -![Figure 12-21: Connection OCTDk[V]m compound function (non-intrusive monitor) diagram. The diagram shows a large oval at the top labeled OTSiA | OCh. Below it, two OCTDk[V]m triangles are shown. Each triangle receives an x-O_CP signal. The left OCTDk[V]m triangle is connected to an OTSi input and an OMS-O/OTSiG-O rectangle. The right OCTDk[V]m triangle is connected to an OMS-O/OTSiG-O rectangle and an OTSi output. A dashed arrow labeled TSF points from the right OCTDk[V]m triangle up to the OTSiA | OCh oval. Text in the center indicates x = OTSiG-O or OCh-O. At the bottom right, G.798(17)-Amd.4(22)_F12-21 is noted.](0b998e3ad8f9d104768642612605cb35_img.jpg) - -Figure 12-21: Connection OCTDk[V]m compound function (non-intrusive monitor) diagram. The diagram shows a large oval at the top labeled OTSiA | OCh. Below it, two OCTDk[V]m triangles are shown. Each triangle receives an x-O\_CP signal. The left OCTDk[V]m triangle is connected to an OTSi input and an OMS-O/OTSiG-O rectangle. The right OCTDk[V]m triangle is connected to an OMS-O/OTSiG-O rectangle and an OTSi output. A dashed arrow labeled TSF points from the right OCTDk[V]m triangle up to the OTSiA | OCh oval. Text in the center indicates x = OTSiG-O or OCh-O. At the bottom right, G.798(17)-Amd.4(22)\_F12-21 is noted. - -Figure 12-21 – Connection OCTDk[V]m compound function (non-intrusive monitor) - -## 12.3 Adaptation functions - -See OTSi adaptation functions in clause 16. - -## 12.4 Sub-layer functions - -Not applicable. - -# 13 OTU (layer) functions - -A completely standardized OTUk and OTUCn and a functionally standardized OTUkV are defined. Figure 13-1 illustrates the OTU layer network and client layer adaptation functions. The information crossing the OTU (trail) connection point (OTUk[V]\_CP/TCP or OTUCn\_CP/TCP) is referred to as the OTU characteristic information (OTUk[V]\_CI or OTUCn\_CI). The information crossing the OTU access point (OTUk[V]\_AP or OTUCn\_AP) is referred to as the OTU adapted information (OTUk[V]\_AI or OTUCn\_AI). - -![Figure 13-1: OTU layer network and client layer adaptation functions. The diagram shows two side-by-side vertical stacks of layers. The left stack represents OTUk[V] and the right stack represents OTUCn. Both stacks show the adaptation from client layer connection points (CP) through the OTU layer to the TCP layer. The OTUk[V] stack includes ODuk_CP, COMMS_CP, OTUk[V]_AP, OTUk[V], and OTUk[V]_TCP. The OTUCn stack includes ODUCn_CP, COMMS_CP, OTUCn_AP, OTUCn, and OTUCn_TCP. A reference label G.798(17)-Amd.2(19)_F13-1 is present.](3d1817e8551f9c226a5f561108d3b3f9_img.jpg) - -Figure 13-1: OTU layer network and client layer adaptation functions. The diagram shows two side-by-side vertical stacks of layers. The left stack represents OTUk[V] and the right stack represents OTUCn. Both stacks show the adaptation from client layer connection points (CP) through the OTU layer to the TCP layer. The OTUk[V] stack includes ODuk\_CP, COMMS\_CP, OTUk[V]\_AP, OTUk[V], and OTUk[V]\_TCP. The OTUCn stack includes ODUCn\_CP, COMMS\_CP, OTUCn\_AP, OTUCn, and OTUCn\_TCP. A reference label G.798(17)-Amd.2(19)\_F13-1 is present. - -Figure 13-1 – OTU layer network and client layer adaptation functions - -The OTUk characteristic information (OTUk\_CI) is the unscrambled OTUk frame without FEC code and with one (n=1) instance of defined OTU overhead, together with a frame and multi-frame start. The OTUCn characteristic information (OTUCn\_CI) is the unscrambled OTUCn frame with n instances of defined OTU overhead, together with a frame and multi-frame start. - -NOTE – The OTUCn frame does not contain a FEC area. - -The OTU overhead consists of the SM, GCC0, OSMC and RES overhead fields as shown in Figure 13-2. The OTUk overhead additionally includes the OSMC field. The GCC0 overhead is optional and set to all-ZEROs if not used. The RES overhead is set to all-ZEROs. - -![Figure 13-2: OTU overhead at the OTU_CP/TCP. This is a grid diagram showing the overhead structure. Columns are numbered 1 to 16, and rows are numbered 1 to 4. Row 1 contains 'Frame alignment overhead' (columns 1-7), 'SM' (columns 8-10), and 'GCC0' (columns 11-12). Rows 2 and 3 are labeled 'ODU overhead' and span columns 1-14. Row 4 contains 'OPU overhead' in columns 15-16. Below the grid, a callout shows the 'OTUk frame structure' with 'OSMC' (column 13) and 'RES' (column 14). Another callout shows the 'OTU frame structure #1..#n in OTUCn' with 'RES' (columns 13-14). A reference label G.798(17)_F13-2 is present.](b49477e8f148b5ef044a2fd5a43528f6_img.jpg) - -Figure 13-2: OTU overhead at the OTU\_CP/TCP. This is a grid diagram showing the overhead structure. Columns are numbered 1 to 16, and rows are numbered 1 to 4. Row 1 contains 'Frame alignment overhead' (columns 1-7), 'SM' (columns 8-10), and 'GCC0' (columns 11-12). Rows 2 and 3 are labeled 'ODU overhead' and span columns 1-14. Row 4 contains 'OPU overhead' in columns 15-16. Below the grid, a callout shows the 'OTUk frame structure' with 'OSMC' (column 13) and 'RES' (column 14). Another callout shows the 'OTU frame structure #1..#n in OTUCn' with 'RES' (columns 13-14). A reference label G.798(17)\_F13-2 is present. - -Figure 13-2 – OTU overhead at the OTU\_CP/TCP - -The OTUkV characteristic information (OTUkV\_CI) is the OTUkV frame with valid SM and GCC0 overhead. The OTUkV frame format is outside the scope of this Recommendation. - -The OTUk adapted information (OTUk\_AI) consists of the ODUk\_CI adapted to the OTUk frame, together with a frame and multiframe start. In case of COMMS access at the OTUk\_AP, it also includes the OTUk GCC overhead (GCC0). - -The OTUCn adapted information (OTUCn\_AI) consists of the ODUCn\_CI adapted to the OTUCn frame, together with a frame and multiframe start. In case of COMMS access at the OTUCn\_AP, it also includes the OTUCn GCC overhead (GCC0). - -The OTUkV adapted information (OTUkV\_AI) consists of the ODUk\_CI adapted to the OTUkV frame. The OTUkV frame format and the ODUk\_CI mapping are outside the scope of this Recommendation. In case of COMMS access at the OTUkV\_AP, it also includes the OTUkV GCC overhead. - -## 13.1 Connection functions - -Not applicable. - -## 13.2 Termination functions - -### 13.2.1 OTU trail termination function (OTU\_TT) - -The OTU\_TT function terminates the section monitoring (SM) overhead of the OTU overhead to determine the status of the OTU trail. Figure 13-3 shows the combination of the unidirectional sink and source functions to form a bidirectional function. - -![Figure 13-3 – OTU_TT diagram showing two bidirectional OTU trail termination functions. The left side shows OTUk[V] termination with ODUk[V]_AP at the top, OTUk[V]_TCP at the bottom, and OTUk[V]_RP between them. The right side shows OTUCn termination with OTUCn_AP at the top, OTUCn_TCP at the bottom, and OTUCn_RP between them. Both diagrams show signal flow from AP to RP and from RP to TCP.](2e3b1ae09da2cba02f0bb8a531f1515e_img.jpg) - -The diagram illustrates two bidirectional OTU trail termination functions. On the left, for OTUk[V], an ODUk[V]\_AP signal enters from the top into an OTUk[V] block. Below this block, an OTUk[V]\_RP signal is shown entering from the right. Below the OTUk[V] block, an OTUk[V]\_TCP signal exits downwards. On the right, for OTUCn, an OTUCn\_AP signal enters from the top into an OTUCn block. Below this block, an OTUCn\_RP signal is shown entering from the right. Below the OTUCn block, an OTUCn\_TCP signal exits downwards. The labels OTUk[V]\_RP and OTUCn\_RP are positioned between the two blocks in each pair, indicating the direction of signal flow. - -Figure 13-3 – OTU\_TT diagram showing two bidirectional OTU trail termination functions. The left side shows OTUk[V] termination with ODUk[V]\_AP at the top, OTUk[V]\_TCP at the bottom, and OTUk[V]\_RP between them. The right side shows OTUCn termination with OTUCn\_AP at the top, OTUCn\_TCP at the bottom, and OTUCn\_RP between them. Both diagrams show signal flow from AP to RP and from RP to TCP. - -Figure 13-3 – OTU\_TT - -#### 13.2.1.1 OTU trail termination source function (OTU\_TT\_So) - -The OTU\_TT\_So function computes the BIP-8[1..n] and adds section monitoring overhead (SMOH) – including the TTI, BIP-8[1..n], BDI, BEI[1..n] and IAE signals – in the SM overhead fields to the OTU signal at its OTU\_AP. The OTUCn signal has n SM overhead fields; the OTUk signal has one (n=1) SM overhead field. - -The information flow and processing of the OTU\_TT\_So function is defined with reference to Figures 13-4 and 13-5. - -##### Symbol - -![Diagram showing the OTU_TT_So function symbol for OTUk and OTUCn. Both symbols are inverted triangles with inputs OTUk_AP (top), OTUk_TT_So_MP (left), and OTUk_RP (right) entering from the top, left, and right respectively. The output OTUk_TCP exits from the bottom. A label 'k = 1, 2, 3, 4' is below the OTUk symbol. The OTUCn symbol is identical but for n. A small note G.798(17)-Amd.1(18)_F13-4 is at the bottom right.](bef134816f55f50b735c92ac0c01da38_img.jpg) - -Diagram showing the OTU\_TT\_So function symbol for OTUk and OTUCn. Both symbols are inverted triangles with inputs OTUk\_AP (top), OTUk\_TT\_So\_MP (left), and OTUk\_RP (right) entering from the top, left, and right respectively. The output OTUk\_TCP exits from the bottom. A label 'k = 1, 2, 3, 4' is below the OTUk symbol. The OTUCn symbol is identical but for n. A small note G.798(17)-Amd.1(18)\_F13-4 is at the bottom right. - -Figure 13-4 – OTU\_TT\_So function - -##### Interfaces - -Table 13-1 – OTU\_TT\_So inputs and outputs - -| Input(s) | Output(s) | -|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|---------------------------------------------------------------------| -| OTU_AP:
OTU_AI_CK
OTU_AI_D
OTU_AI_FS
OTU_AI_MFS
OTU_AI_IAE
OTU_RP:
OTU_RI_BDI
OTU_RI_BEI[1..n]
OTU_RI_BIAE
OTU_TT_So_MP:
OTU_TT_So_MI_TxTI
OTU_TT_So_MI_Mode | OTU_TCP:
OTU_CI_CK
OTU_CI_D
OTU_CI_FS
OTU_CI_MFS | - -##### Processes - -The processes associated with the OTU\_TT\_So function are as depicted in Figure 13-5. - -**Mode:** If the MI\_Mode has the value OPERATIONAL, the following processes shall be performed. If the MI\_Mode has the value TRANSPARENT, all information shall be passed through transparently and the following processes shall not be performed. - -**SMOH-TTI:** If the MI\_Mode is OPERATIONAL, the trail trace identifier is inserted in the TTI byte position of the SM field in the first OTU overhead instance. Its value is derived from reference point OTU\_TT\_So\_MP. The trail trace format is described in clause 15.2 of [ITU-T G.709]. - -**SMOH-BDI:** If the MI\_Mode is OPERATIONAL, the backward defect indication is inserted in the BDI bit position of the SM field in the first OTU overhead instance. Its value is derived from reference point OTU\_RP. Upon the declaration/clearing of aBDI at the termination sink function, the trail termination source function shall have inserted/removed the BDI indication within 50 ms. - -**SMOH-BEI/BIAE:** If the MI\_Mode is OPERATIONAL, if RI\_BIAE is true, the value "1011" is inserted into the BEI/BIAE bits of the SM field in all OTU overhead instances. If RI\_BIAE is false, the number of errors indicated in RI\_BEI[i] is encoded in the BEI/BIAE bits of the SM field in OTU overhead instance #i. Upon the detection of incoming alignment error or a number of errors at the termination sink function, the trail termination source function shall have inserted the value in the BEI/BIAE bits within 50 ms. - -**SMOH-BIP-8:** If the MI\_Mode is OPERATIONAL, the calculated BIP-8[i] is inserted into the BIP-8 byte of the SM field in OTU overhead instance #i. For the BIP-8 calculation, see clause 8.3.4.1. - -**SMOH-IAE:** If the MI\_Mode is OPERATIONAL, the incoming alignment error information AI\_IAE is inserted into the IAE bit position of the SM field in the first OTU overhead instance. Upon the declaration of AI\_IAE, the function shall insert the IAE indication for the next 16 multiframes ( $16 \times 256$ frames). Each new declaration of AI\_IAE restarts the 16 multiframe insertion time. - -**SMOH-RES:** The RES field is reserved for future international standardization. If the MI\_Mode is OPERATIONAL, the value shall be fixed to 00. - -![Diagram of OTU_TT_So processes showing the flow of data from OTU_AP to OTU_TCP through various insertion blocks.](a7450c80e88ad3f6ca1427ad84020998_img.jpg) - -The diagram illustrates the OTU\_TT\_So processes. At the top, the **OTU\_AP** provides inputs: **AI\_D**, **AI\_CK**, **AI\_FS**, **AI\_MFS**, and **AI\_IAE**. **AI\_D** and **AI\_CK** are passed through to the bottom. **AI\_FS** and **AI\_MFS** are used by the **Compute BIP-8** block, which outputs **BIP-8[1..n]**. **AI\_IAE** is used by the **Insert IAE** block. The **Compute BIP-8** block feeds into the **Insert BIP-8** block. The **Insert BIP-8**, **Insert IAE**, **Insert BEI/BIAE**, **Insert BDI**, **Insert RES**, and **Insert TTI** blocks are all part of the **SMOH insertion** process. The **SMOH insertion** block outputs to the bottom as **CI\_D**, **CI\_CK**, **CI\_FS**, and **CI\_MFS**, which are part of the **OTU\_TCP**. On the right side, the **RI\_BEI[1..n]**, **RI\_BIAE**, **RI\_BDI**, **MI\_TxTI**, and **MI\_Mode** signals are shown, corresponding to the **OTU\_RP** and **OTU\_TT\_So\_MP** sections. The diagram is labeled G.798(17)-Amd.1(18)\_F13-5. - -Diagram of OTU\_TT\_So processes showing the flow of data from OTU\_AP to OTU\_TCP through various insertion blocks. - -Figure 13-5 – OTU\_TT\_So processes - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -#### 13.2.1.2 OTU trail termination sink function (OTU\_TT\_Sk) - -The OTU\_TT\_Sk function reports the state of the OTU trail. It computes the BIP-8[1..n], extracts section monitoring overhead (SMOH) – including the TTI, BIP-8[1..n], IAE, BDI and BEI[1..n] signals and for OTUCn the STAT field – in the SM overhead fields from the OTU signal at its OTU\_TCP, detects for TIM, DEG and BDI defects, counts during one-second periods errors (detected via the BIP-8) and defects to feed performance monitoring when connected, makes the TTI available to network management, and forwards the error and defect information as backward indications to the companion OTU\_TT\_So function. The OTUCn signal has n SM overhead fields; the OTUK signal has one (n=1) SM overhead field. - -The information flow and processing of the OTU\_TT\_Sk function is defined with reference to Figures 13-6 and 13-7. - -##### Symbol - -![Figure 13-6 – OTU_TT_Sk function. The diagram shows two identical processing paths for OTUk and OTUCn. Each path consists of two OTU blocks. The bottom OTU block takes OTU_TCP as input and produces OTU_TT_Sk_MP (bidirectional), OTU_RP, and ODUCn_AP (for OTUCn) as outputs. The top OTU block takes OTU_TT_Sk_MP (bidirectional), OTU_RP, and ODUCn_AP as inputs and produces OTUk_AP as output. The bottom OTU block is labeled with 'k = 1, 2, 3, 4'.](4c1ea859b93043f2fa17a8fe72fb6176_img.jpg) - -Figure 13-6 – OTU\_TT\_Sk function. The diagram shows two identical processing paths for OTUk and OTUCn. Each path consists of two OTU blocks. The bottom OTU block takes OTU\_TCP as input and produces OTU\_TT\_Sk\_MP (bidirectional), OTU\_RP, and ODUCn\_AP (for OTUCn) as outputs. The top OTU block takes OTU\_TT\_Sk\_MP (bidirectional), OTU\_RP, and ODUCn\_AP as inputs and produces OTUk\_AP as output. The bottom OTU block is labeled with 'k = 1, 2, 3, 4'. - -Figure 13-6 – OTU\_TT\_Sk function - -##### Interfaces - -Table 13-2 – OTU\_TT\_Sk inputs and outputs - -| Input(s) | Output(s) | -|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| OTU_TCP:
OTU_CI_CK
OTU_CI_D
OTU_CI_FS
OTU_CI_MFS
OTU_CI_SSF
OTU_TT_Sk_MP:
OTU_TT_Sk_MI_ExSAPI
OTU_TT_Sk_MI_ExDAPI
OTU_TT_Sk_MI_GetAcTI
OTU_TT_Sk_MI_TIMDetMo
OTU_TT_Sk_MI_TIMActDis
OTU_TT_Sk_MI_DEGThr
OTU_TT_Sk_MI_DEGM
OTU_TT_Sk_MI_1second
OTU_TT_Sk_MI_Mode | OTU_AP:
OTU_AI_CK
OTU_AI_D
OTU_AI_FS
OTU_AI_MFS
OTU_AI_TSF
OTU_AI_TSD
OTU_RP:
OTU_RI_BDI
OTU_RI_BEI[1..n]
OTU_RI_BIAE
OTU_TT_Sk_MP:
OTU_TT_Sk_MI_AcTI
OTU_TT_Sk_MI_cTIM
OTU_TT_Sk_MI_cDEG
OTU_TT_Sk_MI_cBDI
OTU_TT_Sk_MI_cSSF
OTU_TT_Sk_MI_pN_EBC
OTU_TT_Sk_MI_pN_DS
OTU_TT_Sk_MI_pF_EBC
OTU_TT_Sk_MI_pF_DS
OTU_TT_Sk_MI_pBIAE
OTU_TT_Sk_MI_pIAE | - -##### Processes - -The processes associated with the OTU\_TT\_Sk function are as depicted in Figure 13-7. - -**Mode:** If the MI\_Mode has the value OPERATIONAL, the following processes shall be performed. MI\_Mode OPERATIONAL initiates the consequent actions aAIS, aTSF and aTSD, in case of defects. If the MI\_Mode has the value TRANSPARENT, all information shall be passed through transparently and the following processes shall not be performed. - -**SMOH-BIP-8:** If MI\_Mode has the value OPERATIONAL, the BIP-8[1..n] shall be processed as defined in clause 8.3.4.2. The BIP-8[1..n] is extracted from the BIP-8[1..n] bytes of the SM fields in the n SM overhead instances of the OTU signal at the OTU\_TCP. - -**SMOH-TTI:** If MI\_Mode is OPERATIONAL, the trail trace identifier shall be recovered from the TTI byte position of the SM field in the first OTU overhead instance of the OTU signal at the OTU\_TCP and processed as specified as defined in clause 8.6. The accepted value of the TTI is available at the MP (MI\_AcTI). - -**SMOH-BDI:** If MI\_Mode is OPERATIONAL, the backward defect indication shall be recovered from the BDI bit position of the SM field in the first OTU overhead instance of the OTU signal at the OTU\_TCP. It shall be used for BDI defect detection. - -**SMOH-BEI/BIAE:** If MI\_Mode is OPERATIONAL, the BEI[1..n] shall be recovered from the BEI/BIAE bits in the SM fields of the n SM overhead instances in the OTU signal at the OTU\_TCP. They shall be used to determine if far-end errored blocks (nF\_B) have occurred. One nF\_B has occurred per BEI/BIAE[i] value between 1 [0001] and 8 [1000]; otherwise, no nF\_B has occurred. - -**SMOH-IAE:** For the case of OTUk and if MI\_Mode is OPERATIONAL, the incoming alignment error information shall be recovered from IAE bit position of the SM field in the first OTU overhead instance of the OTU signal at the OTU\_TCP. It shall be used for IAE defect detection. - -**SMOH-RES:** RES in the SM field in the OTU signal at the OTU\_TCP is reserved for future international standardization. For this version of this Recommendation, its value shall be ignored. - -**SMOH-STAT:** For OTUCn and if MI\_Mode is OPERATIONAL, the status information shall be recovered from the STAT bits in the SM field of the first OTU overhead instance in the OTUCn signal at the OTUCn\_TCP as defined in clause 8.8. Is shall be used for AIS and IAE defect detection. - -![Figure 13-7 – OTU_TT_Sk processes. A detailed block diagram showing the internal processes of an OTU_TT_Sk. At the top, OTU_AP provides signals AI_TSD, AI_TSF, AI_MFS, AI_FS, AI_CK, and AI_D. At the bottom, OTU_TCP provides signals CI_SSF, CI_MFS, CI_FS, CI_CK, and CI_D. On the left, OTU_RP and OTU_TT_Sk_MP provide various management and monitoring inputs. The central part of the diagram contains several functional blocks: 'Consequent actions', 'Process TTI', 'Defect correlation', 'Performance monitoring', 'Process errors', 'Extract TTI', 'Extract RES', 'OTUCn only Process STAT', 'Extract STAT', 'Extract BDI', 'Extract BEI/BIAE', 'OTUk only Extract IAE', 'Extract BIP-8', 'Compute BIP-8', and 'Compare'. A vertical 'SMOH access' block on the right interacts with several 'Extract' blocks. Arrows indicate the flow of data and control signals between these components and the external interfaces.](f2a6c46fa05d5588ce4c6e1a3ee194c7_img.jpg) - -Figure 13-7 – OTU\_TT\_Sk processes. A detailed block diagram showing the internal processes of an OTU\_TT\_Sk. At the top, OTU\_AP provides signals AI\_TSD, AI\_TSF, AI\_MFS, AI\_FS, AI\_CK, and AI\_D. At the bottom, OTU\_TCP provides signals CI\_SSF, CI\_MFS, CI\_FS, CI\_CK, and CI\_D. On the left, OTU\_RP and OTU\_TT\_Sk\_MP provide various management and monitoring inputs. The central part of the diagram contains several functional blocks: 'Consequent actions', 'Process TTI', 'Defect correlation', 'Performance monitoring', 'Process errors', 'Extract TTI', 'Extract RES', 'OTUCn only Process STAT', 'Extract STAT', 'Extract BDI', 'Extract BEI/BIAE', 'OTUk only Extract IAE', 'Extract BIP-8', 'Compute BIP-8', and 'Compare'. A vertical 'SMOH access' block on the right interacts with several 'Extract' blocks. Arrows indicate the flow of data and control signals between these components and the external interfaces. - -G.798(17)-Amd.1(18)\_F13-7 - -Figure 13-7 – OTU\_TT\_Sk processes - -##### Defects - -If the MI\_Mode has the value OPERATIONAL, the function shall detect dAIS, dTIM, dDEG, dBDI, dBIAE and dIAE defects. If the MI\_Mode is TRANSPARENT, all defects are cleared. - -**dAIS:** See clause 6.2.6.3.2 for OTUCn; for OTUk[V] dAIS shall be assumed false. - -**dTIM:** See clause 6.2.2.1; dTIM shall be set to false during CI\_SSF. - -**dDEG:** See clause 6.2.3.4. - -NOTE 1 – IAE suppresses the one-second near-end errored block count, which is the input for the dDEG detection. This avoids wrong dDEG declaration due to alignment errors already incoming in an OTUk trail. - -**dBDI:** See clause 6.2.6.6.1; dBDI shall be set to false during CI\_SSF. - -**dIAE:** See clauses 6.2.6.10.1 for OTUk and 6.2.6.10.2 for OTUCn; dIAE shall be set to false during CI\_SSF and dTIM. - -**dBIAE:** See clause 6.2.6.11.1; dBIAE shall be set to false during CI\_SSF and dTIM. - -##### Consequent actions - -The function shall perform the following consequent actions: - -aBDI $\leftarrow$ (CI\_SSF or dAIS or dTIM) and MI\_Mode == OPERATIONAL - -aBIAE $\leftarrow$ dIAE and MI\_Mode == OPERATIONAL - -aTSF $\leftarrow$ CI\_SSF or ((dAIS or (dTIM and (not TIMActDis)))) and MI\_Mode == OPERATIONAL - -aTSD $\leftarrow$ dDEG and MI\_Mode == OPERATIONAL - -For each OTU overhead instance #i: - -aBEI[i] $\leftarrow$ nBIPV[i] and MI\_Mode == OPERATIONAL - -##### Defect correlations - -The function shall perform the following defect correlations to determine the most probable fault cause. This fault cause shall be reported to the EMF. - -cTIM $\leftarrow$ dTIM and (not CI\_SSF) and (not dAIS) - -cDEG $\leftarrow$ dDEG and (not CI\_SSF) and (not dAIS) and (not (dTIM and (not TIMActDis)))) - -cBDI $\leftarrow$ dBDI and (not CI\_SSF) and (not dAIS) and (not (dTIM and (not TIMActDis)))) - -cSSF $\leftarrow$ CI\_SSF or dAIS - -##### Performance monitoring - -If the MI\_Mode has the value OPERATIONAL, the function shall perform the following performance monitoring primitives processing. The performance monitoring primitives shall be reported to the EMF. - -pN\_DS $\leftarrow$ CI\_SSF or dAIS or dTIM - -pF\_DS $\leftarrow$ dBDI - -pN\_EBC $\leftarrow \sum nN\_B$ - -NOTE 2 – During CI\_SSF and dAIS, no errored blocks shall be counted. - -pF\_EBC $\leftarrow \sum nF\_B$ - -NOTE 3 – During CI\_SSF and dAIS, no errored blocks shall be counted. - -pBIAE $\leftarrow$ dBIAE - -NOTE 4 – pBIAE is activated at the end of a second if dBIAE was active once during the second. - -pIAE $\leftarrow$ dIAE - -NOTE 5 – pIAE is activated at the end of a second if dIAE was active once during the second. - -NOTE 6 – pIAE and pBIAE are used for the suppression of the PM data in the equipment management functions (see [ITU-T G.874]). If pBIAE is active, the F\_DS and F\_EBC values of the previous and current second have to be discarded (EBC = 0 and DS = false). If pIAE is active, the N/F\_DS and N/F\_EBC values of the previous and current second have to be discarded (EBC = 0 and DS = false). The previous second has to be included due to the delay of the IAE information coming from the remote source. - -### 13.2.2 OTUkV trail termination function (OTUkV\_TT) - -The OTUkV\_TT function terminates the section monitoring (SM) overhead of the OTUkV overhead to determine the status of the OTUkV trail. Figure 13-8 shows the combination of the unidirectional sink and source functions to form a bidirectional function. - -![Diagram of the OTUkV_TT function showing two OTUkV blocks connected by an OTUkV_RP signal.](88fa0e6558e55b5d54f4d3029b21aabb_img.jpg) - -The diagram shows two OTUkV blocks, each represented by a triangle. The left block has an input OTUkV\_AP at its top vertex and an output OTUkV\_TCP at its bottom vertex. The right block has an output OTUkV\_AP at its top vertex and an input OTUkV\_TCP at its bottom vertex. A horizontal line labeled OTUkV\_RP connects the right block to the left block. A label G.798(10)\_F13-8 is positioned near the right block's bottom input. - -Diagram of the OTUkV\_TT function showing two OTUkV blocks connected by an OTUkV\_RP signal. - -Figure 13-8 – OTUkV\_TT - -#### 13.2.2.1 OTUkV trail termination source function (OTUkV\_TT\_So) - -The OTUkV\_TT\_So function computes the signal quality supervision code and adds section monitoring overhead (SMOH) – including the TTI, signal quality supervision code, BDI, BEI signals – in the SM overhead to the OTUkV signal at its OTUk\_AP. In case of frame synchronous mapping of the ODUk client signal, an IAE signal has to be added to the SM overhead. - -The information flow and processing of the OTUkV\_TT\_So function is defined with reference to Figures 13-9 and 13-10. - -##### Symbol - -![Diagram of the OTUkV_TT_So function showing an OTUkV block with multiple inputs and outputs.](ad4da36431850ac19ba59bb74ec29dc9_img.jpg) - -The diagram shows a single OTUkV block, represented by a triangle. It has an input OTUkV\_AP at its top vertex. On its left side, there is an input OTUkV\_TT\_So\_MP. On its right side, there is an input OTUkV\_RP. At its bottom vertex, there is an output OTUkV\_TCP. Next to the bottom output is the label $k = 1, 2, 3, 4$ . A label G.798(10)\_F13-9 is positioned below the bottom output. - -Diagram of the OTUkV\_TT\_So function showing an OTUkV block with multiple inputs and outputs. - -Figure 13-9 – OTUkV\_TT\_So function - -##### Interfaces - -**Table 13-3 – OTUkV\_TT\_So inputs and outputs** - -| Input(s) | Output(s) | -|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|----------------------------------------------------------------------------------------| -| OTUkV_AP:
OTUkV_AI_CK
OTUkV_AI_D
OTUkV_AI_FS
OTUkV_AI_MFS (Note 1)
OTUkV_AI_IAE (Note 2)
OTUkV_RP:
OTUkV_RI_BDI
OTUkV_RI_BEI
OTUkV_RI_BIAE (Note 2)
OTUkV_TT_So_MP:
OTUkV_TT_So_MI_TxTI | OTUkV_TCP:
OTUkV_CI_CK
OTUkV_CI_D
OTUkV_CI_FS
OTUkV_CI_MFS (Note 1) | -| NOTE 1 – If OTUkV has a multiframe. | | -| NOTE 2 – In case of frame synchronous mapping of ODUk client signal. | | - -##### Processes - -The processes associated with the OTUkV\_TT\_So function are as depicted in Figure 13-10. - -**SMOH-TTI:** The trail trace identifier is inserted in the TTI byte position of the SM field. Its value is derived from reference point OTUk\_TT\_So\_MP. The trail trace format is described in clause 15.2 of [ITU-T G.709]. - -**SMOH-BDI:** The backward defect indication is inserted in the BDI field of the SMOH. Its value is derived from reference point OTUk\_RP. Upon the declaration/clearing of aBDI at the termination sink function, the trail termination source function shall have inserted/removed the BDI indication within 50 ms. The BDI coding is outside the scope of this Recommendation. - -**SMOH-BEI:** The number of errors indicated in RI\_BEI is encoded in the BEI field of the SMOH. Upon the detection of a number of errors at the termination sink function, the trail termination source function shall have inserted that value in the BEI bits within 50 ms. The BEI coding is outside the scope of this Recommendation. - -**SMOH-signal quality supervision:** The calculated signal quality supervision code is inserted into the signal quality supervision field of the SMOH. The signal supervision code is outside the scope of this Recommendation. - -**SMOH-IAE:** If a frame synchronous mapping for the ODUk is used, the incoming alignment error information AI\_IAE is inserted into the IAE field of the SMOH. Upon the declaration of AI\_IAE, the function shall insert the IAE indication for the next 16 multiframes. Each new declaration of AI\_IAE restarts the 16 multiframe insertion time. The IAE coding is outside the scope of this Recommendation. - -**SMOH-BIAE:** If a frame synchronous mapping for the ODUk is used, the backward incoming error information RI\_BIAE is inserted into the BIAE field of the SMOH. Upon the detection of the incoming alignment error at the termination sink function, the trail termination source function shall have inserted that value in the BIAE fields within 50 ms. The BIAE coding is outside the scope of this Recommendation. - -The format of the OTUkV frame and overhead is outside the scope of this Recommendation. - -![Figure 13-10 – OTUkV_TT_So processes. This block diagram illustrates the signal processing flow for the OTUkV_TT_So function. At the top, input signals AI_D, AI_CK, AI_FS, AI_MFS, and AI_IAE enter the OTUkV_AP block. AI_D, AI_CK, AI_FS, and AI_MFS are processed through a 'Compute BIP8' block and then into a 'SMOH insertion' block. AI_IAE is processed through an 'Insert IAE' block. The 'SMOH insertion' block outputs CI_D, CI_CK, CI_FS, and CI_MFS signals to the OTUkV_TCP block. The 'Compute BIP8' block also feeds into an 'Insert BIP8' block. The 'Insert BIP8' block feeds into an 'Insert BDI' block, which in turn feeds into an 'Insert BEI' block. The 'Insert BEI' block feeds into an 'Insert BIAE' block, which feeds into an 'Insert TTI' block. The 'Insert TTI' block feeds into the 'Insert IAE' block. The 'Insert IAE' block feeds into the 'SMOH insertion' block. The 'SMOH insertion' block also receives feedback from the 'Insert BDI', 'Insert BEI', 'Insert BIAE', and 'Insert TTI' blocks. The 'SMOH insertion' block outputs RI_BDI, RI_BEI, RI_BIAE, and MI_TxTI signals to the OTUkV_RP and OTUkV_TT_So_MP blocks. The diagram is labeled G.798(10)_F13-10.](9dc88fb2c48bc64047fc3e79814f1d47_img.jpg) - -Figure 13-10 – OTUkV\_TT\_So processes. This block diagram illustrates the signal processing flow for the OTUkV\_TT\_So function. At the top, input signals AI\_D, AI\_CK, AI\_FS, AI\_MFS, and AI\_IAE enter the OTUkV\_AP block. AI\_D, AI\_CK, AI\_FS, and AI\_MFS are processed through a 'Compute BIP8' block and then into a 'SMOH insertion' block. AI\_IAE is processed through an 'Insert IAE' block. The 'SMOH insertion' block outputs CI\_D, CI\_CK, CI\_FS, and CI\_MFS signals to the OTUkV\_TCP block. The 'Compute BIP8' block also feeds into an 'Insert BIP8' block. The 'Insert BIP8' block feeds into an 'Insert BDI' block, which in turn feeds into an 'Insert BEI' block. The 'Insert BEI' block feeds into an 'Insert BIAE' block, which feeds into an 'Insert TTI' block. The 'Insert TTI' block feeds into the 'Insert IAE' block. The 'Insert IAE' block feeds into the 'SMOH insertion' block. The 'SMOH insertion' block also receives feedback from the 'Insert BDI', 'Insert BEI', 'Insert BIAE', and 'Insert TTI' blocks. The 'SMOH insertion' block outputs RI\_BDI, RI\_BEI, RI\_BIAE, and MI\_TxTI signals to the OTUkV\_RP and OTUkV\_TT\_So\_MP blocks. The diagram is labeled G.798(10)\_F13-10. - -Figure 13-10 – OTUkV\_TT\_So processes - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -#### 13.2.2.2 OTUkV trail termination sink function (OTUkV\_TT\_Sk) - -The OTUkV\_TT\_Sk function reports the state of the OTUkV trail. It computes the signal quality supervision code, extracts section monitoring overhead (SMOH) – including the TTI, signal quality supervision, BDI and BEI signals – in the SM overhead field from the OTUkV signal at its OTUkV\_TCP, detects for TIM, DEG and BDI defects, counts during one-second periods errors (detected via the signal quality supervision) and defects to feed performance monitoring when connected, makes the TTI available to network management, and forwards the error and defect information as backward indications to the companion OTUkV\_TT\_So function. In case of frame synchronous mapping of the ODUk client signal, an IAE signal has to be extracted from the SM overhead. - -The information flow and processing of the OTUkV\_TT\_Sk function is defined with reference to Figures 13-11 and 13-12. - -##### Symbol - -![Symbol diagram for the OTUkV_TT_Sk function. It shows a central triangle labeled 'OTUkV'. An arrow points up from the top vertex to 'OTUkV_AP'. An arrow points down from 'OTUkV_TCP' to the bottom vertex, with 'k = 1, 2, 3, 4' written next to it. A double-headed arrow points left from the left vertex to 'OTUkV_TT_Sk_MP'. An arrow points right from the right vertex to 'OTUkV_RP'. Below the diagram is the text 'G.798(10)_F13-11'.](708e7ef81dbf726e558047afe57d6ff7_img.jpg) - -Symbol diagram for the OTUkV\_TT\_Sk function. It shows a central triangle labeled 'OTUkV'. An arrow points up from the top vertex to 'OTUkV\_AP'. An arrow points down from 'OTUkV\_TCP' to the bottom vertex, with 'k = 1, 2, 3, 4' written next to it. A double-headed arrow points left from the left vertex to 'OTUkV\_TT\_Sk\_MP'. An arrow points right from the right vertex to 'OTUkV\_RP'. Below the diagram is the text 'G.798(10)\_F13-11'. - -Figure 13-11 – OTUkV\_TT\_Sk function - -##### Interfaces - -Table 13-4 – OTUkV\_TT\_Sk inputs and outputs - -| Input(s) | Output(s) | -|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| OTUkV_TCP:
OTUkV_CI_CK
OTUkV_CI_D
OTUkV_CI_FS
OTUkV_CI_MFS (Note 1)
OTUkV_CI_SSF
OTUkV_TT_Sk_MP:
OTUkV_TT_Sk_MI_ExSAPI
OTUkV_TT_Sk_MI_ExDAPI
OTUkV_TT_Sk_MI_GetAcTI
OTUkV_TT_Sk_MI_TIMDetMo
OTUkV_TT_Sk_MI_TIMActDis
OTUkV_TT_Sk_MI_DEGThr
OTUkV_TT_Sk_MI_DEGM
OTUkV_TT_Sk_MI_1second | OTUkV_AP:
OTUkV_AI_CK
OTUkV_AI_D
OTUkV_AI_FS
OTUkV_AI_MFS (Note 1)
OTUkV_AI_TSF
OTUkV_AI_TSD
OTUkV_RP:
OTUkV_RI_BDI
OTUkV_RI_BEI
OTUkV_RI_BIAE (Note 2)
OTUkV_TT_Sk_MP:
OTUkV_TT_Sk_MI_AcTI
OTUkV_TT_Sk_MI_cTIM
OTUkV_TT_Sk_MI_cDEG
OTUkV_TT_Sk_MI_cBDI
OTUkV_TT_Sk_MI_cSSF
OTUkV_TT_Sk_MI_pN_EBC
OTUkV_TT_Sk_MI_pN_DS
OTUkV_TT_Sk_MI_pF_EBC
OTUkV_TT_Sk_MI_pF_DS
OTUkV_TT_Sk_MI_pBIAE (Note 2)
OTUkV_TT_Sk_MI_pIAE (Note 2) | -| NOTE 1 – If OTUkV has a multiframe. | | -| NOTE 2 – In case of frame synchronous mapping of ODUk client signal. | | - -##### Processes - -The processes associated with the OTUkV\_TT\_Sk function are as depicted in Figure 13-12. - -**SMOH-signal quality supervision:** The signal quality supervision code is extracted from the signal quality field of the SMOH. The signal supervision code is outside the scope of this Recommendation. - -**SMOH-TTI:** The trail trace identifier shall be recovered from TTI field of the SMOH as defined in clause 8.6. The accepted value of the TTI is available at the MP (MI\_AcTI). - -**SMOH-BDI:** The backward defect indication shall be recovered from BDI field of the SMOH. It shall be used for BDI defect detection. The BDI code is outside the scope of this Recommendation. - -**SMOH-BEI:** The BEI shall be recovered from the BEI field in the SMOH. It shall be used to determine if a far-end errored block (nF\_B) has occurred. The BEI code is outside the scope of this Recommendation. - -**SMOH-IAE:** If a frame synchronous mapping for the ODUk client layer is used, the incoming alignment error information shall be recovered from the IAE field of the SMOH. It shall be used for IAE defect detection. The IAE code is outside the scope of this Recommendation. - -The format of the OTUkV frame and overhead is outside the scope of this Recommendation. - -![Figure 13-12 – OTUkV_TT_Sk processes. This block diagram illustrates the internal processes of the OTUkV_TT_Sk function. At the top, the OTUkV_AP layer provides inputs: AI_TSD, AI_TSF, AI_MFS, AI_FS, AI_CK, and AI_D. Below this, the diagram is divided into several functional blocks. On the left, a vertical label 'OTUkV_TT_Sk_MP and OTUkV_RP' spans the middle section. The 'Consequent actions' block receives inputs from RI_BDI, RI_BIAE, and MI_TIMActDis, and outputs aTSD, aTSF, CI_SSF, dTIM, dDEG, and dIAE. The 'Process TTI' block receives MI_AcTI, MI_ExSAPI, MI_ExDAPI, MI_GetAcTI, and MI_TIMDetMo, and outputs RxTI to an 'Extract TTI' block. The 'Defect correlations' block receives MI_cTIM, MI_cDEG, MI_cBDI, and MI_cSSF, and outputs dTIM, dDEG, dBDI, and CI_SSF. The 'Performance monitoring' block receives MI_pIAE, MI_pN_BIAE, MI_pN_EBC, MI_pN_DS, MI_pF_EBC, MI_pF_DS, MI_lsecond, and nN_B, and outputs aTSF, dBIAE, dBBDI, and nF_B to 'Extract IAE', 'Extract BDI', and 'Extract BEI' blocks respectively. A 'Process errors' block receives dDEG and nBIPV, and outputs nN_B to a 'Compare' block. The 'Compare' block also receives inputs from 'Extract BIP8' and 'Compute BIP8' blocks. A vertical 'SMOH access' block on the right provides data to the 'Extract' blocks and receives data from the 'Compute BIP8' block. At the bottom, the OTUkV_TCP layer provides inputs: CI_SSF, CI_MFS, CI_FS, CI_CK, and CI_D. The diagram is labeled G.798(10)_F13-12 in the bottom right corner.](c1b762c358fd423d6686563b3fde7750_img.jpg) - -Figure 13-12 – OTUkV\_TT\_Sk processes. This block diagram illustrates the internal processes of the OTUkV\_TT\_Sk function. At the top, the OTUkV\_AP layer provides inputs: AI\_TSD, AI\_TSF, AI\_MFS, AI\_FS, AI\_CK, and AI\_D. Below this, the diagram is divided into several functional blocks. On the left, a vertical label 'OTUkV\_TT\_Sk\_MP and OTUkV\_RP' spans the middle section. The 'Consequent actions' block receives inputs from RI\_BDI, RI\_BIAE, and MI\_TIMActDis, and outputs aTSD, aTSF, CI\_SSF, dTIM, dDEG, and dIAE. The 'Process TTI' block receives MI\_AcTI, MI\_ExSAPI, MI\_ExDAPI, MI\_GetAcTI, and MI\_TIMDetMo, and outputs RxTI to an 'Extract TTI' block. The 'Defect correlations' block receives MI\_cTIM, MI\_cDEG, MI\_cBDI, and MI\_cSSF, and outputs dTIM, dDEG, dBDI, and CI\_SSF. The 'Performance monitoring' block receives MI\_pIAE, MI\_pN\_BIAE, MI\_pN\_EBC, MI\_pN\_DS, MI\_pF\_EBC, MI\_pF\_DS, MI\_lsecond, and nN\_B, and outputs aTSF, dBIAE, dBBDI, and nF\_B to 'Extract IAE', 'Extract BDI', and 'Extract BEI' blocks respectively. A 'Process errors' block receives dDEG and nBIPV, and outputs nN\_B to a 'Compare' block. The 'Compare' block also receives inputs from 'Extract BIP8' and 'Compute BIP8' blocks. A vertical 'SMOH access' block on the right provides data to the 'Extract' blocks and receives data from the 'Compute BIP8' block. At the bottom, the OTUkV\_TCP layer provides inputs: CI\_SSF, CI\_MFS, CI\_FS, CI\_CK, and CI\_D. The diagram is labeled G.798(10)\_F13-12 in the bottom right corner. - -**Figure 13-12 – OTUkV\_TT\_Sk processes** - -##### Defects - -The function shall detect dTIM, dDEG, dBBDI and, if a frame synchronous mapping for the ODUk client layer is used, it shall detect dIAE defects. - -**dTIM:** See clause 6.2.2.1; dTIM shall be set to false during CI\_SSF. - -**dDEG:** See clause 6.2.3.4. - -NOTE 1 – IAE (if supported) suppresses the one-second near-end errored block count, which is the input for the dDEG detection. This avoids wrong dDEG declaration due to alignment errors already incoming in an OTUkV trail. - -**dBDI:** The dBDI detection depends on the specific frame structure and is outside the scope of this Recommendation; dBDI shall be set to false during CI\_SSF. - -**dIAE:** The dIAE detection depends on the specific frame structure and is outside the scope of this Recommendation; dIAE shall be set to false during CI\_SSF and dTIM. - -**dBIAE:** The dBIAE detection depends on the specific frame structure and is outside the scope of this Recommendation; dTIM shall be set to false during CI\_SSF and dTIM. - -NOTE 2 – IAE and BIAE are only required in case of frame synchronous mapping of the ODUk into the OTUkV. - -##### Consequent actions - -The function shall perform the following consequent actions: - -aBDI $\leftarrow$ CI\_SSF or dTIM - -aBEI $\leftarrow$ nBIPV - -aBIAE $\leftarrow$ dIAE - -aTSF $\leftarrow$ CI\_SSF or (dTIM and (not TIMActDis)) - -aTSD $\leftarrow$ dDEG - -##### Defect correlations - -The function shall perform the following defect correlations to determine the most probable fault cause. This fault cause shall be reported to the EMF. - -cTIM $\leftarrow$ dTIM and (not CI\_SSF) - -cDEG $\leftarrow$ dDEG and (not CI\_SSF) and (not (dTIM and (not TIMActDis))) - -cBDI $\leftarrow$ dBDI and (not CI\_SSF) and (not (dTIM and (not TIMActDis))) - -cSSF $\leftarrow$ CI\_SSF - -##### Performance monitoring - -The function shall perform the following performance monitoring primitives processing. The performance monitoring primitives shall be reported to the EMF. - -pN\_DS $\leftarrow$ CI\_SSF or dTI - -pF\_DS $\leftarrow$ dBDI - -pN\_EBC $\leftarrow \sum nN\_B$ - -NOTE 3 – During CI\_SSF, no errored blocks shall be counted. - -pF\_EBC $\leftarrow \sum nF\_B$ - -NOTE 4 – During CI\_SSF, no errored blocks shall be counted. - -pBIAE $\leftarrow$ dBIAE - -NOTE 5 – pBIAE is activated at the end of a second if dBIAE was active once during the second. - -pIAE $\leftarrow$ dIAE - -NOTE 6 – pIAE is activated at the end of a second if dIAE was active once during the second. - -NOTE 7 – pBIAE and pIAE are only defined in case of frame synchronous mapping of the ODUk into the OTUkV. - -NOTE 8 – pIAE and pBIAE are used for the suppression of the PM data in the equipment management functions (see [ITU-T G.874]). If pBIAE is active, the F\_DS and F\_EBC values of the previous and current second have to be discarded (EBC = 0 and DS = false). If pIAE is active, the N/F\_DS and N/F\_EBC values of the previous and current second have to be discarded (EBC = 0 and DS = false). The previous second has to be included due to the delay of the IAE information coming from the remote source. - -## 13.3 Adaptation functions - -### 13.3.1 OTU to ODU adaptation function (OTU/ODU\_A) - -The OTU to ODU adaptation functions perform the adaptation between the OTU layer adapted information and the characteristic information of an ODU layer signal. - -#### 13.3.1.1 OTU to ODU adaptation source function (OTU/ODU\_A\_So) - -The OTU/ODU\_A\_So function creates the OTU signal and maps the ODU signal frame synchronous into this OTU signal as defined in [ITU-T G.709]. Additionally, the OTUk/ODUk\_A\_So function provides access to the ODUk SM APS overhead if it is OPERATIONAL. - -The information flow and processing of the OTU/ODU\_A\_So functions is defined with reference to Figures 13-13 and 13-14. - -##### Symbol - -![Diagram showing the OTU/ODU_A_So function symbol. It consists of two identical trapezoidal blocks. The left block is labeled 'OTUk/ODUk' and has an input 'ODUk_CP' from the top and 'OTUk/ODUk_A_So_MP' from the left. Its output is 'OTUk_AP' at the bottom, with a label 'k = 0, 1, 2, 3, 4, 25u, 25, 50u, 50' next to it. The right block is labeled 'OTUCn/ODUCn' and has an input 'ODUCn_CP' from the top and 'OTUCn/ODUCn_A_So_MP' from the left. Its output is 'OTUCn_AP' at the bottom. Below the right block is the text 'G.798(17)-Amd.4(22)_F13-13'.](a265aba1737da6f0200faac85366b163_img.jpg) - -Diagram showing the OTU/ODU\_A\_So function symbol. It consists of two identical trapezoidal blocks. The left block is labeled 'OTUk/ODUk' and has an input 'ODUk\_CP' from the top and 'OTUk/ODUk\_A\_So\_MP' from the left. Its output is 'OTUk\_AP' at the bottom, with a label 'k = 0, 1, 2, 3, 4, 25u, 25, 50u, 50' next to it. The right block is labeled 'OTUCn/ODUCn' and has an input 'ODUCn\_CP' from the top and 'OTUCn/ODUCn\_A\_So\_MP' from the left. Its output is 'OTUCn\_AP' at the bottom. Below the right block is the text 'G.798(17)-Amd.4(22)\_F13-13'. - -Figure 13-13 – OTU/ODU\_A\_So function - -##### Interfaces - -Table 13-5 – OTU/ODU\_A\_So inputs and outputs - -| Input(s) | Output(s) | -|--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|----------------------------------------------------------------------------------| -| ODU_CP:
ODU_CI_CK
ODU_CI_D
ODU_CI_FS
ODU_CI_MFS
ODU_CI_APS
OTU/ODU_A_So_MP:
OTU/ODU_A_So_MI_AdminState
OTU/ODU_A_So_MI_Mode
OTU/ODU_A_So_MI_APS_EN (Note)
OTU/ODU_A_So_MI_APS_LVL (Note) | OTU_AP:
OTU_AI_CK
OTU_AI_D
OTU_AI_FS
OTU_AI_MFS
OTU_AI_IAE | -| NOTE – For OTUk/ODUk_A_So only. | | - -##### Processes - -The processes associated with the OTU/ODU\_A\_So function are as depicted in Figure 13-14. - -**ODU-LCK:** The function shall generate the ODU-LCK signal as defined in clause 16.5 of [ITU-T G.709]. The clock, frame start and multiframe start are defined by the incoming ODUk signal. - -**Mode:** If the MI\_Mode has the value OPERATIONAL, the following processes shall be performed. If the MI\_Mode has the value TRANSPARENT, all information shall be passed through transparently and the following processes shall not be performed. - -**Selector:** If MI\_Mode is OPERATIONAL, the normal signal may be replaced by the ODU-LCK signal. ODU-LCK signal is selected if the MI\_AdminState is LOCKED. - -**ODUk server layer APS:** If MI\_Mode is OPERATIONAL and APS is enabled (MI\_APS\_EN is true), the OTUk/ODUk\_A\_So function shall insert the CI\_APS value into the ODUk APS/PCC[MI\_APS\_LVL] field, which is available once per eight ODUk frames when MFAS bits 6, 7, 8 is equal to MI\_APS\_LVL. - -NOTE 1 – The ODUk SM APS information may be present in the case where the ODUk signal contains an ODU-AIS, ODU-LCK or ODU-OCI maintenance signal. The ODU-LCK maintenance signal may be inserted in this adaptation source function. ODUk SNC/I protection is unable to detect the insertion of such ODU-LCK and will not perform a protection switch. - -**OTU clock generation:** For k = 0, 1, 2, 3, 4, the function shall generate the OTUk clock (AI\_CK) by multiplying the incoming ODUk clock (CI\_CK) by 255/239 to the OTUk frequency as listed in Table 7-1 of [ITU-T G.709]. For k = 25, 25u, 50, 50u, the OTUk clock (AI\_CK) shall be the ODUk clock (CI\_CK). The OTUCn clock (AI\_CK) shall be the ODUCn clock (CI\_CK). - -For the case that an ODU signal is not terminated in the network element (e.g., it is through connected from an OTU input to an OTU output), the clock parameters and jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCr clock), apply. Otherwise, the clock requirements are defined in the ODUP/client adaptation functions. - -NOTE 2 – The OTU/ODU\_A\_Sk and So clocks are concentrated in a single ODCr clock in [ITU-T G.8251]. - -The function shall generate the OTU frame start reference signals (AI\_FS), which is derived from the incoming ODU frame start (CI\_FS). - -The function shall generate the OTU multiframe start reference signals (AI\_MFS), which is derived from the incoming ODU multiframe start (CI\_MFS). - -**Incoming alignment error (IAE):** If the incoming ODU frame start (CI\_FS) position is not at the expected frame start position, the incoming alignment error IAE shall be activated. IAE shall be deactivated if the incoming ODU frame start (CI\_FS) position is at the expected frame start position. The expected frame start position is based on the previous incoming ODU frame start. - -**Mapping:** The function shall map the incoming ODU frame (CI\_D) into the OTU frame (AI\_D) as defined in clause 11.1 of [ITU-T G.709]. - -![Figure 13-14: OTU/ODU_A_So processes block diagram. The diagram shows the internal structure of the OTU/ODU_A_So function. On the left, the vertical label 'OTU/ODU_A_So_MP' is present. Inputs include 'MI_AdminState', 'MI_Mode', 'MI_APS_EN', and 'MI_APS_LVL'. These connect to an 'APS' block (labeled 'OTUk/ODUk only') and a 'Select normal/LCK' block. The 'Select normal/LCK' block also receives 'D_normal' and 'D_LCK' from a 'Generator ODU-LCK' block. The 'APS' block connects to a 'Mapping' block. The 'Mapping' block outputs 'AI_D'. The 'Generator ODU-LCK' block also connects to 'OTU clock, FS and MFS generation' and 'IAE detection' blocks. These two blocks output 'AI_CK', 'AI_MFS', 'AI_FS', and 'AI_IAE' respectively. The vertical label 'OTU_AP' is at the bottom. The horizontal labels 'CI_APS', 'CI_D', 'ODU_CP', 'CI_CK', 'CI_MFS', and 'CI_FS' are at the top. A reference 'G.798(17)-Amd.1(18)_F13-14' is at the bottom right.](fda85db2e355bb8e3edcd5a74bf3d673_img.jpg) - -Figure 13-14: OTU/ODU\_A\_So processes block diagram. The diagram shows the internal structure of the OTU/ODU\_A\_So function. On the left, the vertical label 'OTU/ODU\_A\_So\_MP' is present. Inputs include 'MI\_AdminState', 'MI\_Mode', 'MI\_APS\_EN', and 'MI\_APS\_LVL'. These connect to an 'APS' block (labeled 'OTUk/ODUk only') and a 'Select normal/LCK' block. The 'Select normal/LCK' block also receives 'D\_normal' and 'D\_LCK' from a 'Generator ODU-LCK' block. The 'APS' block connects to a 'Mapping' block. The 'Mapping' block outputs 'AI\_D'. The 'Generator ODU-LCK' block also connects to 'OTU clock, FS and MFS generation' and 'IAE detection' blocks. These two blocks output 'AI\_CK', 'AI\_MFS', 'AI\_FS', and 'AI\_IAE' respectively. The vertical label 'OTU\_AP' is at the bottom. The horizontal labels 'CI\_APS', 'CI\_D', 'ODU\_CP', 'CI\_CK', 'CI\_MFS', and 'CI\_FS' are at the top. A reference 'G.798(17)-Amd.1(18)\_F13-14' is at the bottom right. - -Figure 13-14 – OTU/ODU\_A\_So processes - -**Defects:** None. - -##### **Consequent actions** - -The function shall perform the following consequent actions: - -aIAE ← IAE - -**Defect Correlations:** None. - -**Performance monitoring:** None. - -#### **13.3.1.2 OTU to ODU adaptation sink function (OTU/ODU\_A\_Sk)** - -The OTU/ODU\_A\_Sk extracts the ODU signal from the OTU. It may insert ODU-AIS under signal fail conditions. Additionally, the OTUk/ODUk\_A\_Sk function provides access to the ODUk SM APS overhead if it is OPERATIONAL. - -The information flow and processing of the OTU/ODU\_A\_Sk functions is defined with reference to Figures 13-15 and 13-16. - -##### **Symbol** - -![Figure 13-15: OTUk/ODUk_A_Sk function symbol diagram. It shows two trapezoidal symbols representing the function. The left symbol is labeled 'OTUk/ODUk' and has an input 'OTUk/ODUk_A_Sk_MP' on the left, an input 'OTUk_AP' at the bottom (with parameter 'k = 1, 2, 3, 4, 25u, 25, 50u, 50'), and an output 'ODUk_CP' at the top. The right symbol is labeled 'OTUCn/ODUCn' and has an input 'OTUCn/ODUCn_A_Sk_MP' on the left, an input 'OTUCn_AP' at the bottom, and an output 'ODUCn_CP' at the top. A reference 'G.798(17)-Amd.4(22)_F13-15' is at the bottom right.](7d78469417c76901ecf6e36600a721cb_img.jpg) - -Figure 13-15: OTUk/ODUk\_A\_Sk function symbol diagram. It shows two trapezoidal symbols representing the function. The left symbol is labeled 'OTUk/ODUk' and has an input 'OTUk/ODUk\_A\_Sk\_MP' on the left, an input 'OTUk\_AP' at the bottom (with parameter 'k = 1, 2, 3, 4, 25u, 25, 50u, 50'), and an output 'ODUk\_CP' at the top. The right symbol is labeled 'OTUCn/ODUCn' and has an input 'OTUCn/ODUCn\_A\_Sk\_MP' on the left, an input 'OTUCn\_AP' at the bottom, and an output 'ODUCn\_CP' at the top. A reference 'G.798(17)-Amd.4(22)\_F13-15' is at the bottom right. - -Figure 13-15 – OTUk/ODUk\_A\_Sk function - -##### Interfaces - -**Table 13-6 – OTU/ODU\_A\_Sk inputs and outputs** - -| Input(s) | Output(s) | -|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|--------------------------------------------------------------------------------------------------------------| -| OTU_AP:
OTU_AI_CK
OTU_AI_D
OTU_AI_FS
OTU_AI_MFS
OTU_AI_TSF
OTU_AI_TSD
OTU/ODUk_A_Sk_MP:
OTU/ODU_A_Sk_MI_AdminState
OTU/ODU_A_Sk_MI_Mode
OTU/ODU_A_Sk_MI_APS_EN (Note)
OTU/ODU_A_Sk_MI_APS_LVL (Note) | ODU_CP:
ODU_CI_CK
ODU_CI_D
ODU_CI_FS
ODU_CI_MFS
ODU_CI_SSF
ODU_CI_SSD
ODU_CI_APS | -| NOTE – For OTUk/ODUk_A_So only. | | - -##### Processes - -The processes associated with the OTUk/ODUk\_A\_Sk function are as depicted in Figure 13-16. - -**ODU clock, FS and MFS signal generation:** For k= 0 ,1, 2, 3, 4, the function shall generate the ODUk clock (CI\_CK) by dividing the incoming OTUk clock (AI\_CK) down by a factor of 239/255 to the particular ODUk clock as listed in Table 7-2 of [ITU-T G.709]. For k = 25, 25u ,50, 50u, the ODUk clock (AI\_CK) shall be the OTUk clock (CI\_CK). The ODUk clock (AI\_CK) shall be the OTUk clock (CI\_CK). - -For the case that an ODU signal is not terminated in the network element (e.g., it is through connected from an OTU input to an OTU output), the clock parameters and jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCr clock), apply. Otherwise, the clock requirements are defined in the ODUP/client adaptation functions. - -NOTE 1 – The OTU/ODU\_A\_Sk and So clocks are concentrated in a single ODCr clock in [ITU-T G.8251]. - -The function shall generate the ODU frame start reference signals (CI\_FS), which is derived from the incoming OTU frame start (AI\_FS). - -The function shall generate the ODU multiframe start reference signals (CI\_MFS), which is derived from the incoming OTU multiframe start (AI\_MFS). - -**Extract ODU from OTU:** The function shall extract the ODU frame (CI\_D) from the incoming OTU frame (AI\_D) as defined in clause 11.1 and 11.3 of [ITU-T G.709]. - -**ODUk server layer APS:** When APS is enabled (MI\_APS\_EN is true), the OTUk/ODUk\_A\_Sk function shall extract the information from the ODUk APS/PCC[MI\_APS\_LVL] field, which is available once per eight ODUk frames when the value of the MFAS bits 6, 7, 8 is equal to MI\_APS\_LVL, and apply the extracted information to the CI\_APS. - -NOTE 2 – The ODUk SM APS information may be present in the case where the ODUk signal contains an ODU-AIS, ODU-LCK or ODU-OCI maintenance signal. The ODU-LCK maintenance signal may have been inserted in the far-end adaptation source function. ODUk SNC/I protection is unable to detect the insertion of such ODU-LCK and will not perform a protection switch. - -**ODU-LCK, ODU-AIS:** The function shall generate the ODU-LCK and ODU-AIS signals as defined in [ITU-T G.709]. The clock, frame start and multiframe start shall be independent from the incoming clock. The clock has to be within the frequency range as given in Table 7-2 of - -[ITU-T G.709]. Jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCa clock), apply. - -**Mode:** If the MI\_Mode has the value OPERATIONAL, the following processes shall be performed. If the MI\_Mode has the value TRANSPARENT, all information shall be passed through transparently and the following processes shall not be performed. - -**Selector:** If MI\_Mode is OPERATIONAL, the normal signal may be replaced by either the ODU-AIS or the ODU-LCK signal. ODU-LCK signal is selected if the MI\_AdminState is LOCKED. ODU-AIS is selected if MI\_AdminState is not LOCKED and aAIS is true. If MI\_Mode has the value TRANSPARENT, the normal signal is always selected. - -![Figure 13-16 – OTU/ODU_A_Sk processes. This block diagram illustrates the internal logic for OTU/ODU_A_Sk. On the left, the 'OTU/ODU_A_Sk_MP' block receives inputs: MI_AdminState, MI_Mode, MI_APS_EN, and MI_APS_LVL. It connects to a 'Consequent actions' block which outputs aTSD, aTSF, and aAIS. The 'Consequent actions' block also receives AI_TSD and AI_TSF. The 'Consequent actions' block connects to a 'Select normal/AIS/LCK' block. This block has three outputs: AIS, LCK, and Normal. The 'AIS' and 'LCK' outputs are connected to 'Generate ODU-AIS' and 'Generate ODU-LCK' blocks respectively. The 'Normal' output is connected to an 'ODU data demapping, clock (ODCr), FS and MFS generation' block. The 'APS' block (containing OTUK/ODUk only) receives CI_APS and connects to the 'Select normal/AIS/LCK' block. The 'APS' block also receives inputs from the 'Consequent actions' block. The 'ODU data demapping, clock (ODCr), FS and MFS generation' block outputs D, CK, FS, and MFS. These are connected to the 'OTU_AP' block which outputs AI_D, AI_CK, AI_FS, and AI_MFS. The 'OTU_AP' block also receives inputs from the 'Consequent actions' block. The 'OTU/ODU_A_Sk_MP' block also outputs CI_TSD, CI_TSF, CI_APS, CI_D, CI_CK, CI_FS, and CI_MFS.](24ee23a8f3995ecfd3aae31a37a1d40c_img.jpg) - -Figure 13-16 – OTU/ODU\_A\_Sk processes. This block diagram illustrates the internal logic for OTU/ODU\_A\_Sk. On the left, the 'OTU/ODU\_A\_Sk\_MP' block receives inputs: MI\_AdminState, MI\_Mode, MI\_APS\_EN, and MI\_APS\_LVL. It connects to a 'Consequent actions' block which outputs aTSD, aTSF, and aAIS. The 'Consequent actions' block also receives AI\_TSD and AI\_TSF. The 'Consequent actions' block connects to a 'Select normal/AIS/LCK' block. This block has three outputs: AIS, LCK, and Normal. The 'AIS' and 'LCK' outputs are connected to 'Generate ODU-AIS' and 'Generate ODU-LCK' blocks respectively. The 'Normal' output is connected to an 'ODU data demapping, clock (ODCr), FS and MFS generation' block. The 'APS' block (containing OTUK/ODUk only) receives CI\_APS and connects to the 'Select normal/AIS/LCK' block. The 'APS' block also receives inputs from the 'Consequent actions' block. The 'ODU data demapping, clock (ODCr), FS and MFS generation' block outputs D, CK, FS, and MFS. These are connected to the 'OTU\_AP' block which outputs AI\_D, AI\_CK, AI\_FS, and AI\_MFS. The 'OTU\_AP' block also receives inputs from the 'Consequent actions' block. The 'OTU/ODU\_A\_Sk\_MP' block also outputs CI\_TSD, CI\_TSF, CI\_APS, CI\_D, CI\_CK, CI\_FS, and CI\_MFS. - -G.798(17)-Amd.1(18)\_F13-16 - -Figure 13-16 – OTU/ODU\_A\_Sk processes - -**Defects:** None. - -##### Consequent actions - -The function shall perform the following consequent actions: - -aSSF $\leftarrow$ AI\_TSF and (not MI\_AdminState = LOCKED) - -aAIS $\leftarrow$ AI\_TSF and (not MI\_AdminState = LOCKED) - -aSSD $\leftarrow$ AI\_TSD and (not MI\_AdminState = LOCKED) - -On declaration of aAIS, the function shall output an all-ONEs pattern/signal within two frames. On clearing aAIS, the all-ONEs pattern/signal shall be removed within two frames, with normal data being output. The AIS clock, frame start and multiframe start shall be independent from the incoming clock, frame start and multiframe start. The AIS clock has to be the frequency range as given in Table 7-2 of [ITU-T G.709]. Jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCa clock) apply. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -### 13.3.2 OTUkV to ODUk adaptation function (OTUkV/ODUk\_A) - -The OTUkV to ODUk adaptation functions perform the adaptation between the OTUkV layer adapted information and the characteristic information of an ODUk layer signal. - -#### 13.3.2.1 OTUkV to ODUk adaptation source function (OTUkV/ODUk\_A\_So) - -The OTUkV/ODUk\_A\_So function creates the OTUkV signal and maps the ODUk signal into this OTUkV. It provides access to the ODUk SM APS overhead. - -The information flow and processing of the OTUkV/ODUk\_A\_So functions is defined with reference to Figures 13-17 and 13-18. - -##### Symbol - -![Diagram of the OTUkV/ODUk_A_So function symbol. It shows a central block labeled 'OTUkV/ODUk'. An input 'ODUk_CP' enters from the top. An input 'OTUkV/ODUk_A_So_MP' enters from the left. An output 'OTUkV_AP' exits from the bottom, with a label 'k = 1, 2, 3, 4' next to it. The diagram is labeled 'G.798(10)_F13-17'.](85680f3dcbe15424dd54fa3fd9e1c90d_img.jpg) - -Diagram of the OTUkV/ODUk\_A\_So function symbol. It shows a central block labeled 'OTUkV/ODUk'. An input 'ODUk\_CP' enters from the top. An input 'OTUkV/ODUk\_A\_So\_MP' enters from the left. An output 'OTUkV\_AP' exits from the bottom, with a label 'k = 1, 2, 3, 4' next to it. The diagram is labeled 'G.798(10)\_F13-17'. - -Figure 13-17 – OTUkV/ODUk\_A\_So function - -##### Interfaces - -Table 13-7 – OTUkV/ODUk\_A\_So inputs and outputs - -| Input(s) | Output(s) | -|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|----------------------------------------------------------------------------------------------------------------| -| ODUk_CP:
ODUk_CI_CK
ODUk_CI_D
ODUk_CI_FS
ODUk_CI_MFS
ODUk_CI_APS
OTUkV/ODUk_A_So_MP:
OTUkV/ODUk_A_So_MI_AdminState
OTUkV/ODUk_A_So_MI_APS_EN
OTUkV/ODUk_A_So_MI_APS_LVL | OTUkV_AP:
OTUkV_AI_CK
OTUkV_AI_D
OTUkV_AI_FS
OTUkV_AI_MFS (Note 1)
OTUkV_AI_IAE (Note 2) | -| NOTE 1 – If the OTUkV has a multiframe. | | -| NOTE 2 – In case of frame synchronous mapping of ODUk client signal. | | - -##### Processes - -The processes associated with the OTUkV/ODUk\_A\_So function are as depicted in Figure 13-18. - -**ODU-LCK:** The function shall generate the ODU-LCK signal as defined in clause 16.5 of [ITU-T G.709]. The clock, frame start and multiframe start are defined by the incoming ODUk signal. - -**Selector:** The normal signal may be replaced by the ODU-LCK signal. ODU-LCK signal is selected if the MI\_AdminState is LOCKED. - -**ODUk server layer APS:** When APS is enabled (MI\_APS\_EN is true), the function shall insert the CI\_APS value into the ODUk APS/PCC[MI\_APS\_LVL] field, which is available once per eight ODUk frames when MFAS bits 6, 7, 8 is equal to MI\_APS\_LVL. - -NOTE 1 – The ODUk SM APS information may be present in the case where the ODUk signal contains an ODU-AIS, ODU-LCK or ODU-OCI maintenance signal. The ODU-LCK maintenance signal may be inserted - -in this adaptation source function. ODuk SNC/I protection is unable to detect the insertion of such ODU-LCK and will not perform a protection switch. - -**OTUkV signal generation:** The function shall generate the OTUkV clock and frame start. The specific generation processes are outside the scope of this Recommendation. - -**Incoming alignment error:** In case of frame synchronous mapping of the ODuk in the OTUkV, IAE has to be generated. If the incoming ODuk frame start (CI\_FS) position is not at the expected frame start position, incoming alignment error (IAE) shall be activated. IAE shall be deactivated if the incoming ODuk frame start (CI\_FS) position is at the expected frame start position. The expected frame start position is based on the previous incoming ODuk frame start. - -**Mapping:** The function shall map the incoming ODuk frame (CI\_D) into the OTUkV frame (AI\_D). The specific mapping process is outside the scope of this Recommendation. - -![Figure 13-18 – OTUkV/ODUk_A_So processes. This block diagram illustrates the internal components and signal flow of the OTUkV/ODUk_A_So adaptation source function. Inputs include CI_D (client data), CI_FS (client frame start), CI_MFS (client multi-frame start), and control signals MI_APS_EN, MI_APS_LVL, and MI_AdminState. The diagram shows an ODUk-LCK generator receiving CI_D and CI_FS to produce D_normal and D_LCK signals. These are processed by a 'Select normal/LCK' block. CI_D is also processed by an APS block and a Mapping block. CI_FS and CI_MFS are used by an 'OTUk Vclock, FS and MFS generation' block to produce AI_CK, AI_FS, and AI_MFS. An IAE (Incoming Alignment Error) block is shown with a dashed border, receiving CI_FS and CI_MFS to produce a_IAE. The final outputs are AI_D (adapted data), AI_CK, AI_FS, AI_MFS, and AI_IAE, collectively labeled as OTUkV_AP. A reference label G.798(12)_F13-18 is present in the bottom right.](a890c88f5a03b77a0de8feaac5313821_img.jpg) - -Figure 13-18 – OTUkV/ODUk\_A\_So processes. This block diagram illustrates the internal components and signal flow of the OTUkV/ODUk\_A\_So adaptation source function. Inputs include CI\_D (client data), CI\_FS (client frame start), CI\_MFS (client multi-frame start), and control signals MI\_APS\_EN, MI\_APS\_LVL, and MI\_AdminState. The diagram shows an ODUk-LCK generator receiving CI\_D and CI\_FS to produce D\_normal and D\_LCK signals. These are processed by a 'Select normal/LCK' block. CI\_D is also processed by an APS block and a Mapping block. CI\_FS and CI\_MFS are used by an 'OTUk Vclock, FS and MFS generation' block to produce AI\_CK, AI\_FS, and AI\_MFS. An IAE (Incoming Alignment Error) block is shown with a dashed border, receiving CI\_FS and CI\_MFS to produce a\_IAE. The final outputs are AI\_D (adapted data), AI\_CK, AI\_FS, AI\_MFS, and AI\_IAE, collectively labeled as OTUkV\_AP. A reference label G.798(12)\_F13-18 is present in the bottom right. - -**Figure 13-18 – OTUkV/ODUk\_A\_So processes** - -**Defects:** None. - -##### **Consequent actions** - -The function shall perform the following consequent actions: - -$$aIAE \leftarrow IAE$$ - -NOTE 2 – aIAE is only required in case of frame synchronous mapping of the ODuk client signal. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -#### **13.3.2.2 OTUkV to ODuk adaptation sink function (OTUkV/ODUk\_A\_Sk)** - -The OTUkV/ODUk\_A\_Sk extracts the ODuk signal from the OTUkV. It may insert ODU-AIS under signal fail conditions. It provides access to the ODuk SM APS overhead. - -The information flow and processing of the OTUkV/ODUk\_A\_Sk functions is defined with reference to Figures 13-19 and 13-20. - -##### Symbol - -![Figure 13-19 – OTUkV/ODUk_A_Sk function symbol diagram. A central block labeled 'OTUkV/ODUk' has an input 'OTUkV_AP' from the bottom, with 'k = 1, 2, 3, 4' indicated. It has an output 'ODUk_CP' from the top. A dashed arrow labeled 'OTUkV/ODUk_A_Sk_MP' points to the block from the left. The diagram is labeled 'G.798(10)_F13-19'.](be9225da20b1fa284d0ed4b44fd633a3_img.jpg) - -Figure 13-19 – OTUkV/ODUk\_A\_Sk function symbol diagram. A central block labeled 'OTUkV/ODUk' has an input 'OTUkV\_AP' from the bottom, with 'k = 1, 2, 3, 4' indicated. It has an output 'ODUk\_CP' from the top. A dashed arrow labeled 'OTUkV/ODUk\_A\_Sk\_MP' points to the block from the left. The diagram is labeled 'G.798(10)\_F13-19'. - -Figure 13-19 – OTUkV/ODUk\_A\_Sk function - -##### Interfaces - -Table 13-8 – OTUkV/ODUk\_A\_Sk inputs and outputs - -| Input(s) | Output(s) | -|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| OTUkV_AP:
OTUkV_AI_CK
OTUkV_AI_D
OTUkV_AI_FS
OTUkV_AI_MFS (Note 1)
OTUkV_AI_TSF
OTUkV_AI_TSD
OTUkV/ODUk_A_Sk_MP:
OTUkV/ODUk_A_Sk_MI_AdminState
OTUkV/ODUk_A_Sk_MI_APS_EN
OTUkV/ODUk_A_Sk_MI_APS_LVL | ODUk_CP:
ODUk_CI_CK
ODUk_CI_D
ODUk_CI_FS
ODUk_CI_MFS
ODUk_CI_SSF
ODUk_CI_SSD
ODUk_CI_APS
OTUkV/ODUk_A_Sk_MP:
OTUkV/ODUk_A_Sk_MI_cLOA
(Note 2) | -| NOTE 1 – If the OTUkV has a multiframe. | | -| NOTE 2 – If loss of alignment supervision is performed. | | - -##### Processes - -The processes associated with the OTUkV/ODUk\_A\_Sk function are as depicted in Figure 13-20. - -**Demapping:** The function shall extract the ODUk signal, including clock, frame start, multiframe start and data from the OTUkV. The specific demapping processes are outside the scope of this Recommendation. - -**ODUk server layer APS:** When APS is enabled (MI\_APS\_EN is true), the function shall extract the information from the ODUk APS/PCC[MI\_APS\_LVL] field, which is available once per eight ODUk frames when the value of the MFAS bits 6, 7, 8 is equal to MI\_APS\_LVL, and apply the extracted information to the CI\_APS. - -NOTE – The ODUk SM APS information may be present in the case where the ODUk signal contains an ODU-AIS, ODU-LCK or ODU-OCI maintenance signal. The ODU-LCK maintenance signal may have been inserted in the far-end adaptation source function. ODUk SNC/I protection is unable to detect the insertion of such ODU-LCK and will not perform a protection switch. - -**ODU-LCK, ODU-AIS:** The function shall generate the ODU-LCK and ODU-AIS signals as defined in [ITU-T G.709]. The clock, frame start and multiframe start shall be independent from the incoming clock. The clock has to be within the frequency range as given in Table 7-2 of [ITU-T G.709]. Jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCa clock), apply. - -**Selector:** The normal signal may be replaced by either the ODU-AIS or the ODU-LCK signal. ODU-LCK signal is selected if the MI\_AdminState is LOCKED. ODU-AIS is selected if MI\_AdminState is not LOCKED and aAIS is true. - -![Figure 13-20 – OTUkV/ODUk_A_Sk processes. This block diagram illustrates the internal logic of the OTUkV/ODUk_A_Sk function. At the top, the ODUk_CP section includes inputs CI_SSD, CI_SSF, CI_APS, CI_MFS, CI_FS, CI_CK, and CI_D. CI_SSD and CI_SSF lead to 'Consequent actions', which outputs aSSD, aSSF, and aAIS. MI_AdminState and aAIS feed into 'Select normal/AIS/LCK', which outputs LCK, AIS, and Normal signals. 'Generate ODUk-LCK' and 'Generate ODUk-AIS' blocks also feed into the selection logic. MI_APS_EN and MI_APS_LVL feed into an APS block. MI_LOA feeds into 'Defect correlations' and 'Alignment detection' blocks. The bottom section, OTUkV_AP, includes inputs AI_TSD, AI_TSF, AI_MFS, AI_FS, AI_CK, and AI_D. AI_TSD and AI_TSF feed into 'Defect correlations' and 'Alignment detection'. 'ODUk data demapping, clock (ODCr), FS and MFS generation' block receives MFS, FS, CK, and D inputs and feeds into the APS block. The APS block outputs CI_APS. The diagram is labeled G.798(12)_F13-20.](52fe5bc3ba967e0e8f56f1a3ab9d9c3e_img.jpg) - -Figure 13-20 – OTUkV/ODUk\_A\_Sk processes. This block diagram illustrates the internal logic of the OTUkV/ODUk\_A\_Sk function. At the top, the ODUk\_CP section includes inputs CI\_SSD, CI\_SSF, CI\_APS, CI\_MFS, CI\_FS, CI\_CK, and CI\_D. CI\_SSD and CI\_SSF lead to 'Consequent actions', which outputs aSSD, aSSF, and aAIS. MI\_AdminState and aAIS feed into 'Select normal/AIS/LCK', which outputs LCK, AIS, and Normal signals. 'Generate ODUk-LCK' and 'Generate ODUk-AIS' blocks also feed into the selection logic. MI\_APS\_EN and MI\_APS\_LVL feed into an APS block. MI\_LOA feeds into 'Defect correlations' and 'Alignment detection' blocks. The bottom section, OTUkV\_AP, includes inputs AI\_TSD, AI\_TSF, AI\_MFS, AI\_FS, AI\_CK, and AI\_D. AI\_TSD and AI\_TSF feed into 'Defect correlations' and 'Alignment detection'. 'ODUk data demapping, clock (ODCr), FS and MFS generation' block receives MFS, FS, CK, and D inputs and feeds into the APS block. The APS block outputs CI\_APS. The diagram is labeled G.798(12)\_F13-20. - -**Figure 13-20 – OTUkV/ODUk\_A\_Sk processes** - -##### Defects - -Depending on the ODUk mapping defect, detection might be necessary (e.g., loss of alignment). - -##### Consequent actions - -The function shall perform the following consequent actions: - -aSSF $\leftarrow$ AI\_TSF and (not MI\_AdminState = LOCKED) - -aAIS $\leftarrow$ AI\_TSF and (not MI\_AdminState = LOCKED) - -aSSD $\leftarrow$ AI\_TSD and (not MI\_AdminState = LOCKED) - -Depending on the ODUk mapping, additional defects might contribute to aSSF and aAIS (e.g., loss of alignment). - -On declaration of aAIS, the function shall output an all-ONEs pattern/signal within two frames. On clearing aAIS, the all-ONEs pattern/signal shall be removed within two frames, with normal data being output. The AIS clock, frame start and multiframe start shall be independent from the incoming clock, frame start and multiframe start. The AIS clock has to be within the frequency range as given in Table 7-2 of [ITU-T G.709]. Jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCa clock), apply. - -##### Defect correlations - -Depending on the ODUk mapping, defect correlations might be necessary (e.g., loss of alignment). - -**Performance monitoring:** None. - -### 13.3.3 OTU to COMMS adaptation function (OTU/COMMS\_A) - -The OTU to COMMS adaptation functions provide access to the GCC0 overhead in the OTU for generic data communication. - -#### 13.3.3.1 OTU to COMMS adaptation source function (OTU/COMMS\_A\_So) - -The OTU/COMMS\_A\_So function maps the generic communication channel data into the OTU GCC0 overhead. - -The information flow and processing of the OTU/COMMS\_A\_So functions is defined with reference to Figures 13-21 and 13-22. - -##### Symbol - -![Figure 13-21 – OTU/COMMS_A_So function. The diagram shows two symbols for the OTU/COMMS_A_So function. The left symbol is labeled 'OTUk/COMMS' and has an input 'COMMS_CP' pointing down to it, and an output 'OTUk_AP' pointing down from it. The output is labeled with 'k = 0, 1, 2, 3, 4, 25u, 25, 50u, 50'. The right symbol is labeled 'OTUCn/COMMS' and has an input 'COMMS_CP' pointing down to it, and an output 'OTUCn_AP' pointing down from it. Below the right symbol is the text 'G.798(17)-Amd.4(22)_F13-21'.](649f424fd35ea31f622163506a6148ed_img.jpg) - -Figure 13-21 – OTU/COMMS\_A\_So function. The diagram shows two symbols for the OTU/COMMS\_A\_So function. The left symbol is labeled 'OTUk/COMMS' and has an input 'COMMS\_CP' pointing down to it, and an output 'OTUk\_AP' pointing down from it. The output is labeled with 'k = 0, 1, 2, 3, 4, 25u, 25, 50u, 50'. The right symbol is labeled 'OTUCn/COMMS' and has an input 'COMMS\_CP' pointing down to it, and an output 'OTUCn\_AP' pointing down from it. Below the right symbol is the text 'G.798(17)-Amd.4(22)\_F13-21'. - -Figure 13-21 – OTU/COMMS\_A\_So function - -##### Interfaces - -Table 13-9 – OTU/COMMS\_A\_So inputs and outputs - -| Input(s) | Output(s) | -|----------------------------------------------------------------------------|---------------------------------------------------------------| -| COMMS_CP:
COMMS_CI_D
OTU_AP:
OTU_AI_CK
OTU_AI_FS | COMMS_CP:
COMMS_CI_CK
OTU_AP:
OTU_AI_D | - -##### Processes - -The processes associated with the OTU/COMMS\_A\_So function are as depicted in Figure 13-22. - -**COMMS clock generation:** The function shall generate the COMMS clock (CI\_CK) by dividing the incoming OTUk clock (OTUk\_AI\_CK) by a factor of 8160 or the OTUCn clock (OTUCn\_AI\_CK) by a factor of 7648). - -**Mapping:** The function shall map the incoming COMMS data (CI\_D) into the GCC0 overhead of the OTU frame (AI\_D). The bit rate of the COMMS data is defined by the outgoing COMMS clock (CI\_CK) and is in the range given in Table 7-10 of [ITU-T G.709]. - -Table 13-10 – Intentionally left blank - -The insertion of the COMMS data follows the transmission order of the GCC bits and bytes. - -![Figure 13-22: OTU/COMMS_A_So processes diagram. A grey box labeled COMMS_CP contains two white boxes: 'Mapping' and 'COMMS clock generation'. External inputs AI_FS, AI_D, and AI_CK enter from the bottom (labeled OTU_AP). AI_D and AI_CK enter the 'Mapping' box, while AI_FS enters the 'COMMS clock generation' box. The 'Mapping' box outputs CI_D and CI_CK to the top. The 'COMMS clock generation' box also outputs CI_CK to the top. Reference G.798(17)_F13-22 is shown at the bottom right.](4ef412e08808c40e0beb7808d36b9379_img.jpg) - -Figure 13-22: OTU/COMMS\_A\_So processes diagram. A grey box labeled COMMS\_CP contains two white boxes: 'Mapping' and 'COMMS clock generation'. External inputs AI\_FS, AI\_D, and AI\_CK enter from the bottom (labeled OTU\_AP). AI\_D and AI\_CK enter the 'Mapping' box, while AI\_FS enters the 'COMMS clock generation' box. The 'Mapping' box outputs CI\_D and CI\_CK to the top. The 'COMMS clock generation' box also outputs CI\_CK to the top. Reference G.798(17)\_F13-22 is shown at the bottom right. - -Figure 13-22 – OTU/COMMS\_A\_So processes - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -#### **13.3.3.2 OTU to COMMS adaptation sink function (OTU/COMMS\_A\_Sk)** - -The OTU/COMMS\_A\_Sk extracts the COMMS data from the OTU GCC0 overhead. - -The information flow and processing of the OTU/COMMS\_A\_Sk functions is defined with reference to Figures 13-23 and 13-24. - -##### **Symbol** - -![Figure 13-23: OTU/COMMS_A_Sk function symbols. Two trapezoidal symbols represent the function. The left symbol is labeled 'OTUk/COMMS' and has an input OTUk_AP with parameter k = 0, 1, 2, 3, 4, 25u, 25, 50u, 50, and an output COMMS_CP. The right symbol is labeled 'OTUCn/COMMS' and has an input OTUCn_AP and an output COMMS_CP. Reference G.798(17)-Amd.4(22)_F13-23 is shown at the bottom right.](43ff52fe5a7c6990f4f0d5e0ca55d4b4_img.jpg) - -Figure 13-23: OTU/COMMS\_A\_Sk function symbols. Two trapezoidal symbols represent the function. The left symbol is labeled 'OTUk/COMMS' and has an input OTUk\_AP with parameter k = 0, 1, 2, 3, 4, 25u, 25, 50u, 50, and an output COMMS\_CP. The right symbol is labeled 'OTUCn/COMMS' and has an input OTUCn\_AP and an output COMMS\_CP. Reference G.798(17)-Amd.4(22)\_F13-23 is shown at the bottom right. - -Figure 13-23 – OTU/COMMS\_A\_Sk function - -##### **Interfaces** - -Table 13-11 – OTU/COMMS\_A\_Sk inputs and outputs - -| Input(s) | Output(s) | -|--------------------------------------------------------------------|---------------------------------------------------------------| -| OTU_AP:
OTU_AI_CK
OTU_AI_D
OTU_AI_FS
OTU_AI_TSF | COMMS_CP:
COMMS_CI_CK
COMMS_CI_D
COMMS_CI_SSF | - -##### Processes - -The processes associated with the OTUk/COMMS\_A\_Sk function are as depicted in Figure 13-24. - -**COMMS clock generation:** The function shall generate the COMMS clock (CI\_CK) by dividing the incoming OTUk clock (OTUk\_AI\_CK) by a factor of 8160 or the OTUCn clock (OTUCn\_AI\_CK) by a factor of 7648). - -**Demapping:** The function shall extract the COMMS data (CI\_D) from the GCC0 overhead of the OTU frame (AI\_D). The bit rate of the COMMS data is defined by the outgoing COMMS clock (CI\_CK) and is in the range given in Table 7-10 of [ITU-T G.709]. - -The extraction of the COMMS data follows the transmission order of the GCC bits and bytes. - -![Figure 13-24: OTUk/COMMS_A_Sk processes diagram. The diagram shows a grey rectangular box labeled 'COMMS_CP' at the top. Inside this box are two white rectangular blocks: 'Demapping' on the left and 'COMMS clock generation' on the right. Below the box, four input labels are shown: 'AI_FS', 'AI_D', 'AI_CK', and 'AI_TSF'. Arrows point from these inputs into the box. 'AI_FS' and 'AI_D' point to the 'Demapping' block. 'AI_CK' points to the 'COMMS clock generation' block. 'AI_TSF' points to the right side of the box, labeled 'aSSF'. Above the box, three output labels are shown: 'CI_D', 'CI_CK', and 'CI_SSF'. Arrows point from the 'Demapping' block to 'CI_D'. Arrows point from the 'COMMS clock generation' block to 'CI_CK'. An arrow points from the right side of the box (labeled 'aSSF') to 'CI_SSF'. At the bottom center, the label 'OTU_AP' is present. At the bottom right, the label 'G.798(17)_F13-24' is present.](efcb78ce7df315911219258bc2132f8c_img.jpg) - -Figure 13-24: OTUk/COMMS\_A\_Sk processes diagram. The diagram shows a grey rectangular box labeled 'COMMS\_CP' at the top. Inside this box are two white rectangular blocks: 'Demapping' on the left and 'COMMS clock generation' on the right. Below the box, four input labels are shown: 'AI\_FS', 'AI\_D', 'AI\_CK', and 'AI\_TSF'. Arrows point from these inputs into the box. 'AI\_FS' and 'AI\_D' point to the 'Demapping' block. 'AI\_CK' points to the 'COMMS clock generation' block. 'AI\_TSF' points to the right side of the box, labeled 'aSSF'. Above the box, three output labels are shown: 'CI\_D', 'CI\_CK', and 'CI\_SSF'. Arrows point from the 'Demapping' block to 'CI\_D'. Arrows point from the 'COMMS clock generation' block to 'CI\_CK'. An arrow points from the right side of the box (labeled 'aSSF') to 'CI\_SSF'. At the bottom center, the label 'OTU\_AP' is present. At the bottom right, the label 'G.798(17)\_F13-24' is present. - -**Figure 13-24 – OTUk/COMMS\_A\_Sk processes** - -**Defects:** None. - -##### Consequent actions - -The function shall perform the following consequent actions: - -aSSF $\leftarrow$ AI\_TSF - -**Defect correlations:** None. - -**Performance monitoring:** None. - -### 13.3.4 OTUkV to COMMS adaptation function (OTUkV/COMMS\_A) - -The OTUkV to COMMS adaptation functions provide access to the GCC overhead in the OTUkV for generic data communication. The format of the OTUkV GCC overhead is outside the scope of this Recommendation. - -#### 13.3.4.1 OTUkV to COMMS adaptation source function (OTUkV/COMMS\_A\_So) - -The OTUkV/COMMS\_A\_So function maps the generic communication channel data into the OTUkV GCC overhead. - -The information flow and processing of the OTUkV/COMMS\_A\_So functions is defined with reference to Figure 13-25. - -##### Symbol - -![Symbol diagram for OTUkV/COMMS_A_So function. It shows an input COMMS_CP entering a trapezoidal block labeled OTUkV/COMMS. An output arrow labeled k = 1, 2, 3, 4 exits the block and points to OTUkV_AP. The reference G.798(17)_F13-25 is shown below the output.](67cbb5a621a69ab58534bb3376bbb724_img.jpg) - -COMMS\_CP - -OTUkV/COMMS - -k = 1, 2, 3, 4 - -OTUkV\_AP - -G.798(17)\_F13-25 - -Symbol diagram for OTUkV/COMMS\_A\_So function. It shows an input COMMS\_CP entering a trapezoidal block labeled OTUkV/COMMS. An output arrow labeled k = 1, 2, 3, 4 exits the block and points to OTUkV\_AP. The reference G.798(17)\_F13-25 is shown below the output. - -Figure 13-25 – OTUkV/COMMS\_A\_So function - -##### Interfaces - -Table 13-12 – OTUkV/COMMS\_A\_So inputs and outputs - -| Input(s) | Output(s) | -|----------------------------------------------------------------------------------|-------------------------------------------------------------------| -| COMMS_CP:
COMMS_CI_D
OTUkV_AP:
OTUkV_AI_CK
OTUkV_AI_FS | COMMS_CP:
COMMS_CI_CK
OTUkV_AP:
OTUkV_AI_D | - -##### Processes - -The function shall insert the COMMS data into the OTUkV GCC overhead. The specific processes are outside the scope of this Recommendation. - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -#### 13.3.4.2 OTUkV to COMMS adaptation sink function (OTUkV/COMMS\_A\_Sk) - -The OTUkV/COMMS\_A\_Sk extracts the COMMS data from the OTUkV GCC overhead. - -The information flow and processing of the OTUkV/COMMS\_A\_Sk functions is defined with reference to Figure 13-26. - -##### Symbol - -![Symbol diagram for OTUkV/COMMS_A_Sk function. It shows an input OTUkV_AP entering a trapezoidal block labeled OTUkV/COMMS. An output arrow labeled k = 1, 2, 3, 4 exits the block and points to COMMS_CP. The reference G.798(17)_F13-26 is shown below the input.](18fb2f2a7bdbb03074578da43004abaa_img.jpg) - -COMMS\_CP - -OTUkV/COMMS - -k = 1, 2, 3, 4 - -OTUkV\_AP - -G.798(17)\_F13-26 - -Symbol diagram for OTUkV/COMMS\_A\_Sk function. It shows an input OTUkV\_AP entering a trapezoidal block labeled OTUkV/COMMS. An output arrow labeled k = 1, 2, 3, 4 exits the block and points to COMMS\_CP. The reference G.798(17)\_F13-26 is shown below the input. - -Figure 13-26 – OTUkV/COMMS\_A\_Sk function - -##### Interfaces - -**Table 13-13 – OTUkV/COMMS\_A\_Sk inputs and outputs** - -| Input(s) | Output(s) | -|------------------------------------------------------------------------------|---------------------------------------------------------------| -| OTUkV_AP:
OTUkV_AI_CK
OTUkV_AI_D
OTUkV_AI_FS
OTUkV_AI_TSF | COMMS_CP:
COMMS_CI_CK
COMMS_CI_D
COMMS_CI_SSF | - -##### Processes - -The function shall extract the COMMS data from the OTUkV GCC overhead. The specific processes are outside the scope of this Recommendation. - -**Defects:** None. - -##### Consequent actions - -The function shall perform the following consequent actions: - -aSSF $\leftarrow$ AI\_TSF - -**Defect correlations:** None. - -**Performance monitoring:** None. - -### 13.3.5 OTUk to synchronization distribution adaptation functions - -OTUk to synchronization distribution (SD) adaptation functions are given in clause 8.10 of [ITU-T G.781]. - -## 13.4 Sub-layer functions - -Not applicable. - -# 14 ODU (layer) functions - -Figure 14-1 illustrates the ODU layer network and client layer adaptation functions. The information crossing the ODU connection point (ODUk\_CP or ODUCn\_CP) is referred to as the ODU characteristic information (ODUk\_CI or ODUCn\_CI). The information crossing the ODUP access point (ODUkP\_AP or ODUCnP\_AP) is referred to as the ODUP adapted information (ODUkP\_AI). - -The tandem connection monitoring (TCM) sub-layer ODUT and the related functions (ODUkT\_TT, ODUT/ODU\_A and ODUTm) are optional. Up to six TCM sub-layers can be terminated within one NE. The figure shows a generic example for the connection of the ODUT functions. They can be connected to any ODU\_CP. It is not required to connect them via an ODU\_C function; they can be directly inserted without a connection function. - -The COMMS access functions (ODU/COMMS\_AC and ODUP/COMMS\_A) are optional. The figure shows a generic example for the connection of the ODU/COMMS\_AC functions. They can be inserted into any ODU\_CP (including TCPs) independent of sink or source processing. It is not required to connect them via an ODU\_C function; they can be directly inserted without a connection function. - -![](031de8ea6c5568a02faffd59b5c337f7_img.jpg) - -The diagram illustrates the ODU layer network and client layer adaptation functions, divided into ODUk (top half) and ODUCn (bottom half) sections. It shows the mapping and multiplexing of various client signals into ODU containers. - -### ODUk Layer (Top Section) - -- Client Interfaces (Top):** FC-1200\_CP, ERS10G\_CP, MT\_CP, SCC\_CP, ETH\_FP, ETH\_TFP. -- Adaptation Functions:** ODU2P/FC-1200, ODU2P/ERS10G, ODUkP[-h]/MT, ODUkP[-h]/ETH. -- Intermediate Layers:** RSn\_CP, CBRx\_CP, ODUkP/RSn, ODU0P/CBRx, ODUk-g/CBRx, ODUkP/CBRx. -- Multiplexing:** ODUk\_CP leading to ODUkP[-h]/ODUj-21 and ODUkP/ODU[i]j. -- Overhead/Management:** COMMS\_CP with ODUkP/PRBS, ODUkP/NULL, ODUkP/COMMS. -- Core:** ODUk connection point (oval) with ODUkT/ODUk termination, ODUkT non-intrusive monitor, and ODUkT\_AP/RP reference points. - -### ODUCn Layer (Bottom Section) - -- Management:** COMMS\_CP and ODUk\_CP leading to ODUCnP/PRBS, ODUCnP/NULL, ODUCnP/COMMS, ODUCnP/ODUk. -- Core:** ODUCn\_TCP (oval) with ODUCnT/ODUCn termination, ODUCnT non-intrusive monitor, and ODUCnT\_AP/RP reference points. -- Lower Adaptation:** ODUCn/COMMS adaptation functions leading to ODUCn\_CP. - -Reference markers: G.798(17)-Amd.1(18)\_F14-1a and G.798(17)\_F14-1b. - -**Figure 14-1 – ODU layer network and client layer adaptation functions** - -128 - -**Rec. ITU-T G.798 (09/2023)** - -The ODuk characteristic information (ODuk\_CI) is the ODuk frame as defined in [ITU-T G.709] with one instance (n = 1) of valid ODU overhead, together with a frame and multiframe start. The ODUCn characteristic information (ODUCn\_CI) is the ODUCn frame as defined in [ITU-T G.709] with n instances of valid ODU overhead, together with a frame and multiframe start. - -The ODU overhead is shown in Figure 14-2. TCM1..6 overhead is only used if one or more ODUT trails cross the CP; otherwise, it is set to all-ZEROs. APS/PCC overhead is only used in case of an ODU protection scheme with APS support; otherwise, it is set to all-ZEROs. GCC1, GCC2 and EXP overhead are optional. If they are not used, they are set to all-ZEROs. The RES overhead is set to all-ZEROs. PM and TCM overheads are for delay measurement of ODU path (DMp) and TCM (DMti) sections. - -![Diagram of ODuk overhead structure showing columns 1-16 and rows 1-4. Row 1 contains Frame alignment overhead (columns 1-7) and OTU overhead (columns 8-14). Rows 2-4 contain OPU overhead. Row 2: RES (col 1), EXP (col 3), TCM6 (col 4-5), TCM5 (col 6-7), TCM4 (col 8-9), EXP (col 10). Row 3: TCM3 (col 1-2), TCM2 (col 3-4), TCM1 (col 5-6), PM (col 7-8), EXP (col 9). Row 4: GCC1 (col 1), GCC2 (col 2), RES (col 3-14). Below the grid, two boxes show ODU frame structures: Structure #1 includes PM and TCM, APS/PCC, and RES; Structure #2 to #n includes RES and RES. Source: G.789(17)_F14-2.](4c63a0e17b54c7e61d512c276932114c_img.jpg) - -G.789(17)\_F14-2 - -Diagram of ODuk overhead structure showing columns 1-16 and rows 1-4. Row 1 contains Frame alignment overhead (columns 1-7) and OTU overhead (columns 8-14). Rows 2-4 contain OPU overhead. Row 2: RES (col 1), EXP (col 3), TCM6 (col 4-5), TCM5 (col 6-7), TCM4 (col 8-9), EXP (col 10). Row 3: TCM3 (col 1-2), TCM2 (col 3-4), TCM1 (col 5-6), PM (col 7-8), EXP (col 9). Row 4: GCC1 (col 1), GCC2 (col 2), RES (col 3-14). Below the grid, two boxes show ODU frame structures: Structure #1 includes PM and TCM, APS/PCC, and RES; Structure #2 to #n includes RES and RES. Source: G.789(17)\_F14-2. - -**Figure 14-2 – ODuk overhead at ODuk\_CP** - -The ODukP adapted information (ODukP\_AI) consists of the client layer CI adapted to the OPuk frame as defined in [ITU-T G.709] and one (n=1) instance of OPU overhead as shown in Figure 14-3, together with a frame and multiframe start. The mapping-specific overhead depends on the client mapping scheme. In case of COMMS access at the ODukP\_AP, it also includes the ODuk GCC overhead (GCC1/2). In the case of ODuk client signal protection (e.g., ODuj CL-SNCG/I, non-OTN client SNC/I or ODU SRP-p), it also includes the ODuk PM APS overhead (APS/PCC at level 000). - -The ODUCnP adapted information (ODUCnP\_AI) consists of the client layer CI adapted to the OPUCn frame as defined in [ITU-T G.709] and n instances of OPU overhead as shown in Figure 14-3, together with a frame and multiframe start. The mapping-specific overhead depends on the client mapping scheme. In case of COMMS access at the ODUCnP\_AP, it also includes the ODUCn GCC overhead (GCC1/2). In the case of ODUCn client signal protection (e.g., ODuj CL-SNCG/I, or ODU SRP-p), it also includes the ODUCn PM APS overhead (APS/PCC). - -![Diagram of OPU overhead at ODU_AP showing a 16-column by 4-row frame structure. Row 1-3 are mapping specific overhead. Row 4 contains GCC1, GCC2, APS/PCC, and PSI. Below the frame, a table shows MEAS[6:8] values (000-111) for ODuk and ODUCn paths.](143c8ee1010bf7669caabfbed815df1b_img.jpg) - -The diagram illustrates the OPU overhead structure at the ODU\_AP. It consists of a frame with 16 columns and 4 rows. Rows 1, 2, and 3 are designated as 'Mapping specific overhead'. Row 4 is divided into four sections: GCC1 (columns 1-2), GCC2 (columns 3-4), APS/PCC (columns 5-8), and PSI (columns 15-16). Below the frame, a table shows the 'MEAS[6:8]' values (000 through 111) for two paths: ODuk and ODUCn. The ODuk path is associated with the first MEAS value (000), and the ODUCn path is associated with the second MEAS value (001). The remaining MEAS values (010 through 111) are listed in the table but are not explicitly associated with a path in this diagram. - -| MEAS[6:8] | ODuk | ODUCn | -|-----------|--------------|---------| -| 000 | APS/PCC path | | -| 001 | | APS/PCC | -| 010 | | | -| 011 | | | -| 100 | | | -| 101 | | | -| 110 | | | -| 111 | | | - -Diagram of OPU overhead at ODU\_AP showing a 16-column by 4-row frame structure. Row 1-3 are mapping specific overhead. Row 4 contains GCC1, GCC2, APS/PCC, and PSI. Below the frame, a table shows MEAS[6:8] values (000-111) for ODuk and ODUCn paths. - -Figure 14-3 – OPU overhead at ODU\_AP - -## 14.1 Connection functions - -### 14.1.1 ODUk connection function (ODU\_C) - -The information flow and processing of the ODU\_C function is defined with reference to Figures 14-4 and 14-5. The ODU\_C function connects ODUk characteristic information from its input ports to its output ports. As the process does not affect the nature of characteristic information, the reference points on either side of the ODU\_C function are the same as illustrated in Figure 14-4. - -NOTE 1 – The ODUCn is excluded from the ODU\_C function. - -The connection process is unidirectional and as such no differentiation in sink and source is required. - -In addition, the ODU\_C function supports the following subnetwork connection protection schemes: - -- 1+1 unidirectional SNC/N, SNC/I and SNC/S protection without an APS protocol. -- 1+1 unidirectional SNC/N, SNC/I and SNC/S protection with an APS protocol. -- 1+1 bidirectional SNC/N, SNC/I and SNC/S protection with an APS protocol. -- 1:n unidirectional SNC/I and SNC/S protection with an APS protocol. -- 1:n bidirectional SNC/I and SNC/S protection with an APS protocol. - -The protection functionality is described in clause 14.1.1.1. - -NOTE 2 – The protection processes have a dedicated sink and source behaviour. - -##### Symbol - -![Diagram of the ODU_C function symbol. A central oval is labeled 'ODUk'. Above the oval, three vertical arrows point down to it, labeled 'ODUk_CP' at the top, with three dots between them. Below the oval, three vertical arrows point down from it, also labeled 'ODUk_CP' at the bottom, with three dots between them. To the left of the oval, a horizontal double-headed arrow points to it, labeled 'ODUk_C_MP'. To the right of the oval, the text 'G.798(10)_F14-4' is present.](56587d8256f60b3022273b5d8a90dfa8_img.jpg) - -Diagram of the ODU\_C function symbol. A central oval is labeled 'ODUk'. Above the oval, three vertical arrows point down to it, labeled 'ODUk\_CP' at the top, with three dots between them. Below the oval, three vertical arrows point down from it, also labeled 'ODUk\_CP' at the bottom, with three dots between them. To the left of the oval, a horizontal double-headed arrow points to it, labeled 'ODUk\_C\_MP'. To the right of the oval, the text 'G.798(10)\_F14-4' is present. - -Figure 14-4 – ODU\_C function - -##### Interfaces - -Table 14-1 – ODU\_C function inputs and outputs - -| Input(s) | Output(s) | -|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| per ODUk_CP:
ODUk_CI_D
ODUk_CI_CK
ODUk_CI_FS
ODUk_CI_MFS
ODUk_CI_SSF
ODUk_CI_SSD (for SNC/S and SNC/I protection)
ODUk_AI_TSF (for SNC/N protection)
ODUk_AI_TSD (for SNC/N protection)
ODUk_CI_APS (for SNC/I and SNC/S protection)
ODUk_CI_RP
ODUk_CI_TSCC
per ODU_PP: (for CL_SNCG/I protection)
ODU_PI_APS
ODU_PI_TSF
ODU_PI_TSD
ODUk_C_MP:
ODUk_C_MI_MatrixControl
per protection group (for SNC protection):
ODUk_C_MI_ProfType
ODUk_C_MI_OperType
ODUk_C_MI_WTR
ODUk_C_MI_HoTime
ODUk_C_MI_ExtCMD
ODUk_C_MI_APSChannel (for SNC protection with APS protocol)
ODUk_C_MI_SDEnable | per ODUk_CP:
ODUk_CI_D
ODUk_CI_CK
ODUk_CI_FS
ODUk_CI_MFS
ODUk_CI_SSF
ODUk_CI_APS (for SNC/I and SNC/S protection)
ODUk_CI_RP
ODUk_CI_TSCC
per ODU_PP: (for CL_SNCG/I protection)
ODU_PI_APS
ODUk_C_MP:
per protection group (for SNC protection with APS protocol):
ODUk_C_MI_cFOP-PM
ODUk_C_MI_cFOP-NR | - -##### Processes - -The processes associated with the ODU\_C function are as depicted in Figure 14-5. - -ODU\_CI is routed between input and output connection points by means of a matrix connection. Connection points may be allocated within a protection group. - -NOTE 3 – Neither the number of input/output signals to the connection function, nor the connectivity, is specified in this Recommendation. That is a property of individual network elements. - -**Routing:** The function shall be able to connect a specific input with a specific output by means of establishing a matrix connection between the specified input and output. It shall be able to remove an established matrix connection. - -Each (matrix) connection in the ODU\_C function should be characterized by the: - -- Type of connection: unprotected. -- Traffic direction: unidirectional, bidirectional. -- Input and output connection points: set of connection points. - -NOTE 4 – Broadcast connections are handled as separate connections to the same CP. - -The following changes to (the configuration of) a connection shall be possible without disturbing the CI passing the connection: - -- addition and removal of protection; -- addition and removal of connections to/from a broadcast connection; -- change of WTR time; -- change of operation type; -- change of hold-off time; -- change of APS channel. - -**Open connection indication (OCI):** If an output of the connection function is not connected to an input, an ODU-OCI signal as defined in clause 16.5 of [ITU-T G.709] is generated for this output. The clock of the OCI signal has to be within the minimum and maximum clock frequencies specified for the ODU signals that are given in Table 7-2 of [ITU-T G.709]. The jitter and wander requirements as defined in Annex A of [ITU-T G.8251] (ODCa clock) apply. CI\_SSF is false. CI\_RP is to be set to the default value "0" and CI\_TSCC is to be set to the default value "0" for indicating that no resize operation is active. - -**Alarm indication signal (AIS):** If in a protection switch operation as defined in [ITU-T G.873.1] or [ITU-T G.873.1] extra traffic is pre-empted and to be squelched, or ODU squelching to prevent misconnection is to be executed, an ODU-AIS signal as defined in clause 16.5 of [ITU-T G.709] is generated for this output. The clock of the AIS signal has to be within the minimum and maximum clock frequencies specified for the ODU signals that are given in Table 7-2 of [ITU-T G.709]. The jitter and wander requirements as defined in Annex A of [ITU-T G.8251] (ODCa clock) apply. CI\_SSF is true. CI\_RP is to be set to the default value "0" and CI\_TSCC is to be set to the default value "0" for indicating no resize operation active. - -![Figure 14-5 – ODU_C function processes diagram. The diagram shows the internal structure of the ODU_C function. At the top, a bracket labeled 'ODUk_CPs' spans over a series of input signals: CL_D, CL_Ck, CL_FS, CL_SSF, CL_TSCC, CL_SSD/AL_TSF/AL_TSD, CL_RP, and CL_TSCC. These inputs connect to a central 'Matrix connection' block. Below the matrix connection, there are three functional blocks: 'OCI', 'OCI', and 'AIS'. Each block has multiple output signals pointing downwards, which are grouped by a bracket labeled 'ODUk_CPs'. The signals include CL_D, CL_Ck, CL_FS, CL_SSF, CL_TSCC, CL_SSD/AL_TSF/AL_TSD, CL_RP, and CL_TSCC. To the right of the matrix connection, another bracket labeled 'ODU_PPs' spans over input signals: PI_APS, PI_TSF, and PI_TSD. These also connect to the matrix connection. Below the matrix connection, there are output signals for PI_APS, PI_TSF, and PI_TSD, grouped by a bracket labeled 'ODU_PPs'. On the far left, a vertical label 'ODU_C_MP' with a double-headed arrow indicates the overall function boundary. A small note 'G.798(17)-Amd.4(22)_F14-5' is in the bottom right corner.](3ce6b213ec556257e32ff7451182369d_img.jpg) - -Figure 14-5 – ODU\_C function processes diagram. The diagram shows the internal structure of the ODU\_C function. At the top, a bracket labeled 'ODUk\_CPs' spans over a series of input signals: CL\_D, CL\_Ck, CL\_FS, CL\_SSF, CL\_TSCC, CL\_SSD/AL\_TSF/AL\_TSD, CL\_RP, and CL\_TSCC. These inputs connect to a central 'Matrix connection' block. Below the matrix connection, there are three functional blocks: 'OCI', 'OCI', and 'AIS'. Each block has multiple output signals pointing downwards, which are grouped by a bracket labeled 'ODUk\_CPs'. The signals include CL\_D, CL\_Ck, CL\_FS, CL\_SSF, CL\_TSCC, CL\_SSD/AL\_TSF/AL\_TSD, CL\_RP, and CL\_TSCC. To the right of the matrix connection, another bracket labeled 'ODU\_PPs' spans over input signals: PI\_APS, PI\_TSF, and PI\_TSD. These also connect to the matrix connection. Below the matrix connection, there are output signals for PI\_APS, PI\_TSF, and PI\_TSD, grouped by a bracket labeled 'ODU\_PPs'. On the far left, a vertical label 'ODU\_C\_MP' with a double-headed arrow indicates the overall function boundary. A small note 'G.798(17)-Amd.4(22)\_F14-5' is in the bottom right corner. - -**Figure 14-5 – ODU\_C function processes** - -**Defects:** See clause 14.1.1.1 for protection-specific defects. - -**Consequent actions:** None. - -**Defect correlations:** See clause 14.1.1.1 for protection-specific defect correlations. - -**Performance monitoring:** None. - -#### 14.1.1.1 Subnetwork connection protection process - -NOTE 1 – This process is active in the ODU\_C function as many times as there are 1+1 and 1:N protected matrix connections. - -The generic subnetwork connection protection mechanism is defined in [ITU-T G.808.1] with OTN-specific extensions in [ITU-T G.873.1]. - -SNC protection with non-intrusive monitoring (SNC/N), with inherent monitoring (SNC/I) and with sub-layer monitoring based on TCM (SNC/S), are supported. SNC/I is limited to a single OTUk[V] or HO ODUk server layer trail for the working and protection subnetwork connection between the source and sink protection switch (e.g., no intermediate OTUk termination/3R regeneration or HO ODUk termination is allowed). - -NOTE 2 – The limitation to a single server layer trail for SNC/I protection is given by the use of signal degrade (SD) as protection switching criteria. SD is only available from the OTUk[V] or HO ODUk trail that is locally terminated and not from further upstream OTUk[V] or HO ODUk trails. Furthermore, FDI/AIS, which provides information about defects in upstream OTUk[V] or HO ODUk trails, is not detected in the OTUk[V]/ODUk\_A\_Sk, ODUkP/ODU[i]j\_A\_Sk or the ODUkP/ODUj-21\_A\_Sk. - -Figure 14-6 gives the atomic functions involved in SNC/N protection. The working and protection ODU\_CI coming from either an OTUk[V]/ODUk\_A, ODUkT/ODUk\_A, ODUkP/ODU[i]j\_A, ODUkP[-h]/ODUj-21\_A or ODUCnP/ODUk\_A function are monitored by a ODUkP or ODUkT non-intrusive monitor, which provide the TSF and TSD protection switching criteria. The MI\_APS\_EN and MI\_APS\_LVL of the OTUk[V]/ODUk\_A, ODUkP/ODU[i]j\_A, ODUkP[-h]/ODUj-21\_A or ODUCnP/ODUk\_A functions should be set to provide access to the corresponding ODUk PM or TCM APS channel. The ODUkT/ODUk\_A functions provide access to the ODUk TCM APS channel. - -Figure 14-7 gives the atomic functions involved in SNC/I protection. The trail termination sink of an OTUk[V] or ODUP server layer provides the TSF and TSD protection switching criteria via the OTUk[V]/ODUk\_A, ODUkP/ODU[i]j\_A, ODUkP[-h]/ODUj-21\_A or ODUCnP/ODUk\_A functions (SSF and SSD). The MI\_APS\_EN and MI\_APS\_LVL of the OTUk[V]/ODUk\_A, - -ODUkP/ODU[i]j\_A, ODUkP[-h]/ODUj-21\_A or ODUCnP/ODUk\_A functions should be set to provide access to the ODUk SM APS channel. - -Figure 14-8 gives the atomic functions involved in SNC/S protection. The trail termination sink of an ODUkT TCM sub-layer provides the TSF and TSD protection switching criteria via the ODUkT/ODUk\_A function (SSF and SSD). The ODUkT/ODUk\_A functions provide access to the ODUk TCM APS channel. - -![Diagram of SNC/N protection atomic functions showing a central ODUk layer connected to Working and Protection ODUk CPs, which are further connected to OTUk sub-layers with various control signals like TSF, TSD, SSF, and APS.](1684f5f8c34bd0ef6e933664d88b9d86_img.jpg) - -The diagram illustrates the atomic functions for SNC/N protection. At the top, a central oval represents the **ODUk** layer. Above it, an arrow labeled **Normal (protected) ODUk CP** points down into the ODUk layer. Below the ODUk layer, there are two main paths: **Working ODUk CP** and **Protection ODUk CP**. Each path consists of a trapezoidal block labeled **ODUkT/ODUk OTUk[V]/ODUk ODUkP/ODU[j]j ODUkP/ODUj-21**. To the left of the Working path, a triangle labeled **ODUkTm ODUkP** receives **SSF** and **TSF, TSD** signals. Below the Working path, another trapezoidal block labeled **OTUk[V]/ODUk OTUk ODUk** is connected. The Protection path similarly has a triangle labeled **ODUkTm ODUkP** receiving **SSF** and **TSF, TSD** signals. Below the Protection path, a trapezoidal block labeled **OTUk[V]/ODUk OTUk ODUk** is connected. At the bottom, arrows point to labels **G.798(10)\_F14-6**. - -Diagram of SNC/N protection atomic functions showing a central ODUk layer connected to Working and Protection ODUk CPs, which are further connected to OTUk sub-layers with various control signals like TSF, TSD, SSF, and APS. - -Figure 14-6 – SNC/N protection atomic functions - -![Diagram of SNC/I protection atomic functions showing multiple Working ODUk CPs (1 to N) and one Protection ODUk CP connected to a central ODUk layer, with associated OTUk sub-layers and control signals.](024914144d624b7f5dc22aaa5c3967b9_img.jpg) - -The diagram illustrates the atomic functions for SNC/I protection. At the top, a central oval represents the **ODUk** layer. Above it, multiple arrows labeled **Normal (protected) ODUk CP** (numbered 1 to N) point down into the ODUk layer. To the right, an arrow labeled **Extra traffic ODUk CP** points down into the ODUk layer. Below the ODUk layer, there are multiple **Working ODUk CP** blocks (numbered 1 to N) and one **Protection ODUk CP** block. Each Working ODUk CP block is a trapezoid labeled **OTUk[V]/ODUk OTUk[V]/ODUk ODUkP/ODU[j]j ODUkP/ODUj-21**. Below each Working ODUk CP block is a triangle labeled **OTUk[V]/ODUk OTUk ODUk**. The Protection ODUk CP block is a trapezoid labeled **OTUk[V]/ODUk OTUk[V]/ODUk ODUkP/ODU[j]j ODUkP/ODUj-21**. Below it is a triangle labeled **OTUk[V]/ODUk OTUk ODUk**. Control signals **SSF**, **SSD**, **TSF**, **TSD**, and **APS** are shown between the ODUk layer and the sub-layers. At the bottom, arrows point to labels **G.798(12)\_F14-7**. - -Diagram of SNC/I protection atomic functions showing multiple Working ODUk CPs (1 to N) and one Protection ODUk CP connected to a central ODUk layer, with associated OTUk sub-layers and control signals. - -Figure 14-7 – SNC/I protection atomic functions - -![Figure 14-8: SNC/S protection atomic functions diagram. It shows a top-level ODUk layer with multiple 'Normal (protected) ODUk CP' (1 to N) and 'Extra traffic ODUk CP' connections. Below this, there are 'Working ODUk CP' (1 to N) and 'Protection ODUk CP' components. Each working component is connected to an 'ODUkT/ODUk' block, which is further connected to an 'ODUkT' block. Each protection component is connected to an 'ODUkT/ODUk' block, which is connected to an 'ODUkT' block. Control signals like SSF, SSD, TSF, TSD, and APS are shown between the layers. A reference code 'G.798(12)_F14-8' is at the bottom right.](845e014e3b8677eb735d0e21f21206be_img.jpg) - -Figure 14-8: SNC/S protection atomic functions diagram. It shows a top-level ODUk layer with multiple 'Normal (protected) ODUk CP' (1 to N) and 'Extra traffic ODUk CP' connections. Below this, there are 'Working ODUk CP' (1 to N) and 'Protection ODUk CP' components. Each working component is connected to an 'ODUkT/ODUk' block, which is further connected to an 'ODUkT' block. Each protection component is connected to an 'ODUkT/ODUk' block, which is connected to an 'ODUkT' block. Control signals like SSF, SSD, TSF, TSD, and APS are shown between the layers. A reference code 'G.798(12)\_F14-8' is at the bottom right. - -**Figure 14-8 – SNC/S protection atomic functions** - -The signal flow associated with the ODU\_C SNC protection process is described with reference to Figures 14-9 to 14-13. The protection process receives control parameters and external switch requests at the MP reference point. The report of status information at the MP reference point is for further study. - -![Figure 14-9: 1+1 unidirectional SNC/N protection process without APS protocol diagram. It shows a 'Normal ODUk_CP' input branching into a 'Permanent bridge' and a 'Control' block. The 'Permanent bridge' outputs to 'Working ODUk_CP' and 'Protection ODUk_CP'. The 'Control' block outputs to a 'Selector' and receives 'TSF, TSD' signals. The 'Selector' outputs to 'Working ODUk_CP' and 'Protection ODUk_CP'. Management interface signals (MI_ProfType, MI_OperType, MI_WTR, MI_HoldOffTime, MI_ExtCMD, MI_SDEnable) are shown on the left. A reference code 'G.798-Amd.1(11)_F14-9' is at the bottom right.](61b2e15aedbb8a8dffc5426c0a284eb1_img.jpg) - -Figure 14-9: 1+1 unidirectional SNC/N protection process without APS protocol diagram. It shows a 'Normal ODUk\_CP' input branching into a 'Permanent bridge' and a 'Control' block. The 'Permanent bridge' outputs to 'Working ODUk\_CP' and 'Protection ODUk\_CP'. The 'Control' block outputs to a 'Selector' and receives 'TSF, TSD' signals. The 'Selector' outputs to 'Working ODUk\_CP' and 'Protection ODUk\_CP'. Management interface signals (MI\_ProfType, MI\_OperType, MI\_WTR, MI\_HoldOffTime, MI\_ExtCMD, MI\_SDEnable) are shown on the left. A reference code 'G.798-Amd.1(11)\_F14-9' is at the bottom right. - -**Figure 14-9 – 1+1 unidirectional SNC/N protection process without APS protocol** - -![Figure 14-10: 1+1 unidirectional SNC/S and SNC/I protection process without APS protocol diagram. It is similar to Figure 14-9 but the 'Control' block receives 'SSF, SSD' signals instead of 'TSF, TSD'. A reference code 'G.798-Amd.1(11)_F14-10' is at the bottom right.](0850300da6b28250eb47881da35cabad_img.jpg) - -Figure 14-10: 1+1 unidirectional SNC/S and SNC/I protection process without APS protocol diagram. It is similar to Figure 14-9 but the 'Control' block receives 'SSF, SSD' signals instead of 'TSF, TSD'. A reference code 'G.798-Amd.1(11)\_F14-10' is at the bottom right. - -**Figure 14-10 – 1+1 unidirectional SNC/S and SNC/I protection process without APS protocol** - -![Figure 14-11: 1+1 SNC/N protection process with APS protocol. This block diagram shows the signal flow and control logic for 1+1 SNC/N protection. On the left, a 'Normal ODUk_CP' input splits into a 'Permanent bridge' and a 'Control' block. The 'Permanent bridge' outputs to 'Working ODUk_CP' and 'Protection ODUk_CP'. The 'Control' block receives inputs from 'MI_ProtType', 'MI_OperType', 'MI_WTR', 'MI_HoldOffTime', 'MI_ExtCMD', and 'MI_SDEnable'. It also receives 'APS protocol' and 'TSF TSD' signals. The 'Control' block sends 'dFOP-PM' and 'dFOP-NR' signals to a 'Selector' block. The 'Selector' block outputs to 'MI_cFOP-PM' and 'MI_cFOP-NR'. The 'Selector' block also receives 'APS protocol' and 'TSF' signals. The 'MI_APSChannel' is connected to the 'APS protocol insertion' and 'APS protocol acceptance' blocks. The 'APS protocol insertion' block receives 'APS protocol' from the 'Control' block and sends it to the 'Permanent bridge'. The 'APS protocol acceptance' block receives 'APS protocol' from the 'Selector' block and sends it to the 'Control' block.](5ee80a63ec53c60d7306b5a44984afcf_img.jpg) - -Figure 14-11: 1+1 SNC/N protection process with APS protocol. This block diagram shows the signal flow and control logic for 1+1 SNC/N protection. On the left, a 'Normal ODUk\_CP' input splits into a 'Permanent bridge' and a 'Control' block. The 'Permanent bridge' outputs to 'Working ODUk\_CP' and 'Protection ODUk\_CP'. The 'Control' block receives inputs from 'MI\_ProtType', 'MI\_OperType', 'MI\_WTR', 'MI\_HoldOffTime', 'MI\_ExtCMD', and 'MI\_SDEnable'. It also receives 'APS protocol' and 'TSF TSD' signals. The 'Control' block sends 'dFOP-PM' and 'dFOP-NR' signals to a 'Selector' block. The 'Selector' block outputs to 'MI\_cFOP-PM' and 'MI\_cFOP-NR'. The 'Selector' block also receives 'APS protocol' and 'TSF' signals. The 'MI\_APSChannel' is connected to the 'APS protocol insertion' and 'APS protocol acceptance' blocks. The 'APS protocol insertion' block receives 'APS protocol' from the 'Control' block and sends it to the 'Permanent bridge'. The 'APS protocol acceptance' block receives 'APS protocol' from the 'Selector' block and sends it to the 'Control' block. - -**Figure 14-11 – 1+1 SNC/N protection process with APS protocol** - -![Figure 14-12: 1+1 SNC/S and SNC/I protection process with APS protocol. This block diagram shows the signal flow and control logic for 1+1 SNC/S and SNC/I protection. It is similar to Figure 14-11 but uses 'SSF SSD' instead of 'TSF TSD'. The 'Control' block receives 'SSF SSD' signals from the 'Selector' block. The 'Selector' block sends 'SSF' signals to the 'Control' block. The 'MI_APSChannel' is connected to the 'APS protocol insertion' and 'APS protocol acceptance' blocks. The 'APS protocol insertion' block receives 'APS protocol' from the 'Control' block and sends it to the 'Permanent bridge'. The 'APS protocol acceptance' block receives 'APS protocol' from the 'Selector' block and sends it to the 'Control' block.](4b9e2f848d66a0b3c2d4553b965933c7_img.jpg) - -Figure 14-12: 1+1 SNC/S and SNC/I protection process with APS protocol. This block diagram shows the signal flow and control logic for 1+1 SNC/S and SNC/I protection. It is similar to Figure 14-11 but uses 'SSF SSD' instead of 'TSF TSD'. The 'Control' block receives 'SSF SSD' signals from the 'Selector' block. The 'Selector' block sends 'SSF' signals to the 'Control' block. The 'MI\_APSChannel' is connected to the 'APS protocol insertion' and 'APS protocol acceptance' blocks. The 'APS protocol insertion' block receives 'APS protocol' from the 'Control' block and sends it to the 'Permanent bridge'. The 'APS protocol acceptance' block receives 'APS protocol' from the 'Selector' block and sends it to the 'Control' block. - -**Figure 14-12 – 1+1 SNC/S and SNC/I protection process with APS protocol** - -![Figure 14-13: 1:N SNC/S and SNC/I protection process with APS protocol. This block diagram shows the signal flow and control logic for 1:N SNC/S and SNC/I protection. On the left, 'Normal ODUk_CP' (labeled 1) and 'Extra traffic ODUk_CP' (labeled N) inputs go to a 'Bridge' block. The 'Bridge' block outputs to 'Working ODUk_CP' (labeled 1) and 'Protection ODUk_CP' (labeled N). The 'Bridge' block also has an 'OCI' block. The 'Control' block receives inputs from 'MI_ProtType', 'MI_OperType', 'MI_WTR', 'MI_HoldOffTime', 'MI_ExtCMD', and 'MI_SDEnable'. It also receives 'APS protocol' and 'SSF, SSD' signals. The 'Control' block sends 'dFOP-PM' and 'dFOP-NR' signals to a 'Selector' block. The 'Selector' block outputs to 'MI_cFOP-PM' and 'MI_cFOP-NR'. The 'Selector' block also receives 'APS protocol' and 'SSF' signals. The 'MI_APSChannel' is connected to the 'APS protocol insertion' and 'APS protocol acceptance' blocks. The 'APS protocol insertion' block receives 'APS protocol' from the 'Control' block and sends it to the 'Bridge'. The 'APS protocol acceptance' block receives 'APS protocol' from the 'Selector' block and sends it to the 'Control' block. The 'AIS' block is connected to the 'Selector' block.](d3253d5db64378db6e72b66b41067a5b_img.jpg) - -Figure 14-13: 1:N SNC/S and SNC/I protection process with APS protocol. This block diagram shows the signal flow and control logic for 1:N SNC/S and SNC/I protection. On the left, 'Normal ODUk\_CP' (labeled 1) and 'Extra traffic ODUk\_CP' (labeled N) inputs go to a 'Bridge' block. The 'Bridge' block outputs to 'Working ODUk\_CP' (labeled 1) and 'Protection ODUk\_CP' (labeled N). The 'Bridge' block also has an 'OCI' block. The 'Control' block receives inputs from 'MI\_ProtType', 'MI\_OperType', 'MI\_WTR', 'MI\_HoldOffTime', 'MI\_ExtCMD', and 'MI\_SDEnable'. It also receives 'APS protocol' and 'SSF, SSD' signals. The 'Control' block sends 'dFOP-PM' and 'dFOP-NR' signals to a 'Selector' block. The 'Selector' block outputs to 'MI\_cFOP-PM' and 'MI\_cFOP-NR'. The 'Selector' block also receives 'APS protocol' and 'SSF' signals. The 'MI\_APSChannel' is connected to the 'APS protocol insertion' and 'APS protocol acceptance' blocks. The 'APS protocol insertion' block receives 'APS protocol' from the 'Control' block and sends it to the 'Bridge'. The 'APS protocol acceptance' block receives 'APS protocol' from the 'Selector' block and sends it to the 'Control' block. The 'AIS' block is connected to the 'Selector' block. - -**Figure 14-13 – 1:N SNC/S and SNC/I protection process with APS protocol** - -For the description of the protection processes including bridge and selector control, APS acceptance and transmission, see [ITU-T G.873.1]. - -A permanent bridge, as defined in [ITU-T G.808.1], shall be used for the 1+1 protection. A broadcast bridge, as defined in [ITU-T G.808.1], shall be used for the 1:N protection. It permanently connects the normal traffic signal to the working transport entity. In case no normal or extra traffic signal is connected to the protection transport entity, an ODU-OCI signal, as defined in clause 16.5 of [ITU-T G.709], is generated for the protection transport entity. The clock of the OCI signal has to be within the minimum and maximum frequencies of the specified ODU signal in Table 7-2 of [ITU-T G.709]. The jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCa clock), apply. CI\_SSF is false. In the case where the extra traffic signal of a 1:N protection configuration carried by the protection entity is pre-empted by a protection switch, an ODU-AIS signal is to be connected to the extra traffic ODU\_CP output. The clock of the ODU-AIS signal has to be within the minimum and maximum frequencies of the specified ODU signal in Table 7-2 of [ITU-T G.709]. The jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCa clock), apply. - -A selective selector, as defined in [ITU-T G.808.1], shall be used. - -MI\_ProtType configures the protection type as defined in clause 9.4 of [ITU-T G.873.1]. - -NOTE 3 – Only a subset or a single protection type can be supported. In the latter case, the configuration is not needed. - -MI\_OperType configures between revertive and non-revertive operation as defined in clause 8.3 of [ITU-T G.873.1]. - -NOTE 4 – Only a single operation type can be supported. In this case, the configuration is not needed. - -MI\_HoTime configures the hold-off time as defined in clause 9.12 of [ITU-T G.873.1]. - -MI\_WTR configures the wait to restore (WTR) time as defined in clause 15 of [ITU-T G.808.1]. - -MI\_ExtCMD configures the protection group commands as defined in clause 7 of [ITU-T G.873.1]. - -MI\_APSChannel configures the APS channel (see clause 15.8.2.4 of [ITU-T G.709]) in case an APS protocol is used. - -If MI\_SDEnable is true, the SSD/TSD signal is used as trigger for the protection. If it is false, SSD/TSD is not used as trigger for the protection. It applies to all working and the protection signals in common. - -##### *Protection switching performance* - -See clause 6.2 of [ITU-T G.873.1]. - -##### **Defects** - -The function shall detect dFOP-PM and dFOP-NR defects in case the APS protocol is used. - -**dFOP-PM:** See clause 6.2.7.1.1. - -**dFOP-NR:** See clause 6.2.7.1.2. - -**Consequent actions:** None. - -##### **Defect correlations** - -cFOP-PM ← dFOP-PM and (not CI\_SSF/TSF) - -cFOP-NR ← dFOP-NR and (not CI\_SSF/TSF) - -In the case of SNC/S and SNC/I, CI\_SSF of the protection signal is used. In the case of SNC/N, CI\_TSF of the protection signal is used. - -**Performance monitoring:** None. - -#### 14.1.1.2 Compound link subnetwork connection group protection process - -NOTE 1 – This process is active in the ODU\_C function as many times as there are 1+1 and 1:1 protected matrix connection groups. - -The generic compound link subnetwork connection group with an inherent monitoring protection mechanism is defined in [ITU-T G.808.1] with OTN-specific extensions in [ITU-T G.873.1]. - -CL-SNCG protection with inherent monitoring (CL-SNCG/I) is supported. CL-SNCG/I is limited to a single HO ODUk server layer trail for the working and protection subnetwork connection groups between the source and sink protection switch (e.g., no intermediate HO ODUk termination is allowed). - -Figure 14-14 gives the atomic functions involved in CL-SNCG/I protection. The trail termination sink of an ODUkP server layer provides the TSF and TSD protection switching criteria. - -![Diagram of CL-SNCG/I protection atomic functions showing signal flow between unprotected and protected ODU_CIs through ODU and ODUkP layers.](2bcc7de24074ca97717d10c8c4bfe3ba_img.jpg) - -The diagram illustrates the atomic functions for CL-SNCG/I protection. At the top, an oval labeled 'ODU' contains two sections: 'Unprotected ODU\_CI' on the left and 'Protected ODU\_CI' on the right, both with multiple input/output arrows. Below the 'Unprotected ODU\_CI' section, there are two trapezoidal blocks labeled 'ODUkP/ODUj-21'. The left one has inputs 'U' and 'W' and an output 'ODUkP'. The right one has inputs 'U' and 'W' and an output 'ODUkP'. Between these two blocks is a vertical line labeled 'TSF/TSD'. Below the 'Protected ODU\_CI' section, there are two similar trapezoidal blocks labeled 'ODUkP/ODUj-21'. The left one has inputs 'U' and 'P' and an output 'ODUkP'. The right one has inputs 'U' and 'P' and an output 'ODUkP'. Between these two blocks is a vertical line labeled 'TSF/TSD'. Vertical lines labeled 'PI\_APS' connect the 'ODUkP/ODUj-21' blocks to the 'ODUkP' blocks. At the bottom, four triangular blocks labeled 'ODUkP' are shown, with arrows indicating signal flow between them and the blocks above. A small label 'G.798(12)\_F 14-14' is in the bottom right corner. - -Diagram of CL-SNCG/I protection atomic functions showing signal flow between unprotected and protected ODU\_CIs through ODU and ODUkP layers. - -**Figure 14-14 – CL-SNCG/I protection atomic functions** - -The signal flow associated with the ODU\_C CL-SNCG/I protection process is described with reference to Figures 14-15, 14-16 and 14-17. The protection process receives control parameters and external switch requests at the MP reference point. The report of status information at the MP reference point is for further study. - -For the description of the protection processes including bridge and selector control, APS acceptance and transmission, see [ITU-T G.873.1]. - -A permanent bridge, as defined in [ITU-T G.808.1], shall be used for 1+1 protection. A broadcast bridge, as defined in [ITU-T G.808.1], shall be used for 1:1 protection. It permanently connects the normal traffic signals to the working transport entity group. - -A selective selector, as defined in [ITU-T G.808.1], shall be used. - -![Figure 14-15: 1+1 unidirectional CL-SNCG/I protection process without APS protocol. The diagram shows a 'Normal ODUj_CPs' input at the top left entering a 'Permanent bridge'. The bridge has two outputs: 'Working ODUj_CPs' and 'Protection ODUj_CPs'. A 'Control' block receives 'MI_ProtType', 'MI_OperType', 'MI_WTR', 'MI_HoldOffTime', 'MI_ExtCMD', and 'MI_SDEnable' as inputs and sends 'TSF/TSD' signals to a 'Selector'. The 'Selector' also receives 'Normal ODUj_CPs' from the top right and outputs 'Working ODUj_CPs' and 'Protection ODUj_CPs'. A label 'G.798(12)_F14-15' is at the bottom right.](8181865f1fd5e629dbe12ed89d22dc83_img.jpg) - -Figure 14-15: 1+1 unidirectional CL-SNCG/I protection process without APS protocol. The diagram shows a 'Normal ODUj\_CPs' input at the top left entering a 'Permanent bridge'. The bridge has two outputs: 'Working ODUj\_CPs' and 'Protection ODUj\_CPs'. A 'Control' block receives 'MI\_ProtType', 'MI\_OperType', 'MI\_WTR', 'MI\_HoldOffTime', 'MI\_ExtCMD', and 'MI\_SDEnable' as inputs and sends 'TSF/TSD' signals to a 'Selector'. The 'Selector' also receives 'Normal ODUj\_CPs' from the top right and outputs 'Working ODUj\_CPs' and 'Protection ODUj\_CPs'. A label 'G.798(12)\_F14-15' is at the bottom right. - -**Figure 14-15 – 1+1 unidirectional CL-SNCG/I protection process without APS protocol** - -![Figure 14-16: 1+1 CL-SNCG/I protection process with APS protocol. This diagram is similar to Figure 14-15 but includes an 'APS' (Automatic Protection Switching) protocol. A box labeled 'APS acceptance' is connected to the 'Control' block and the 'Selector'. The 'Control' block also receives 'dFOP-PM' and 'dFOP-NR' signals and sends 'SF' and 'SD' signals. The 'Selector' outputs 'cFOP-PM' and 'cFOP-NR' signals. A label 'G.798(12)_F14-16' is at the bottom right.](e5eedb1e90a22814f090917b3411be8f_img.jpg) - -Figure 14-16: 1+1 CL-SNCG/I protection process with APS protocol. This diagram is similar to Figure 14-15 but includes an 'APS' (Automatic Protection Switching) protocol. A box labeled 'APS acceptance' is connected to the 'Control' block and the 'Selector'. The 'Control' block also receives 'dFOP-PM' and 'dFOP-NR' signals and sends 'SF' and 'SD' signals. The 'Selector' outputs 'cFOP-PM' and 'cFOP-NR' signals. A label 'G.798(12)\_F14-16' is at the bottom right. - -**Figure 14-16 – 1+1 CL-SNCG/I protection process with APS protocol** - -![Figure 14-17: 1:1 CL-SNCG/I protection process with APS protocol. The diagram shows a 'Broadcast bridge' instead of a 'Permanent bridge'. The 'Broadcast bridge' receives 'Normal ODUj_CPs' and outputs 'Working ODUj_CPs' and 'Protection ODUj_CPs'. The 'Control' block and 'APS acceptance' box are present, along with 'dFOP-PM', 'dFOP-NR', 'SF', 'SD', and 'APS' signals. The 'Selector' outputs 'cFOP-PM' and 'cFOP-NR' signals. A label 'G.798(12)_F14-17' is at the bottom right.](48090d8f1db2e826aaa740035aa12ecb_img.jpg) - -Figure 14-17: 1:1 CL-SNCG/I protection process with APS protocol. The diagram shows a 'Broadcast bridge' instead of a 'Permanent bridge'. The 'Broadcast bridge' receives 'Normal ODUj\_CPs' and outputs 'Working ODUj\_CPs' and 'Protection ODUj\_CPs'. The 'Control' block and 'APS acceptance' box are present, along with 'dFOP-PM', 'dFOP-NR', 'SF', 'SD', and 'APS' signals. The 'Selector' outputs 'cFOP-PM' and 'cFOP-NR' signals. A label 'G.798(12)\_F14-17' is at the bottom right. - -**Figure 14-17 – 1:1 CL-SNCG/I protection process with APS protocol** - -MI\_ProtType configures the protection type as defined in clause 9.4 of [ITU-T G.873.1]. - -NOTE 2 – Only a subset or a single protection type can be supported. In the latter case, the configuration is not needed. - -MI\_OperType is configured between revertive and non-revertive operation as defined in clause 8.3 of [ITU-T G.873.1]. - -NOTE 3 – Only a single operation type can be supported. In this case configuration is not needed. - -MI\_HoTime configures the hold-off time as defined in clause 9.12 of [ITU-T G.873.1]. - -MI\_WTR configures the wait to restore (WTR) time as defined in clause 15 of [ITU-T G.808.1]. - -MI\_ExtCMD configures the protection group command as defined in clause 7 of [ITU-T G.873.1]. - -If MI\_SDEnable is true, the TSD signal is used as a trigger for protection. If it is false, TSD is not used as a trigger for protection. It applies to all working and the protection signals in common. - -##### *Protection switching performance* - -See clause 6.2 of [ITU-T G.873.1]. - -##### **Defects** - -The function shall detect dFOP-PM and dFOP-NR defects in case the APS protocol is used. - -**dFOP-PM:** See clause 6.2.7.1.1. - -**dFOP-NR:** See clause 6.2.7.1.2. - -**Consequent actions:** None. - -##### **Defect correlations** - -cFOP-PM $\leftarrow$ dFOP-PM and (not CI\_TSF) - -cFOP-NR $\leftarrow$ dFOP-NR and (not CI\_TSF) - -##### **Performance monitoring:** - -None. - -#### **14.1.1.3 Shared ODU ring protection process** - -NOTE – Two different protection architectures are defined in [ITU-T G.873.2], SRP-1 and SRP-P. - -Details of the processes are for further study. - -## **14.2 Termination functions** - -### **14.2.1 ODUP trail termination function (ODUP\_TT)** - -The ODUP\_TT function terminates the path monitoring (PM) overhead of the ODU overhead to determine the status of the ODU trail. Figure 14-18 shows the combination of the unidirectional sink and source functions to form a bidirectional function. - -![Diagram of ODUP_TT function showing two pairs of ODU functions. The left pair consists of two ODUkP triangles. The left triangle has an input ODUPk_AP at the top and an output ODUPk_TCP at the bottom. The right triangle has an output ODUPk_AP at the top and an input ODUPk_TCP at the bottom. A horizontal arrow labeled ODUPk_RP points from the right triangle to the left triangle. The right pair consists of two ODUCnP triangles. The left triangle has an input ODUCnP_AP at the top and an output ODUCnP_TCP at the bottom. The right triangle has an output ODUCnP_AP at the top and an input ODUCnP_TCP at the bottom. A horizontal arrow labeled ODUCnP_RP points from the right triangle to the left triangle. A small text 'G.798(17)_F14-18' is at the bottom right.](55c1c9a102f0828aa242f4e934dbcac5_img.jpg) - -G.798(17)\_F14-18 - -Diagram of ODUP\_TT function showing two pairs of ODU functions. The left pair consists of two ODUkP triangles. The left triangle has an input ODUPk\_AP at the top and an output ODUPk\_TCP at the bottom. The right triangle has an output ODUPk\_AP at the top and an input ODUPk\_TCP at the bottom. A horizontal arrow labeled ODUPk\_RP points from the right triangle to the left triangle. The right pair consists of two ODUCnP triangles. The left triangle has an input ODUCnP\_AP at the top and an output ODUCnP\_TCP at the bottom. The right triangle has an output ODUCnP\_AP at the top and an input ODUCnP\_TCP at the bottom. A horizontal arrow labeled ODUCnP\_RP points from the right triangle to the left triangle. A small text 'G.798(17)\_F14-18' is at the bottom right. - -**Figure 14-18 – ODUP\_TT** - -#### 14.2.1.1 ODUP trail termination source function (ODUP\_TT\_So) - -The ODUP\_TT\_So function computes the BIP-8[1..n] and adds path monitoring overhead (PMOH) – including the TTI, BIP-8[1..n], DMp, BDI and BEI[1..n] signals – in the PM overhead field to the ODU signal at its ODUP\_AP. The ODUCn signal has n PM overhead fields; the ODUk signal has one (n=1) PM overhead field. - -The information flow and processing of the ODUP\_TT\_So function is defined with reference to Figures 14-19 and 14-20. - -##### Symbol - -![Figure 14-19 – ODUP_TT_So function. The diagram shows two functional blocks, ODUkP and ODUCnP, each represented by a downward-pointing triangle. For the ODUkP block, the input ODUP_AP enters from the top, and two other inputs, ODUPk_TT_So_MP and ODUPk_RP, enter from the left and right respectively. The output is ODUPk_TCP exiting from the bottom. The ODUCnP block follows the same structure but with 'n' subscripts on the signals. A label 'G.798(17)_F14-19' is present in the bottom right corner of the diagram area.](3d590ad29ecfe728f07432e6fcb59064_img.jpg) - -Figure 14-19 – ODUP\_TT\_So function. The diagram shows two functional blocks, ODUkP and ODUCnP, each represented by a downward-pointing triangle. For the ODUkP block, the input ODUP\_AP enters from the top, and two other inputs, ODUPk\_TT\_So\_MP and ODUPk\_RP, enter from the left and right respectively. The output is ODUPk\_TCP exiting from the bottom. The ODUCnP block follows the same structure but with 'n' subscripts on the signals. A label 'G.798(17)\_F14-19' is present in the bottom right corner of the diagram area. - -Figure 14-19 – ODUP\_TT\_So function - -##### Interfaces - -Table 14-2 – ODUP\_TT\_So inputs and outputs - -| Input(s) | Output(s) | -|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------------------------| -| ODUP_AP:
ODUP_AI_CK
ODUP_AI_D
ODUP_AI_FS
ODUP_AI_MFS
ODUP_AI_RP
ODUP_AI_TSCC
ODUP_RP:
ODUP_RI_BDI
ODUP_RI_BEI[1..n]
ODUP_RI_DM
ODUP_TT_So_MP:
ODUP_TT_So_MI_TxTI
ODUP_TT_So_MI_DM_Source
ODUP_TT_So_MI_DMValue | ODU_TCP:
ODU_CI_CK
ODU_CI_D
ODU_CI_FS
ODU_CI_MFS
ODU_CI_RP
ODU_CI_TSCC | - -##### Processes - -The processes associated with the ODUP\_TT\_So function are as depicted in Figure 14-20. - -**PMOH-TTI:** The trail trace identifier is inserted in the TTI byte position of the PM field in the first ODU overhead instance. Its value is derived from reference point ODUP\_TT\_So\_MP. The trail trace format is described in clause 15.2 of [ITU-T G.709]. - -**PMOH-BDI:** The backward defect indication is inserted in the BDI bit position of the PM field in the first ODU overhead instance. Its value is derived from reference point ODUP\_RP. Upon the - -declaration/clearing of aBDI at the termination sink function, the trail termination source function shall have inserted/removed the BDI indication within 50 ms. - -**PMOH-BEI:** The number of errors indicated in RI\_BEI[i] is encoded in the BEI bits of the PM field in ODU overhead instance #i. Upon the detection of a number of errors at the termination sink function, the trail termination source function shall have inserted that value in the BEI bits within 50 ms. - -**PMOH-BIP-8:** See clause 8.3.4.1. The calculated BIP-8[i] is inserted into the BIP-8 byte of the PM field in ODU overhead instance #i. - -**PMOH-DMp:** If MI\_DM\_Source is false, then the value of the DMp bit field in the first ODU overhead instance is determined by the RI\_DM. If MI\_DM\_Source is true, then the value of the DMp field in the first ODU overhead instance bit is set to MI\_DMValue. - -NOTE – Equipment developed prior to Edition 4.0 of this Recommendation will not support the ODU DMp processing. - -![Figure 14-20 – ODUP_TT_So processes. This block diagram illustrates the internal processing of the ODUP_TT_So function. At the top, the ODUP_AP interface provides inputs: AI_D, AI_CK, AI_FS, AI_MFS, AI_RP, and CI_TSCC. AI_D is connected to a 'Compute BIP-8' block, which outputs 'BIP-8[1..n]'. This output is then processed by an 'Insert BIP-8' block. A vertical 'PMOH insertion' block on the left side of the diagram connects to several processing blocks: 'Insert BIP-8', 'Insert BEI', 'Insert BDI', 'Process/insert DMp', and 'Insert TTI'. The 'Insert BEI' block receives 'RI_BEI[1..n]' from the ODUP_RP interface. The 'Insert BDI' block receives 'RI_BDI' from the ODUP_RP interface. The 'Process/insert DMp' block receives 'RI_DM', 'MI_DM_Source', and 'MI_DMValue' from the ODUP_TT_So_MP interface. The 'Insert TTI' block receives 'MI_TxTI' from the ODUP_TT_So_MP interface. All five blocks ('Insert BIP-8', 'Insert BEI', 'Insert BDI', 'Process/insert DMp', 'Insert TTI') output to the PMOH insertion block. The PMOH insertion block then outputs to the ODUP_TCP interface, which provides outputs: CI_D, CI_CK, CI_FS, CI_MFS, CI_RP, and CI_TSCC. The diagram is labeled G.798(17)_F14-20.](9d47fe89bc71acebde670ea760ee6ffb_img.jpg) - -Figure 14-20 – ODUP\_TT\_So processes. This block diagram illustrates the internal processing of the ODUP\_TT\_So function. At the top, the ODUP\_AP interface provides inputs: AI\_D, AI\_CK, AI\_FS, AI\_MFS, AI\_RP, and CI\_TSCC. AI\_D is connected to a 'Compute BIP-8' block, which outputs 'BIP-8[1..n]'. This output is then processed by an 'Insert BIP-8' block. A vertical 'PMOH insertion' block on the left side of the diagram connects to several processing blocks: 'Insert BIP-8', 'Insert BEI', 'Insert BDI', 'Process/insert DMp', and 'Insert TTI'. The 'Insert BEI' block receives 'RI\_BEI[1..n]' from the ODUP\_RP interface. The 'Insert BDI' block receives 'RI\_BDI' from the ODUP\_RP interface. The 'Process/insert DMp' block receives 'RI\_DM', 'MI\_DM\_Source', and 'MI\_DMValue' from the ODUP\_TT\_So\_MP interface. The 'Insert TTI' block receives 'MI\_TxTI' from the ODUP\_TT\_So\_MP interface. All five blocks ('Insert BIP-8', 'Insert BEI', 'Insert BDI', 'Process/insert DMp', 'Insert TTI') output to the PMOH insertion block. The PMOH insertion block then outputs to the ODUP\_TCP interface, which provides outputs: CI\_D, CI\_CK, CI\_FS, CI\_MFS, CI\_RP, and CI\_TSCC. The diagram is labeled G.798(17)\_F14-20. - -Figure 14-20 – ODUP\_TT\_So processes - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -#### 14.2.1.2 ODUP trail termination sink function (ODUP\_TT\_Sk) - -The ODUP\_TT\_Sk function reports the state of the ODU trail (path). It computes the BIP-8[1..n], extracts path monitoring overhead (PMOH) – including the TTI, BIP-8[1..n], BDI, BEI[1..n], DMp and STAT signals – in the PM overhead fields from the ODU signal at its ODUP\_TCP, detects for AIS, OCI, LCK, TIM, DEG and BDI defects, counts during one-second periods errors (detected via the BIP-8), counts number of frames for delay measurement and defects to feed performance monitoring when connected, makes the TTI available to network management, and forwards the error - -and defect information as backward indications to the companion ODUP\_TT\_So function. The ODUCn signal has n PM overhead fields; the ODUK signal has one (n=1) PM overhead field. - -NOTE 1 – The ODUP\_TT\_Sk function extracts and processes the PM overhead irrespective of the presence of one or more levels of tandem connection overhead in the TCM fields. - -The information flow and processing of the ODUP\_TT\_Sk function is defined with reference to Figures 14-21 and 14-22. - -##### Symbol - -![Figure 14-21 shows two functional block diagrams for ODUP_TT_Sk functions. The left diagram is for ODUPkP, showing inputs ODUPkP_TT_Sk_MP (left), ODUPk_TCP (bottom), and output ODUPk_AP (top) and ODUPk_RP (right). The right diagram is for ODUPnCnP, showing inputs ODUPnCnP_TT_Sk_MP (left), ODUPnCn_TCP (bottom), and output ODUPnCn_AP (top) and ODUPnCn_RP (right).](c1bf17571f9cedf76c4072121295d10e_img.jpg) - -Figure 14-21 shows two functional block diagrams for ODUP\_TT\_Sk functions. The left diagram is for ODUPkP, showing inputs ODUPkP\_TT\_Sk\_MP (left), ODUPk\_TCP (bottom), and output ODUPk\_AP (top) and ODUPk\_RP (right). The right diagram is for ODUPnCnP, showing inputs ODUPnCnP\_TT\_Sk\_MP (left), ODUPnCn\_TCP (bottom), and output ODUPnCn\_AP (top) and ODUPnCn\_RP (right). - -Figure 14-21 – ODUP\_TT\_Sk functions - -##### Interfaces - -Table 14-3 – ODUP\_TT\_Sk inputs and outputs - -| Input(s) | Output(s) | -|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| ODU_TCP:
ODU_CI_CK
ODU_CI_D
ODU_CI_FS
ODU_CI_MFS
ODU_CI_SSF
ODU_CI_RP
ODU_CI_TSCC
ODUP_TT_Sk_MP:
ODUP_TT_Sk_MI_ExSAPI
ODUP_TT_Sk_MI_ExDAPI
ODUP_TT_Sk_MI_GetAcTI
ODUP_TT_Sk_MI_TIMDetMo
ODUP_TT_Sk_MI_TIMActDis
ODUP_TT_Sk_MI_DEGThr
ODUP_TT_Sk_MI_DEGM
ODUP_TT_Sk_MI_1second
ODUP_TT_Sk_MI_DM_Source
ODUP_TT_Sk_MI_DMValue | ODUP_AP:
ODUP_AI_CK
ODUP_AI_D
ODUP_AI_FS
ODUP_AI_MFS
ODUP_AI_TSF
ODUP_AI_TSD
ODUP_AI_RP
ODUP_AI_TSCC
ODUP_RP:
ODUP_RI_BDI
ODUP_RI_BEI[1..n]
ODUP_RI_DM
ODUP_TT_Sk_MP:
ODUP_TT_Sk_MI_AcTI
ODUP_TT_Sk_MI_cOCI (Note)
ODUP_TT_Sk_MI_cLCK
ODUP_TT_Sk_MI_cTIM
ODUP_TT_Sk_MI_cDEG
ODUP_TT_Sk_MI_cBDI
ODUP_TT_Sk_MI_cSSF
ODUP_TT_Sk_MI_pN_EBC
ODUP_TT_Sk_MI_pN_DS
ODUP_TT_Sk_MI_pF_EBC
ODUP_TT_Sk_MI_pF_DS
ODUP_TT_Sk_MI_pN_delay | -| NOTE – For ODUPkP_TT_Sk only. | | - -##### Processes - -The processes associated with the ODUP\_TT\_Sk function are as depicted in Figure 14-22. - -**PMOH-BIP-8:** See clause 8.3.4.2. The BIP-8[1..n] is extracted from the BIP-8 byte of the PM fields in the n PM overhead instances of the ODU signal at the ODU\_TCP. - -**PMOH-TTI:** The trail trace identifier shall be recovered from the TTI byte position of the PM field in the first ODU overhead instance of the ODU signal at the ODU\_TCP and processed as specified in clause 8.6. The accepted value of the TTI is available at the MP (MI\_AcTI). - -**PMOH-BDI:** The backward defect indication shall be recovered from the BDI bit position of the PM field in the first ODU overhead instance of the ODU signal at the ODU\_TCP. It shall be used for BDI defect detection. - -**PMOH-BEI:** The BEI[1..n] shall be recovered from the BEI bits in the PM fields of the n PM overhead instances in the ODU signal at the ODU\_TCP. It shall be used to determine if a far-end errored block (nF\_B) has occurred. One nF\_B has occurred per BEI[i] value between 1 [0001] and 8 [1000]; otherwise, no nF\_B has occurred. - -**PMOH-DMp:** If MI\_DM\_Source is false, then the value of the incoming DMp bit (RxDMp) is output to RI\_DM. If MI\_DM\_Source is true and MI\_DMValue toggles, then a count of CI\_FS transitions is started and the RxDMp value is monitored. A change of value of RxDMp, from (NOT MI\_DMValue) to MI\_DMValue, validated by a 3-frame persistency check, stops the counting. The delay frame count (nN\_delay) is represented by the count minus the persistency check. - -NOTE 3 – Equipment developed prior to Edition 4.0 of this Recommendation will not support the DMp processing. - -**PMOH-STAT:** The status information shall be recovered from the STAT bits in the PM field of the first ODU overhead instance in the ODU signal at the ODU\_TCP as defined in clause 8.8. It shall be used for AIS, OCI and LCK defect detection. - -![Figure 14-22 – ODUP_TT_Sk processes. A block diagram showing the internal processes of an ODUP_TT_Sk (Optical Data Unit Path - Tandem Termination) node. The diagram is divided into three main horizontal sections: ODUP_AP (top), ODUP_TT_Sk_MP (middle), and ODUP_TCP (bottom). The ODUP_AP section contains 'Consequent actions' which receive inputs from AI_TSD (aTSD), AI_TSF (aTSF), AI_FSF (CI_FSF), AI_MFS (CI_MFS), AI_CK (CI_CK), and AI_D (CI_D). It outputs RI_BEI[1..n] (nBIPV[1..n]), RI_DM (RxDMp), and RI_BDI. The ODUP_TT_Sk_MP section contains several processing blocks: 'Process TTI' (receiving MI_TIMActDis, MI_ExSAPI, MI_ExDAPI, MI_TIMDetMo, MI_GetAcTI, MI_AcTI and outputting dTIM, RxTI), 'Defect correlation' (receiving dTIM, dDEG, dBDI, dLCK, dOCI, dAIS, CI_SSF and outputting MI_cTIM, MI_cDEG, MI_cBDI, MI_cLCK, MI_cOCI, MI_cSSF), 'Process DMP' (receiving MI_DM_Source, MI_DMValue, nN_delay, RxDMp and outputting dBDI), 'Performance monitoring' (receiving nN_delay, dBDI, nF_B, aTSF and outputting MI_pN_Delay, MI_1second, MI_pF_DS, MI_pF_EBC, MI_pN_DS, MI_pN_EBC), and 'Process errors' (receiving MI_DEGThr, MI_DEGM and outputting dDEG). There are also 'Extract' blocks: 'Extract TTI', 'Extract STAT' (receiving dLCK, dOCI, dAIS), 'Extract DMp' (receiving RxDMp), 'Extract BDI' (receiving dBDI), 'Extract BEI' (receiving nF_B), 'Extract BIP-8' (receiving nBIPV[1..n]), and 'Compute BIP-8' (receiving nN_B). A vertical 'PMOH access' block on the right connects to several 'Extract' blocks. The ODUP_TCP section contains 'Compare' (receiving nN_B, nBIPV[1..n] and outputting dBDI). Various other signals like AI_TSCC, AI_RP, AI_FS are shown at the top and bottom. Reference G.798(23)_F14-22 is at the bottom right.](f512ae9c630f2fb53197fa77a1bda0e8_img.jpg) - -Figure 14-22 – ODUP\_TT\_Sk processes. A block diagram showing the internal processes of an ODUP\_TT\_Sk (Optical Data Unit Path - Tandem Termination) node. The diagram is divided into three main horizontal sections: ODUP\_AP (top), ODUP\_TT\_Sk\_MP (middle), and ODUP\_TCP (bottom). The ODUP\_AP section contains 'Consequent actions' which receive inputs from AI\_TSD (aTSD), AI\_TSF (aTSF), AI\_FSF (CI\_FSF), AI\_MFS (CI\_MFS), AI\_CK (CI\_CK), and AI\_D (CI\_D). It outputs RI\_BEI[1..n] (nBIPV[1..n]), RI\_DM (RxDMp), and RI\_BDI. The ODUP\_TT\_Sk\_MP section contains several processing blocks: 'Process TTI' (receiving MI\_TIMActDis, MI\_ExSAPI, MI\_ExDAPI, MI\_TIMDetMo, MI\_GetAcTI, MI\_AcTI and outputting dTIM, RxTI), 'Defect correlation' (receiving dTIM, dDEG, dBDI, dLCK, dOCI, dAIS, CI\_SSF and outputting MI\_cTIM, MI\_cDEG, MI\_cBDI, MI\_cLCK, MI\_cOCI, MI\_cSSF), 'Process DMP' (receiving MI\_DM\_Source, MI\_DMValue, nN\_delay, RxDMp and outputting dBDI), 'Performance monitoring' (receiving nN\_delay, dBDI, nF\_B, aTSF and outputting MI\_pN\_Delay, MI\_1second, MI\_pF\_DS, MI\_pF\_EBC, MI\_pN\_DS, MI\_pN\_EBC), and 'Process errors' (receiving MI\_DEGThr, MI\_DEGM and outputting dDEG). There are also 'Extract' blocks: 'Extract TTI', 'Extract STAT' (receiving dLCK, dOCI, dAIS), 'Extract DMp' (receiving RxDMp), 'Extract BDI' (receiving dBDI), 'Extract BEI' (receiving nF\_B), 'Extract BIP-8' (receiving nBIPV[1..n]), and 'Compute BIP-8' (receiving nN\_B). A vertical 'PMOH access' block on the right connects to several 'Extract' blocks. The ODUP\_TCP section contains 'Compare' (receiving nN\_B, nBIPV[1..n] and outputting dBDI). Various other signals like AI\_TSCC, AI\_RP, AI\_FS are shown at the top and bottom. Reference G.798(23)\_F14-22 is at the bottom right. - -Figure 14-22 – ODUP\_TT\_Sk processes - -##### Defects - -The function shall detect dAIS, dOCI, dLCK, dTIM, dDEG and dBDI defects. - -**dAIS:** See clause 6.2.6.3.2. - -**dOCI:** For ODUkP, see clause 6.2.6.8.2; dOCI shall be set to false during CI\_SSF. For ODUCnP dOCI shall be assumed false. - -**dLCK:** See clause 6.2.6.9.1; dLCK shall be set to false during CI\_SSF. - -**dTIM:** See clause 6.2.2.1; dTIM shall be set to false during CI\_SSF. - -**dDEG:** See clause 6.2.3.4. - -**dBDI:** See clause 6.2.6.6.1; dBDI shall be set to false during CI\_SSF. - -##### Consequent actions - -The function shall perform the following consequent actions: - -$$\text{aBDI} \leftarrow \text{CI\_SSF or dAIS or dOCI or dLCK or dTIM}$$ -$$\text{aTSF} \leftarrow \text{CI\_SSF or dAIS or dOCI or dLCK or (dTIM and (not TIMActDis))}$$ -$$\text{aTSD} \leftarrow \text{dDEG}$$ - -For each PM overhead instance #i: - -$$\text{aBEI}[i] \leftarrow \text{nBIPV}[i]$$ - -##### Defect correlations - -The function shall perform the following defect correlations to determine the most probable fault cause (see clause 6.4 of [ITU-T G.806]). This fault cause shall be reported to the EMF. - -$$\text{cOCI} \leftarrow \text{dOCI and (not CI\_SSF)}$$ -$$\text{cLCK} \leftarrow \text{dLCK and (not CI\_SSF)}$$ -$$\text{cTIM} \leftarrow \text{dTIM and (not CI\_SSF) and (not dAIS) and (not dOCI) and (not dLCK)}$$ -$$\text{cDEG} \leftarrow \text{dDEG and (not CI\_SSF) and (not dAIS) and (not dOCI) and (not dLCK) and (not (dTIM and (not TIMActDis)))}$$ -$$\text{cBDI} \leftarrow \text{dBDI and (not CI\_SSF) and (not dAIS) and (not dOCI) and (not dLCK) and (not (dTIM and (not TIMActDis)))}$$ -$$\text{cSSF} \leftarrow \text{CI\_SSF or dAIS}$$ - -##### Performance monitoring - -The function shall perform the following performance monitoring primitives processing (see clause 6.5 of [ITU-T G.806]). The performance monitoring primitives shall be reported to the EMF. - -$$\text{pN\_DS} \leftarrow \text{CI\_SSF or dAIS or dOCI or dLCK or dTIM}$$ -$$\text{pF\_DS} \leftarrow \text{dBDI}$$ -$$\text{pN\_EBC} \leftarrow \sum \text{nN\_B}$$ - -NOTE 4 – During CI\_SSF, dAIS, dLCK and dOCI, no errored blocks shall be counted. - -$$\text{pF\_EBC} \leftarrow \sum \text{nF\_B}$$ - -NOTE 5 – During CI\_SSF, dAIS, dLCK and dOCI, no errored blocks shall be counted. - -$$\text{pN\_delay} \leftarrow \text{nN\_delay}$$ - -NOTE 6 – This count is triggered by the ODUP\_TT\_Sk\_MI\_DMValue toggle event, which is equal to the ODUP\_TT\_So\_MI\_DMValue toggle event. - -NOTE 7 – This value is a snapshot value. - -NOTE 8 – This value is invalid if a STAT field indicating AIS, OCI, LCK, LTC, or BDI is received during the measurement. - -### 14.2.2 ODUP non-intrusive monitor function - -As the functionality of the ODUP non-intrusive monitor function is identical to the ODUP\_TT\_Sk function (see clause 14.2.1.2), no dedicated ODUP non-intrusive monitoring function ODUPm\_TT\_Sk is defined. For ODUP non-intrusive monitoring, the ODUP\_TT\_Sk function is connected to the ODU\_CP as shown in Figure 14-23. The ODUP\_TT\_Sk function can be connected to any ODU\_CP in this manner. - -The unused outputs (e.g., ODU\_RI, ODU\_AI\_CK/D/FS/MFS) are left open. The TSF and TSD outputs of an ODUkP non-intrusive monitor can be connected to an ODU\_C connection function and used as protection switching trigger criteria for SNC/N protection; for an ODUCnP non-intrusive monitor the TSF and TSD output are also left open. - -![Figure 14-23: Connection of ODUP_TT_Sk function as non-intrusive monitor (examples). The diagram shows two examples of ODU_C connection functions. The left example shows an ODU_C connected to multiple ODUkP and ODUkT components, with ODUkP non-intrusive monitors connected to the ODU_C and receiving TSF and TSD signals. The right example shows an ODUCnP connected to multiple ODUCnT components, with ODUCnP non-intrusive monitors connected to the ODUCnP.](61474739fd197587cfea52af9b6a3885_img.jpg) - -Figure 14-23: Connection of ODUP\_TT\_Sk function as non-intrusive monitor (examples). The diagram shows two examples of ODU\_C connection functions. The left example shows an ODU\_C connected to multiple ODUkP and ODUkT components, with ODUkP non-intrusive monitors connected to the ODU\_C and receiving TSF and TSD signals. The right example shows an ODUCnP connected to multiple ODUCnT components, with ODUCnP non-intrusive monitors connected to the ODUCnP. - -G.798(17)\_F14-23 - -**Figure 14-23 – Connection of ODUP\_TT\_Sk function as non-intrusive monitor (examples)** - -## 14.3 Adaptation functions - -### 14.3.1 ODUkP to CBRx adaptation function using AMP and BMP (ODUkP/CBRx\_A) - -The ODUkP to CBRx adaptation functions perform the adaptation between the ODUkP ( $k = 1, 2, 2e, 3, \text{flex}$ ) layer adapted information and the characteristic information of a CBRx signal. Parameter $x$ defines the bit rate or bit-rate range of the CBR signal. The $x$ values are listed in Tables 14-4 and 14-5. Support for other bit rates and bit-rate ranges are for further study. - -**Table 14-4 – Defined values for $x$ for bit synchronous mapping** - -| $x$ | Bit rate | Clock range | -|--------------------------|---------------------------------------------------------------|--------------------------------------------------------------------| -| 2G5 | 2 488 320 kbit/s $\pm 20$ ppm | 2 488 320 kHz $\pm 20$ ppm | -| 10G | 9 953 280 kbit/s $\pm 20$ ppm | 9 953 280 kHz $\pm 20$ ppm | -| 10G3 | 10 312 500 kbit/s $\pm 100$ ppm | 10 312 500 kHz $\pm 100$ ppm | -| 40G | 39 813 120 kbit/s $\pm 20$ ppm | 39 813 120 kHz $\pm 20$ ppm | -| Any other rate above 2G5 | Client rate with a tolerance up to a maximum of $\pm 100$ ppm | Client frequency with a tolerance up to a maximum of $\pm 100$ ppm | - -**Table 14-5 – Defined values for x for asynchronous mapping** - -| x | Bit rate | Clock range | -|------------|--------------------------------|-----------------------------| -| 2G5 | 2 488 320 kbit/s $\pm$ 20 ppm | 2 488 320 kHz $\pm$ 20 ppm | -| 2G5 (Note) | 2 488 320 kbit/s $\pm$ 32 ppm | 2 488 320 kHz $\pm$ 32 ppm | -| 10G | 9 953 280 kbit/s $\pm$ 20 ppm | 9 953 280 kHz $\pm$ 20 ppm | -| 10G (Note) | 9 953 280 kbit/s $\pm$ 32 ppm | 9 953 280 kHz $\pm$ 32 ppm | -| 40G | 39 813 120 kbit/s $\pm$ 20 ppm | 39 813 120 kHz $\pm$ 20 ppm | - -NOTE – The 2G5 and 10G signals with 32 ppm tolerance represent the CM-GPON and CM-XGPON signals. - -Two different source functions are defined. The ODUkP/CBRx-a\_A\_So provides asynchronous mapping, while the ODUkP/CBRx-b\_A\_So provides bit synchronous mapping. In the sink direction, the ODUkP/CBRx\_A\_Sk can handle both (bit synchronous and asynchronous) mappings. - -#### **14.3.1.1 ODUkP to CBRx asynchronous mapping adaptation source function (ODUkP/CBRx-a\_A\_So) (x = 2G5, 10G, 40G)** - -The ODUkP/CBRx-a\_A\_So function creates the ODUk signal from a free-running clock. It asynchronously maps the $4^{(k-1)} \times 2\,488\,320$ kbit/s constant bit-rate client signal from the CBRx\_CP into the payload of the OPUk (k = 1, 2, 3), adds OPUk overhead (RES, PT, JC) and default ODUk overhead. - -The information flow and processing of the ODUkP/CBRx-a\_A\_So function are defined with reference to Figures 14-24 and 14-25. - -##### **Symbol** - -![Block diagram of the ODUkP/CBRx-a_A_So function. An input labeled CBRx_CP enters a trapezoidal block labeled ODUkP/CBRx-a. The input is associated with x = 2G5, 10G, 40G. The output is labeled ODUkP_AP and is associated with k = 1, 2, 3. A reference code G.798(17)_F14-24 is shown below the diagram.](48fecf94dd9fb955caddbf2fb01b7b9b_img.jpg) - -Block diagram of the ODUkP/CBRx-a\_A\_So function. An input labeled CBRx\_CP enters a trapezoidal block labeled ODUkP/CBRx-a. The input is associated with x = 2G5, 10G, 40G. The output is labeled ODUkP\_AP and is associated with k = 1, 2, 3. A reference code G.798(17)\_F14-24 is shown below the diagram. - -**Figure 14-24 – ODUkP/CBRx-a\_A\_So function** - -##### **Interfaces** - -**Table 14-6 – ODUkP/CBRx-a\_A\_So inputs and outputs** - -| Input(s) | Output(s) | -|-----------------------------------------------------------|------------------------------------------------------------------------------| -| CBRx_CP:
CBRx_CI_CK
CBRx_CI_D
CBRx_CI_SSF | ODUkP_AP:
ODUkP_AI_CK
ODUkP_AI_D
ODUkP_AI_FS
ODUkP_AI_MFS | - -##### Processes - -- **Clock and (multi)frame start signal generation:** The function shall generate a local ODUk clock (ODUKP\_AI\_CK) of $(239/(239 - k)) \times 4^{(k-1)} \times 2\,488\,320\text{ kHz} \pm 20\text{ ppm}$ from a free-running oscillator. The clock parameters, including jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCa clock), apply. - -The function shall generate the (multi)frame start reference signals AI\_FS and AI\_MFS for the ODUk signal. The AI\_FS signal shall be active once per 122 368 clock cycles. AI\_MFS shall be active once every 256 frames. - -- **Mapping, frequency justification and bit rate adaptation:** The function shall provide an elastic store (buffer) process. The data signal CBRx\_CI shall be written into the buffer under the control of the associated input clock. The data shall be read out of the buffer and written onto the D and N/PJO bytes in the OPUk frame under the control of the ODUk clock and justification decisions as defined in clause 17.1 of [ITU-T G.709]. - -A justification decision shall be performed each frame. Each justification decision results in a corresponding positive, negative or no justification action. Upon a positive justification action, the reading of one data byte out of the buffer shall be cancelled once. No CBRx data shall be written onto the PJO and NJO byte. Upon a negative justification action, one extra data byte shall be read once out of the buffer. CBRx data shall be written onto the PJO and NJO byte. If neither a positive nor a negative justification action is to be performed, CBRx data shall be written onto the PJO byte and no CBRx data shall be written onto the NJO byte. - -The justification decisions determine the phase error introduced by the function. - -*Buffer size:* In the presence of jitter as specified by [ITU-T G.825] and a frequency within the range $4^{(k-1)} \times 2\,488\,320\text{ kHz} \pm 20\text{ ppm}$ , this mapping process shall not introduce any errors. The maximum buffer hysteresis, and therefore the maximum phase error introduced, shall be as listed in Table 14-7. - -**Table 14-7 – Maximum buffer hysteresis** - -| Mapping | Maximum buffer hysteresis | -|------------|---------------------------| -| 2G5 → ODU1 | 2 bytes | -| 10G → ODU2 | 8 bytes | -| 40G → ODU3 | 32 bytes | - -- **JC bits:** The function shall generate the justification control (JC) bits based on the justification decision performed in the current frame according to the specification in clause 17.1 of [ITU-T G.709]. It shall insert the justification control bits in the appropriate JC bit positions in the JC bytes of the current frame. -- **PT:** The function shall insert code "0000 0010" into the PT byte position of the PSI overhead as defined in clause 15.9.2.1 of [ITU-T G.709]. - - **RES:** The function shall insert all-ZEROs into the RES bytes and reserved bits within the JC bytes. - - **CSF:** The function shall signal the failure of the client signal to the far end by use of Bit 1 of the PSI[2] byte of the payload structure identifier as defined in clause 17.1 of [ITU-T G.709]. - -All other bits of the ODUk overhead should be sourced as "0"s, except the PMOH STAT field which should be set to the value "normal path signal" (001). - -NOTE – Equipment developed prior to Edition 4.0 of this Recommendation will not support the CSF processing. - -![Figure 14-25 – ODUkP/CBRx-a_A_So processes. This block diagram illustrates the internal architecture of the ODUkP/CBRx-a_A_So adaptation function. At the top, the CBRx_CP input provides three signals: CI_D (data), CI_CK (clock), and CI_SSF (synchronization signal). CI_D and CI_CK are fed into an 'Elastic store' block, which has write (WR) and read (RD) ports. The Elastic store's output is connected to a 'Justification control and JC generation' block. This block also receives CI_SSF and generates a Justification Control (JC) signal back to the Elastic store. The Justification control block outputs a 'Free-running clock generator (ODCa)' signal labeled CK. The CK signal is divided by 122368 to produce a Frequency Synchronization (FS) signal, which is further divided by 256 to produce a Master Frequency Synchronization (MFS) signal. The Elastic store's output is also processed by a series of blocks: 'Insert PT', 'Insert CSF' (which also receives CI_SSF), 'Insert RES', and a block stating 'ODUk OH is set to all-0's, except PM STAT = 001'. The final output of these blocks is the ODUkP_AP signal, which consists of AI_D (data), AI_CK (clock), AI_FS (frequency synchronization), and AI_MFS (master frequency synchronization). The diagram is labeled G.798(17)_F14-25.](5cc9a312ebe733ae244e3b93cfea67e1_img.jpg) - -Figure 14-25 – ODUkP/CBRx-a\_A\_So processes. This block diagram illustrates the internal architecture of the ODUkP/CBRx-a\_A\_So adaptation function. At the top, the CBRx\_CP input provides three signals: CI\_D (data), CI\_CK (clock), and CI\_SSF (synchronization signal). CI\_D and CI\_CK are fed into an 'Elastic store' block, which has write (WR) and read (RD) ports. The Elastic store's output is connected to a 'Justification control and JC generation' block. This block also receives CI\_SSF and generates a Justification Control (JC) signal back to the Elastic store. The Justification control block outputs a 'Free-running clock generator (ODCa)' signal labeled CK. The CK signal is divided by 122368 to produce a Frequency Synchronization (FS) signal, which is further divided by 256 to produce a Master Frequency Synchronization (MFS) signal. The Elastic store's output is also processed by a series of blocks: 'Insert PT', 'Insert CSF' (which also receives CI\_SSF), 'Insert RES', and a block stating 'ODUk OH is set to all-0's, except PM STAT = 001'. The final output of these blocks is the ODUkP\_AP signal, which consists of AI\_D (data), AI\_CK (clock), AI\_FS (frequency synchronization), and AI\_MFS (master frequency synchronization). The diagram is labeled G.798(17)\_F14-25. - -**Figure 14-25 – ODUkP/CBRx-a\_A\_So processes** - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -#### **14.3.1.2 ODUkP to CBRx bit synchronous mapping adaptation source function (ODUkP/CBRx-b\_A\_So)** - -The ODUkP/CBRx-b\_A\_So function creates the ODUk signal from a clock, derived from the incoming CBRx\_CI clock. It bit synchronously maps the $4^{(k-1)} \times 2\,488\,320\text{ kbit/s} \pm 20\text{ ppm}$ ( $k = 1, 2, 3$ ) or $10\,312\,500\text{ kbit/s} \pm 100\text{ ppm}$ ( $k = 2e$ ) or other CBR signals greater than $2\,488\,320\text{ kbit/s} \pm 100\text{ ppm}$ ( $k = \text{flex}$ ) constant bit-rate client signal from the CBRx\_CP into the payload of the OPUk ( $k = 1, 2, 2e, 3, \text{flex}$ ), adds OPUk overhead (PT, JC, RES) and default ODUk overhead. - -The information flow and processing of the ODUkP/CBRx-b\_A\_So function are defined with reference to Figures 14-26 and 14-27. - -##### Symbol - -![Symbol diagram for ODUkP/CBRx-b_A_So function. It shows an input CBRx_CP entering a trapezoidal block labeled ODUkP/CBRx-b, with an output ODUkP_AP exiting the block. The reference G.798(17)_F14-26 is noted below the block.](dc075f714892571abc5f74f1a76b80dc_img.jpg) - -G.798(17)\_F14-26 - -Symbol diagram for ODUkP/CBRx-b\_A\_So function. It shows an input CBRx\_CP entering a trapezoidal block labeled ODUkP/CBRx-b, with an output ODUkP\_AP exiting the block. The reference G.798(17)\_F14-26 is noted below the block. - -**Figure 14-26 – ODUkP/CBRx-b\_A\_So function** - -##### Interfaces - -**Table 14-8 – ODUkP/CBRx-b\_A\_So inputs and outputs** - -| Input(s) | Output(s) | -|-----------------------------------------------------------|------------------------------------------------------------------------------| -| CBRx_CP:
CBRx_CI_CK
CBRx_CI_D
CBRx_CI_SSF | ODUkP_AP:
ODUkP_AI_CK
ODUkP_AI_D
ODUkP_AI_FS
ODUkP_AI_MFS | - -##### Processes - -- **Clock and (multi)frame start signal generation:** The function shall generate the ODUk (AI\_CK) clock by multiplying the incoming CBRx clock (CI\_CK) by factor as specified in Table 14-9 below. The clock parameters, including jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCb clock), apply. - -**Table 14-9 – Bit synchronous mapping parameters** - -| ODUk | Multiplication factor | CBR clock frequency | CBR client jitter specification in | -|---------|-----------------------|--------------------------------------------------------------------|------------------------------------| -| ODU1 | 239/238 | 2 488 320 kHz $\pm$ 20 ppm | [ITU-T G.825] | -| ODU2 | 239/237 | 9 953 280 kHz $\pm$ 20 ppm | [ITU-T G.825] | -| ODU2e | 239/237 | 10 312 500 kHz $\pm$ 100 ppm | [IEEE 802.3] | -| ODU3 | 239/236 | 39 813 120 kHz $\pm$ 20 ppm | [ITU-T G.825] | -| ODUflex | 239/238 | Client frequency with a tolerance up to a maximum of $\pm$ 100 ppm | Client specific | - -During failure conditions of the incoming CBR clock signal (CI\_CK), the ODUk clock shall stay within its limits as defined in [ITU-T G.8251] and no frame phase discontinuity shall be introduced. - -The function shall generate the (multi)frame start reference signals AI\_FS and AI\_MFS for the ODUk signal. The AI\_FS signal shall be active once per 122 368 clock cycles. AI\_MFS shall be active once every 256 frames. - -- **Mapping, frequency justification and bit-rate adaptation:** The function shall provide an elastic store (buffer) process. The data signal CBRx\_CI shall be written into the buffer under the control of the associated input clock. The data shall be read out of the buffer and written onto the D and PJO bytes in the OPUk frame under the control of the ODUk clock as defined in clause 17.2 of [ITU-T G.709] (k = 1, 2, 2e, 3) and clause 17.9 of [ITU-T G.709] (k = flex). - -Neither negative nor positive justification is to be performed. No data shall be written onto the NJO byte and data shall always be written onto the PJO byte. - -*Buffer size:* In the presence of jitter as specified by the relevant standard as listed in Table 14-9, this mapping process shall not introduce any errors. - -Following a step in frequency of the CI\_CK signal (for example, due to removal of AIS (generic AIS or Local Fault)), there will be a maximum recovery time of X seconds after which this process shall not generate any bit errors. The value of X is for further study; a value of 1 second has been proposed. - -- **JC bits:** The function shall generate the fixed justification control (JC) bits "00" according to clause 17.2 of [ITU-T G.709]. It shall insert the justification control bits in the appropriate JC bit positions in the JC bytes. -- **RES:** The function shall insert all-ZEROs into the RES bytes and Reserved bits within the JC bytes. - - **PT:** The function shall insert the appropriate payload type code into the PT byte position of the PSI overhead as defined in clause 15.9.2.1 of [ITU-T G.709]. - - **Client signal fail:** The function shall insert client signal fail indication CSF under the control of CBR\_CI\_SSF into Bit 1 of the PSI[2] byte of the payload structure identifier, as defined in clause 17.1 of [ITU-T G.709]. - -All other bits of the ODUk overhead should be sourced as "0"s, except the PMOH STAT field which should be set to the value "normal path signal" (001). - -NOTE – Equipment developed prior to Edition 4.0 of this Recommendation will not support the CSF processing. - -![Block diagram of ODUkP/CBRx-b_A_So processes. The diagram shows the mapping of client data (CI_D) and clock (CI_CK) into an ODUk payload. CI_D is written to an Elastic store (WR), and CI_CK is used to generate the ODU clock (ODCb). The Elastic store output (RD) is mapped into the ODUk payload. The ODUk payload is generated by inserting PT, CSF (controlled by CI_SSF), and RES bytes, and setting the ODUk OH to all-0's except for PM STAT = 001. The ODUk payload is then mapped into the AI_D, AI_CK, AI_FS, and AI_MFS signals. The diagram also shows the generation of the ODUk clock (ODCb) from the CI_CK signal, and the generation of the ODUk payload structure identifier (PSI) from the PT, CSF, and RES bytes. The ODUk payload is then mapped into the AI_D, AI_CK, AI_FS, and AI_MFS signals. The diagram is labeled CBRx_CP at the top and ODUkP_AP at the bottom. The text G.798(17)_F14-27 is in the bottom right corner.](33859177822cce0c1b03fd3d37de14f6_img.jpg) - -Block diagram of ODUkP/CBRx-b\_A\_So processes. The diagram shows the mapping of client data (CI\_D) and clock (CI\_CK) into an ODUk payload. CI\_D is written to an Elastic store (WR), and CI\_CK is used to generate the ODU clock (ODCb). The Elastic store output (RD) is mapped into the ODUk payload. The ODUk payload is generated by inserting PT, CSF (controlled by CI\_SSF), and RES bytes, and setting the ODUk OH to all-0's except for PM STAT = 001. The ODUk payload is then mapped into the AI\_D, AI\_CK, AI\_FS, and AI\_MFS signals. The diagram also shows the generation of the ODUk clock (ODCb) from the CI\_CK signal, and the generation of the ODUk payload structure identifier (PSI) from the PT, CSF, and RES bytes. The ODUk payload is then mapped into the AI\_D, AI\_CK, AI\_FS, and AI\_MFS signals. The diagram is labeled CBRx\_CP at the top and ODUkP\_AP at the bottom. The text G.798(17)\_F14-27 is in the bottom right corner. - -Figure 14-27 – ODUkP/CBRx-b\_A\_So processes - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -#### 14.3.1.3 ODUkP to CBRx adaptation sink function (ODUkP/CBRx\_A\_Sk) - -The ODUkP/CBRx\_A\_Sk recovers the constant bit-rate client signal from the OPUk payload using the justification control information (JC overhead) to determine if a data or stuff byte is present within the NJO and PJO bytes. It extracts the OPUk overhead (PT, JC, and RES) and monitors the reception of the correct payload type. Under signal fail condition, generic-AIS shall be generated. - -The information flow and processing of the ODUkP/CBRx\_A\_Sk function are defined with reference to Figures 14-28 and 14-29. - -##### Symbol - -![Symbol diagram for the ODUkP/CBRx_A_Sk function. A central trapezoidal block is labeled 'ODUkP/CBRx'. An arrow labeled 'ODUkP_AP' points into the block from the bottom. An arrow labeled 'CBRx_CP' points out of the block from the top. An arrow labeled 'ODUkP/CBRx_A_Sk_MP' points out of the block from the left. The text 'G.798(17)_F14-28' is located below the block.](0070d5ae6e586c9cfa20085d26d3eb2e_img.jpg) - -G.798(17)\_F14-28 - -Symbol diagram for the ODUkP/CBRx\_A\_Sk function. A central trapezoidal block is labeled 'ODUkP/CBRx'. An arrow labeled 'ODUkP\_AP' points into the block from the bottom. An arrow labeled 'CBRx\_CP' points out of the block from the top. An arrow labeled 'ODUkP/CBRx\_A\_Sk\_MP' points out of the block from the left. The text 'G.798(17)\_F14-28' is located below the block. - -**Figure 14-28 – ODUkP/CBRx\_A\_Sk function** - -##### Interfaces - -**Table 14-10 – ODUkP/CBRx\_A\_Sk inputs and outputs** - -| Input(s) | Output(s) | -|------------------------------------------------------------------------------|--------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| ODUkP_AP:
ODUkP_AI_CK
ODUkP_AI_D
ODUkP_AI_FS
ODUkP_AI_TSF | CBRx_CP:
CBRx_CI_CK
CBRx_CI_D
CBRx_CI_SSF
ODUkP/CBRx_A_Sk_MP:
ODUkP/CBRx_A_Sk_MI_cPLM
ODUkP/CBRx_A_Sk_MI_cCSF
ODUkP/CBRx_A_Sk_MI_AcPT | - -##### Processes - -- **PT:** The function shall extract the PT byte from the PSI overhead as defined in clause 8.7.1.1. The accepted PT value is available at the MP (MI\_AcPT) and is used for PLM defect detection. -- **RES:** The value in the RES bytes shall be ignored. -- **JC:** The function shall interpret the justification control information in the JC byte as defined in clauses 17.2 and 17.9 of [ITU-T G.709] in order to determine the justification action (positive, negative, none) for the current frame. RES bits in the JC shall be ignored. - -– **Demapping, CBR clock generation:** The function shall provide an elastic store (buffer) process. The CBR data shall be written into the buffer from the D, PJO and NJO byte in the OPUk frame. The information extraction of the PJO and NJO bytes shall be under the control of the justification control information. The CBRx data (CI\_D) shall be read out of the buffer under the control of the CBRx clock (CI\_CK). - -Upon a positive justification action, the writing of one data byte into the buffer shall be cancelled once. No CBRx data shall be read from the PJO and NJO byte. Upon a negative justification action, one extra data byte shall be written into the buffer once. CBRx data shall be read from the PJO and NJO byte. If neither a positive nor a negative justification action is to be performed, CBRx data shall be read from the PJO byte and no CBRx data shall be read from the NJO byte. - -**Client signal fail:** The function shall extract the CSF signal indicating the failure of the client signal out of the Bit 1 of the PSI[2] byte of the payload structure identifier, as defined in clause 17.1 of [ITU-T G.709]. - -*Smoothing and jitter limiting process:* The function shall provide for a clock smoothing and elastic store (buffer) process. The data signal shall be written into the buffer under the control of the associated (gapped) input clock. The data signal shall be read out of the buffer under the control of a smoothed (equally spaced) clock. The rate is determined by the signal at the input of the remote ODUkP/CBRx\_A\_So. - -The clock parameters, including jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCp clock), apply. - -*Buffer size:* In the presence of jitter as specified by the relevant standard as listed in Table 14-9, this justification process shall not introduce any errors. - -Following a step in frequency of the signal transported by the ODUkP\_AI (for example due to removal of a replacement signal with a frequency offset), there will be a maximum recovery time of X seconds after which this process shall not generate any bit errors. The value of X is for further study; a value of 1 second has been proposed. - -NOTE – Equipment developed prior to Edition 4.0 of this Recommendation will not support the CSF processing. - -![Figure 14-29 – ODUkP/CBRx_A_Sk processes. This block diagram illustrates the internal components and signal flow of the ODUkP/CBRx_A_Sk process. The process is divided into two main sections: CBRx_CP (top) and ODUkP_AP (bottom). Inputs include CI_D, CI_CK, CI_SSF, AI_D, AI_MFS, AI_CK, AI_FS, and AI_TSF. The CBRx_CP section contains a 'Replacement signal insertion' block, a 'Replacement signal generator' block, an 'Elastic store' (with WR and RD ports), a 'CBR clock generator (ODCp)' block, and a 'Consequent actions' block. The ODUkP_AP section contains 'Extract JC', 'Extract CSF', and 'Extract PT' blocks, a 'Justification action' block, a 'PT process' block, and a 'Defect correlations' block. Signal flow includes data paths from the input sections through the elastic store and extraction blocks, and control paths for clock and defect detection. Output signals include CI_D, CI_CK, CI_SSF, MI_cPLM, MI_cCSF, MI_AcPT, and ODUkP/CBRx_A_Sk_MP.](40d0aaaa3afa0a9fabe637941ca250bb_img.jpg) - -Figure 14-29 – ODUkP/CBRx\_A\_Sk processes. This block diagram illustrates the internal components and signal flow of the ODUkP/CBRx\_A\_Sk process. The process is divided into two main sections: CBRx\_CP (top) and ODUkP\_AP (bottom). Inputs include CI\_D, CI\_CK, CI\_SSF, AI\_D, AI\_MFS, AI\_CK, AI\_FS, and AI\_TSF. The CBRx\_CP section contains a 'Replacement signal insertion' block, a 'Replacement signal generator' block, an 'Elastic store' (with WR and RD ports), a 'CBR clock generator (ODCp)' block, and a 'Consequent actions' block. The ODUkP\_AP section contains 'Extract JC', 'Extract CSF', and 'Extract PT' blocks, a 'Justification action' block, a 'PT process' block, and a 'Defect correlations' block. Signal flow includes data paths from the input sections through the elastic store and extraction blocks, and control paths for clock and defect detection. Output signals include CI\_D, CI\_CK, CI\_SSF, MI\_cPLM, MI\_cCSF, MI\_AcPT, and ODUkP/CBRx\_A\_Sk\_MP. - -**Figure 14-29 – ODUkP/CBRx\_A\_Sk processes** - -##### Defects - -The function shall detect for dPLM and dCSF defects. - -- **dPLM:** See clause 6.2.4.1. The expected payload type values are defined in clause 15.9.2.1 of [ITU-T G.709]; "0000 0010" is used for asynchronous CBRx mapping, other applicable values are used for bit synchronous CBRx mapping. -- **dCSF:** See clause 6.2.10. - -##### Consequent actions - -aSSF $\leftarrow$ AI\_TSF or dPLM - -aAIS $\leftarrow$ AI\_TSF or dPLM - -On declaration of aAIS, the function shall output a replacement signal as defined in clauses 17.2 and 17.9 of [ITU-T G.709] within two frames. On clearing aAIS, the replacement pattern/signal shall be removed within two frames and normal data being output. The replacement signal clock shall be independent from the incoming clock. The replacement signal clock has to be within the range specified by Table 14-9. Jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCp clock), apply. - -##### Defect correlations - -cPLM $\leftarrow$ dPLM and (not AI\_TSF) - -cCSF $\leftarrow$ dCSF and (not dPLM) and (not AI\_TSF) - -**Performance monitoring:** None. - -### 14.3.2 Blank clause - -NOTE – This clause is intentionally left blank. - -### 14.3.3 ODU2P to 10G Ethernet Reconciliation sublayer adaptation functions (ODU2P/ERS10G\_A) - -The ODU2P to 10G Ethernet Reconciliation sublayer adaptation functions perform the adaptation between the ODU2P and the characteristic information of an ERS10G signal. - -The ERS10G characteristic information is a stream of ERS10G\_CI\_D traffic units, complemented with the ERS10G\_CI\_SSF signal. The ERS10G\_CI\_D traffic units carry either an Ethernet data frame, including the preamble, or an ordered set, as defined in clause 7.9 of [ITU-T G.704]. The ordered sets may carry local fault or remote fault indications. The ERS10G\_CP reference point is located within the reconciliation sublayer (see Figure 44-1 of [IEEE 802.3]). - -NOTE – There is no Ethernet MAC termination function in these adaptation functions. Consequently, since no error checking is performed on the Ethernet MAC frames, errored MAC frames are forwarded at both the ingress and egress to the GFP adaptation functions. - -#### 14.3.3.1 ODU2P to 10G Ethernet Reconciliation sublayer adaptation source function (ODU2P/ERS10G\_A\_So) - -The ODU2P/ERS10G\_A\_So function creates the ODU2P signal from a free running clock. It maps the ERS10G\_CI information into the extended payload of the OPU2P, adds OPU2P overhead (RES, PT) and default ODU2P overhead. - -##### Symbol - -![Symbol diagram for ODU2P/ERS10G_A_So function. It shows a trapezoidal block labeled 'ODU2P/ERS10G'. An arrow labeled 'ERS10G_CP' points into the top of the block. An arrow labeled 'ODU2P/ERS10G_A_So_MP' points into the left side of the block. An arrow labeled 'ODU2P_AP' points out from the bottom of the block. Below the block is the text 'G.798(17)-Amd.1(18)_F14-29.1'.](27c0455a3b08749fed8057467366b0ce_img.jpg) - -Symbol diagram for ODU2P/ERS10G\_A\_So function. It shows a trapezoidal block labeled 'ODU2P/ERS10G'. An arrow labeled 'ERS10G\_CP' points into the top of the block. An arrow labeled 'ODU2P/ERS10G\_A\_So\_MP' points into the left side of the block. An arrow labeled 'ODU2P\_AP' points out from the bottom of the block. Below the block is the text 'G.798(17)-Amd.1(18)\_F14-29.1'. - -**Figure 14-29.1 – ODU2P/ERS10G\_A\_So symbol** - -##### Interfaces - -**Table 14-10.1 – ODU2P/ERS10G\_A\_So interfaces** - -| Inputs | Outputs | -|---------------------------------------------------------------------------------------------------------------------|------------------------------------------------------------------------------| -| ERS10G_CP:
ERS10G_CI_D
ERS10G_CI_SSF
ODU2P/ERS10G_A_So_MP:
ODU2P/ERS10G_A_So_MI_CSFEnable | ODU2P_AP:
ODU2P_AI_D
ODU2P_AI_CK
ODU2P_AI_FS
ODU2P_AI_MFS | -| NOTE – ERS10G_CI_D is composed of preamble, payload and order set information in [ITU-T G.704]. | | - -##### Processes - -A process diagram of this function is shown in Figure 14-29.2. - -![Functional block diagram of the ODU2P/ERS10G_A_So process. The diagram is contained within a grey box labeled 'ODU2P/ERS10G_A_So_MP' on the left. At the top, inputs 'CI_D' and 'CI_SSF' enter from 'ERS10G_CP'. Inside the box, there are four stacked processing blocks: 1. 'ERS10G specific GFP-F processes' receiving 'FCSEnable = false' and 'MI_CSFenable'. 2. 'Common GFP-F processes' receiving 'CMuxConfig' and 'CMuxActive = false'. 3. 'ODU2P specific GFP-F processes'. 4. Another 'ODU2P specific GFP-F processes' block. Data flows downward between blocks via 'GFP_FS', 'GFP_Frame', 'D', 'CK', and 'FS' signals. At the bottom, outputs 'AI_D', 'AI_CK', 'AI_FS', and 'AI_MFS' exit to 'ODU2P_AP'. A reference code 'G.798(17)-Amd.1(18)_F14-29.2' is at the bottom right.](54f73f693f36dcbd300fa21ac4e410e8_img.jpg) - -Functional block diagram of the ODU2P/ERS10G\_A\_So process. The diagram is contained within a grey box labeled 'ODU2P/ERS10G\_A\_So\_MP' on the left. At the top, inputs 'CI\_D' and 'CI\_SSF' enter from 'ERS10G\_CP'. Inside the box, there are four stacked processing blocks: 1. 'ERS10G specific GFP-F processes' receiving 'FCSEnable = false' and 'MI\_CSFenable'. 2. 'Common GFP-F processes' receiving 'CMuxConfig' and 'CMuxActive = false'. 3. 'ODU2P specific GFP-F processes'. 4. Another 'ODU2P specific GFP-F processes' block. Data flows downward between blocks via 'GFP\_FS', 'GFP\_Frame', 'D', 'CK', and 'FS' signals. At the bottom, outputs 'AI\_D', 'AI\_CK', 'AI\_FS', and 'AI\_MFS' exit to 'ODU2P\_AP'. A reference code 'G.798(17)-Amd.1(18)\_F14-29.2' is at the bottom right. - -**Figure 14-29.2 – ODU2P/ERS10G\_A\_So process** - -###### *Ethernet specific GFP-F source process:* - -The Ethernet frames are inserted into the client payload information field of the GFP-F frames according to clause 7.9.2 of [ITU-T G.7041]. - -The UPI values for frame-mapped Ethernet shall be inserted for data or ordered sets respectively (Table 6-3 of [ITU-T G.7041]). The rest of the fields except the UPI field in the type header are static as: - -- PTI = 000 (Client data) -- PFI = 0 (No FCS) -- EXI = 0000 (Null extension header) - -GFP client management frames (PTI = 100) are inserted if CI\_SSF is input and GFP pFCS generation is disabled (FCSEnable=false). - -###### *Common GFP source process:* - -See clause 8.5.3.1 of [ITU-T G.806]. GFP channel multiplexing is not supported (CMuxActive=false). - -###### *ODU2P specific GFP source process:* - -See clause 8.5.2.1 of [ITU-T G.806]. The GFP frames are mapped into the extended ODU2 payload area according to clause 17.4.1 of [ITU-T G.709]. OPU CSF may be generated if CI\_SSF is input. - -###### *ODU2P specific source process:* - -See clause 11.5.1.1 (k=2). - -**Defects:** None. - -##### **Consequent actions** - -The function shall perform the following consequent actions: - -aCSF-LOS $\leftarrow$ CI\_SSF and CSFEnable -aCSF-OPU $\leftarrow$ CI\_SSF and CSFEnable - -**Defect correlations:** None. - -**Performance monitoring:** For further study. - -#### 14.3.3.2 ODU2P to 10G Ethernet Reconciliation Sublayer adaptation sink function (ODU2P/ERS10G\_A\_Sk) - -The ODU2P/ERS10G\_A\_Sk extracts ERS10G\_CI information from the extended ODU2P payload area, delivering ERS10G\_CI to ERS10G\_TCP. It extracts the OPU2P overhead (PT and RES) and monitors the reception of the correct payload type. - -##### Symbol - -![Symbol diagram for ODU2P/ERS10G_A_Sk. A trapezoidal block labeled 'ODU2P/ERS10G' has an input arrow from below labeled 'ODU2P_AP', an output arrow from the top labeled 'ERS10G_CP', and a bidirectional input arrow from the right labeled 'ODU2P/ERS10G_A_Sk_MP'.](675b316a907e66765fd392b545e60854_img.jpg) - -Symbol diagram for ODU2P/ERS10G\_A\_Sk. A trapezoidal block labeled 'ODU2P/ERS10G' has an input arrow from below labeled 'ODU2P\_AP', an output arrow from the top labeled 'ERS10G\_CP', and a bidirectional input arrow from the right labeled 'ODU2P/ERS10G\_A\_Sk\_MP'. - -G.798(17)-Amd.1(18)\_F14-29.3 - -**Figure 14-29.3 – ODU2P/ERS10G\_A\_Sk symbol** - -##### Interfaces - -**Table 14-10.2 – ODU2P/ERS10G\_A\_Sk interfaces** - -| Inputs | Outputs | -|-------------------------------------------------------------------------------------------------------------------------------------------------------------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| ODU2P_AP:
ODU2P_AI_D
ODU2P_AI_CK
ODU2P_AI_FS
ODU2P_AI_MFS
ODU2P_AI_TSF
ODU2P/ERS10G_A_Sk_MP:
ODU2P/ERS10G_A_Sk_MI_CSF_Reported | ERS10G_CP:
ERS10G_CI_D
ERS10G_CI_SSF
ODU2P/ERS10G_A_Sk_MP:
ODU2P/ERS10G_A_Sk_MI_AcPT
ODU2P/ERS10G_A_Sk_MI_AcEXI
ODU2P/ERS10G_A_Sk_MI_AcUPI
ODU2P/ERS10G_A_Sk_MI_cPLM
ODU2P/ERS10G_A_Sk_MI_cLFD
ODU2P/ERS10G_A_Sk_MI_cUPM
ODU2P/ERS10G_A_Sk_MI_cEXM
ODU2P/ERS10G_A_Sk_MI_cCSF | - -##### Processes - -A process diagram of this function is shown in Figure 14-29.4. - -![Figure 14-29.4 – ODU2P/ERS10G_A_Sk process diagram. The diagram shows a vertical stack of four process blocks within a grey container labeled 'ODU2P/ERS10G_A_Sk_MP'. From top to bottom: 'ERS10G specific GFP-F processes', 'Common GFP-F processes', 'ODU2P specific GFP-F processes', and 'ODU2P specific GFP-F processes'. Inputs from the bottom (ODU2P_AP) include AI_D, AI_CK, AI_FS, AI_MFS, and AI_TSF. The bottom block outputs D, CK, and FS to the block above. The third block outputs GFP_Frame/FS/SF to the second block. The second block has inputs FCSdiscard=false, CMuxConfig, and CMuxActive=false, and outputs cEXM and AcEXI. The top block outputs CI_D and CI_SSF to the top (ERS10G_CP) and has outputs AcUPI, cUPM, cCSF, and MI_CSF_Reported. A reference code G.798(17)-Amd.1(18)_F14-29.4 is at the bottom right.](10f4e3a2f3c016555ee12a5b556ba834_img.jpg) - -Figure 14-29.4 – ODU2P/ERS10G\_A\_Sk process diagram. The diagram shows a vertical stack of four process blocks within a grey container labeled 'ODU2P/ERS10G\_A\_Sk\_MP'. From top to bottom: 'ERS10G specific GFP-F processes', 'Common GFP-F processes', 'ODU2P specific GFP-F processes', and 'ODU2P specific GFP-F processes'. Inputs from the bottom (ODU2P\_AP) include AI\_D, AI\_CK, AI\_FS, AI\_MFS, and AI\_TSF. The bottom block outputs D, CK, and FS to the block above. The third block outputs GFP\_Frame/FS/SF to the second block. The second block has inputs FCSdiscard=false, CMuxConfig, and CMuxActive=false, and outputs cEXM and AcEXI. The top block outputs CI\_D and CI\_SSF to the top (ERS10G\_CP) and has outputs AcUPI, cUPM, cCSF, and MI\_CSF\_Reported. A reference code G.798(17)-Amd.1(18)\_F14-29.4 is at the bottom right. - -**Figure 14-29.4 – ODU2P/ERS10G\_A\_Sk process** - -###### *Ethernet specific GFP-F sink process:* - -The Ethernet frames are extracted from the client payload information field of the GFP-F frames according to clause 7.9 of [ITU-T G.7041]. - -See clause 8.5.4.1.2 of [ITU-T G.806]. GFP pFCS checking, GFP p\_FCSerror, p\_FDis are not supported (FCSdiscard=false). The UPI value for frame-mapped Ethernet shall be expected for data or ordered sets respectively (Table 6-3 of [ITU-T G.7041]). - -Client signal fail from GFP-F or OPU may generate LF as included ERS10G\_CI\_D. - -###### *Common GFP sink process:* - -See clause 8.5.3.2 of [ITU-T G.806]. GFP channel multiplexing is not supported (MI\_CMuxActive=false). - -###### *ODU2 specific GFP sink process:* - -See clause 8.5.2.2 of [ITU-T G.806]. The GFP frames are demapped from the extended ODU2 payload area according to clause 17.4.1 of [ITU-T G.709]. - -###### *ODU2P specific sink process:* - -See clause 11.5.1.2 (k=2). - -##### Defects - -dPLM – See clause 6.2.4.1 of [ITU-T G.798]. - -dLFD – See clause 6.2.5.2 of [ITU-T G.806]. - -dUPM – See clause 6.2.4.3 of [ITU-T G.806]. - -dEXM – See clause 6.2.4.4 of [ITU-T G.806]. - -dCSF-LOS – See clause 8.6.4.2 of [ITU-T G.8021]. - -dCSF-OPU – For further study. - -##### Consequent actions - -The function shall perform the following consequent actions: - -aSSF $\leftarrow$ AI\_TSF or dPLM or dLFD or dUPM or dEXM or dCSF-LOS - -##### Defect correlations - -The function shall perform the following defect correlations to determine the most probable fault cause (see clause 6.4 of [ITU-T G.806]). This fault cause shall be reported to the EMF. - -cPLM $\leftarrow$ dPLM and (not AI\_TSF) - -cLFD $\leftarrow$ dLFD and (not dPLM) and (not AI\_TSF) - -cUPM $\leftarrow$ dUPM and (not dEXM) and (not dPLM) and (not dLFD) and (not AI\_TSF) - -cEXM $\leftarrow$ dEXM and (not dPLM) and (not dLFD) and (not AI\_TSF) - -cCSF $\leftarrow$ (dCSF-LOS or dCSF-OPU) and (not dEXM) and (not dUPM) and (not dPLM) and (not dLFD) and (not AI\_TSF) and CSF\_Reported. - -##### Performance monitoring - -For further study. - -### 14.3.4 ODUP to NULL adaptation function (ODUP/NULL\_A) - -The ODUP to NULL adaptation functions perform the adaptation of a NULL test signal as defined in clause 17.5.1 of [ITU-T G.709] into the ODUP. The NULL signal is an all-ZEROs pattern. - -#### 14.3.4.1 ODUP to NULL adaptation source function (ODUP/NULL\_A\_So) - -The ODUP/NULL\_A\_So function creates the ODU signal from a free-running clock. It maps the NULL signal into the payload of the OPU, adds OPU overhead (RES, PT) and default ODU overhead. - -The information flow and processing of the ODUP/NULL\_A\_So function is defined with reference to Figures 14-30 and 14-31. - -##### Symbol - -![Diagram of the ODUP/NULL_A_So function symbol. It shows two identical trapezoidal blocks. The left block has an input 'ODUKP/NULL_A_So_MP' entering from the left and an output 'ODUKP_AP' exiting from the bottom. A label 'k = 0, 1, 2, 2e, 3, 4, flex' is next to the output arrow. The right block has an input 'ODUCnP/NULL_A_So_MP' entering from the left and an output 'ODUCnP_AP' exiting from the bottom. A label 'G.798(17)_F14-30' is next to the output arrow.](26c5c426f93cf66d35d87228668dac68_img.jpg) - -The diagram illustrates the symbol for the ODUP/NULL\_A\_So function. It consists of two trapezoidal blocks. The left block is labeled 'ODUKP/NULL' and has an input 'ODUKP/NULL\_A\_So\_MP' entering from the left and an output 'ODUKP\_AP' exiting from the bottom. A label 'k = 0, 1, 2, 2e, 3, 4, flex' is next to the output arrow. The right block is labeled 'ODUCnP/NULL' and has an input 'ODUCnP/NULL\_A\_So\_MP' entering from the left and an output 'ODUCnP\_AP' exiting from the bottom. A label 'G.798(17)\_F14-30' is next to the output arrow. - -Diagram of the ODUP/NULL\_A\_So function symbol. It shows two identical trapezoidal blocks. The left block has an input 'ODUKP/NULL\_A\_So\_MP' entering from the left and an output 'ODUKP\_AP' exiting from the bottom. A label 'k = 0, 1, 2, 2e, 3, 4, flex' is next to the output arrow. The right block has an input 'ODUCnP/NULL\_A\_So\_MP' entering from the left and an output 'ODUCnP\_AP' exiting from the bottom. A label 'G.798(17)\_F14-30' is next to the output arrow. - -Figure 14-30 – ODUP/NULL\_A\_So function - -##### Interfaces - -**Table 14-11 – ODUP/NULL\_A\_So inputs and outputs** - -| Input(s) | Output(s) | -|------------------------------------------------------------------------------|-------------------------------------------------------------------------| -| ODUP/NULL_A_So_MP:
ODUP/NULL_A_So_MI_Nominal_Bitrate_and_Tolerance | ODUP_AP:
ODUP_AI_CK
ODUP_AI_D
ODUP_AI_FS
ODUP_AI_MFS | - -##### Processes - -**Clock and (multi)frame start signal generation:** The function shall generate a local ODU clock (ODUP\_AI\_CK) with a clock frequency within the minimum to maximum values of the specified ODU signal as given in Table 7-2 of [ITU-T G.709] and provisioned by the MI\_Nominal\_Bitrate\_and\_Tolerance from a free-running oscillator. The jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCa clock), apply. - -The function shall generate the (multi)frame start reference signals AI\_FS and AI\_MFS for the ODU signal. The AI\_FS signal shall be active once per 122 368 clock cycles. AI\_MFS shall be active once every 256 frames. - -**Insert NULL signal:** The function shall insert an all-ZEROs pattern into the OPU payload area as defined in clause 17.5.1 of [ITU-T G.709]. - -**PT:** The function shall insert code "1111 1101" into the PT byte position of the PSI overhead as defined in clause 15.9.2.1 of [ITU-T G.709]. - -**RES:** The function shall insert all-ZEROs into the RES bytes. - -All other bits of the ODUk overhead should be sourced as "0"s, except the ODU-PM STAT field which should be set to the value "normal path signal" (001). - -![Block diagram of ODUP/NULL_A_So processes. The diagram shows the internal logic for generating various signals. A 'Free-running clock generator (ODCa)' takes 'MI_Nominal_Bitrate_and_Tolerance' as input and outputs 'CK'. 'CK' is divided by 122368 to produce 'FS' and by 256 to produce 'MFS'. 'FS' and 'MFS' are used to control an 'Insert NULL signal' block and an 'ODUk OH is set to all-0's, except PM STAT = 001' block. These blocks also output 'AI_D'. The 'Insert NULL signal' block also outputs 'Payload type (PT)' and 'RES'. All these signals (AI_D, AI_MFS, AI_FS, AI_CK) are grouped under the label 'ODUP_AP'.](2576306a75b1ca6180aa172236c1ca07_img.jpg) - -The diagram illustrates the internal processes of the ODUP/NULL\_A\_So function. At the top right, a 'Free-running clock generator (ODCa)' receives 'MI\_Nominal\_Bitrate\_and\_Tolerance' and outputs a clock signal 'CK'. This 'CK' signal is fed into two frequency dividers: one labeled '1/122368' which outputs 'FS', and another labeled '1/256' which outputs 'MFS'. The 'FS' and 'MFS' signals are connected to an 'Insert NULL signal' block and an 'ODUk OH is set to all-0's, except PM STAT = 001' block. These blocks output 'AI\_D', 'Payload type (PT)', and 'RES' signals. The 'AI\_D', 'AI\_MFS', 'AI\_FS', and 'AI\_CK' signals are grouped together at the bottom under the label 'ODUP\_AP'. The diagram is labeled 'G.798(17)\_F14-31' and has a vertical label 'ODUP/NULL\_A\_So\_MP' on the right side. - -Block diagram of ODUP/NULL\_A\_So processes. The diagram shows the internal logic for generating various signals. A 'Free-running clock generator (ODCa)' takes 'MI\_Nominal\_Bitrate\_and\_Tolerance' as input and outputs 'CK'. 'CK' is divided by 122368 to produce 'FS' and by 256 to produce 'MFS'. 'FS' and 'MFS' are used to control an 'Insert NULL signal' block and an 'ODUk OH is set to all-0's, except PM STAT = 001' block. These blocks also output 'AI\_D'. The 'Insert NULL signal' block also outputs 'Payload type (PT)' and 'RES'. All these signals (AI\_D, AI\_MFS, AI\_FS, AI\_CK) are grouped under the label 'ODUP\_AP'. - -**Figure 14-31 – ODUP/NULL\_A\_So processes** - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -#### 14.3.4.2 ODUP to NULL adaptation sink function (ODUP/NULL\_A\_Sk) - -The ODUP/NULL\_A\_Sk extracts the OPU overhead (PT and RES) and monitors the reception of the correct payload type. - -The information flow and processing of the ODUP/NULL\_A\_Sk function is defined with reference to Figures 14-32 and 14-33. - -##### Symbol - -![Diagram of ODUP/NULL_A_Sk function symbols. Two trapezoidal blocks represent the functions. The left block is labeled 'ODUKP/NULL' and has an input 'ODUKP_AP' from below and an output 'ODUKP/NULL_A_Sk_MP' to the left. Above the input is 'k = 0, 1, 2, 2e, 3, 4, flex'. The right block is labeled 'ODUCnP/NULL' and has an input 'ODUCnP_AP' from below and an output 'ODUCnP/NULL_A_Sk_MP' to the left. Below the right block is the text 'G.798(17)_F14-32'.](f98ddc2253ad41b4130f6042e77f1460_img.jpg) - -Diagram illustrating the ODUP/NULL\_A\_Sk function symbols. The left symbol shows the ODUkP/NULL function with input ODUkP\_AP and output ODUkP/NULL\_A\_Sk\_MP. The right symbol shows the ODUCnP/NULL function with input ODUCnP\_AP and output ODUCnP/NULL\_A\_Sk\_MP. The parameter k is defined as 0, 1, 2, 2e, 3, 4, flex. - -Diagram of ODUP/NULL\_A\_Sk function symbols. Two trapezoidal blocks represent the functions. The left block is labeled 'ODUKP/NULL' and has an input 'ODUKP\_AP' from below and an output 'ODUKP/NULL\_A\_Sk\_MP' to the left. Above the input is 'k = 0, 1, 2, 2e, 3, 4, flex'. The right block is labeled 'ODUCnP/NULL' and has an input 'ODUCnP\_AP' from below and an output 'ODUCnP/NULL\_A\_Sk\_MP' to the left. Below the right block is the text 'G.798(17)\_F14-32'. - -**Figure 14-32 – ODUP/NULL\_A\_Sk function** - -##### Interfaces - -**Table 14-12 – ODUP/NULL\_A\_Sk inputs and outputs** - -| Input(s) | Output(s) | -|----------------------------------------------------------------------------------------|-------------------------------------------------------------------------------| -| ODUP_AP:
ODUP_AI_CK
ODUP_AI_D
ODUP_AI_FS
ODUP_AI_MFS
ODUP_AI_TSF | ODUP/NULL_A_Sk_MP:
ODUP/NULL_A_Sk_MI_cPLM
ODUP/NULL_A_Sk_MI_AcPT | - -##### Processes - -**PT:** The function shall extract the PT byte from the PSI overhead as defined in clause 8.7.1.1. The accepted PT value is available at the MP (MI\_AcPT) and is used for PLM defect detection. - -**RES:** The value in the RES bytes shall be ignored. - -**Payload:** The value in the OPU payload area shall be ignored. - -![Figure 14-33: ODUP/NULL_A_Sk processes diagram. The diagram shows a block diagram of the ODUP/NULL_A_Sk processes. Inputs AI_D, AI_CK, AI_FS, and AI_MFS are grouped under the label ODUP_AP. These inputs feed into a block labeled 'Extract PT'. The output of 'Extract PT' feeds into a block labeled 'PT process'. The 'PT process' block also receives AI_TSF as an input. The output of 'PT process' is labeled MI_AcPT. The 'PT process' block also feeds into a block labeled 'Defect correlations'. This block also receives AI_TSF and dPLM as inputs. The output of 'Defect correlations' is labeled MI_cPLM. The entire process is labeled ODUP/NULL_A_Sk_MP on the right side. The reference G.798(17)_F14-33 is shown at the bottom right of the diagram.](6762c05f927b2b9c2404c465ef0a8d01_img.jpg) - -Figure 14-33: ODUP/NULL\_A\_Sk processes diagram. The diagram shows a block diagram of the ODUP/NULL\_A\_Sk processes. Inputs AI\_D, AI\_CK, AI\_FS, and AI\_MFS are grouped under the label ODUP\_AP. These inputs feed into a block labeled 'Extract PT'. The output of 'Extract PT' feeds into a block labeled 'PT process'. The 'PT process' block also receives AI\_TSF as an input. The output of 'PT process' is labeled MI\_AcPT. The 'PT process' block also feeds into a block labeled 'Defect correlations'. This block also receives AI\_TSF and dPLM as inputs. The output of 'Defect correlations' is labeled MI\_cPLM. The entire process is labeled ODUP/NULL\_A\_Sk\_MP on the right side. The reference G.798(17)\_F14-33 is shown at the bottom right of the diagram. - -**Figure 14-33 – ODUP/NULL\_A\_Sk processes** - -##### Defects - -The function shall detect dPLM. - -**dPLM:** See clause 6.2.4.1. The expected payload type is "1111 1101" (NULL test signal mapping) as defined in [ITU-T G.709]. - -**Consequent actions:** None. - -##### Defect correlations - -cPLM $\leftarrow$ dPLM and (not AI\_TSF) - -**Performance monitoring:** None. - -### 14.3.5 ODUP to PRBS adaptation function (ODUP/PRBS\_A) - -The ODUP to PRBS adaptation functions perform the adaptation of a PRBS test signal as defined in clause 17.5.2 of [ITU-T G.709] into the ODUP. The PRBS signal is a $2^{31} - 1$ pseudo-random test sequence as specified in clause 5.8 of [ITU-T O.150]. - -#### 14.3.5.1 ODUP to PRBS adaptation source function (ODUP/PRBS\_A\_So) - -The ODUP/PRBS\_A\_So function creates the ODUP signal from a free-running clock. It maps the PRBS signal into the payload of the OPU, adds OPU overhead (RES, PT) and default ODU overhead. - -The information flow and processing of the ODUP/PRBS\_A\_So function is defined with reference to Figures 14-34 and 14-35. - -##### Symbol - -![Figure 14-34: ODUP/PRBS_A_So function diagram. The diagram shows two symbols for the ODUP/PRBS_A_So function. The left symbol is labeled ODUP/PRBS and takes an input ODUP/PRBS_A_So_MP. It has an output labeled ODUP/AP. Below the output, there is a list of values for k: k = 0, 1, 2, 2c, 3, 4, flex. The right symbol is labeled ODUCn/PRBS and takes an input ODUCn/PRBS_A_So_MP. It has an output labeled ODUCn/AP. Below the output, there is a reference G.798(17)-Amd.4(22)_F14-34.](9271a5ab5252d6176287e699f600d2fb_img.jpg) - -Figure 14-34: ODUP/PRBS\_A\_So function diagram. The diagram shows two symbols for the ODUP/PRBS\_A\_So function. The left symbol is labeled ODUP/PRBS and takes an input ODUP/PRBS\_A\_So\_MP. It has an output labeled ODUP/AP. Below the output, there is a list of values for k: k = 0, 1, 2, 2c, 3, 4, flex. The right symbol is labeled ODUCn/PRBS and takes an input ODUCn/PRBS\_A\_So\_MP. It has an output labeled ODUCn/AP. Below the output, there is a reference G.798(17)-Amd.4(22)\_F14-34. - -**Figure 14-34 – ODUP/PRBS\_A\_So function** - -##### Interfaces - -**Table 14-13 – ODUP/PRBS\_A\_So inputs and outputs** - -| Input(s) | Output(s) | -|------------------------------------------------------------------------------|-------------------------------------------------------------------------| -| ODUP/PRBS_A_So_MP:
ODUP/PRBS_A_So_MI_Nominal_Bitrate_and_Tolerance | ODUP_AP:
ODUP_AI_CK
ODUP_AI_D
ODUP_AI_FS
ODUP_AI_MFS | - -##### Processes - -**Clock and (multi)frame start signal generation:** The function shall generate a local ODU clock with a clock frequency within the minimum to maximum values of the specified ODU signal as given in Table 7-2 of [ITU-T G.709] provisioned by the MI\_Nominal\_Bitrate\_and\_Tolerance from a free-running oscillator. The jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCa clock), apply. - -The function shall generate the (multi)frame start reference signals AI\_FS and AI\_MFS for the ODU signal. The AI\_FS signal shall be active once per 122 368 clock cycles. AI\_MFS shall be active once every 256 frames. - -**Generate and insert PRBS signal:** The function shall generate the PRBS signal and insert it into the OPU payload area as defined in clause 17.5.2 of [ITU-T G.709]. Each OPU instance contains one PRBS signal. - -**PT:** The function shall insert code "1111 1110" into the PT byte position of the PSI overhead as defined in clause 15.9.2.1 of [ITU-T G.709]. - -**RES:** The function shall insert all-ZEROs into the RES bytes. - -All other bits of the ODU overhead should be sourced as "0"s, except the ODU-PM STAT field which should be set to the value "normal path signal" (001). - -![Block diagram of ODUP/PRBS_A_So processes. A 'Free-running clock generator (ODCa)' receives 'MI_Nominal_Bitrate_and_Tolerance' and outputs 'CK'. 'CK' is input to 'Generate and insert PRBS signal', 'Payload type (PT)', 'RES', and 'ODUk OH is set to all-0's, except PM STAT = 001'. 'Generate and insert PRBS signal' outputs 'AI_D'. 'Payload type (PT)', 'RES', and 'ODUk OH is set to all-0's, except PM STAT = 001' are inputs to a '1/122368' divider. The '1/122368' divider outputs 'FS' to 'AI_FS' and 'AI_MFS'. 'AI_FS' and 'AI_MFS' are inputs to a '1/256' divider. The '1/256' divider outputs 'MFS' to 'AI_MFS'. The outputs 'AI_D', 'AI_MFS', 'AI_FS', and 'AI_CK' are grouped as 'ODUP_AP'. The diagram is labeled 'G.798(17)_F14-35' and 'ODUP/PRBS_A_So_MP'.](b55656f01d98097862b9e6d8461ec59b_img.jpg) - -Block diagram of ODUP/PRBS\_A\_So processes. A 'Free-running clock generator (ODCa)' receives 'MI\_Nominal\_Bitrate\_and\_Tolerance' and outputs 'CK'. 'CK' is input to 'Generate and insert PRBS signal', 'Payload type (PT)', 'RES', and 'ODUk OH is set to all-0's, except PM STAT = 001'. 'Generate and insert PRBS signal' outputs 'AI\_D'. 'Payload type (PT)', 'RES', and 'ODUk OH is set to all-0's, except PM STAT = 001' are inputs to a '1/122368' divider. The '1/122368' divider outputs 'FS' to 'AI\_FS' and 'AI\_MFS'. 'AI\_FS' and 'AI\_MFS' are inputs to a '1/256' divider. The '1/256' divider outputs 'MFS' to 'AI\_MFS'. The outputs 'AI\_D', 'AI\_MFS', 'AI\_FS', and 'AI\_CK' are grouped as 'ODUP\_AP'. The diagram is labeled 'G.798(17)\_F14-35' and 'ODUP/PRBS\_A\_So\_MP'. - -**Figure 14-35 – ODUP/PRBS\_A\_So processes** - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -#### 14.3.5.2 ODUP to PRBS adaptation sink function (ODUP/PRBS\_A\_Sk) - -The ODUP/PRBS\_A\_Sk recovers the PRBS test signal from the OPU payload area and monitors test sequence errors (TSEs) in the PRBS sequence. It extracts the OPU overhead (PT and RES) and monitors the reception of the correct payload type. - -The information flow and processing of the ODUP/PRBS\_A\_Sk function is defined with reference to Figures 14-36 and 14-37. - -##### Symbol - -![Diagram of ODUP/PRBS_A_Sk function symbols. Two trapezoidal blocks represent the function. The left block is labeled 'ODUPkP/PRBS' and has an input 'ODUPkP_AP' from below (with 'k = 0, 1, 2, 2e, 3, 4, flex') and an output 'ODUPkP/PRBS_A_Sk_MP' to the left. The right block is labeled 'ODUPnP/PRBS' and has an input 'ODUPnP_AP' from below and an output 'ODUPnP/PRBS_A_Sk_MP' to the left. A reference code 'G.798(17)_F14-36' is at the bottom right.](09cac7f879d0ec76600a5aeae680b95b_img.jpg) - -Diagram illustrating the ODUP/PRBS\_A\_Sk function symbols. Two trapezoidal blocks represent the function. The left block is labeled "ODUPkP/PRBS" and has an input "ODUPkP\_AP" from below (with "k = 0, 1, 2, 2e, 3, 4, flex") and an output "ODUPkP/PRBS\_A\_Sk\_MP" to the left. The right block is labeled "ODUPnP/PRBS" and has an input "ODUPnP\_AP" from below and an output "ODUPnP/PRBS\_A\_Sk\_MP" to the left. A reference code "G.798(17)\_F14-36" is at the bottom right. - -Diagram of ODUP/PRBS\_A\_Sk function symbols. Two trapezoidal blocks represent the function. The left block is labeled 'ODUPkP/PRBS' and has an input 'ODUPkP\_AP' from below (with 'k = 0, 1, 2, 2e, 3, 4, flex') and an output 'ODUPkP/PRBS\_A\_Sk\_MP' to the left. The right block is labeled 'ODUPnP/PRBS' and has an input 'ODUPnP\_AP' from below and an output 'ODUPnP/PRBS\_A\_Sk\_MP' to the left. A reference code 'G.798(17)\_F14-36' is at the bottom right. - -**Figure 14-36 – ODUP/PRBS\_A\_Sk function** - -##### Interfaces - -**Table 14-14 – ODUP/PRBS\_A\_Sk inputs and outputs** - -| Input(s) | Output(s) | -|-----------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------------------------------------------------------------| -| ODUP_AP:
ODUP_AI_CK
ODUP_AI_D
ODUP_AI_FS
ODUP_AI_TSF
ODUP/PRBS_A_Sk_MP:
ODUP/PRBS_A_Sk_MI_1second | ODUP/PRBS_A_Sk_MP:
ODUP/PRBS_A_Sk_MI_cPLM
ODUP/PRBS_A_Sk_MI_AcPT
ODUP/PRBS_A_Sk_MI_cLSS
ODUP/PRBS_A_Sk_MI_pN_TSE | - -##### Processes - -**PT:** The function shall extract the PT byte from the PSI overhead as defined in clause 8.7.1.1. The accepted PT value is available at the MP (MI\_AcPT) and is used for PLM defect detection. - -**RES:** The value in the RES bytes shall be ignored. - -**TSE check:** Test sequence errors (TSEs) are bit errors in the PRBS data stream extracted from each of the OPU payload instances and shall be detected whenever the PRBS detector is in lock and the received data bit does not match the expected value. - -![Figure 14-37 – ODUP/PRBS_A_Sk processes. This block diagram illustrates the internal components and signal flow of the ODUP/PRBS_A_Sk function. On the left, a 'TSE check' block receives inputs from 'AI_D', 'AI_CK', 'AI_FS', and 'AI_MFS' (grouped as 'ODUP_AP'). It outputs 'nTSE' to a 'Performance monitoring' block and 'dLSS' to a 'Defect correlations' block. Below the TSE check, an 'Extract PT' block receives the same 'ODUP_AP' inputs and outputs to a 'PT process' block. The 'PT process' block outputs 'AI_TSF' to the 'Defect correlations' block and 'MI_AcPT' to the right. The 'Performance monitoring' block outputs 'MI_1second' and 'MI_pN_TSE' to the right. The 'Defect correlations' block outputs 'MI_cLSS' and 'MI_cPLM' to the right. All output signals ('MI_1second', 'MI_pN_TSE', 'MI_cLSS', 'MI_cPLM', 'MI_AcPT') are grouped under the label 'ODUP/PRBS_A_Sk_MP'. A bracket at the bottom groups 'AI_D', 'AI_CK', 'AI_FS', 'AI_MFS', and 'AI_TSF' under the label 'ODUP_AP'. The diagram is labeled 'G.798(17)_F14-37'.](2fa686ed8033ac35efddee0c7be47d59_img.jpg) - -Figure 14-37 – ODUP/PRBS\_A\_Sk processes. This block diagram illustrates the internal components and signal flow of the ODUP/PRBS\_A\_Sk function. On the left, a 'TSE check' block receives inputs from 'AI\_D', 'AI\_CK', 'AI\_FS', and 'AI\_MFS' (grouped as 'ODUP\_AP'). It outputs 'nTSE' to a 'Performance monitoring' block and 'dLSS' to a 'Defect correlations' block. Below the TSE check, an 'Extract PT' block receives the same 'ODUP\_AP' inputs and outputs to a 'PT process' block. The 'PT process' block outputs 'AI\_TSF' to the 'Defect correlations' block and 'MI\_AcPT' to the right. The 'Performance monitoring' block outputs 'MI\_1second' and 'MI\_pN\_TSE' to the right. The 'Defect correlations' block outputs 'MI\_cLSS' and 'MI\_cPLM' to the right. All output signals ('MI\_1second', 'MI\_pN\_TSE', 'MI\_cLSS', 'MI\_cPLM', 'MI\_AcPT') are grouped under the label 'ODUP/PRBS\_A\_Sk\_MP'. A bracket at the bottom groups 'AI\_D', 'AI\_CK', 'AI\_FS', 'AI\_MFS', and 'AI\_TSF' under the label 'ODUP\_AP'. The diagram is labeled 'G.798(17)\_F14-37'. - -**Figure 14-37 – ODUP/PRBS\_A\_Sk processes** - -##### Defects - -The function shall detect dPLM and dLSS. - -**dPLM:** See clause 6.2.4.1. The expected payload type is "1111 1110" (PRBS test signal mapping) as defined in [ITU-T G.709]. - -**dLSS:** The function shall detect the loss of PRBS lock (dLSS) according to the criteria defined in clause 2.6 of [ITU-T O.151]. - -**Consequent actions:** None. - -##### Defect correlations - -cPLM $\leftarrow$ dPLM and (not AI\_TSF) - -cLSS $\leftarrow$ dLSS and (not AI\_TSF) and (not dPLM) - -##### Performance monitoring - -pN\_TSE $\leftarrow$ Sum of test sequence errors (TSEs) within one second period. - -### 14.3.6 ODUkP to RSn adaptation function (ODUkP/RSn\_A) - -The ODUkP to RSn adaptation functions perform the adaptation between the ODUkP ( $k = 1, 2, 3$ ) layer adapted information and the characteristic information of a RSn signal ( $n = 16, 64, 256$ ). - -Two different source functions are defined. The ODUkP/RSn-a\_A\_So provides asynchronous mapping, while the ODUkP/RSn-b\_A\_So provides bit synchronous mapping. In the sink direction, the ODUkP/RSn\_A\_Sk can handle both (bit synchronous and asynchronous) mappings. - -NOTE 1 – The source functions are identical with the ODUkP/CBRx adaptation source functions, except for the different CI at the CP (CBRx\_CI replaced by RSn\_CI). In the sink direction, the function provides framing on the SDH signal and generic AIS supervision. In the ODUkP/CBR\_A\_Sk function, no such functionality is available. - -NOTE 2 – The ODUkP/RSn\_A functions are only intended to be used together with RSn\_TT functions (see [ITU-T G.783]). The direct interconnection of ODUkP/RSn\_A functions with any other (server layer)/RS\_A functions at the RSn\_CP is not intended. The ODUkP/RSn functions are only used if further SDH processing is performed (e.g., RS termination). For example, Figure I.1 shows the ODUkP/RSn\_A\_Sk together with a RS\_TT\_Sk for non-intrusive monitoring, and Figure I.4 shows the use of the ODUkP/RSn\_A functions at OTN interfaces on SDH equipment. For transparent mapping of constant bit-rate signals, the ODUkP/CBRx\_A functions shall be used as shown in Figure I.1. - -#### 14.3.6.1 ODUkP to RSn asynchronous mapping adaptation source function (ODUkP/RSn-a\_A\_So) - -The ODUkP/RSn-a\_A\_So function creates the ODUk signal from a free-running clock. It asynchronously maps the STM-N ( $N = 4^{(k+1)}$ ) client signal from the RSn\_CP into the payload of the OPUk ( $k = 1, 2, 3$ ), adds OPUk overhead (RES, PT, JC) and default ODUk overhead. - -The information flow and processing of the ODUkP/RSn-a\_A\_So function is defined with reference to Figures 14-38 and 14-39. - -##### Symbol - -![Diagram of the ODUkP/RSn-a_A_So function symbol. An input arrow labeled 'RSn_CP' points to a trapezoidal block labeled 'ODUkP/RSn-a'. Above the input arrow is the parameter 'n = 16, 64, 256'. Below the block is an output arrow labeled 'ODUkP_AP'. To the right of the output arrow is the parameter 'k = 1, 2, 3'. At the bottom right of the diagram is the text 'G.798(17)_F14-38'.](c5945ab1332e6611e9e4d64bafdc3455_img.jpg) - -Diagram of the ODUkP/RSn-a\_A\_So function symbol. An input arrow labeled 'RSn\_CP' points to a trapezoidal block labeled 'ODUkP/RSn-a'. Above the input arrow is the parameter 'n = 16, 64, 256'. Below the block is an output arrow labeled 'ODUkP\_AP'. To the right of the output arrow is the parameter 'k = 1, 2, 3'. At the bottom right of the diagram is the text 'G.798(17)\_F14-38'. - -Figure 14-38 – ODUkP/RSn-a\_A\_So function - -##### Interfaces - -Table 14-15 – ODUkP/RSn-a\_A\_So inputs and outputs - -| Input(s) | Output(s) | -|-----------------------------------------|------------------------------------------------------------------------------| -| RSn_CP:
RSn_CI_CK
RSn_CI_D | ODUkP_AP:
ODUkP_AI_CK
ODUkP_AI_D
ODUkP_AI_FS
ODUkP_AI_MFS | - -##### Processes - -**Clock and (multi)frame start signal generation:** The function shall generate a local ODUk clock (ODUkP\_AI\_CK) of " $239/(239 - k) \times 4^{(k-1)} \times 2\,488\,320\text{ kHz} \pm 20\text{ ppm}$ " from a free-running oscillator. The clock parameters, including jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCa clock), apply. - -The function shall generate the (multi)frame start reference signals AI\_FS and AI\_MFS for the ODUk signal. The AI\_FS signal shall be active once per 122 368 clock cycles. AI\_MFS shall be active once every 256 frames. - -**Mapping, frequency justification and bit-rate adaptation:** The function shall provide an elastic store (buffer) process. The data signal RSn\_CI shall be written into the buffer under the control of the associated input clock. The data shall be read out of the buffer and written onto the D and N/PJO bytes in the OPUk frame under the control of the ODUk clock and justification decisions as defined in clause 17.2 of [ITU-T G.709]. - -A justification decision shall be performed each frame. Each justification decision results in a corresponding positive, negative or no justification action. Upon a positive justification action, the reading of one data byte out of the buffer shall be cancelled once. No RSn data shall be written onto the PJO and NJO bytes. Upon a negative justification action, one extra data byte shall be read once out of the buffer. RSn data shall be written onto the PJO and NJO bytes. If neither a positive nor a - -negative justification action is to be performed, RSn data shall be written onto the PJO byte and no RSn data shall be written onto the NJO byte. - -The justification decisions determine the phase error introduced by the function. - -**Buffer size:** In the presence of jitter as specified by [ITU-T G.825] and a frequency within the range $4^{(k-1)} \times 2\,488\,320\text{ kHz} \pm 20\text{ ppm}$ , this mapping process shall not introduce any errors. The maximum buffer hysteresis, and therefore the maximum phase error introduced, shall be as listed in Table 14-7. - -**JC bits:** The function shall generate the justification control (JC) bits based on the justification decision performed in the current frame according to the specification in clause 17.2 of [ITU-T G.709]. It shall insert the justification control bits in the appropriate JC bit positions in the JC bytes of the current frame. - -**PT:** The function shall insert code "0000 0010" into the PT byte position of the PSI overhead as defined in clause 15.9.2.1 of [ITU-T G.709]. - -**RES:** The function shall insert all-ZEROs into the RES bytes and reserved bits within the JC bytes. - -All other bits of the ODUk overhead should be sourced as "0"s, except the PMOH STAT field which should be set to the value "normal path signal" (001). - -![Block diagram of ODUkP/RSn-a_A_So processes. The diagram shows the mapping of RSn_CP data into ODUkP_AP. Inputs include CI_D, CI_CK, and RSn_CP. CI_D and CI_CK enter an Elastic store. RSn_CP enters a Justification control and JC generation block. The Elastic store outputs WR and RD signals to the Justification control. The Justification control outputs JC bits to the Elastic store and AI_D, AI_CK, AI_FS, and AI_MFS signals to the ODUkP_AP. A Free-running clock generator (ODCa) provides CK to a 1/122368 divider, which outputs FS to a 1/256 divider, which outputs MFS to the ODUkP_AP. The ODUkP_AP also includes Insert PT, Insert RES, and a block stating 'ODUk OH is set to all-0's, except PM STAT = 001'.](9c12d7993e786817c8c569e6f2d5a0a9_img.jpg) - -The diagram illustrates the ODUkP/RSn-a\_A\_So processes. At the top, the RSn\_CP input is shown. On the left, CI\_D and CI\_CK inputs enter an Elastic store. The Elastic store has write (WR) and read (RD) ports. The WR port is connected to the Justification control and JC generation block, which also receives the RSn\_CP input. The RD port is connected to the Justification control. The Justification control outputs JC bits back to the Elastic store and also outputs AI\_D, AI\_CK, AI\_FS, and AI\_MFS signals to the ODUkP\_AP. A Free-running clock generator (ODCa) provides a clock (CK) to a 1/122368 divider, which outputs a frequency signal (FS) to a 1/256 divider, which in turn outputs a multi-frequency signal (MFS) to the ODUkP\_AP. The ODUkP\_AP block includes functions for Insert PT, Insert RES, and setting the ODUk OH to all-0's, except for the PM STAT field which is set to 001. - -Block diagram of ODUkP/RSn-a\_A\_So processes. The diagram shows the mapping of RSn\_CP data into ODUkP\_AP. Inputs include CI\_D, CI\_CK, and RSn\_CP. CI\_D and CI\_CK enter an Elastic store. RSn\_CP enters a Justification control and JC generation block. The Elastic store outputs WR and RD signals to the Justification control. The Justification control outputs JC bits to the Elastic store and AI\_D, AI\_CK, AI\_FS, and AI\_MFS signals to the ODUkP\_AP. A Free-running clock generator (ODCa) provides CK to a 1/122368 divider, which outputs FS to a 1/256 divider, which outputs MFS to the ODUkP\_AP. The ODUkP\_AP also includes Insert PT, Insert RES, and a block stating 'ODUk OH is set to all-0's, except PM STAT = 001'. - -Figure 14-39 – ODUkP/RSn-a\_A\_So processes - -**Defects:** None. - -**Consequent actions:** None - -**Defect correlations:** None. - -**Performance monitoring:** None. - -### 14.3.6.2 ODUkP to RSn bit synchronous mapping adaptation source function (ODUkP/RSn-b\_A\_So) - -The ODUkP/RSn-b\_A\_So function creates the ODUk signal from a clock, derived from the incoming RSn\_CI clock. It bit synchronously maps the STM-N ( $N = 4^{(k+1)}$ ) client signal from the RSn\_CP into the payload of the OPUk, adds OPUk overhead (PT, JC, RES) and default ODUk overhead. - -The information flow and processing of the ODUkP/RSn-b\_A\_So function is defined with reference to Figures 14-40 and 14-41. - -#### Symbol - -![Symbol diagram for the ODUkP/RSn-b_A_So function. It shows an input RSn_CP entering a trapezoidal block labeled 'ODUkP/RSn-b'. Above the input arrow, 'n = 16, 64, 256' is specified. Below the output arrow, 'k = 1, 2, 3' is specified. The output is labeled ODUkP_AP. At the bottom right of the block, the reference 'G.798(17)_F14-40' is shown.](f79cb254efa2e37d7facb055cf90086e_img.jpg) - -Symbol diagram for the ODUkP/RSn-b\_A\_So function. It shows an input RSn\_CP entering a trapezoidal block labeled 'ODUkP/RSn-b'. Above the input arrow, 'n = 16, 64, 256' is specified. Below the output arrow, 'k = 1, 2, 3' is specified. The output is labeled ODUkP\_AP. At the bottom right of the block, the reference 'G.798(17)\_F14-40' is shown. - -Figure 14-40 – ODUkP/RSn-b\_A\_So function - -#### Interfaces - -Table 14-16 – ODUkP/RSn-b\_A\_So inputs and outputs - -| Input(s) | Output(s) | -|-----------------------------------------|------------------------------------------------------------------------------| -| RSn_CP:
RSn_CI_CK
RSn_CI_D | ODUkP_AP:
ODUkP_AI_CK
ODUkP_AI_D
ODUkP_AI_FS
ODUkP_AI_MFS | - -#### Processes - -**Clock and (multi)frame start signal generation:** The function shall generate the ODUk (AI\_CK) clock by multiplying the incoming RSn clock (CI\_CK) by a factor of $239/(239 - k)$ . The clock parameters, including jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCb clock), apply. - -NOTE 1 – The ODUk clock is $"239/(239 - k) \times 4^{(k-1)} \times 2\,488\,320\text{ kHz} \pm 20\text{ ppm}"$ . - -NOTE 2 – The incoming RSn CK (CI\_CK) signal has to be within the range of $4^{(k-1)} \times 2\,488\,320\text{ kHz} \pm 20\text{ ppm}$ . - -During failure conditions of the incoming RS clock signal (CI\_CK), the ODUk clock shall stay within its limits as defined in [ITU-T G.8251] and no frame phase discontinuity shall be introduced. - -The function shall generate the (multi)frame start reference signals AI\_FS and AI\_MFS for the ODUk signal. The AI\_FS signal shall be active once per 122 368 clock cycles. AI\_MFS shall be active once every 256 frames. - -**Mapping, frequency justification and bit-rate adaptation:** The function shall provide an elastic store (buffer) process. The data signal RSn\_CI shall be written into the buffer under the control of the associated input clock. The data shall be read out of the buffer and written onto the D and PJO bytes in the OPUk frame under the control of the ODUk clock, as defined in clause 17.2 of [ITU-T G.709]. - -Neither negative nor positive justification is to be performed. No data shall be written onto the NJO byte and data shall always be written onto the PJO byte. - -**Buffer size:** In the presence of jitter as specified by [ITU-T G.825] and a frequency within the range $4^{(k-1)} \times 2\,488\,320\text{ kHz} \pm 20\text{ ppm}$ , this mapping process shall not introduce any errors. - -Following a step in frequency of the $4^{(k-1)} \times 2\,488\,320\text{ kbit/s}$ CI\_CK signal (for example, due to the removal of AIS (RS-AIS)), there will be a maximum recovery time of X seconds after which this process shall not generate any bit errors. The value of X is for further study; a value of one second has been proposed. - -**JC bits:** The function shall generate the fixed justification control (JC) bits "00" according to clause 17.2 of [ITU-T G.709]. It shall insert the justification control bits in the appropriate JC bit positions in the JC bytes. - -**RES:** The function shall insert all-ZEROs into the RES bytes and reserved bits within the JC bytes. - -**PT:** The function shall insert code "0000 0011" into the PT byte position of the PSI overhead as defined in clause 15.9.2.1 of [ITU-T G.709]. - -All other bits of the ODUk overhead should be sourced as "0"s, except the PMOH STAT field which should be set to the value "normal path signal" (001). - -![Figure 14-41 – ODUkP/RSn-b_A_So processes. This block diagram illustrates the mapping process from client signals to ODUkP overhead. At the top, CI_D and CI_CK signals enter an 'Elastic store' block. CI_CK also feeds into an 'ODU clock generator locked to CBRx clock (ODCb)'. The Elastic store has 'WR' (write) and 'RD' (read) ports. The 'RD' port output goes to an 'AI_D' output and also through a series of blocks: 'Justification control' (receiving 'JC' input), 'Insert PT', 'Insert RES', and 'ODUk OH is set to all-0's, except PM STAT = 001'. The 'Justification control' block also receives 'CK' from the ODU clock generator and sends 'JC' to the Elastic store. The 'ODU clock generator' also feeds into a frequency divider '1/122368', which outputs 'FS'. 'FS' feeds into another frequency divider '1/256', which outputs 'MFS'. 'CK', 'FS', and 'MFS' all feed into the 'AI_CK', 'AI_FS', and 'AI_MFS' outputs respectively. The entire process is labeled 'RSn_CP' at the top and 'ODUkP_AP' at the bottom. A reference code 'G.798(17)-Amd.3(21)_F14-41' is in the bottom right.](0697b56d281df40b93c568be995cb884_img.jpg) - -Figure 14-41 – ODUkP/RSn-b\_A\_So processes. This block diagram illustrates the mapping process from client signals to ODUkP overhead. At the top, CI\_D and CI\_CK signals enter an 'Elastic store' block. CI\_CK also feeds into an 'ODU clock generator locked to CBRx clock (ODCb)'. The Elastic store has 'WR' (write) and 'RD' (read) ports. The 'RD' port output goes to an 'AI\_D' output and also through a series of blocks: 'Justification control' (receiving 'JC' input), 'Insert PT', 'Insert RES', and 'ODUk OH is set to all-0's, except PM STAT = 001'. The 'Justification control' block also receives 'CK' from the ODU clock generator and sends 'JC' to the Elastic store. The 'ODU clock generator' also feeds into a frequency divider '1/122368', which outputs 'FS'. 'FS' feeds into another frequency divider '1/256', which outputs 'MFS'. 'CK', 'FS', and 'MFS' all feed into the 'AI\_CK', 'AI\_FS', and 'AI\_MFS' outputs respectively. The entire process is labeled 'RSn\_CP' at the top and 'ODUkP\_AP' at the bottom. A reference code 'G.798(17)-Amd.3(21)\_F14-41' is in the bottom right. - -**Figure 14-41 – ODUkP/RSn-b\_A\_So processes** - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -#### 14.3.6.3 ODUkP to RSn adaptation sink function (ODUkP/RSn\_A\_Sk) - -The ODUkP/RSn\_A\_Sk recovers the STM-N ( $N = 4^{(k+1)}$ ) client signal from the OPUk payload using the justification control information (JC overhead) to determine if a data or stuff byte is present within - -the NJO and PJO bytes. It extracts the OPUk overhead (PT, JC, RES) and monitors the reception of the correct payload type. It detects generic AIS and recovers the frame start of the STM-N signal. Under signal fail condition, a logical all-ONEs (AIS) signal shall be generated. - -The information flow and processing of the ODUkP/RSn\_A\_Sk function is defined with reference to Figures 14-42 and 14-43. - -### Symbol - -![Figure 14-42: ODUkP/RSn_A_Sk function symbol diagram. A trapezoidal block labeled 'ODUkP/RSn' has an input 'ODUkP_AP' at the bottom with parameter 'k = 1, 2, 3'. It has an output 'RSn_CP' at the top with parameter 'n = 16, 64, 256'. It also has an output 'ODUkP/RSn_A_Sk_MP' on the left side. The diagram is labeled 'G.798(17)_F14-42'.](d884367c84ba50f250499f79c4b4b950_img.jpg) - -Figure 14-42: ODUkP/RSn\_A\_Sk function symbol diagram. A trapezoidal block labeled 'ODUkP/RSn' has an input 'ODUkP\_AP' at the bottom with parameter 'k = 1, 2, 3'. It has an output 'RSn\_CP' at the top with parameter 'n = 16, 64, 256'. It also has an output 'ODUkP/RSn\_A\_Sk\_MP' on the left side. The diagram is labeled 'G.798(17)\_F14-42'. - -Figure 14-42 – ODUkP/RSn\_A\_Sk function - -### Interfaces - -Table 14-17 – ODUkP/RSn\_A\_Sk inputs and outputs - -| Input(s) | Output(s) | -|----------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| ODUkP_AP:
ODUkP_AI_CK
ODUkP_AI_D
ODUkP_AI_FS
ODUkP_AI_MFS
ODUkP_AI_TSF | RSn_CP:
RSn_CI_CK
RSn_CI_D
RSn_CI_FS
RSn_CI_SSF
ODUkP/RSn_A_Sk_MP:
ODUkP/RSn_A_Sk_MI_cPLM
ODUkP/RSn_A_Sk_MI_AcPT
ODUkP/RSn_A_Sk_MI_cLOF | - -### Processes - -**PT:** The function shall extract the PT byte from the PSI overhead as defined in clause 8.7.1.1. The accepted PT value is available at the MP (MI\_AcPT) and is used for PLM defect detection. - -**RES:** The value in the RES bytes shall be ignored. - -**JC:** The function shall interpret the justification control information in the JC byte as defined in clause 17.2 of [ITU-T G.709] in order to determine the justification action (positive, negative, none) for the current frame. RES bits in the JC shall be ignored. - -**Demapping, CBR clock generation:** The function shall provide an elastic store (buffer) process. The CBR data shall be written into the buffer from the D, PJO and NJO bytes in the OPUk frame. The information extraction of the PJO and NJO bytes shall be under the control of the justification control information. The RSn data (CI\_D) shall be read out of the buffer under the control of the RSn clock (CI\_CK). - -Upon a positive justification action, the writing of one data byte into the buffer shall be cancelled once. No RSn data shall be read from the PJO and NJO bytes. Upon a negative justification action, one extra data byte shall be written into the buffer once. RSn data shall be read from the PJO and NJO bytes. If neither a positive nor a negative justification action is to be performed, RSn data shall be read from the PJO byte and no RSn data shall be read from the NJO byte. - -**Smoothing and jitter limiting process:** The function shall provide for a clock smoothing and elastic store (buffer) process. The $4^{(k-1)} \times 2\,488\,320$ kbit/s ( $k = 1, 2, 3$ ) data signal shall be written into the buffer under the control of the associated (gapped) input clock (with a frequency accuracy within $\pm 20$ ppm). The data signal shall be read out of the buffer under the control of a smoothed (equally spaced) $4^{(k-1)} \times 2\,488\,320$ kbit/s $\pm 20$ ppm clock (the rate is determined by the 2.5 Gbit/s, 10 Gbit/s, 40 Gbit/s signal at the input of the remote ODUkP/RSn\_A\_So). - -The clock parameters, including jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCp clock), apply. - -**Buffer size:** In the presence of jitter as specified by [ITU-T G.825] and a frequency within the range $4^{(k-1)} \times 2\,488\,320$ kbit/s $\pm 20$ ppm, this justification process shall not introduce any errors. - -Following a step in frequency of the $4^{(k-1)} \times 2\,488\,320$ kbit/s signal transported by the ODUkP\_AI (for example due to removal of generic-AIS signal with a frequency offset), there will be a maximum recovery time of X seconds after which this process shall not generate any bit errors. The value of X is for further study; a value of one second has been proposed. - -**Frame alignment:** The function shall perform frame alignment on the STM-N frame as described in clause 8.2.1 of [ITU-T G.783]. - -![Figure 14-43 – ODUkP/RSn_A_Sk processes. This block diagram illustrates the internal functions of the ODUkP/RSn_A_Sk processing block. The block is divided into two main sections: RSn_CP (top) and ODUkP_AP (bottom). Inputs include CI_FS, CI_D, CI_CK, and CI_SSF. The RSn_CP section contains an AIS insertion block, an AIS generator, a frame alignment block, and a generic AIS supervision block. The ODUkP_AP section contains an elastic store (with WR and RD ports), a CBR clock generator (ODCp), a defect correlations block, an extract JC block, an extract PT block, and a PT process block. Various signals like dLOF, dPLM, dAIS, AI_TSF, and aAIS are shown as outputs or internal signals. The diagram is labeled G.798(17)_F14-43.](9af97997b7d3fbca90b8ddba0ea39c6c_img.jpg) - -Figure 14-43 – ODUkP/RSn\_A\_Sk processes. This block diagram illustrates the internal functions of the ODUkP/RSn\_A\_Sk processing block. The block is divided into two main sections: RSn\_CP (top) and ODUkP\_AP (bottom). Inputs include CI\_FS, CI\_D, CI\_CK, and CI\_SSF. The RSn\_CP section contains an AIS insertion block, an AIS generator, a frame alignment block, and a generic AIS supervision block. The ODUkP\_AP section contains an elastic store (with WR and RD ports), a CBR clock generator (ODCp), a defect correlations block, an extract JC block, an extract PT block, and a PT process block. Various signals like dLOF, dPLM, dAIS, AI\_TSF, and aAIS are shown as outputs or internal signals. The diagram is labeled G.798(17)\_F14-43. - -**Figure 14-43 – ODUkP/RSn\_A\_Sk processes** - -## Defects - -The function shall detect dPLM, dAIS and dLOF. - -**dPLM:** See clause 6.2.4.1. The expected payload types are "0000 0010" (asynchronous CBRx mapping) and "0000 0011" (bit synchronous CBRx mapping) as defined in [ITU-T G.709]. - -**dAIS:** See clause 6.2.6.3.3. - -**dLOF:** See clause 6.2.5.1 of [ITU-T G.783]. - -### Consequent actions - -aSSF $\leftarrow$ AI\_TSF or dPLM or dAIS or dLOF - -aAIS $\leftarrow$ AI\_TSF or dPLM or dAIS or dLOF - -On declaration of aAIS, the function shall output a logical all-ONEs (AIS) signal within two STM-N frames. On clearing aAIS, the logical all-ONEs (AIS) signal shall be removed within two STM-N frames, with normal data being output. The AIS clock shall be independent from the incoming clock. The AIS clock has to be within $4^{(k-1)} \times 2\,488\,320\text{ kHz} \pm 20\text{ ppm}$ . The jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCp clock), apply. - -### Defect correlations - -cPLM $\leftarrow$ dPLM and (not AI\_TSF) - -cLOF $\leftarrow$ dLOF and (not dAIS) and (not dPLM) and (not AI\_TSF) - -NOTE – dAIS is not reported as fault cause as it is a secondary alarm and will result in aSSF, which is reported as cSSF fault cause in the RSn\_TT\_Sk that directly follows this function. - -**Performance monitoring:** None. - -## 14.3.7 ODU0P to client adaptation function (ODU0P/CBRx\_A) ( $0 \leq x \leq 1.25\text{G}$ ) - -### 14.3.7.1 ODU0P to CBRx adaptation source function (ODU0P/CBRx\_A\_So) ( $0 \leq x \leq 1.25\text{G}$ ) - -The ODU0P to CBRx adaptation source function is specified in clause 14.3.8.1 with $k=0$ . - -### 14.3.7.2 ODU0P to CBRx adaptation sink function (ODU0P/CBRx\_A\_Sk) ( $0 \leq x \leq 1.25\text{G}$ ) - -The ODU0P to CBRx adaptation sink function is specified in clause 14.3.8.2 with $k=0$ . - -## 14.3.8 ODUkP to CBRx adaptation function using GMP (ODUkP/CBRx-g\_A) - -The ODUkP/CBRx-g\_A performs the adaptation between the ODUkP layer adapted information and the characteristic information of the indicated client signals transported as constant bit-rate streams. - -Parameter $x$ defines the bit rate or bit-rate range of the CBR signal. The values of $x$ are given in Table 14-18 as described in clause 17.7 of [ITU-T G.709]. - -**Table 14-18 – Defined values for $x$ for ODUk clients** - -| $x$ | PT | Maximum buffer hysteresis (bytes) | Bit rate (kbit/s) | Clock tolerance (ppm) | ODUk type | -|----------------------|------|-----------------------------------|-------------------|-----------------------|-----------| -| 155M | 0x0A | 1 | 155 520 | 20 | 0 | -| 622M | 0x0B | 1 | 622 080 | 20 | 0 | -| ETC1000X
(Note 1) | 0x07 | 1 | 1 171 875 | 100 | 0 | -| FC-100 | 0x0C | 1 | 1 062 500 | 100 | 0 | -| SBCON/ESCON | 0x1A | 1 | 200 000 | 200 | 0 | -| DVB-ASI | 0x1B | 1 | 270 000 | 100 | 0 | - -**Table 14-18 – Defined values for x for ODUk clients** - -| x | PT | Maximum buffer hysteresis (bytes) | Bit rate (kbit/s) | Clock tolerance (ppm) | ODUk type | -|---------------------|------|-----------------------------------|-------------------|-----------------------|-----------| -| SDI | 0x15 | 1 | 270 000 | ± 2.8 | 0 | -| FC-200 | 0x0D | 2 | 2 125 000 | ± 100 | 1 | -| 1.5G SDI | 0x16 | 2 | 1 485 000/1.001 | ± 10 | 1 | -| 1.5G SDI | 0x17 | 2 | 1 485 000 | ± 10 | 1 | -| ETC40GR
(Note 2) | 0x07 | 32 | 40 117 188 | ± 100 | 3 | -| ETC100GR | 0x07 | 80 | 103 125 000 | ± 100 | 4 | - -NOTE 1 – The original bit rate and clock range of the associated 1000BASE-X Ethernet client signal is 1 250 000 kbit/s ± 100 ppm. The bit rate and clock range in this table are for the CBR stream that is produced after mapping the client signal into a GFP-T. - -NOTE 2 – The original bit rate and clock range of the associated 40GBASE-R Ethernet client signal is 41 250 000 kbit/s ± 100 ppm. The bit rate and clock range in this table are for the CBR stream that is produced after transcoding. - -The ODUkP/CBRx-g\_A source function always provides asynchronous mapping. - -#### 14.3.8.1 ODUkP to CBRx adaptation source function using GMP (ODUkP/CBRx-g\_A\_So) - -The ODUkP/CBRx-g\_A\_So function creates the ODUk signal from a free-running clock. It asynchronously maps the constant bit-rate client signal from the CBRx\_CP into the payload area of the OPUk using a sigma-delta based data and stuff distribution as defined in Annex D of [ITU-T G.709], and adds OPUk overhead (RES, PT, JC) and default ODUk overhead. - -The information flow of the ODUkP/CBRx-g\_A\_So function is defined with reference to Figure 14-44 and the processing of the ODUkP/CBRx-g\_A\_So function is defined with reference to Figures 14-44 and 14-45. - -#### Symbol - -![Diagram of the ODUkP/CBRx-g_A_So function symbol. It shows an input CBRx_CP entering a trapezoidal block labeled ODUkP/CBRx-g. The block has an output ODUkP/CBRx-g_A_So_MP pointing to the left and a downward output ODUkP_AP. The diagram is labeled G.798(17)_F14-44.](69161330e28765ad34d95262a79d7b7d_img.jpg) - -``` - -graph TD - CBRx_CP[CBRx_CP] --> ODUkP_CBRx_g[ODUkP/CBRx-g] - ODUkP_CBRx_g --> ODUkP_CBRx_g_A_So_MP[ODUkP/CBRx-g_A_So_MP] - ODUkP_CBRx_g --> ODUkP_AP[ODUkP_AP] - style ODUkP_CBRx_g shape:trapezoid - style ODUkP_CBRx_g_A_So_MP fill:none,stroke:none - style ODUkP_AP fill:none,stroke:none - subgraph G.798(17)_F14-44 - end - -``` - -Diagram of the ODUkP/CBRx-g\_A\_So function symbol. It shows an input CBRx\_CP entering a trapezoidal block labeled ODUkP/CBRx-g. The block has an output ODUkP/CBRx-g\_A\_So\_MP pointing to the left and a downward output ODUkP\_AP. The diagram is labeled G.798(17)\_F14-44. - -**Figure 14-44 – ODUkP/CBRx-g\_A\_So function** - -## Interfaces - -**Table 14-19 – ODUkP/CBRx-g\_A\_So inputs and outputs** - -| Input(s) | Output(s) | -|------------------------------------------------------------|----------------------------------------------------------------------------------------------------------------------------------------------------------| -| CBRx_CP:
CBRx_CI_CK
CBRx_CI_D
CBRx_CI_SSF | ODUkP_AP:
ODUkP_AI_CK
ODUkP_AI_D
ODUkP_AI_FS
ODUkP_AI_MFS
ODUkP/CBRx-g_A_So_MP:
ODUkP/CBRx-g_A_So_MI_pN_PCS_BIP (Note 1) | -| NOTE 1 – Only applicable for ETC40GR and ETC100GR clients. | | - -## Processes - -**Clock and (multi)frame start signal generation:** The function shall generate a local ODUk clock (ODUkP\_AI\_CK) as given in Table 7-2 of [ITU-T G.709] from a free-running oscillator. The clock parameters, including jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCa clock), apply. - -The function shall generate the (multi)frame start reference signals AI\_FS and AI\_MFS for the ODUk signal. The AI\_FS signal shall be active once per 122 368 clock cycles. AI\_MFS shall be active once every 256 frames. - -**Mapping, frequency justification and bit-rate adaptation:** The function shall provide an elastic store (buffer) process. The data signal shall be written into the buffer under the control of the associated input clock. The data shall be read out of the buffer and written onto the D bytes in the OPUk frame under the control of the sigma/delta based data/stuff distribution algorithm as defined in Annex D of [ITU-T G.709]. - -As per Annex D of [ITU-T G.709], the amount of data, in n-bit words, to be transmitted in the subsequent frame is determined. The $C_m(t)$ value encoded in JC1/2/3 represents the number of m-bit words that are mapped into the subsequent frame and the $\sum C_{nD}(t)$ value encoded in the JC4/5/6 represents in, n-bit words, the accumulated remainder that could not be transmitted. - -For ETC1000X clients, the data signal shall be synchronously transcoded into a GFP-T signal in which each GFP-T frame contains one superblock and in which the 65B\_PAD character and GFP Idle frames are not used, under the control of the associated input clock, and then the synchronous GFP-T like signal shall be written into the buffer under a synchronous input clock. This sub-process is depicted in Figure 14-47. - -For ETC40GR clients, the data signal ETC40GR\_CI\_D shall be synchronously transcoded under the control of the associated input clock, and then the synchronously transcoded signal shall be written into the buffer under a synchronous input clock as defined in clause 17.7.4.1 of [ITU-T G.709]. - -**Buffer size:** In the presence of jitter as described for each client in [ITU-T G.8251], this mapping process shall not introduce any errors. The maximum buffer hysteresis, and therefore the maximum phase error introduced, shall be as listed in Table 14-18. - -**Lane processing:** For multilane Ethernet interfaces, lane reordering is needed. The process is depicted in Figure 14-46 and described in clauses 17.7.4.1 and 17.7.5.1 of [ITU-T G.709]. - -### Incoming PCS BIP monitoring and mask insertion and OTN section BIP generation - -- For ETC40GR multilane interfaces, an error mask is to be calculated over the PCSL BIP of the incoming signal. For the OTN section, a BIP has to be calculated on the descrambled - -datastream and after error control block insertion. The "OTN BIP" and the error mask will be transmitted together in the transcoded lane marker. See Annex E of [ITU-T G.709] and Figure 14-46a. - -- For ETC100GR multilane interfaces, the incoming PCSL BIP will be transparently transmitted, errored 66B blocks will not be replaced with error control blocks and the scrambled PCS data will be passed through transparently. See Annex E of [ITU-T G.709] and Figure 14-46b. - -**PCS BIP monitoring:** The BIP violations of the PCS lanes shall be counted and presented to the management interface. - -**JC bytes:** The function shall insert the justification control (JC) bytes. As specified in clause 17.7 of [ITU-T G.709], $C_m(t)$ and $\sum C_{nD}(t)$ values are determined every frame as specified in Annex D of [ITU-T G.709] and inserted into the JC1/2/3 and JC4/5/6 OPU overhead locations respectively. The value of n for the $\sum C_{nD}$ justification information is specified in clause 17.7 of [ITU-T G.709]. - -**PT:** The function shall insert the appropriate payload type code into the PT byte position of the PSI overhead, as defined in clause 15.9.2.1 of [ITU-T G.709]. - -**Client signal fail:** The function shall signal the failure of the client signal to the far end by use of the Bit 1 of the PSI[2] byte of the payload structure identifier, as defined in clause 17.1 of [ITU-T G.709]. - -**RES:** The function shall insert all-ZEROs into the RES bytes and reserved bits within the JC bytes. - -All other bits of the ODUk overhead should be sourced as "0"s, except the PMOH STAT field which should be set to the value "normal path signal" (001). - -![Functional block diagram of ODUkP/CBRx-g_A_So. The diagram shows a large grey box representing the function. Inputs from the top include CI_D, CI_CK, and CI_SSF (part of CBRx_CP). CI_D and CI_CK enter a 'Lane processing and transcoding (client specific)' block. This block outputs data (D) and clock (CK) to an 'Elastic store'. The Elastic store has a circular buffer representation with WR (write) and RD (read) pointers. The WR and RD signals are fed into a 'Sigma-delta based justification control and JC generation' block. This block also receives a JC signal. A 'Free-running clock generator (ODCa)' provides a clock (CK) which is divided by 122368 to produce FS, and then by 256 to produce MFS. These timing signals (CK, FS, MFS) are output at the bottom as AI_CK, AI_FS, and AI_MFS. The data from the elastic store is processed through several insertion blocks: 'Insert PT', 'Insert CSF' (which also takes CI_SSF), 'Insert RES', and 'ODUk OH is set to all-0's, except PM STAT = 001'. The final data output is AI_D at the bottom. A management interface signal MI_pN_PCS_BIP is shown on the right side. The entire block is labeled ODUkP/CBRx-g_A_So_MP on the right and ODUkP_AP at the bottom. Reference G.798(17)_F14-45 is noted.](f2e1a8f6118f3a062702aae017e04753_img.jpg) - -Functional block diagram of ODUkP/CBRx-g\_A\_So. The diagram shows a large grey box representing the function. Inputs from the top include CI\_D, CI\_CK, and CI\_SSF (part of CBRx\_CP). CI\_D and CI\_CK enter a 'Lane processing and transcoding (client specific)' block. This block outputs data (D) and clock (CK) to an 'Elastic store'. The Elastic store has a circular buffer representation with WR (write) and RD (read) pointers. The WR and RD signals are fed into a 'Sigma-delta based justification control and JC generation' block. This block also receives a JC signal. A 'Free-running clock generator (ODCa)' provides a clock (CK) which is divided by 122368 to produce FS, and then by 256 to produce MFS. These timing signals (CK, FS, MFS) are output at the bottom as AI\_CK, AI\_FS, and AI\_MFS. The data from the elastic store is processed through several insertion blocks: 'Insert PT', 'Insert CSF' (which also takes CI\_SSF), 'Insert RES', and 'ODUk OH is set to all-0's, except PM STAT = 001'. The final data output is AI\_D at the bottom. A management interface signal MI\_pN\_PCS\_BIP is shown on the right side. The entire block is labeled ODUkP/CBRx-g\_A\_So\_MP on the right and ODUkP\_AP at the bottom. Reference G.798(17)\_F14-45 is noted. - -**Figure 14-45 – ODUkP/CBRx-g\_A\_So function** - -![Figure 14-46a: Lane processing and timing transparent process of the ODUkP/CBRx-g_A_So function for ETC40GR clients. The diagram shows a signal flow starting from an ETC40GR interface (CI) through a 'Lane reordering' block. The output of 'Lane reordering' is split: one path goes to 'Extract PCSL BIP', which then connects to 'Descramble'. The 'Descramble' output goes to a large dashed box labeled 'Transcode Ctrl/Data' and 'Timing transparent transcode'. Inside this box, the signal goes through 'Transcode lane marker + Insert PCS error mask and OTN PCSL BIP', which then connects to 'Scramble Non-flag/parity'. The 'Scramble Non-flag/parity' output is split into 'Data' and 'Clock' (CI). Another path from 'Lane reordering' goes to 'Calculate PCSL BIP', which then connects to a summation node (+). The output of the summation node is labeled 'PCS error mask' and goes to the 'Transcode lane marker' block. A third path from 'Lane reordering' goes to 'Monitor PCSL BIP'.](7e1f88e0cc7be8060240e12252a833d1_img.jpg) - -Figure 14-46a: Lane processing and timing transparent process of the ODUkP/CBRx-g\_A\_So function for ETC40GR clients. The diagram shows a signal flow starting from an ETC40GR interface (CI) through a 'Lane reordering' block. The output of 'Lane reordering' is split: one path goes to 'Extract PCSL BIP', which then connects to 'Descramble'. The 'Descramble' output goes to a large dashed box labeled 'Transcode Ctrl/Data' and 'Timing transparent transcode'. Inside this box, the signal goes through 'Transcode lane marker + Insert PCS error mask and OTN PCSL BIP', which then connects to 'Scramble Non-flag/parity'. The 'Scramble Non-flag/parity' output is split into 'Data' and 'Clock' (CI). Another path from 'Lane reordering' goes to 'Calculate PCSL BIP', which then connects to a summation node (+). The output of the summation node is labeled 'PCS error mask' and goes to the 'Transcode lane marker' block. A third path from 'Lane reordering' goes to 'Monitor PCSL BIP'. - -G.798(17)-Amd.1(18)\_F14-46a - -**Figure 14-46a – Lane processing and timing transparent process of the ODUkP/CBRx-g\_A\_So function for ETC40GR clients** - -![Figure 14-46b: Lane processing process of the ODUkP/CBRx-g_A_So function for ETC100GR clients. The diagram shows a signal flow starting from an ETC100GR interface (CI) through a 'Lane reordering' block. The output of 'Lane reordering' is split: one path goes directly to 'Data' and 'Clock' (CI). Another path goes to 'Extract PCSL BIP', which then connects to 'Calculate PCSL BIP'. The 'Calculate PCSL BIP' output goes to a summation node (+). The output of the summation node goes to 'Monitor PCSL BIP'.](e67401bb970e10780dd4086d67c8195f_img.jpg) - -Figure 14-46b: Lane processing process of the ODUkP/CBRx-g\_A\_So function for ETC100GR clients. The diagram shows a signal flow starting from an ETC100GR interface (CI) through a 'Lane reordering' block. The output of 'Lane reordering' is split: one path goes directly to 'Data' and 'Clock' (CI). Another path goes to 'Extract PCSL BIP', which then connects to 'Calculate PCSL BIP'. The 'Calculate PCSL BIP' output goes to a summation node (+). The output of the summation node goes to 'Monitor PCSL BIP'. - -G.798(17)-Amd.1(18)\_F14-46b - -**Figure 14-46b – Lane processing process of the ODUkP/CBRx-g\_A\_So function for ETC100GR clients** - -***ETC1000X -specific GFP-T source processes*** - -See clause 8.5.4.2.1 of [ITU-T G.806]. 65B\_PAD insertion is disabled (RAdisable=true). GFP pFCS generation is disabled (FCSenable=false). The UPI value for transparent gigabit Ethernet shall be inserted (Table 6-3 of [ITU-T G.704]). The Ethernet codeword information is inserted into the client payload information field of the GFP-T frames according to clause 8 of [ITU-T G.704]. - -***Common GFP-T source processes*** - -See clause 8.5.3.1 of [ITU-T G.806]. GFP channel multiplexing is not supported (CMuxActive=false). - -![Timing transparent transcoding process for ETC1000X clients diagram](bb8035cd106b4d77b3615e90645f8e37_img.jpg) - -``` - -graph TD - ETC1000X_CP[ETC1000X_CP] -- CI_CK --> ETC1000X_Specific[ETC1000X specific GFP-T processes] - ETC1000X_CP -- CI_D --> ETC1000X_Specific - RAdisable_true[RAdisable=true] -.-> ETC1000X_Specific - ETC1000X_Specific -- GFP_FS --> Common[Common GFP-T processes] - ETC1000X_Specific -- GFP_Frame --> Common - Common -- CK --> CK_out[CK to buffer] - Common -- Data --> Data_out[Data] - -``` - -G.798(17)-Amd.1(18)\_F14-47 - -Timing transparent transcoding process for ETC1000X clients diagram - -**Figure 14-47 – Timing transparent transcoding process for ETC1000X clients** - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** - -The function shall perform the following performance monitoring primitives processing (see clause 6.5 of [ITU-T G.806]). The performance monitoring primitives shall be reported to the EMF. - -$$pN\_PCS\_BIP \leftarrow \sum nPCSL\_BIP$$ - -**14.3.8.2 ODUkP to CBRx adaptation sink function using GMP (ODUkP/CBRx-g\_A\_Sk)** - -The ODUkP/CBRx-g\_A\_Sk recovers the constant bit-rate client signal from the OPUk payload using the justification control information (JC overhead) of the previous frame to determine the number of client data byte blocks that were sent during the current frame, and the location of these data byte blocks within the payload area from the sigma-delta justification. It extracts the OPUk overhead (PT, JC, and RES) and monitors the reception of the correct payload type. Under signal fail condition, generic replacement signals, as given in Table 14-20, shall be inserted. - -**Table 14-20 – Defined replacement signals and jitter specification references for ODUk clients** - -| Client | PT | Replacement signal | Bit rate | Jitter standard | -|----------|------|--------------------|--------------------------------|-----------------------------------------| -| 155M | 0x0A | Generic-AIS | 155 520 kbit/s $\pm$ 20 ppm | [ITU-T G.825] | -| 622M | 0x0B | Generic-AIS | 622 080 kbit/s $\pm$ 20 ppm | [ITU-T G.825] | -| ETC1000X | 0x07 | Link fault | 1 250 000 kbit/s $\pm$ 100 ppm | [IEEE 802.3] | -| FC-100 | 0x0C | NOS | 1 062 500 kbit/s $\pm$ 100 ppm | [b-ANSI INCITS 352] | -| SBCON | 0x1A | NOS | 200 000 kbits $\pm$ 200 ppm | [b-ANSI INCITS 296] | -| DVB-ASI | 0x1B | Generic-AIS | 270 000 kbit/s $\pm$ 100 ppm | [ETSI TR 101 891],
[ETSI TR 101 290] | -| FC-200 | 0x0D | NOS | 2 125 000 (kbit/s) $\pm$ 100 | [b-ANSI INCITS 352] | -| ETC40GR | 0x07 | Local fault | 40 117 188 (kbit/s) $\pm$ 100 | [IEEE 802.3] | -| ETC100GR | 0x07 | Local fault | 103 125 000 (kbit/s) $\pm$ 100 | [IEEE 802.3] | - -The information flow and processing of the ODUkP/CBRx-g\_A\_Sk function is defined with reference to Figures 14-48, 14-49, 14-50 and 14-51. - -### Symbol - -![Figure 14-48: ODUkP/CBRx-g_A_Sk function symbol diagram. A trapezoidal block labeled 'ODUkP/CBRx-g' has an input arrow from the bottom labeled 'ODUkP_AP' and an output arrow pointing left labeled 'ODUkP/CBRx-g_A_Sk_MP'. A reference label 'G.798(17)_F14-48' is at the bottom right.](b43ec8e53bbe827c4572d9fd80ebc21a_img.jpg) - -Figure 14-48: ODUkP/CBRx-g\_A\_Sk function symbol diagram. A trapezoidal block labeled 'ODUkP/CBRx-g' has an input arrow from the bottom labeled 'ODUkP\_AP' and an output arrow pointing left labeled 'ODUkP/CBRx-g\_A\_Sk\_MP'. A reference label 'G.798(17)\_F14-48' is at the bottom right. - -Figure 14-48 – ODUkP/CBRx-g\_A\_Sk function - -### Interfaces - -Table 14-21 – ODUkP/CBRx-g\_A\_Sk inputs and outputs - -| Input(s) | Output(s) | -|----------------------------------------------------------------------------------------------|----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| ODUkP_AP:
ODUkP_AI_CK
ODUkP_AI_D
ODUkP_AI_FS
ODUkP_AI_MFS
ODUkP_AI_TSF | CBRx_CP:
CBRx_CI_CK
CBRx_CI_D
CBRx_CI_SSF
ODUkP/CBRx-g_A_Sk_MP:
ODUkP/CBRx-g_A_Sk_MI_cPLM
ODUkP/CBRx-g_A_Sk_MI_AcPT
ODUkP/CBRx-g_A_Sk_MI_cCSF
ODUkP/CBRx-g_A_Sk_MI_cLCS (Note)
ODUkP/CBRx-g_A_Sk_MI_pN_PCS_BIP (Note) | -| NOTE – Only applicable for ETC40GR and ETC100GR clients. | | - -### Processes - -**PT:** The function shall extract the PT byte from the PSI overhead as defined in clause 8.7.1.1. The accepted PT value is available at the MP (MI\_AcPT) and is used for PLM defect detection. - -**RES:** The value in the RES bytes shall be ignored. - -**JC:** The function shall interpret the justification control information in the JC bytes, as defined in clause 17.7 of [ITU-T G.709], from the current multiframe in order to determine the number of payload bytes for the following multiframe. RES bits in the JC shall be ignored. The function shall extract the $\sum C_{nD}(t)$ with n as per clause 17.7 of [ITU-T G.709]. - -**Lane processing and transcoding:** For multilane Ethernet interfaces, lane processing and transcoding (transcoding for ETC40GR) is needed. The process is depicted in Figures 14-50 and 14-51, and described in clauses 17.7.4.1 and 17.7.5.1 of [ITU-T G.709]. - -### BIP correction: - -- For ETC40GR multilane interfaces, the PCSL BIP error mask is to be extracted and an OTN BIP error mask is calculated before scrambling. Both error masks are used for calculating an adjusted PCSL BIP which will be inserted. See Annex E of [ITU-T G.709] and Figure 14-50. -- For ETC100GR multilane interfaces, the incoming PCSL BIP will be transparently transmitted. See Annex E of [ITU-T G.709] and Figure 14-51. - -**Client signal fail:** The function shall extract the CSF signal indicating the failure of the client signal out of Bit 1 of the PSI[2] byte of the payload structure identifier, as defined in clause 17.1 of [ITU-T G.709]. - -**Demapping, CBR clock generation:** The function shall provide an elastic store (buffer) process. The CBR data shall be written into the buffer from the data-bearing D bytes in the OPUk frames. The information extraction of the payload area shall be under the control of the sigma-delta based data/stuff distribution. The CBRx data (CI\_D) shall be read out of the buffer under the control of the CBRx clock (CI\_CK). - -The locations of the data and stuff bytes are determined based on the count value sent in the JC bytes of the immediately preceding frame, as defined in clause 17.7 of [ITU-T G.709]. When a stuff m-bit block is encountered in the payload area, the writing of one m-bit block into the buffer shall be cancelled once. For the GMP justification process, refer to Annex D of [ITU-T G.709]. - -*Smoothing and jitter limiting process:* The function shall provide for a clock smoothing and elastic store (buffer) process. The data signal shall be written into the buffer under the control of the associated (gapped) input clock. The data signal shall be read out of the buffer under the control of a smoothed (equally spaced) clock at a rate and frequency accuracy determined by the client signal rate at the input of the remote ODUkP/CBRx\_a\_So. The clock generation process for reading the data out of the buffer shall use the $\sum C_{nD}$ justification information with n as per clause 17.7 of [ITU-T G.709]. - -The clock parameters, including jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCp clock), apply. - -*Buffer size:* In the presence of jitter as specified for client signals in the standards given in Table 14-20, this justification process shall not introduce any errors. - -Following a step in frequency of the signal transported by the ODUkP\_AI (for example, due to reception of CBRx\_CI from a new CBR\_TT\_So at the far end or removal of the client replacement signal with a frequency offset), there will be a maximum recovery time of X seconds after which this process shall not generate any bit errors. The value of X is for further study; a value of 1 second has been proposed. - -NOTE 1 – Equipment developed prior to Edition 4.0 of this Recommendation will not support the CSF processing. - -![Block diagram of ODUkP/CBRx-g_A_Sk processes showing internal components and external interfaces.](29aa6165ccf449dee0b4335676fa7b1a_img.jpg) - -The diagram illustrates the internal architecture of the ODUkP/CBRx-g\_A\_Sk processes. It is divided into two main functional areas: **CBRx\_CP** (top) and **ODUkP\_AP** (bottom). - -- CBRx\_CP (CBRx Clock Processing):** - - Inputs: **CI\_D**, **CI\_CK**, and **CI\_SSF**. - - Internal components: **Replacement signal insertion**, **Replacement signal generator**, **Lane processing and transcoding (if needed)**, **Elastic store** (with **WR** and **RD** ports), **CBR clock generator (ODCp)**, **Consequent actions**, and **Defect correlations**. - - Outputs: **dLCS**, **MI\_pN\_PCS\_BIP**, **MI\_cPLM**, **MI\_cCSF**, and **MI\_cLCS**. - - Control signals: **aAIS**, **dPLM**, **AI\_TSF**, and **CK**. -- ODUkP\_AP (ODUkP Adaptation Processing):** - - Inputs: **AI\_D**, **AI\_MFS**, **AI\_CK**, **AI\_FS**, and **AI\_TSF**. - - Internal components: **Justification action**, **Sigma-delta justification control**, **Extract JC**, **Extract CSF**, **Extract PT**, and **PT process**. - - Outputs: **dCSF**, **dPLM**, and **MI\_AcPT**. - -External interface labels on the right side of the diagram include **ODUkP/CBRx-g\_A\_Sk\_MP**. - -Reference code: G.798(17)\_F14-49 - -Block diagram of ODUkP/CBRx-g\_A\_Sk processes showing internal components and external interfaces. - -Figure 14-49 – ODUkP/CBRx-g\_A\_Sk processes - -![Figure 14-50: Lane processing and timing transparent process of the ODUkP/CBRx-g_A_Sk function for ETC40GR clients. The diagram shows a sequence of processing blocks: 1027B block sync (receiving Data, Clock, and CI; outputting dLCS), Descramble Non-flag/parity, Timing transparent trans-decode, and Lane distribution. The output of Lane distribution goes to an ETC40GR interface via an Insert PCSL BIP block, with a CI input. A feedback loop from the Lane distribution output goes to an Extract PCS error Mask and OTN PCSL BIP block. This block outputs an OTN PCSL BIP and a PCS error mask. The OTN PCSL BIP is added (+) to the output of a Calculate expected OTN PCSL BIP block. The result is an OTN BIP error mask, which is added (+) to the output of a Calculate PCSL BIP block. The final result is sent to a Monitor PCSL BIP block. A Scramble Non SH block is also shown, receiving input from the Extract PCS error Mask and OTN PCSL BIP block and outputting to the Insert PCSL BIP block.](3c721884a92b102becb43b52f6110e47_img.jpg) - -Figure 14-50: Lane processing and timing transparent process of the ODUkP/CBRx-g\_A\_Sk function for ETC40GR clients. The diagram shows a sequence of processing blocks: 1027B block sync (receiving Data, Clock, and CI; outputting dLCS), Descramble Non-flag/parity, Timing transparent trans-decode, and Lane distribution. The output of Lane distribution goes to an ETC40GR interface via an Insert PCSL BIP block, with a CI input. A feedback loop from the Lane distribution output goes to an Extract PCS error Mask and OTN PCSL BIP block. This block outputs an OTN PCSL BIP and a PCS error mask. The OTN PCSL BIP is added (+) to the output of a Calculate expected OTN PCSL BIP block. The result is an OTN BIP error mask, which is added (+) to the output of a Calculate PCSL BIP block. The final result is sent to a Monitor PCSL BIP block. A Scramble Non SH block is also shown, receiving input from the Extract PCS error Mask and OTN PCSL BIP block and outputting to the Insert PCSL BIP block. - -G.798(17)-Amd.1(18)\_F14-50 - -**Figure 14-50 – Lane processing and timing transparent process of the ODUkP/CBRx-g\_A\_Sk function for ETC40GR clients** - -![Figure 14-51: Lane processing process of the ODUkP/CBRx-g_A_Sk function for ETC100GR clients. The diagram shows a sequence of processing blocks: 66B block sync (receiving Data, Clock, and CI; outputting dLCS), and Lane distribution. The output of Lane distribution goes to an ETC100GR interface via a CI input. A feedback loop from the Lane distribution output goes to an Extract PCSL BIP block. This block outputs to a Calculate PCSL BIP block. The output of the Calculate PCSL BIP block is added (+) to the output of the Extract PCSL BIP block. The final result is sent to a Monitor PCSL BIP block.](7c19fc92dc74a74ec346d46bc39a3946_img.jpg) - -Figure 14-51: Lane processing process of the ODUkP/CBRx-g\_A\_Sk function for ETC100GR clients. The diagram shows a sequence of processing blocks: 66B block sync (receiving Data, Clock, and CI; outputting dLCS), and Lane distribution. The output of Lane distribution goes to an ETC100GR interface via a CI input. A feedback loop from the Lane distribution output goes to an Extract PCSL BIP block. This block outputs to a Calculate PCSL BIP block. The output of the Calculate PCSL BIP block is added (+) to the output of the Extract PCSL BIP block. The final result is sent to a Monitor PCSL BIP block. - -G.798(17)-Amd.1(18)\_F14-51 - -**Figure 14-51 – Lane processing process of the ODUkP/CBRx-g\_A\_Sk function for ETC100GR clients** - -For ETC1000X clients, the function shall also provide a GFP-T extraction process. This synchronous transcoding sub-process is depicted in Figure 14-52. - -![Timing transparent transcoding process for ETC1000X clients diagram](25b2ef5bcf30bfa9a31d59f48fddb3a7_img.jpg) - -The diagram illustrates the timing transparent transcoding process for ETC1000X clients. It shows three main components: ETC1000X\_CP at the top, ETC1000X specific GFP-T processes in the middle, and Common GFP-T processes at the bottom. Inputs to the Common GFP-T processes are CK from buffer and Data. The Common GFP-T processes output GFP\_FS and GFP\_Frame to the ETC1000X specific GFP-T processes. The ETC1000X specific GFP-T processes output CI\_CK and CI\_D to the ETC1000X\_CP. - -``` - -graph TD - subgraph ETC1000X_CP - CI_CK[CI_CK] - CI_D[CI_D] - end - ETC1000X_specific[ETC1000X specific GFP-T processes] - Common[Common GFP-T processes] - CK[CK from buffer] - Data[Data] - - CK --> Common - Data --> Common - Common -- GFP_FS --> ETC1000X_specific - Common -- GFP_Frame --> ETC1000X_specific - ETC1000X_specific -- CI_CK --> CI_CK - ETC1000X_specific -- CI_D --> CI_D - -``` - -Timing transparent transcoding process for ETC1000X clients diagram - -G.798(17)-Amd.1(18)\_F14-52 - -**Figure 14-52 – Timing transparent transcoding process for ETC1000X clients** - -NOTE 2 – No detection and alarming as well as PM of the GFP related defects and indicators is required as the GFP process is used as mapping only and due to the 1/1 relation to the ODU0 all errors are visible on the ODU layer already. This means a detection of the related GFP defined indicators does not add any additional information about the cause of degradation. - -#### ***ETC1000X-specific GFP-T sink processes*** - -See clause 8.5.4.2.2 of [ITU-T G.806]. GFP pFCS checking and GFP p\_FCSError are not supported (FCSdiscard=false). The UPI value for transparent gigabit Ethernet shall be expected (Table 6-3 of [ITU-T G.704]). GFP performance monitoring (p\_FDis, p\_CRC16Error) is not supported. The Ethernet codeword information is extracted from the client payload information field of the GFP-T frames according to clause 8 of [ITU-T G.704]. - -#### ***Common GFP-T sink processes*** - -See clause 8.5.3.2 of [ITU-T G.806]. GFP channel multiplexing is not supported (CMuxActive=false). GFP performance monitoring (p\_FDis) is not supported. - -#### **Defects** - -The function shall detect dPLM. - -**dPLM:** See clause 6.2.4.1. The expected payload types are defined in clause 15.9.2.1 of [ITU-T G.709]. - -**dCSF:** See clause 6.2.10. - -**dLCS:** For ETC100GR clients, see clause 6.2.5.7.1; for ETC40GR clients, see clause 6.2.5.7.2; for other clients dLCS shall be assumed false. - -#### **Consequent actions** - -aSSF ← AI\_TSF or dPLM or dLCS - -aAIS ← AI\_TSF or dPLM or dLCS - -NOTE – The state of the determination process of the Cm and its contribution to AIS consequent action are for further study. - -On declaration of aAIS, the function shall output a client replacement signal as defined in Table 14-20 within two frames. On clearing aAIS, the client replacement signal shall be removed within two frames and normal data being output. The client replacement signal clock start shall be independent from the incoming clock. The client replacement signal clock has to be within the frequency, jitter, and wander tolerance specifications of the associated client signal. - -## Defect correlations - -cPLM $\leftarrow$ dPLM and (not AI\_TSF) - -cCSF $\leftarrow$ dCSF and (not dPLM) and (not AI\_TSF) - -cLCS $\leftarrow$ dLCS and (not dCSF) and (not dPLM) and (not AI\_TSF) - -## Performance monitoring - -The function shall perform the following performance monitoring primitives processing (see clause 6.5 of [ITU-T G.806]). The performance monitoring primitives shall be reported to the EMF. - -pN\_PCS\_BIP $\leftarrow \sum n$ PCSL\_BIP - -### 14.3.9 ODUkP to ODU[i]j adaptation function (ODUkP/ODU[i]j\_A) - -The ODUkP to ODU[i]j adaptation functions perform the adaptation between the ODUkP ( $k = 1, 2, 3$ ) layer adapted information and the characteristic information of ODUj ( $j = 0, 1, 2; j < k$ ) [and ODUi ( $i = 1; i < j$ )] signals. - -![Diagram of the ODUkP/ODU[i]j_A function. A central trapezoidal block is labeled 'ODUkP/ODU[i]j'. Above it, multiple tributary ports are shown, labeled 'Tributary ports' and numbered 1, 2, ..., n, 1, 2, ..., m. These ports are associated with 'ODUj_CPs' and '[ODUi_CPs]'. Arrows point from these ports down into the central block. Below the central block, an arrow points down to a label 'ODUkP_AP'. To the right of the central block, the text 'G.798(17)_F14-53' is present.](625663deae3d429f79ae6d2781986e2c_img.jpg) - -Diagram of the ODUkP/ODU[i]j\_A function. A central trapezoidal block is labeled 'ODUkP/ODU[i]j'. Above it, multiple tributary ports are shown, labeled 'Tributary ports' and numbered 1, 2, ..., n, 1, 2, ..., m. These ports are associated with 'ODUj\_CPs' and '[ODUi\_CPs]'. Arrows point from these ports down into the central block. Below the central block, an arrow points down to a label 'ODUkP\_AP'. To the right of the central block, the text 'G.798(17)\_F14-53' is present. - -Figure 14-53 – ODUkP/ODU[i]j\_A function - -Five different types of functions are possible: - -- the ODU1P/ODU0\_A performs multiplexing/demultiplexing of 2 ODU0 into an ODU1; -- the ODU2P/ODU1\_A performs multiplexing/demultiplexing of 4 ODU1 into an ODU2; -- the ODU3P/ODU1\_A performs multiplexing/demultiplexing of 16 ODU1 into an ODU3; -- the ODU3P/ODU2\_A performs multiplexing/demultiplexing of 4 ODU2 into an ODU3; -- the ODU3P/ODU12\_A performs multiplexing/demultiplexing of ODU1 and ODU2 into an ODU3. - -The maximum number of tributary ports depends on the specific function type as listed in Table 14-22. Note that for the ODU3P/ODU12\_A function, only a subset of the tributary signals can be active and transported via the ODU3 at one time. The number of active ODU1 ports plus four times the number of active ODU2 ports is limited to 16. The multiplex structure identifier (MSI) defines the configuration in this case. - -Note that the ODU3P/ODU12\_A function can interwork with the ODU2P/ODU1\_A, ODU3P/ODU1\_A and ODU3P/ODU2\_A functions as it supports all related multiplex structures. - -**Table 14-22 – ODUkP/ODU[i]j\_A tributary ports** - -| Function type | n ports | m ports | -|---------------|---------|---------| -| ODU1P/ODU0_A | 2 ODU0 | – | -| ODU2P/ODU1_A | 4 ODU1 | – | -| ODU3P/ODU1_A | 16 ODU1 | – | -| ODU3P/ODU2_A | 4 ODU2 | – | -| ODU3P/ODU12_A | 16 ODU1 | 4 ODU2 | - -#### 14.3.9.1 ODUkP to ODU[i]j adaptation source function (ODUkP/ODU[i]j\_A\_So) - -The ODUkP/ODU[i]j\_A\_So function creates the ODUk signal from a free-running clock. It asynchronously maps the $n \times \text{ODUj}$ [and $m \times \text{ODUi}$ ] client signal from the ODUj\_ [and ODUi] CPs into ODTUjk[/ik] including justification control (JC) information. The ODTUjk[/ik] are multiplexed into the payload area of the OPUk. It adds OPUk overhead (RES, PT, MSI) and default ODUk overhead. It provides access to ODUk PM APS overhead. It provides access to the ODUj [/i] APS overhead. - -The information flow and processing of the ODUkP/ODU[i]j\_A\_So function is defined with reference to Figures 14-54, 14-55 and 14-56. - -##### Symbol - -![Diagram of the ODUkP/ODU[i]j_A_So function symbol. The symbol is a trapezoid labeled 'ODUkP/ODU[i]j'. Inputs from the top are tributary ports labeled 1, 2, ..., n for 'ODUj_CPs' and 1, 2, ..., m for '[ODUi_CPs]'. Inputs from the left are 'ODUkP/ODU[i]j_A_So_MP' and 'ODUk_PP'. The output at the bottom is 'ODUkP_AP'. A reference label 'G.798(17)_F14-54' is present near the bottom right of the symbol.](4df70569f4cc27db5625fc75bdff68cf_img.jpg) - -Diagram of the ODUkP/ODU[i]j\_A\_So function symbol. The symbol is a trapezoid labeled 'ODUkP/ODU[i]j'. Inputs from the top are tributary ports labeled 1, 2, ..., n for 'ODUj\_CPs' and 1, 2, ..., m for '[ODUi\_CPs]'. Inputs from the left are 'ODUkP/ODU[i]j\_A\_So\_MP' and 'ODUk\_PP'. The output at the bottom is 'ODUkP\_AP'. A reference label 'G.798(17)\_F14-54' is present near the bottom right of the symbol. - -**Figure 14-54 – ODUkP/ODU[i]j\_A\_So function** - -## Interfaces - -**Table 14-23 – ODUkP/ODU[i]j\_A\_So inputs and outputs** - -| Input(s) | Output(s) | -|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|------------------------------------------------------------------------------| -| n × ODUj_CP:
ODUj_CI_CK
ODUj_CI_D
ODUj_CI_FS
ODUj_CI_MFS
ODUj_CI_APS
m × ODUi_CP: (Note)
ODUi_CI_CK
ODUi_CI_D
ODUi_CI_FS
ODUi_CI_MFS
ODUi_CI_APS
ODUk_PP:
ODUk_PI_APS
ODUkP/ODU[i]j_A_So_MP:
ODU3P/ODU12_A_So_MI_TxMSI (Note)
ODUkP/ODU[i]j_A_So_MI_AdminState [1..(n+m)]
ODUkP/ODU[i]j_A_So_MI_APS_EN [1..(n+m)]
ODUkP/ODU[i]j_A_So_MI_APS_LVL[1..(n+m)] | ODUkP_AP:
ODUkP_AI_CK
ODUkP_AI_D
ODUkP_AI_FS
ODUkP_AI_MFS | -| NOTE – For ODU3P/ODU12_A_So only. | | - -## Processes - -The processes associated with the ODUkP/ODU[i]j\_A\_So function are specific processes for each ODUj[i]/\_CP and common processes for the compound (multiplexed) signal as depicted in Figures 14-55 and 14-56. - -![Block diagram of ODUkP/ODU[i]j_A_So processes showing client-specific processes, a multiplexer, and a multiplex structure with various control signals and a clock generator.](d9862ac8473902e7dfe441c5e88d47d8_img.jpg) - -The diagram illustrates the ODUkP/ODU[i]j\_A\_So processes. At the top, multiple client-specific processes are shown, labeled ODUj\_CP[1] ... ODUj\_CP[n] and ODUi\_CP[1] ... ODUi\_CP[m]. Each process has input signals CL\_MFS, CL\_FS, CL\_CK, CL\_D, and CL\_APS, and output signals MI\_AdminState, MI\_APS\_EN, and MI\_APS\_LVL. These processes are connected to a central Multiplexer. The Multiplexer outputs signals MFS, FS, CK, D, and TS# to the Multiplex structure. The Multiplex structure contains several components: Multiplex structure identifier (MSI), Payload type (PT), RES, ODUk PM APS, and a block for ODUk OH (set to all-0's, except PM STAT = 001). The MSI is connected to MI\_TxMSI. The ODUk PM APS is connected to PI\_APS. The ODUk OH block is connected to a clock generator (ODCa) via a 1/256 divider and a 1/122368 divider. The clock generator outputs AI\_D, AI\_MFS, AI\_FS, and AI\_CK signals. The entire system is labeled ODUkP/ODU[i]j\_A\_So\_MP on the right. The bottom section is labeled ODUk\_PP and the overall output section is labeled ODUkP\_AP. The diagram is identified by the code G.798(17)\_F14-55. - -Block diagram of ODUkP/ODU[i]j\_A\_So processes showing client-specific processes, a multiplexer, and a multiplex structure with various control signals and a clock generator. - -Figure 14-55 – ODUkP/ODU[i]j\_A\_So processes - -![Figure 14-56 – ODUkP/ODUj[i]j_A_So client specific processes. This block diagram illustrates the internal processing of client signals within an ODUj_CP[p] container. The container is divided into two main sections: CI_MFS, CI_FS, CI_CK on the left, and CI_D, CI_APS on the right. The CI_MFS, CI_FS, and CI_CK signals are inputs to an 'ODU-LCK generator'. The output of the generator is split into 'LCK' and 'Normal' paths, which are then combined by a 'Select normal/LCK' block. This block also receives an external 'MI_AdminState[p]' signal. The output of the 'Select normal/LCK' block is fed into the 'FAS/MFAS insertion' block. The 'CI_D' signal is also input to the 'FAS/MFAS insertion' block. The output of the 'FAS/MFAS insertion' block is split into 'CK' and 'D' paths. The 'CK' path is input to an 'Elastic store' (represented by a circular buffer icon). The 'D' path is input to the 'Elastic store' via a 'WR' (write) signal. The 'Elastic store' has 'WR' and 'RD' (read) signals. The 'RD' signal is input to a 'Justification control and JC generation' block. This block also receives 'JC' (justification control) signals from the 'Elastic store'. The output of the 'Justification control and JC generation' block is fed into the 'ODUj APS' block. The 'ODUj APS' block also receives external 'MI_APS_EN[p]' and 'MI_APS_LVL[p]' signals. The output of the 'ODUj APS' block is fed into the 'CI_APS' signal. The entire process is labeled 'G.798(17)_F14-56'.](bd0fe87fe6e236bc4778830b4f26d9e2_img.jpg) - -Figure 14-56 – ODUkP/ODUj[i]j\_A\_So client specific processes. This block diagram illustrates the internal processing of client signals within an ODUj\_CP[p] container. The container is divided into two main sections: CI\_MFS, CI\_FS, CI\_CK on the left, and CI\_D, CI\_APS on the right. The CI\_MFS, CI\_FS, and CI\_CK signals are inputs to an 'ODU-LCK generator'. The output of the generator is split into 'LCK' and 'Normal' paths, which are then combined by a 'Select normal/LCK' block. This block also receives an external 'MI\_AdminState[p]' signal. The output of the 'Select normal/LCK' block is fed into the 'FAS/MFAS insertion' block. The 'CI\_D' signal is also input to the 'FAS/MFAS insertion' block. The output of the 'FAS/MFAS insertion' block is split into 'CK' and 'D' paths. The 'CK' path is input to an 'Elastic store' (represented by a circular buffer icon). The 'D' path is input to the 'Elastic store' via a 'WR' (write) signal. The 'Elastic store' has 'WR' and 'RD' (read) signals. The 'RD' signal is input to a 'Justification control and JC generation' block. This block also receives 'JC' (justification control) signals from the 'Elastic store'. The output of the 'Justification control and JC generation' block is fed into the 'ODUj APS' block. The 'ODUj APS' block also receives external 'MI\_APS\_EN[p]' and 'MI\_APS\_LVL[p]' signals. The output of the 'ODUj APS' block is fed into the 'CI\_APS' signal. The entire process is labeled 'G.798(17)\_F14-56'. - -**Figure 14-56 – ODUkP/ODUj[i]j\_A\_So client specific processes** - -### Specific processes - -The specific processes are performed independently for each ODUj [and ODUi] client signal that is multiplexed into the ODUk. The specific processes perform the mapping of the ODUj[i] into an ODTUjk[ik]. - -**FAS/MFAS insertion:** The function shall extend the ODUj[i] with the frame alignment overhead (FAS and MFAS) in row one, bytes 1 to 7, as described in clause 15.6.2 of [ITU-T G.709]. Bytes 8 to 14 of row one are set to all-ZEROs. - -**Mapping, frequency justification and bit-rate adaptation:** The function shall provide an elastic store (buffer) process for the ODUj[i] client signal. The data signal ODUj[i]\_CI shall be written into the buffer under the control of the associated input clock. The data shall be read out of the buffer and written onto the D, NJO, PJO1 and PJO2 bytes of the selected ODTUjk[ik] frame under the control of the ODUk clock and justification decisions, as defined in clause 19.5 of [ITU-T G.709]. - -A justification decision shall be performed every second frame for the ODTU01, every fourth frame for the ODTU12, every sixteenth frame for the ODTU13 and four times every sixteen frames for the ODTU23. Each justification decision results in a corresponding double positive, positive, negative or no justification action. Upon a double positive justification action, the reading of two data bytes out of the buffer shall be cancelled once. No ODUj[i] data shall be written onto the PJO2, PJO1 or NJO bytes. Upon a positive justification action, the reading of one data byte out of the buffer shall be cancelled once. No ODUj[i] data shall be written onto the PJO1 or NJO bytes and data shall be written onto the PJO2 byte. Upon a negative justification action, one extra data byte shall be read once out of the buffer. ODUj[i] data shall be written onto the PJO2, PJO1 and NJO bytes. If no justification action is to be performed, ODUj[i] data shall be written onto the PJO2 and PJO1 bytes. - -and no ODUj[i] data shall be written onto the NJO byte. The ODUk frame that contains the PJO2, PJO1 and NJO bytes depends on the time slot(s) of the ODTUjk[i/k]. - -The justification decisions determine the phase error introduced by the function. - -*Buffer size:* In the presence of jitter as specified by [ITU-T G.8251] and a frequency within the range $239/(239 - j[i]) \times 4^{(j[i]-1)} \times 2\,488\,320\text{ kHz} \pm 20\text{ ppm}$ ( $j = 1, 2; i = 1$ ) and $1\,244\,160\text{ kHz} \pm 20\text{ ppm}$ ( $j = 0$ ), this mapping process shall not introduce any errors. The maximum buffer hysteresis, and therefore the maximum phase error introduced, shall be as listed in Table 14-24. - -**Table 14-24 – Maximum buffer hysteresis** - -| Mapping | Maximum buffer hysteresis | -|---------------------|---------------------------| -| ODU0 → ODU1 | 1 byte | -| ODU1 → ODU2 or ODU3 | 2 bytes | -| ODU2 → ODU3 | 8 bytes | - -**JC:** The function shall generate the justification control bits based on the justification decision (double positive, positive, negative, none) according to the specification in clause 19.5 of [ITU-T G.709]. It shall insert the justification control bits in bit 7 and 8 of all three JC bytes of the frame in which the justification is performed. The remaining (RES) bits of the JC byte shall be set to all-ZEROs. The ODUk frame that contains the JC bytes depends on the time slot(s) of the ODTUjk[i/k]. - -**ODUj[i] server layer APS:** When APS is enabled for tributary signal #p (MI\_APS\_EN[p] is true), the function shall insert the CI\_APS value into the ODU APS/PCC[MI\_APS\_LVL[p]] field, which is available once per eight ODU frames when the value of the MFAS bits 6, 7, 8 is equal to MI\_APS\_LVL[p]. - -**NOTE –** The ODUj[i] server layer section APS information may be present in the case where the ODUj[i] signal contains an ODU-AIS, ODU-LCK or ODU-OCI maintenance signal. The ODU-LCK maintenance signal may be inserted in this adaptation source function. ODUj[i] SNC/I protection is unable to detect the insertion of such ODU-LCK and will not perform a protection switch. - -**ODU-LCK:** The function shall generate the ODU-LCK signal as defined in clause 16.5 of [ITU-T G.709]. The clock, frame start and multiframe start are defined by the incoming ODUk signal. - -**Selector:** The normal signal for a tributary signal #p may be replaced by the ODU-LCK signal. ODU-LCK signal is selected if the MI\_AdminState [p] is LOCKED. - -### Common processes - -**Clock and (multi)frame start signal generation:** The function shall generate a local ODUk clock (ODUKP\_AI\_CK) of $239/(239 - k) \times 4^{(k-1)} \times 2\,488\,320\text{ kHz} \pm 20\text{ ppm}$ from a free-running oscillator. The clock parameters, including jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCa clock), apply. - -The function shall generate the (multi)frame start reference signals AI\_FS and AI\_MFS for the ODUk signal. The AI\_FS signal shall be active once per 122 368 clock cycles. AI\_MFS shall be active once every 256 frames. - -**Multiplexing:** The function assigns the individual ODTUjk[i/k] to specific time slots of the OPUk payload area as defined by the multiplex structure (see clauses 19.3 and 19.4.1 of [ITU-T G.709]). - -**MSI:** The function shall insert the TxMSI into the MSI byte positions of the PSI overhead as defined in clause 19.4 of [ITU-T G.709]. The TxMSI value, and as such the multiplex structure, is either fixed or configurable via MI\_TxMSI as shown in Table 14-25. - -**PT:** The function shall insert code "0010 0000" (ODU multiplex structure) into the PT byte position of the PSI overhead as defined in clause 15.9.2.1 of [ITU-T G.709]. - -**ODUk PM APS:** The function shall insert the PI\_APS value into the ODUk path APS/PCC field, which is available once per eight ODUk frames when MFAS bits 6, 7, 8 are 000. - -**RES:** The function shall insert all-ZEROs into the RES bytes. - -All other bits of the ODUk overhead should be sourced as "0"s, except the PMOH STAT field which should be set to the value "normal path signal" (001). - -**Table 14-25 – Multiplex structure configuration and TxMSI values** - -| Function | Multiplex structure | TxMSI value for fixed multiplex structure | -|---------------|-------------------------|--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| ODU1P/ODU0_A | Fixed
2 ODU0 → ODU1 | 11 000000
11 000001 | -| ODU2P/ODU1_A | Fixed
4 ODU1 → ODU2 | 00 000000
00 000001
00 000010
00 000011 | -| ODU3P/ODU1_A | Fixed
16 ODU1 → ODU3 | 00 000000
00 000001
00 000010
00 000011
00 000100
00 000101
00 000110
00 000111
00 001000
00 001001
00 001010
00 001011
00 001100
00 001101
00 001110
00 001111 | -| ODU3P/ODU2_A | Fixed
4 ODU2 → ODU3 | 01 000000
01 000001
01 000010
01 000011
01 000000
01 000001
01 000010
01 000011
01 000000
01 000001
01 000010
01 000011
01 000000
01 000001
01 000010
01 000011 | -| ODU3P/ODU12_A | Configured via MI_TxMSI | – | - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -#### 14.3.9.2 ODUkP to ODU[i]j adaptation sink function (ODUkP/ODU[i]j\_A\_Sk) - -The ODUkP/ODU[i]j\_A\_Sk function extracts the OPUk overhead (PT, MSI, RES) and monitors the reception of the correct payload type. It demultiplexes the individual ODTUjk[/ik] from the payload area of the OPUk and recovers the $n \times \text{ODUj}$ [and $m \times \text{ODUi}$ ] client signals using the justification control information (JC overhead). It determines the frame and multiframe structure of the ODUj[/i]. It provides access to ODUk PM APS overhead. It provides access to the ODUj [/i] APS overhead. - -The information flow and processing of the ODUkP/ODU[i]j\_A\_Sk function is defined with reference to Figures 14-57, 14-58 and 14-59. - -#### Symbol - -![Diagram of the ODUkP/ODU[i]j_A_Sk function symbol. The symbol is a trapezoid labeled 'ODUkP/ODU[i]j'. On the left, two input arrows are labeled 'ODUkP/ODU[i]j_A_Sk_MP' and 'ODUk_PP'. On the right, an input arrow is labeled 'ODUkP_AP'. Above the symbol, multiple output arrows represent tributary ports. These are grouped into two sets: 'ODUj_CPs' with ports 1, 2, ..., n; and '[ODUi_CPs]' with ports 1, 2, ..., m. The label 'Tributary port' is above the first two ports. A reference label 'G.798(17)_F14-57' is at the bottom right of the symbol.](e579f4085bfb7766ce76d03036f97e36_img.jpg) - -``` - -graph TD - subgraph Symbol - F[ODUkP/ODU[i]j] - end - MP([ODUkP/ODU[i]j_A_Sk_MP]) <--> F - PP([ODUk_PP]) --> F - AP([ODUkP_AP]) --> F - F --> CPj1([ODUj_CPs 1]) - F --> CPj2([ODUj_CPs 2]) - F --> CPjn([ODUj_CPs n]) - F --> CPi1([ODUi_CPs 1]) - F --> CPi2([ODUi_CPs 2]) - F --> CPim([ODUi_CPs m]) - -``` - -Diagram of the ODUkP/ODU[i]j\_A\_Sk function symbol. The symbol is a trapezoid labeled 'ODUkP/ODU[i]j'. On the left, two input arrows are labeled 'ODUkP/ODU[i]j\_A\_Sk\_MP' and 'ODUk\_PP'. On the right, an input arrow is labeled 'ODUkP\_AP'. Above the symbol, multiple output arrows represent tributary ports. These are grouped into two sets: 'ODUj\_CPs' with ports 1, 2, ..., n; and '[ODUi\_CPs]' with ports 1, 2, ..., m. The label 'Tributary port' is above the first two ports. A reference label 'G.798(17)\_F14-57' is at the bottom right of the symbol. - -**Figure 14-57 – ODUkP/ODU[i]j\_A\_Sk function** - -## Interfaces - -Table 14-26 – ODUkP/ODU[i]j\_A\_Sk inputs and outputs - -| Input(s) | Output(s) | -|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| ODUkP_AP:
ODUkP_AI_CK
ODUkP_AI_D
ODUkP_AI_FS
ODUkP_AI_MFS
ODUkP_AI_TSF
ODUkP_AI_TSD
ODUkP/ODU[i]j_A_Sk_MP:
ODU3P/ODU12_A_Sk_MI_ExMSI[1..(n+m)]
ODUkP/ODU[i]j_A_Sk_MI_AdminState[1..(n+m)]
ODUkP/ODU[i]j_A_Sk_MI_APS_EN[1..(n+m)]
ODUkP/ODU[i]j_A_Sk_MI_APS_LVL[1..(n+m)] | n × ODUj_CP:
ODUj_CI_CK
ODUj_CI_D
ODUj_CI_FS
ODUj_CI_MFS
ODUj_CI_SSF
ODUj_CI_SSD
ODUj_CI_APS
m × ODUi_CP: (Note)
ODUi_CI_CK
ODUi_CI_D
ODUi_CI_FS
ODUi_CI_MFS
ODUi_CI_SSF
ODUj_CI_SSD
ODUi_CI_APS
ODUk_PP:
ODUk_PI_APS
ODUk_PI_TSF
ODUk_PI_TSD
ODUkP/ODU[i]j_A_Sk_MP:
ODUkP/ODU[i]j_A_Sk_MI_cPLM
ODUkP/ODU[i]j_A_Sk_MI_cMSIM[1..(n+m)]
ODUkP/ODU[i]j_A_Sk_MI_AcPT
ODUkP/ODU[i]j_A_Sk_MI_AcMSI[1..(n+m)]
ODUkP/ODU[i]j_A_Sk_MI_cLOFLOM [1..(n+m)] | -| NOTE – For ODU3P/ODU12_A_Sk only. | | - -## Processes - -The processes associated with the ODUkP/ODU[i]j\_A\_Sk function are specific processes for each ODUj[i]j\_CP and common processes for the compound (multiplexed) signal as depicted in Figures 14-58 and 14-59. - -![Figure 14-58 – ODUkP/ODU[i]j_A_Sk processes. This block diagram illustrates the internal architecture of an ODUkP/ODU[i]j_A_Sk sink adaptation function. It shows the demultiplexing of an ODUk signal into multiple ODUj signals. The process includes MSI (Multiplex Structure Identifier) extraction and processing, PT (Payload Type) extraction and processing, and ODUk Path Monitoring APS (Automatic Protection Switching) processing. Defect correlations are performed to generate management information (MI) signals. The diagram details the flow of various signals including Adaptation Information (AI), Characteristic Information (CI), and Management Information (MI).](d5de4c1d2f0b71aa339b6b2118268fbb_img.jpg) - -``` - -graph TD - subgraph ODUkP_AP - AI_MFS --> MFS_bus - AI_FS --> FS_bus - AI_CK --> CK_bus - AI_D --> D_bus - AI_TSF --> TSF_bus - AI_TSD --> TSD_bus - end - - MFS_bus --> Demux - FS_bus --> Demux - CK_bus --> Demux - D_bus --> Demux - - D_bus --> Extract_MSI - Extract_MSI --> MSI_proc - MSI_proc --> MI_ExMSI - MSI_proc --> MI_AcMSI - MSI_proc --> dMSIM_bus - - D_bus --> Extract_PT - Extract_PT --> PT_proc - PT_proc --> MI_AcPT - PT_proc --> dPLM_signal - - D_bus --> ODUk_PM_APS - ODUk_PM_APS --> PI_APS - TSF_bus --> PI_TSF - TSD_bus --> PI_TSD - - Demux --> Client_Proc_1 - Demux --> Client_Proc_N - - dMSIM_bus --> Client_Proc_1 - dMSIM_bus --> Client_Proc_N - dPLM_signal --> Client_Proc_1 - dPLM_signal --> Client_Proc_N - TSF_bus --> Client_Proc_1 - TSF_bus --> Client_Proc_N - TSD_bus --> Client_Proc_1 - TSD_bus --> Client_Proc_N - - subgraph Defect_Correlations - AI_TSF_in --> DC - dPLM_in --> DC - DC --> MI_PLM - DC --> MI_cMSIM - DC --> MI_cLOFLOM - end - - Client_Proc_1 --> CI_ODUj_1 - Client_Proc_N --> CI_ODUj_N - -``` - -The diagram illustrates the internal architecture of an ODUkP/ODU[i]j\_A\_Sk process. At the top, multiple client-specific processes are shown, each with inputs like AI\_TSD, AI\_TSF, and dPLM, and outputs like dMSIM[1], MI\_cMSIM[1], MI\_cLOFLOM[1], MI\_AdminState[1], MI\_APS\_EN[1], and MI\_APS\_LVL[1]. These are connected to a central Demultiplexer. Below the demultiplexer, there are three parallel processing paths: 'Extract MSI' leading to an 'MSI process' which outputs MI\_ExMSI[1..(n+m)] and MI\_AcMSI[1..(n+m)]; 'Extract PT' leading to a 'PT process' which outputs MI\_AcPT; and 'ODUk PM APS' which outputs PI\_APS, PI\_TSF, and PI\_TSD. A 'Defect correlations' block receives AI\_TSF and dPLM inputs and outputs MI\_PLM, MI\_cMSIM[1..(n+m)], MI\_cLOFLOM[1..(n+m)], MI\_AdminState[1..(n+m)], MI\_APS\_EN[1..(n+m)], and MI\_APS\_LVL[1..(n+m)]. The bottom section shows the ODUkP\_AP layer with inputs AI\_MFS, AI\_FS, AI\_CK, AI\_D, AI\_TSF, and AI\_TSD. The entire diagram is labeled with G.798(17)\_F14-58 and includes various signal labels like CI\_MFS, CI\_FS, CI\_CK, CI\_D, CI\_APS, CI\_SSF, and CI\_SSD at the top. - -Figure 14-58 – ODUkP/ODU[i]j\_A\_Sk processes. This block diagram illustrates the internal architecture of an ODUkP/ODU[i]j\_A\_Sk sink adaptation function. It shows the demultiplexing of an ODUk signal into multiple ODUj signals. The process includes MSI (Multiplex Structure Identifier) extraction and processing, PT (Payload Type) extraction and processing, and ODUk Path Monitoring APS (Automatic Protection Switching) processing. Defect correlations are performed to generate management information (MI) signals. The diagram details the flow of various signals including Adaptation Information (AI), Characteristic Information (CI), and Management Information (MI). - -**Figure 14-58 – ODUkP/ODU[i]j\_A\_Sk processes** - -![Figure 14-59 – ODUkP/ODU[i]j_A_Sk client specific processes. This block diagram illustrates the internal processes of an ODU client. At the top, a bracket labeled 'ODUj_CP[p]' groups four output signals: 'CI_MFS', 'CI_FS', 'CI_CK', and 'CI_D'. Below this, a 'Select normal/AIS/LCK' block contains 'Normal', 'AIS', and 'LCK' options, with 'Generate AIS' and 'Generate LCK' blocks feeding into it. To the right, 'Consequent actions' blocks receive 'aAIS', 'aSSF', and 'aSSD' signals and output 'AI_TSD' and 'AI_TSF' signals. Further right, 'dPLM', 'dMSIM[p]', and 'dLOFLOM' signals feed into 'Defect correlations', which output 'dPLM', 'dMSIM[p]', 'MI_cMSIM[p]', and 'MI_cLOFLOM[p]' signals. The central part of the diagram shows 'Frame/multi-frame alignment' receiving 'MFS', 'FS', 'CK', and 'D' signals. Below it, an 'Elastic store' block with 'RD' (read) and 'WR' (write) ports is connected to 'Clock generation (ODCp)'. 'Justification control' and 'Extract JC' blocks are also connected to the 'Elastic store'. At the bottom, input signals 'MFS', 'FS', 'CK', 'D', 'TS#', and 'Active' are shown. Various management interfaces are labeled on the right, such as 'MI_AdminState[p]', 'MI_APS_EN[p]', 'MI_APS_LVL[p]', and 'AI_TSF'. A small label 'G.798(17)_F14-59' is at the bottom right of the diagram area.](0fdef87ff1fd322c626d1ff8df725749_img.jpg) - -Figure 14-59 – ODUkP/ODU[i]j\_A\_Sk client specific processes. This block diagram illustrates the internal processes of an ODU client. At the top, a bracket labeled 'ODUj\_CP[p]' groups four output signals: 'CI\_MFS', 'CI\_FS', 'CI\_CK', and 'CI\_D'. Below this, a 'Select normal/AIS/LCK' block contains 'Normal', 'AIS', and 'LCK' options, with 'Generate AIS' and 'Generate LCK' blocks feeding into it. To the right, 'Consequent actions' blocks receive 'aAIS', 'aSSF', and 'aSSD' signals and output 'AI\_TSD' and 'AI\_TSF' signals. Further right, 'dPLM', 'dMSIM[p]', and 'dLOFLOM' signals feed into 'Defect correlations', which output 'dPLM', 'dMSIM[p]', 'MI\_cMSIM[p]', and 'MI\_cLOFLOM[p]' signals. The central part of the diagram shows 'Frame/multi-frame alignment' receiving 'MFS', 'FS', 'CK', and 'D' signals. Below it, an 'Elastic store' block with 'RD' (read) and 'WR' (write) ports is connected to 'Clock generation (ODCp)'. 'Justification control' and 'Extract JC' blocks are also connected to the 'Elastic store'. At the bottom, input signals 'MFS', 'FS', 'CK', 'D', 'TS#', and 'Active' are shown. Various management interfaces are labeled on the right, such as 'MI\_AdminState[p]', 'MI\_APS\_EN[p]', 'MI\_APS\_LVL[p]', and 'AI\_TSF'. A small label 'G.798(17)\_F14-59' is at the bottom right of the diagram area. - -**Figure 14-59 – ODUkP/ODU[i]j\_A\_Sk client specific processes** - -### Common processes - -**PT:** The function shall extract the PT byte from the PSI overhead as defined in clause 8.7.1.1. The accepted PT value is available at the MP (MI\_AcPT) and is used for PLM defect detection. - -**MSI:** The function shall extract the MSI from the PSI overhead as defined in clause 8.7.2.1. The accepted MSI for a tributary signal #p (AcMSI[p]) is available at the MP (MI\_AcMSI[p]). The multiplex structure is defined by ExMSI[p], which is either fixed or is configurable via MI\_ExMSI[p] as shown in Table 14-27. - -**RES:** The value in the RES bytes shall be ignored. - -**ODUk PM APS:** The function shall extract the information from the ODUk path APS/PCC field, which is available once per eight ODUk frames when MFAS bits 6, 7, 8 are 000 and apply this to the PI\_APS. - -**Demultiplexing:** The function activates the ODTUjk[/ik] and assigns the time slots of the ODUk payload area to the individual ODTUjk[/ik] as defined by the multiplex structure (see clauses 19.3 and 19.4.1 of [ITU-T G.709]). - -**Table 14-27 – Multiplex structure configuration and ExMSI values** - -| Function | Multiplex structure | ExMSI value for fixed multiplex structure | -|---------------|-------------------------|--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| ODU1P/ODU0_A | Fixed
2 ODU0 → ODU1 | 11 000000
11 000001 | -| ODU2P/ODU1_A | Fixed
4 ODU1 → ODU2 | 00 000000
00 000001
00 000010
00 000011 | -| ODU3P/ODU1_A | Fixed
16 ODU1 → ODU3 | 00 000000
00 000001
00 000010
00 000011
00 000100
00 000101
00 000110
00 000111
00 001000
00 001001
00 001010
00 001011
00 001100
00 001101
00 001110
00 001111 | -| ODU3P/ODU2_A | Fixed
4 ODU2 → ODU3 | 01 000000
01 000001
01 000010
01 000011
01 000000
01 000001
01 000010
01 000011
01 000000
01 000001
01 000010
01 000011
01 000000
01 000001
01 000010
01 000011 | -| ODU3P/ODU12_A | Configured via MI_ | – | - -### Specific processes - -The specific processes are performed independently for each ODUj [and ODUi] client signal that is multiplexed into the ODUk. The specific processes recover the ODUj[/i] from the ODTUjk[/ik]. - -**JC:** The function shall interpret the justification control information in bits 7 and 8 of the JC bytes as defined in clause 19.5 of [ITU-T G.709] in order to determine the justification action (double positive, positive, negative, none) for the current frame. A two out of three majority decision is used. RES bits - -in the JC bytes shall be ignored. The ODUk frame that contains the JC bytes depends on the time slot(s) of the ODTUjk[/ik]. - -**Demapping, CBR clock generation:** The function shall provide an elastic store (buffer) process. The ODUj[/i] data shall be written into the buffer from the D, NJO, PJO1 and PJO2 bytes in the ODTUjk[/ik] frame. The information extraction of the PJO2, PJO1 and NJO bytes shall be under the control of the justification control information. The ODUj[/i] data (CI\_D) shall be read out of the buffer under the control of the ODUj[/i] clock (CI\_CK). - -Upon a double positive justification action, the writing of two data bytes into the buffer shall be cancelled once. No ODUj[/i] data shall be read from the PJO2, PJO1 or NJO bytes. Upon a positive justification action, the writing of one data byte into the buffer shall be cancelled once. No ODUj[/i] data shall be read from the PJO1 or NJO bytes and data shall be read from the PJO2 byte. Upon a negative justification action, one extra data byte shall be written into the buffer once. ODUj[/i] data shall be read from the PJO2, PJO1 and NJO bytes. If no justification action is to be performed, ODUj[/i] data shall be read from the PJO2 and PJO1 bytes and no ODUj[/i] data shall be read from the NJO bytes. The ODUk frame that contains the PJO2, PJO1 and NJO bytes depends on the time slot(s) of the ODTUjk[/ik]. - -*Smoothing and jitter limiting process:* The function shall provide for a clock smoothing and elastic store (buffer) process. The $239/(239 - j[i]) \times 4^{(j[i]-1)} \times 2\ 488\ 320$ kbit/s (j = 1, 2; i = 1) and 1 244 160 kHz ± 20 ppm (j = 0) data signal shall be written into the buffer under the control of the associated (gapped) input clock (with a frequency accuracy within ± 20 ppm). The data signal shall be read out of the buffer under the control of a smoothed (equally spaced) $239/(239 - j[i]) \times 4^{(j[i]-1)} \times 2\ 488\ 320$ kbit/s ± 20 ppm (j = 1, 2; i = 1) and 1 244 160 kHz ± 20 ppm (j = 0) clock (the rate is determined by the ODUj[/i] signal at the input of the remote ODUkP/ODU[i]j\_A\_So). - -The clock parameters, including jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCp clock), apply. - -**Buffer size:** In the presence of jitter as specified by [ITU-T G.8251] and a frequency within the range $239/(239 - j[i]) \times 4^{(j[i]-1)} \times 2\ 488\ 320$ kbit/s ± 20 ppm (j = 1, 2; i = 1) and 1 244 160 kHz ± 20 ppm (j = 0), this justification process shall not introduce any errors. - -Following a step in frequency of the $239/(239 - j[i]) \times 4^{(j[i]-1)} \times 2\ 488\ 320$ kbit/s (j = 1, 2; i = 1) and 1 244 160 kHz ± 20 ppm (j = 0) signal transported (for example, due to reception of ODUj[/i]\_CI from a new ODUj[/i]\_TT\_So at the far end or removal of a ODU AIS signal with a frequency offset), there will be a maximum recovery time of X seconds after which this process shall not generate any bit errors. The value of X is for further study; a value of one second has been proposed. - -**Frame and multiframe alignment:** The function shall perform frame and multiframe alignment as described in clause 8.2.3. - -**ODUj[/i]-LCK, ODUj[/i]-AIS:** The function shall generate the ODUj[/i]-LCK and ODUj[/i]-AIS signals as defined in [ITU-T G.709]. The clock, frame start and multiframes start shall be independent from the incoming clock. The clock has to be within $239/(239 - j[i]) \times 4^{(j[i]-1)} \times 2\ 488\ 320$ kHz ± 20 ppm (j = 1, 2; i = 1) and 1 244 160 kHz ± 20 ppm (j = 0). Jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCa clock), apply. - -**Selector:** The normal signal for a tributary signal #p may be replaced by either the ODUj[/i]-AIS or ODUj[/i]-LCK signal. ODUj[/i]-LCK is selected if the corresponding MI\_AdminState[p] signal is LOCKED. ODUj[/i]-AIS is selected if the corresponding MI\_AdminState[p] signal is not LOCKED and aAIS is true. - -**ODUj[i] server layer APS:** When APS is enabled for tributary signal #p (MI\_APS\_EN[p] is true), the function shall extract the information from the ODU APS/PCC[MI\_APS\_LVL[p]] field, which is available once per eight ODU frames when the value of the MFAS bits 6, 7, 8 is equal to MI\_APS\_LVL[p], and apply the extracted information to the CI\_APS. - -NOTE – The ODUj[i] server layer section APS information may be present in the case where the ODUj[i] signal contains an ODU-AIS, ODU-LCK or ODU-OCI maintenance signal. The ODU-LCK maintenance signal may have been inserted in the far-end adaptation source function. ODUj[i] SNC/I protection is unable to detect the insertion of such ODU-LCK and will not perform a protection switch. - -### Defects - -The function shall detect dPLM, dMSIM and dLOFLOM. - -**dPLM:** See clause 6.2.4.1. The expected payload type is "0010 0000" (ODU multiplex structure) as defined in [ITU-T G.709]. - -For each ODUj[i] tributary port #p: - -**dMSIM[p]:** See clause 6.2.9.1. dMSIM is detected per active ODUj[i]. - -**dLOFLOM[p]:** See clause 6.2.5.3. dLOFLOM is detected per active ODUj[i]. - -### Consequent actions - -$PI\_TSF \leftarrow AI\_TSF$ - -$PI\_TSD \leftarrow AI\_TSD$ - -For each ODUj[i] tributary port #p: - -$aSSF \leftarrow ((AI\_TSF \text{ or } dPLM \text{ or } dMSIM[p] \text{ or } dLOFLOM[p]) \text{ and } (\text{not } MI\_AdminState[p] = \text{LOCKED}))$ - -$aSSD \leftarrow AI\_TSD \text{ and } (\text{not } MI\_AdminState[p] = \text{LOCKED})$ - -$aAIS \leftarrow ((AI\_TSF \text{ or } dPLM \text{ or } dMSIM[p] \text{ or } dLOFLOM[p]) \text{ and } (\text{not } MI\_AdminState[p] = \text{LOCKED}))$ - -On declaration of aAIS, the function shall output an all-ONEs pattern/signal within two frames. On clearing aAIS, the all-ONEs pattern/signal shall be removed within two frames, with normal data being output. The AIS clock, frame start and multiframe start shall be independent from the incoming clock, frame start and multiframe start. The AIS clock has to be within $239/(239 - j[i]) \times 4^{(i-1)} \times 2\,488\,320 \text{ kHz} \pm 20 \text{ ppm}$ ( $j = 1, 2; i = 1$ ) and $1\,244\,160 \text{ kHz} \pm 20 \text{ ppm}$ ( $j = 0$ ). Jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCa clock), apply. - -### Defect correlations - -$cPLM \leftarrow dPLM \text{ and } (\text{not } AI\_TSF)$ - -For each ODUj[i] tributary port #p: - -$cMSIM[p] \leftarrow dMSIM[p] \text{ and } (\text{not } dPLM) \text{ and } (\text{not } AI\_TSF)$ - -$cLOFLOM[p] \leftarrow dLOFLOM[p] \text{ and } (\text{not } dPLM) \text{ and } (\text{not } AI\_TSF)$ - -**Performance monitoring:** None. - -### 14.3.10 ODUkP to ODUj payload type 21 adaptation function (ODUkP/ODUj-21\_A) - -The ODUkP to ODUj payload type 21 adaptation functions perform the adaptation between the ODUkP ( $k = 2, 3, 4, 25u, 25, 50u, 50$ ) layer adapted information and the characteristic information of ODUj ( $j = 0, 1, 2, 2e, 3, \text{flex}$ ) signals. - -![Diagram of the ODUkP/ODUj-21_A function. A central trapezoidal block labeled 'ODUkP/ODUj-21' has multiple tributary ports at the top, labeled 'Tributary port' and 'ODUj_CPs' with sub-labels 1, 2, ..., n. Each port has a double-headed vertical arrow. At the bottom, a single double-headed vertical arrow points to a label 'ODUkP_AP'. The text 'G.798(17)_F14-60' is in the bottom right corner.](32fef1546b300cd971dacf02ca1d21d7_img.jpg) - -Diagram of the ODUkP/ODUj-21\_A function. A central trapezoidal block labeled 'ODUkP/ODUj-21' has multiple tributary ports at the top, labeled 'Tributary port' and 'ODUj\_CPs' with sub-labels 1, 2, ..., n. Each port has a double-headed vertical arrow. At the bottom, a single double-headed vertical arrow points to a label 'ODUkP\_AP'. The text 'G.798(17)\_F14-60' is in the bottom right corner. - -**Figure 14-60 – ODUkP/ODUj-21\_A function** - -Three different types of functions are possible: - -- the ODU2P/ODUj-21\_A performs multiplexing/demultiplexing of any LO ODU with a bit rate less than the OPU2 payload bit rate into an OPU2; -- the ODU3P/ODUj-21\_A performs multiplexing/demultiplexing of any LO ODU with a bit rate less than the OPU3 payload bit rate into an OPU3; -- the ODU4P/ODUj-21\_A performs multiplexing/demultiplexing of any LO ODU with a bit rate less than the OPU4 payload bit rate into an OPU4; -- the ODU25(u)P/ODUj-21\_A performs multiplexing/demultiplexing of any LO ODU with a bit rate less than the OPU25(u) payload bit rate into an OPU25(u); -- the ODU50(u)P/ODUj-21\_A performs multiplexing/demultiplexing of any LO ODU with a bit rate less than the OPU50(u) payload bit rate into an OPU50(u). - -Tributary ports are dynamically created and deleted under the control of management. Each tributary port is associated with one ODUj connection point on one hand, and M OPUk tributary slots on the other hand. The multiplex structure identifier (MSI) carries the configuration of tributary ports to tributary slots. - -**14.3.10.1 ODUkP to ODUj payload type 21 adaptation source function (ODUkP/ODUj-21\_A\_So)** - -The ODUkP/ODUj-21\_A\_So function creates the ODUk signal from a free-running clock. It asynchronously maps the ODUj client signal from the $n \times$ ODUj CPs into ODTUjk or ODTUk.M including justification control (JC) information. The ODTUjk and ODTUk.M are multiplexed into the tributary slots of the OPUk. It adds OPUk overhead (RES, PT, MSI, OMFI) and default ODUk overhead. It provides access to ODUk PM APS overhead. It provides access to the ODUj APS overhead. - -The information flow and processing of the ODUkP/ODUj-21\_A\_So function is defined with reference to Figures 14-61 and 14-62. - -**Symbol** - -![Diagram of the ODUkP/ODUj-21_A_So function. A central trapezoidal block labeled 'ODUkP/ODUj-21' has multiple tributary ports at the top, labeled 'Tributary port' and 'ODUj_CPs' with sub-labels 1, 2, ..., n. Each port has a double-headed vertical arrow. On the left, two double-headed horizontal arrows point to labels 'ODUkP/ODUj-21_A_So_MP' and 'ODUkP_PP'. On the right, two double-headed horizontal arrows point to labels 'ODUkP/ODUj-21_A_So_RP' and 'ODUk_TP'. At the bottom, a single double-headed vertical arrow points to a label 'ODUkP_AP'. The text 'G.798(17)_F14-61' is in the bottom right corner.](8862d966c9597ffc01bd5013ca9885bb_img.jpg) - -Diagram of the ODUkP/ODUj-21\_A\_So function. A central trapezoidal block labeled 'ODUkP/ODUj-21' has multiple tributary ports at the top, labeled 'Tributary port' and 'ODUj\_CPs' with sub-labels 1, 2, ..., n. Each port has a double-headed vertical arrow. On the left, two double-headed horizontal arrows point to labels 'ODUkP/ODUj-21\_A\_So\_MP' and 'ODUkP\_PP'. On the right, two double-headed horizontal arrows point to labels 'ODUkP/ODUj-21\_A\_So\_RP' and 'ODUk\_TP'. At the bottom, a single double-headed vertical arrow points to a label 'ODUkP\_AP'. The text 'G.798(17)\_F14-61' is in the bottom right corner. - -**Figure 14-61 – ODUkP/ODUj-21\_A\_So function** - -## Interfaces - -**Table 14-28 – ODUP/ODUj-21\_A\_So inputs and outputs** - -| Input(s) | Output(s) | -|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| n × ODUj_CP:
ODUj_CI_CK
ODUj_CI_D
ODUj_CI_FS
ODUj_CI_MFS
ODUj_CI_APS
ODUk_PP:
ODUk_PI_APS
ODUk_TP:
ODUk_TI_CK
ODUP/ODUj-21_A_So_MP:
ODUP/ODUj-21_A_So_MI_TxMSI
ODUP/ODUj-21_A_So_MI_AutoPayloadtype (Note)
ODUP/ODUj-21_A_So_MI_ODUType_Rate[1..n]
ODUP/ODUj-21_A_So_MI_AdminState[1..n]
ODUP/ODUj-21_A_So_MI_APS_EN[1..n]
ODUP/ODUj-21_A_So_MI_APS_LVL[1..n]
ODUP/ODUj-21_A_So_RP:
ODUP/ODUj-21_A_So_RI_AcPT (Note) | ODUP_AP:
ODUP_AI_CK
ODUP_AI_D
ODUP_AI_FS
ODUP_AI_MFS
ODUP/ODUj-21_A_So_RP:
ODUP/ODUj-21_A_So_RI_TrPT (Note)
ODUP/ODUj-21_A_So_MP:
ODUP/ODUj-21_A_So_MI_TrPT (Note) | -| NOTE – For ODU2P/ODUj-21_A_So and ODU3P/ODUj-21_A_So only. | | - -## Processes - -The processes associated with the ODUP/ODUj-21\_A\_So function are specific processes for each ODUj\_CP and common processes for the compound (multiplexed) signal as depicted in Figures 14-62 and 14-63. - -![Block diagram of ODUkP/ODUj-21_A_So processes showing client processes, multiplexing, and clock generation.](773bb1698c96c3aea54d138ddcc7cfd5_img.jpg) - -The diagram illustrates the ODUkP/ODUj-21\_A\_So processes. At the top, multiple client processes (ODUj\_CP[1] to ODUj\_CP[n]) are shown. Each client process has inputs: CL\_MFS, CL\_FS, CL\_CK, CL\_D, and CL\_APS. It has outputs: MI\_AdminState[i], MI\_APS\_EN[i], MI\_APS\_LVL[i], and MI\_ODUType\_Rate[i] (for i=1 to n). These outputs are connected to a central 'Multiplexer' block. The Multiplexer also receives inputs: OMFS, MFS, FS, CK, D, and TS# from each client process. The Multiplexer outputs a 'Multiplex structure' which is then processed by several functional blocks: 'Multiplex structure identifier (MSI)', 'Payload type (PT)', 'RES', and 'ODUk PM APS'. These blocks output signals: MI\_TxMSI, MI\_AUTOpayloadtype, MI\_TrPT, RI\_TrPT, RI\_AcPT, and PI\_APS. Below these, an 'OMFI' block (optional) receives 'for k = 4, 25(u), 50(u)' and outputs OMFS. A clock generation section includes a 'Free-running clock generator' outputting TI\_CK, an 'ODCa clock generator' outputting ODCa\_CK, and frequency dividers (1/256 and 1/122368) that produce MFS and FS signals. A block 'ODUk OH is set to all-0's, except PM STAT = 001' is also present. The bottom of the diagram shows the aggregated signals: AI\_D, AI\_MFS, AI\_FS, and AI\_CK, which are grouped as 'ODUkP\_AP'. On the right, several signal groups are bracketed: 'ODUkP/ODUj-21\_A\_So\_MP' (containing MI and RI signals), 'ODUk\_PP' (containing PI\_APS), and 'ODUk\_TP' (containing TI\_CK and ODCa\_CK). The reference 'G.798(17)-Amd.3(21)\_F14-62' is noted at the bottom right. - -Block diagram of ODUkP/ODUj-21\_A\_So processes showing client processes, multiplexing, and clock generation. - -Figure 14-62 – ODUkP/ODUj-21\_A\_So processes - -![Figure 14-63 – ODUkP/ODUj-21_A_So client specific processes. This block diagram illustrates the internal processing of an ODUj client signal. At the top, the ODUj_CP[p] signal is split into five inputs: CI_MFS, CI_FS, CI_CK, CI_D, and CI_APS. CI_MFS, CI_FS, and CI_CK feed into an 'ODU-LCK generator'. The generator outputs 'LCK' and 'Normal' signals to a 'Select normal/LCK' block. This block also receives 'MI_AdminState[p]'. The 'Select normal/LCK' block outputs to a 'FAS/MFAS insertion' block. CI_D and CI_APS feed into an 'ODUj APS' block, which also receives 'MI_APS_EN[p]' and 'MI_APS_LVL[p]'. The 'ODUj APS' block outputs to the 'FAS/MFAS insertion' block. The 'FAS/MFAS insertion' block outputs 'CK' and 'D' signals to an 'Elastic store' block. The 'Elastic store' block has 'WR' (write) and 'RD' (read) ports. 'WR' is controlled by 'MI_ODUType_Rate[p]' and 'JC' (justification control) signals. The 'Elastic store' block outputs 'D' and 'TS#' signals. The entire process is enclosed in a grey box labeled 'ODUj_CP[p]' at the top. Below the box, the text 'G.798(17)-Amd.3(21)_F14-63' is present.](39729be7ec83c3de8e480061966e4505_img.jpg) - -Figure 14-63 – ODUkP/ODUj-21\_A\_So client specific processes. This block diagram illustrates the internal processing of an ODUj client signal. At the top, the ODUj\_CP[p] signal is split into five inputs: CI\_MFS, CI\_FS, CI\_CK, CI\_D, and CI\_APS. CI\_MFS, CI\_FS, and CI\_CK feed into an 'ODU-LCK generator'. The generator outputs 'LCK' and 'Normal' signals to a 'Select normal/LCK' block. This block also receives 'MI\_AdminState[p]'. The 'Select normal/LCK' block outputs to a 'FAS/MFAS insertion' block. CI\_D and CI\_APS feed into an 'ODUj APS' block, which also receives 'MI\_APS\_EN[p]' and 'MI\_APS\_LVL[p]'. The 'ODUj APS' block outputs to the 'FAS/MFAS insertion' block. The 'FAS/MFAS insertion' block outputs 'CK' and 'D' signals to an 'Elastic store' block. The 'Elastic store' block has 'WR' (write) and 'RD' (read) ports. 'WR' is controlled by 'MI\_ODUType\_Rate[p]' and 'JC' (justification control) signals. The 'Elastic store' block outputs 'D' and 'TS#' signals. The entire process is enclosed in a grey box labeled 'ODUj\_CP[p]' at the top. Below the box, the text 'G.798(17)-Amd.3(21)\_F14-63' is present. - -**Figure 14-63 – ODUkP/ODUj-21\_A\_So client specific processes** - -### Specific processes - -The specific processes are performed independently for each ODUj client signal that is multiplexed into the OPUk. The specific processes perform the mapping of the ODUj into an ODTUjk or ODTUk.M. - -**FAS/MFAS insertion:** The function shall extend the ODUj with the frame alignment overhead (FAS and MFAS) in row one bytes 1 to 7 as described in clause 15.6.2 of [ITU-T G.709]. Bytes 8 to 14 of row one are set to all-ZEROs. - -**Mapping, frequency justification and bit-rate adaptation:** The function shall provide an elastic store (buffer) process for the ODUj client signal. The data signal ODUj\_CI shall be written into the buffer under the control of the associated input clock. - -Two justification methods, as described below, are provided, AMP (*ODTUjk*) and GMP (*ODTUk.M*). The ODU type and rate, as configured via the MI\_ODUType\_Rate[p] input for tributary port #p, determine the mapping method and in the case of GMP mapping, the base value and ranges for the parameters Cn and Cm. - -*ODTUjk:* The data shall be read out of the buffer and written onto the D, NJO, PJO1 and PJO2 bytes of the selected ODTUjk frame under the control of the ODUk clock and the asynchronous mapping procedure (AMP) justification decisions as defined in clause 19.5 of [ITU-T G.709]. - -A justification decision shall be performed two times per OPUk multiframe (jk = 12, 13) and eight times per OPUk multiframe (jk = 23). Justification decisions are taken at the beginning of the OPUk frame carrying an instance of the ODTUjk justification overhead. Each justification decision results - -in a corresponding double positive, positive, negative or no justification action in this OPuk frame. Upon a double positive justification action, the reading of two data bytes out of the buffer shall be cancelled once. No ODUj data shall be written onto the PJO2, PJO1 or NJO bytes. Upon a positive justification action, the reading of one data byte out of the buffer shall be cancelled once. No ODUj data shall be written onto the PJO1 or NJO bytes and data shall be written onto the PJO2 byte. Upon a negative justification action, one extra data byte shall be read once out of the buffer. ODUj data shall be written onto the PJO2, PJO1 and NJO bytes. If no justification action is to be performed, ODUj data shall be written onto the PJO2 and PJO1 bytes and no ODUj data shall be written onto the NJO byte. The OPuk frame that contains the PJO2, PJO1 and NJO bytes depends on the tributary slots occupied by the ODTUjk. - -The justification decisions determine the phase error introduced by the function. - -*ODTUk.M*: The data shall be read out of the buffer and written onto groups of M successive bytes of the ODTUk.M payload area under the control of the ODUk clock and the GMP data/stuff control mechanism as defined in clause 19.6 of [ITU-T G.709]. - -*Buffer size*: In the presence of jitter as specified by [ITU-T G.8251] and a frequency within the range specified in Table 7-2 of [ITU-T G.709], this mapping process shall not introduce any errors. The maximum buffer hysteresis, and therefore the maximum phase error introduced, shall be as listed in Table 14-29. - -**Table 14-29 – Maximum buffer hysteresis** - -| Mapping | Maximum buffer hysteresis | -|----------------|------------------------------------| -| ODUj → ODTUk.M | M bytes | -| ODUj → ODTUjk | 2 bytes (j = 1)
8 bytes (j = 2) | - -**ODTUjk JC**: The function shall generate the justification control bits based on the justification decision according to the specification in clause 19.5 of [ITU-T G.709]. It shall insert the justification control bits in bit 7 and 8 of all three JC bytes of the frame in which the justification is performed. The remaining (RES) bits of the JC byte shall be set to all-ZEROs. The ODUk frame that contains the JC bytes depends on the time slot(s) of the ODTUjk. - -**ODTUK.M JC1/JC2/JC3, JC4/JC5/JC6**: The function shall generate the GMP $C_m$ and GMP $\sum C_{nd}$ information and insert this into the JC1/JC2/JC3 and JC4/JC5/JC6 bytes, respectively, according to the specification in clause 19.6 and Annex D of [ITU-T G.709]. - -**ODU-LCK**: The function shall generate the ODU-LCK signal as defined in clause 16.5 of [ITU-T G.709]. The clock, frame start and multiframe start are defined by the incoming ODUk signal. - -**ODUj server layer APS**: When APS is enabled for tributary signal #p (MI\_APS\_EN[p] is true), the function shall insert the CI\_APS value into the ODU APS/PCC[MI\_APS\_LVL[p]] field, which is available once per eight ODU frames when the value of the MFAS bits 6, 7, 8 is equal to MI\_APS\_LVL[p]. - -**NOTE** – The ODUj server layer section APS information may be present in the case where the ODUj signal contains an ODU-AIS, ODU-LCK or ODU-OCI maintenance signal. The ODU-LCK maintenance signal may be inserted in this adaptation source function. ODUj SNC/I protection is unable to detect the insertion of such ODU-LCK and will not perform a protection switch. - -**Selector**: The normal signal for a tributary signal #p may be replaced by the ODU-LCK signal. The ODU-LCK signal is selected if the MI\_AdminState[p] is LOCKED. - -## Common processes - -**Clock and (multi)frame start signal generation:** The function shall generate a local ODUk clock (ODUKP\_AI\_CK) with a frequency as listed in Table 7-2 of [ITU-T G.709] from the synchronization timing information clock input (TI\_CK) or, if the TI\_CK is absent, a free-running oscillator. The clock parameters, including jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCa clock), apply. - -The function shall generate the (multi)frame start reference signals AI\_FS and AI\_MFS for the ODUk signal. The AI\_FS signal shall be active once per 122 368 clock cycles. AI\_MFS shall be active once every 256 frames. - -**OPU multiframe (OMFI) start signal generation for OPUk with k = 4, 25(u), 50(u):** For k = 4, 25(u), 50(u) in addition to MFAS, a dedicated OPU multiframe indicator is used for the multiplexing of LO ODUs into the OPU payload area. This multiframe structure is locked to the lsb bits of the OMFI byte, as shown in Tables 19-4, 19-5 and 19-6 of [ITU-T G.709], and to be inserted into the OPU overhead. The function shall generate an OPU multiframe and the related start signal (OMFS) dividing the frame signal sequence by the maximum number of tributary slots TSmax. The OMFI start signal may optionally be phase aligned to the ODU multiframe signal. In this case, the OMFI = 0 position is aligned with MFAS = 0 position every 1280 frame periods. See clause 19.4.4 of [ITU-T G.709]. - -**Multiplexing:** The function assigns the individual ODTUjk or ODTUk.M to specific time slots of the OPUk payload area as defined by the multiplex structure (see clauses 19.3 and 19.4.1 of [ITU-T G.709]). - -**MSI:** The function shall insert the TxMSI into the MSI byte positions of the PSI overhead as defined in clauses 19.4.1.4, 19.4.1.5, 19.4.1.6 of [ITU-T G.709]. The TxMSI value, and as such the multiplex structure, is configurable via MI\_TxMSI. - -**PT:** The function shall insert code "0010 0001" (ODU multiplex structure supporting ODTUk.ts or ODTUk.ts and ODTUjk) into the PT byte position of the PSI overhead as defined in clause 15.9.2.1 of [ITU-T G.709] for k = 4. - -**Autonomous payload type for k = 2, 3:** For k = 2, 3 the transmitted PT code shall default to code "0010 0001". This code must be replaced by code "0010 0000" under the control of the PT = 21-to-PT = 20 interworking process described hereafter. When MI\_AutoPayloadtype is activated, the function shall adapt a PT21 supporting port to a PT20 structure. - -If the corresponding adaptation sink provides the information of a PT = 20 at the RI\_AcPT, the function shall fall back to PT = 20 under the following conditions: The MI\_AutoPayloadtype is true and the HO ODU source is either not provisioned for any traffic signal structure, or the HO ODU2 source configured for one or more ODU1 signals to be mapped into TS1/TS5 and/or TS2/TS6 and/or TS3/TS7 and/or TS4/TS8, or the HO ODU3 source is configured to support one or more ODU1 signals mapped into TS1/TS17, TS2/TS18, Tsi/TS16+I and/or one or more ODU2 signals mapped into Tsa/TS16+a/TSb/TS16+b/TSc/TS16+c/TSd/TS16+16 and no other ODU type signals. In this case, the function shall insert PT20 into the PSI positions. - -The default value of the MI\_AutoPayloadtype activation shall be "true". - -In the situation where a PT 21 capable port which has been operating in the PT20 mode is taken out of service or receives PT21, the port shall subsequently fall back to a PT21 structure. - -NOTE 1 – Equipment developed prior to Edition 4.0 of this Recommendation may implement a different setting in respect of the default value of the MI\_AutoPayloadtype. - -In the case the ODU2 or ODU3 adaptation source is configured for either ODU0, or an ODUflex, or an ODU2e, or for an ODU1 in TSi/TSj with j<>4+I (for ODU2) or j<>16+I (for ODU3) then PT21 - -is to be inserted. The transmitted PT shall be reported at the ODUkP/ODUj-21\_A\_So\_RI\_TrPT to the corresponding adaptation sink function and the ODUkP/ODUj-21\_A\_So\_MI\_TrPT. - -NOTE 2 – The change to PT20 or PT21 means a full adaptation to the related signal structure including the default OH byte insertion. - -**RES:** The function shall insert all-ZEROs into the RES bytes. - -**ODUk PM APS:** The function shall insert the PI\_APS value into the ODUk path APS/PCC field, which is available once per eight ODUk frames when MFAS bits 6, 7, 8 are 000. - -All other bits of the ODUk overhead should be sourced as "0"s, except the PMOH STAT field which should be set to the value "normal path signal" (001). - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -#### 14.3.10.2 ODUkP to ODUj payload type 21 adaptation sink function (ODUkP/ODUj-21\_A\_Sk) - -The ODUkP/ODUj-21\_A\_Sk function extracts the OPUk overhead (PT, MSI, RES and OMFI) and monitors the reception of the correct payload type. It demultiplexes the individual ODTUjk and ODTUk.M from the payload area of the OPUk and recovers the $n \times$ ODUj signals using the justification control information (JC, JC1/2/3/4/5/6 overhead). It determines the frame and multiframe structure of the ODUj. It provides access to ODUk PM APS overhead. - -The information flow and processing of the ODUkP/ODUj-21\_A\_Sk function is defined with reference to Figures 14-64, 14-65 and 14-66. - -#### Symbol - -![Diagram of the ODUkP/ODUj-21_A_Sk function symbol. The central block is labeled 'ODUkP/ODUj-21'. It has four input arrows: 'ODUkP/ODUj-21_A_Sk_MP' from the top left, 'ODUkP_PP' from the bottom left, 'ODUkP_AP' from the bottom, and 'ODUkP/ODUj-21_A_Sk_RP' from the right. It has multiple output arrows pointing upwards labeled 'Tributary port 1', '2', '...', 'n', and 'ODUj_CPs'.](cacc4ff5c441e0eb6fbd5e14a083eb05_img.jpg) - -The diagram shows a central trapezoidal block labeled "ODUkP/ODUj-21". To its left, two arrows point into the block: "ODUkP/ODUj-21\_A\_Sk\_MP" (top) and "ODUkP\_PP" (bottom). Below the block, an arrow points into it labeled "ODUkP\_AP". To its right, an arrow points out of the block labeled "ODUkP/ODUj-21\_A\_Sk\_RP". Above the block, multiple arrows point out of it, labeled "Tributary port 1", "2", "...", and "n". Above these arrows, the label "ODUj\_CPs" is present. A small text "G.798(17)\_F14-64" is located at the bottom right of the diagram. - -Diagram of the ODUkP/ODUj-21\_A\_Sk function symbol. The central block is labeled 'ODUkP/ODUj-21'. It has four input arrows: 'ODUkP/ODUj-21\_A\_Sk\_MP' from the top left, 'ODUkP\_PP' from the bottom left, 'ODUkP\_AP' from the bottom, and 'ODUkP/ODUj-21\_A\_Sk\_RP' from the right. It has multiple output arrows pointing upwards labeled 'Tributary port 1', '2', '...', 'n', and 'ODUj\_CPs'. - -**Figure 14-64 – ODUkP/ODUj-21\_A\_Sk function** - -## Interfaces - -**Table 14-30 – ODUkP/ODUj-21\_A\_Sk inputs and outputs** - -| Input(s) | Output(s) | -|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| ODUkP_AP:
ODUkP_AI_CK
ODUkP_AI_D
ODUkP_AI_FS
ODUkP_AI_MFS
ODUkP_AI_TSF
ODUkP_AI_TSD
ODUkP/ODUj-21_A_Sk_MP:
ODUkP/ODUj-21_A_Sk_MI_ExMSI[1..n]
ODUkP/ODUj-21_A_Sk_MI_AdminState[1..n]
ODUkP/ODUj-
21_A_Sk_MI_Nominal_Bitrate_and_Tolerance[1..n]
ODUkP/ODUj-21_A_Sk_MI_ODUType[1..n]
ODUkP/ODUj-21_A_Sk_MI_APS_EN[1..n]
ODUkP/ODUj-21_A_Sk_MI_APS_LVL[1..n]
ODUkP/ODUj-21_A_Sk_RP:
ODUkP/ODUj-21_A_Sk_RI_TrPT (Note) | n × ODUj_C P:
ODUj_CI_CK
ODUj_CI_D
ODUj_CI_FS
ODUj_CI_MFS
ODUj_CI_SSF
ODUj_CI_SSD
ODUj_CI_APS
ODUk_PP:
ODUk_PI_APS
ODUk_PI_TSF
ODUk_PI_TSD
ODUkP/ODUj-21_A_Sk_MP:
ODUkP/ODUj-21_A_Sk_MI_cPLM
ODUkP/ODUj-21_A_Sk_MI_cLOOMFI
ODUkP/ODUj-21_A_Sk_MI_cMSIM
ODUkP/ODUj-21_A_Sk_MI_AcPT
ODUkP/ODUj-21_A_Sk_MI_AcMSI[1..n]
ODUkP/ODUj-21_A_Sk_MI_cLOFLOM[1..n]
ODUkP/ODUj-21_A_Sk_RP:
ODUkP/ODUj-21_A_Sk_RI_AcPT (Note) | -| NOTE – For ODU2P/ODUj-21_A_Sk and ODU3P/ODUj-21_A_Sk only. | | - -## Processes - -The processes associated with the ODUkP/ODUj-21\_A\_Sk function are specific processes for each ODUj\_CP and common processes for the compound (multiplexed) signal as depicted in Figures 14-65 and 14-66. - -![Block diagram of ODUkP/ODUj-21_A_Sk processes showing Client specific processes, Demultiplexer, MSI process, PT process, ODUk PM APS, and OMFI process with various input and output signals.](eda1a0f033926f48febc095bce470c58_img.jpg) - -The diagram illustrates the internal processes of an ODUkP/ODUj-21\_A\_Sk system. At the top, multiple 'Client specific processes' are shown for ODUj\_CP[1] and ODUj\_CP[n]. Each client process has inputs: AI\_TSD, AI\_TSF, dPLM, dLOOMFI, dMSIM[1..n], MI\_cMSIM[1..n], MI\_cLOFLOM[1..n], MI\_AdminState[1..n], MI\_APS\_EN[1..n], MI\_APS\_LVL[1..n], MI\_Nominal\_Bitrate\_and\_Tolerance[1..n], and MI\_ODUType[1..n]. These clients output signals: CI\_MFS, CI\_FS, CI\_CK, CI\_D, CI\_APS, CI\_SSF, and CI\_SSD. All client outputs feed into a central 'Demultiplexer'. - -The Demultiplexer outputs are: OMFS, MFS, FS, CK, D, and TS#. These signals are distributed to several processing blocks: - -- Extract MSI** receives CK and D, and outputs to an **MSI process**. The MSI process outputs MI\_ExMSI[1..n] and MI\_AcMSI[1..n], and feeds into a **Multiplex structure**. The Multiplex structure also receives inputs from other processes and outputs dMSIM[1..n] back to the clients. -- Extract PT** receives CK and D, and outputs to a **PT process**. The PT process outputs MI\_AcPT, RI\_AcPT, and RI\_TrPT, and feeds into the Multiplex structure. It also receives dPLM from the ODUk PM APS block. -- ODUk PM APS** receives CK and D, and outputs dPLM to the PT process and PI\_APS, PI\_TSF, and PI\_TSD to the right. -- Extract OMFI** (for k = 4, 25(u), 50(u)) receives CK and D, and outputs to an **OMFI process**. The OMFI process outputs OMFS and dLOOMFI to the right. It also feeds into the Multiplex structure. - -On the right side, a **Defect correlations** block receives AI\_TSF, dLOOMFI, and dPLM, and outputs MI\_cLOOMFI, MI\_cPLM, MI\_cMSIM[1..n], MI\_cLOFLOM[1..n], MI\_AdminState[1..n], MI\_APS\_EN[1..n], MI\_APS\_LVL[1..n], MI\_Nominal\_Bitrate\_and\_Tolerance[1..n], and MI\_ODUType[1..n] back to the clients. - -At the bottom, the **ODUkP\_AP** block provides inputs: AL\_MFS, AL\_FS, AL\_CK, AL\_D, AL\_TSF, and AL\_TSD to the Extract MSI, Extract PT, ODUk PM APS, and Extract OMFI blocks. - -Labels on the far right indicate the output groups: **ODUkP/ODUj-21\_A\_Sk\_MP** for the top client-related outputs, **ODUkP-k/ODUj-21\_A\_Sk\_RP** for the MSI and PT related outputs, and **ODUk\_PP** for the APS and TSF/TSD related outputs. - -Reference G.798(17)-Amd.3(21)\_F14-65 is noted at the bottom right of the diagram. - -Block diagram of ODUkP/ODUj-21\_A\_Sk processes showing Client specific processes, Demultiplexer, MSI process, PT process, ODUk PM APS, and OMFI process with various input and output signals. - -Figure 14-65 – ODUkP/ODUj-21\_A\_Sk processes - -![Block diagram of ODUj_CP[p] client specific processes. The diagram shows various functional blocks like 'Select normal/AIS/LCK', 'Generate AIS', 'Generate LCK', 'Frame/multi-frame alignment', 'Elastic store', 'Clock generation (ODCp)', 'Justification control', 'Extract JC', 'ODUj APS', 'Consequent actions', and 'Defect correlations'. It includes input and output signals such as OMFS, MFAS, FS, CK, D, TS#, Active, CI_MFS, CI_FS, CI_CK, CI_D, CI_APS, CI_SSF, CI_SSD, and various management and alarm signals like MI_AdminState[p], MI_Nominal_Bitrate_and_Tolerance[p], MI_APS_EN[p], MI_APS_LVL[p], dLOFLOM, dPLM, dLOOMFI, dMSIM[p], MI_cMSIM[p], MI_cLOFLOM[p], AI_TSD, and AI_TSF. A reference label G.798(17)-Amd.3(21)_F14-66 is present.](a279b24bee8e82a60177168f08cce415_img.jpg) - -G.798(17)-Amd.3(21)\_F14-66 - -Block diagram of ODUj\_CP[p] client specific processes. The diagram shows various functional blocks like 'Select normal/AIS/LCK', 'Generate AIS', 'Generate LCK', 'Frame/multi-frame alignment', 'Elastic store', 'Clock generation (ODCp)', 'Justification control', 'Extract JC', 'ODUj APS', 'Consequent actions', and 'Defect correlations'. It includes input and output signals such as OMFS, MFAS, FS, CK, D, TS#, Active, CI\_MFS, CI\_FS, CI\_CK, CI\_D, CI\_APS, CI\_SSF, CI\_SSD, and various management and alarm signals like MI\_AdminState[p], MI\_Nominal\_Bitrate\_and\_Tolerance[p], MI\_APS\_EN[p], MI\_APS\_LVL[p], dLOFLOM, dPLM, dLOOMFI, dMSIM[p], MI\_cMSIM[p], MI\_cLOFLOM[p], AI\_TSD, and AI\_TSF. A reference label G.798(17)-Amd.3(21)\_F14-66 is present. - -**Figure 14-66 – ODUkP/ODUj-21\_A\_Sk client specific processes** - -**Common processes** - -**OPU multiframe (OMFI) reception for OPUk with k = 4, 25(u), 50(u):** For k = 4, 25(u), 50(u) in addition to MFAS, a dedicated OPU multiframe indicator is used for the multiplexing of LO ODUs into the OPU payload area. This multiframe structure is locked to the lsb bits of the OMFI byte, as shown in Tables 19-4, 19-5 and 19-6 of [ITU-T G.709]. The function shall detect OPU multiframe by searching for the framing pattern in the bits indicated above. The process has two states, out-of-multiframe (OOM) and in-multiframe (IM). The IM state shall be entered if this set is found and confirmed one frame period later and an error-free multiframe sequence is found in the byte positions of the two frames. In the IM state, the frame alignment signal shall be continuously checked with the presumed OMFI frame start position and the expected multiframe sequence. The OOM state shall be entered if this subset is not found at the correct position in five consecutive frames or the received OMFI does not match with the expected multiframe number in five consecutive frames. The OPU multiframe start (OMFS) shall be maintained during the OOM state of the OMFI detection process. The defect dLOOMFI shall be generated based on the state of the OMFI alignment process. - -If the OMFI alignment process is persistently in the out-of-multiframe (OOM) state for 3 ms, dLOOMFI shall be declared. dLOOMFI shall be cleared immediately when the OMFI alignment process is in the in-multiframe (IM) state. - -**PT:** The function shall extract the PT byte from the PSI overhead as defined in clause 8.7.1.1. The accepted PT value is available at the MP (MI\_AcPT) and is used for PLM defect detection. - -**Autonomous payload type for k = 2, 3:** The accepted PT is provisioned to the RP (RI\_AcPT) for automatic PT adaptation. The PLM detection shall be based on the comparison of the accepted PT with the provided PT on the RP at the RI\_TrPT input. - -**MSI:** The function shall extract the MSI from the PSI overhead as defined in clause 8.7.2.1. The accepted MSI for a tributary signal #p (AcMSI[p]) is available at the MP (MI\_AcMSI[p]). The multiplex structure is defined by ExMSI[p], which is either fixed or is configurable via MI\_ExMSI[p]. - -**RES:** The value in the RES bytes shall be ignored. - -**ODUk PM APS:** The function shall extract the information from the ODUk path APS/PCC field, which is available once per eight ODUk frames when MFAS bits 6, 7, 8 are 000 and apply this to the PI\_APS. - -**Demultiplexing:** The function activates the ODTUjk or ODTUk.M and assigns the time slots of the ODUk payload area to the individual ODTUjk or ODTUk.M as defined by the multiplex structure (see clauses 19.3 and 19.4.1 of [ITU-T G.709]). - -### Specific processes - -The specific processes are performed independently for each ODUj client signal that is multiplexed into the OPUk. The specific processes recover the ODUj from the ODTUjk or ODTUk.M. - -Two justification methods as described below are provided, AMP (*ODTUjk*) and GMP (*ODTUk.M*). The ODU type, as configured via the MI\_ODUType [p] input for tributary port #p, determines the mapping method. In the case of GMP mapping, the ODU rate, as configured via the MI\_Nominal\_Bitrate\_and\_Tolerance[p] input for tributary port #p, determines the base value and ranges for the parameters $C_n$ and $C_m$ . - -**ODTUjk JC:** The function shall interpret the justification control information in bits 7 and 8 of the JC bytes as defined in clause 19.5 of [ITU-T G.709] in order to determine the justification action (double positive, positive, negative, none) for the current frame. A two out of three majority decision is used. RES bits in the JC bytes shall be ignored. The ODUk frame that contains the JC bytes depends on the time slot(s) of the ODTUjk. - -**ODTUk.ts JC1/2/3 and JC4/5/6:** The function shall interpret the GMP overhead information in the JC1/2/3 and JC4/5/6 bytes as defined in clause 19.6 of [ITU-T G.709] in order to determine the number of M-byte ODUj entities in the next ODTUk.M multiframe. The OPUk frame that contains the JC1/2/3 and JC4/5/6 bytes depends on the last tributary slot that is occupied by the ODTUk.M. - -**Demapping, CBR clock generation:** The function shall provide an elastic store (buffer) process. - -*ODTUjk:* The ODUj data shall be written into the buffer from the D, NJO, PJO1 and PJO2 bytes in the ODTUjk frame. The information extraction of the PJO2, PJO1 and NJO bytes shall be under the control of the justification control information. - -Upon a double positive justification action, the writing of two data bytes into the buffer shall be cancelled once. No ODUj data shall be read from the PJO2, PJO1 or NJO bytes. Upon a positive justification action, the writing of one data byte into the buffer shall be cancelled once. No ODUj data shall be read from the PJO1 or NJO bytes and data shall be read from the PJO2 byte. Upon a negative justification action, one extra data byte shall be written into the buffer once. ODUj data shall be read from the PJO2, PJO1 and NJO bytes. If no justification action is to be performed, ODUj data shall be - -read from the PJO2 and PJO1 bytes and no ODUj data shall be read from the NJO bytes. The OPUk frame that contains the PJO2, PJO1 and NJO bytes depends on the tributary slots occupied by the ODTUjk. - -*ODTUk.M:* The ODUj data shall be extracted from the groups of M successive bytes of the ODTUk.M payload area under the control of the GMP data/stuff control mechanism as defined in clause 19.6 of [ITU-T G.709] and be written into the buffer. The $C_n$ information associated with the ODUj is computed from the GMP $C_m$ and $\Sigma C_{ND}$ parameters carried within the JC1/2/3 and JC 4/5/6 overhead of the ODTUk.M as specified in clause 19.6 of [ITU-T G.709]. For the GMP data/stuff control mechanism, refer to Annex D of [ITU-T G.709]. - -The ODUj data (CI\_D) shall be read out of the buffer under the control of the ODUj clock (CI\_CK). - -*Smoothing and jitter limiting process:* The function shall provide for a clock smoothing and elastic store (buffer) process. The ODUj data signal shall be written into the buffer under the control of the associated (gapped) OPUk input clock (with a frequency accuracy within $\pm 20$ ppm). The data signal shall be read out of the buffer under the control of a smoothed (equally spaced) ODUj clock (the rate is determined by the ODUj signal at the input of the remote ODUkP/ODUj-21\_A\_So). - -The clock parameters, including jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCp clock), apply. - -*Buffer size:* In the presence of jitter as specified by [ITU-T G.8251] and a frequency within the tolerance range specified for the ODUj signal in Table 7-2 of [ITU-T G.709], this justification process shall not introduce any errors. - -Following a step in frequency of the ODUj signal transported (for example, due to reception of ODUj\_CI from a new ODUj\_TT\_So at the far end or removal of a ODU-AIS signal with a frequency offset), there will be a maximum recovery time of X seconds after which this process shall not generate any bit errors. The value of X is for further study; a value of one second has been proposed. - -**Frame and multiframe alignment:** The function shall perform frame and multiframe alignment as described in clause 8.2.3. - -**ODU-LCK, ODU-AIS:** The function shall generate the ODU-LCK and ODU-AIS signals as defined in [ITU-T G.709]. The clock, frame start and multiframe start shall be independent from the incoming clock. The clock has to be within the ODUj frequency tolerance range as specified in Table 7-2 of [ITU-T G.709] provisioned by the MI\_Nominal\_Bitrate\_and\_Tolerance[p] from a free-running oscillator. Jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCa clock), apply. - -**Selector:** The normal signal for a tributary signal #p may be replaced by either the ODU-AIS or ODU-LCK signal. ODU-LCK is selected if the corresponding MI\_AdminState[p] signal is LOCKED. ODU-AIS is selected if the corresponding MI\_AdminState[p] signal is not LOCKED and aAIS is true. - -**ODUj server layer APS:** When APS is enabled for tributary signal #p (MI\_APS\_EN[p] is true), the function shall extract the information from the ODU APS/PCC[MI\_APS\_LVL[p]] field, which is available once per eight ODU frames when the value of the MFAS bits 6, 7, 8 is equal to MI\_APS\_LVL[p], and apply the extracted information to the CI\_APS. - -NOTE 1 – The ODUj server layer section APS information may be present in the case where the ODUj signal contains an ODU-AIS, ODU-LCK or ODU-OCI maintenance signal. The ODU-LCK maintenance signal may have been inserted in the far-end adaptation source function. ODUj SNC/I protection is unable to detect the insertion of such ODU-LCK and will not perform a protection switch. - -## Defects - -The function shall detect dPLM, dMSIM, dLOOMFI and dLOFLOM. - -**dPLM:** See clause 6.2.4.1. The expected payload type is the provided PT on the RP at the RI\_TrPT input (ODU multiplex structure supporting ODTUk.ts or ODTUk.ts and ODTUjk), as defined in [ITU-T G.709]. - -**dLOOMFI:** dLOOMFI is detected per OPUk with k = 4, 25(u), 50(u). See the OPU multiframe (OMFI) detection process for OPUk with k = 4, 25(u), 50(u). - -For each ODUj tributary port #p: - -**dMSIM[p]:** See clause 6.2.9.1. dMSIM is detected per active ODUj. - -**dLOFLOM[p]:** See clause 6.2.5.3. dLOFLOM is detected per active ODUj. - -#### Consequent actions - -$PI\_TSF \leftarrow AI\_TSF$ - -$PI\_TSD \leftarrow AI\_TSD$ - -For each ODUj tributary port #p: - -$aSSF[p] \leftarrow ((AI\_TSF \text{ or } dPLM \text{ or } dLOOMFI \text{ or } dMSIM[p] \text{ or } dLOFLOM[p]) \text{ and } (\text{not } MI\_AdminState[p] = \text{LOCKED}))$ - -$aSSD[p] \leftarrow AI\_TSD \text{ and } (\text{not } MI\_AdminState[p] = \text{LOCKED})$ - -$aAIS[p] \leftarrow ((AI\_TSF \text{ or } dPLM \text{ or } dLOOMFI \text{ or } dMSIM[p] \text{ or } dLOFLOM[p]) \text{ and } (\text{not } MI\_AdminState[p] = \text{LOCKED}))$ - -NOTE 2 – The state of the determination process of the $C_m$ and its contribution to AIS consequent action are for further study. - -On declaration of aAIS, the function shall output an all-ONEs pattern/signal within two frames. On clearing aAIS, the all-ONEs pattern/signal shall be removed within two frames, with normal data being output. The AIS clock, frame start and multiframe start shall be independent from the incoming clock, frame start and multiframe start. The clock has to be within the ODUj frequency tolerance range as specified in Table 7-2 of [ITU-T G.709] provisioned by the MI\_Nominal\_Bitrate\_and\_Tolerance from a free-running oscillator. Jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCa clock) apply. - -#### Defect correlations - -$cPLM \leftarrow dPLM \text{ and } (\text{not } AI\_TSF)$ - -For ODUk with k = 4, 25(u), 50(u): - -$cLOOMFI \leftarrow dLOOMFI \text{ and } (\text{not } AI\_TSF)$ - -For each ODUj tributary port #p: - -$cMSIM[p] \leftarrow dMSIM[p] \text{ and } (\text{not } dPLM) \text{ and } (\text{not } dLOOMFI) \text{ and } (\text{not } AI\_TSF)$ - -$cLOFLOM[p] \leftarrow dLOFLOM[p] \text{ and } (\text{not } dPLM) \text{ and } (\text{not } dLOOMFI) \text{ and } (\text{not } AI\_TSF)$ - -**Performance monitoring:** None. - -### 14.3.11 ODUkP to ETH adaptation functions (ODUkP/ETH\_A; k = 0, 1, 2, 3, 4, flex) - -#### 14.3.11.1 ODUkP to ETH adaptation source function (ODUkP/ETH\_A\_So) - -The ODUkP/ETH\_A\_So function creates the ODUk signal from a free running clock. It maps the ETH\_CI information into the payload of the OPUk, adds OPUk overhead (RES, PT) and default ODUk overhead. - -#### Symbol - -![Symbol diagram for ODUkP/ETH_A_So function. The central block is labeled 'ODUkP/ETH'. Inputs from the top are 'ETH_TFP' and 'ETH_FP'. Input from the left is 'ODUkP/ETH_A_So_MP'. Outputs to the right are 'ETH_TF_PP' and 'ETH_F_PP'. Output from the bottom is 'ODUkP_AP'. Reference G.798(17)-Amd.1(18)_F14-66.1 is shown at the bottom right.](43b05bd1b6ee31fba18d3eb683903504_img.jpg) - -Symbol diagram for ODUkP/ETH\_A\_So function. The central block is labeled 'ODUkP/ETH'. Inputs from the top are 'ETH\_TFP' and 'ETH\_FP'. Input from the left is 'ODUkP/ETH\_A\_So\_MP'. Outputs to the right are 'ETH\_TF\_PP' and 'ETH\_F\_PP'. Output from the bottom is 'ODUkP\_AP'. Reference G.798(17)-Amd.1(18)\_F14-66.1 is shown at the bottom right. - -Figure 14-66.1 – ODUkP/ETH\_A\_So symbol - -#### Interfaces - -Table 14-30.1 – ODUkP/ETH\_A\_So interfaces - -| Inputs | Outputs | -|--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|----------------------------------------------------------------------------------------------------------------------------------------------------------------| -| ETH_TFP:
ETH_CI_D
ETH_CI_P
ETH_CI_DE
ETH_FP:
ETH_CI_D
ETH_CI_P
ETH_CI_DE
ETH_CI_SSF
ETH_CI_SSFrdi
ETH_CI_SSFfdi
ODUkP/ETH_A_So_MP:
ODUkP/ETH_A_So_MI_CSFEnable
ODUkP/ETH_A_So_MI_CSFrdifdiEnable | ODUkP_AP:
ODUkP_AI_D
ODUkP_AI_CK
ODUkP_AI_FS
ODUkP_AI_MFS
ETH_TF_PP:
ETH_PI_D
ETH_PI_P
ETH_PI_D
ETH_PI_P
ETH_PI_DE | - -#### Processes - -A process diagram of this function is shown in Figure 14-66.2. - -![Figure 14-66.2 – ODUkP/ETH_A_So process diagram. The diagram shows a vertical flow of data and control signals within a grey-shaded area. At the top, three input signals (ETH_CI_SSF (ETH_FP), ETH_CI_D/P/DE (ETH_TFP), and ETH_CI_D/P/DE SSF/SSFrdi/SSFfdi (ETH_FP)) enter 'Client-specific processes'. An output signal (ETH_PI_D/P/DE (ETHF_PP)) exits to the right. Below 'Client-specific processes' is '802.3 MAC FCS generation', which outputs 'ETH_CI' and 'MAC_Frame'. Below that is 'ETH specific GFP-F processes', which receives 'MAC_Frame' and control signals (FCSEnable = false, MI_CSFenable, MI_CSFrdifdiEnable). It outputs 'GFP_FS' and 'GFP_Frame'. Below that is 'Common GFP-F processes', which receives 'GFP_FS' and 'GFP_Frame' and control signals (CMuxConfig, CMuxActive = false). It outputs 'GFP_FS' and 'GFP_Frame'. Below that is 'ODUkP specific GFP-F processes', which receives 'GFP_FS' and 'GFP_Frame' and outputs 'ODUkP_AI_D'. Below that is 'ODUkP specific processes', which receives 'ODUkP_AI_D' and control signal 'ODUkP_AI_CK/FS'. Finally, it outputs 'ODUkP_AI_D/CK/FS/MFS' at the bottom. A reference code 'G.798(17)-Amd.4(22)_F14-66.2' is at the bottom right.](fd4b2ee19b709bcb11190893e23f8453_img.jpg) - -Figure 14-66.2 – ODUkP/ETH\_A\_So process diagram. The diagram shows a vertical flow of data and control signals within a grey-shaded area. At the top, three input signals (ETH\_CI\_SSF (ETH\_FP), ETH\_CI\_D/P/DE (ETH\_TFP), and ETH\_CI\_D/P/DE SSF/SSFrdi/SSFfdi (ETH\_FP)) enter 'Client-specific processes'. An output signal (ETH\_PI\_D/P/DE (ETHF\_PP)) exits to the right. Below 'Client-specific processes' is '802.3 MAC FCS generation', which outputs 'ETH\_CI' and 'MAC\_Frame'. Below that is 'ETH specific GFP-F processes', which receives 'MAC\_Frame' and control signals (FCSEnable = false, MI\_CSFenable, MI\_CSFrdifdiEnable). It outputs 'GFP\_FS' and 'GFP\_Frame'. Below that is 'Common GFP-F processes', which receives 'GFP\_FS' and 'GFP\_Frame' and control signals (CMuxConfig, CMuxActive = false). It outputs 'GFP\_FS' and 'GFP\_Frame'. Below that is 'ODUkP specific GFP-F processes', which receives 'GFP\_FS' and 'GFP\_Frame' and outputs 'ODUkP\_AI\_D'. Below that is 'ODUkP specific processes', which receives 'ODUkP\_AI\_D' and control signal 'ODUkP\_AI\_CK/FS'. Finally, it outputs 'ODUkP\_AI\_D/CK/FS/MFS' at the bottom. A reference code 'G.798(17)-Amd.4(22)\_F14-66.2' is at the bottom right. - -**Figure 14-66.2 – ODUkP/ETH\_A\_So process** - -The client-specific processes, and associated MI and PI signals, are specified in clause 9.5 of [ITU-T G.8021]. - -*802.3 MAC FCS generation:* - -See clause 8.6.1 of [ITU-T G.8021]. - -*Ethernet specific GFP-F source process:* - -See clause 8.5.4.1.1 of [ITU-T G.806]. GFP pFCS generation is disabled (FCSEnable=false). The UPI value for frame-mapped Ethernet shall be inserted (Table 6-3 of [ITU-T G.7041]). The Ethernet frames are inserted into the client payload information field of the GFP-F frames according to clause 7.1 of [ITU-T G.7041]. - -*Common GFP source process:* - -See clause 8.5.3.1 of [ITU-T G.806]. GFP channel multiplexing is not supported (CMuxActive=false). - -*ODUkP specific GFP source process:* - -See clause 8.5.2.1 of [ITU-T G.806]. The GFP frames are mapped into the ODUk payload area according to clause 17.4 of [ITU-T G.709]. - -*ODUkP specific source process:* - -A process diagram for the ODUkP specific source process is shown in Figure 14-66.3. - -![Figure 14-66.3 – ODUkP specific source process diagram. The diagram shows the internal components and signal flow of the ODUkP source process. On the left, input signals D, SSF, FS, and CK enter a large grey box labeled 'ODUkP_AP'. Inside, there are four stacked blocks: 'Insert PT', 'Insert CSF' (with an external SSF input), 'Insert RES', and 'ODUk OH is set to all-0's, except PM STAT = 001'. The output of these blocks is labeled 'AI_D'. At the top right, a 'Free-running clock generator (ODCa)' receives 'CK' and outputs 'CK'. This 'CK' signal is divided by 122368 to produce 'FS', which is then divided by 256 to produce 'MFS'. The 'AI_D' signal is combined with 'CK', 'FS', and 'MFS' to produce the final output signals 'AI_D', 'AI_CK', 'AI_FS', and 'AI_MFS' at the bottom. A reference label 'G.798(17)-Amd.3(21)_F14-66.3' is present at the bottom right of the diagram.](a4a23a6cfd603aea55a02bae13456e8e_img.jpg) - -Figure 14-66.3 – ODUkP specific source process diagram. The diagram shows the internal components and signal flow of the ODUkP source process. On the left, input signals D, SSF, FS, and CK enter a large grey box labeled 'ODUkP\_AP'. Inside, there are four stacked blocks: 'Insert PT', 'Insert CSF' (with an external SSF input), 'Insert RES', and 'ODUk OH is set to all-0's, except PM STAT = 001'. The output of these blocks is labeled 'AI\_D'. At the top right, a 'Free-running clock generator (ODCa)' receives 'CK' and outputs 'CK'. This 'CK' signal is divided by 122368 to produce 'FS', which is then divided by 256 to produce 'MFS'. The 'AI\_D' signal is combined with 'CK', 'FS', and 'MFS' to produce the final output signals 'AI\_D', 'AI\_CK', 'AI\_FS', and 'AI\_MFS' at the bottom. A reference label 'G.798(17)-Amd.3(21)\_F14-66.3' is present at the bottom right of the diagram. - -**Figure 14-66.3 – ODUkP specific source process** - -*Clock and (multi)frame start signal generation:* - -The function shall generate a local ODUk clock (ODUkP\_AI\_CK) with a clock rate within the minimum to maximum clock rate of the specified ODU signal as given in Table 14-2 of [ITU-T G.798]. The jitter and wander requirements as defined in Annex A of [ITU-T G.8251] (ODCa clock) apply. - -The function shall generate the (multi)frame start reference signals AI\_FS and AI\_MFS for the ODUk signal. The AI\_FS signal shall be active once per 122 368 clock cycles. AI\_MFS shall be active once every 256 frames. - -PT: The payload type information is derived directly from the adaptation function type. The value for GFP mapping shall be inserted into the PT byte position of the PSI overhead as defined in clause 15.9.2.1.1 of [ITU-T G.709]. - -RES: The function shall insert all-zeros into the RES bytes. - -CSF: The function shall signal the failure of the client signal to the far end by use of the Bit 1 of the PSI[2] byte of the payload structure identifier as defined in clause 17.1 of [ITU-T G.709]. - -All other bits of the ODUk overhead should be sourced as "0"s, except the ODUk-PM STAT field which should be set to the value "normal path signal" (001). - -*Counter processes:* - -For further study. - -**Defects:** None. - -### Consequent actions - -The function shall perform the following consequent actions: - -aCSF-RDI $\leftarrow$ CI\_SSFrdi and CSFrdifdiEnable and CSFEnable - -aCSF-FDI $\leftarrow$ CI\_SSFfdi and CSFrdifdiEnable and CSFEnable - -aCSF-LOS $\leftarrow$ CI\_SSF and CSFEnable - -aCSF-OPU $\leftarrow$ CI\_SSF and CSFEnable - -**Defect correlations:** None. - -### Performance monitoring - -For further study. - -#### 14.3.11.2 ODUkP to ETH adaptation sink function (ODUkP/ETH\_A\_Sk) - -The ODUkP/ETH\_A\_Sk extracts ETH\_CI information from the ODUkP payload area, delivering ETH\_CI to ETH\_TFP and ETH\_FP. It extracts the OPUk overhead (PT and RES) and monitors the reception of the correct payload type. - -### Symbol - -![Symbol diagram for ODUkP/ETH_A_Sk function. The function is represented by a trapezoidal block labeled 'ODUkP/ETH'. It has two input arrows on the left labeled 'ETHF_PP' and 'ETHF_PP'. It has two output arrows pointing upwards labeled 'ETH_TFP' and 'ETH_FP'. It has one input arrow pointing upwards from below labeled 'ODUkP_AP'. It has one output arrow pointing to the right labeled 'ODUkP/ETH_A_Sk_MP'. A reference code 'G.798(17)-Amd.1(18)_F14-66.4' is shown in the bottom right corner of the diagram area.](f2a96e73ee1821c72d24ae4e0a4d7c46_img.jpg) - -G.798(17)-Amd.1(18)\_F14-66.4 - -Symbol diagram for ODUkP/ETH\_A\_Sk function. The function is represented by a trapezoidal block labeled 'ODUkP/ETH'. It has two input arrows on the left labeled 'ETHF\_PP' and 'ETHF\_PP'. It has two output arrows pointing upwards labeled 'ETH\_TFP' and 'ETH\_FP'. It has one input arrow pointing upwards from below labeled 'ODUkP\_AP'. It has one output arrow pointing to the right labeled 'ODUkP/ETH\_A\_Sk\_MP'. A reference code 'G.798(17)-Amd.1(18)\_F14-66.4' is shown in the bottom right corner of the diagram area. - -**Figure 14-66.4 – ODUkP/ETH\_A\_Sk symbol** - -## Interfaces - -Table 14-30.2 – ODUkP/ETH\_A\_Sk interfaces - -| Inputs | Outputs | -|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| ODUkP_AP:
ODUkP_AI_D
ODUkP_AI_CK
ODUkP_AI_FS
ODUkP_AI_MFS
ODUkP_AI_TSF
ETH_TTF_PP:
ETH_PI_D
ETH_PI_P
ETH_PI_DE
ETHF_PP:
ETH_PI_D
ETH_PI_P
ETH_PI_DE
ODUkP/ETH_A_Sk_MP:
ODUkP/ETH_A_Sk_MI_CSF_Reported
ODUkP/ETH_A_Sk_MI_MAC_Length
ODUkP/ETH_A_Sk_MI_CSFrdifdiEnable | ETH_TFP:
ETH_CI_D
ETH_CI_P
ETH_CI_DE
ETH_CI_SSF
ETH_FP:
ETH_CI_D
ETH_CI_P
ETH_CI_DE
ETH_CI_SSF
ETH_CI_SSFrdi
ETH_CI_SSFfdi
ODUkP/ETH_A_Sk_MP:
ODUkP/ETH_A_Sk_MI_AcPT
ODUkP/ETH_A_Sk_MI_AcEXI
ODUkP/ETH_A_Sk_MI_AcUPI
ODUkP/ETH_A_Sk_MI_cPLM
ODUkP/ETH_A_Sk_MI_cLFD
ODUkP/ETH_A_Sk_MI_cUPM
ODUkP/ETH_A_Sk_MI_cEXM
ODUkP/ETH_A_Sk_MI_cCSF
ODUkP/ETH_A_Sk_MI_pFCSError | - -## Processes - -A process diagram of this function is shown in Figure 14-66.5. - -![Diagram of the ODUkP/ETH_A_Sk process showing data flow from client-specific processes down to ODUkP specific processes, with associated management interfaces (MI) and physical interfaces (PI).](bae1bd2b5dec0c7f0717e710ad5a3412_img.jpg) - -The diagram illustrates the ODUkP/ETH\_A\_Sk process, showing the flow of data and management signals through various processing stages: - -- Client-specific processes:** The top-level process. It receives **ETH\_PI\_D/P/DE (ETHF\_PP)** from the left and **ETH\_CI\_D/P/DE (ETH\_TFP)** and **ETH\_CI\_D/P/DE (ETH\_FP)** from the top. It outputs **ETH\_PI\_D/P/DE (ETHF\_PP)** to the right and **ETH\_CI\_D/P/DE (ETH\_TFP)** and **ETH\_CI\_D/P/DE (ETH\_FP)** to the top. It is associated with **MI\_pFCSerrors** and **MI\_MAC\_Length**. -- 802.3 MAC FCS check:** Receives **SF** and **MAC Frame** from the process below. It outputs **SF** and **MAC Frame** to the process above. It is associated with **MI\_pFCSerrors**. -- MAC Length check:** Receives **SF** and **MAC Frame** from the process below. It outputs **SF** and **MAC Frame** to the process above. It is associated with **MI\_MAC\_Length**. -- ETH specific GFP-F processes:** Receives **SF** and **MAC Frame** from the process below. It outputs **SF** and **MAC Frame** to the process above. It is associated with **MI\_AcUPI** (left), **MI\_cUPM** (right), and **FCSdiscard = false** (dashed line). -- Common GFP-F processes:** Receives **GFP\_Frame/FS/SF** from the process below. It outputs **GFP\_Frame/FS/SF** to the process above. It is associated with **MI\_AcEXI** (left), **MI\_cEXM** (right), **CMuxConfig** (dashed line), and **CMuxActive = false** (dashed line). -- ODUkP specific GFP-F processes:** Receives **GFP\_Frame/FS/SF** from the process below. It outputs **GFP\_Frame/FS/SF** to the process above. It is associated with **MI\_cLFD** (right) and **MI\_CSFrdifdiEnable** (left). -- ODUkP specific processes:** The bottom-level process. It receives **ODUkP\_AI\_D/CK/FS/MFS/TSF** from the bottom. It outputs **ODUkP\_AI\_D/CK/FS/TSF** to the bottom. It is associated with **MI\_AcPT** (left), **MI\_cPLM** (right), and **MI\_cCSF** (right). - -Reference: G.798(17)-Amd.4(22)\_F14-66.5 - -Diagram of the ODUkP/ETH\_A\_Sk process showing data flow from client-specific processes down to ODUkP specific processes, with associated management interfaces (MI) and physical interfaces (PI). - -**Figure 14-66.5 – ODUkP/ETH\_A\_Sk process** - -The client-specific processes, and associated MI and PI signals, are specified in clause 9.5 of [ITU-T G.8021]. - -*802.3 MAC FCS check process:* - -See clause 8.6.2 of [ITU-T G.8021]. - -*MAC length check process:* - -See clause 8.5 of [ITU-T G.8021]. - -*Ethernet specific GFP-F sink process:* - -See clause 8.5.4.1.2 of [ITU-T G.806]. GFP pFCS checking, GFP p\_FCSerror, p\_FDis are not supported (FCSdiscard=false). The UPI value for frame-mapped Ethernet shall be expected (Table 6-3 of [ITU-T G.7041]). The Ethernet frames are extracted from the client payload information field of the GFP-F frames according to clause 7.1 of [ITU-T G.7041]. - -*Common GFP sink process:* - -See clause 8.5.3.2 of [ITU-T G.806]. GFP channel multiplexing is not supported (MI\_CMuxActive=false). - -*ODUkP specific GFP sink process:* - -See clause 8.5.2.2 of [ITU-T G.806]. The GFP frames are demapped from the ODUk payload area according to clause 17.4 of [ITU-T G.709]. - -ODUkP specific sink process: - -![Diagram of the ODUkP specific sink process. The diagram shows the flow of signals from the ODUkP_AP input to various management interfaces. The input ODUkP_AP is split into four main paths: AI_D, AI_CK, AI_FS, and AI_MFS. AI_D and AI_CK are direct outputs. AI_FS and AI_MFS are processed by 'Extract CSF' and 'Extract PT' blocks. 'Extract CSF' outputs dCSF, which is then processed by 'Defect correlations' along with AI_TSF and dPLM to produce MI_cCSF and MI_cPLM. 'Extract PT' outputs to 'PT process', which produces MI_AcPT and dPLM. dPLM is also processed by 'Defect correlations'. MI_Active is an input to 'Defect correlations'. The diagram is labeled ODUkP_AP and G.798(17)-Amd.1(18)_F14-66.6.](ff86a9199e2ee52e0a198605699d277d_img.jpg) - -Diagram of the ODUkP specific sink process. The diagram shows the flow of signals from the ODUkP\_AP input to various management interfaces. The input ODUkP\_AP is split into four main paths: AI\_D, AI\_CK, AI\_FS, and AI\_MFS. AI\_D and AI\_CK are direct outputs. AI\_FS and AI\_MFS are processed by 'Extract CSF' and 'Extract PT' blocks. 'Extract CSF' outputs dCSF, which is then processed by 'Defect correlations' along with AI\_TSF and dPLM to produce MI\_cCSF and MI\_cPLM. 'Extract PT' outputs to 'PT process', which produces MI\_AcPT and dPLM. dPLM is also processed by 'Defect correlations'. MI\_Active is an input to 'Defect correlations'. The diagram is labeled ODUkP\_AP and G.798(17)-Amd.1(18)\_F14-66.6. - -Figure 14-66.6 – ODUkP specific sink process - -PT: The function shall extract the PT byte from the PSI overhead as defined in clause 8.7.1.1 of [ITU-T G.798]. The payload type value for GFP mapping in clause 15.9.2.1.1 of [ITU-T G.709] shall be expected. The accepted PT value is available at the MP (MI\_AcPT) and is used for PLM defect detection. - -RES: The value in the RES bytes shall be ignored. - -CSF: The function shall extract the CSF signal indicating the failure of the client signal out of the Bit 1 of the PSI[2] byte of the payload structure identifier as defined in clause 17.1 of [ITU-T G.709]. - -#### Defects - -dPLM – See clause 6.2.4.1 of [ITU-T G.798]. - -dLFD – See clause 6.2.5.2 of [ITU-T G.806]. - -dUPM – See clause 6.2.4.3 of [ITU-T G.806]. - -dEXM – See clause 6.2.4.4 of [ITU-T G.806]. - -dCSF-LOS – See clause 8.6.4.2 of [ITU-T G.8021]. - -dCSF-RDI – See clause 8.6.4.2 of [ITU-T G.8021]. - -dCSF-FDI – See clause 8.6.4.2 of [ITU-T G.8021]. - -#### Consequent actions - -The function shall perform the following consequent actions: - -aSSF ← AI\_TSF or dPLM or dLFD or dUPM or dEXM or dCSF-LOS - -aSSFrdfi ← dCSF-RDI and CSFrdifdiEnable - -aSSFfdi ← dCSF-FDI and CSFrdifdiEnable - -#### Defect correlations - -The function shall perform the following defect correlations to determine the most probable fault cause (see clause 6.4 of [ITU-T G.806]). This fault cause shall be reported to the EMF. - -cPLM $\leftarrow$ dPLM and (not AI\_TSF) -cLFD $\leftarrow$ dLFD and (not dPLM) and (not AI\_TSF) -cUPM $\leftarrow$ dUPM and (not dEXM) and (not dPLM) and (not dLFD) and (not AI\_TSF) -cEXM $\leftarrow$ dEXM and (not dPLM) and (not dLFD) and (not AI\_TSF) -cCSF $\leftarrow$ (dCSF-LOS or dCSF-OPU or dCSF-FDI) and (not dEXM) and (not dUPM) and (not dPLM) and (not dLFD) and (not AI\_TSF) and CSF\_Reported - -### Performance monitoring - -The function shall perform the following performance monitoring primitives processing. The performance monitoring primitives shall be reported to the EMF. - -pFCSErrors: count of FrameCheckSequenceErrors per second. - -NOTE – This primitive is calculated by the MAC FCS Check process. - -### 14.3.12 HAO-capable ODUk to ETH adaptation functions (ODUkP-h/ETH\_A; k = flex) - -#### 14.3.12.1 HAO-capable ODUk to ETH adaptation source function (ODUkP-h/ETH\_A\_So) - -The ODUkP-h/ETH\_A\_So function creates the ODUk signal from a free-running clock. It maps the ETH\_CI information into the payload of the OPUk (k = flex), adds the OPUk overhead (CSF, RCOH, RES, PT) and default ODUk overhead. - -#### Symbol - -![Symbol diagram for ODUkP-h/ETH_A_So function. The central block is labeled 'ODUkP-h/ETH'. Inputs from the top are ETH_TFP and ETH_FP. Inputs from the left are ODUkP-h/ETH_A_So_MP and ETH_RP. Outputs to the right are ETHTF_PP and ETHF_PP. Output to the bottom is ODUkP_AP. Reference G.798(17)_F14-67 is shown at the bottom right.](40e222d90fe6d142ea9c2c893d7de5df_img.jpg) - -Symbol diagram for ODUkP-h/ETH\_A\_So function. The central block is labeled 'ODUkP-h/ETH'. Inputs from the top are ETH\_TFP and ETH\_FP. Inputs from the left are ODUkP-h/ETH\_A\_So\_MP and ETH\_RP. Outputs to the right are ETHTF\_PP and ETHF\_PP. Output to the bottom is ODUkP\_AP. Reference G.798(17)\_F14-67 is shown at the bottom right. - -Figure 14-67 – ODUkP-h/ETH\_A\_So symbol - -#### Interfaces - -Table 14-31 – ODUkP-h/ETH\_A\_So interfaces - -| Inputs | Outputs | -|-----------------------------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| ETH_TFP:
ETH_CI_D
ETH_CI_P
ETH_CI_DE

ETH_FP:
ETH_CI_D
ETH_CI_P
ETH_CI_DE
ETH_CI_SSF
ETH_CI_SSFrdi
ETH_CI_SSFfdi | ODUkP_AP:
ODUkP_AI_Data
ODUkP_AI_Clock
ODUkP_AI_FrameStart
ODUkP_AI_MultiframeStart
ODUkP_(A/M)I_RP
ODUkP_(A/M)I_TSCC

ETHTF_PP:
ETH_PI_D
ETH_PI_P
ETH_PI_DE | - -**Table 14-31 – ODUkP-h/ETH\_A\_So interfaces** - -| Inputs | Outputs | -|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------------------------------------------------| -| ODUkP_RP:
ODUkP_RI_RP
ODUkP_RI_TSCC
ODUkP_RI_NCS

ODUkP-h/ETH_A_So_MP:
ODUkP-h/ETH_A_So_MI_CSFEnable
ODUkP-h/ETH_A_So_MI_CSFrdifdiEnable
ODUkP-h/ETH_A_So_MI_INCREASE
ODUkP-h/ETH_A_So_MI_DECREASE
ODUkP-h/ETH_A_So_MI_TSNUM
ODUkP-h/ETH_A_So_MI_ODUflexRate | ETHF_PP:
ETH_PI_D
ETH_PI_P
ETH_PI_DE

ODUkP-h/ETH_A_So_MP:
ODUkP-h/ETH_A_So_MI_ADJSTATE | -| NOTE – (A/M)I_xxx indicates that the xxx signal may either be an AI_xxx or an MI_xxx signal. | | - -**Processes** - -A process diagram of this function is shown in Figure 14-68. - -![Figure 14-68 – ODUkP-h/ETH_A_So process diagram showing the flow of data and control signals through various processing blocks.](4d9c52be1198628362ec7871f6e0f530_img.jpg) - -The diagram illustrates the ODUkP-h/ETH\_A\_So process flow. It shows the following components and signal paths: - -- External Inputs:** - - ETH\_CI\_SSF (ETH\_FP) and ETH\_CI\_D/P/DE (ETH\_TFP) enter from the top. - - ETH\_CI\_D/P/DE SSF/SSFrdi/SSFfdi (ETH\_FP) enters from the top right. - - MI\_CSFenable and MI\_CSFrdifdiEnable enter from the left. - - FCSEnable = false, CMuxConfig, and CMuxActive = false enter from the left. -- Internal Process Flow:** - - Inputs enter a large grey box containing several process blocks. - - Top level: **Client-specific processes** receive inputs and output **ETH\_PI\_D/P/DE (ETHF\_PP)** to the right. - - Below this, **802.3 MAC FCS generation** receives **ETH\_CI** and outputs a **MAC Frame**. - - The **MAC Frame** and other inputs enter **ETH specific GFP-F processes**. - - Output from this block is **GFP\_FS** and **GFP\_Frame**. - - These enter **Common GFP-F processes**. - - Output is again **GFP\_FS** and **GFP\_Frame**. - - These enter **ODUkP specific GFP-F processes**. - - Output is **ODUkP\_AI\_D**. - - This enters the bottom **ODUkP specific processes** block, which also receives **ODUkP\_AI\_CK/FS**. - - The final output from the bottom block is **ODUkP\_AI\_D/CK/FS/MFS**. -- External Output:** - - ODUkP\_AI\_D/CK/FS/MFS** exits from the bottom of the grey box. - -G.798(17)-Amd.4(22)\_F14-68 - -Figure 14-68 – ODUkP-h/ETH\_A\_So process diagram showing the flow of data and control signals through various processing blocks. - -**Figure 14-68 – ODUkP-h/ETH\_A\_So process** - -The client-specific processes, and associated MI and PI signals, are specified in clause 9.5 of [ITU-T G.8021]. - -### 802.3 MAC FCS generation: - -See clause 8.6.1 of [ITU-T G.802.1]. - -### Ethernet specific GFP-F source process: - -See clause 8.5.4.1.1 of [ITU-T G.806]. GFP pFCS generation is disabled (FCSenable=false). The UPI value for frame-mapped Ethernet shall be inserted (Table 6-3 of [ITU-T G.704]). The Ethernet frames are inserted into the client payload information field of the GFP-F frames according to clause 7.1 of [ITU-T G.704]. - -### Common GFP source process: - -See clause 8.5.3.1 of [ITU-T G.806]. GFP channel multiplexing is not supported (CMuxActive=false). - -### ODUkP specific GFP source process: - -See clause 8.5.2.1 of [ITU-T G.806]. The GFP frames are mapped into the ODUk payload area according to clause 17.4 of [ITU-T G.709]. - -### ODUkP specific source process: - -![Block diagram of the ODUkP-h (k=flex) specific source process. The diagram shows the internal components and signal flow for generating the ODUkP signal. On the left, input signals D, SSF, and FS CK enter the process. The D signal is processed through a series of blocks: 'Insert RCOH', 'Insert PT', 'Insert CSF', 'Insert RES', and 'ODUk OH is set to all-0's, except PM STAT = 001'. The SSF signal is used in the 'Insert CSF' block. The FS CK signal is fed into an 'Adjustable free-running clock generator (ODCa)'. The ODCa generates a CK signal, which is divided by 122368 to produce an FS signal, and then by 256 to produce an MFS signal. These signals (CK, FS, MFS) are fed into a 'BWR generator'. The BWR generator also receives control signals: MI_ODUflexRate, MI_INCREASE, MI_DECREASE, MI_TSNUM, MI_ADJSTATE, RI_RP, RI_TSCC, and RI_NCS. It outputs NCS and BWR_IND signals. The BWR_IND signal is fed back to the 'Insert RCOH' and 'Insert CSF' blocks. The final output signals are AI_D, AI_CK, AI_FS, AI_MFS, xL_RP, xL_TSCC, and x = A/M. The diagram is labeled G.798(23)_F14-69.](ade808c7cde5b576488a326d288f29eb_img.jpg) - -Block diagram of the ODUkP-h (k=flex) specific source process. The diagram shows the internal components and signal flow for generating the ODUkP signal. On the left, input signals D, SSF, and FS CK enter the process. The D signal is processed through a series of blocks: 'Insert RCOH', 'Insert PT', 'Insert CSF', 'Insert RES', and 'ODUk OH is set to all-0's, except PM STAT = 001'. The SSF signal is used in the 'Insert CSF' block. The FS CK signal is fed into an 'Adjustable free-running clock generator (ODCa)'. The ODCa generates a CK signal, which is divided by 122368 to produce an FS signal, and then by 256 to produce an MFS signal. These signals (CK, FS, MFS) are fed into a 'BWR generator'. The BWR generator also receives control signals: MI\_ODUflexRate, MI\_INCREASE, MI\_DECREASE, MI\_TSNUM, MI\_ADJSTATE, RI\_RP, RI\_TSCC, and RI\_NCS. It outputs NCS and BWR\_IND signals. The BWR\_IND signal is fed back to the 'Insert RCOH' and 'Insert CSF' blocks. The final output signals are AI\_D, AI\_CK, AI\_FS, AI\_MFS, xL\_RP, xL\_TSCC, and x = A/M. The diagram is labeled G.798(23)\_F14-69. - -**Figure 14-69 – ODUkP-h (k=flex) specific source process** - -### Adjustable clock and (multi)frame start signal generation: - -The function shall generate a local ODUk clock (ODUkP\_AI\_CK) with a clock rate within the minimum to maximum clock rate of the ODUflex signal as given in Table 7-2 of [ITU-T G.709]. The jitter and wander requirements as defined in Annex A of [ITU-T G.825] (ODCa clock) apply. - -The function shall generate the (multi)frame start reference signals AI\_FS and AI\_MFS for the ODUk signal. The AI\_FS signal shall be active once per 122 368 clock cycles. AI\_MFS shall be active once every 256 frames. - -PT: The payload type information is derived directly from the adaptation function type. The value for "GFP mapping" shall be inserted into the PT byte position of the PSI overhead as defined in clause 15.9.2.1.1 of [ITU-T G.709]. The PT value of a hao-capable adaptation function should remain the same as a non-hao-capable one. - -RES: The function shall insert all-ZEROs into the RES bytes. - -CSF: The function shall signal the failure of the client signal to the far end by use of Bit 1 of the PSI[2] byte of the payload structure identifier, as defined in clause 17.1 of [ITU-T G.709]. - -All other bits of the ODUk overhead should be sourced as "0"s, except the PMOH STAT field which should be set to the value "normal path signal" (001). - -*Counter processes:* - -For further study. - -**RCOH generator:** This process inserts the NCS generated by the HAO process into the NCS field of the RCOH in OPUflex. - -**BWR\_Generator:** This process is used for BWR protocol adjustment processing and the generation of the BWR protocol overhead. It contains the following processes as shown in Figure 14-70. - -*Adjustment activation:* When MI\_INCREASE or MI\_DECREASE is true, the BWR protocol is activated and RI processing is started. - -*Rate adjustment control:* Generates ODUflex clock control signal. The original ODUflex clock rate will gradually change to the new ODUflex clock rate so that no GMP buffer overflow or underflow will occur in the ODUflex network connection. Refer to [ITU-T G.7044]. - -![Figure 14-70 – BWR_Generator process block diagram. The diagram shows a large grey box representing the BWR_Generator process. Inside, there are three main components: 'Adjustment activation', 'RI processing', and 'Rate adjustment control'. 'Adjustment activation' receives 'CK', 'FS', and 'MFS' inputs from the top and 'MI_INCREASE' and 'MI_DECREASE' inputs from the right. It outputs to 'RI processing'. 'RI processing' receives 'RI_RP', 'RI_TSCC', and 'RI_NCS' inputs from the left and an input from 'Adjustment activation'. It outputs 'NCS' and 'BWR_IND' to the left, 'MI_ADJSTATE' to the right, and 'xl_RP' and 'xl_TSCC' to the bottom. 'Rate adjustment control' receives an input from 'RI processing' and 'MI_TSNUM' from the right. It outputs 'ODUflex clock control information' to the bottom. The 'BWR_generator' label is at the bottom right of the box. The diagram is labeled G.798(17)_F14-70.](40043f81129f46859efbb0379984a286_img.jpg) - -Figure 14-70 – BWR\_Generator process block diagram. The diagram shows a large grey box representing the BWR\_Generator process. Inside, there are three main components: 'Adjustment activation', 'RI processing', and 'Rate adjustment control'. 'Adjustment activation' receives 'CK', 'FS', and 'MFS' inputs from the top and 'MI\_INCREASE' and 'MI\_DECREASE' inputs from the right. It outputs to 'RI processing'. 'RI processing' receives 'RI\_RP', 'RI\_TSCC', and 'RI\_NCS' inputs from the left and an input from 'Adjustment activation'. It outputs 'NCS' and 'BWR\_IND' to the left, 'MI\_ADJSTATE' to the right, and 'xl\_RP' and 'xl\_TSCC' to the bottom. 'Rate adjustment control' receives an input from 'RI processing' and 'MI\_TSNUM' from the right. It outputs 'ODUflex clock control information' to the bottom. The 'BWR\_generator' label is at the bottom right of the box. The diagram is labeled G.798(17)\_F14-70. - -**Figure 14-70 – BWR\_Generator process** - -*RI processing:* This performs BWR protocol processing according to the RI\_RP, RI\_TSCC, RI\_NCS signals received from the BWR\_Receiver process. - -- When RI processing is activated, xl\_RP and xl\_TSCC (x is A or M) signals are set to one (1). -- The value of the NCS signal is set to ACK(1) when receiving RI\_RP=1 and the value of RI\_TSCC is changed from 0 to 1. - -- Rate adjustment control is activated when receiving RI\_RP=1 and RI\_TSCC=1 and RI\_NCS=ACK(1). -- BWR\_IND is set to "1" x $\mu$ s before the ODUflex signal's bit rate adjustment starts, and is set to "0" y $\mu$ s before the ODUflex signal's bit rate adjustment is completed. x is almost equal to y and shall be in the range of 125 to 250 $\mu$ s. -- The value of xI\_TSCC signal is set to 0 when rate adjustment is completed. -- The value of the NCS signal is set to NACK(0) when receiving RI\_RP=1 and the value of RI\_TSCC is changed from 1 to 0. -- The value of the RP signal is set to 0 when receiving RI\_NCS=NACK(0) and sending NCS=NACK(0). -- The completion of the resize process is reported to the NMS when receiving RI\_RP=0. - -### Defects - -None. - -### Consequent actions - -aCSF-RDI $\leftarrow$ CI\_SSFrdi and CSFrdifdiEnable and CSFEnable - -aCSF-FDI $\leftarrow$ CI\_SSFfdi and CSFrdifdiEnable and CSFEnable - -aCSF-LOS $\leftarrow$ CI\_SSF and CSFEnable - -aCSF-OPU $\leftarrow$ CI\_SSF and CSFEnable - -### Defect correlations - -None. - -### Performance monitoring - -For further study. - -### 14.3.12.2 HAO-capable ODUk to ETH adaptation sink function (ODUkP-h/ETH\_A\_Sk) - -The ODUkP-h/ETH\_A\_Sk extracts ETH\_CI information from the ODUkP payload area, delivering ETH\_CI to ETH\_TFP and ETH\_FP. It extracts the OPUk overhead (PT, RCOH, CSF and RES) and monitors the reception of the correct payload type. - -### Symbol - -![Symbol diagram for ODUkP-h/ETH_A_Sk. The central block is labeled 'ODUkP-h/ETH'. It has two input arrows on the left labeled 'ETHF_PP' and 'ETHF_PP'. It has two output arrows on top labeled 'ETH_TFP' and 'ETH_FP'. It has one output arrow on the right labeled 'ODUkP-h/ETH_A_Sk_MP'. It has one input arrow on the bottom labeled 'ODUkP_AP'. The text 'G.798(17)_F14-71' is located at the bottom right of the diagram.](592c06cc12480f3bcfcbe826668abfa4_img.jpg) - -Symbol diagram for ODUkP-h/ETH\_A\_Sk. The central block is labeled 'ODUkP-h/ETH'. It has two input arrows on the left labeled 'ETHF\_PP' and 'ETHF\_PP'. It has two output arrows on top labeled 'ETH\_TFP' and 'ETH\_FP'. It has one output arrow on the right labeled 'ODUkP-h/ETH\_A\_Sk\_MP'. It has one input arrow on the bottom labeled 'ODUkP\_AP'. The text 'G.798(17)\_F14-71' is located at the bottom right of the diagram. - -Figure 14-71 – ODUkP-h/ETH\_A\_Sk symbol - -## Interfaces - -Table 14-32 – ODUkP-h/ETH\_A\_Sk interfaces - -| Inputs | Outputs | -|--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| ODUkP_AP:
ODUkP_AI_Data
ODUkP_AI_ClocK
ODUkP_AI_FrameStart
ODUkP_AI_MultiframeStart
ODUkP_AI_TSF
ODUkP_(A/M)I_RP
ODUkP_(A/M)I_TSCC

ETHTF_PP:
ETH_PI_D
ETH_PI_P
ETH_PI_DE

ETHF_PP:
ETH_PI_D
ETH_PI_P
ETH_PI_DE

ODUkP-h/ETH_A_Sk_MP:
ODUkP-h/ETH_A_Sk_MI_CSF_Reported
ODUkP-h/ETH_A_Sk_MI_MAC_Length
ODUkP-h/ETH_A_Sk_MI_CSFdifdiEnable
ODUkP-h/ETH_A_Sk_MI_INCREASE
ODUkP-h/ETH_A_Sk_MI_DECREASE | ETH_TFP:
ETH_CI_D
ETH_CI_P
ETH_CI_DE
ETH_CI_SSF

ETH_FP:
ETH_CI_D
ETH_CI_P
ETH_CI_DE
ETH_CI_SSF
ETH_CI_SSFrdi
ETH_CI_SSFfdi

ODUkP_RP:
ODUkP_RI_RP
ODUkP_RI_TSCC
ODUkP_RI_NCS

ODUkP-h/ETH_A_Sk_MP:
ODUkP-h/ETH_A_Sk_MI_AcPT
ODUkP-h/ETH_A_Sk_MI_AcEXI
ODUkP-h/ETH_A_Sk_MI_AcUPI
ODUkP-h/ETH_A_Sk_MI_cPLM
ODUkP-h/ETH_A_Sk_MI_cLFD
ODUkP-h/ETH_A_Sk_MI_cUPM
ODUkP-h/ETH_A_Sk_MI_cEXM
ODUkP-h/ETH_A_Sk_MI_cCSF
ODUkP-h/ETH_A_Sk_MI_pFCSErrors | - -## Processes - -A process diagram of this function is shown in Figure 14-72. - -![Diagram of the ODUkP-h/ETH_A_Sk process stack. The stack consists of several layers: Client-specific processes (top), 802.3 MAC FCS check, MAC length check, ETH specific GFP-F processes, Common GFP-F processes, ODUkP specific GFP-F processes, and ODUkP specific processes (bottom). Data flows upwards through the stack, with various signals and parameters like SF, MAC Frame, GFP_Frame/FS/SF, and ODUkP_AI_D/CK/FS/MFS/TSF being passed between layers. External signals include ETH_CI_D/P/DE/SSF (ETH_TFP), ETH_CI_D/P/DE/SSF/SSFrdi/SSFrdi (ETH_FP), ETH_PI_D/P/DE (ETHF_PP), MI_pFCSErrors, MI_MAC_Lenght, MI_cUPM, MI_cEXM, MI_cLFD, MI_cPLM, MI_cCSF, MI_AcUPI, MI_AcEXI, MI_CSFrdifdiEnable, CMuxConfig, CMuxActive = false, FCSdiscard = false, and MI_AcPT. The diagram is labeled G.798(17)-Amd.4(22)_F14-72.](79e6576a312f8ddac8c706d78fae4bcf_img.jpg) - -Diagram of the ODUkP-h/ETH\_A\_Sk process stack. The stack consists of several layers: Client-specific processes (top), 802.3 MAC FCS check, MAC length check, ETH specific GFP-F processes, Common GFP-F processes, ODUkP specific GFP-F processes, and ODUkP specific processes (bottom). Data flows upwards through the stack, with various signals and parameters like SF, MAC Frame, GFP\_Frame/FS/SF, and ODUkP\_AI\_D/CK/FS/MFS/TSF being passed between layers. External signals include ETH\_CI\_D/P/DE/SSF (ETH\_TFP), ETH\_CI\_D/P/DE/SSF/SSFrdi/SSFrdi (ETH\_FP), ETH\_PI\_D/P/DE (ETHF\_PP), MI\_pFCSErrors, MI\_MAC\_Lenght, MI\_cUPM, MI\_cEXM, MI\_cLFD, MI\_cPLM, MI\_cCSF, MI\_AcUPI, MI\_AcEXI, MI\_CSFrdifdiEnable, CMuxConfig, CMuxActive = false, FCSdiscard = false, and MI\_AcPT. The diagram is labeled G.798(17)-Amd.4(22)\_F14-72. - -**Figure 14-72 – ODUkP-h/ETH\_A\_Sk process** - -The client-specific processes, and associated MI and PI signals, are specified in clause 9.5 of [ITU-T G.8021]. - -*802.3 MAC FCS check process:* - -See clause 8.6.2 of [ITU-T G.8021]. - -*MAC length check process:* - -See clause 8.5 of [ITU-T G.8021]. - -*Ethernet specific GFP-F sink process:* - -See clause 8.5.4.1.2 of [ITU-T G.806]. GFP pFCS checking, GFP p\_FCSError, p\_FDis are not supported (FCSdiscard=false). The UPI value for frame-mapped Ethernet shall be expected (Table 6-3 of [ITU-T G.7041]). The Ethernet frames are extracted from the client payload information field of the GFP-F frames according to clause 7.1 of [ITU-T G.7041]. - -*Common GFP sink process:* - -See clause 8.5.3.2 of [ITU-T G.806]. GFP channel multiplexing is not supported (MI\_CMuxActive=false). - -*ODUkP specific GFP sink process:* - -See clause 8.5.2.2 of [ITU-T G.806]. The GFP frames are demapped from the ODUk payload area according to clause 17.4 of [ITU-T G.709]. - -ODUkP specific sink process: - -![Figure 14-73 – ODUkP (k=flex) specific sink process. This block diagram shows the internal components of an ODUkP sink. On the left, external signals MI_INCREASE, MI_DECREASE, RI_RP, RI_TSCC, and RI_NCS enter a 'BWR receiver' block. The 'BWR receiver' outputs NCS to three parallel extraction blocks: 'Extract RCOH', 'Extract CSF', and 'Extract PT'. 'Extract RCOH' outputs NCS, 'Extract CSF' outputs dCSF, and 'Extract PT' outputs to a 'PT process' block. The 'PT process' outputs MI_AcPT and dPLM. A 'Defect correlations' block receives dPLM, dCSF, and AI_TSF as inputs and outputs MI_cPLM and MI_cCSF. External signals D, CK, and FS enter from the top, while AI_D, AI_MFS, AI_CK, AI_FS, and AI_TSF enter from the bottom. The entire process is labeled ODUkP_AP and G.798(23)_F14-73.](5e90ca04dc493a9f9aabbdbb720d39d6_img.jpg) - -Figure 14-73 – ODUkP (k=flex) specific sink process. This block diagram shows the internal components of an ODUkP sink. On the left, external signals MI\_INCREASE, MI\_DECREASE, RI\_RP, RI\_TSCC, and RI\_NCS enter a 'BWR receiver' block. The 'BWR receiver' outputs NCS to three parallel extraction blocks: 'Extract RCOH', 'Extract CSF', and 'Extract PT'. 'Extract RCOH' outputs NCS, 'Extract CSF' outputs dCSF, and 'Extract PT' outputs to a 'PT process' block. The 'PT process' outputs MI\_AcPT and dPLM. A 'Defect correlations' block receives dPLM, dCSF, and AI\_TSF as inputs and outputs MI\_cPLM and MI\_cCSF. External signals D, CK, and FS enter from the top, while AI\_D, AI\_MFS, AI\_CK, AI\_FS, and AI\_TSF enter from the bottom. The entire process is labeled ODUkP\_AP and G.798(23)\_F14-73. - -Figure 14-73 – ODUkP (k=flex) specific sink process - -**PT:** The function shall extract the PT byte from the PSI overhead as defined in clause 8.7.1.1. The payload type value for "GFP mapping" in clause 15.9.2.1.1 of [ITU-T G.709] shall be expected. The accepted PT value is available at the MP (MI\_AcPT) and is used for PLM defect detection. The PT value of a hao-capable adaptation function should remain the same as a non-hao-capable one. - -**CSF:** The function shall extract the CSF signal indicating the failure of the client signal out of Bit 1 of the PSI[2] byte of the payload structure identifier as defined in [ITU-T G.709], clause 17.1. - -**RES:** The value in the RES bytes shall be ignored. - -**RCOH receiver:** This process extracts the NCS from the RCOH overhead area, and then forwards it to BWR\_Receiver. - -**BWR\_Receiver:** This process extracts and detects the BWR protocol overhead, with the exception of the BWR\_IND signal. It is shown in Figure 14-74. - -When MI\_INCREASE or MI\_DECREASE is true, the BWR protocol is activated and starts to receive AI\_RP/MI\_RP, AI\_TSCC/MI\_TSCC from the BWR\_RELAY\_Receiver process and the NCS from the extract NCS process. Then the detected values of the RP, TSCC and NCS are sent to the BWR generator. - -![Figure 14-74 – BWR_Receiver process. This block diagram shows the internal components of a BWR receiver. External signals NCS, xI_RP, CK, FS, and MFS enter from the top. MI_INCREASE and MI_DECREASE enter from the right. The 'BWR OH detecting processing' block receives NCS, xI_RP, CK, FS, MFS, MI_INCREASE, and MI_DECREASE. It outputs to the 'Forwarding processing' block. The 'Forwarding processing' block outputs RI_RP, RI_TSCC, and RI_NCS to the left. The entire process is labeled BWR_receiver and G.798(17)_F14-74.](d988db7a59b060ff3406236569343e4f_img.jpg) - -Figure 14-74 – BWR\_Receiver process. This block diagram shows the internal components of a BWR receiver. External signals NCS, xI\_RP, CK, FS, and MFS enter from the top. MI\_INCREASE and MI\_DECREASE enter from the right. The 'BWR OH detecting processing' block receives NCS, xI\_RP, CK, FS, MFS, MI\_INCREASE, and MI\_DECREASE. It outputs to the 'Forwarding processing' block. The 'Forwarding processing' block outputs RI\_RP, RI\_TSCC, and RI\_NCS to the left. The entire process is labeled BWR\_receiver and G.798(17)\_F14-74. - -Figure 14-74 – BWR\_Receiver process - -## Defects - -dPLM – See clause 6.2.4.1. - -dLFD – See clause 6.2.5.2 of [ITU-T G.806]. -dUPM – See clause 6.2.4.3 of [ITU-T G.806]. -dEXM – See clause 6.2.4.4 of [ITU-T G.806]. -dCSF-LOS – See clause 8.6.4.2 of [ITU-T G.8021]. -dCSF-RDI – See clause 8.6.4.2 of [ITU-T G.8021]. -dCSF-FDI – See clause 8.6.4.2 of [ITU-T G.8021]. -dCSF-OPU – See clause 6.2.10. - -### Consequent actions - -The function shall perform the following consequent actions: - -aSSF $\leftarrow$ AI\_TSF or dPLM or dLFD or dUPM or dEXM or dCSF-LOS -aSSRdi $\leftarrow$ dCSF-RDI and CSFrdifdiEnable -aSSRfdi $\leftarrow$ dCSF-FDI and CSFrdifdiEnable - -### Defect correlations - -The function shall perform the following defect correlations to determine the most probable fault cause (see clause 6.4 of [ITU-T G.806]). This fault cause shall be reported to the EMF. - -cPLM $\leftarrow$ dPLM and (not AI\_TSF); -cLFD $\leftarrow$ dLFD and (not dPLM) and (not AI\_TSF); -cUPM $\leftarrow$ dUPM and (not dEXM) and (not dPLM) and (not dLFD) and (not AI\_TSF); -cEXM $\leftarrow$ dEXM and (not dPLM) and (not dLFD) and (not AI\_TSF) -cCSF $\leftarrow$ (dCSF-LOS or dCSF-OPU or dCSF-FDI) and (not dEXM) and (not dUPM) and (not dPLM) and (not dLFD) and (not AI\_TSF) and CSF\_Reported - -### Performance monitoring - -The function shall perform the following performance monitoring primitives processing. The performance monitoring primitives shall be reported to the EMF. - -pFCSErrors: count of FrameCheckSequenceErrors per second. - -NOTE – This primitive is calculated by the MAC FCS check process. - -### 14.3.13 HAO-capable ODUkP-h to ODUj payload type 21 adaptation function (ODUkP-h/ODUj-21\_A) - -The HAO-capable ODUkP to ODUj payload type 21 adaptation functions perform the adaptation between the ODUkP ( $k = 2, 3, 4, 25u, 25, 50u, 50$ ) layer adapted information and the characteristic information of ODUj ( $j = 0, 1, 2, 2e, 3, flex$ ) signals. - -![Diagram of HAO-capable ODUkP-h/ODUj-21_A function. A central trapezoidal block labeled 'ODUkP-h/ODUj-21' has multiple tributary ports (1, 2, ..., n) at the top, each connected to an 'ODUj_CP'. Below the block, a single connection point is labeled 'ODUkP_AP'. The text 'G.798(17)_F14-75' is at the bottom right.](c79d10d97e1f525e9c85e96e91616923_img.jpg) - -Diagram of HAO-capable ODUkP-h/ODUj-21\_A function. A central trapezoidal block labeled 'ODUkP-h/ODUj-21' has multiple tributary ports (1, 2, ..., n) at the top, each connected to an 'ODUj\_CP'. Below the block, a single connection point is labeled 'ODUkP\_AP'. The text 'G.798(17)\_F14-75' is at the bottom right. - -**Figure 14-75 – HAO-capable ODUkP-h/ODUj-21\_A function** - -Three different types of functions are possible: - -- the ODU2P-h/ODUj-21\_A performs multiplexing/demultiplexing of any LO ODU with a bit rate less than the OPU2 payload bit rate into an OPU2; -- the ODU3P-h/ODUj-21\_A performs multiplexing/demultiplexing of any LO ODU with a bit rate less than the OPU3 payload bit rate into an OPU3; -- the ODU4P-h/ODUj-21\_A performs multiplexing/demultiplexing of any LO ODU with a bit rate less than the OPU4 payload bit rate into an OPU4; -- the ODU25(u)P-h/ODUj-21\_A performs multiplexing/demultiplexing of any LO ODU with a bit rate less than the OPU25(u) payload bit rate into an OPU25(u); -- the ODU50(u)P-h/ODUj-21\_A performs multiplexing/demultiplexing of any LO ODU with a bit rate less than the OPU50(u) payload bit rate into an OPU50(u). - -Tributary ports are dynamically created and deleted under the control of management. Each tributary port is associated with one ODUj connection point on one side, and the M OPUk tributary slots on the other. The multiplex structure identifier (MSI) carries the configuration of tributary ports to tributary slots. - -**14.3.13.1 HAO-capable ODUkP to ODUj payload type 21 adaptation source function (ODUkP-h/ODUj\_A\_So)** - -The HAO-capable ODUkP/ODUj-21\_A\_So function creates the ODUk signal from a free-running clock. It asynchronously maps the ODUj client signal from the $n \times$ ODUj CPs into ODTUjk or ODTUk.M including the justification control (JC) information. The ODTUjk and ODTUk.M are multiplexed into the tributary slots of the OPUk. It adds the OPUk overhead (RES, PT, MSI, OMFI) and default ODUk overhead. It provides access to the ODUk PM APS overhead. - -The information flow and processing of the HAO-capable ODUkP/ODUj-21\_A\_So function is defined with reference to Figures 14-76, 14-77 and 14-78. - -**Symbol** - -![Diagram of ODUkP-h/ODUj-21_A_So function. A central trapezoidal block labeled 'ODUkP-h/ODUj-21' has multiple tributary ports (1, 2, ..., n) at the top, each connected to an 'ODUj_CP'. On the left side, there are two input arrows labeled 'ODUkP-h/ODUj-21_A_So_MP' and 'ODUkP_PP'. On the right side, there are two output arrows labeled 'ODUkP-h/ODUj-21_A_So_RP' and 'ODUk_TP'. Below the block, a single connection point is labeled 'ODUkP_AP'. The text 'G.798(17)_F14-76' is at the bottom right.](abf91c0fe8bc45562f2bc9adc2d5d58a_img.jpg) - -Diagram of ODUkP-h/ODUj-21\_A\_So function. A central trapezoidal block labeled 'ODUkP-h/ODUj-21' has multiple tributary ports (1, 2, ..., n) at the top, each connected to an 'ODUj\_CP'. On the left side, there are two input arrows labeled 'ODUkP-h/ODUj-21\_A\_So\_MP' and 'ODUkP\_PP'. On the right side, there are two output arrows labeled 'ODUkP-h/ODUj-21\_A\_So\_RP' and 'ODUk\_TP'. Below the block, a single connection point is labeled 'ODUkP\_AP'. The text 'G.798(17)\_F14-76' is at the bottom right. - -**Figure 14-76 – ODUkP-h/ODUj-21\_A\_So function** - -## Interfaces - -Table 14-33 – ODUkP-h/ODUj-21\_A\_So inputs and outputs - -| Input(s) | Output(s) | -|--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| n x ODUj_CP:
ODUj_CI_CK
ODUj_CI_D
ODUj_CI_FS
ODUj_CI_MFS
ODUj_CI_APS
ODUj-21_(C/M)I_RP
ODUj-21_(C/M)I_TSCC
ODUk_PP:
ODUk_PI_APS
ODUk_TP:
ODUk_TI_CK
ODUkP-h/ODUj-21_A_So_MP:
ODUkP-h/ODUj-21_A_So_MI_TxMSI
ODUkP-h/ODUj-21_A_So_MI_AUTOpayloadtype (Note 2)
ODUkP-h/ODUj-21_A_So_MI_ODUType_Rate[1..n]
ODUkP-h/ODUj_A_So_MI_AdminState[1..n]
ODUkP-h/ODUj_A_So_MI_APS_EN[1..n]
ODUkP-h/ODUj_A_So_MI_APS_LVL[1..n]
ODUkP-h/ODUj-21_A_So_MI_INCREASE
ODUkP-h/ODUj-21_A_So_MI_DECREASE
ODUkP-h/ODUj-21_A_So_MI_TSMAP
ODUkP-h/ODUj-21_A_So_MI_TPID
ODUkP-h/ODUj-21_A_So_RP:
ODUkP-h/ODUj-21_A_So_RI_AcPT (Note 2)
ODUkP-h/ODUj-21_A_So_RI_RP
ODUkP-h/ODUj-21_A_So_RI_CTRL
ODUkP-h/ODUj-21_A_So_RI_TSGS
ODUkP-h/ODUj-21_A_So_RI_TPID | ODUkP_AP:
ODUkP_AI_CK
ODUkP_AI_D
ODUkP_AI_FS
ODUkP_AI_MFS
ODUkP-h/ODUj-21_A_So_RP:
ODUkP-h/ODUj-21_A_So_RI_TrPT (Note 2)
ODUkP-h/ODUj-21_A_So_MP:
ODUkP-h/ODUj-21_A_So_MI_TrPT (Note 2)
ODUkP-h/ODUj-21_A_So_MI_ADJSTATE | -| NOTE 1 – (C/M)I_xxx indicates that the xxx signal may either be a CI_xxx or a MI_xxx signal. | | -| NOTE 2 – For ODU2P-h/ODUj-21_A_So and ODU3P-h/ODUj-21_A_So only. | | - -## Processes - -The processes associated with the HAO-capable ODUkP-h/ODUj-21\_A\_So function are specific processes for each ODUj\_CP and common processes for the compound (multiplexed) signal as depicted in Figures 14-77 and 14-78. - -![Figure 14-77 – ODUkP-h/ODUj-21_A_So processes. This block diagram illustrates the internal structure of the ODUkP-h/ODUj-21_A_So processes. At the top, multiple client-specific processes (ODUj_CP[1] to ODUj_CP[n]) are shown, each with inputs like CI_MFS, CI_FS, CI_CK, CI_D, and CI_APS. These connect to a central 'Multiplexer' block. The multiplexer outputs are labeled OMFS, MFS, FS, CK, and TS#. Below the multiplexer, the 'Multiplex structure identifier (MSI)' is generated, taking inputs from the multiplexer and MGSI. The 'Payload type (PT)' and 'RES' fields are also processed. The 'ODUk PM APS' field is generated from the multiplexer outputs. A block for 'for k = 4, 25(u), 50(u)' contains an 'OMFI' block and a '1/80' divider. The 'ODUk OH is set to all-0's, except PM STAT = 001' block is also present. An 'RCOH generator' block produces various overhead signals. At the bottom, the 'ODUkP_AP' section includes 'AI_D', 'AI_MFS', 'AI_FS', and 'AI_CK' signals. On the right, a 'HAO process (if needed)' block is shown with various input and output signals. The entire diagram is labeled with 'G.798(17)-Amd.3(21)_F14-77'.](9e290fa7e4578ba0a8b8c5008c99b564_img.jpg) - -The diagram illustrates the internal structure of the ODUkP-h/ODUj-21\_A\_So processes. At the top, multiple client-specific processes (ODUj\_CP[1] to ODUj\_CP[n]) are shown, each with inputs like CI\_MFS, CI\_FS, CI\_CK, CI\_D, and CI\_APS. These connect to a central 'Multiplexer' block. The multiplexer outputs are labeled OMFS, MFS, FS, CK, and TS#. Below the multiplexer, the 'Multiplex structure identifier (MSI)' is generated, taking inputs from the multiplexer and MGSI. The 'Payload type (PT)' and 'RES' fields are also processed. The 'ODUk PM APS' field is generated from the multiplexer outputs. A block for 'for k = 4, 25(u), 50(u)' contains an 'OMFI' block and a '1/80' divider. The 'ODUk OH is set to all-0's, except PM STAT = 001' block is also present. An 'RCOH generator' block produces various overhead signals. At the bottom, the 'ODUkP\_AP' section includes 'AI\_D', 'AI\_MFS', 'AI\_FS', and 'AI\_CK' signals. On the right, a 'HAO process (if needed)' block is shown with various input and output signals. The entire diagram is labeled with 'G.798(17)-Amd.3(21)\_F14-77'. - -Signals and blocks include: -- ODUj\_CP[1] ... ODUj\_CP[n] -- CI\_MFS, CI\_FS, CI\_CK, CI\_D, CI\_APS -- MI\_AdminState[1..n], MI\_APS\_EN[1..n], MI\_APS\_LVL[1..n], MI\_ODUType\_Rate[1..n], BWR\_IND, MGSI, GMP\_MODE, CK\_Control -- Multiplexer (OMFS, MFS, FS, CK, D, TS#) -- Multiplex structure identifier (MSI) -- Payload type (PT) -- RES -- ODUk PM APS -- OMFI, $\frac{1}{80}$ -- ODUk OH is set to all-0's, except PM STAT = 001 -- $\frac{1}{256}$ , $\frac{1}{122368}$ -- ODCa clock generator, Free-running clock generator -- RCOH generator (MI\_INCREASE, MI\_DECREASE, MI\_TSMAP, RP, TSCC, CTRL, TSGS, TPID) -- HAO process (if needed) (RP, CTRL, TSGS, TPID, TSCC, CK, FS, (O)MFS, BWR\_IND) -- RI\_RP, RI\_CTRL, RI\_TSGS, RI\_TPID, MI\_INCREASE, MI\_DECREASE, MI\_TSMAP, MI\_TPID, MI\_ADJSTATE -- MI\_TxMSI, MI\_AUTOPayloadtype, MI\_TrPT, RI\_TrPT, RI\_AcPT, RI\_RP, RI\_CTRL, RI\_TSGS, RI\_TPID, PI\_APS, TI\_CK -- AI\_D, AI\_MFS, AI\_FS, AI\_CK (ODUkP\_AP) - -Figure 14-77 – ODUkP-h/ODUj-21\_A\_So processes. This block diagram illustrates the internal structure of the ODUkP-h/ODUj-21\_A\_So processes. At the top, multiple client-specific processes (ODUj\_CP[1] to ODUj\_CP[n]) are shown, each with inputs like CI\_MFS, CI\_FS, CI\_CK, CI\_D, and CI\_APS. These connect to a central 'Multiplexer' block. The multiplexer outputs are labeled OMFS, MFS, FS, CK, and TS#. Below the multiplexer, the 'Multiplex structure identifier (MSI)' is generated, taking inputs from the multiplexer and MGSI. The 'Payload type (PT)' and 'RES' fields are also processed. The 'ODUk PM APS' field is generated from the multiplexer outputs. A block for 'for k = 4, 25(u), 50(u)' contains an 'OMFI' block and a '1/80' divider. The 'ODUk OH is set to all-0's, except PM STAT = 001' block is also present. An 'RCOH generator' block produces various overhead signals. At the bottom, the 'ODUkP\_AP' section includes 'AI\_D', 'AI\_MFS', 'AI\_FS', and 'AI\_CK' signals. On the right, a 'HAO process (if needed)' block is shown with various input and output signals. The entire diagram is labeled with 'G.798(17)-Amd.3(21)\_F14-77'. - -**Figure 14-77 – ODUkP-h/ODUj-21\_A\_So processes** - -![Figure 14-78 – ODUkP-h/ODUj-21_A_So client specific processes. This block diagram illustrates the internal processes of an ODUj client signal. At the top, the ODUj_CP[p] signal is shown with its components: CL_MFS, CL_FS, CL_CK, CL_D, and CL_APS. The diagram shows the flow of data and control signals through various functional blocks: an OPUflex RCOH receiver, an ODU-LCK generator, a 'Select normal/LCK' block, an ODUj APS block, a FAS/MFAS insertion block, an Elastic store (buffer), and a Justification control and JC generation block. External control signals include BWR_IND, MI_AdminState[p], MI_APS_EN[p], MI_APS_LVL[p], MGSI, GMP_MODE, CK_Control, and MI_ODUType_Rate[p]. Input signals at the bottom are OMFS, MFS, FS, CK, D, and TS#.](169044aee9e8adb39eed822364eed8aa_img.jpg) - -G.798(17)-Amd.3(21)\_F14-78 - -Figure 14-78 – ODUkP-h/ODUj-21\_A\_So client specific processes. This block diagram illustrates the internal processes of an ODUj client signal. At the top, the ODUj\_CP[p] signal is shown with its components: CL\_MFS, CL\_FS, CL\_CK, CL\_D, and CL\_APS. The diagram shows the flow of data and control signals through various functional blocks: an OPUflex RCOH receiver, an ODU-LCK generator, a 'Select normal/LCK' block, an ODUj APS block, a FAS/MFAS insertion block, an Elastic store (buffer), and a Justification control and JC generation block. External control signals include BWR\_IND, MI\_AdminState[p], MI\_APS\_EN[p], MI\_APS\_LVL[p], MGSI, GMP\_MODE, CK\_Control, and MI\_ODUType\_Rate[p]. Input signals at the bottom are OMFS, MFS, FS, CK, D, and TS#. - -**Figure 14-78 – ODUkP-h/ODUj-21\_A\_So client specific processes** - -### Specific processes - -The specific processes are performed independently for each ODUj client signal that is multiplexed into the OPUk. The specific processes perform the mapping of the ODUj into an ODTUjk or ODTUk.M. - -**FAS/MFAS insertion:** The function shall extend the ODUj with the frame alignment overhead (FAS and MFAS) in row one bytes 1 to 7, as described in clause 15.6.2 of [ITU-T G.709]. Bytes 8 to 14 of row one are set to all-ZEROs. - -**Mapping, frequency justification and bit rate adaptation:** The function shall provide an elastic store (buffer) process for the ODUj client signal. The data signal ODUj\_CI shall be written into the buffer under the control of the associated input clock. - -Two justification methods as described below are provided, AMP (*ODTUjk*) and GMP (*ODTUk.M*). The ODU type and rate, as configured via the MI\_ODUType\_Rate[p] input for tributary port #p, determine the mapping method and in the case of GMP mapping, the base value and ranges for the parameters Cn and Cm. - -*ODTUjk:* The data shall be read out of the buffer and written onto the D, NJO, PJO1 and PJO2 bytes of the selected ODTUjk frame under the control of the ODUk clock and the AMP justification decisions, as defined in clause 19.5 of [ITU-T G.709]. - -A justification decision shall be performed two times per OPUk multiframe (jk=12, 13) and eight times per OPUk multiframe (jk=23). Justification decisions are taken at the beginning of the OPUk frame carrying an instance of the ODTUjk justification overhead. Each justification decision results in a corresponding double positive, positive, negative or no justification action in this OPUk frame. Upon a double positive justification action, the reading of two data bytes out of the buffer shall be cancelled once. No ODUj data shall be written onto the PJO2, PJO1 or NJO bytes. Upon a positive justification action, the reading of one data byte out of the buffer shall be cancelled once. No ODUj data shall be written onto the PJO1 or NJO bytes and data shall be written onto the PJO2 byte. Upon a negative justification action, one extra data byte shall be read once out of the buffer. ODUj data shall be written onto the PJO2, PJO1 and NJO bytes. If no justification action is to be performed, ODUj data shall be written onto the PJO2 and PJO1 bytes and no ODUj data shall be written onto the NJO byte. The OPUk frame that contains the PJO2, PJO1 and NJO bytes depends on the tributary slots occupied by the ODTUjk. - -The justification decisions determine the phase error introduced by the function. - -*ODTUk.M:* The data shall be read out of the buffer and written onto groups of M successive bytes of the ODTUk.M payload area under the control of the ODUk clock and the GMP data/stuff control mechanism, as defined in clause 19.6 of [ITU-T G.709]. - -*Buffer size:* In the presence of jitter as specified by [ITU-T G.8251] and a frequency within the range specified in Table 7-2 of [ITU-T G.709], this mapping process shall not introduce any errors. The maximum buffer hysteresis, and therefore the maximum phase error introduced, shall be as listed in Table 14-34. - -**Table 14-34 – Maximum buffer hysteresis** - -| Mapping | Maximum buffer hysteresis | -|----------------|------------------------------------| -| ODUj → ODTUk.M | 4*M bytes | -| ODUj → ODTUjk | 2 bytes (j = 1)
8 bytes (j = 2) | - -**ODTUjk JC:** The function shall generate the justification control bits based on the justification decision according to the specification in clause 19.5 of [ITU-T G.709]. It shall insert the justification control bits in bit 7 and 8 of all three JC bytes of the frame in which the justification is performed. The remaining (RES) bits of the JC byte shall be set to all-ZEROs. The ODUk frame that contains the JC bytes depends on the time slot(s) of the ODTUjk. - -**ODTUk.M JC1/JC2/JC3, JC4/JC5/JC6:** The function shall generate the GMP $C_m$ and GMP $\Sigma C_{nD}$ information and insert this into the JC1/JC2/JC3 and JC4/JC5/JC6 bytes respectively, according to the specification in clause 19.6 and Annex D of [ITU-T G.709]. - -The function shall generate the GMP $C_m$ information (without the GMP $\Sigma C_{nD}$ information) and insert this into the JC1/JC2/JC3 bytes during the GMP special mode, as defined in clauses 7.1.2 and 7.2.2 of [ITU-T G.7044]. - -**ODUj server layer APS:** When APS is enabled for tributary signal #p (MI\_APS\_EN[p] is true), the function shall insert the CI\_APS value into the ODU APS/PCC[MI\_APS\_LVL[p]] field, which is available once per eight ODU frames when the value of the MFAS bits 6, 7, 8 is equal to MI\_APS\_LVL[p]. - -NOTE – The ODUj server layer section APS information may be present in the case where the ODUj signal contains an ODU-AIS, ODU-LCK or ODU-OCI maintenance signal. The ODU-LCK maintenance signal may be inserted in this adaptation source function. ODUj SNC/I protection is unable to detect the insertion of such ODU-LCK and will not perform a protection switch. - -**ODU-LCK:** The function shall generate the ODU-LCK signal as defined in clause 16.5 of [ITU-T G.709]. The clock, frame start and multiframe start are defined by the incoming ODUk signal. - -**Selector:** The normal signal for a tributary signal #p may be replaced by the ODU-LCK signal. The ODU-LCK signal is selected if the MI\_AdminState[p] is LOCKED. - -**OPUflex RCOH Receiver:** This function shall monitor the OPUflex RCOH overhead and extract the BWR\_IND signal as defined in clause 6.2.7 of [ITU-T G.7044]. - -**RCOH generator:** When MI\_INCREASE or MI\_DECREASE is true, this process inserts the RP, TSCC, CTRL, TSGS and TPID in the RCOH fields of the tributary slots identified in the MI\_TSMAP. - -### Common processes - -**Clock and (multi)frame start signal generation:** The function shall generate a local ODUk clock (ODUKP\_AI\_CK) with a frequency as listed in Table 7-2 of [ITU-T G.709] from the synchronization timing information clock input (TI\_CK) or, if the TI\_CK is absent, a free-running oscillator. The clock parameters, including jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCa clock) apply. - -The function shall generate the (multi)frame start reference signals AI\_FS and AI\_MFS for the ODUk signal. The AI\_FS signal shall be active once per 122 368 clock cycles. AI\_MFS shall be active once every 256 frames. - -**OPU multiframe (OMFI) start signal generation for OPUk with k=4, 25(u), 50(u):** For k = 4, 25(u), 50(u) in addition to MFAS, a dedicated OPU multiframe indicator is used for the multiplexing of LO ODUs into the OPU payload area. This multiframe structure is locked to the lsb bits of the OMFI byte as shown in Tables 19-4, 19-5 and 19-6 of [ITU-T G.709], and to be inserted into the OPU overhead. The function shall generate an OPU multiframe and the related start signal (OMFS) dividing the frame signal sequence by the maximum number of tributary slots TSmax. The OMFI start signal may optionally be phase aligned to the ODU multiframe signal. In this case the OMFI = 0 position is aligned with MFAS = 0 position every 1280 frame periods See clause 19.4.4 of [ITU-T G.709]. - -**Multiplexing:** The function assigns the individual ODTUjk or ODTUk.M to specific time slots of the OPUk payload area as defined by the multiplex structure (see clauses 19.3 and 19.4.1 of [ITU-T G.709]). - -**MSI:** The function shall insert TxMSI into the MSI byte positions of the PSI overhead as defined in clauses 19.4.1.4, 19.4.1.5, 19.4.1.6 of [ITU-T G.709]. The TxMSI value, and as such the multiplex structure, is configurable via MI\_TxMSI. *During the HAO process, the TxMSI value should be configured X resizing multiframes prior to the re-enabling of dMSIM[p] detection; as defined in clause 14.3.10.2. X shall be 3.* - -**PT:** The function shall insert code "0010 0001" (ODU multiplex structure supporting ODTUk.ts or ODTUk.ts and ODTUjk) into the PT byte position of the PSI overhead, as defined in clause 15.9.2.1 of [ITU-T G.709] for k = 4. - -**Autonomous payload type for k = 2, 3:** For k = 2, 3 the transmitted PT code shall default to code "0010 0001". This code must be replaced by code "0010 0000" under the control of the PT = 21-to-PT = 20 interworking process described hereafter. When MI\_AutoPayloadtype is activated the function shall adapt a PT21 supporting port to a PT20 structure. If the corresponding adaptation sink provides the information of a PT = 20 at the RI\_AcPT, the function shall fall back to PT = 20 under the following conditions: The MI\_AutoPayloadtype is true and the HO ODU source is either not provisioned for any traffic signal structure, or the HO ODU2 source configured for one or more ODU1 signals is to be mapped into TS1/TS5 and/or TS2/TS6 and/or TS3/TS7 and/or TS4/TS8, or the HO ODU3 source is configured to support one or more ODU1 signals mapped into TS1/TS17, TS2/TS18, TSi/TS16+I and/or one or more ODU2 signals mapped into - -TSa/TS16+a/TSb/TS16+b/TSc/TS16+c/TSd/TS16+d and no other ODU type signals. In this case, the function shall insert PT20 into the PSI positions. The default value of the MI\_AUTO payload type activation shall be "true". In the situation where a PT 21 capable port which has been operating in the PT20 mode is taken out of service or receives PT21, the port shall subsequently fall back to a PT21 structure. - -In the case where the ODU2 or ODU3 adaptation source is configured for either ODU0, or ODUflex, or ODU2e, or for an ODU1 in TSi/TSj with $j < 4+i$ (for ODU2) or $j < 16+i$ (for ODU3), then PT21 is to be inserted. The transmitted PT shall be reported at the ODUkP-h/ODUj-21\_A\_So\_RI\_TrPT to the corresponding adaptation sink function and the ODUkP-h/ODUj-21\_A\_So\_MI\_TrPT. - -NOTE – The change to PT20 or PT21 means a full adaptation to the related signal structure including the default OH byte insertion. - -**HAO processes:** The HAO process includes LCR\_Generator and BWR\_RELAY\_Generator processes. - -**LCR\_Generator:** This process is used for LCR protocol adjustment processing and generation of the LCR protocol overhead. - -*Tributary slot (TS) adjustment activation:* When the MI\_INCREASE or MI\_DECREASE signal's value changes from false to true, the link connection resize (LCR) protocol is activated. - -- For the case where MI\_INCREASE is true and MI\_DECREASE is false, the *CTRL* field is set to ADD(01) and the *TSGS* bit is set to NACK(0). -- For the case where MI\_DECREASE is true and MI\_INCREASE is false, the *CTRL* field is set to REMOVE(10) and the *TSGS* bit is set to NACK(0). -- In any other case, the *CTRL* field is set to IDLE(00) and the *TSGS* bit is set to NACK(0). - -**Table 14-35 – Significance of the control fields during LCR generator processing** - -| MI_INC | MI_DEC | RMF boundary | CTRL | TSGS | -|--------|--------|--------------|------|------| -| 0 | 0 | 0 | 00 | NACK | -| 0 | 0 | 1 | 00 | NACK | -| 0 | 1 | 0 | 10 | NACK | -| 0 | 1 | 1 | 10 | NACK | -| 1 | 0 | 0 | 01 | NACK | -| 1 | 0 | 1 | 01 | NACK | -| 1 | 1 | 0 | N/A | N/A | -| 1 | 1 | 1 | N/A | N/A | - -![Figure 14-79: LCR Generator and BWR_RELAY_generator processes block diagram. The diagram shows a large 'HAO process' block containing two main sub-processes: 'LCR_generator' and 'BWR_RELAY_generator'. The 'LCR_generator' sub-process includes 'TS adjustment activation', 'RI processing', 'TS switch processing', and 'TS adjustment completion process'. The 'BWR_RELAY_generator' sub-process includes 'xI process', 'GMP mode process', 'RP relay process', 'TSCC relay process', and 'Ramp follow process'. External inputs include MI_INCREASE, MI_DECREASE, MI_TSMAP, MI_TPID, CK, FS, MFS, OPU4 MFS, xI_RP, xI_TSCC (X = C or M), and BWR_IND. External outputs include CTRL, TSGS, TPID, MI_ADJUSTATE, RP, GMP_MODE, TSCC, and CK_Control. Internal signals include LCR reactive indication, TSCC relay indication, and TS adjustment completion indication. The diagram is labeled G.798(17)_F14-79.](1846b9e1673ade53caa7358696bc1794_img.jpg) - -Figure 14-79: LCR Generator and BWR\_RELAY\_generator processes block diagram. The diagram shows a large 'HAO process' block containing two main sub-processes: 'LCR\_generator' and 'BWR\_RELAY\_generator'. The 'LCR\_generator' sub-process includes 'TS adjustment activation', 'RI processing', 'TS switch processing', and 'TS adjustment completion process'. The 'BWR\_RELAY\_generator' sub-process includes 'xI process', 'GMP mode process', 'RP relay process', 'TSCC relay process', and 'Ramp follow process'. External inputs include MI\_INCREASE, MI\_DECREASE, MI\_TSMAP, MI\_TPID, CK, FS, MFS, OPU4 MFS, xI\_RP, xI\_TSCC (X = C or M), and BWR\_IND. External outputs include CTRL, TSGS, TPID, MI\_ADJUSTATE, RP, GMP\_MODE, TSCC, and CK\_Control. Internal signals include LCR reactive indication, TSCC relay indication, and TS adjustment completion indication. The diagram is labeled G.798(17)\_F14-79. - -**Figure 14-79 – LCR Generator and BWR\_RELAY\_generator processes** - -*Remote information (RI) processing:* This performs LCR protocol processing according to the RI\_RP, RI\_CTRL, RI\_TSGS, RI\_TPID signals received from the LCR\_Receiver process. - -Increase case: - -- The *TSGS* signal is set to ACK(1) when receiving RI\_RP=1 and RI\_CTRL=ADD(01). -- The *TS switch processing* is activated when receiving RI\_RP=1 and RI\_CTRL=ADD(01) and RI\_TSGS=ACK(1). -- The *TS adjustment completion* process is activated when receiving RI\_RP=1 and RI\_CTRL=NORM(11) and RI\_TSGS=ACK(1). -- The *TSCC relay indication* signal is generated and sent to the BWR\_RELAY\_generator process when receiving RI\_RP=1 and RI\_CTRL=IDLE(00) and RI\_TSGS=NACK(0). - -Decrease case: - -- The *TSCC relay indication* signal is generated and sent to the BWR\_RELAY\_generator process and the LCR protocol is put on hold when receiving RI\_RP=1 and RI\_CTRL=REMOVE(10). -- The *TSGS* signal is set to ACK(1) when the *LCR reactive indication* signal is valid. -- The *TS switch processing* process is activated when receiving RI\_RP=1 and RI\_CTRL=NORM(11) and RI\_TSGS=ACK(1). -- The *TS adjustment completion* process is activated when receiving RI\_RP=1 and RI\_CTRL=NORM(11) and RI\_TSGS=ACK(1). -- The *TS adjustment completion indication* signal is generated and sent to the BWR\_Generator\_Relay process when receiving RI\_RP=1 and RI\_CTRL=IDLE(00) and RI\_TSGS=NACK(0). - -**Table 14-36 – Significance of the control fields during RI processing** - -| RI_RP | RI_TSGS | RI_CTRL | INCREASE | DECREASE | -|-------|---------|---------|-------------------------------------------|-------------------------------------------------------------| -| 0 | 0 | 00 | | | -| 0 | 0 | 01 | | | -| 0 | 0 | 10 | | | -| 0 | 0 | 11 | | | -| 0 | 1 | 00 | | | -| 0 | 1 | 01 | | | -| 0 | 1 | 10 | | | -| 0 | 1 | 11 | | | -| 1 | 0 | 00 | TSCC relay indication | TS adjustment completion indication | -| 1 | 0 | 01 | TSGS = ACK | | -| 1 | 0 | 10 | | TSCC relay indication | -| 1 | 0 | 11 | | | -| 1 | 1 | 00 | | | -| 1 | 1 | 01 | TSGS = ACK
TS switch processing | | -| 1 | 1 | 10 | | TSCC relay indication
TS switch processing | -| 1 | 1 | 11 | TS adjustment completion | TS adjustment completion | - -Output adjustment state signal (*MI\_ADJSTATE*). - -*TS switch processing:* - -- The *CTRL* signal is set to NORM(11) and the *TSGS* signal is set to ACK(1) when MFAS is 0 (k = 2, 3) or MFAS and OMFI are both 0 (k = 4). -- The *mapping granularity switch indication* (MGSI) signal is generated and sent towards the mapping process. -- The related MSI overhead bytes are to be updated according to the renewed TS information at the resize multiframe boundary (see [ITU-T G.7044] clauses 7.1.2 and 7.2.2). - -**Table 14-37 – Significance of the control fields during TS switch processing** - -| TS adjustment completion | TS switch | RMF boundary | CTRL | TSGS | MGSI | -|--------------------------|-----------|--------------|------|------|------| -| 0 | 0 | 0 | | | | -| 0 | 0 | 1 | | | | -| 0 | 1 | 0 | FFS | FFS | 1 | -| 0 | 1 | 1 | 11 | ACK | 1 | -| 1 | 0 | 0 | FFS | FFS | | -| 1 | 0 | 1 | 00 | NACK | | -| 1 | 1 | 0 | N/A | N/A | 1 | -| 1 | 1 | 1 | N/A | N/A | 1 | - -*TS adjustment completion processing:* The *CTRL* signal is set to IDLE and the *TSGS* signal is set to NACK(0) when MFAS is 0 (k = 2, 3) or OMFI and MFAS are both 0 (k = 4). - -**BWR Generator Relay process:** This process forwards the RP signal and TSCC signal of the BWR protocol, determines the status of GMP mode and triggers the resize ramp follow mode according to the transition of the BWR\_IND bit to prevent buffer overflow or underflow in the downstream nodes. - -*xI process (x=C or M):* This process detects the input xI\_RP and xI\_TSCC from BWR\_Generator or BWR\_RELAY\_receiver. - -- In the decrease case, the *LCR reactive indication* signal is set to TRUE when xI\_RP=1 and the value of xI\_TSCC changes from 1 to 0 and the GMP source is in normal mode. -- In the increase case, this process is not deployed. - -*GMP mode process:* The *GMP MODE* signal is set to "special mode" when the *TSCC relay indication* signal is true. The *GMP MODE* signal is set to "normal mode" when the value of the xI\_TSCC signal changes from 1 to 0. - -*TSCC relay process:* The value of the xI\_TSCC signal is passed through to the *TSCC signal* when TSCC relay indication signal has the value True and the GMP MODE is set to special mode; otherwise TSCC is 0. - -*RP relay process:* When MI\_INCREASE or MI\_DECREASE is true, the RP signal is set to 1. The value of xI\_RP is passed through to the RP signal (RP = xI\_RP) when TS adjustment completion indication is true; otherwise RP = 1. - -*Ramp Follow process:* This process detects the BWR\_IND signal from OPUflex RCOH monitor. Once the process detects the transition of BWR\_IND signal from "0" to "1", the ODUflex source shall start ramp follow mode. When the process detects the transition of BWR\_IND signal from "1" to "0", the ODUflex source shall stop ramp follow mode as defined in clauses 7.1.1 and 7.2.1 of [ITU-T G.7044]. The CK\_control signal is generated and sent to Justification control and JC generation process to control the ODUflex mapping clock. - -**RES:** The function shall insert all-ZEROs into the RES bytes. - -**ODUk PM APS:** The function shall insert the PI\_APS value into the ODUk Path APS/PCC field, which is available once per eight ODUk frames when MFAS bits 6,7,8 are 000. - -All other bits of the ODUk overhead should be sourced as "0"s, except the PMOH STAT field which should be set to the value "normal path signal" (001). - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -#### **14.3.13.2 HAO-capable ODUkP to ODUj payload type 21 adaptation sink function (HAO-capable ODUkP-h/ODUj-21\_A\_Sk)** - -The HAO-capable ODUkP-h/ODUj-21\_A\_Sk function extracts the OPUk overhead (PT, MSI, RES and OMFI) and monitors the reception of the correct payload type. It demultiplexes the individual ODTUjk and ODTUk.M from the payload area of the OPUk and recovers the $n \times$ ODUj signals using the justification control information (JC, JC1/2/3/4/5/6 overhead). It determines the frame and multiframe structure of the ODUj. It provides access to ODUk PM APS Overhead. It provides access to ODUj APS overhead. - -The information flow and processing of the HAO-capable ODUkP-h/ODUj-21\_A\_Sk function is defined with reference to Figures 14-80, 14-81 and 14-82. - -## Symbol - -![Diagram of the HAO-capable ODUkP-h/ODUj-21_A_Sk function symbol. The symbol is a trapezoid labeled 'ODUkP-h/ODUj-21'. Inputs include 'ODUkP_PP' from the left, 'ODUkP-h/ODUj-21_A_Sk_MP' from the left, and 'ODUkP_AP' from the bottom. Outputs include 'ODUkP-h/ODUj-21_A_Sk_RP' to the right and 'Tributary port' outputs labeled 1, 2, ..., n, collectively labeled 'ODUj_CPs'.](3440b6ff4ee9fed9b432fee67868ae8e_img.jpg) - -Diagram of the HAO-capable ODUkP-h/ODUj-21\_A\_Sk function symbol. The symbol is a trapezoid labeled 'ODUkP-h/ODUj-21'. Inputs include 'ODUkP\_PP' from the left, 'ODUkP-h/ODUj-21\_A\_Sk\_MP' from the left, and 'ODUkP\_AP' from the bottom. Outputs include 'ODUkP-h/ODUj-21\_A\_Sk\_RP' to the right and 'Tributary port' outputs labeled 1, 2, ..., n, collectively labeled 'ODUj\_CPs'. - -Figure 14-80 – HAO-capable ODUkP-h/ODUj-21\_A\_Sk function - -## Interfaces - -Table 14-38 – ODUkP-h/ODUj-21\_A\_Sk inputs and outputs - -| Input(s) | Output(s) | -|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| ODUkP_AP:
ODUkP_AI_CK
ODUkP_AI_D
ODUkP_AI_FS
ODUkP_AI_MFS
ODUkP_AI_TSF
ODUkP_AI_TSD
ODUkP-h/ODUj-21_A_Sk_MP:
ODUkP-h/ODUj-21_A_Sk_MI_ExMSI[1..n]
ODUkP-h/ODUj-21_A_Sk_MI_AdminState[1..n]
ODUkP-h/ODUj-21_A_Sk_MI_APS_EN[1..n]
ODUkP-h/ODUj-21_A_Sk_MI_APS_LVL[1..n]
ODUkP-h/ODUj-21_A_Sk_MI_Nominal_Bitrate_and_Tolerance[1..n]
ODUkP-h/ODUj-21_A_Sk_MI_ODUType[1..n]
ODUkP-h/ODUj-21_A_Sk_MI_INCREASE
ODUkP-h/ODUj-21_A_Sk_MI_DECREASE
ODUkP-h/ODUj-21_A_Sk_MI_TSMAP
ODUkP-h/ODUj-21_A_Sk_MI_TPID
ODUkP-h/ODUj-21_A_Sk_RP:
ODUkP-h/ODUj-21_A_Sk_RI_TrPT (Note) | n × ODUj_CP:
ODUj_CI_CK
ODUj_CI_D
ODUj_CI_FS
ODUj_CI_MFS
ODUj_CI_SSF
ODUj_CI_SSD
ODUj_CI_APS
ODUj-21_(C/M)I_RP
ODUj-21_(C/M)I_TSCC
ODUk_PP:
ODUk_PI_APS
ODUk_PI_TSF
ODUk_PI_TSD
ODUkP-h/ODUj-21_A_Sk_MP:
ODUkP-h/ODUj-21_A_Sk_MI_cPLM
ODUkP-h/ODUj-21_A_Sk_MI_cLOOMFI
ODUkP-h/ODUj-21_A_Sk_MI_cMSIM[1..n]
ODUkP-h/ODUj-21_A_Sk_MI_AcPT
ODUkP-h/ODUj-21_A_Sk_MI_AcMSI[1..n]
ODUkP-h/ODUj-21_A_Sk_MI_cLOFLOM[1..n]
ODUkP-h/ODUj-21_A_Sk_MI_cRCOHM
ODUkP-h/ODUj-21_A_Sk_RP:
ODUkP-h/ODUj-21_A_Sk_RI_AcPT (Note)
ODUkP-h/ODUj-21_A_Sk_RI_RP
ODUkP-h/ODUj-21_A_Sk_RI_CTRL
ODUkP-h/ODUj-21_A_Sk_RI_TSGS
ODUkP-h/ODUj-21_A_Sk_RI_TPID | - -NOTE – For ODU2P-h/ODUj-21\_A\_Sk and ODU3P-h/ODUj-21\_A\_Sk only. - -## Processes - -The processes associated with the HAO-capable ODUkP-h/ODUj-21\_A\_Sk function are specific processes for each ODUj\_CP and common processes for the compound (multiplexed) signal as depicted in Figures 14-81 and 14-82. - -![Figure 14-81 – ODUkP-h/ODUj-21_A_Sk processes. This functional block diagram shows the internal architecture of the ODUkP-h/ODUj-21_A_Sk sink function. At the top, multiple ODUj_CP[1] to ODUj_CP[n] interfaces receive signals like CI_MFS, CI_FS, CI_CK, CI_D, CI_APS, CI_SSF, and CI_SSD. These feed into 'Client specific processes' blocks which interact with a 'Demultiplexer'. The demultiplexer handles signals like OMFS, MFS, FS, CK, D, TS#, and Active. Below the demultiplexer, there are blocks for 'Extract MSI' and 'Extract PT' feeding into 'MSI process' blocks. There is also an 'ODUk PM APS' block. For specific values of k (4, 25(u), 50(u)), there is an 'Extract OMFI' and 'OMFI process' loop. A 'Defect correlations' block monitors signals like dRCOHM, dPLM, dLOOMFI, and AI_TSF. A 'HAO process (if needed)' block handles hitless adjustment of ODUflex. An 'RCOH monitor' block is shown at the bottom left. Various MI (Management Information) and RI (Remote Information) signals are shown on the right side, including MI_cMSIM, MI_AdminState, RI_RP, RI_CTRL, etc. The bottom of the diagram shows the ODUkP_AP interface with signals AI_MFS, AI_FS, AI_CK, AI_D, AI_TSF, and AI_TSD.](87f2c7d96e398885a4108ecbf1aa9499_img.jpg) - -G.798(17)-Amd.3(21)\_F14-81 - -Figure 14-81 – ODUkP-h/ODUj-21\_A\_Sk processes. This functional block diagram shows the internal architecture of the ODUkP-h/ODUj-21\_A\_Sk sink function. At the top, multiple ODUj\_CP[1] to ODUj\_CP[n] interfaces receive signals like CI\_MFS, CI\_FS, CI\_CK, CI\_D, CI\_APS, CI\_SSF, and CI\_SSD. These feed into 'Client specific processes' blocks which interact with a 'Demultiplexer'. The demultiplexer handles signals like OMFS, MFS, FS, CK, D, TS#, and Active. Below the demultiplexer, there are blocks for 'Extract MSI' and 'Extract PT' feeding into 'MSI process' blocks. There is also an 'ODUk PM APS' block. For specific values of k (4, 25(u), 50(u)), there is an 'Extract OMFI' and 'OMFI process' loop. A 'Defect correlations' block monitors signals like dRCOHM, dPLM, dLOOMFI, and AI\_TSF. A 'HAO process (if needed)' block handles hitless adjustment of ODUflex. An 'RCOH monitor' block is shown at the bottom left. Various MI (Management Information) and RI (Remote Information) signals are shown on the right side, including MI\_cMSIM, MI\_AdminState, RI\_RP, RI\_CTRL, etc. The bottom of the diagram shows the ODUkP\_AP interface with signals AI\_MFS, AI\_FS, AI\_CK, AI\_D, AI\_TSF, and AI\_TSD. - -Figure 14-81 – ODUkP-h/ODUj-21\_A\_Sk processes - -![Block diagram of ODUj_CP[p] client specific processes. The diagram shows the internal structure of an ODUj client, including OPUflex RCOH monitor, Select normal/AIS/LCK, Generate AIS/LCK, ODUj APS, Frame/multi-frame alignment, Elastic store, Clock generation (ODCp), Justification control, Extract JC, and Defect correlation. It also shows various input and output signals like OMFI, MFAS, FS, CK, D, TS#, Active, CL_MFS, CL_FS, CL_CK, CL_D, CL_APS, CL_SSF, CL_SSD, BWR_IND, MI_AdminState[p], AI_TSD, AI_TSF, MI_APS_EN[p], MI_APS_LVL[p], dPLM, dLOOMFI, dMSIM[p], MI_cMSIM[p], MI_cLOFLOM[p], DMGSI, GMP_MODE, CK_Control, MI_Nominal_Bitrate_and_Tolerance[p], and MI_ODUType[p].](b35608e925cb6a7c0aa0db30d2db9d66_img.jpg) - -The diagram illustrates the internal processes of an ODUj client, labeled as ODUj\_CP[p]. At the top, a bracket groups several output signals: CL\_MFS, CL\_FS, CL\_CK, CL\_D, CL\_APS, CL\_SSF, and CL\_SSD. Below this, the diagram is divided into several functional blocks. On the left, an 'OPUflex RCOH monitor' block receives inputs from the top signals and outputs 'BWR\_IND'. Below it, a 'Select normal/AIS/LCK' block contains sub-blocks 'Normal', 'AIS', and 'LCK', which receive inputs from 'Generate AIS' and 'Generate LCK' blocks. These generation blocks are influenced by 'MI\_Nominal\_Bitrate\_and\_Tolerance[p]'. The 'Select normal/AIS/LCK' block outputs 'MI\_AdminState[p]'. In the center, an 'ODUj APS' block receives inputs from 'MI\_APS\_EN[p]' and 'MI\_APS\_LVL[p]'. Below the APS block, a 'Frame/multi-frame alignment' block receives 'MFAS', 'FS', 'CK', and 'D' inputs and outputs 'D' and 'CK' signals. These signals go to an 'Elastic store' block, which has 'RD' (Read) and 'WR' (Write) ports. The 'Elastic store' is connected to a 'Clock generation (ODCp)' block. The 'Clock generation' block outputs 'dLOFLOM' and 'AI\_TSF' signals. Below the clock generation, there are 'Justification control' and 'Extract JC' blocks, which receive inputs from 'MI\_Nominal\_Bitrate\_and\_Tolerance[p]' and 'MI\_ODUType[p]'. On the right, a 'Defect correlation' block receives inputs from 'dLOFLOM', 'dPLM', 'dLOOMFI', 'dMSIM[p]', 'MI\_cMSIM[p]', 'MI\_cLOFLOM[p]', 'DMGSI', 'GMP\_MODE', and 'CK\_Control'. It outputs 'aAIS', 'aSSF', and 'aSSD' signals to a 'Consequent actions' block, which in turn outputs 'AI\_TSD' and 'AI\_TSF' signals. At the bottom, input signals include OMFI, MFAS, FS, CK, D, TS#, and Active. A reference label 'G.798(17)-Amd.3(21)\_F14-82' is present at the bottom right of the diagram area. - -Block diagram of ODUj\_CP[p] client specific processes. The diagram shows the internal structure of an ODUj client, including OPUflex RCOH monitor, Select normal/AIS/LCK, Generate AIS/LCK, ODUj APS, Frame/multi-frame alignment, Elastic store, Clock generation (ODCp), Justification control, Extract JC, and Defect correlation. It also shows various input and output signals like OMFI, MFAS, FS, CK, D, TS#, Active, CL\_MFS, CL\_FS, CL\_CK, CL\_D, CL\_APS, CL\_SSF, CL\_SSD, BWR\_IND, MI\_AdminState[p], AI\_TSD, AI\_TSF, MI\_APS\_EN[p], MI\_APS\_LVL[p], dPLM, dLOOMFI, dMSIM[p], MI\_cMSIM[p], MI\_cLOFLOM[p], DMGSI, GMP\_MODE, CK\_Control, MI\_Nominal\_Bitrate\_and\_Tolerance[p], and MI\_ODUType[p]. - -Figure 14-82 – ODUkP-h/ODUj-21\_A\_Sk client specific processes - -### Common processes - -**OPU multiframe (OMFI) reception for OPUk with k=4, 25(u), 50(u):** For k = 4, 25(u), 50(u) in addition to MFAS, a dedicated OPU multiframe indicator is used for the multiplexing of LO ODUs into the OPU payload area. This multiframe structure is locked to the lsb bits of the OMFI byte as shown in Tables 19-4, 19-5 and 19-6 of [ITU-T G.709]. The function shall detect an OPU multiframe by searching for the framing pattern in the bits indicated above. The process has two states, out-of-multiframe (OOM) and in-multiframe (IM). The IM state shall be entered if this set is found and confirmed one frame period later and an error-free multiframe sequence is found in the byte positions of the two frames. In the IM state, the frame alignment signal shall be continuously checked with the presumed OMFI frame start position and the expected multiframe sequence. The OOM state shall be entered if this subset is not found at the correct position in five consecutive frames or the received OMFI does not match with the expected multiframe number in five consecutive frames. The OPU4 - -multiframe start (OMFS) shall be maintained during the OOM state of the OMFI detection process. The defect dLOOMFI shall be generated based on the state of the OMFI alignment process. If the OMFI alignment process is persistently in the out-of-multiframe (OOM) state for 3 ms, dLOOMFI shall be declared. dLOOMFI shall be cleared immediately when the OMFI alignment process is in the in-multiframe (IM) state. - -**PT:** The function shall extract the PT byte from the PSI overhead as defined in clause 8.7.1.1. The accepted PT value is available at the MP (MI\_AcPT) and is used for PLM defect detection. - -**Autonomous payload type for k = 2, 3:** The accepted PT is provisioned to the RP (RI\_AcPT) for automatic PT adaptation. The PLM detection shall be based on the comparison of the accepted PT with the provided PT on the RP at the RI\_TrPT input. - -**MSI:** The function shall extract the MSI from the PSI overhead as defined in clause 8.7.2.1. The accepted MSI for a tributary signal #p (AcMSI[p]) is available at the MP (MI\_AcMSI[p]). The multiplex structure is defined by ExMSI[p], which is either fixed or is configurable via MI\_ExMSI[p]. During the HAO process, ExMSI[p] updates should be configured at the resizing multiframe boundary with signals [NORM, (TPID#), ACK]. - -**RES:** The value in the RES bytes shall be ignored. - -**ODUk PM APS:** The function shall extract the information from the ODUk path APS/PCC field, which is available once per eight ODUk frames when MFAS bits 6,7,8 are 000 and apply this to the PI\_APS. - -**Demultiplexing:** The function activates the ODTUjk or ODTUk.M and assigns the time slots of the ODUk payload area to the individual ODTUjk or ODTUk.M, as defined by the multiplex structure (see clauses 19.3 and 19.4.1 of [ITU-T G.709]) and clauses 7.1 and 7.2 of [ITU-T G.7044]). - -### Specific processes - -The specific processes are performed independently for each ODUj client signal that is multiplexed into the OPUk. The specific processes recover the ODUj from the ODTUjk or ODTUk.M. - -Two justification methods as described below are provided, AMP (*ODTUjk*) and GMP (*ODTUk.M*). The ODU type, as configured via the MI\_ODUType [p]input for tributary port #p, determines the mapping method. In the case of GMP mapping, the ODU rate, as configured via the MI\_Nominal\_Bitrate\_and\_Tolerance[p] input for tributary port #p, determines the base value and ranges for the parameters $C_n$ and $C_m$ . - -**ODTUjk JC:** The function shall interpret the justification control information in bits 7 and 8 of the JC bytes as defined in clause 19.5 of [ITU-T G.709], in order to determine the justification action (double positive, positive, negative, none) for the current frame. A two out of three majority decision is used. RES bits in the JC bytes shall be ignored. The ODUk frame that contains the JC bytes depends on the time slot(s) of the ODTUjk. - -**ODTUk.ts JC1/2/3 and JC4/5/6:** The function shall interpret the GMP overhead information in the JC1/2/3 and JC4/5/6 bytes as defined in clause 19.6 of [ITU-T G.709] and in clauses 7.1.2 and 7.2.2 of [ITU-T G.7044], in order to determine the number of M-byte ODUj entities in the next ODTUk.M multiframe. The OPUk frame that contains the JC1/2/3 and JC4/5/6 bytes depends on the last tributary slot that is occupied by the ODTUk.M. - -**Demapping, CBR clock generation:** The function shall provide an elastic store (buffer) process. - -*ODTUjk:* The ODUj data shall be written into the buffer from the D, NJO, PJO1 and PJO2 bytes in the ODTUjk frame. The information extraction of the PJO2, PJO1 and NJO bytes shall be under the control of the justification control information. - -Upon a double positive justification action, the writing of two data bytes into the buffer shall be cancelled once. No ODUj data shall be read from the PJO2, PJO1 or NJO bytes. Upon a positive - -justification action, the writing of one data byte into the buffer shall be cancelled once. No ODUj data shall be read from the PJO1 or NJO bytes and data shall be read from the PJO2 byte. Upon a negative justification action, one extra data byte shall be written into the buffer once. ODUj data shall be read from the PJO2, PJO1 and NJO bytes. If no justification action is to be performed, ODUj data shall be read from the PJO2 and PJO1 bytes and no ODUj data shall be read from the NJO bytes. The OPUk frame that contains the PJO2, PJO1 and NJO bytes depends on the tributary slots occupied by the ODTUjk. - -*ODTUk.M:* The ODUj data shall be extracted from the groups of M successive bytes of the ODTUk.M payload area under the control of the GMP data/stuff control mechanism as defined in clause 19.6 of [ITU-T G.709] and clauses 7.1 and 7.2 [ITU-T G.7044] and be written into the buffer. The $C_n$ information associated with the ODUj is computed from the GMP $C_m$ and $\sum C_{nD}$ parameters carried within the JC1/2/3 and JC 4/5/6 overhead of the ODTUk.M, as specified in clause 19.6 of [ITU-T G.709]. For the GMP data/stuff control mechanism refer to Annex D of [ITU-T G.709]. - -The ODUj data (CI\_D) shall be read out of the buffer under the control of the ODUj clock (CI\_CK). - -*Smoothing and jitter limiting process:* The function shall provide for a clock smoothing and elastic store (buffer) process. The ODUj data signal shall be written into the buffer under the control of the associated (gapped) OPUk input clock (with a frequency accuracy within $\pm 20$ ppm). The data signal shall be read out of the buffer under the control of a smoothed (equally spaced) ODUj clock (the rate is determined by the ODUj signal at the input of the remote ODUkP-h/ODUj-21\_A\_So). - -The clock parameters, including jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCp clock) apply. - -*Buffer size:* In the presence of jitter as specified by [ITU-T G.8251] and a frequency within the tolerance range specified for the ODUj signal in Table 7-2 of [ITU-T G.709], this justification process shall not introduce any errors. - -Following a step in frequency of the ODUj signal transported (for example, due to receiving ODUj\_CI from a new ODUj\_TT\_So at the far end or removal of an ODU-AIS signal with a frequency offset), there will be a maximum recovery time of X seconds after which this process shall not generate any bit errors. The value of X is for further study; a value of one second has been proposed. - -**RCOH receiver:** When MI\_INCREASE or MI\_DECREASE is true, this process extracts RP, TSCC, CTRL, TPID and TSGS signals from the RCOH overhead for the set of M tributary slots configured via MI\_TSMAP. The values of the RCOH fields for each of the TS in TSMAP are compared. If the values are the same and the received TPID value matches the MI\_TPID, those values are forwarded to the HAO process. If the values are not the same, a RCOH mismatch defect (dRCOHM) is detected. When MI\_INCREASE or MI\_DECREASE is false, this process is disabled and RP, TSCC, CTRL, TPID and TSGS signals are all set to 0. - -**OPUflex RCOH Receiver:** This function shall monitor the OPUflex RCOH overhead and extract the BWR\_IND signal as defined in clause 6.2.7 of [ITU-T G.7044]. - -**Frame and multiframe alignment:** The function shall perform frame and multiframe alignment as described in clause 8.2.3. - -**ODU-LCK, ODU-AIS:** The function shall generate the ODU-LCK and ODU-AIS signals as defined in [ITU-T G.709]. The clock, frame start and multiframe start shall be independent from the incoming clock. The clock has to be within the ODUj frequency tolerance range as specified in Table 7-2 of [ITU-T G.709] provisioned by the MI\_Nominal\_Bitrate\_and\_Tolerance[n] from a free-running oscillator. Jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCa clock) apply. - -**Selector:** The normal signal for a tributary signal #p may be replaced by either the ODU-AIS or ODU-LCK signal. ODU-LCK is selected if the corresponding MI\_AdminState[p] signal is LOCKED. ODU-AIS is selected if the corresponding MI\_AdminState[p] signal is not LOCKED and aAIS is true. - -**ODUj server layer APS:** When APS is enabled for tributary signal #p (MI APS\_EN[p] is true), the function shall extract the information from the ODU APS/PCC[MI APS\_LVL[p]] field, which is available once per eight ODU frames when the value of the MFAS bits 6, 7, 8 is equal to MI APS\_LVL[p], and apply the extracted information to the CI APS. - -NOTE – The ODUj server layer section APS information may be present in the case where the ODUk signal contains an ODU-AIS, ODU-LCK or ODU-OCI maintenance signal. The ODU-LCK maintenance signal may have been inserted in the far-end adaptation source function. ODUj SNC/I protection is unable to detect the insertion of such ODU-LCK and will not perform a protection switch. - -## HAO processes - -The HAO process includes the LCR\_Receiver and BWR\_RELAY\_Receiver processes. - -![Figure 14-83 – LCR_Receiver and BWR_Receiver_Relay processes. This block diagram shows the internal structure of the HAO process. It is divided into two main sub-processes: LCR_receiver and BWR_RELAY_receiver. The LCR_receiver contains 'LCR OH detecting processing' and 'TS switch processing'. Inputs to the LCR_receiver include MI_INCREASE, MI_DECREASE, MI_TSMAP, MI_TPID, CK, FS, MFS, OPU4 MFS, TPID, TSGS, CTRL, and RP. Outputs from the LCR_receiver include RI_RP, RI_CTRL, RI_TSGS, RI_TPID, and DMGSI. The BWR_RELAY_receiver contains 'Ramp follow process', 'GMP mode process', 'RP forwarding processing', and 'TSCC forwarding processing'. Inputs to the BWR_RELAY_receiver include CK_Control, BWR_IND, (C/M)_RP, and TSCC. Outputs from the BWR_RELAY_receiver include GMP_MODE. The entire HAO process is shown within a larger system context.](f92133ff7727978a12d89b8426245b85_img.jpg) - -Figure 14-83 – LCR\_Receiver and BWR\_Receiver\_Relay processes. This block diagram shows the internal structure of the HAO process. It is divided into two main sub-processes: LCR\_receiver and BWR\_RELAY\_receiver. The LCR\_receiver contains 'LCR OH detecting processing' and 'TS switch processing'. Inputs to the LCR\_receiver include MI\_INCREASE, MI\_DECREASE, MI\_TSMAP, MI\_TPID, CK, FS, MFS, OPU4 MFS, TPID, TSGS, CTRL, and RP. Outputs from the LCR\_receiver include RI\_RP, RI\_CTRL, RI\_TSGS, RI\_TPID, and DMGSI. The BWR\_RELAY\_receiver contains 'Ramp follow process', 'GMP mode process', 'RP forwarding processing', and 'TSCC forwarding processing'. Inputs to the BWR\_RELAY\_receiver include CK\_Control, BWR\_IND, (C/M)\_RP, and TSCC. Outputs from the BWR\_RELAY\_receiver include GMP\_MODE. The entire HAO process is shown within a larger system context. - -Figure 14-83 – LCR\_Receiver and BWR\_Receiver\_Relay processes - -**LCR\_Receiver:** This process completes the receiving LCR protocol. It contains the following sub-processes: - -*LCR OH detecting processing:* When MI\_INCREASE or MI\_DECREASE is true, the LCR protocol would be activated and RCOH information (RP, CTRL, TPID, TSGS) would be detected. This information is then sent to LCR\_Generator. - -*TS switch processing:* When CTRL is detected as NORM, the *demapping granularity switch indication* (DMGSI) signal would be generated towards the demapping processing. - -**BWR\_Receiver\_Relay:** This process forwards the RP signal and TSCC signal of the BWR protocol, determines the status of GMP mode and triggers the resize ramp follow mode according to the transition of the BWR\_IND bit to prevent buffer overflow or underflow in the downstream nodes. It contains the following sub-processes: - -*GMP mode process:* Change of TSCC from 0 to 1 is used to trigger the GMP process into special mode. Change of TSCC from 1 to 0 is used to trigger the GMP process into normal mode. - -*TSCC forwarding process:* This passes through TSCC=1 when the *GMP process is set into special mode*, that is (C/M)I\_TSCC=TSCC(1). This passes through TSCC=0 when *GMP has also been set into normal mode*, that is (C/M)I\_TSCC=TSCC(0). The initial value of CI\_TSCC is 0. - -*RP forwarding process:* RP is passed through to either a BWR\_RELAY\_Generator process or a BWR\_Receiver process ((C/M)I\_RP=RP). - -*Ramp follow process:* This process detects the BWR\_IND signal from the OPUflex RCOH monitor. Once the process detects the transition of the BWR\_IND signal from "0" to "1", the ODUflex source shall start the ramp follow mode. When the process detects the transition of the BWR\_IND signal from "1" to "0", the ODUflex source shall stop the ramp follow mode, as defined in clauses 7.1.1 and 7.2.1 of [ITU-T G.7044]. The CK\_control signal is generated and sent to the clock generator process to control the ODUflex demapping clock. - -## Defects - -The function shall detect dPLM, dMSIM, dLOOMFI and dLOFLOM. - -**dPLM:** See clause 6.2.4.1. The expected payload type is the provided PT on the RP at the RI\_TrPT input (ODU multiplex structure supporting ODTUk.ts or ODTUk.ts and ODTUjk) as defined in [ITU-T G.709]. - -**dLOOMFI:** dLOOMFI is detected per OPUk with k = 4, 25(u), 50(u). See the OPU multiframe (OMFI) detection process for OPUk with k = 4, 25(u), 50(u). - -**dRCOHM:** RCOH mismatch defect. The values of the RCOH fields for each of the TS in TSMAP are compared. If the values are not the same, a RCOH mismatch defect (dRCOHM) is raised. If the values are the same and the received TPID value matches the MI\_TPID, those values are forwarded to the HAO process and the dRCOHM is cleared. - -For each ODUj tributary port #p: - -**dMSIM[p]:** See clause 6.2.9.1. dMSIM[p] is detected per active ODUj. During the HAO process, the detection of dMSIM[p] is disabled at the next resize multiframe boundary after receiving RP = 1, as defined in clause 6.2.6 of [ITU-T G.7044]. The detection of dMSIM[p] is enabled at the next resize multiframe boundary after receiving RP=0, as defined in clause 6.2.6 of [ITU-T G.7044]. - -**dLOFLOM[p]:** See clause 6.2.5.3. dLOFLOM is detected per active ODUj. - -## Consequent actions - -PI\_TSF $\leftarrow$ AI\_TSF - -PI\_TSD $\leftarrow$ AI\_TSD - -For each ODUj tributary port #p: - -aSSF[p] $\leftarrow$ ((AI\_TSF or dPLM or dLOOMFI or dMSIM[p] or dLOFLOM[p]) and (not MI\_AdminState[p]=LOCKED)) - -aSSD[p] $\leftarrow$ AI\_TSD and (not MI\_AdminState[p] = LOCKED) - -aAIS[p] $\leftarrow$ ((AI\_TSF or dPLM or dMSIM[p] or dLOOMFI or dLOFLOM[p]) and (not MI\_AdminState[p] = LOCKED)) - -NOTE – The state of the determination process of the Cm and its contribution to AIS consequent action are for further study. - -On declaration of aAIS, the function shall output an all-ONEs pattern/signal within 2 frames. On clearing aAIS, the all-ONEs pattern/signal shall be removed within 2 frames, with normal data being output. The AIS clock, frame start and multiframe start shall be independent from the incoming clock, frame start and multiframe start. The clock has to be within the ODUj frequency tolerance range as specified in Table 7-2 of [ITU-T G.709] provisioned by the MI\_Nominal\_Bitrate\_and\_Tolerance - -from a free-running oscillator. Jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCa clock) apply. - -#### Defect correlations - -cPLM $\leftarrow$ dPLM and (not AI\_TSF) - -cRCOHM $\leftarrow$ dRCOHM and (not AI\_TSF) - -For ODUk with k=4, 25(u), 50(u) - -cLOOMFI $\leftarrow$ dLOOMFI and (not AI\_TSF) - -For each ODUj tributary port #p: - -cMSIM[p] $\leftarrow$ dMSIM[p] and (not dPLM) and (not dLOOMFI) and (not AI\_TSF) - -cLOFLOM[p] $\leftarrow$ dLOFLOM[p] and (not dPLM) and (not dLOOMFI) and (not AI\_TSF) - -**Performance monitoring:** None. - -#### 14.3.14 HAO capable ODUk to MPLS-TP Adaptation functions (ODUkP-h/MT\_A; k=ODUflex) - -See [ITU-T G.8121] for this adaptation function. - -#### 14.3.15 ODU2eP to FC-1200 client adaptation function (ODU2eP/FC-1200\_A) - -The ODU2eP to FC-1200 adaptation functions perform the adaptation between the ODU2eP layer adapted information and the characteristic information of a FC-1200 signal. As described in clause 17.8.2 of [ITU-T G.709], a timing transparent adaptation with compression factor 50/51 is used to produce a signal with a rate of approximately 10 312 500 kbit/s that is mapped into the OPU2e. - -##### 14.3.15.1 ODU2eP to FC-1200 client adaptation source function (ODU2eP/FC-1200\_A\_So) - -The ODU2eP/FC-1200\_A\_So function creates the ODU2e signal from a clock, derived from the incoming FC-1200\_CI clock. It byte synchronously maps the transcoded constant bit-rate client signal from the FC-1200\_CP into the payload area of the OPU2e as defined in clause 17.8.2 of [ITU-T G.709], and adds OPU2e overhead (RES, PT) and default ODU2e overhead. - -The information flow of the ODU2eP/FC-1200\_A\_So function is defined with reference to Figure 14-84 and the processing of the ODU2eP/FC-1200\_A\_So function is defined with reference to Figure 14-85. - -#### Symbol - -![Diagram of the ODU2eP/FC-1200_A_So function symbol. It shows an input 'FC-1200_CP' entering a trapezoidal block labeled 'ODU2eP/FC-1200', which then outputs 'ODU2eP_AP'.](18e10a200cbafecb4114d25fa128b703_img.jpg) - -``` -graph TD; A[FC-1200_CP] --> B[ODU2eP/FC-1200]; B --> C[ODU2eP_AP]; -``` - -G.798(17)\_F14-84 - -Diagram of the ODU2eP/FC-1200\_A\_So function symbol. It shows an input 'FC-1200\_CP' entering a trapezoidal block labeled 'ODU2eP/FC-1200', which then outputs 'ODU2eP\_AP'. - -**Figure 14-84 – ODU2eP/FC-1200\_A\_So function** - -## Interfaces - -**Table 14-39 – ODU2eP/FC-1200\_A\_So inputs and outputs** - -| Input(s) | Output(s) | -|-----------------------------------------------------------------------|-----------------------------------------------------------------------------------| -| FC-1200_CP:
FC-1200_CI_CK
FC-1200_CI_D
FC-1200_CI_SSF | ODU2eP_AP:
ODU2eP_AI_CK
ODU2eP_AI_D
ODU2eP_AI_FS
ODU2eP_AI_MFS | - -## Processes - -**Clock and (multi)frame start signal generation:** The function shall generate a local ODU2e clock (ODU2eP\_AI\_CK) by multiplying the incoming FC-1200 clock (CI\_CK) by a factor of $239/237 \times 50/51$ . The clock parameters, including jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCb clock), apply. - -During failure conditions of the incoming CBR clock signal (CI\_CK), the ODU2e clock shall stay within its limits as defined in [ITU-T G.8251] and no frame phase discontinuity shall be introduced. - -The function shall generate the (multi)frame start reference signals AI\_FS and AI\_MFS for the ODU2e signal. The AI\_FS signal shall be active once per 122 368 clock cycles. AI\_MFS shall be active once every 256 frames. - -**Timing transparent transcoding:** The function shall compress the FC-1200 signal by a factor 50/51 through timing transparent transcoding. The result is a stream of equal length GFP data frames without GFP idle frames. - -**66B block synchronization:** The function shall recover 66B block synchronization. - -**66B to 513B transcoding:** The function shall transcode the 66B symbols to 513B symbols as specified in Annex B of [ITU-T G.709]. - -**Superblock construction and CRC-24 generation:** The process constructs a superblock from eight received 513B data words as defined in clause 17.8.2 of [ITU-T G.709]. A CRC-24 is calculated over the 65 bytes of "control" information located in the superblock and inserted at the end of the superblock as defined in clause 17.8.2 of [ITU-T G.709]. - -**Superblock mapping:** Seventeen superblocks are grouped together and prepended with 16 bytes of fixed stuff bytes into the payload information field of the GFP frame. - -**pFCS generation:** The FCS is calculated over the payload information field of a frame and inserted into the pFCS fields of the frame as defined in clause 6.1.2.2.1 of [ITU-T G.7041]. - -**Type header generation:** The type header of the GFP data frame is generated by setting the PTI field to "000", the PFI field to "1", the EXI field to "0000" and the UPI field to 0001 0101" (Transparent transcoded FC-1200) as defined in Table 6-3 of [ITU-T G.7041]. The tHEC of the payload header is generated as defined in clause 6.1.2.1.2 of [ITU-T G.7041]. - -**Payload scrambler:** The GFP payload area is scrambled as defined in clause 6.1.2.3 of [ITU-T G.7041]. - -**Core header generation:** The core header of the GFP data frame is generated as specified in clause 8.5.3.1 of [ITU-T G.806]. The length of the GFP payload area is always 8800 bytes. - -**Mapping:** The function shall provide an elastic store (buffer) process. The transcoded FC-1200 signal consists of a stream of GFP data frames. The data bytes of the GFP stream shall be written into the buffer under control of the associated input clock. The data bytes of the GFP stream shall be read out - -of the buffer and written byte-synchronously onto the D bytes in the OPU2e frame under control of the ODU2e clock as defined in clause 17.8.2 of [ITU-T G.709]. - -*Buffer size:* In the presence of jitter as specified by [b-ANSI INCITS 364], this mapping process shall not introduce any errors. - -Following a step in frequency of the CI\_CK signal (for example, due to removal of the ingress replacement signal), there will be a maximum recovery time of X seconds after which this process shall not generate any bit errors. The value of X is for further study; a value of 1 second has been proposed. - -**PT:** The function shall insert payload type code "0000 1000" (FC-1200 into OPU2e mapping) into the PT byte position of the PSI overhead as defined in clause 15.9.2.1 of [ITU-T G.709]. - -**Client signal fail:** The function shall signal the failure of the client signal to the far end by use of the Bit 1 of the PSI[2] byte of the payload structure identifier, as defined in clause 17.1 of [ITU-T G.709]. - -NOTE – Equipment developed prior to Edition 4.0 of this Recommendation will not support the CSF processing. - -**RES:** The function shall insert all-0's into the RES bytes and reserved bits within the JC bytes. - -All other bits of the ODU2e overhead should be sourced as "0"s, except the ODU2e-PM STAT field which should be set to the value "normal path signal" (001). - -![Diagram of an elastic store with a circular buffer and WR/RD pointers.](1a05c3cbf9fd7b2a8873cad13d10cdb6_img.jpg) - -**FC-1200\_CP** - -**CI\_D CI\_CK** **CI\_SSF** - -Timing transparent transcoding - -66B block synchronization - -66B\_Data      66B\_CK - -66B to 513B transcoding - -513B\_Data      513B\_CK - -Superblock construction and -CRC-24 generation - -SB\_Data      SB\_FS - -Superblock mapping - -GFP\_Frame      GFP\_FS - -pFCS generation - -GFP\_Frame      GFP\_FS - -Type header generation - -GFP\_Frame      GFP\_FS - -Payload scrambler - -GFP\_Frame      GFP\_FS - -Core header generation (PLI, -cHEC, scrambler) - -GFP\_Frame      GFP\_FS - - - -Elastic store - -ODU clock generator locked -to FC-1200 clock (ODCb) - - - -Justification control - -CK - -$\frac{1}{122368}$ - -FS - -$\frac{1}{256}$ - -MFS - - - -Insert PT - -Insert CSF ← CI\_SSF - -Insert RES - -ODUk OH is set to all-0's, -except PM STAT = 001 - - - -**AI\_D** -**AI\_CK** -**AI\_FS** -**AI\_MFS** - -**ODU2eP\_AP** - -G.798(17)\_F14-85 - -Diagram of an elastic store with a circular buffer and WR/RD pointers. - -**Figure 14-85 – ODU2eP/Client\_A\_So function** - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -#### 14.3.15.2 ODU2eP to FC-1200 client adaptation sink function (ODU2eP/FC-1200\_A\_Sk) - -The ODU2eP/FC-1200\_A\_Sk recovers the FC-1200 client signal from the OPU2e payload. It extracts the OPU2e overhead (PT and RES) and monitors the reception of the correct payload type. Under signal fail condition the replacement signal as defined in clause 17.8.2 of [ITU-T G.709] shall be inserted. - -The information flow of the ODU2eP/FC-1200\_A\_Sk function is defined with reference to Figure 14-86 and the processing of the ODU2eP/FC-1200\_A\_Sk function is defined with reference to Figure 14-87. - -##### Symbol - -![Diagram of the ODU2eP/FC-1200_A_Sk function symbol. A central trapezoidal block labeled 'ODU2eP/FC-1200' has an input arrow from below labeled 'ODU2eP_AP' and an output arrow pointing left labeled 'ODU2eP/FC-1200_A_Sk_MP'. Above the block, an arrow points up to 'FC-1200_CP'. The diagram is labeled G.798(17)_F14-86.](40c6fe38cf97a637027a6a1806b5546a_img.jpg) - -Diagram of the ODU2eP/FC-1200\_A\_Sk function symbol. A central trapezoidal block labeled 'ODU2eP/FC-1200' has an input arrow from below labeled 'ODU2eP\_AP' and an output arrow pointing left labeled 'ODU2eP/FC-1200\_A\_Sk\_MP'. Above the block, an arrow points up to 'FC-1200\_CP'. The diagram is labeled G.798(17)\_F14-86. - -**Figure 14-86 – ODU2eP/Client\_A\_Sk function** - -##### Interfaces - -**Table 14-40 – ODU2eP/Client\_A\_Sk inputs and outputs** - -| Input(s) | Output(s) | -|----------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| ODU2eP_AP:
ODU2eP_AI_CK
ODU2eP_AI_D
ODU2eP_AI_FS
ODU2eP_AI_MFS
ODU2eP_AI_TSF | FC-1200_CP:
FC-1200_CI_CK
FC-1200_CI_D
FC-1200_CI_SSF
ODU2eP/FC-1200_A_Sk_MP:
ODU2eP/FC-1200_A_Sk_MI_cPLM
ODU2eP/FC-1200_A_Sk_MI_cCSF
ODU2eP/FC-1200_A_Sk_MI_cLFD
ODU2eP/FC-1200_A_Sk_MI_AcPT | - -##### Processes - -**PT:** The function shall extract the PT byte from the PSI overhead as defined in clause 8.7.1.1. The accepted PT value is available at the MP (MI\_AcPT) and is used for PLM defect detection. - -**RES:** The value in the RES bytes shall be ignored. - -**Client signal fail:** The function shall extract the CSF signal indicating the failure of the client signal out of bit 1 of the PSI[2] byte of the payload structure identifier, as defined in clause 17.1 of [ITU-T G.709]. - -**NOTE** – Equipment developed prior to Edition 4.0 of this Recommendation will not support the CSF processing. - -**Timing transparent transcoding:** The function shall uncompress the FC-1200 signal by a factor 51/50 through timing transparent transcoding. The result is a stream of 66B symbols. - -*GFP frame delineation:* The function shall delineate the GFP data frame as specified in clause 8.5.2.2 of [ITU-T G.806]. - -*Payload descrambler:* The GFP payload area is descrambled as defined in clause 6.1.2.3 of [ITU-T G.7041]. - -*tHEC check:* The tHEC of the payload header shall be processed as defined in clause 8.5.3.2 of [ITU-T G.806]. - -*PTI and UPI:* The function shall ignore the PTI and UPI fields. - -*pFCS supervision:* The function shall ignore the FCS field. - -*Superblock demapping:* The prepended 16 bytes of fixed stuff are stripped and the 17 superblocks are extracted from the payload information field of the GFP frame. - -*CRC-24 supervision and superblock destruction:* This process checks the CRC-24 of a received superblock for errors. If an error is detected all 66B symbols of the superblock are replaced by 66B error control blocks. - -*513B to 66B transcoding:* The function shall transcode the 513B symbols to 66B symbols as specified in Annex B of [ITU-T G.709]. - -**CBR clock generation:** The function shall provide an elastic store (buffer) process. The 66B symbols resulting from the timing transparent transcoding shall be written into the buffer. The FC-1200 data (CI\_D) shall be read out of the buffer under control of the FC-1200 clock (CI\_CK). - -*Smoothing and jitter limiting process:* The function shall provide for a clock smoothing and elastic store (buffer) process. The data bytes shall be written into the buffer under control of the associated (gapped) input clock. The data signal shall be read out of the buffer under control of a smoothed (equally spaced) clock at a rate and frequency accuracy determined by the client signal rate at the input of the remote ODU2eP/FC-1200\_a\_So. - -The clock parameters, including jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCp clock), apply. - -*Buffer size:* In the presence of jitter as specified by [b-ANSI INCITS 364] and an ODU2e frequency within the range $10\,399\,525.316\text{ kbit/s} \pm 100\text{ ppm}$ , this justification process shall not introduce any errors. - -Following a step in frequency of the signal transported by the ODU2eP\_AI (for example, due to reception of FC-1200\_CI from a new CBR\_TT\_So at the far end or removal of the replacement signal with a frequency offset), there will be a maximum recovery time of X seconds after which this process shall not generate any bit errors. The value of X is for further study; a value of 1 second has been proposed. - -![Block diagram of ODU2eP/Client_A_Sk processes showing data flow from FC-1200_CP and ODU2eP_AP through various processing stages including transcoding, supervision, and defect detection.](70fd9003b407d059f32275b212482817_img.jpg) - -The diagram illustrates the internal processes of an ODU2eP/Client\_A\_Sk. At the top, the **FC-1200\_CP** interface provides **CI\_D** and **CI\_CK** signals. These pass through a **Replacement signal generator** and a **Replacement signal insertion** block, which also receives an **aAIS** signal. The **CI\_SSF** signal is output from the **Consequent actions** block. Below the insertion block, the data and clock signals enter an **Elastic store** (with **WR** and **RD** ports). The **Elastic store** outputs **WR** and **RD** signals to a **CBR clock generator (ODCp)**, which provides a **CK** signal. The data from the **Elastic store** is then processed through a series of stages within a **Timing transparent transcoding** block: **66B\_Data** and **66B\_CK** are processed through **513B to 66B transcoding** to produce **513B\_Data** and **513B\_CK**. These are followed by **CRC-24 supervision and superblock de-construction** (outputting **SB\_Data** and **SB\_FS**), **Superblock demapping** (outputting **GFP\_Frame** and **GFP\_FS**), **pFCS supervision** (outputting **GFP\_Frame** and **GFP\_FS**), **PTI and UPI supervision** (outputting **GFP\_Frame** and **GFP\_FS**), **tHEC check** (outputting **GFP\_Frame** and **GFP\_FS**), **Payload descrambler** (outputting **GFP\_Frame** and **GFP\_FS**), and **GFP frame delineation** (outputting **D** and **CK**). The **Demapping** block receives **AI\_CK** and **AI\_FS** signals and outputs **AI\_D**, **AI\_MFS**, **AI\_CK**, and **AI\_FS** signals. Below the transcoding block, the **Extract CSF** block outputs **dCSF**, and the **Extract PT** block outputs **dPLM** to a **PT process** block, which outputs **MI\_AcPT**. The **Defect correlations** block receives **dLFD**, **dPLM**, **dCSF**, and **AI\_TSF** signals and outputs **MI\_cLFD**, **MI\_cPLM**, and **MI\_cCSF** signals. The **Consequent actions** block also receives **dPLM**, **dLFD**, and **AI\_TSF** signals. The **ODU2eP\_AP** interface provides **AI\_D**, **AI\_MFS**, **AI\_CK**, **AI\_FS**, and **AI\_TSF** signals. The diagram is labeled **ODU2eP/FC-1200\_A\_Sk\_MP** on the right and **G.798(17)\_F14-87** at the bottom right. - -Block diagram of ODU2eP/Client\_A\_Sk processes showing data flow from FC-1200\_CP and ODU2eP\_AP through various processing stages including transcoding, supervision, and defect detection. - -**Figure 14-87 – ODU2eP/Client\_A\_Sk processes** - -**Defects** - -The function shall detect for dPLM, dLFD, and dCSF defects. - -**dPLM:** See clause 6.2.4.1. The expected payload type is "0000 1000" (FC-1200 into OPU2e mapping) as defined in clause 15.9.2.1 of [ITU-T G.709]. - -**dCSF:** See clause 6.2.10. - -**dLFD:** See clause 6.2.5.2 of [ITU-T G.806]. - -### Consequent actions - -aSSF $\leftarrow$ AI\_TSF or dPLM or dLFD - -aAIS $\leftarrow$ AI\_TSF or dPLM or dLFD - -On declaration of aAIS the function shall output a replacement signal as defined in clause 17.8.2 of [ITU-T G.709] within two frames. On clearing of aAIS the replacement signal shall be removed within two frames and normal data being output. The replacement signal clock shall be independent from the incoming clock. The replacement signal clock has to be within the frequency, jitter, and wander tolerance specifications of the FC-1200 client signal as defined in [b-ANSI INCITS 364]. - -### Defect correlations - -cPLM $\leftarrow$ dPLM and (not AI\_TSF) - -cLFD $\leftarrow$ dLFD and (not dPLM) and (not AI\_TSF) - -cCSF $\leftarrow$ dCSF and (not dPLM) and (not AI\_TSF) - -**Performance monitoring:** None. - -### 14.3.16 ODUCnP to ODUk adaptation function (ODUCnP/ODUk\_A) - -The ODUCnP to ODUk adaptation functions perform the adaptation between the ODUCnP layer adapted information and the characteristic information of ODUk ( $k = 0, 1, 2, 2e, 3, 4, \text{flex}$ ) signals. - -![Diagram of the ODUCnP/ODUk_A function. A central trapezoidal block is labeled 'ODUCnP/ODUk'. Above the block, 'Tributary port' is labeled with arrows pointing to ports 1, 2, ..., m. Above these ports, 'ODUk_CP's' is labeled. To the right of the block, an arrow labeled 'ODUCnP_TI' points into the block. Below the block, an arrow labeled 'ODUCnP_AP' points out. The diagram is labeled 'G.798(17)_F14-88' in the bottom right corner.](ce0669b928f93ab068d8874de19c133a_img.jpg) - -The diagram illustrates the ODUCnP/ODUk\_A function. A central trapezoidal block represents the adaptation function. Above the block, multiple tributary ports are shown, labeled 1, 2, ..., m. Each port has a bidirectional arrow connecting it to the block. Above these ports, the label 'ODUk\_CP's' indicates the client signals. To the right of the block, an arrow labeled 'ODUCnP\_TI' points into the block, representing the incoming signal. Below the block, an arrow labeled 'ODUCnP\_AP' points out, representing the adapted signal. The diagram is identified by the code 'G.798(17)\_F14-88' in the bottom right corner. - -Diagram of the ODUCnP/ODUk\_A function. A central trapezoidal block is labeled 'ODUCnP/ODUk'. Above the block, 'Tributary port' is labeled with arrows pointing to ports 1, 2, ..., m. Above these ports, 'ODUk\_CP's' is labeled. To the right of the block, an arrow labeled 'ODUCnP\_TI' points into the block. Below the block, an arrow labeled 'ODUCnP\_AP' points out. The diagram is labeled 'G.798(17)\_F14-88' in the bottom right corner. - -**Figure 14-88 – ODUCnP/ODUk\_A function** - -Tributary ports are dynamically created and deleted under the control of management. Each tributary port is associated with one ODUk connection point on one hand, and $M$ OPUCn tributary slots on the other hand. The multiplex structure identifier (MSI) carries the configuration of tributary ports to tributary slots. - -#### 14.3.16.1 ODUCnP to ODUk adaptation source function (ODUCnP/ODUk\_A\_So) - -The ODUCnP/ODUk\_A\_So function creates the ODUCn signal from a free-running clock or a external synchronization clock. It asynchronously maps the ODUk client signal from the $m \times$ ODUk CPs into ODTUCn.M including justification control (JC) information. The ODTUCn.M is multiplexed into the tributary slots of the OPUCn. It adds OPUCn overhead (RES, PT, MSI, OMFI) and default ODUCn overhead. It provides access to ODUCn APS overhead. It provides access to the ODUk APS overhead. - -The information flow and processing of the ODUCnP/ODUk\_A\_So function is defined with reference to Figures 14-88 and 14-89. - -### Symbol - -![Diagram of the ODUCnP/ODUk_A_So function symbol. The symbol is a trapezoid labeled 'ODUCnP/ODUk'. Inputs include 'Tributary port' (1, 2, ..., m) and 'ODUk_CPs' entering from the top; 'ODUCn_PP' entering from the left; 'ODUCnP/ODUk_A_So_MP' entering from the left via a double-headed arrow; and 'ODUCn_TP' entering from the right. The output is 'ODUCnP_AP' exiting from the bottom. A reference label 'G.798(17)_F14-89' is present at the bottom right.](0603e0bad64a10c96372bbcf8c5d0d14_img.jpg) - -Diagram of the ODUCnP/ODUk\_A\_So function symbol. The symbol is a trapezoid labeled 'ODUCnP/ODUk'. Inputs include 'Tributary port' (1, 2, ..., m) and 'ODUk\_CPs' entering from the top; 'ODUCn\_PP' entering from the left; 'ODUCnP/ODUk\_A\_So\_MP' entering from the left via a double-headed arrow; and 'ODUCn\_TP' entering from the right. The output is 'ODUCnP\_AP' exiting from the bottom. A reference label 'G.798(17)\_F14-89' is present at the bottom right. - -Figure 14-89 – ODUCnP/ODUk\_A\_So function - -### Interfaces - -Table 14-41 – ODUCnP/ODUk\_A\_So inputs and outputs - -| Input(s) | Output(s) | -|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-----------------------------------------------------------------------------------| -| m × ODUk_CP:
ODUk_CI_CK
ODUk_CI_D
ODUk_CI_FS
ODUk_CI_MFS
ODUk_CI_APS
ODUCn_PP:
ODUCn_PI_APS
ODUCn_TP:
ODUCn_TI_CK
ODUCnP/ODUk_A_So_MP:
ODUCnP/ODUk_A_So_MI_TxMSI
ODUCnP/ODUk_A_So_MI_Nominal_Bitrate_and_Tolerance[1..m]
ODUCnP/ODUk_A_So_MI_AdminState[1..m]
ODUCnP/ODUk_A_So_MI_APS_EN[1..m]
ODUCnP/ODUk_A_So_MI_APS_LVL[1..m] | ODUCnP_AP:
ODUCnP_AI_CK
ODUCnP_AI_D
ODUCnP_AI_FS
ODUCnP_AI_MFS | - -### Processes - -The processes associated with the ODUCnP/ODUk\_A\_So function are specific processes for each ODUk\_CP and common processes for the compound (multiplexed) signal as depicted in Figures 14-90 and 14-91. - -![Block diagram of ODUCnP/ODUk_A_So processes showing client processes, multiplexing, and clock generation.](8b964751bc72fac53d873c674d3fa937_img.jpg) - -The diagram illustrates the internal processes of an ODUCnP/ODUk\_A\_So system. At the top, multiple client processes, labeled **ODUk\_CP[1]** through **ODUk\_CP[m]**, are shown. Each client process has input signals **CL\_MFS**, **CL\_FS**, **CL\_CK**, **CL\_D**, and **CL\_APS**. Each client process outputs management and control signals: **MI\_AdminState**, **MI\_APS\_EN**, **MI\_APS\_LVL**, and **MI\_Nominal\_Bitrate\_and\_Tolerance**. These are grouped as **MI\_AdminState[1..m]**, **MI\_APS\_EN[1..m]**, **MI\_APS\_LVL[1..m]**, and **MI\_Nominal\_Bitrate\_and\_Tolerance[1..m]**. The client processes also output data signals: **OMFS**, **MFS**, **FS**, **CK**, **D**, and **TS#**. - -The data signals from all client processes are fed into a **Multiplexer**. The multiplexer outputs a **Multiplex structure** which includes: **Multiplex structure identifier (MSI)**, **Payload type (PT)**, **RES**, and **ODUCn PM APS**. The MSI signal is also labeled as **MI\_TxMSI**. The PM APS signal is labeled as **PI\_APS**. - -Below the multiplexer, the **ODUCn PM APS** signal is processed by an **OMFI** block (which is **optional**) and a $\frac{1}{20}$ divider to produce **OPMFS**. The **OMFI** block also outputs **MFS** and **FS** signals. The **MFS** signal is also labeled as **AI\_MFS** and the **FS** signal as **AI\_FS**. The **CK** signal is also labeled as **AI\_CK**. These three signals (**AI\_MFS**, **AI\_FS**, **AI\_CK**) are grouped as **ODUCnP\_AP**. - -The **MFS** signal is also fed into a $\frac{1}{256}$ divider, and the **FS** signal into a $\frac{1}{122368}$ divider. The outputs of these dividers are fed into an **ODCa clock generator**. The **ODCa clock generator** also receives a **TI\_CK** signal and outputs a **TI\_CK** signal. The **ODCa clock generator** is also labeled as **ODUCn\_TP**. - -A **Free-running clock generator** is also shown, which outputs a **CK** signal to the **ODCa clock generator**. - -On the left side, a block indicates that **ODUCn OH is set to all-0's, except PM STAT = 001**. - -On the right side, a large bracket groups the client process outputs and the multiplexer outputs as **ODUCnP/ODUk\_A\_So\_MP**. Other brackets on the right label the **PI\_APS** signal as **ODUCn\_PP** and the **ODCa clock generator** as **ODUCn\_TP**. - -The diagram is labeled **G.798(17)\_F14-90** at the bottom right. - -Block diagram of ODUCnP/ODUk\_A\_So processes showing client processes, multiplexing, and clock generation. - -Figure 14-90 – ODUCnP/ODUk\_A\_So processes - -![Block diagram of ODUkP_CP[p] client specific processes. The diagram shows the flow of signals CI_MFS, CI_FS, CI_CK, CI_D, and CI_APS through various functional blocks: ODU-LCK generator, LCK/Normal selection, FAS/MFAS insertion, Elastic store, and Justification control and JC generation. External inputs include MI_AdminState[p], MI_APS_EN[p], MI_APS_LVL[p], and MI_Nominal_Bitrate_and_Tolerance[p]. Output signals include OMFS, MFS, FS, CK, D, TS#, and Active. Reference G.798(17)-Amd.3(21)_F14-91 is noted at the bottom.](ba596ecf0bd3f3520b7b5c2c857a9ec3_img.jpg) - -G.798(17)-Amd.3(21)\_F14-91 - -Block diagram of ODUkP\_CP[p] client specific processes. The diagram shows the flow of signals CI\_MFS, CI\_FS, CI\_CK, CI\_D, and CI\_APS through various functional blocks: ODU-LCK generator, LCK/Normal selection, FAS/MFAS insertion, Elastic store, and Justification control and JC generation. External inputs include MI\_AdminState[p], MI\_APS\_EN[p], MI\_APS\_LVL[p], and MI\_Nominal\_Bitrate\_and\_Tolerance[p]. Output signals include OMFS, MFS, FS, CK, D, TS#, and Active. Reference G.798(17)-Amd.3(21)\_F14-91 is noted at the bottom. - -**Figure 14-91 – ODUCnP/ODUk\_A\_So client specific processes** - -### Specific processes - -The specific processes are performed independently for each ODUk client signal that is multiplexed into the OPUCn. The specific processes perform the mapping of the ODUk into an ODTUCn.M. - -**FAS/MFAS insertion:** The function shall extend the ODUk with the frame alignment overhead (FAS and MFAS) in row one bytes 1 to 7 as described in clause 15.6.2 of [ITU-T G.709]. Bytes 8 to 14 of row one are set to all-ZEROs. - -**Mapping, frequency justification and bit-rate adaptation:** The function shall provide an elastic store (buffer) process for the ODUk client signal. The data signal ODUk\_CI shall be written into the buffer under the control of the associated input clock. - -Justification methods GMP (*ODTUCn.M*), as described below, is provided, The ODU rate, as configured via the ODUCnP/ODUk\_A\_So\_MI\_Nominal\_Bitrate\_and\_Tolerance[p] input for tributary port #p, determines the base value and ranges for the parameters Cn and Cm. - -*ODTUCn.M:* The data shall be read out of the buffer and written onto groups of 16M successive bytes of the ODTUCn.M payload area under the control of the ODUCn clock and the GMP data/stuff control mechanism as defined in clause 20.5 of [ITU-T G.709]. The 16-byte word alignment of the extended ODUk is preserved through the mapping procedure; i.e., the position of the first 16 overhead bytes of the ODUk is always located after an integer number of 16-byte words from the start of the ODTUCn.M structure. - -**Buffer size:** In the presence of jitter as specified by [ITU-T G.8251] and a frequency within the range specified in Table 7-2 of [ITU-T G.709], this mapping process shall not introduce any errors. The maximum buffer hysteresis, and therefore the maximum phase error introduced, is for further study. - -**ODTUCn.M JC1/JC2/JC3, JC4/JC5/JC6:** The function shall generate the GMP $C_m$ and GMP $\sum C_{nD}$ information and insert this into the JC1/JC2/JC3 and JC4/JC5/JC6 bytes, respectively, according to the specification in clause 20.5 and Annex D of [ITU-T G.709]. - -**ODUk server layer APS:** When APS is enabled for tributary signal #p (MI\_APS\_EN[p] is true), the function shall insert the CI\_APS value into the ODU APS/PCC[MI\_APS\_LVL[p]] field, which is available once per eight ODU frames when the value of the MFAS bits 6, 7, 8 are equal to MI\_APS\_LVL[p]. - -**NOTE –** The ODUk server layer section APS information may be present in the case where the ODUk signal contains an ODU-AIS, ODU-LCK or ODU-OCI maintenance signal. The ODU-LCK maintenance signal may be inserted in this adaptation source function. ODUk SNC/I protection is unable to detect the insertion of such ODU-LCK and will not perform a protection switch. - -**ODU-LCK:** The function shall generate the ODU-LCK signal as defined in clause 16.5 of [ITU-T G.709]. The clock, frame start and multiframe start are defined by the incoming ODUk signal. - -**Selector:** The normal signal for a tributary signal #p may be replaced by the ODU-LCK signal. The ODU-LCK signal is selected if the MI\_AdminState[p] is LOCKED. - -#### Common processes - -**Clock and (multi)frame start signal generation:** The function shall generate a local ODUCn clock (ODUCnP\_AI\_CK) of " $n \times 239/226 \times 40 \times 2\,488\,320\text{ kHz} \pm 20\text{ ppm}$ " from the synchronization timing information clock input (TI\_CK) or, if the TI\_CK is absent, a free-running oscillator. The clock parameters, including jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCa clock), apply. - -The function shall generate the (multi)frame start reference signals AI\_FS and AI\_MFS for the ODUCn signal. The AI\_FS signal shall be active once per $n \times 122\,368$ clock cycles. AI\_MFS shall be active once every 256 frames. - -**OPU multiframe (OMFI) start signal generation for OPUCn:** For OPUCn in addition to MFAS, a dedicated 20-frame OPU multiframe indicator is used for the multiplexing of LO ODUs into the OPUCn. This multiframe structure is locked to bits 4, 5, 6, 7 and 8 of the OMFI byte, as shown in Table 20-1 of [ITU-T G.709], and to be inserted into the OPU overhead. The function shall generate OPUCn multiframe and the related start signal (OMFS) dividing the frame signal sequence by 20. The OMFI start signal may optionally be phase aligned to the ODU multiframe signal. In this case, the OMFI = 0 position is aligned with MFAS = 0 position every 1280 frame periods. See clause 20.4.4 of [ITU-T G.709]. - -**Multiplexing:** The function assigns the individual ODTUCn.M to specific time slots of the OPUCn payload area as defined by the multiplex structure (see clauses 20.3 and 20.4.1 of [ITU-T G.709]). - -**MSI:** The function shall insert the TxMSI into the MSI byte positions of the PSI overhead as defined in clauses 20.4.1.4, 20.4.1.5, 20.4.1.6 of [ITU-T G.709]. The TxMSI value, and as such the multiplex structure, is configurable via MI\_TxMSI. - -**PT:** The function shall insert code "0010 0010" (ODU multiplex structure supporting ODTUCn.ts) into the PT byte position of the PSI overhead as defined in clause 15.13.2.1 of [ITU-T G.709]. - -**ODUCn APS:** The function shall insert the PI\_APS value into the ODUCn path APS/PCC field, which is available once per ODUCn frame. - -**RES:** The function shall insert all-ZEROs into the RES bytes. - -All other bits of the ODUCn overhead should be sourced as "0"s, except the PMOH STAT field which should be set to the value "normal path signal" (001). - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -#### 14.3.16.2 ODUCnP to ODuk adaptation sink function (ODUCnP/ODuk\_A\_Sk) - -The ODUCnP/ODuk\_A\_Sk function extracts the OPUCn overhead (PT, MSI, RES and OMFI) and monitors the reception of the correct payload type. It demultiplexes the individual ODTUCn.M from the payload area of the OPUCn and recovers the $m \times$ ODuk signals using the justification control information (JC, JC1/2/3/4/5/6 overhead). It determines the frame and multiframe structure of the ODuk. It provides access to ODUCn APS overhead. - -The information flow and processing of the ODUCnP/ODuk\_A\_Sk function is defined with reference to Figures 14-92 and 14-93. - -#### Symbol - -![Diagram of the ODUCnP/ODuk_A_Sk function symbol. The central block is labeled 'ODUCnP/ODuk'. It has four input ports: 'ODUCnP/ODuk_A_Sk_MP' (left, double-headed arrow), 'ODUCn_PP' (left, single-headed arrow), 'ODUCn_TP' (right, single-headed arrow), and 'ODUCnP_AP' (bottom, single-headed arrow). It has multiple output ports labeled 'Tributary port' with sub-labels '1', '2', '...', and 'm'. Above these output ports is the label 'ODuk_CPs'. The diagram is labeled 'G.798(17)_F14-92' in the bottom right corner.](b4231d923aa1b23a3d9e7a2aa2942d1e_img.jpg) - -The diagram shows a central trapezoidal block labeled "ODUCnP/ODuk". To its left, there are two input ports: "ODUCnP/ODuk\_A\_Sk\_MP" with a double-headed arrow and "ODUCn\_PP" with a single-headed arrow pointing into the block. To its right, there is one input port: "ODUCn\_TP" with a single-headed arrow pointing into the block. Below the block, there is one input port: "ODUCnP\_AP" with a single-headed arrow pointing into the block. Above the block, there are multiple output ports labeled "Tributary port" with sub-labels "1", "2", "...", and "m". Above these output ports is the label "ODuk\_CPs". The diagram is labeled "G.798(17)\_F14-92" in the bottom right corner. - -Diagram of the ODUCnP/ODuk\_A\_Sk function symbol. The central block is labeled 'ODUCnP/ODuk'. It has four input ports: 'ODUCnP/ODuk\_A\_Sk\_MP' (left, double-headed arrow), 'ODUCn\_PP' (left, single-headed arrow), 'ODUCn\_TP' (right, single-headed arrow), and 'ODUCnP\_AP' (bottom, single-headed arrow). It has multiple output ports labeled 'Tributary port' with sub-labels '1', '2', '...', and 'm'. Above these output ports is the label 'ODuk\_CPs'. The diagram is labeled 'G.798(17)\_F14-92' in the bottom right corner. - -**Figure 14-92 – ODUCnP/ODuk\_A\_Sk function** - -## Interfaces - -**Table 14-42 – ODUCnP/ODUk\_A\_Sk inputs and outputs** - -| Input(s) | Output(s) | -|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| ODUCnP_AP:
ODUCnP_AI_CK
ODUCnP_AI_D
ODUCnP_AI_FS
ODUCnP_AI_MFS
ODUCnP_AI_TSF
ODUCnP_AI_TSD
ODUCnP/ODUk_A_Sk_MP:
ODUCnP/ODUk_A_Sk_MI_ExMSI
ODUCnP/ODUk_A_Sk_MI_AdminState[1..m]
ODUCnP/ODUk_A_Sk_MI_Nominal_Bitrate_and_Tolerance[1..m]
ODUCnP/ODUk_A_Sk_MI_APS_EN[1..m]
ODUCnP/ODUk_A_Sk_MI_APS_LVL[1..m] | m × ODUk_CP:
ODUk_CI_CK
ODUk_CI_D
ODUk_CI_FS
ODUk_CI_MFS
ODUk_CI_SSF
ODUk_CI_SSD
ODUk_CI_APS
ODUCnP_PP:
ODUCnP_PI_APS
ODUCnP_PI_TSF
ODUCnP_PI_TSD
ODUCnP/ODU[i]j_A_Sk_MP:
ODUCnP/ODUk_A_Sk_MI_cPLM
ODUCnP/ODUk_A_Sk_MI_cLOOMFI
ODUCnP/ODUk_A_Sk_MI_cMSIM[1..m]
ODUCnP/ODUk_A_Sk_MI_AcPT
ODUCnP/ODUk_A_Sk_MI_AcMSI
ODUCnP/ODUk_A_Sk_MI_cLOFLOM[1..m] | - -## Processes - -The processes associated with the ODUCnP/ODUk\_A\_Sk function are specific processes for each ODUk\_CP and common processes for the compound (multiplexed) signal as depicted in Figure 14-93. - -![Block diagram of ODUCnP/ODUk_A_Sk processes showing signal flow from multiple client processes through a demultiplexer and various processing blocks to output interfaces.](29a5f4072e91dc4857fce0ace805e0d4_img.jpg) - -The diagram illustrates the internal architecture of ODUCnP/ODUk\_A\_Sk processes. At the top, multiple client-specific processes are shown, labeled ODUk\_CP[1] through ODUk\_CP[m]. Each client process has a set of input signals (AI\_TSD, AI\_TSF, dPLM, dLOOMFI, dMSIM[i], MI\_cMSIM[i], MI\_cLOFLOM[i], MI\_AdminState[i], MI\_APS\_EN[i], MI\_APS\_LVL[i], MI\_Nominal\_Bitrate\_and\_Tolerance[i]) and output signals (CL\_MFS, CL\_FS, CL\_CK, CL\_D, CL\_APS, CL\_SSF, CL\_SSD). The outputs from all client processes are fed into a central 'Demultiplexer' block. The demultiplexer has a 'Multiplex structure' output and several processing paths. One path goes through 'Extract MSI' and 'MSI process' to produce MI\_ExMSI and MI\_AcMSI. Another path goes through 'Extract PT' and 'PT process' to produce MI\_AcPT. A third path goes through 'ODUCn PM APS' to produce PI\_APS. A fourth path goes through 'Extract OMFI' and 'OMFI process' to produce OMFS. A 'Defect correlations' block receives AI\_TSF and dPLM from the client processes and produces MI\_cLOOFMI, MI\_cPLM, MI\_cMSIM[1..m], MI\_cLOFLOM[1..m], MI\_AdminState[1..m], MI\_APS\_EN[1..m], MI\_APS\_LVL[1..m], and MI\_Nominal\_Bitrate\_and\_Tolerance[1..m]. The bottom section, labeled ODUCnP\_AP, shows the final output interfaces: AI\_MFS, AI\_FS, AI\_CK, AI\_D, AI\_TSF, and AI\_TSD. The right side of the diagram is divided into two main output groups: ODUCnP/ODUk\_A\_Sk\_MP and ODUCnP\_PP. The ODUCnP/ODUk\_A\_Sk\_MP group includes MI\_cLOOFMI, MI\_cPLM, MI\_cMSIM[1..m], MI\_cLOFLOM[1..m], MI\_AdminState[1..m], MI\_APS\_EN[1..m], MI\_APS\_LVL[1..m], MI\_Nominal\_Bitrate\_and\_Tolerance[1..m], MI\_ExMSI, MI\_AcMSI, and MI\_AcPT. The ODUCnP\_PP group includes PI\_APS, PI\_TSF, and PI\_TSD. The diagram is labeled G.798(17)\_F14-93. - -Block diagram of ODUCnP/ODUk\_A\_Sk processes showing signal flow from multiple client processes through a demultiplexer and various processing blocks to output interfaces. - -Figure 14-93 – ODUCnP/ODUk\_A\_Sk processes - -![Block diagram of ODUCnP/ODUk_A_Sk client specific processes. The diagram shows the internal architecture of the client-specific processes, including signal flow from input (OMFS, MFAS, FS, CK, D, TS#, Active) through various functional blocks like Elastic store, Clock generation (ODCp), Justification control, Extract JC, Frame/multi-frame alignment, dLOFLOM detection, Defect correlations, ODuk APS, Generate AIS, Generate LCK, Select normal/AIS/LCK, and Consequent actions. Output signals include CI_MFS, CI_FS, CI_CK, CI_D, CI_APS, CI_SSF, and CI_SSD. Management interfaces (MI) and alarm signals (AI) are also shown.](36a1eab8868d8db81c6b28fbd0d5730f_img.jpg) - -The diagram illustrates the internal processes of an ODUCnP/ODUk\_A\_Sk client. At the bottom, input signals (OMFS, MFAS, FS, CK, D, TS#, Active) enter the system. The 'Elastic store' block receives 'D' and 'CK' signals and has 'RD' (Read) and 'WR' (Write) ports. The 'WR' port is connected to 'Clock generation (ODCp)', which in turn connects to 'Justification control' and 'Extract JC'. The 'Justification control' connects to 'Frame/multi-frame alignment'. The 'Elastic store' also connects to 'Frame/multi-frame alignment' via 'RD' and 'CK' signals. The 'Frame/multi-frame alignment' block outputs 'D' and 'CK' signals to 'dLOFLOM detection'. The 'dLOFLOM detection' block outputs 'dLOFLOM' to 'Defect correlations'. The 'Defect correlations' block receives 'AI\_TSF' and various management information (MI) signals: 'dPLM', 'dLOOMFI', 'dMSIM[p]', 'MI\_cMSIM[p]', and 'MI\_cLOFLOM[p]'. It also outputs 'aAIS', 'aSSF', and 'aSSD' to 'Consequent actions'. The 'Consequent actions' block receives 'MI\_AdminState[p]', 'AI\_TSD', and 'AI\_TSF' signals. The 'Consequent actions' block also connects to 'Generate AIS' and 'Generate LCK' blocks. These blocks receive 'MI\_Nominal\_Bitrate\_and\_Tolerance[p]' and output signals to 'Select normal/AIS/LCK'. The 'Select normal/AIS/LCK' block outputs 'Normal', 'AIS', and 'LCK' signals. These signals are then processed by 'ODUk APS', which receives 'MI\_APS\_EN[p]' and 'MI\_APS\_LVL[p]' signals. The 'ODUk APS' block outputs 'CI\_APS' signal. Finally, the 'Select normal/AIS/LCK' block outputs 'CI\_MFS', 'CI\_FS', 'CI\_CK', and 'CI\_D' signals. The 'Consequent actions' block also outputs 'CI\_SSF' and 'CI\_SSD' signals. The entire process is labeled 'ODUk\_CP[p]' at the top. A reference 'G.798(17)-Amd.3(21)\_F14-94' is noted at the bottom right of the diagram. - -Block diagram of ODUCnP/ODUk\_A\_Sk client specific processes. The diagram shows the internal architecture of the client-specific processes, including signal flow from input (OMFS, MFAS, FS, CK, D, TS#, Active) through various functional blocks like Elastic store, Clock generation (ODCp), Justification control, Extract JC, Frame/multi-frame alignment, dLOFLOM detection, Defect correlations, ODuk APS, Generate AIS, Generate LCK, Select normal/AIS/LCK, and Consequent actions. Output signals include CI\_MFS, CI\_FS, CI\_CK, CI\_D, CI\_APS, CI\_SSF, and CI\_SSD. Management interfaces (MI) and alarm signals (AI) are also shown. - -**Figure 14-94 – ODUCnP/ODUk\_A\_Sk client specific processes** - -### Common processes - -**OPU multiframe (OMFI) reception for OPUCn:** For OPUCn in addition to MFAS, a dedicated 20-frame OPU multiframe indicator is used for the multiplexing of LO ODUs into the OPUCn. This multiframe structure is locked to bits 4, 5, 6, 7 and 8 of the OMFI byte, as shown in Table 20-1 of [ITU-T G.709]. The function shall detect OPU multiframe by searching for the framing pattern in the bits indicated above. The process has two states, out-of-multiframe (OOM) and in-multiframe (IM). The IM state shall be entered if this set is found and confirmed one frame period later and an error-free multiframe sequence is found in the byte positions of the two frames. In the IM state, the frame alignment signal shall be continuously checked with the presumed OMFI frame start position and the expected multiframe sequence. The OOM state shall be entered if this subset is not found at the correct position in five consecutive frames or the received OMFI does not match with the expected multiframe number in five consecutive frames. The OPUCn multiframe start (OMFS) shall be maintained during the OOM state of the OMFI detection process. The defect dLOOMFI shall be generated based on the state of the OMFI alignment process. - -If the OMFI alignment process is persistently in the out-of-multiframe (OOM) state for 3 ms, dLOOMFI shall be declared. dLOOMFI shall be cleared immediately when the OMFI alignment process is in the in-multiframe (IM) state. - -**PT:** The function shall extract the PT byte from the PSI overhead as defined in clause 8.7.1.1. The accepted PT value is available at the MP (MI\_AcPT) and is used for PLM defect detection. The PLM detection shall be based on the comparison of the accepted PT with the value 0x22. - -**MSI:** The function shall extract the MSI from the PSI overhead as defined in clause 8.7.2.2. The accepted MSI (AcMSI) is available at the MP (MI\_AcMSI). The multiplex structure is defined by ExMSI, which is configurable via MI\_ExMSI. - -**RES:** The value in the RES bytes shall be ignored. - -**ODUCn APS:** The function shall extract the information from the ODUCn APS/PCC field and apply this to the PI\_APS. - -**Demultiplexing:** The function activates the ODTUCn.M and assigns the time slots of the ODUCn payload area to the individual ODTUCn.M as defined by the multiplex structure (see clauses 20.3 and 20.4.1 of [ITU-T G.709]). - -### Specific processes - -The specific processes are performed independently for each ODUk client signal that is multiplexed into the OPUCn. The specific processes recover the ODUk from the ODTUCn.M. - -Justification method GMP (*ODTUCn.M*) as described below is provided. The ODU rate, as configured via the MI\_Nominal\_Bitrate\_and\_Tolerance[p] input for tributary port #p, determines the base value and ranges for the parameters $C_n$ and $C_m$ . - -**ODTUCn.ts JC1/2/3 and JC4/5/6:** The function shall interpret the GMP overhead information in the JC1/2/3 and JC4/5/6 bytes as defined in clause 20.5 of [ITU-T G.709] in order to determine the number of 16M-byte ODUk entities in the next ODTUCn.M multiframe. The OPUCn frame that contains the JC1/2/3 and JC4/5/6 bytes depends on the last tributary slot that is occupied by the ODTUCn.M. - -**Demapping, CBR clock generation:** The function shall provide an elastic store (buffer) process. - -*ODTUCn.M:* The ODUk data shall be extracted from the groups of 16M successive bytes of the ODTUCn.M payload area under the control of the GMP data/stuff control mechanism as defined in clause 20.5 of [ITU-T G.709] and be written into the buffer. The $C_n$ information associated with the ODUk is computed from the GMP $C_m$ and $\Sigma C_{nD}$ parameters carried within the JC1/2/3 and JC 4/5/6 overhead of the ODTUCn.M as specified in clause 20.5 of [ITU-T G.709]. For the GMP data/stuff control mechanism, refer to Annex D of [ITU-T G.709]. - -The ODUk data (CI\_D) shall be read out of the buffer under the control of the ODUk clock (CI\_CK). - -*Smoothing and jitter limiting process:* The function shall provide for a clock smoothing and elastic store (buffer) process. The ODUk data signal shall be written into the buffer under the control of the associated (gapped) OPUCn input clock (with a frequency accuracy within ± 20 ppm). The data signal shall be read out of the buffer under the control of a smoothed (equally spaced) ODUk clock (the rate is determined by the ODUk signal at the input of the remote ODUCnP/ODUk\_A\_So). - -The clock parameters, including jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCp clock), apply. - -*Buffer size:* In the presence of jitter as specified by [ITU-T G.8251] and a frequency within the tolerance range specified for the ODUk signal in Table 7-2 of [ITU-T G.709], this justification process shall not introduce any errors. - -Following a step in frequency of the ODUk signal transported (for example, due to reception of ODUk\_CI from a new ODUk\_TT\_So at the far end or removal of a ODU-AIS signal with a frequency offset), there will be a maximum recovery time of X seconds after which this process shall not generate any bit errors. The value of X is for further study; a value of one second has been proposed. - -**Frame and multiframe alignment:** The function shall perform frame and multiframe alignment as described in clause 8.2.3. - -NOTE 1 – The 16-byte word alignment of the extended ODUk is preserved through the mapping procedure; e.g., the position of the first 16 OH bytes of the ODUk is always located after an integer number of 16-byte words from the start of the ODTUCn.M structure. - -**ODU-LCK, ODU-AIS:** The function shall generate the ODU-LCK and ODU-AIS signals as defined in [ITU-T G.709]. The clock, frame start and multiframe start shall be independent from the incoming clock. The clock has to be within the ODUk frequency tolerance range as specified in Table 7-2 of [ITU-T G.709] provisioned by the MI\_Nominal\_Bitrate\_and\_Tolerance[p] from a free-running oscillator. Jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCa clock), apply. - -**Selector:** The normal signal for a tributary signal #p may be replaced by either the ODU-AIS or ODU-LCK signal. ODU-LCK is selected if the corresponding MI\_AdminState[p] signal is LOCKED. ODU-AIS is selected if the corresponding MI\_AdminState[p] signal is not LOCKED and aAIS is true. - -**ODUk server layer APS:** When APS is enabled for tributary signal #p (MI\_APS\_EN[p] is true), the function shall extract the information from the ODU APS/PCC[MI\_APS\_LVL[p]] field, which is available once per eight ODU frames when the value of the MFAS bits 6, 7, 8 is equal to MI\_APS\_LVL[p], and apply the extracted information to the CI\_APS. - -NOTE – The ODUk server layer section APS information may be present in the case where the ODUk signal contains an ODU-AIS or ODU-LCK maintenance signal. The ODU-LCK maintenance signal may have been inserted in the far-end adaptation source function. ODUk SNC/I protection is unable to detect the insertion of such ODU-LCK and will not perform a protection switch. - -## Defects - -The function shall detect dPLM, dMSIM, dLOOMFI and dLOFLOM. - -**dPLM:** See clause 6.2.4.1. The expected payload type is "0010 0010" (ODU multiplex structure supporting ODTUCn.ts) as defined in [ITU-T G.709]. - -**dLOOMFI:** dLOOMFI is detected per OPUCn. See the OPU multiframe (OMFI) detection process for OPUCn. - -For each ODUk tributary port #p: - -**dMSIM[p]:** See clause 6.2.9.2. dMSIM is detected per active ODUk. - -**dLOFLOM[p]:** See clause 6.2.5.3. dLOFLOM is detected per active ODUk. - -## Consequent actions - -PI\_TSF $\leftarrow$ AI\_TSF - -PI\_TSD $\leftarrow$ AI\_TSD - -For each ODUk tributary port #p: - -aSSF[p] $\leftarrow$ ((AI\_TSF or dPLM or dLOOMFI or dMSIM[p] or dLOFLOM[p]) and (not MI\_AdminState[p] = LOCKED)) - -aSSD[p] $\leftarrow$ AI\_TSD and (not MI\_AdminState[p] = LOCKED) - -$aAIS[p] \leftarrow ((AI\_TSF \text{ or } dPLM \text{ or } dLOOMFI \text{ or } dMSIM[p] \text{ or } dLOFLOM[p]) \text{ and } (\text{not } MI\_AdminState[p] = \text{LOCKED}))$ - -NOTE – The state of the determination process of the $C_m$ and its contribution to AIS consequent action are for further study. - -On declaration of $aAIS$ , the function shall output an all-ONEs pattern/signal within two frames. On clearing $aAIS$ , the all-ONEs pattern/signal shall be removed within two frames, with normal data being output. The AIS clock, frame start and multiframe start shall be independent from the incoming clock, frame start and multiframe start. The clock has to be within the ODUk frequency tolerance range as specified in Table 7-2 of [ITU-T G.709] provisioned by the $MI\_Nominal\_Bitrate\_and\_Tolerance[p]$ from a free-running oscillator. Jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCa clock) apply. - -#### Defect correlations - -$cPLM \leftarrow dPLM \text{ and } (\text{not } AI\_TSF)$ - -$cLOOMFI \leftarrow dLOOMFI \text{ and } (\text{not } AI\_TSF)$ - -For each ODUk tributary port #p: - -$cMSIM[p] \leftarrow dMSIM[p] \text{ and } (\text{not } dPLM) \text{ and } (\text{not } dLOOMFI) \text{ and } (\text{not } AI\_TSF)$ - -$cLOFLOM[p] \leftarrow dLOFLOM[p] \text{ and } (\text{not } dPLM) \text{ and } (\text{not } dLOOMFI) \text{ and } (\text{not } AI\_TSF)$ - -**Performance monitoring:** None. - -#### 14.3.17 ODUflexP to FlexE client adaptation function using IMP (ODUflexP/FlexEC\_A) - -The ODUflexP/FlexEC\_A performs the adaptation between the ODUflexP layer adapted information and the characteristic information of the indicated FlexE client signals transported as flexible bit-rate streams. - -The bit rates of FlexEC are 10, 40 and $n \times 25$ Gbit/s ( $n \geq 1$ ) given in Table 14-43 as described in clause 17.11 of [ITU-T G.709]. - -**Table 14-43 – Defined FlexEC for ODUflex clients** - -| FlexEC bit rate | Bit rate | Clock tolerance | -|-----------------|----------------------------------|-----------------| -| 10G | 10 312 500 (kbit/s) | $\pm 100$ ppm | -| 40G | 41 250 000 (kbit/s) | $\pm 100$ ppm | -| $n \times 25G$ | $n \times 25\ 781\ 250$ (kbit/s) | $\pm 100$ ppm | - -##### 14.3.17.1 ODUflexP to FlexE client adaptation source function using IMP (ODUflexP/FlexEC\_A\_So) - -The ODUflexP/FlexEC\_A\_So function creates the ODUflex signal from the FlexE client clock or a local clock. It maps the flexible bit-rate client signal from the FlexEC\_CP into the payload area of the OPUflex using IMP as defined in clause 17.11 of [ITU-T G.709], and adds OPUflex overhead (PT, CSF and RES) and default ODUflex overhead. - -The information flow of the ODUflexP/FlexEC\_A\_So function is defined with reference to Figure 14-95 and the processing of the ODUflexP/FlexEC\_A\_So function is defined with reference to Figure 14-96. - -## Symbol - -![Symbol diagram for the ODUflexP/FlexEC_A_So function. It shows a trapezoidal block labeled 'ODUflexP/FlexEC'. An arrow labeled 'FlexEC_CP' points into the top of the block, and an arrow labeled 'ODUflexP_AP' points out from the bottom. Below the block is the reference code 'G.798(17)_F14-95'.](ac1b4040daa037941f51deeedbcd585a_img.jpg) - -Symbol diagram for the ODUflexP/FlexEC\_A\_So function. It shows a trapezoidal block labeled 'ODUflexP/FlexEC'. An arrow labeled 'FlexEC\_CP' points into the top of the block, and an arrow labeled 'ODUflexP\_AP' points out from the bottom. Below the block is the reference code 'G.798(17)\_F14-95'. - -**Figure 14-95 – ODUflexP/FlexEC\_A\_So function** - -## Interfaces - -**Table 14-44 – ODUflexP/FlexEC\_A\_So inputs and outputs** - -| Input(s) | Output(s) | -|-------------------------------------------------------------------|---------------------------------------------------------------------------------------------| -| FlexEC_CP:
FlexEC_CI_CK
FlexEC_CI_D
FlexEC_CI_SSF | ODUflexP_AP:
ODUflexP_AI_CK
ODUflexP_AI_D
ODUflexP_AI_FS
ODUflexP_AI_MFS | - -## Processes - -**Clock generation:** The function shall generate an ODUflex clock (ODUflexP\_AI\_CK) – according to one of the methods described in clause 12.2.6 of [ITU-T G.709] – with a bit rate as specified in Table 7-2 of [ITU-T G.709]. The clock parameters, including jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (in case of methods 1 and 2 ODCa clock, in case of method 3 ODCb clock), apply. - -**FS & MFS generation:** The function shall generate the (multi)frame start reference signals AI\_FS and AI\_MFS for the ODUflex signal. The AI\_FS signal shall be active once per 122 368 clock cycles. AI\_MFS shall be active once every 256 frames. - -**Bit-rate adaptation, scrambler, mapping and frequency justification:** The function shall provide an elastic store (buffer) process. The data signal of 66b blocks shall be written into the buffer under the control of the associated input clock. The adjusted data signal of 66b blocks shall be read out of the buffer, scrambled and be written onto the OPUflex payload under the control of IMP as defined in clause 17.11 of [ITU-T G.709]. The 66b blocks are aligned so that the first bit of the sync header appears in one of the bit positions 1, 3, 5, or 7 of a byte in the OPUflex payload. *Scrambler:* The function shall scramble 66b block stream after rate adaptation and before mapping into the OPUflex. - -*Buffer size:* In the presence of bit rate differences between OPUflex and FlexEC signals, this mapping process shall not insert or delete a 66b block between a Start (0x78) and Terminate (0x87/0x99/0xAA/0xB4/0xCC/0xD2/0xE1/0xFF) control block. - -**PT:** The function shall insert the payload type code "0001 1101" (0x1D) into the PT byte position of the PSI overhead, as defined in clause 15.9.2.1 of [ITU-T G.709]. - -**Client signal fail:** The function shall signal the failure of the client signal to the far end by use of the Bit 1 of the PSI[2] byte of the payload structure identifier, as defined in clause 17.1 of [ITU-T G.709]. - -**RES:** The function shall insert all-ZEROs into the RES bytes and reserved bits within the JC bytes. - -All other bits of the ODUflex overhead should be sourced as "0"s, except the ODUflex-PM STAT field which should be set to the value "normal path signal" (001). - -![Block diagram of the ODUflexP/FlexEC_A_So function. The diagram shows the internal processing of a FlexE client signal (CI_D, CI_CK, CI_SSF) through rate adaptation, scrambling, and elastic store. The elastic store is controlled by a Justification control (IMP) block. The IMP block also receives inputs from a clock generator (which is fed by a free-running clock generator ODCa) and a frequency synthesizer (1/122368). The output of the elastic store is processed by an Insert PT, Insert CSF, and Insert RES block, and then an ODU OH is set to all-0's, except PM STAT = 001. The final output is AI_D, AI_CK, AI_FS, and AI_MFS. The diagram is labeled FlexEC_CP at the top and ODUflexP_AP at the bottom. A reference G.798(17)-Amd.2(19)_F14-96 is also present.](6f7f18cd6ddcabd5553b75ef3dc97d15_img.jpg) - -Block diagram of the ODUflexP/FlexEC\_A\_So function. The diagram shows the internal processing of a FlexE client signal (CI\_D, CI\_CK, CI\_SSF) through rate adaptation, scrambling, and elastic store. The elastic store is controlled by a Justification control (IMP) block. The IMP block also receives inputs from a clock generator (which is fed by a free-running clock generator ODCa) and a frequency synthesizer (1/122368). The output of the elastic store is processed by an Insert PT, Insert CSF, and Insert RES block, and then an ODU OH is set to all-0's, except PM STAT = 001. The final output is AI\_D, AI\_CK, AI\_FS, and AI\_MFS. The diagram is labeled FlexEC\_CP at the top and ODUflexP\_AP at the bottom. A reference G.798(17)-Amd.2(19)\_F14-96 is also present. - -Figure 14-96 – ODUflexP/FlexEC\_A\_So function - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -#### 14.3.17.2 ODUflexP to FlexE client adaptation sink function using IMP (ODUflexP/FlexEC\_A\_Sk) - -The ODUflexP/FlexEC\_A\_Sk recovers the FlexE client signal from the OPUflex payload using the justification control of IMP. It extracts the OPUflex overhead (PT and CSF) and monitors the reception of the correct payload type. Under signal fail condition, a replacement signal as specified in clause 17.11 of [ITU-T G.709] shall be inserted. - -The information flow and processing of the ODUflexP/FlexEC\_A\_Sk function is defined with reference to Figures 14-97 and 14-98. - -## Symbol - -![Symbol diagram for the ODUflexP/FlexEC_A_Sk function. A central trapezoidal block labeled 'ODUflexP/FlexEC' has three connections: an input arrow from the bottom labeled 'ODUflexP_AP', an output arrow pointing up labeled 'FlexEC_CP', and an output arrow pointing left labeled 'ODUflexP/FlexEC_A_Sk_MP'. A small reference code 'G.798(17)_F14-97' is located below the block.](9707839366bb5cf01a4a5b4abd8c1264_img.jpg) - -Symbol diagram for the ODUflexP/FlexEC\_A\_Sk function. A central trapezoidal block labeled 'ODUflexP/FlexEC' has three connections: an input arrow from the bottom labeled 'ODUflexP\_AP', an output arrow pointing up labeled 'FlexEC\_CP', and an output arrow pointing left labeled 'ODUflexP/FlexEC\_A\_Sk\_MP'. A small reference code 'G.798(17)\_F14-97' is located below the block. - -**Figure 14-97 – ODUflexP/FlexEC\_A\_Sk function** - -## Interfaces - -**Table 14-45 – ODUflexP/FlexEC\_A\_Sk inputs and outputs** - -| Input(s) | Output(s) | -|----------------------------------------------------------------------------------------------------------------|--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| ODUflexP_AP:
ODUflexP_AI_CK
ODUflexP_AI_D
ODUflexP_AI_FS
ODUflexP_AI_MFS
ODUflexP_AI_TSF | FlexEC_CP:
FlexEC_CI_CK
FlexEC_CI_D
FlexEC_CI_SSF
ODUflexP/FlexEC_A_Sk_MP:
ODUflexP/FlexEC_A_Sk_MI_cPLM
ODUflexP/FlexEC_A_Sk_MI_AcPT
ODUflexP/FlexEC_A_Sk_MI_cCSF
ODUflexP/FlexEC_A_Sk_MI_cLCS | - -## Processes - -**PT:** The function shall extract the PT byte from the PSI overhead as defined in clause 8.7.1.1. The accepted PT value is available at the MP (MI\_AcPT) and is used for PLM defect detection. - -**Client signal fail:** The function shall extract the CSF signal indicating the failure of the client signal out of Bit 1 of the PSI[2] byte of the payload structure identifier, as defined in clause 17.1 of [ITU-T G.709]. - -**Demapping:** The function shall extract the client data from the payload bytes in the OPUflex frames. The information extraction of the payload area shall be under the control of IMP. - -**Block synchronization:** See clause 8.2.7.1 for mapping procedures preserving the 2-bit alignment. - -**Descrambler:** The function shall descramble the 66b block stream before the rate adaptation. - -**Rate adaptation and FlexEC clock generation:** The function shall provide an elastic store (buffer) process. It writes the descrambled 66b block data stream into the buffer. The information extraction of the payload area shall be under the control of IMP. The FlexEC data (CI\_D) shall be read out of the buffer under the control of the FlexEC clock (CI\_CK). - -**FlexE client clock generation:** The function shall provide for a FlexEC clock generation process which generates a clock with a bit rate as specified in Table 14-43. - -**Buffer size:** In the presence of bit rate differences between OPUflex and FlexEC signals, this demapping process shall not insert or delete a 66b block between a Start (0x78) and Terminate (0x87/0x99/0xAA/0xB4/0xCC/0xD2/0xE1/0xFF) control block. - -**Replacement signal generation:** The function shall provide for an FlexEC replacement signal and clock generation process that generates a stream of local fault sequence ordered sets as specified in clause 17.11 of [ITU-T G.709] with a bit rate as specified in Table 14-43. - -![Figure 14-98 – ODUflexP/FlexEC_A_Sk processes. This block diagram illustrates the internal architecture of the ODUflexP/FlexEC_A_Sk process. At the bottom, the ODUflexP_AP interface provides inputs AI_D, AI_MFS, AI_CK, AI_FS, and AI_TSF. AI_D and AI_MFS feed into an Elastic store (with WR and RD ports). AI_CK and AI_FS feed into an ETCflex clock generator (IMP) and the Elastic store. AI_TSF feeds into a PT process and Defect correlations. The Elastic store's WR output goes to the IMP and a Block synchronization block. The Block synchronization block outputs dLCS to a Descrambler and the Selector. The Descrambler's output goes to the Selector. The Selector outputs CI_D, CI_CK, and CI_SSF to the FlexEC_CP. The IMP outputs CK to the Descrambler and Defect correlations. The Defect correlations block receives dLCS, dPLM, dCSF, and AI_TSF as inputs and outputs MI_cLCS, MI_cPLM, and MI_cCSF. The Extract CSF block receives AI_D and AI_MFS and outputs dCSF. The Extract PT block receives AI_D and AI_MFS and outputs dPLM. The PT process receives dPLM and AI_TSF and outputs MI_AcPT. The Replacement signal generator receives aAIS from the Consequent actions block and outputs CI_CK to the Selector. The Consequent actions block receives dLCS, dPLM, dCSF, and AI_TSF and outputs aAIS to the Replacement signal generator. The entire process is labeled ODUflexP/FlexEC_A_Sk_MP on the right side.](eb8cac9fb65d601ab50405472e408156_img.jpg) - -Figure 14-98 – ODUflexP/FlexEC\_A\_Sk processes. This block diagram illustrates the internal architecture of the ODUflexP/FlexEC\_A\_Sk process. At the bottom, the ODUflexP\_AP interface provides inputs AI\_D, AI\_MFS, AI\_CK, AI\_FS, and AI\_TSF. AI\_D and AI\_MFS feed into an Elastic store (with WR and RD ports). AI\_CK and AI\_FS feed into an ETCflex clock generator (IMP) and the Elastic store. AI\_TSF feeds into a PT process and Defect correlations. The Elastic store's WR output goes to the IMP and a Block synchronization block. The Block synchronization block outputs dLCS to a Descrambler and the Selector. The Descrambler's output goes to the Selector. The Selector outputs CI\_D, CI\_CK, and CI\_SSF to the FlexEC\_CP. The IMP outputs CK to the Descrambler and Defect correlations. The Defect correlations block receives dLCS, dPLM, dCSF, and AI\_TSF as inputs and outputs MI\_cLCS, MI\_cPLM, and MI\_cCSF. The Extract CSF block receives AI\_D and AI\_MFS and outputs dCSF. The Extract PT block receives AI\_D and AI\_MFS and outputs dPLM. The PT process receives dPLM and AI\_TSF and outputs MI\_AcPT. The Replacement signal generator receives aAIS from the Consequent actions block and outputs CI\_CK to the Selector. The Consequent actions block receives dLCS, dPLM, dCSF, and AI\_TSF and outputs aAIS to the Replacement signal generator. The entire process is labeled ODUflexP/FlexEC\_A\_Sk\_MP on the right side. - -**Figure 14-98 – ODUflexP/FlexEC\_A\_Sk processes** - -### Defects - -The function shall detect dPLM, dCSF and dLCS. - -**dPLM:** See clause 6.2.4.1. The expected payload type is "0001 1101" as defined in clause 15.9.2.1 of [ITU-T G.709]. - -**dCSF:** See clause 6.2.10. - -**dLCS:** See clause 6.2.5.7.1. - -### Consequent actions - -aSSF $\leftarrow$ AI\_TSF or dPLM or dLCS - -aAIS $\leftarrow$ AI\_TSF or dPLM or dLCS - -For FlexE clients, on declaration of aAIS, the function shall output the FlexE client replacement signal within two ODUflex frames. On clearing aAIS, the replacement signal shall be removed within two ODUflex frames and normal data being output. - -## Defect correlations - -cPLM $\leftarrow$ dPLM and (not AI\_TSF) - -cCSF $\leftarrow$ dCSF and (not dPLM) and (not AI\_TSF) - -cLCS $\leftarrow$ dLCS and (not dPLM) and (not AI\_TSF) - -Performance monitoring: None. - -### 14.3.18 ODUflexP to FlexE sub-group adaptation function using BGMP (ODUflexP/FlexESG\_A) - -The ODUflexP/FlexESG\_A performs the adaptation between the ODUflexP layer adapted information and the characteristic information of the FlexE partial rate (sub)group signals (FlexESGM\_CI). - -#### 14.3.18.1 ODUflexP to FlexE sub-group adaptation source function using BGMP (ODUflexP/FlexESG\_A\_So) - -The ODUflexP/FlexESG\_A\_So function creates the ODUflex signal from the FlexE partial rate (sub)group signal clock. It maps the flexible bit-rate client signal from the FlexE partial rate (sub)group into the payload area of the OPUflex using BGMP as defined in clause 17.12 of [ITU-T G.709], and adds OPUflex overhead (PT, PSI, JC and CSF) and default ODUflex overhead. - -The information flow of the ODUflexP/FlexESG\_A\_So function is defined with reference to Figure 14-99 and the processing of the ODUflexP/FlexESG\_A\_So function is defined with reference to Figure 14-100. - -## Symbol - -![Diagram of the ODUflexP/FlexESG_A_So function symbol. The symbol is a trapezoid labeled 'ODUflexP/FlexESG'. It has multiple inputs from the top labeled 'FlexESGM_CPs' with subscripts 1, 2, ..., p. It has one input from the left labeled 'ODUflexP/FlexESG_A_So_MP'. It has one output from the bottom labeled 'ODUflexP_AP'. Below the output label is the text 'G.798(17)-Amd.4(22)_F14-F99'.](ec27906099ab5da32f29b89d2764cf0c_img.jpg) - -Diagram illustrating the ODUflexP/FlexESG\_A\_So function symbol. The symbol is a trapezoid labeled "ODUflexP/FlexESG". Inputs from the top are labeled "FlexESGM\_CPs" with subscripts 1, 2, ..., p. An input from the left is labeled "ODUflexP/FlexESG\_A\_So\_MP". The output from the bottom is labeled "ODUflexP\_AP". Below the output label is the text "G.798(17)-Amd.4(22)\_F14-F99". - -Diagram of the ODUflexP/FlexESG\_A\_So function symbol. The symbol is a trapezoid labeled 'ODUflexP/FlexESG'. It has multiple inputs from the top labeled 'FlexESGM\_CPs' with subscripts 1, 2, ..., p. It has one input from the left labeled 'ODUflexP/FlexESG\_A\_So\_MP'. It has one output from the bottom labeled 'ODUflexP\_AP'. Below the output label is the text 'G.798(17)-Amd.4(22)\_F14-F99'. - -Figure 14-99 – ODUflexP/FlexESG\_A\_So function - -## Interfaces - -**Table 14-46 – ODUflexP/FlexESG\_A\_So inputs and outputs** - -| Input(s) | Output(s) | -|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| p × FlexESGM_CP:
FlexESGM_CI_CK
FlexESGM_CI_D
FlexESGM_CI_FS
FlexESGM_CI_MFS
FlexESGM_CI_CRCerr
FlexESGM_CI_SSF
ODUflexP/FlexESG_A_So_MP:
ODUflexP/FlexESG_A_So_MI_ExGID
ODUflexP/FlexESG_A_So_MI_ExFMAP
ODUflexP/FlexESG_A_So_MI_CS_n[1..p] | ODUflexP_AP:
ODUflexP_AI_CK
ODUflexP_AI_D
ODUflexP_AI_FS
ODUflexP_AI_MFS
ODUflexP/FlexESG_A_So_MP:
ODUflexP/FlexESG_A_Sk_MI_AcGID[1..p]
ODUflexP/FlexESG_A_Sk_MI_AcFMAP[1..p]
ODUflexP/FlexESG_A_Sk_MI_AcIID[1..p]
ODUflexP/FlexESG_A_So_MI_AcCC[1..p]
ODUflexP/FlexESG_A_So_MI_AcCCA[1..p]
ODUflexP/FlexESG_A_So_MI_AcCCB[1..p]
ODUflexP/FlexESG_A_So_MI_cFMM
ODUflexP/FlexESG_A_So_MI_cGIDM
ODUflexP/FlexESG_A_So_MI_cLOL
ODUflexP/FlexESG_A_So_MI_cCSUM | - -## Processes - -**FlexE OH Monitor:** The function shall monitor the overhead of FlexE group interface (GID, PID, MAP and Client Calendar) from each of the p FlexESGM\_CI signals as defined in clause 7.3 of [OIF FlexE IA]. - -- **FlexE GID:** The GID fields shall be read from the FlexE overhead and processed as specified in clause B.2.2.1. The accepted GID values are available at the MP (MI\_AcGID[i]) and are used for dGIDM defect detection. -- **FlexE IID:** The PID fields shall be read from the FlexE overhead and processed as specified in clause B.2.2.2. The accepted IID values are available at the MP (MI\_AcIID[i]) and are used for dFMM defect detection. -- **FlexE MAP:** The FlexE MAP fields shall be read from the FlexE overhead and processed as specified in clause B.2.2.3. The accepted MAP values are available at the MP (MI\_AcFMAP[i]) and are used for dFMM defect detection. - -**Clock generation:** The function shall generate an ODUflex clock (ODUflexP\_AI\_CK) as given in Table 7-2 of [ITU-T G.709] from the incoming client. The clock parameters, including jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCb clock), apply. During failure conditions of an incoming FlexESGM signal (CI\_CK), the ODUflex clock shall stay within its limits as defined in [ITU-T G.8251] and no frame phase discontinuity shall be introduced. - -**FS & MFS generation:** The function shall generate the (multi)frame start reference signals AI\_FS and AI\_MFS for the ODUflex signal. The AI\_FS signal shall be active once per 122 368 clock cycles. AI\_MFS shall be active once every 256 frames. - -**FlexESG Deskew:** The function shall compensate the skew between p FlexESGM signals as described in clause 17.12 of [ITU-T G.709]. The alignment process shall establish the delay compensation, compensating the differential delay between the FlexE Instances as given in clause 6.4 of [OIF FlexE IA]. The compensation between the FlexE Instances is achieved by an elastic store per - -FlexE Instance. Each elastic store shall be capable of compensating at least 300 ns of absolute differential delay between the FlexE Instances. - -**FlexE OH client calendar:** The calendar information shall be read from the calendar configuration in use (C), client calendar A and B, calendar switch request (CR) and calendar switch acknowledge (CA) overheads as defined in clauses 6.4, 7.3.2 and 7.3.4 of [OIF FlexE IA]. - -- *Calendar configuration in use overhead (C):* The "calendar configuration in use" overhead from each member shall be accepted (AcCC[i]) by majority vote of the 3 C overhead bits. Furthermore, it shall confirm the accepted "AcCC" by unanimity of n FlexE Instances of the FlexE group. -- *Client calendar A and B overheads:* The "client calendar A" and "client calendar B" overhead fields from each member shall be read and the calendar slot information shall be accepted in overhead frames with good CRC ( AcCCA[i] and AcCCB[i]). - -**Crunching:** The function shall remove the FlexE (sub)group calendar slots indicated by MI\_CS\_n[1..p] if and only if these calendar slots are marked as unavailable calendar slots in the active FlexE client calendar overhead as described in clause 17.12 of [ITU-T G.709]. - -**Padding:** The function shall add $n_i-1$ padding blocks between the overhead block and the first sub-calendar block in each of the p FlexESGM signals as described in clause 17.12 of [ITU-T G.709]. - -**Interleaving:** The function shall interleave the p crunched and padded FlexESGM signals into a 66b block stream as described in clause 17.12 of [ITU-T G.709]. This 66b block stream is referred to as a FlexE sub-group signal which includes n available calendar slots with $n = n_1 + n_2 + \dots + n_p$ . $n_i$ (i = 1..p) represents the number of FlexE calendar slots that are available (to be transferred). - -**Replacement signal generator:** The function shall provide for a FlexE sub-group replacement signal that generates a stream of local fault sequence ordered sets as specified in clause 17.12 of [ITU-T G.709]. - -**Selector:** The function shall select between the interleaved FlexE sub-group signal and the replacement signal. During a signal fail condition of an incoming FlexESGM signal, it shall select the replacement signal to be mapped into the OPUflex payload as described in clause 17.12 of [ITU-T G.709]. - -**Scrambler:** The function shall scramble the 66b block stream before mapping into the OPUflex as described in clause 17.12 of [ITU-T G.709]. - -**Mapping, frequency justification and bit-rate adaptation:** The function shall provide an elastic store (buffer) process. The scrambled data signal shall be written into the buffer under the control of the associated input clock. The scrambled data shall be read out of the buffer and then be written onto the OPUflex payload under the control of BGMP as defined in clause 17.12 of [ITU-T G.709]. - -*Buffer size:* In the presence of jitter, this mapping process shall not introduce any errors. - -**JC:** The function shall insert the justification control information in the JC bytes (the Cm value and the calculated CRC-8 value), as defined in clause 17.12 of [ITU-T G.709]. - -**PT:** The function shall insert the payload type code "0001 1101" (0x1E) into the PT byte position of the PSI overhead, as defined in clause 15.9.2.1 of [ITU-T G.709]. - -**PSI[3..3+p]:** The function shall insert the values of p, $n_1$ to $n_p$ in the PSI[3] to PSI[3+p] fields, as defined in clause 17.12 of [ITU-T G.709]. - -**Client signal fail:** The function shall signal the failure of the client signal to the far end by use of the Bit 1 of the PSI[2] byte of the payload structure identifier, as defined in clause 17.1 of [ITU-T G.709]. - -**RES:** The function shall insert all-ZEROs into the RES bytes. - -All other bits of the ODUflex overhead should be sourced as "0"s, except the ODUflex-PM STAT field which should be set to the value "normal path signal" (001). - -![Figure 14-100 – ODUflexP/FlexESG_A_So function block diagram. The diagram shows the internal processing of the ODUflexP/FlexESG_A_So function. On the left, multiple FlexESGM_CP inputs (CI_D, CI_CK, CI_FS, CI_MFS, CI_SSF, CI_CRCerr) are processed through 'Extract GID', 'Extract IID', 'Extract MAP', and 'Extract sub-calendar' blocks to produce AcGID, AcIID, AcFMAP, AcCC, AcCCA, and AcCCB signals. These are followed by a 'FlexESG deskew' block. Below that, 'Crunching' and 'Padding' blocks process the signals. A 'Clock generator' provides CK, FS, and MFS signals. The data then goes through 'Interleaving', a 'Selector' (controlled by aAIS), and a 'Scrambler'. The scrambled data is stored in an 'Elastic store' (with WR and RD ports) controlled by a 'Justification control (BGMP)'. The BGMP also controls 'Insert PSI[3..3+p]', 'Insert PT', 'Insert CSF', and 'Insert RES' blocks. A block 'ODU OH is set to all-0's, except PM STAT = 001' is also present. The final output is ODUflexP_AP (AI_D, AI_CK, AI_FS, AI_MFS). On the right, various detection blocks (dGIDM, dFMM, dCSUM) process the signals to generate MI_ExGID, MI_ExFMAP, MI_CS_n[1..p], MI_AcGID[1..p], MI_AcIID[1..p], MI_AcFMAP[1..p], MI_AcCC[1..p], MI_AcCCA[1..p], MI_AcCCB[1..p], MI_cLOL, MI_cFMM, MI_cGIDM, and MI_cCSUM signals. These are then processed by a 'Defect correlations' block and a 'Consequent actions' block. The vertical label on the far right is ODUflexP/FlexESG_A_So_MP. The bottom right corner has the text G.798(17)-Amd.4(22)_F14-100.](32ce3ed5531f18aba05215c8f474bf49_img.jpg) - -Figure 14-100 – ODUflexP/FlexESG\_A\_So function block diagram. The diagram shows the internal processing of the ODUflexP/FlexESG\_A\_So function. On the left, multiple FlexESGM\_CP inputs (CI\_D, CI\_CK, CI\_FS, CI\_MFS, CI\_SSF, CI\_CRCerr) are processed through 'Extract GID', 'Extract IID', 'Extract MAP', and 'Extract sub-calendar' blocks to produce AcGID, AcIID, AcFMAP, AcCC, AcCCA, and AcCCB signals. These are followed by a 'FlexESG deskew' block. Below that, 'Crunching' and 'Padding' blocks process the signals. A 'Clock generator' provides CK, FS, and MFS signals. The data then goes through 'Interleaving', a 'Selector' (controlled by aAIS), and a 'Scrambler'. The scrambled data is stored in an 'Elastic store' (with WR and RD ports) controlled by a 'Justification control (BGMP)'. The BGMP also controls 'Insert PSI[3..3+p]', 'Insert PT', 'Insert CSF', and 'Insert RES' blocks. A block 'ODU OH is set to all-0's, except PM STAT = 001' is also present. The final output is ODUflexP\_AP (AI\_D, AI\_CK, AI\_FS, AI\_MFS). On the right, various detection blocks (dGIDM, dFMM, dCSUM) process the signals to generate MI\_ExGID, MI\_ExFMAP, MI\_CS\_n[1..p], MI\_AcGID[1..p], MI\_AcIID[1..p], MI\_AcFMAP[1..p], MI\_AcCC[1..p], MI\_AcCCA[1..p], MI\_AcCCB[1..p], MI\_cLOL, MI\_cFMM, MI\_cGIDM, and MI\_cCSUM signals. These are then processed by a 'Defect correlations' block and a 'Consequent actions' block. The vertical label on the far right is ODUflexP/FlexESG\_A\_So\_MP. The bottom right corner has the text G.798(17)-Amd.4(22)\_F14-100. - -Figure 14-100 – ODUflexP/FlexESG\_A\_So function - -**Defects:** The function shall detect dFMM, dGIDM, dLOL and dCSUM. - -**dGIDM:** See clause B.1.1.2.1. dGIDM shall be set to false during $\sum CI\_TSF[i]$ . - -**dFMM:** See clause B.1.1.2.2. dFMM shall be set to false during $\sum CI\_TSF[i]$ or dGIDM. - -**dLOL:** If the alignment process, i.e., the FlexESG deskew process, is in the out-of-alignment state, dLOL shall be set to true. dLOL shall be set to false when the alignment process is in the in-multilane-alignment state; dLOL shall be set to false during CI\_SSF or dGIDM or dFMM. - -**dCSUM:** The calendar slot unavailability mismatch defect dCSUM is set "1" if one or more of the calendar slots listed as unavailable in MI\_CS\_n[1..p] are not carrying the value 0xFFFF (i.e., unavailable) within the active accepted Client Calendar overhead in the FlexE (sub)group. Otherwise, dCSUM is set "0". dCSUM shall be set to false during CI\_SSF or dLOL or dGIDM or dFMM. - -dCSUM shall be detected within 100 ms of changes to the active accepted calendar configuration (AcCCA or AcCCB) or the MI\_CS\_n[1..p]. - -**Consequent actions:** - -aAIS $\leftarrow$ dCSUM or dLOL or dFMM or dGIDM or $\sum$ CI\_SSF[i] - -**Defect correlations:** - -cGIDM $\leftarrow$ dGIDM and (not CI\_SSF) - -cFMM $\leftarrow$ dFMM and (not dGIDM) and (not CI\_SSF) - -cLOL $\leftarrow$ dLOL and (not dFMM) and (not dGIDM) and (not CI\_SSF) - -cCSUM $\leftarrow$ dCSUM and (not dLOL) and (not dFMM) and (not dGIDM) and (not CI\_SSF) - -**Performance monitoring:** None. - -**14.3.18.2 ODUflexP to FlexE sub-group adaptation sink function using BGMP (ODUflexP/FlexESG\_A\_Sk)** - -The ODUflexP/FlexESG\_A\_Sk recovers the FlexE partial rate (sub)group signal from the OPUflex payload using the justification control of BGMP. It extracts the OPUflex overhead (PT, CSF, PSI and JC) and monitors the reception of the correct overhead. Under signal fail condition, a replacement signal as specified in clause 17.12 of [ITU-T G.709] shall be inserted. - -The information flow and processing of the ODUflexP/FlexESG\_A\_Sk function is defined with reference to Figures 14-101 and 14-102. - -**Symbol** - -![Diagram of the ODUflexP/FlexESG_A_Sk function symbol. A central trapezoidal block is labeled 'ODUflexP/FlexESG'. An input arrow labeled 'ODUflexP_AP' points into the bottom of the block. An output arrow labeled 'ODUflexP/FlexESG_A_Sk_MP' points out from the left side of the block. Multiple output arrows labeled '1', '2', '...', and 'p' point out from the top of the block. Above these arrows is the label 'FlexESGM_CPs'. Below the diagram is the text 'G.798(17)-Amd.4(22)_F14-F101'.](491e41fb7612d41cb9c24448ce144eda_img.jpg) - -Diagram of the ODUflexP/FlexESG\_A\_Sk function symbol. A central trapezoidal block is labeled 'ODUflexP/FlexESG'. An input arrow labeled 'ODUflexP\_AP' points into the bottom of the block. An output arrow labeled 'ODUflexP/FlexESG\_A\_Sk\_MP' points out from the left side of the block. Multiple output arrows labeled '1', '2', '...', and 'p' point out from the top of the block. Above these arrows is the label 'FlexESGM\_CPs'. Below the diagram is the text 'G.798(17)-Amd.4(22)\_F14-F101'. - -**Figure 14-101 – ODUflexP/FlexESG\_A\_Sk function** - -## Interfaces - -**Table 14-47 – ODUflexP/FlexESG\_A\_Sk inputs and outputs** - -| Input(s) | Output(s) | -|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| ODUflexP_AP:
ODUflexP_AI_CK
ODUflexP_AI_D
ODUflexP_AI_FS
ODUflexP_AI_MFS
ODUflexP_AI_TSF
ODUflexP/FlexESG_A_Sk_MP:
ODUflexP/FlexESG_A_Sk_MI_CS_n[1..p] | p × FlexESGM_CP:
FlexESGM_CI_CK
FlexESGM_CI_D
FlexESGM_CI_FS
FlexESGM_CI_MFS
FlexESGM_CI_SSF
ODUflexP/FlexESG_A_Sk_MP:
ODUflexP/FlexESG_A_Sk_MI_AcPT
ODUflexP/FlexESG_A_Sk_MI_cPLM
ODUflexP/FlexESG_A_Sk_MI_cCSF
ODUflexP/FlexESG_A_Sk_MI_cCSACM
ODUflexP/FlexESG_A_Sk_MI_cLCS
ODUflexP/FlexESG_A_Sk_MI_cLOF
ODUflexP/FlexESG_A_Sk_MI_cLOM | - -## Processes - -**PT:** The function shall extract the PT byte from the PSI overhead as defined in clause 8.7.1.1. The accepted PT value is available at the MP (MI\_AcPT) and is used for PLM defect detection. - -**PSI[3..3+p]:** The function shall extract the PSI[3] to PSI[3+p] bytes from the PSI overhead as defined in clause 17.12 of [ITU-T G.709] and compare the p, n1 to np values in these bytes with the configured values MI\_CS\_n[1..p]. - -**Client signal fail:** The function shall extract the CSF signal indicating the failure of the client signal out of Bit 1 of the PSI[2] byte of the payload structure identifier, as defined in clause 17.1 of [ITU-T G.709]. - -**JC:** The function shall interpret the justification control information in the JC bytes and get the corresponding Cm value (948 or 949), as defined in clause 17.12 of [ITU-T G.709]. - -**Demapping, rate adaptation and FlexESG clock generation:** The function shall provide an elastic store (buffer) process. The data shall be demapped from the payload bytes in the OPUflex frames and then be written into the buffer. The information extraction of the payload area shall be under the control of BGMP with the extracted Cm value. The FlexESG signal data shall be read out of the buffer under the control of the recovered FlexESG clock. - -*Smoothing and jitter limiting process:* The function shall provide for a clock smoothing and elastic store (buffer) process. The data signal shall be written into the buffer under the control of the associated (gapped) input clock. The data signal shall be read out of the buffer under the control of a smoothed (equally spaced) clock at a rate and frequency accuracy determined by the client signal rate at the input of the remote ODUflexP/FlexESG\_A\_So. - -*FlexESG clock generation:* The function shall provide for a FlexESG clock generation process which generates a clock with a FlexESG signal bit rate ( $100\text{GE\_bit\_rate} \times n/20 \text{ kbit/s} \pm 100 \text{ ppm}$ ) as specified in clause 17.12 of [ITU-T G.709] based on the input clock AI\_CK. - -*Buffer size:* In the presence of bit rate differences between OPUflex and FlexE partial rate (sug)group signals, this demapping process shall not introduce any errors. - -**Block Synchronization:** See clause 8.2.7.1 for mapping procedures preserving the 2-bit alignment. - -**Descrambler:** The function shall descramble the 66b block stream from the payload bytes in the OPUflex frames as described in clause 17.12 of [ITU-T G.709]. - -**FlexESG Frame alignment:** The function shall recover the interleaved FlexE sub-group frame start by searching for the $p$ instances of the FlexE overhead block 1 in the FlexESG frame every $1024 \times n \times 8$ blocks as described in clause 17.12 of [ITU-T G.709]. The number of calendar slots interleaved into FlexESG signal $n$ equals the sum $\sum n_i$ where $n_i$ represents the number of calendar slots in the $i^{th}$ FlexE member that are to be transferred. - -NOTE – The FlexE block 1 is encoded as a special ordered set. The sync header is 10, the control block type is 0x4B (ordered set), and the "O" code is 0x5. - -The process has two states, out-of-frame (OOF) and in-frame (IF). The frame alignment start shall be maintained during the OOF state. - -In the OOF state, the frame alignment shall be assumed to be recovered and the IF state shall be entered, when $p$ consecutive valid FlexE blocks 1 are found in two consecutive FlexESG overhead frames. - -In the IF state, OOF shall be entered when the $p$ consecutive FlexE blocks 1 of the FlexESG overhead frame has mismatches on the sync header, control block type or O code fields for 5 occurrences. - -**FlexE Multi-frame alignment:** The function shall recover the common multi-frame start of the $p$ FlexESGM signals by performing multi-frame alignment on the first instance of the FlexE overhead block 1 in the FlexE sub-group frame. See clause B.2.1.2. - -**De-interleaving:** The function shall de-interleave the $p$ FlexESGM signals from the interleaved FlexESG group signal as described in clause 17.12 of [ITU-T G.709]. - -**Depadding:** The function shall delete the $n_i-1$ padding blocks inserted between the overhead block and the first sub-calendar block in the $i^{th}$ FlexESGM signal as described in clause 17.12 of [ITU-T G.709]. - -**FlexE clock generation:** The function shall provide for a FlexESGM clock generation process which generates a clock with a bit rate $(100GE\_rate \times (16k-1)/16k)$ as specified in clause 6.2 of [OIF Flex IA] based on the recovered FlexESG clock "CLK" or the input clock AI\_CK. - -**Decrunching:** The function shall identify the removed unavailable calendar slots and insert them into the $p$ FlexESGM signals as described in clause 17.12 of [ITU-T G.709]. - -**FlexE replacement signal generation:** The function shall provide for a FlexESGM replacement signal and clock generation process that generates a stream of local fault sequence ordered sets as specified in clause 17.12 of [ITU-T G.709]. - -**Selector:** The function shall select the FlexESGM signal or the replacement signal. During a signal fail condition of the incoming ODUflex/OPUflex signal or a CSF condition is present in the OPUflex overhead, it shall select the replacement signal as described in clause 17.12 of [ITU-T G.709]. - -![Block diagram of ODUflexP/FlexESG_A_Sk processes showing signal flow from input (AI_D, AI_CK, AI_FS, AI_MFS, AI_TSF) through various processing stages (Extract JC, Extract PSI, Extract CSF, Extract PT, Elastic store, Block synchronization, Descrambler, FlexESG frame alignment, FlexESG multi-frame alignment, De-interleaving, Depadding, Decrunching, Selector) to output (FlexESGM_CP[1] to FlexESGM_CP[p]).](28583b06f211df822423d245dfad776f_img.jpg) - -The diagram illustrates the ODUflexP/FlexESG\_A\_Sk processes. At the bottom, input signals AI\_D, AI\_CK, AI\_FS, AI\_MFS, and AI\_TSF enter the system. AI\_D, AI\_CK, AI\_FS, and AI\_MFS are processed through 'Extract JC', 'Extract PSI[3..3+p]', 'Extract CSF', and 'Extract PT' blocks. 'Extract JC' feeds into 'Justification control'. 'Extract PSI[3..3+p]' feeds into 'CSACM process'. 'Extract CSF' outputs dCSF. 'Extract PT' feeds into 'PT process'. 'Justification control' feeds into 'Elastic store'. 'Elastic store' has 'WR' (write) and 'RD' (read) ports. 'WR' feeds into 'FlexESG clock generator (BGMP)'. 'RD' feeds into 'Block synchronization'. 'FlexESG clock generator (BGMP)' also receives AI\_CK and AI\_FS. 'Block synchronization' outputs dLCS and CK. 'Block synchronization' feeds into 'Descrambler'. 'Descrambler' outputs D, CK, and BS. 'Descrambler' feeds into 'FlexESG frame alignment'. 'FlexESG frame alignment' outputs D, CK, and BS. 'FlexESG frame alignment' feeds into 'FlexESG multi-frame alignment'. 'FlexESG multi-frame alignment' outputs D, CK, FS, and MFS. 'FlexESG multi-frame alignment' feeds into 'De-interleaving'. 'De-interleaving' feeds into 'Depadding' blocks. 'Depadding' blocks feed into 'Decrunching' blocks. 'Decrunching' blocks feed into a 'Selector'. A 'Replacement signal generator' and 'FlexESGM clock generator' also feed into the 'Selector'. The 'Selector' outputs FlexESGM\_CP[1] to FlexESGM\_CP[p]. On the right side, 'Consequent actions' and 'Defect correlations' blocks receive various signals (dLOM, dLOF, dCSACM, dLCS, dPLM, dCSF, AI\_TSF) and output MI signals: MI\_cLOM, MI\_cLOF, MI\_cCSACM, MI\_cLCS, MI\_cPLM, MI\_cCSF, and MI\_AcPT. The diagram is labeled G.798(17)-Amd.4(22)\_F14-102 and ODUflexP/FlexESG\_A\_Sk\_MP. - -Block diagram of ODUflexP/FlexESG\_A\_Sk processes showing signal flow from input (AI\_D, AI\_CK, AI\_FS, AI\_MFS, AI\_TSF) through various processing stages (Extract JC, Extract PSI, Extract CSF, Extract PT, Elastic store, Block synchronization, Descrambler, FlexESG frame alignment, FlexESG multi-frame alignment, De-interleaving, Depadding, Decrunching, Selector) to output (FlexESGM\_CP[1] to FlexESGM\_CP[p]). - -Figure 14-102 – ODUflexP/FlexESG\_A\_Sk processes - -## Defects - -The function shall detect dPLM, dCSF, dCSACM, dLCS, dLOF and dLOM. - -**dPLM:** See clause 6.2.4.1. The expected payload type is "0001 1110" as defined in clause 15.9.2.1 of [ITU-T G.709]. - -**dCSF:** See clause 6.2.10. - -**dCSACM:** The calendar slot availability count mismatch defect dCSACM is set "1" if the extracted $p$ , $n_1$ to $n_p$ values from the PSI[3] to PSI[3+p] bytes are different from the configured values MI\_CS\_n[1..p]. Otherwise, dCSACM is set "0". - -dCSACM shall be detected within 100 ms of changes to the accepted PSI[3..3+p] or the MI\_CS\_n[1..p] values. - -**dLCS:** See clause 6.2.5.7.1. - -**dLOF:** The loss of the interleaved FlexESG frame defect dLOF is generated based on the state of the FlexESG frame alignment process. If the FlexESG frame alignment process is in the out-of-frame (OOF) state for 3 ms, dLOF shall be declared. To provide for the case of intermittent OOFs, the integrating timer shall not be reset to zero until an in-frame (IF) condition persists continuously for 3 ms. dLOF shall be cleared when the IF state persists continuously for 3 ms. - -**dLOM:** The loss of the interleaved FlexESG multi-frame defect dLOM is generated based on the state of the FlexESG multi-frame alignment process. See clause B.1.1.1.2. - -## Consequent actions - -aSSF $\leftarrow$ AI\_TSF or dPLM or dCSF or dLCS or dLOF or dLOM - -aAIS $\leftarrow$ AI\_TSF or dPLM or dCSF or dLCS or dLOF or dLOM - -For FlexE partial rate (sub)group signal, on declaration of aAIS, the function shall output the FlexESGM replacement signal within X ms. On clearing aAIS, the replacement signal shall be removed within Y ms and normal data being output. The values for X and Y are for further study. The replacement signal clock has to be within the frequency, jitter, and wander tolerance specifications of the FlexE signal. - -## Defect correlations - -cPLM $\leftarrow$ dPLM and (not AI\_TSF) - -cCSF $\leftarrow$ dCSF and (not dPLM) and (not AI\_TSF) - -cCSACM $\leftarrow$ dCSACM and (not dCSF) and (not dPLM) and (not AI\_TSF) - -cLCS $\leftarrow$ dLCS and (not dCSACM) and (not dCSF) and (not dPLM) and (not AI\_TSF) - -cLOF $\leftarrow$ dLOF and (not dLCS) and (not dCSACM) and (not dCSF) and (not dPLM) and (not AI\_TSF) - -cLOM $\leftarrow$ dLOM and (not dLOF) and (not dLCS) and (not dCSACM) and (not dCSF) and (not dPLM) and (not AI\_TSF) - -**Performance monitoring:** None. - -### 14.3.19 ODUkP to MPLS-TP adaptation functions (ODUkP/MT\_A; $k = 0, 1, 2, 3, 4, \text{flex}$ ) - -ODUkP to MPLS-TP adaptation using GFP mapping is given in clause 11.2.1 of [ITU-T G.8121]. - -### 14.3.20 ODUFlexP to ETCy adaptation function using BMP (ODUFlexP/ETCy\_A) - -The ODUFlexP/ETCy\_A performs the adaptation between the ODUFlexP layer adapted information and the characteristic information of the indicated ETCy client signals transported as constant bit-rate streams. - -Parameter 'y' denotes the different ETCy signal and the values of 'y' are given in Table 14-47.1. - -**Table 14-47.1 – Defined values for y for ETCy clients** - -| ETCy | Characteristic information | Bit rate | -|----------|--------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------| -| ETC25GR | Stream of scrambled 64b/66b codewords of the 25GBASE-R PCS, as defined in clauses 49 and 107 of [IEEE 802.3] | $25\ 781\ 250\ \text{kbit/s} \pm 100\ \text{ppm}$ | -| ETC50GR | Stream of scrambled 64b/66b codewords of the 50GBASE-R PCS, as defined in clauses 82 and 133 of [IEEE 802.3] | $51\ 562\ 500\ \text{kbit/s} \pm 100\ \text{ppm}$ | -| ETC200GR | Stream of unscrambled 64b/66b codewords of the 200GBASE-R PCS, as defined in clause 119 of [IEEE 802.3] | $206\ 250\ 000 \times \frac{20479}{20480}\ \text{kbit/s} \pm 100\ \text{ppm}$ | -| ETC400GR | Stream of unscrambled 64b/66b codewords of the 400GBASE-R PCS, as defined in clause 119 of [IEEE 802.3] | $412\ 500\ 000 \times \frac{20479}{20480}\ \text{kbit/s} \pm 100\ \text{ppm}$ | - -The ODUFlexP/ETCy\_A source function always provides BMP mapping. - -#### 14.3.20.1 ODUFlexP to ETCy adaptation source function using BMP (ODUFlexP/ETCy\_A\_So) - -The ODUFlexP/ETCy\_A\_So function creates the ODUFlex signal from ETCy client clock or a local clock. It maps the constant bit-rate client signal from the ETCy\_CP into the payload area of the OPUflex using BMP as defined in clause 17.13 of [ITU-T G.709], and adds OPUflex overhead (PT, CSF and RES) and default ODUFlex overhead. - -The information flow of the ODUFlexP/ETCy\_A\_So function is defined with reference to Figure 14-102.1 and the processing of the ODUFlexP/ETCy\_A\_So function is defined with reference to Figure 14-102.2. - -##### Symbol - -![Diagram of the ODUFlexP/ETCy_A_So function symbol. It shows an input 'ETCy_CP' entering a trapezoidal block labeled 'ODUFlexP/ETCy', which outputs 'ODUFlexP_AP'. Below the diagram is the reference code 'G.798(17)-Amd.1(18)_F14-102.1'.](f96a0911100a9ea2097d9d2e88a9ca3e_img.jpg) - -``` - -graph TD - ETCy_CP[ETCy_CP] --> ODUFlexP_ETCy[ODUFlexP/ETCy] - ODUFlexP_ETCy --> ODUFlexP_AP[ODUFlexP_AP] - -``` - -G.798(17)-Amd.1(18)\_F14-102.1 - -Diagram of the ODUFlexP/ETCy\_A\_So function symbol. It shows an input 'ETCy\_CP' entering a trapezoidal block labeled 'ODUFlexP/ETCy', which outputs 'ODUFlexP\_AP'. Below the diagram is the reference code 'G.798(17)-Amd.1(18)\_F14-102.1'. - -**Figure 14-102.1 – ODUFlexP/ETCy\_A\_So function** - -## Interfaces - -**Table 14-47.2 – ODUflexP/ETCy\_A\_So inputs and outputs** - -| Input(s) | Output(s) | -|----------------------------------------------------------------------------------------------------------------------|---------------------------------------------------------------------------------------------| -| ETCy_CP:
ETCy_CI_CK
ETCy_CI_D
ETCy_CI_AM_SF[2:0] (Note)
ETCy_CI_FEC_DEG (Note)
ETCy_CI_SSF | ODUflexP_AP:
ODUflexP_AI_CK
ODUflexP_AI_D
ODUflexP_AI_FS
ODUflexP_AI_MFS | -| NOTE – The input signal is only used in the case of ETC200GR and ETC400GR supported by a single optical link in OTN. | | - -## Processes - -**Clock generation:** The function shall generate a local ODUflex clock (ODUflexP\_AI\_CK) by multiplying the incoming ETCy clock (CI\_CK) by a factor of 239/238. The clock parameters, including jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCb clock), apply. - -**FS & MFS generation:** The function shall generate the (multi)frame start reference signals AI\_FS and AI\_MFS for the ODUflex signal. The AI\_FS signal shall be active once per 122 368 clock cycles. AI\_MFS shall be active once every 256 frames. - -**Rate compensation:** The function shall include a rate compensation process as specified hereafter: - -- For ETC25GR and ETC50GR, the process shall transparently pass the 64b/66b code blocks at its input to the output. -- For ETC200GR, the process shall compensate the incoming signal by inserting 16 rate compensation (RC) blocks every $(16 \times 20479)$ valid 64b/66b blocks as described in clause 17.3.2 of [ITU-T G.709]. The resulting nominal bit-rate of the rate compensated 64b/66b block stream is $206\,250\,000\text{ kbit/s} \pm 100\text{ ppm}$ . -- For ETC400GR, the process shall compensate the incoming signal by inserting 32 rate compensation (RC) blocks every $(32 \times 20479)$ valid 64b/66b blocks as described in clause 17.3.2 of [ITU-T G.709]. The resulting nominal bit-rate of the rate compensated 64b/66b block stream is $412\,500\,000\text{ kbit/s} \pm 100\text{ ppm}$ . - -### Scrambler: - -- For ETC200GR and ETC400GR, the process shall scramble the rate compensated 64b/66b block stream as described in clause 17.3 of [ITU-T G.709] and in clause 119.2.4.3 of [IEEE 802.3]. -- For ETC25GR and ETC50GR, the process shall transparently pass the scrambled 64b/66b code blocks at its input to the output. - -**Mapping:** The function shall provide an elastic store (buffer) process. The data signal of the scrambled 64b/66b blocks shall be written into the buffer under the control of the associated input clock. The adjusted data signal of 64b/66b blocks shall be read out of the buffer and be written onto the OPUflex payload under the control of BMP as defined in clause 17.13 of [ITU-T G.709]. During writing onto the OPUflex payload, the 64b/66b blocks must begin at bit positions 1, 3, 5, or 7 of a byte in the OPUflex payload, keeping the 2-bit alignment of each 66b block through the mapping process. - -*Buffer size:* In the presence of bit rate differences between OPUflex and ETCy signals, this mapping process shall not introduce any errors. - -**PT:** The function shall insert the payload type code "0011 0000" (0x30 for ETC25GR), "0011 0011" (0x33 for ETC50GR), "0011 0001" (0x31 for ETC200GR) or "0011 0010" (0x32 for ETC400GR) into the PT byte position of the PSI overhead, as defined in clause 15.9.2.1 of [ITU-T G.709]. - -**Client signal fail:** The function shall signal the failure of the client signal to the far end by use of the Bit 1 of the PSI[2] byte of the payload structure identifier, as defined in clause 17.1 of [ITU-T G.709]. - -**CDI:** The function shall insert 3-bit Client Defect Indication in the PSI overhead as defined in clause K.2 of [ITU-T G.709]. Bit 2 of the PSI[2] shall be set to the reserved status information. Bit 3 of the PSI[2] byte shall be set to the Local Degrade status information or'ed with the FEC degraded input. Bit 4 of the PSI[2] byte shall be set to the Remote Degrade status information. - -| | -|--------------------------------------------------------------------------------| -| Bit 2 of the PSI[2] $\leftarrow$ CDI[0] $\leftarrow$ CI_AM_SF[0] | -| Bit 3 of the PSI[2] $\leftarrow$ CDI[1] $\leftarrow$ CI_AM_SF[1] or CI_FEC_DEG | -| Bit 4 of the PSI[2] $\leftarrow$ CDI[2] $\leftarrow$ CI_AM_SF[2] | - -NOTE – This process is only supported in the case of such service carried over a single optical link (supported by one OTSiA trail) in the OTN. - -**RES:** The function shall insert all-ZEROs into the RES bytes and reserved bits within the JC bytes. - -All other bits of the ODUflex overhead should be sourced as "0"s, except the ODUflex-PM STAT field which should be set to the value "normal path signal" (001). - -![Block diagram of the ODUflexP/ETCy_A_So function. The diagram shows the signal flow from ET_Cy_CP inputs (CI_D, CI_CK, CI_AM_SF[2:0], CI_FEC_DEG, CI_SSF) through various processing blocks (Rate compensation, Scrambler, Elastic store, CDI, Insert PT, Insert CSF, Insert RES, ODU OH generation) to ODUflexP_AP outputs (AI_D, AI_CK, AI_FS, AI_MFS). An ODU clock generator locked to ET_Cy clock (ODCb) provides the CK signal. Frequency dividers (1/122368 and 1/256) generate FS and MFS signals from the CK signal.](381b701baf194171a242aa2b1741f4a9_img.jpg) - -``` - -graph TD - subgraph ETCy_CP - CI_D - CI_CK - CI_AM_SF_top[CI_AM_SF[2:0]] - CI_FEC_DEG_top[CI_FEC_DEG] - CI_SSF_top[CI_SSF] - end - - CI_D --> RC[Rate compensation] - CI_CK --> RC - RC --> Scrambler - Scrambler --> ES[Elastic store WR/RD] - - CI_CK --> ODCb[ODU clock generator locked to ETCy clock ODCb] - ODCb --> CK_bus[CK] - CK_bus --> ES - CK_bus --> Div1[1/122368] - Div1 --> FS_bus[FS] - FS_bus --> ES - FS_bus --> Div2[1/256] - Div2 --> MFS_bus[MFS] - - ES --> CDI - CI_AM_SF_top --> CDI - CI_FEC_DEG_top --> CDI - - CDI --> IPT[Insert PT] - IPT --> ICSF[Insert CSF] - CI_SSF_top --> ICSF - ICSF --> IRES[Insert RES] - IRES --> ODUOH[ODU OH is set to all-0s, except PM STAT = 001] - - ODUOH --> AI_D - CK_bus --> AI_CK - FS_bus --> AI_FS - MFS_bus --> AI_MFS - - subgraph ODUflexP_AP - AI_D - AI_CK - AI_FS - AI_MFS - end - -``` - -The diagram illustrates the ODUflexP/ETCy\_A\_So function. At the top, the **ETCy\_CP** section provides inputs: **CI\_D** and **CI\_CK** to a **Rate compensation** block, which then feeds into a **Scrambler**. The **Scrambler** output goes to an **Elastic store** block with **WR** (write) and **RD** (read) ports. The **Elastic store** output is connected to a vertical bus. On this bus, from top to bottom, are blocks for **CDI** (receiving **CI\_AM\_SF[2:0]** and **CI\_FEC\_DEG**), **Insert PT**, **Insert CSF** (receiving **CI\_SSF**), **Insert RES**, and a block stating **ODU OH is set to all-0's, except PM STAT = 001**. The bus then splits into four outputs at the bottom: **AI\_D**, **AI\_CK**, **AI\_FS**, and **AI\_MFS**. A separate path from **CI\_CK** goes to an **ODU clock generator locked to ETCy clock (ODCb)**, which outputs **CK**. This **CK** signal is divided by $\frac{1}{122368}$ to produce **FS**, which is further divided by $\frac{1}{256}$ to produce **MFS**. The **ODUflexP\_AP** label is at the bottom center, and the reference code **G.798(17)-Amd.1(18)\_F14-102.2** is at the bottom right. - -Block diagram of the ODUflexP/ETCy\_A\_So function. The diagram shows the signal flow from ET\_Cy\_CP inputs (CI\_D, CI\_CK, CI\_AM\_SF[2:0], CI\_FEC\_DEG, CI\_SSF) through various processing blocks (Rate compensation, Scrambler, Elastic store, CDI, Insert PT, Insert CSF, Insert RES, ODU OH generation) to ODUflexP\_AP outputs (AI\_D, AI\_CK, AI\_FS, AI\_MFS). An ODU clock generator locked to ET\_Cy clock (ODCb) provides the CK signal. Frequency dividers (1/122368 and 1/256) generate FS and MFS signals from the CK signal. - -**Figure 14-102.2 – ODUflexP/ETCy\_A\_So function** - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -#### 14.3.20.2 ODUflexP to ETCy adaptation sink function using BMP (ODUflexP/ETCy\_A\_Sk) - -The ODUflexP/ETCy\_A\_Sk recovers the ETCy client signal from the OPUflex payload using the justification control of BMP. It extracts the OPUflex overhead (PT and CSF) and monitors the reception of the correct payload type. Under signal fail condition, a replacement signal as specified in clause 17.13 of [ITU-T G.709] shall be inserted. - -The information flow and processing of the ODUflexP/ETCy\_A\_Sk function is defined with reference to Figures 14-102.3 and 14-102.4. - -## Symbol - -![Symbol diagram for ODUflexP/ETCy_A_Sk function. A trapezoidal block labeled 'ODUflexP/ETCy' has an input arrow from the bottom labeled 'ODUflexP_AP'. It has an output arrow pointing up labeled 'ETCy_CP'. It also has a bidirectional arrow on the right labeled 'ODUflexP/ETCy_A_Sk_MP'.](9704c16b28b4ab44f3edc6e729b9a8b4_img.jpg) - -Symbol diagram for ODUflexP/ETCy\_A\_Sk function. A trapezoidal block labeled 'ODUflexP/ETCy' has an input arrow from the bottom labeled 'ODUflexP\_AP'. It has an output arrow pointing up labeled 'ETCy\_CP'. It also has a bidirectional arrow on the right labeled 'ODUflexP/ETCy\_A\_Sk\_MP'. - -G.798(17)-Amd.1(18)\_F14-102.3 - -**Figure 14-102.3 – ODUflexP/ETCy\_A\_Sk function** - -## Interfaces - -**Table 14-47.3 – ODUflexP/ETCy\_A\_Sk inputs and outputs** - -| Input(s) | Output(s) | -|----------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| ODUflexP_AP:
ODUflexP_AI_CK
ODUflexP_AI_D
ODUflexP_AI_FS
ODUflexP_AI_MFS
ODUflexP_AI_TSF
ODUflexP_AI_FEC_DEG (Note) | ETCy_CP:
ETCy_CI_CK
ETCy_CI_D
ETCy_CI_AM_SF[2:0] (Note)
ETCy_CI_SSF
ODUflexP/ETCy_A_Sk_MP:
ODUflexP/ETCy_A_Sk_MI_cPLM
ODUflexP/ETCy_A_Sk_MI_AcPT
ODUflexP/ETCy_A_Sk_MI_cCSF
ODUflexP/ETCy_A_Sk_MI_cLCS
ODUflexP/ETCy_A_Sk_MI_cLRC | - -NOTE – AI\_FEC\_DEG and CI\_AM\_SF signal are only used in the case of ETC200GR and ETC400GR supported by a single optical link in OTN. - -## Processes - -**PT:** The function shall extract the PT byte from the PSI overhead as defined in clause 8.7.1.1. The accepted PT value is available at the MP (MI\_AcPT) and is used for PLM defect detection. - -**Client signal fail:** The function shall extract the CSF signal indicating the failure of the client signal out of Bit 1 of the PSI[2] byte of the payload structure identifier, as defined in clause 17.1 of [ITU-T G.709]. - -**CDI:** The function shall extract 3-bit Client Defect Indication information from the PSI overhead as defined in clause K.2 of [ITU-T G.709]. A new AcCDI value is accepted if a new consistent 3-bit value is received in the CDI field (bits 2, 3 and 4) of the OPU PSI[2] overhead byte in 5 consecutive frames. - -| | -|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| $CI\_AM\_SF[0] \leftarrow AcCDI[0] \text{ and (not aAIS)}$ $CI\_AM\_SF[1] \leftarrow AcCDI[1] \text{ or AI\_FEC\_DEG or aAIS}$ $CI\_AM\_SF[2] \leftarrow AcCDI[2] \text{ and (not aAIS)}$ | -|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| - -NOTE – This process is only supported in the case of such service carried over a single optical link (supported by one OTSiA trail) in the OTN. - -**Demapping and ETcy clock generation:** The function shall provide an elastic store (buffer) process. The data shall be demapped from the payload bytes in the OPUflex frames and then be written into the buffer. The information extraction of the payload area shall be under the control of BMP. The signal data shall be read out of the buffer under the control of the recovered ETcy clock. - -**Smoothing and jitter limiting process:** The function shall provide for a clock smoothing and elastic store (buffer) process. The data signal shall be written into the buffer under the control of the associated (gapped) input clock. The data signal shall be read out of the buffer under the control of a smoothed (equally spaced) clock at a rate and frequency accuracy determined by the client signal rate at the input of the remote ODUflexP/ETcy\_A\_So. - -**ETcy clock generation:** The function shall provide for an ETcy clock generation process which generates a clock with an ETcy signal bit rate (e.g., $25\,781\,250\text{ kbit/s} \pm 100\text{ ppm}$ for ETC25GR, $51\,562\,500\text{ kbit/s} \pm 100\text{ ppm}$ for ETC50GR, $206\,250\,000\text{ kbit/s} \pm 100\text{ ppm}$ for ETC200GR and $412\,500\,000\text{ kbit/s} \pm 100\text{ ppm}$ for ETC400GR) as specified in clause 17.13 of [ITU-T G.709] based on the input clock AI\_CK. - -**Buffer size:** In the presence of bit rate differences between OPUflex and ETcy signals, this demapping process shall not introduce any errors. - -**Block Synchronization:** The function shall recover the 66b block through the 66b block synchronization lock state machine as described in Figure 82-12 of [IEEE 802.3]. The lock process looks for 64 consecutive valid sync headers in the initial data stream to declare lock. A valid sync header is either a 01 or a 10. Once in lock, the lock process looks for 65 invalid sync headers within a 1024 sync window to declare out of lock. An invalid sync header is an 11 or 00. Due to the 66b blocks keep the 2-bit alignment with OPUflex payload boundary during the mapping process, so the slip step of the lock process may be optimized using 2-bit. - -**Descrambler:** - -- For ETC200GR and ETC400GR, the process shall descramble the 66b block stream as described in clause 17.13 of [ITU-T G.709] and in clause 119.2.5.6 of [IEEE 802.3]. -- For ETC25GR and ETC50GR, the process shall transparently pass the scrambled 64b/66b code blocks at its input to the output. - -**Rate compensation:** The function shall include a rate compensation process as specified hereafter: - -- For ETC25GR and ETC50GR signals, the process shall directly pass transparently the input 66b block stream to the output. -- For ETC200GR and ETC400GR signals, RC block alignment and RC block removal processes shall be performed as described in Figure 14-102.5. - -**RC block alignment:** The function shall locate the start of Z consecutive RC blocks as described in clause 17.13.2 of [ITU-T G.709]; $Z = 16$ for ETC200GR and $Z = 32$ for ETC400GR. The process has two states, out-of-alignment (OOA) and in-alignment (IA). In the OOA state, the RC block pattern searched for may be a subset of RC0 and RC1 blocks within the Z consecutive RC blocks, for example a 4-block subset including the RC0/RC1 transition. The IA state shall be entered if this subset is found and confirmed at the next expected position. In the IA state, the Z RC blocks shall be continuously checked at the presumed position for correct RC alignment. The RC pattern checked for shall be the RC0/RC0/RC1/RC1 pattern. The OOA state shall be entered if this subset is not found at the correct position in two or more consecutive periods. The RC block alignment shall be maintained during the OOA state. - -**RC block removal:** The function shall remove all RC blocks from the 64b/66b block stream as described in clause 17.3.2 of [ITU-T G.709]. - -**Replacement signal generation:** The function shall provide for an ETcy replacement signal and clock generation process that generates a stream of local fault sequence ordered sets as specified in clause 17.13 of [ITU-T G.709] with a bit rate as specified in Table 14-47.1. - -**Selector:** The function shall select the demapped ETcy signal or the replacement signal. During a signal fail condition of the incoming ODUflex/OPUflex signal or a CSF condition is present in the OPUflex overhead, it shall select the replacement signal as described in clause 17.13 of [ITU-T G.709]. - -![Block diagram of ODUflexP/ETCy_A_Sk processes showing signal flow from input AI_D to output CI_D through various processing blocks like Elastic store, Descrambler, Rate compensation, Selector, and Consequent actions.](47aaa88afec21e26eb33420078f4936a_img.jpg) - -The diagram illustrates the internal processes of the ODUflexP/ETCy\_A\_Sk function. It is divided into two main functional areas: ODUflexP and ETCy\_A\_Sk\_MP. - -- ODUflexP\_AP (Input Side):** Inputs include AI\_D, AI\_MFS, AI\_CK, AI\_FS, AI\_FEC\_DEG, and AI\_TSF. AI\_D and AI\_MFS are processed through 'Extract CDI', 'Extract CSF', and 'Extract PT' blocks. 'Extract CDI' outputs CDI and AI\_FEC\_DEG to the 'CDI process'. 'Extract CSF' outputs dCSF. 'Extract PT' outputs to the 'PT process', which also receives dPLM and outputs MI\_AcPT. AI\_CK and AI\_FS are inputs to the 'Elastic store' (with WR and RD ports) and the 'Clock generator (BMP)'. AI\_FEC\_DEG and AI\_TSF are inputs to the 'Consequent actions' block. -- ODUflexP/ETCy\_A\_Sk\_MP (Processing Side):** The 'Elastic store' outputs to a 'Block synchronization' block, which outputs dLCS. The 'Block synchronization' block also receives CK from the 'Clock generator (BMP)'. The signal then passes through a 'Descrambler' and a 'Rate compensation' block, which outputs dLRC. The 'Rate compensation' block also receives dLRC from the 'Replacement signal generator'. The signal then enters a 'Selector' block. The 'Selector' block also receives aAIS from the 'Consequent actions' block and outputs CI\_D and CI\_CK. The 'Consequent actions' block receives inputs from 'Defect correlations' (dLRC, dLCS, dCSF, dPLM, AI\_TSF) and outputs CI\_SSF and CI\_AM\_SF[2:0]. The 'Defect correlations' block also receives AM\_SF[2:0] from the 'CDI process' and outputs MI\_cLRC, MI\_cLCS, MI\_cCSF, and MI\_cPLM. The 'Clock generator (BMP)' outputs CK to the 'Elastic store' and 'Block synchronization' block. - -Block diagram of ODUflexP/ETCy\_A\_Sk processes showing signal flow from input AI\_D to output CI\_D through various processing blocks like Elastic store, Descrambler, Rate compensation, Selector, and Consequent actions. - -Figure 14-102.4 – ODUflexP/ETCy\_A\_Sk processes - -![Diagram of the rate compensation process for ETC200GR and ETC400GR. It shows two stacked blocks: 'RC block removal' on top and 'RC block alignment' on the bottom. Inputs D, BS, and CK enter the 'RC block alignment' block from below. An output labeled 'dLRC' exits the 'RC block alignment' block to the right. Arrows indicate signal flow between the blocks and the inputs/outputs. Below the diagram is the text 'G.798(17)-Amd.1(18)_F14-102.5'.](2b817d2912f95cb0ab93ff621a3f0a5b_img.jpg) - -Diagram of the rate compensation process for ETC200GR and ETC400GR. It shows two stacked blocks: 'RC block removal' on top and 'RC block alignment' on the bottom. Inputs D, BS, and CK enter the 'RC block alignment' block from below. An output labeled 'dLRC' exits the 'RC block alignment' block to the right. Arrows indicate signal flow between the blocks and the inputs/outputs. Below the diagram is the text 'G.798(17)-Amd.1(18)\_F14-102.5'. - -**Figure 14-102.5 – Rate compensation process for ETC200GR and ETC400GR** - -## Defects - -The function shall detect dPLM, dCSF, dLCS and dLRC. - -**dPLM:** See clause 6.2.4.1. The expected payload type is "0011 0000" (0x30 for ETC25GR), "0011 0011" (0x33 for ETC50GR), "0011 0001" (0x31 for ETC200GR) or "0011 0010" (0x32 for ETC400GR) as defined in clause 15.9.2.1 of [ITU-T G.709]. - -**dCSF:** See clause 6.2.10. - -**dLCS:** See clause 6.2.5.7.1. - -**dLRC (loss of RC blocks):** The defect dLRC is generated based on the state of the RC block alignment process. If the process is in the out-of-alignment (OOA) state for 3 ms, dLRC shall be declared; dLRC shall be cleared when the IA state persists continuously for 3 ms. - -## Consequent actions - -aSSF $\leftarrow$ AI\_TSF or dPLM or dLCS or dLRC - -aAIS $\leftarrow$ AI\_TSF or dPLM or dLCS or dLRC - -For ETCy clients, on declaration of aAIS, the function shall output the ETCy replacement signal within X ms. On clearing aAIS, the replacement signal shall be removed within Y ms and normal data being output. The values for X and Y are for further study. - -## Defect correlations - -cPLM $\leftarrow$ dPLM and (not AI\_TSF) - -cCSF $\leftarrow$ dCSF and (not dPLM) and (not AI\_TSF) - -cLCS $\leftarrow$ dLCS and (not dPLM) and (not AI\_TSF) - -cLRC $\leftarrow$ dLRC and (not dLCS) and (not dPLM) and (not AI\_TSF) - -**Performance monitoring:** None. - -### **14.3.21 ODUkP to ETH client adaptation function using IMP (ODUkP/ETH-imp\_A; k = 0, 1, 2, 3, 4, flex)** - -The ODUkP/ETH-imp\_A performs the adaptation between the ODUkP layer adapted information and the characteristic information of the ETH client signal. - -### 14.3.21.1 ODUkP to ETH client adaptation source function using IMP (ODUkP/ETH-imp\_A\_So) - -The ODUkP/ETH-imp\_A\_So function creates the ODUk signal from a free running clock. It maps the ETH\_CI information into the payload area of the OPUk using IMP as defined in clause 17.11 of [ITU-T G.709], adds OPUk overhead (RES, PT) and default ODUk overhead. - -The information flow of the ODUkP/ETH-imp\_A\_So function is defined with reference to Figures 14-102.6 and 14-102.7. - -#### Symbol - -![Diagram of the ODUkP/ETH-imp_A_So function symbol. The central block is labeled 'ODUkP/ETH-imp'. Inputs from the top are ETH_TFP and ETH_FP. Inputs from the left are ODUkP/ETH-imp_A_So_MP (bidirectional), ETH_RP, and ETH_TP. The output at the bottom is ODUkP_AP. Outputs to the right are ETHTF_PP and ETHF_PP. A small label G.798(23)_F14-F102.6 is at the bottom right.](236b5a83f488c361479b9b44e462f978_img.jpg) - -Diagram of the ODUkP/ETH-imp\_A\_So function symbol. The central block is labeled 'ODUkP/ETH-imp'. Inputs from the top are ETH\_TFP and ETH\_FP. Inputs from the left are ODUkP/ETH-imp\_A\_So\_MP (bidirectional), ETH\_RP, and ETH\_TP. The output at the bottom is ODUkP\_AP. Outputs to the right are ETHTF\_PP and ETHF\_PP. A small label G.798(23)\_F14-F102.6 is at the bottom right. - -Figure 14-102.6 – ODUkP/ETH-imp\_A\_So function - -#### Interfaces - -Table 14-47.4 – ODUkP/ETH-imp\_A\_So inputs and outputs - -| Input(s) | Output(s) | -|------------------------------------|------------------------------------| -| ETH_TFP: | ODUkP_AP: | -| ETH_CI_D | ODUkP_AI_CK | -| ETH_CI_P | ODUkP_AI_D | -| ETH_CI_DE | ODUkP_AI_FS | -| | ODUkP_AI_MFS | -| ETH_FP: | ETHTF_PP: | -| ETH_CI_D | ETH_PI_D | -| ETH_CI_P | ETH_PI_P | -| ETH_CI_DE | ETH_PI_DE | -| ETH_RP: | ETHF_PP: | -| ETH_RI | ETH_PI_D | -| ETH_TP: | ETH_PI_P | -| ETH_TI_CK | ETH_PI_DE | -| ODUkP/ETH-imp_A_So_MP: | ODUkP/ETH-imp_A_So_MP: | -| ODUkP/ETH-imp_A_So_MI_[IEEE 802.3] | ODUkP/ETH-imp_A_So_MI_[IEEE 802.3] | - -#### Processes - -The processes associated with the ODUkP/ETH-imp\_A\_So function are as depicted in Figure 14-102.7. - -The client-specific processes, and associated MI and PI signals, are defined in clause 9.5 of [ITU-T G.8021]. - -**[IEEE 802.3] processes:** The [IEEE 802.3] processes represent the whole functionality of the PHY above the PMA in the IEEE 802.3 model. This includes the reconciliation sublayer and the process of 64B/66B encoding, as well as MAC FCS generation and frame counting. - -NOTE – This Recommendation defines these processes by reference to [IEEE 802.3] and intentionally does not provide details, as this functionality is well understood from the IEEE work. - -**Clock generation:** The function shall generate an ODUk clock (ODUkP\_AI\_CK) – according to one of the methods described in clause 12.2.6 of [ITU-T G.709] – with a bit rate as specified in Table 7-2 of [ITU-T G.709]. The clock parameters, including jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (in case of methods 1 and 2 ODCa clock, in case of method 3 ODCb clock), apply. - -**FS & MFS generation:** The function shall generate the (multi)frame start reference signals AI\_FS and AI\_MFS for the ODUk signal. The AI\_FS signal shall be active once per 122 368 clock cycles. AI\_MFS shall be active once every 256 frames. - -**Bit-rate adaptation, scrambler, mapping and frequency justification:** The function shall provide an elastic store (buffer) process. The data signal of 66b blocks shall be written into the buffer under the control of the associated input clock. The adjusted data signal of 66b blocks shall be read out of the buffer, scrambled and be written onto the OPUk payload under the control of IMP as defined in clause 17.11 of [ITU-T G.709]. The 66b blocks are aligned so that the first bit of the sync header appears in one of the bit positions 1, 3, 5, or 7 of a byte in the OPUk payload. - -*Scrambler:* The function shall scramble 66b block stream after rate adaptation and before mapping into the OPUk. - -*Rate adaptation:* The mapping process shall not insert or delete a 66b block between a Start (0x78) and Terminate (0x87/0x99/0xAA/0xB4/0xCC/0xD2/0xE1/0xFF) control block. - -**PT:** The function shall insert the payload type code "0001 1101" (0x1D) into the PT byte position of the PSI overhead, as defined in clause 15.9.2.1 of [ITU-T G.709]. - -**Client signal fail:** The function shall signal the failure of the client signal to the far end by use of the Bit 1 of the PSI[2] byte of the payload structure identifier, as defined in clause 17.1 of [ITU-T G.709]. - -**RES:** The function shall insert all-ZEROs into the RES bytes and reserved bits within the JC bytes. - -All other bits of the ODUk overhead should be sourced as "0"s, except the ODUk-PM STAT field which should be set to the value "normal path signal" (001). - -![Figure 14-102.7 – ODUkP/ETH-imp_A_So function block diagram. The diagram shows the internal processing of an ODUkP/ETH-imp_A_So function. At the top, two inputs, ETH_CI (ETH_TP) and ETH_CI (ETH_TFP), enter a 'Client-specific processes' block. This block outputs two signals, ETH_PI (ETH_TF_PP) and ETH_PI (ETHF_PP), to the right. Below the client-specific processes is a yellow '[IEEE 802.3] processes' block, which is connected to an external 'MI_[IEEE 802.3]' interface on the left. This block receives two signals, ETH_RI and ETH_TI_CK, from the right. The output of the [IEEE 802.3] processes goes to a 'Rate adaptation' block, which then feeds into a 'Scrambler' block. The output of the scrambler goes to an 'Elastic store' block, which has 'WR' (write) and 'RD' (read) ports. The 'WR' port is connected to the 'Scrambler' and the 'RD' port is connected to a 'Justification control (IMP)' block. The 'IMP' block also receives 'CK' (clock) from a 'Clock generator' block. The 'Clock generator' is connected to a 'Free-running clock generator (ODCa)' block. The 'IMP' block outputs 'FS' (frame sync) to a '1/122368' divider block, which in turn outputs 'MFS' (multi-frame sync) to a '1/256' divider block. The 'Elastic store' block also outputs 'AI_D' (data) to the bottom. The 'IMP' block outputs 'AI_CK' (clock) to the bottom. The 'IMP' block also outputs 'CI_SSF' (client signal signal fail) to an 'Insert CSF' block. The 'Insert CSF' block outputs 'Insert PT' (payload type) to an 'Insert RES' (residual) block. The 'Insert RES' block outputs 'ODU OH is set to all-0's, except PM STAT = 001' to the bottom. The bottom outputs are labeled AI_D, AI_CK, AI_FS, and AI_MFS. The entire diagram is labeled ODUkP_AP and G.798(23)_F14-102.7.](b49ab452107df6572ea43e1be0912bd0_img.jpg) - -Figure 14-102.7 – ODUkP/ETH-imp\_A\_So function block diagram. The diagram shows the internal processing of an ODUkP/ETH-imp\_A\_So function. At the top, two inputs, ETH\_CI (ETH\_TP) and ETH\_CI (ETH\_TFP), enter a 'Client-specific processes' block. This block outputs two signals, ETH\_PI (ETH\_TF\_PP) and ETH\_PI (ETHF\_PP), to the right. Below the client-specific processes is a yellow '[IEEE 802.3] processes' block, which is connected to an external 'MI\_[IEEE 802.3]' interface on the left. This block receives two signals, ETH\_RI and ETH\_TI\_CK, from the right. The output of the [IEEE 802.3] processes goes to a 'Rate adaptation' block, which then feeds into a 'Scrambler' block. The output of the scrambler goes to an 'Elastic store' block, which has 'WR' (write) and 'RD' (read) ports. The 'WR' port is connected to the 'Scrambler' and the 'RD' port is connected to a 'Justification control (IMP)' block. The 'IMP' block also receives 'CK' (clock) from a 'Clock generator' block. The 'Clock generator' is connected to a 'Free-running clock generator (ODCa)' block. The 'IMP' block outputs 'FS' (frame sync) to a '1/122368' divider block, which in turn outputs 'MFS' (multi-frame sync) to a '1/256' divider block. The 'Elastic store' block also outputs 'AI\_D' (data) to the bottom. The 'IMP' block outputs 'AI\_CK' (clock) to the bottom. The 'IMP' block also outputs 'CI\_SSF' (client signal signal fail) to an 'Insert CSF' block. The 'Insert CSF' block outputs 'Insert PT' (payload type) to an 'Insert RES' (residual) block. The 'Insert RES' block outputs 'ODU OH is set to all-0's, except PM STAT = 001' to the bottom. The bottom outputs are labeled AI\_D, AI\_CK, AI\_FS, and AI\_MFS. The entire diagram is labeled ODUkP\_AP and G.798(23)\_F14-102.7. - -Figure 14-102.7 – ODUkP/ETH-imp\_A\_So function - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -#### 14.3.21.2 ODUkP to ETH-imp client adaptation sink function using IMP (ODUkP/ETH-imp\_A\_Sk) - -The ODUkP/ETH-imp\_A\_Sk extracts ETH\_CI information from the ODUkP payload area using the justification control of IMP, delivering ETH\_CI to ETH\_TFP and ETH\_FP. It extracts the OPUk overhead (PT and RES) and monitors the reception of the correct payload type. - -The information flow and processing of the ODUkP/ETH-imp\_A\_Sk function is defined with reference to Figures 14-102.8 and 14-102.9. - -## Symbol - -![Diagram of the ODUkP/ETH-imp_A_Sk function symbol. The central block is labeled 'ODUkP/ETH-imp'. Inputs from the left are 'ETH_TFP' and 'ETH_PP'. Inputs from the bottom are 'ODUkP_AP'. Outputs to the top are 'ETH_TFP' and 'ETH_PP'. Outputs to the right are 'ODUkP/ETH-imp_A_Sk_MP' and 'ETH_RP'. A reference label 'G.798(23)_F14-F102.8' is at the bottom right.](c6e449481a4deebff8ada290c22a77d9_img.jpg) - -Diagram of the ODUkP/ETH-imp\_A\_Sk function symbol. The central block is labeled 'ODUkP/ETH-imp'. Inputs from the left are 'ETH\_TFP' and 'ETH\_PP'. Inputs from the bottom are 'ODUkP\_AP'. Outputs to the top are 'ETH\_TFP' and 'ETH\_PP'. Outputs to the right are 'ODUkP/ETH-imp\_A\_Sk\_MP' and 'ETH\_RP'. A reference label 'G.798(23)\_F14-F102.8' is at the bottom right. - -Figure 14-102.8 – ODUkP/ETH-imp\_A\_Sk function - -## Interfaces - -Table 14-47.5 – ODUkP/ETH-imp\_A\_Sk inputs and outputs - -| Input(s) | Output(s) | -|----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| ODUkP_AP:
ODUkP_AI_CK
ODUkP_AI_D
ODUkP_AI_FS
ODUkP_AI_MFS
ODUkP_AI_TSF

ETH_TF_PP:
ETH_PI_D
ETH_PI_P
ETH_PI_DE

ETHF_PP:
ETH_PI_D
ETH_PI_P
ETH_PI_DE

ODDUkP/ETH-imp_A_Sk_MP:
ODUkP/ETH-imp_A_Sk_MI_[IEEE 802.3] | ETH_TFP:
ETH_CI_D
ETH_CI_P
ETH_CI_DE
ETH_CI_SSF

ETH_FP:
ETH_CI_D
ETH_CI_P
ETH_CI_DE
ETH_CI_SSF

ETH_RP:
ETH_RI

ODUkP/ETH-imp_A_Sk_MP:
ODUkP/ETH-imp_A_Sk_MI_[IEEE 802.3]
ODUkP/ETH-imp_A_Sk_MI_cPLM
ODUkP/ETH-imp_A_Sk_MI_AcPT
ODUkP/ETH-imp_A_Sk_MI_cCSF
ODUkP/ETH-imp_A_Sk_MI_cLCS | - -## Processes - -**PT:** The function shall extract the PT byte from the PSI overhead as defined in clause 8.7.1.1. The accepted PT value is available at the MP (MI\_AcPT) and is used for PLM defect detection. - -**Client signal fail:** The function shall extract the CSF signal indicating the failure of the client signal out of Bit 1 of the PSI[2] byte of the payload structure identifier, as defined in clause 17.1 of [ITU-T G.709]. - -**Demapping:** The function shall extract the client data from the payload bytes in the OPUk frames. The information extraction of the payload area shall be under the control of IMP. - -**Block Synchronization:** See clause 8.2.7.1 for mapping procedures preserving the 2-bit alignment. - -**Descrambler:** The function shall descramble the 66b block stream before the rate adaptation. - -**Rate adaptation and PCS clock generation:** The function shall provide an elastic store (buffer) process. It writes the descrambled 66b block data stream into the buffer. The information extraction of the payload area shall be under the control of IMP. The client PCS data shall be read out of the buffer under the control of the PCS clock. - -*PCS clock generation:* The function shall provide for a client PCS clock (CK) generation process which generates a clock with a bit rate as specified in Table 14-43. - -*Buffer size:* The demapping process shall not insert or delete a 66b block between a Start (0x78) and Terminate (0x87/0x99/0xAA/0xB4/0xCC/0xD2/0xE1/0xFF) control block. - -**Replacement signal generation:** The function shall provide for a PCS replacement signal and clock generation process that generates a stream of local fault sequence ordered sets as specified in clause 17.11 of [ITU-T G.709] with a bit rate as specified in Table 7-2 of [ITU-T G.709]. - -The client-specific processes, and associated MI and PI signals, are defined in clause 9.5 of [ITU-T G.8021]. - -**[IEEE 802.3] processes:** The [IEEE 802.3] processes represent the whole functionality of the PHY layer above the PMA; this includes 64B/66B decoding and the reconciliation sublayer, as well as the MAC length check, MAC frame check and frame counting. - -NOTE – This Recommendation defines these processes by reference to [IEEE 802.3] and intentionally does not provide details, as this functionality is well understood from the IEEE work. - -![Block diagram of ODUkP/ETH-imp_A_Sk processes showing signal flow from client-specific processes and IEEE 802.3 processes through various adaptation and synchronization stages to output interfaces like ETH_CI and ODUkP/ETH-imp_A_Sk_MP.](5bab55ee2db5fd011c7dc277224026d7_img.jpg) - -The diagram illustrates the internal processes of the ODUkP/ETH-imp\_A\_Sk function. At the top, 'Client-specific processes' receive 'MI signals (See [ITU-T G.8021])' and output 'ETH\_CI (ETH\_TP)', 'ETH\_CI (ETH\_TFP)', 'ETH\_CI\_CLK', and 'ETH\_CI\_SSF'. Below them, '[IEEE 802.3] processes' receive 'MI\_[IEEE 802.3]' and output 'ETH\_PI (ETHHTF\_PP)', 'ETH\_PI (ETHF\_PP)', and 'ETH\_RI'. Both process blocks feed into a 'Selector'. The 'Selector' output goes to 'Rate adaptation' and 'Replacement signal generator'. 'Rate adaptation' feeds into 'Descrambler', which in turn feeds into 'Block synchronization'. 'Block synchronization' feeds into 'Elastic store' (with write 'WR' and read 'RD' ports) and 'PCS clock generator (IMP)'. The 'Elastic store' feeds into 'Extract CSF' (outputting 'dCSF') and 'Extract PT' (outputting 'MI\_AcPT'). 'Extract PT' feeds into 'PT process', which outputs 'dPLM'. All defect signals ('dLCS', 'dPLM', 'dCSF', 'AI\_TSF') are fed into 'Defect correlations', which output 'MI\_cLCS', 'MI\_cPLM', and 'MI\_cCSF'. 'Consequent actions' block receives 'aAIS' from 'Replacement signal generator' and defect signals, outputting 'dLCS', 'dPLM', 'dCSF', and 'AI\_TSF'. The entire internal structure is labeled 'ODUkP/ETH-imp\_A\_Sk\_MP' on the right. External input signals at the bottom are 'AI\_D', 'AI\_MFS', 'AI\_CK', 'AI\_FS', and 'AI\_TSF', collectively labeled 'ODUkP\_AP'. - -Block diagram of ODUkP/ETH-imp\_A\_Sk processes showing signal flow from client-specific processes and IEEE 802.3 processes through various adaptation and synchronization stages to output interfaces like ETH\_CI and ODUkP/ETH-imp\_A\_Sk\_MP. - -Figure 14-102.9 – ODUkP/ETH-imp\_A\_Sk processes - -### Defects - -The function shall detect dPLM, dCSF and dLCS. - -**dPLM:** See clause 6.2.4.1. The expected payload type is "0001 1101" as defined in clause 15.9.2.1 of [ITU-T G.709]. - -**dCSF:** See clause 6.2.10. - -**dLCS:** See clause 6.2.5.7.1. - -The definition of the client related defects used by the ODUkP/ETH-imp\_A\_Sk is outside the scope of this Recommendation. - -### Consequent actions - -aSSF $\leftarrow$ AI\_TSF or dPLM or dLCS - -aAIS $\leftarrow$ AI\_TSF or dPLM or dLCS - -On declaration of aAIS, the function shall output the PCS client replacement signal within two ODUk frames. On clearing aAIS, the replacement signal shall be removed within two ODUk frames and normal data being output. - -### Defect correlations - -cPLM $\leftarrow$ dPLM and (not AI\_TSF) - -cCSF $\leftarrow$ dCSF and (not dPLM) and (not AI\_TSF) - -cLCS $\leftarrow$ dLCS and (not dPLM) and (not AI\_TSF) - -**Performance monitoring:** None. - -## 14.4 COMMS functions - -Two types of COMMS functions are defined for the ODU: the ODUP/COMMS adaptation function (ODUP/COMMS\_A) that provides access to the ODU GCC1/2 overhead at the ODUP access point (ODUP\_AP), and the ODU/COMMS access function (ODU/COMMS\_AC) that provides access to the ODU GCC1/2 at ODU (termination) connection points (ODU\_CP/TCPs), as shown in Figure 14-103. The ODUP/COMMS\_A function supports transport of the COMMS data over an ODUP trail including the trail supervision, while the ODU/COMMS\_AC function supports transport of COMMS data over a ODU subnetwork connection. - -NOTE – COMMS subnetwork connections are independent of TCM subnetwork connections. - -![Figure 14-103 – ODU GCC access. The diagram consists of two parts, (a) and (b). Part (a) shows COMMS (GCC) access at ODUP access points. It features two identical vertical stacks. Each stack has a yellow trapezoidal block labeled 'ODUP/COMMS' at the top, connected to a 'COMMS_CP' line. Below it is a white triangle labeled 'ODUP' connected to an 'ODUP_AP' line. Below that is another white triangle labeled 'ODUP' connected to an 'ODUP_TCP' line. A dashed line labeled 'ODU network connection' connects the two 'ODUP_TCP' lines. A solid line labeled 'COMMS connection' connects the two 'ODUP/COMMS' blocks. Part (b) shows COMMS (GCC) access at ODU connection points. It features two identical yellow pentagonal blocks labeled 'ODU/COMMS' in the center. Each block is connected to an 'ODU_CP' line on its left and right. To the left of the first block is an 'ODU_NC' (dashed line with circles) connected to another 'ODU_CP' line. To the right of the second block is an 'ODU_TCP' line. A solid line labeled 'COMMS connection' connects the two 'ODU/COMMS' blocks. A 'COMMS_CP' line is connected to the top of each 'ODU/COMMS' block. An 'ODUP' triangle is connected to the 'ODU_TCP' line on the right.](539dff67945f344becfdd7bebd3b7d69_img.jpg) - -Figure 14-103 – ODU GCC access. The diagram consists of two parts, (a) and (b). Part (a) shows COMMS (GCC) access at ODUP access points. It features two identical vertical stacks. Each stack has a yellow trapezoidal block labeled 'ODUP/COMMS' at the top, connected to a 'COMMS\_CP' line. Below it is a white triangle labeled 'ODUP' connected to an 'ODUP\_AP' line. Below that is another white triangle labeled 'ODUP' connected to an 'ODUP\_TCP' line. A dashed line labeled 'ODU network connection' connects the two 'ODUP\_TCP' lines. A solid line labeled 'COMMS connection' connects the two 'ODUP/COMMS' blocks. Part (b) shows COMMS (GCC) access at ODU connection points. It features two identical yellow pentagonal blocks labeled 'ODU/COMMS' in the center. Each block is connected to an 'ODU\_CP' line on its left and right. To the left of the first block is an 'ODU\_NC' (dashed line with circles) connected to another 'ODU\_CP' line. To the right of the second block is an 'ODU\_TCP' line. A solid line labeled 'COMMS connection' connects the two 'ODU/COMMS' blocks. A 'COMMS\_CP' line is connected to the top of each 'ODU/COMMS' block. An 'ODUP' triangle is connected to the 'ODU\_TCP' line on the right. - -a) COMMS (GCC) access at ODUP access points - -b) COMMS (GCC) access at ODU connection points - -G.798(17)\_F14-103 - -**Figure 14-103 – ODU GCC access** - -#### 14.4.1 ODUP to COMMS adaptation function (ODUP/COMMS\_A) - -The ODUP to COMMS adaptation functions provide access to the GCC1/2 overhead in the ODU for generic data communication. - -##### 14.4.1.1 ODUP to COMMS adaptation source function (ODUP/COMMS\_A\_So) - -The ODUP/COMMS\_A\_So function maps the generic communication channel data into the ODU GCC1/2 overhead. - -The information flow and processing of the ODUP/COMMS\_A\_So functions is defined with reference to Figures 14-104 and 14-105. - -#### Symbol - -![Figure 14-104 shows two block diagrams for the ODUP/COMMS_A_So function. The left diagram is for ODUkP and the right is for ODUCnP. Both show COMMS_CP and ODUkP/COMMS_A_So_MP as inputs to a trapezoidal block labeled ODUkP/COMMS or ODUCnP/COMMS. The output is ODUkP_AP or ODUCnP_AP, with a label 'k = 0, 1, 2, 2e, 3, 4, flex' between the block and the output. A reference 'G.798(17)_F14-104' is at the bottom right.](e5df094ac4c47bcbef86dece9332a417_img.jpg) - -Figure 14-104 shows two block diagrams for the ODUP/COMMS\_A\_So function. The left diagram is for ODUkP and the right is for ODUCnP. Both show COMMS\_CP and ODUkP/COMMS\_A\_So\_MP as inputs to a trapezoidal block labeled ODUkP/COMMS or ODUCnP/COMMS. The output is ODUkP\_AP or ODUCnP\_AP, with a label 'k = 0, 1, 2, 2e, 3, 4, flex' between the block and the output. A reference 'G.798(17)\_F14-104' is at the bottom right. - -Figure 14-104 – ODUP/COMMS\_A\_So function - -#### Interfaces - -Table 14-48 – ODUP/COMMS\_A\_So inputs and outputs - -| Input(s) | Output(s) | -|---------------------------------------------------------------------------------------------------------------------------------------------|-----------------------------------------------------------------| -| COMMS_CP:
COMMS_CI_D
ODUP_AP:
ODUP_AI_CK
ODUP_AI_FS
ODUP/COMMS_A_So_MP:
ODUP/COMMS_A_So_MI_GCCAccess | COMMS_CP:
COMMS_CI_CK
ODUP_AP:
ODUP_AI_D | - -#### Processes - -The processes associated with the ODUP/COMMS\_A\_So function are as depicted in Figure 14-105. - -**COMMS clock generation:** The function shall generate the COMMS clock (CI\_CK) by dividing the incoming ODUP clock (AI\_CK) by a factor of 7648 if one GCC overhead is accessed, or by a factor of 3824 if both GCC overheads are accessed. - -**Mapping:** Depending on the MI\_GCCAccess configuration, the function shall map the incoming COMMS (CI\_D) data only into GCC1 (MI\_GCCAccess = "GCC1") or only into GCC2 (MI\_GCCAccess = "GCC2") or into both GCC1 and GCC2 overhead (MI\_GCCAccess = "GCC1+GCC2") of the ODU frame. The bit rate of the COMMS data is defined by the outgoing COMMS clock (CI\_CK) and is in the range as given in Table 7-10 of [ITU-T G.709]. - -Table 14-49 – Intentionally left blank - -The insertion of the COMMS data follows the transmission order of the GCC bits and bytes. - -![Figure 14-105: ODUP/COMMS_A_So processes diagram. A grey box labeled 'ODUP_AP' contains two sub-processes: 'Mapping' and 'COMMS clock generation'. Inputs from 'COMMS_CP' include 'CI_D' and 'CI_CK'. Inputs from 'ODUP_AP' include 'AI_FS', 'AI_D', and 'AI_CK'. The 'Mapping' process outputs to 'COMMS_CP' and 'ODUP_AP'. The 'COMMS clock generation' process outputs to 'COMMS_CP' and 'ODUP_AP'. A vertical label on the right is 'ODUP/COMMS_A_So_MP'. A reference 'G.798(17)_F13-105' is at the bottom right.](7ac0d7b4763471d7c6dee8a2ce125b6a_img.jpg) - -Figure 14-105: ODUP/COMMS\_A\_So processes diagram. A grey box labeled 'ODUP\_AP' contains two sub-processes: 'Mapping' and 'COMMS clock generation'. Inputs from 'COMMS\_CP' include 'CI\_D' and 'CI\_CK'. Inputs from 'ODUP\_AP' include 'AI\_FS', 'AI\_D', and 'AI\_CK'. The 'Mapping' process outputs to 'COMMS\_CP' and 'ODUP\_AP'. The 'COMMS clock generation' process outputs to 'COMMS\_CP' and 'ODUP\_AP'. A vertical label on the right is 'ODUP/COMMS\_A\_So\_MP'. A reference 'G.798(17)\_F13-105' is at the bottom right. - -Figure 14-105 – ODUP/COMMS\_A\_So processes - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -**14.4.1.2 ODUP to COMMS adaptation sink function (ODUP/COMMS\_A\_Sk)** - -The ODUP/COMMS\_A\_Sk extracts the COMMS data from the ODU GCC overhead. - -**Symbol** - -The information flow and processing of the ODUP/COMMS\_A\_Sk functions is defined with reference to Figures 14-106 and 14-107. - -![Figure 14-106: ODUP/COMMS_A_Sk function diagram. Two trapezoidal symbols represent the functions. The left symbol is 'ODUPkP/COMMS' with input 'ODUPkP/COMMS_A_Sk_MP' and 'ODUPkP_AP' (labeled k = 0, 1, 2, 2e, 3, 4, flex), and output 'COMMS_CP'. The right symbol is 'ODUCnP/COMMS' with input 'ODUCnP/COMMS_A_Sk_MP' and 'ODUCnP_AP', and output 'COMMS_CP'. A reference 'G.798(17)_F14-106' is at the bottom right.](5aa9a1f9f87b2e03c5a516b13ee62612_img.jpg) - -Figure 14-106: ODUP/COMMS\_A\_Sk function diagram. Two trapezoidal symbols represent the functions. The left symbol is 'ODUPkP/COMMS' with input 'ODUPkP/COMMS\_A\_Sk\_MP' and 'ODUPkP\_AP' (labeled k = 0, 1, 2, 2e, 3, 4, flex), and output 'COMMS\_CP'. The right symbol is 'ODUCnP/COMMS' with input 'ODUCnP/COMMS\_A\_Sk\_MP' and 'ODUCnP\_AP', and output 'COMMS\_CP'. A reference 'G.798(17)\_F14-106' is at the bottom right. - -Figure 14-106 – ODUP/COMMS\_A\_Sk function - -**Interfaces** - -Table 14-50 – ODUP/COMMS\_A\_Sk inputs and outputs - -| Input(s) | Output(s) | -|---------------------------------------------------------------------------------------------------------------------------------------|---------------------------------------------------------------| -| ODUP_AP:
ODUP_AI_CK
ODUP_AI_D
ODUP_AI_FS
ODUP_AI_TSF
ODUP/COMMS_A_Sk_MP:
ODUP/COMMS_A_Sk_MI_GCCAccess | COMMS_CP:
COMMS_CI_CK
COMMS_CI_D
COMMS_CI_SSF | - -## Processes - -The processes associated with the ODUP/COMMS\_A\_Sk function are as depicted in Figure 14-107. - -**COMMS clock generation:** The function shall generate the COMMS clock (CI\_CK) by dividing the incoming ODUP clock (AI\_CK) by a factor of 7648 if one GCC overhead is accessed, or by a factor of 3824 if both GCC overheads are accessed. - -**Demapping:** Depending on the MI\_GCCAccess configuration, the function shall extract the COMMS (CI\_D) data only from GCC1 (MI\_GCCAccess = "GCC1") or only from GCC2 (MI\_GCCAccess = "GCC2") or from both GCC1 and GCC2 overhead (MI\_GCCAccess = "GCC1+GCC2") of the ODU frame. The bit rate of the COMMS data is defined by the outgoing COMMS clock (CI\_CK) and is in the range as given in Table 7-10 of [ITU-T G.709]. - -The extraction of the COMMS data follows the transmission order of the GCC bits and bytes. - -![Figure 14-107 – ODUP/COMMS_A_Sk processes. This block diagram shows the internal components of the ODUP/COMMS_A_Sk function. The main container is labeled 'ODUP_AP' at the bottom and 'COMMS_CP' at the top. Inside, there are two sub-blocks: 'Demapping' on the left and 'COMMS clock generation' on the right. Inputs from the bottom are AI_FS, AI_D, AI_CK, and AI_TSF. AI_CK connects to the clock generation block. AI_D connects to the Demapping block. AI_TSF connects to a label 'aSSF' on the right. AI_FS also connects to the 'aSSF' label. The Demapping block outputs CI_D. The clock generation block outputs CI_CK. A configuration input MI_GCCAccess enters from the right and connects to the Demapping block. A vertical label 'ODUP/COMMS_A_Sk_MP' is on the far right. A reference 'G.798(17)_F13-107' is at the bottom right.](e0eba715b26e99c0beececdd6112ee58_img.jpg) - -Figure 14-107 – ODUP/COMMS\_A\_Sk processes. This block diagram shows the internal components of the ODUP/COMMS\_A\_Sk function. The main container is labeled 'ODUP\_AP' at the bottom and 'COMMS\_CP' at the top. Inside, there are two sub-blocks: 'Demapping' on the left and 'COMMS clock generation' on the right. Inputs from the bottom are AI\_FS, AI\_D, AI\_CK, and AI\_TSF. AI\_CK connects to the clock generation block. AI\_D connects to the Demapping block. AI\_TSF connects to a label 'aSSF' on the right. AI\_FS also connects to the 'aSSF' label. The Demapping block outputs CI\_D. The clock generation block outputs CI\_CK. A configuration input MI\_GCCAccess enters from the right and connects to the Demapping block. A vertical label 'ODUP/COMMS\_A\_Sk\_MP' is on the far right. A reference 'G.798(17)\_F13-107' is at the bottom right. - -Figure 14-107 – ODUP/COMMS\_A\_Sk processes - -**Defects:** None. - -### Consequent actions - -The function shall perform the following consequent action: - -aSSF $\leftarrow$ AI\_TSF - -**Defect correlations:** None. - -**Performance monitoring:** None. - -### 14.4.2 ODU to COMMS access function (ODU/COMMS\_AC) - -The ODU to COMMS access functions provide access to the GCC1/2 overhead in the ODU for generic data communication at ODU\_CPs (including TCPs). As the functions act on the ODU signal that passes through the CP, they are inserted into an expanded ODU\_CP as shown in Figure 14-108. They can be inserted into any ODU\_CP, independently of sink or source processing. A ODU/COMMS\_AC\_Sk and So function can be used at the same CP for extraction of the COMMS data from the GCC and insertion of new COMMS data. - -![Diagram showing the expansion of an ODU CP for COMMS access. A vertical line on the left has two small circles. Dashed lines connect these circles to a diamond-shaped block labeled 'ODU/COMMS'. The top of the block is connected to a terminal labeled 'COMMS_CP'. The bottom of the block is connected to another terminal.](5772ffa3b9089a69e25df5ec289ead55_img.jpg) - -Diagram showing the expansion of an ODU CP for COMMS access. A vertical line on the left has two small circles. Dashed lines connect these circles to a diamond-shaped block labeled 'ODU/COMMS'. The top of the block is connected to a terminal labeled 'COMMS\_CP'. The bottom of the block is connected to another terminal. - -G.798(17)\_F14-108 - -Figure 14-108 – ODU\_CP expansion for COMMS access - -**14.4.2.1 ODU to COMMS access source function (ODU/COMMS\_AC\_So)** - -The ODU/COMMS\_AC\_So function maps the generic communication channel data into the GCC1/2 overhead of the ODU signal that passes through the function. - -The information flow and processing of the ODU/COMMS\_AC\_So functions is defined with reference to Figures 14-109 and 14-110. - -**Symbol** - -![Diagram showing two instances of the ODU/COMMS_AC_So function. The left instance is labeled 'ODUk/COMMS' and has an input 'ODUk_CP' at the top, an input 'ODUk/COMMS_AC_So_MP' on the left, and an output 'COMMS_CP' at the top right. The bottom output is labeled 'ODUk_CP'. Below the block is the text 'k = 0, 1, 2, 2e, 3, 4, flex'. The right instance is labeled 'ODUCn/COMMS' and has an input 'ODUCn_CP' at the top, an input 'ODUCn/COMMS_AC_So_MP' on the left, and an output 'COMMS_CP' at the top right. The bottom output is labeled 'ODUCn_CP'. A reference code 'G.798(17)_F14-109' is at the bottom right.](dfb76390c9b698db558781fdba549ab3_img.jpg) - -Diagram showing two instances of the ODU/COMMS\_AC\_So function. The left instance is labeled 'ODUk/COMMS' and has an input 'ODUk\_CP' at the top, an input 'ODUk/COMMS\_AC\_So\_MP' on the left, and an output 'COMMS\_CP' at the top right. The bottom output is labeled 'ODUk\_CP'. Below the block is the text 'k = 0, 1, 2, 2e, 3, 4, flex'. The right instance is labeled 'ODUCn/COMMS' and has an input 'ODUCn\_CP' at the top, an input 'ODUCn/COMMS\_AC\_So\_MP' on the left, and an output 'COMMS\_CP' at the top right. The bottom output is labeled 'ODUCn\_CP'. A reference code 'G.798(17)\_F14-109' is at the bottom right. - -Figure 14-109 – ODU/COMMS\_AC\_So function - -**Interfaces** - -Table 14-51 – ODU/COMMS\_AC\_So inputs and outputs - -| Input(s) | Output(s) | -|--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------------------------------------------------------------------------| -| COMMS_CP:
COMMS_CI_D
ODU_CP:
ODU_CI_D
ODU_CI_CK
ODU_CI_FS
ODU_CI_MFS
ODU_CI_SSF
ODU_CI_RP
ODU_CI_TSCC
ODU/COMMS_AC_So_MP:
ODU/COMMS_AC_So_MI_GCCAccess | COMMS_CP:
COMMS_CI_CK
ODU_CP:
ODU_CI_D
ODU_CI_CK
ODU_CI_FS
ODU_CI_MFS
ODU_CI_SSF
ODU_CI_RP
ODU_CI_TSCC | - -**Processes** - -The processes associated with the ODU/COMMS\_AC\_So function are as depicted in Figure 14-110. - -**COMMS clock generation:** The function shall generate the COMMS clock (COMMS\_CI\_CK) by dividing the incoming ODU clock (ODU\_CI\_CK) by a factor of 7648 if one GCC overhead is accessed, or by a factor of 3824 if both GCC overheads are accessed. - -**Mapping:** Depending on the MI\_GCCAccess configuration, the function shall map the incoming COMMS (CI\_D) data only into GCC1 (MI\_GCCAccess = "GCC1") or only into GCC2 (MI\_GCCAccess = "GCC2") or into both GCC1 and GCC2 overhead (MI\_GCCAccess = "GCC1+GCC2") of the ODU frame. The bit rate of the COMMS data is defined by the outgoing COMMS clock (CI\_CK) and is in the range as given in Table 7-10 of [ITU-T G.709]. - -The insertion of the COMMS data follows the transmission order of the GCC bits and bytes. - -![Diagram of ODU/COMMS_AC_So processes showing signal flow from ODU_CP to COMMS_CP and back to ODU_CP. It includes blocks for Mapping and COMMS clock generation, with inputs like CI_TSCC, CI_RP, CI_SSF, CI_MFS, CI_FS, CI_CK, and CI_D, and outputs like CI_D and CI_CK. A configuration input MI_GCCAccess is also shown.](81e0bc85cbb6bdb4779d4af6d86e80cd_img.jpg) - -The diagram illustrates the ODU/COMMS\_AC\_So processes. It shows the flow of signals between the ODU\_CP (Optical Data Unit Client Port) and the COMMS\_CP (Communications Client Port). On the left, the ODU\_CP section lists inputs: CI\_TSCC, CI\_RP, CI\_SSF, CI\_MFS, CI\_FS, CI\_CK, and CI\_D. These signals enter a central grey box. Inside, the CI\_D signal is split: one path goes to a 'Mapping' block, and another goes to a 'COMMS clock generation' block. The 'Mapping' block outputs a CI\_D signal to the COMMS\_CP section. The 'COMMS clock generation' block outputs a CI\_CK signal to the COMMS\_CP section. A configuration input MI\_GCCAccess is shown entering the 'COMMS clock generation' block. On the right, the COMMS\_CP section lists outputs: CI\_D and CI\_CK. Below the grey box, the ODU\_CP section lists outputs: CI\_TSCC, CI\_RP, CI\_SSF, CI\_MFS, CI\_FS, CI\_CK, and CI\_D. The diagram is labeled G.798(17)\_F13-110 and ODU/COMMS\_A\_So\_MP. - -Diagram of ODU/COMMS\_AC\_So processes showing signal flow from ODU\_CP to COMMS\_CP and back to ODU\_CP. It includes blocks for Mapping and COMMS clock generation, with inputs like CI\_TSCC, CI\_RP, CI\_SSF, CI\_MFS, CI\_FS, CI\_CK, and CI\_D, and outputs like CI\_D and CI\_CK. A configuration input MI\_GCCAccess is also shown. - -**Figure 14-110 – ODU/COMMS\_AC\_So processes** - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -#### 14.4.2.2 ODU to COMMS access sink function (ODU/COMMS\_AC\_Sk) - -The ODU/COMMS\_AC\_Sk extracts the COMMS data from the ODU GCC overhead. - -The information flow and processing of the ODU/COMMS\_AC\_Sk functions is defined with reference to Figures 14-111 and 14-112. - -## Symbol - -![Figure 14-111 shows two symbols for the ODU/COMMS_AC_Sk function. The left symbol is for ODUk/COMMS, with an input OD uk/COMMS_AC_Sk_MP and an output OD uk_CP. It also has an input OD uk_CP and an output COMMS_CP. The right symbol is for ODUCn/COMMS, with an input ODUCn/COMMS_AC_Sk_MP and an output ODUCn_CP. It also has an input ODUCn_CP and an output COMMS_CP. The parameter k is defined as 0, 1, 2, 2e, 3, 4, flex.](4eab0234f29827bae0c6e71fe650aa63_img.jpg) - -G.798(17)\_F14-111 - -Figure 14-111 shows two symbols for the ODU/COMMS\_AC\_Sk function. The left symbol is for ODUk/COMMS, with an input OD uk/COMMS\_AC\_Sk\_MP and an output OD uk\_CP. It also has an input OD uk\_CP and an output COMMS\_CP. The right symbol is for ODUCn/COMMS, with an input ODUCn/COMMS\_AC\_Sk\_MP and an output ODUCn\_CP. It also has an input ODUCn\_CP and an output COMMS\_CP. The parameter k is defined as 0, 1, 2, 2e, 3, 4, flex. - -**Figure 14-111 – ODU/COMMS\_AC\_Sk function** - -## Interfaces - -**Table 14-52 – ODU/COMMS\_AC\_Sk inputs and outputs** - -| Input(s) | Output(s) | -|----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| ODU_CP:
ODU_CI_CK
ODU_CI_D
ODU_CI_FS
ODU_CI_MFS
ODU_CI_SSF
ODU_CI_RP
ODU_CI_TSCC
ODU/COMMS_AC_Sk_MP:
ODU/COMMS_AC_Sk_MI_GCCAccess
ODU/COMMS_AC_Sk_MI_GCCCont | COMMS_CP:
COMMS_CI_CK
COMMS_CI_D
COMMS_CI_SSF
ODU_CP:
ODU_CI_CK
ODU_CI_D
ODU_CI_FS
ODU_CI_MFS
ODU_CI_SSF
ODU_CI_RP
ODU_CI_TSCC | - -## Processes - -The processes associated with the ODU/COMMS\_AC\_Sk function are as depicted in Figure 14-112. - -**COMMS clock generation:** The function shall generate the COMMS clock (COMMS\_CI\_CK) by dividing the incoming ODU clock (ODU\_CI\_CK) by a factor of 7648 if one GCC overhead is accessed, or by a factor of 3824 if both GCC overheads are accessed. - -**Demapping:** Depending on the MI\_GCCAccess configuration, the function shall extract the COMMS (CI\_D) data only from GCC1 (MI\_GCCAccess = "GCC1") or only from GCC2 (MI\_GCCAccess = "GCC2") or from both GCC1 and GCC2 overhead (MI\_GCCAccess = "GCC1+GCC2") of the ODU frame. The bit rate of the COMMS data is defined by the outgoing COMMS clock (CI\_CK) and is in the range as given in Table 7-10 of [ITU-T G.709]. - -The extraction of the COMMS data follows the transmission order of the GCC bits and bytes. - -![Figure 14-112 – ODU/COMMS_AC_Sk processes. This block diagram shows the internal structure of an ODU/COMMS_AC_Sk_MP. It is divided into two main sections: ODU_CP and COMMS_CP. The ODU_CP section contains a 'Demapping' block that receives inputs from CI_TSCC, CI_RP, CI_SSF, CI_MFS, CI_FS, CI_CK, and CI_D. The COMMS_CP section contains a 'COMMS clock generation' block that receives inputs from CI_D, CI_CK, and CI_SSF. Both blocks are connected to MI_GCCAccess and MI_GCCCont. The diagram is labeled G.798(17)_F13-112.](ad9b0c8d0d3fc421b0dbc2ecc61376f4_img.jpg) - -The diagram illustrates the internal architecture of an ODU/COMMS\_AC\_Sk\_MP. It is split into two primary functional areas: ODU\_CP and COMMS\_CP. The ODU\_CP area includes a 'Demapping' block. The COMMS\_CP area includes a 'COMMS clock generation' block. Various input signals (CI\_TSCC, CI\_RP, CI\_SSF, CI\_MFS, CI\_FS, CI\_CK, CI\_D) are shown entering the system from the top and bottom. Output signals (MI\_GCCAccess, MI\_GCCCont) exit the system to the right. The diagram is identified by the label G.798(17)\_F13-112. - -Figure 14-112 – ODU/COMMS\_AC\_Sk processes. This block diagram shows the internal structure of an ODU/COMMS\_AC\_Sk\_MP. It is divided into two main sections: ODU\_CP and COMMS\_CP. The ODU\_CP section contains a 'Demapping' block that receives inputs from CI\_TSCC, CI\_RP, CI\_SSF, CI\_MFS, CI\_FS, CI\_CK, and CI\_D. The COMMS\_CP section contains a 'COMMS clock generation' block that receives inputs from CI\_D, CI\_CK, and CI\_SSF. Both blocks are connected to MI\_GCCAccess and MI\_GCCCont. The diagram is labeled G.798(17)\_F13-112. - -**Figure 14-112 – ODU/COMMS\_AC\_Sk processes** - -**Defects:** None. - -**Consequent actions** - -The function shall perform the following consequent action: - -$$\text{aSSF} \leftarrow \text{CI\_SSF}$$ - -**Defect correlations:** None. - -**Performance monitoring:** None. - -**14.5 Sub-layer functions** - -**14.5.1 ODU tandem connection sub-layer (ODUT) functions** - -Up to six independent ODUT sub-layers can pass through or can be terminated at an ODU\_CP as defined in [ITU-T G.709]. For an ODUT sub-layer termination, the ODU\_CP is expanded as defined in [ITU-T G.805]. - -The ODUT\_TT, ODUT/ODU\_A and ODUT\_TCMC functions are always combined together and can be located at any ODU\_CP as shown in Figure 14-113. For the location of the ODUTm\_TT function, see Figure 14-119. - -NOTE – In accordance with [ITU-T G.709], nesting and cascading are the default operational configurations. Overlapping is an additional configuration for testing purposes only. Overlapped monitored connections must be operated in a non-intrusive mode in which the maintenance signals ODU-AIS and ODU-LCK are not generated. For the case where one of the endpoints in an overlapping monitored connection is located inside a SNC protected domain while the other endpoint is located outside the protected domain, the SNC protection should be forced to working when the endpoint of the overlapping monitored connection is located on the working connection, and forced to protection when the endpoint is located on the protection connection. - -![Diagram showing the location of ODUT functions (ODUT_TT, ODUT/ODU_A, ODUT_TCMC) for ODUk and ODUCn layers. The diagram is divided into two main sections: the top section for ODUk and the bottom section for ODUCn. Each section shows a central ODUk or ODUCn node connected to various functional blocks representing different layer boundaries and processing points. Labels include ODUkP, ODUkT, ODUkT/ODUk, ODUk_TCMC, ODUk_AP, ODUk_RP, OTUk[V]/ODUk, ODUCnP, ODUCnT, ODUCnT/ODUCn, ODUCn_TCMC, ODUCn_AP, ODUCn_RP, and OTUCn/ODUCn. Arrows indicate the flow of data and control signals between these components.](1a1c6e97fdffe8ffed7b997b7e682d3c_img.jpg) - -The diagram illustrates the functional architecture for ODUk and ODUCn layers, showing the placement of various processing and termination functions. - -**ODUk Layer (Top Section):** - -- A central oval node is labeled **ODUk**. -- Two dashed triangles at the top are labeled **ODUkP**. Arrows point from these triangles to trapezoidal blocks labeled **ODUkT/ODUk**. -- Each **ODUkT/ODUk** block is connected to a rectangular block labeled **ODUk\_TCMC**. -- From each **ODUk\_TCMC** block, an arrow points down to a trapezoidal block labeled **ODUkT**. -- From each **ODUkT** block, an arrow points down to a dashed triangle labeled **OTUk[V]/ODUk**. -- Labels **ODUk\_TCMC**, **ODUk\_AP**, and **ODUk\_RP** are placed near the top **ODUk\_TCMC** block. -- Labels **ODUk\_CP** are placed near the top and bottom of the central **ODUk** oval. -- On the left, a separate structure shows two **ODUkT/ODUk** blocks connected to a central **ODUk\_TCMC** block, with arrows pointing to **ODUkT** blocks and then to a dashed triangle labeled **OTUk[V]/ODUk**. Labels **ODUk\_TCMC**, **ODUk\_AP**, and **ODUk\_RP** are also present here. -- On the right, two dashed triangles labeled **OTUk[V]/ODUk** are shown with dashed arrows pointing to them from the top **ODUkT/ODUk** blocks. - -**ODUCn Layer (Bottom Section):** - -- A central oval node is labeled **ODUCn**. -- Two dashed triangles at the top are labeled **ODUCnP**. Arrows point from these triangles to trapezoidal blocks labeled **ODUCnT/ODUCn**. -- Each **ODUCnT/ODUCn** block is connected to a rectangular block labeled **ODUCn\_TCMC**. -- From each **ODUCn\_TCMC** block, an arrow points down to a trapezoidal block labeled **ODUCnT**. -- From each **ODUCnT** block, an arrow points down to a dashed triangle labeled **OTUCn/ODUCn**. -- Labels **ODUCn\_TCMC**, **ODUCn\_AP**, and **ODUCn\_RP** are placed near the top **ODUCn\_TCMC** block. -- Labels **ODUCn\_CP** are placed near the top and bottom of the central **ODUCn** oval. -- On the right, two dashed triangles labeled **OTUCn/ODUCn** are shown with dashed arrows pointing to them from the top **ODUCnT/ODUCn** blocks. - -Diagram showing the location of ODUT functions (ODUT\_TT, ODUT/ODU\_A, ODUT\_TCMC) for ODUk and ODUCn layers. The diagram is divided into two main sections: the top section for ODUk and the bottom section for ODUCn. Each section shows a central ODUk or ODUCn node connected to various functional blocks representing different layer boundaries and processing points. Labels include ODUkP, ODUkT, ODUkT/ODUk, ODUk\_TCMC, ODUk\_AP, ODUk\_RP, OTUk[V]/ODUk, ODUCnP, ODUCnT, ODUCnT/ODUCn, ODUCn\_TCMC, ODUCn\_AP, ODUCn\_RP, and OTUCn/ODUCn. Arrows indicate the flow of data and control signals between these components. - -G.798(17)\_F14-113 - -**Figure 14-113 – Location of ODUT\_TT, ODUT/ODU\_A and ODUT\_TCMC functions** - -### 14.5.1.1 ODUT trail termination function (ODUT\_TT) - -The ODUT\_TT function terminates a level of tandem connection monitoring (TCM) overhead of the ODU overhead to determine the status of an ODU TCM sub-layer trail. - -Figure 14-114 shows the combination of the unidirectional sink and source functions to form a bidirectional function. - -![Figure 14-114: ODUT_TT function diagram showing two unidirectional functions (ODUKT and ODUCnT) combined into a bidirectional function. Each function has an AP (Access Point) input, a TCP (Tandem Connection Point) output, and a RP (Retrieval Point) input from the opposite direction.](bb0e323a672fa2f89e0132b1db61cfb3_img.jpg) - -The diagram illustrates the ODUT\_TT function as a combination of two unidirectional functions. On the left, the ODUkT function is shown: it has an ODUkT\_AP input at the top, an ODUk\_TCP output at the bottom, and an ODUkT\_RP input from the right. On the right, the ODUCnT function is shown: it has an ODUCnT\_AP input at the top, an ODUCn\_TCP output at the bottom, and an ODUCnT\_RP input from the left. The two functions are connected by their respective RP inputs, forming a bidirectional monitoring path. The reference G.798(17)\_F14-114 is noted at the bottom right. - -Figure 14-114: ODUT\_TT function diagram showing two unidirectional functions (ODUKT and ODUCnT) combined into a bidirectional function. Each function has an AP (Access Point) input, a TCP (Tandem Connection Point) output, and a RP (Retrieval Point) input from the opposite direction. - -Figure 14-114 – ODUT\_TT - -#### 14.5.1.1.1 ODUT trail termination source function (ODUT\_TT\_So) - -The ODUT\_TT\_So function computes the BIP-8[1..n] and adds tandem connection monitoring overhead (TCMOH) – including the TTI, BIP-8[1..n], DMi, i = 1 to 6 bits, BDI and BEI[1..n] signals – in a selected TCMOH field to the ODU signal at its ODUT\_AP if it is OPERATIONAL; otherwise, in TRANSPARENT mode, the TCMOH field signal is passed through transparently. The ODUCn signal has n TCM overhead fields per TCM level; the ODUk signal has one (n = 1) TCM overhead field per TCM level. - -The information flow and processing of the ODUT\_TT\_So function is defined with reference to Figures 14-115 and 14-116. - -#### Symbol - -![Figure 14-115: ODUT_TT_So function diagram showing the source function components. It includes inputs for ODUkT_AP, ODUkT_TT_So_MP, and ODUkT_TT_So_TCMCP, and outputs for ODUk_TCP. The same structure is shown for ODUCnT.](b297f64b2487ded933870098ad287bce_img.jpg) - -The diagram shows the ODUT\_TT\_So function components. On the left, the ODUkT function is shown with an ODUkT\_AP input at the top, an ODUk\_TCP output at the bottom, an ODUkT\_RP input from the right, an ODUkT\_TT\_So\_MP input from the left, and an ODUkT\_TT\_So\_TCMCP input from the left. Below the ODUkT\_TT\_So\_MP input, the parameter k is defined as k = 0, 1, 2, 2e, 3, 4, flex. On the right, the ODUCnT function is shown with similar inputs: ODUCnT\_AP, ODUCn\_TCP, ODUCnT\_RP, ODUCnT\_TT\_So\_MP, and ODUCnT\_TT\_So\_TCMCP. The reference G.798(17)\_F14-115 is noted at the bottom right. - -Figure 14-115: ODUT\_TT\_So function diagram showing the source function components. It includes inputs for ODUkT\_AP, ODUkT\_TT\_So\_MP, and ODUkT\_TT\_So\_TCMCP, and outputs for ODUk\_TCP. The same structure is shown for ODUCnT. - -Figure 14-115 – ODUT\_TT\_So function - -## Interfaces - -**Table 14-53 – ODUT\_TT\_So inputs and outputs** - -| Input(s) | Output(s) | -|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|------------------------------------------------------------------------------------------------| -| ODUT_AP:
ODUT_AI_CK
ODUT_AI_D
ODUT_AI_FS
ODUT_AI_MFS
ODUT_AI_RP
ODUT_AI_TSCC
ODUT_RP:
ODUT_RI_BDI
ODUT_RI_BEI[1..n]
ODUT_RI_BIAE
ODUT_RI_DM
ODUT_TT_So_MP:
ODUT_TT_So_MI_TxTI
ODUT_TT_So_MI_DM_Source
ODUT_TT_So_MI_DMValue
ODUT_TT_So_TCMCP:
ODUT_TT_So_TCMCI_Mode
ODUT_TT_So_TCMCI_Level | ODUTCP:
ODU_CI_CK
ODU_CI_D
ODU_CI_FS
ODU_CI_MFS
ODU_CI_RP
ODU_CI_TSCC | - -## Processes - -The processes associated with the ODUT\_TT\_So function are as depicted in Figure 14-116. - -**Mode:** If the TCMCI\_Mode has the value OPERATIONAL, the following processes shall be performed. If the TCMCI\_Mode has the value TRANSPARENT, all information shall be passed through transparently and the following processes shall not be performed. - -**TCMOH-TTI:** If TCMCI\_Mode is OPERATIONAL, the trail trace identifier is inserted in the TTI byte position of the TCM[TCMCI\_Level] field in the first ODU overhead instance. Its value is derived from reference point ODUT\_TT\_So\_MP. The trail trace format is described in clause 15.2 of [ITU-T G.709]. - -**TCMOH-BDI:** If TCMCI\_Mode is OPERATIONAL, the backward defect indication is inserted in the BDI bit position of the TCM[TCMCI\_Level] field in the first ODU overhead instance. Its value is derived from reference point ODUT\_RP. Upon the declaration/clearing of aBDI at the termination sink function, the trail termination source function shall have inserted/removed the BDI indication within 50 ms. - -**TCMOH-BEI/BIAE:** If TCMCI\_Mode is OPERATIONAL, if RI\_BIAE is true the value "1011" is inserted into the BEI/BIAE bits of the TCM[TCMCI\_Level] field in all ODU overhead instances. If RI\_BIAE is false, the number of errors indicated in RI\_BEI[i] is encoded in the BEI/BIAE bits of the TCM[TCMCI\_Level] field in ODU overhead instance #i. Upon the detection of incoming alignment error or a number of errors at the termination sink function, the trail termination source function shall have inserted the values in the BEI/BIAE bits within 50 ms. - -**TCMOH-BIP-8:** If TCMCI\_Mode is OPERATIONAL, the calculated BIP-8 is inserted into the BIP-8 byte of the TCM[TCMCI\_Level] field. For the BIP-8 calculation, see clause 8.3.4.1. - -**TCMOH-DMti:** If TCMCI\_Mode is OPERATIONAL and if MI\_DM\_Source is false, then the value of the DMti bit is determined by the RI\_DM. If MI\_DM\_Source is true, then the value of the DMti bit is set to MI\_DMValue. - -NOTE – Equipment developed prior to Edition 4.0 of this Recommendation will not support the DMti processing. - -![Figure 14-116 – ODUT_TT_So processes. This block diagram illustrates the processing flow for the ODUT_TT_So function. At the top, the ODUT_AP interface provides inputs: AI_D, AI_CK, AI_FS, AI_MFS, AI_RP, and AI_TSCC. AI_D is connected to a 'Compute BIP-8' block, which outputs BIP-8[1..n]. This output is then processed by an 'Insert BIP-8' block. The 'Insert BIP-8' block is part of a vertical stack of processing blocks: 'Insert BEI/BIAE', 'Insert BDI', 'Process/insert DMti', and 'Insert TTI'. These blocks are influenced by various input signals: RI_BEI[1..n], RI_BIAE, RI_BDI, RI_DM, MI_DM_Source, MI_DMValue, MI_TxTI, TCMCI_Level, and TCMCI_Mode. These inputs are grouped into two main categories: ODUT_RP and ODUT_TT_So_MP. The ODUT_TT_So_MP category includes RI_DM, MI_DM_Source, MI_DMValue, MI_TxTI, TCMCI_Level, and TCMCI_Mode. The output of the 'Insert TTI' block is processed by a 'TCMOH[TCMCI_Level] insertion' block. The final output is the ODU_TCP interface, which provides outputs: CI_D, CI_CK, CI_FS, CI_MFS, CI_RP, and CI_TSCC. The diagram is labeled G.798(17)_F14-116.](ce4432c76d20b370ebecb57e59afc2ee_img.jpg) - -Figure 14-116 – ODUT\_TT\_So processes. This block diagram illustrates the processing flow for the ODUT\_TT\_So function. At the top, the ODUT\_AP interface provides inputs: AI\_D, AI\_CK, AI\_FS, AI\_MFS, AI\_RP, and AI\_TSCC. AI\_D is connected to a 'Compute BIP-8' block, which outputs BIP-8[1..n]. This output is then processed by an 'Insert BIP-8' block. The 'Insert BIP-8' block is part of a vertical stack of processing blocks: 'Insert BEI/BIAE', 'Insert BDI', 'Process/insert DMti', and 'Insert TTI'. These blocks are influenced by various input signals: RI\_BEI[1..n], RI\_BIAE, RI\_BDI, RI\_DM, MI\_DM\_Source, MI\_DMValue, MI\_TxTI, TCMCI\_Level, and TCMCI\_Mode. These inputs are grouped into two main categories: ODUT\_RP and ODUT\_TT\_So\_MP. The ODUT\_TT\_So\_MP category includes RI\_DM, MI\_DM\_Source, MI\_DMValue, MI\_TxTI, TCMCI\_Level, and TCMCI\_Mode. The output of the 'Insert TTI' block is processed by a 'TCMOH[TCMCI\_Level] insertion' block. The final output is the ODU\_TCP interface, which provides outputs: CI\_D, CI\_CK, CI\_FS, CI\_MFS, CI\_RP, and CI\_TSCC. The diagram is labeled G.798(17)\_F14-116. - -Figure 14-116 – ODUT\_TT\_So processes - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -#### 14.5.1.1.2 ODUT trail termination sink function (ODUT\_TT\_Sk) - -The ODUT\_TT\_Sk function reports the state of the ODU monitored tandem connection. It computes the BIP-8[1..n], extracts tandem connection monitoring overhead (TCMOH) – including the TTI, BIP-8[1..n], DMti, BDI and BEI[1..n] signals – in a selected TCMOH field from the ODU signal at its ODU\_TCP, detects for AIS, OCI, LCK, TIM, DEG and BDI defects, counts during one-second periods errors (detected via the BIP-8), counts numbers of frames for delay measurement and defects to feed performance monitoring when it is OPERATIONAL or MONITOR. The ODUCn signal has n TCM overhead fields per TCM level; the ODUk signal has one (n = 1) TCM overhead field per TCM level. - -The information flow and processing of the ODUT\_TT\_Sk function is defined with reference to Figures 14-117 and 14-118. - -## Symbol - -![Figure 14-117 shows two symbols for the ODUT_TT_Sk function. The left symbol is for ODUKT and the right is for ODUCnT. Both are represented by a triangle pointing downwards. Inputs from the bottom are ODUk_TCP (left) and ODUCn_TCP (right). Inputs from the left are ODUkT_TT_Sk_MP (left) and ODUCnT_TT_Sk_MP (right). Inputs from the right are ODUkT_TT_Sk_TCMCP (left) and ODUCnT_TT_Sk_TCMCP (right). Outputs to the top are ODUkT_AP (left) and ODUCnT_AP (right). Outputs to the right are ODUkT_RP (left) and ODUCnT_RP (right). A note 'k = 0, 1, 2, 2e, 3, 4, flex' is present near the left symbol. A reference 'G.798(17)_F14-117' is present near the right symbol.](06ab63c9cae7ba781705155c8911f0b7_img.jpg) - -Figure 14-117 shows two symbols for the ODUT\_TT\_Sk function. The left symbol is for ODUKT and the right is for ODUCnT. Both are represented by a triangle pointing downwards. Inputs from the bottom are ODUk\_TCP (left) and ODUCn\_TCP (right). Inputs from the left are ODUkT\_TT\_Sk\_MP (left) and ODUCnT\_TT\_Sk\_MP (right). Inputs from the right are ODUkT\_TT\_Sk\_TCMCP (left) and ODUCnT\_TT\_Sk\_TCMCP (right). Outputs to the top are ODUkT\_AP (left) and ODUCnT\_AP (right). Outputs to the right are ODUkT\_RP (left) and ODUCnT\_RP (right). A note 'k = 0, 1, 2, 2e, 3, 4, flex' is present near the left symbol. A reference 'G.798(17)\_F14-117' is present near the right symbol. - -Figure 14-117 – ODUT\_TT\_Sk function - -## Interfaces - -Table 14-54 – ODUT\_TT\_Sk inputs and outputs - -| Input(s) | Output(s) | -|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| ODU_TCP:
ODU_CI_CK
ODU_CI_D
ODU_CI_FS
ODU_CI_MFS
ODU_CI_SSF
ODU_CI_RP
ODU_CI_TSCC
ODUT_TT_Sk_MP:
ODUT_TT_Sk_MI_ExSAPI
ODUT_TT_Sk_MI_ExDAPI
ODUT_TT_Sk_MI_GetAcTI
ODUT_TT_Sk_MI_TIMDetMo
ODUT_TT_Sk_MI_TIMActDis
ODUT_TT_Sk_MI_DEGThr
ODUT_TT_Sk_MI_DEGM
ODUT_TT_Sk_MI_1second
ODUT_TT_Sk_MI_DM_Source
ODUT_TT_Sk_MI_DMValue
ODUT_TT_Sk_MI_LTCAct_Enable
ODUT_TT_Sk_TCMCP:
ODUT_TT_Sk_TCMCI_Mode
ODUT_TT_Sk_TCMCI_Level | ODUT_AP:
ODUT_AI_CK
ODUT_AI_D
ODUT_AI_FS
ODUT_AI_MFS
ODUT_AI_TSF
ODUT_AI_TSD
ODUT_AI_AIS
ODUT_AI_RP
ODUT_AI_TSCC
ODUT_RP:
ODUT_RI_BDI
ODUT_RI_BEI[1..n]
ODUT_RI_BIAE
ODUT_RI_DM
ODUT_TT_Sk_MP:
ODUT_TT_Sk_MI_AcTI
ODUT_TT_Sk_MI_cOCI (Note)
ODUT_TT_Sk_MI_cLCK
ODUT_TT_Sk_MI_cLTC
ODUT_TT_Sk_MI_cTIM
ODUT_TT_Sk_MI_cDEG
ODUT_TT_Sk_MI_cBDI
ODUT_TT_Sk_MI_cSSF
ODUT_TT_Sk_MI_pN_EBC
ODUT_TT_Sk_MI_pN_DS
ODUT_TT_Sk_MI_pF_EBC
ODUT_TT_Sk_MI_pF_DS
ODUT_TT_Sk_MI_pBIAE
ODUT_TT_Sk_MI_pIAE
ODUT_TT_Sk_MI_pN_delay | -| NOTE – For ODUKT_TT_Sk only. | | - -## Processes - -The processes associated with the ODUT\_TT\_Sk function are as depicted in Figure 14-118. - -**Mode:** If the TCMCI\_Mode has the value OPERATIONAL or MONITOR, the following processes shall be performed. TCMCI\_Mode OPERATIONAL initiates the consequent actions aAIS, aTSF and aTSD, in case of defects. TCMCI\_Mode MONITOR does not initiate the consequent actions aAIS, aTSF and aTSD in case of defects. If the TCMCI\_Mode has the value TRANSPARENT, all information shall be passed through transparently and the following processes shall not be performed. - -**TCMOH-BIP-8:** If the TCMCI\_Mode has the value OPERATIONAL or MONITOR, the BIP-8[1..n] shall be processed as defined in clause 8.3.4.2. The BIP-8[1..n] is extracted from the BIP-8 byte of the TCM[TCMCI\_Level] fields in the n TCM overhead instances of the ODU signal at the ODU\_TCP. - -**TCMOH-TTI:** If the TCMCI\_Mode has the value OPERATIONAL or MONITOR, the trail trace identifier shall be recovered from the TTI byte position of the TCM[TCMCI\_Level] field in the first ODU overhead instance of the ODU signal at the ODU\_TCP as specified in clause 8.6. The accepted value of the TTI is available at the MP (MI\_AcTI). - -**TCMOH-BDI:** If the TCMCI\_Mode has the value OPERATIONAL or MONITOR, the backward defect indication shall be recovered from the BDI bit position of the TCM[TCMCI\_Level] field in the first ODU overhead instance of the ODU signal at the ODU\_TCP. It shall be used for BDI defect detection. - -**TCMOH-BEI/BIAE:** If the TCMCI\_Mode has the value OPERATIONAL or MONITOR, the BEI[1..n] shall be recovered from the BEI/BIAE bits in the TCM[TCMCI\_Level] field of the n TCM overhead instances in the ODU signal at the ODU\_TCP. It shall be used to determine if a far-end errored block (nF\_B) has occurred. One nF\_B has occurred per BEI/BIAE[i] value between 1 [0001] and 8 [1000]; otherwise, no nF\_B has occurred. The BEI/BIAE information is also used for BIAE defect detection. - -**TCMOH-STAT:** If the TCMCI\_Mode has the value OPERATIONAL or MONITOR, the status information shall be recovered from the STAT bits in the TCM[TCMCI\_Level] field in the first ODU overhead instance of the ODU signal at the ODU\_TCP as defined in clause 8.8 (→ AcSTAT). It shall be used for AIS, OCI, LCK, LTC and IAE defect detection. - -NOTE 2 – During incoming frame jump events of the TCM-Trail, transient defects may trigger cases where wrong bytes are read and accepted under particular conditions for STAT byte processing. These wrong bytes may lead to transient consequent actions which are neither visible in alarming (due to F4 filtering) nor in performance monitoring (due to the use of the IAE defect to suppress wrong PM data (EBC and DS)). Such possible transient consequent action could also lead to cases where a high number of subsequent NEs could be affected by the frame jump in such TCM trails (for example triggering a protection switch). The classical defined means to overcome such switch on transient defect conditions is the use of an appropriate hold-off time. - -**TCMOH-DMti:** If the TCMCI\_Mode has the value OPERATIONAL and if MI\_DM\_Source is false then the value of the incoming DMti bit (RxDMti) is output to RI\_DM. If MI\_DM\_Source is true and MI\_DMValue toggles, then a count of CI\_FS transitions is started and the RxDMti value is monitored. A change of value of RxDMti, from (NOT MI\_DMValue) to MI\_DMValue, validated by a 3 frame persistency check, stops the counting. The delay frame count (nN\_delay) is represented by the count minus the persistency check. - -NOTE 3 – Equipment developed prior to Edition 4.0 of this Recommendation will not support DMti processing. - -![Figure 14-118 – ODUT_TT_Sk processes. This is a complex block diagram showing the internal processes of an ODUT_TT_Sk. At the top, the 'ODUT_AP' layer has inputs AI_TSCC, AI_RP, AI_TSD, AI_TSF, AI_AIS, AI_MFS, AI_FS, AI_CK, and AI_D. Below this is the 'ODUT_TT_Sk_MP' layer containing several functional blocks: 'Process TTI' (handling MI_TTIMActDis, MI_ExSAPI, MI_ExDAPI, MI_TIMDetMo, MI_GetAcTI, MI_AcTI, dTIM, RxTI), 'Defect correlation' (handling MI_cTIM, MI_cDEG, MI_cBDI, MI_cLTC, MI_cLCK, MI_cOCI, MI_cSSF, dTIM, dDEG, dBDCI, dLTC, dLCK, dOCI, dAIS, CI_SSF), 'Process DMti' (handling MI_DM_Source, MI_DMValue, nN_delay, RxDMti), 'Performance monitoring' (handling MI_pN_Delay, MI_1second, MI_pF_DS, MI_pBIAE, MI_pF_EBC, aTSF, dIAE, nN_B), 'Process errors' (handling MI_DEGThr, MI_DEGM, dDEG), 'Extract TTI', 'Extract STAT', 'Extract DMti', 'Extract BDI', 'Extract BEI/BIAE', 'Extract BIP-8', and 'Compute BIP-8'. A central 'Consequent actions' block receives inputs from various processes and outputs aTSD, aTSF, aAIS, dDEG, dLCK, dOCI, dAIS, dIAE, dLTC, and CI_SSF. A vertical 'TCM[TCMCI_Level] OH access' block on the right interacts with 'Extract STAT', 'Extract DMti', 'Extract BDI', 'Extract BEI/BIAE', and 'Compute BIP-8'. At the bottom, the 'ODU_TCP' layer has inputs CI_TSCC, CI_RP, CI_SSF, CI_MFS, CI_FS, CI_CK, and CI_D. Various signals like nBIPV[1..n], RxDMti, dBDI, dBIAE, nF_B, nN_B, and nN_delay are shown between blocks. External interfaces on the left are labeled ODUT_RP and ODUT_TT_Sk_MP, and on the right are ODUT_TT_Sk_TCMCP and TCMCI_Mode/Level.](793b6344c79e3e858d29ef190b2c014f_img.jpg) - -Figure 14-118 – ODUT\_TT\_Sk processes. This is a complex block diagram showing the internal processes of an ODUT\_TT\_Sk. At the top, the 'ODUT\_AP' layer has inputs AI\_TSCC, AI\_RP, AI\_TSD, AI\_TSF, AI\_AIS, AI\_MFS, AI\_FS, AI\_CK, and AI\_D. Below this is the 'ODUT\_TT\_Sk\_MP' layer containing several functional blocks: 'Process TTI' (handling MI\_TTIMActDis, MI\_ExSAPI, MI\_ExDAPI, MI\_TIMDetMo, MI\_GetAcTI, MI\_AcTI, dTIM, RxTI), 'Defect correlation' (handling MI\_cTIM, MI\_cDEG, MI\_cBDI, MI\_cLTC, MI\_cLCK, MI\_cOCI, MI\_cSSF, dTIM, dDEG, dBDCI, dLTC, dLCK, dOCI, dAIS, CI\_SSF), 'Process DMti' (handling MI\_DM\_Source, MI\_DMValue, nN\_delay, RxDMti), 'Performance monitoring' (handling MI\_pN\_Delay, MI\_1second, MI\_pF\_DS, MI\_pBIAE, MI\_pF\_EBC, aTSF, dIAE, nN\_B), 'Process errors' (handling MI\_DEGThr, MI\_DEGM, dDEG), 'Extract TTI', 'Extract STAT', 'Extract DMti', 'Extract BDI', 'Extract BEI/BIAE', 'Extract BIP-8', and 'Compute BIP-8'. A central 'Consequent actions' block receives inputs from various processes and outputs aTSD, aTSF, aAIS, dDEG, dLCK, dOCI, dAIS, dIAE, dLTC, and CI\_SSF. A vertical 'TCM[TCMCI\_Level] OH access' block on the right interacts with 'Extract STAT', 'Extract DMti', 'Extract BDI', 'Extract BEI/BIAE', and 'Compute BIP-8'. At the bottom, the 'ODU\_TCP' layer has inputs CI\_TSCC, CI\_RP, CI\_SSF, CI\_MFS, CI\_FS, CI\_CK, and CI\_D. Various signals like nBIPV[1..n], RxDMti, dBDI, dBIAE, nF\_B, nN\_B, and nN\_delay are shown between blocks. External interfaces on the left are labeled ODUT\_RP and ODUT\_TT\_Sk\_MP, and on the right are ODUT\_TT\_Sk\_TCMCP and TCMCI\_Mode/Level. - -Figure 14-118 – ODUT\_TT\_Sk processes - -### Defects - -If the TCMCI\_Mode has the value OPERATIONAL or MONITOR, the function shall detect dLTC, dAIS, dOCI, dLCK, dTIM, dDEG, dIAE, dBIAE and dBDCI defects. If the TCMCI\_Mode is TRANSPARENT, all defects are cleared. - -**dLTC:** See clause 6.2.1.5.1; dLTC shall be set to false during CI\_SSF. - -**dAIS:** See clause 6.2.6.3.2. - -**dOCI:** For ODUk, see clause 6.2.6.8.2; dOCI shall be set to false during CI\_SSF. For ODUCn dOCI shall be assumed false. - -**dLCK:** See clause 6.2.6.9.1; dLCK shall be set to false during CI\_SSF. - -**dTIM:** See clause 6.2.2.1; dTIM shall be set to false during CI\_SSF and dAIS. - -**dDEG:** See clause 6.2.3.4. - -NOTE 4 – IAE suppresses the one-second near-end errored block count, which is the input for the dDEG detection. This avoids wrong dDEG declaration due to alignment errors already incoming in an OTUk trail. - -**dBIDI:** See clause 6.2.6.6.1; dBIDI shall be set to false during CI\_SSF and dAIS. - -**dIAE:** See clause 6.2.6.10.2; dIAE shall be set to false during CI\_SSF, dAIS and dTIM. - -**dBIAE:** See clause 6.2.6.11.1; dBIAE shall be set to false during CI\_SSF, dAIS and dTIM. - -### Consequent actions - -The function shall perform the following consequent actions (see clause 6.3 of [ITU-T G.806]): - -aBDI        ←        (CI\_SSF or dAIS or dLTC or dOCI or dLCK or dTIM) and TCMCI\_Mode -                          ≠ TRANSPARENT - -aBIAE      ←        dIAE and TCMCI\_Mode ≠ TRANSPARENT - -aTSF        ←        CI\_SSF or ((dAIS or (dLTC and LTCAct\_Enable) or dOCI or dLCK or (dTIM -                          and (not TIMActDis)))) and TCMCI\_Mode == OPERATIONAL - -aTSD        ←        dDEG and TCMCI\_Mode == OPERATIONAL - -aAIS        ←        (dOCI or (dLTC and LTCAct\_Enable) or dLCK or (dTIM and -                          (not TIMActDis))) and TCMCI\_Mode == OPERATIONAL - -For each TCM[TCMCI\_Level] overhead instance #i: - -aBEI[i]      ←        nBIPV[i] and TCMCI\_Mode ≠ TRANSPARENT - -NOTE 5 – Equipment prior to Edition 4.2 of this Recommendation will not execute aAIS consequent action in the case of dLTC. - -NOTE 6 – The default value for MI\_LTCAct\_Enable is to be set to "false" to ensure that an upgrade in the network does not cause unexpected traffic affecting consequent action execution in existing network implementations. - -### Defect correlations - -The function shall perform the following defect correlations to determine the most probable fault cause (see clause 6.4 of [ITU-T G.806]). This fault cause shall be reported to the EMF. - -cSSF        ←        CI\_SSF or dAIS - -cLTC        ←        dLTC and (not CI\_SSF) - -cOCI        ←        dOCI and (not CI\_SSF) - -cLCK        ←        dLCK and (not CI\_SSF) - -cTIM        ←        dTIM and (not CI\_SSF) and (not dAIS) and (not dLTC) and (not dOCI) and -                          (not dLCK) - -cDEG        ←        dDEG and (not CI\_SSF) and (not dAIS) and (not dLTC) and (not dOCI) and -                          (not dLCK) and (not (dTIM and (not TIMActDis)))) - -cBDI        ←        dBIDI and (not CI\_SSF) and (not dAIS) and (not dLTC) and (not dOCI) and -                          (not dLCK) and (not (dTIM and (not TIMActDis)))) - -### Performance monitoring - -If the TCMCI\_Mode has the value OPERATIONAL or MONITOR, the function shall perform the following performance monitoring primitives processing (see clause 6.5 of [ITU-T G.806]). The performance monitoring primitives shall be reported to the EMF. - -$pN\_DS \leftarrow$ CI\_SSF or dAIS or dLTC or dOCI or dLCK or dTIM - -$pF\_DS \leftarrow$ dBDI - -$pN\_EBC \leftarrow \sum nN\_B$ - -NOTE 7 – During CI\_SSF, dAIS, dLTC, dLCK and dOCI, no errored blocks shall be counted. - -$pF\_EBC \leftarrow \sum nF\_B$ - -NOTE 8 – During CI\_SSF, dAIS, dLTC, dLCK and dOCI, no errored blocks shall be counted. - -$pBIAE \leftarrow$ dBIAE - -NOTE 9 – pBIAE is activated at the end of a second if dBIAE was active once during the second. - -$pIAE \leftarrow$ dIAE - -NOTE 10 – pIAE is activated at the end of a second if dIAE was active once during the second. - -NOTE 11 – pIAE and pBIAE are used for the suppression of the PM data in the equipment management functions (see [ITU-T G.874]). If pBIAE is active, the F\_DS and F\_EBC values of the previous and current second have to be discarded (EBC = 0 and DS = false). If pIAE is active, the N/F\_DS and N/F\_EBC values of the previous and current second have to be discarded (EBC = 0 and DS = false). The previous second has to be included due to the delay of the IAE information coming from the remote source. - -$pN\_delay \leftarrow nN\_delay$ - -NOTE 12 – This count is triggered by the ODUT\_TT\_Sk\_MI\_DMValue toggle event, which is equal to the ODUT\_TT\_So\_MI\_DMValue toggle event. - -NOTE 13 – This value is a snapshot value. - -NOTE 14 – This value is invalid if a STAT field indicating AIS, OCI, LCK, LTC, or BDI is received during the measurement. - -#### 14.5.1.1.3 ODUT non-intrusive monitoring function (ODUTm\_TT\_Sk) - -The ODUTm\_TT\_Sk function reports the state of the ODU monitored tandem connection. It computes the BIP-8[1..n], extracts tandem connection monitoring overhead (TCMOH) – including the TTI, BIP-8[1..n], BDI and BEI[1..n] signals – in a selected TCMOH field from the ODU signal at its ODU\_TCP, detects for AIS, OCI, LCK, TIM, DEG and BDI defects, counts during one-second periods errors (detected via the BIP-8) and defects to feed performance monitoring. The ODUCn signal has n TCM overhead fields per TCM level; the ODUK signal has one ( $n = 1$ ) TCM overhead field per TCM level. - -For ODUT non-intrusive monitoring, the ODUTm\_TT\_Sk function can be connected to the ODU\_CPs as shown in Figure 14-119. The ODUTm\_TT\_Sk function can be connected to any ODU\_CP in this manner, either directly or via a connection function. - -The TSF and TSD outputs of an ODUKT non-intrusive monitor can be connected to an ODU\_C connection function and used as protection switching trigger criteria for SNC/N protection; for an ODUCnP non-intrusive monitor the TSF and TSD output are left open. - -![Figure 14-119: Connection of ODUTm_TT_Sk function (non-intrusive monitor).](40b685b3ae31d84f5f9edf37cbb945bb_img.jpg) - -This diagram illustrates the non-intrusive monitoring architecture for OTN. It features two parallel processing paths. The left path is for ODUk, and the right path is for ODUCn. In the ODUk path, data flows from an ODUkT/ODUk client through an ODUkT section, then through an ODUkT/ODUk section, and finally into a central ODUk multiplexing node. Monitoring points (ODUk\_TT\_Sk\_MP) are located at the input and output of the ODUkT/ODUk sections. The ODUkT section also receives a reference point (ODUkT\_RP) from the ODUkT section. The ODUk multiplexing node is connected to four ODUkTm monitoring blocks, which are further connected to TSF TSD blocks. The ODUCn path follows a similar structure but uses ODUCnT and ODUCnT/ODUCn components. The diagram is labeled G.798(17)\_F14-119. - -Figure 14-119: Connection of ODUTm\_TT\_Sk function (non-intrusive monitor). - -**Figure 14-119 – Connection of ODUTm\_TT\_Sk function (non-intrusive monitor)** - -The information flow and processing of the ODUTm\_TT\_Sk function is defined with reference to Figures 14-120 and 14-121. - -**Symbol** - -![Figure 14-120: ODUTm_TT_Sk function symbol.](2ffdb0621c4918479cd1ac7a531b1b92_img.jpg) - -This diagram shows the functional symbol for the ODUTm\_TT\_Sk function. It consists of two mirrored symbols. The left symbol is for ODUk, with an input labeled ODUk\_TCP at the bottom, a central triangle labeled ODUkTm, an output labeled ODUk\_AP at the top, and a monitoring point labeled ODUk\_TT\_Sk\_MP on the left. Below the triangle, it specifies 'k = 0, 1, 2, 2e, 3, 4, flex'. The right symbol is for ODUCn, with an input labeled ODUCn\_TCP at the bottom, a central triangle labeled ODUCnTm, an output labeled ODUCn\_AP at the top, and a monitoring point labeled ODUCnT\_TT\_Sk\_MP on the left. The diagram is labeled G.798(17)\_F14-120. - -Figure 14-120: ODUTm\_TT\_Sk function symbol. - -**Figure 14-120 – ODUTm\_TT\_Sk function** - -## Interfaces - -**Table 14-55 – ODUTm\_TT\_Sk inputs and outputs** - -| Input(s) | Output(s) | -|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| ODU_CP:
ODU_CI_CK
ODU_CI_D
ODU_CI_FS
ODU_CI_MFS
ODU_CI_SSF
ODUTm_TT_Sk_MP:
ODUTm_TT_Sk_MI_Level
ODUTm_TT_Sk_MI_ExSAPI
ODUTm_TT_Sk_MI_ExDAPI
ODUTm_TT_Sk_MI_GetAcTI
ODUTm_TT_Sk_MI_TIMDetMo
ODUTm_TT_Sk_MI_TIMActDis
ODUTm_TT_Sk_MI_DEGThr
ODUTm_TT_Sk_MI_DEGM
ODUTm_TT_Sk_MI_1second | ODUT_AP:
ODUT_AI_TSF
ODUT_AI_TSD
ODUTm_TT_Sk_MP:
ODUTm_TT_Sk_MI_AcTI
ODUTm_TT_Sk_MI_cOCI (Note)
ODUTm_TT_Sk_MI_cLCK
ODUTm_TT_Sk_MI_cLTC
ODUTm_TT_Sk_MI_cTIM
ODUTm_TT_Sk_MI_cDEG
ODUTm_TT_Sk_MI_cBDI
ODUTm_TT_Sk_MI_cSSF
ODUTm_TT_Sk_MI_pN_EBC
ODUTm_TT_Sk_MI_pN_DS
ODUTm_TT_Sk_MI_pF_EBC
ODUTm_TT_Sk_MI_pF_DS
ODUTm_TT_Sk_MI_pBIAE
ODUTm_TT_Sk_MI_pIAE | -| NOTE – For ODUkTm_TT_Sk only. | | - -## Processes - -The processes associated with the ODUTm\_TT\_Sk function are as depicted in Figure 14-121. - -**TCMOH-BIP-8:** The BIP-8[1..n] shall be processed as defined in clause 8.3.4. The BIP-8[1..n] is extracted from the BIP-8 byte of the TCM[MI\_Level] fields in the n TCM overhead instances of the ODU signal at the ODU\_TCP. - -**TCMOH-TTI:** The trail trace identifier shall be recovered from the TTI byte position of the TCM[MI\_Level] field in the first ODU overhead instance of the ODU signal at the ODU\_TCP as specified in clause 8.6. The accepted value of the TTI is available at the MP (MI\_AcTI). - -**TCMOH-BDI:** The backward defect indication shall be recovered from the BDI bit position of the TCM[MI\_Level] field in the first ODU overhead instance of the ODU signal at the ODU\_TCP. It shall be used for BDI defect detection. - -**TCMOH-BEI/BIAE:** The BEI[1..n] shall be recovered from the BEI/BIAE bits in the TCM[MI\_Level] field of the n TCM overhead instances in the ODU signal at the ODU\_TCP. It shall be used to determine if a far-end errored block (nF\_B) has occurred. One nF\_B has occurred per BEI/BIAE[i] value is between 1 [0001] and 8 [1000]; otherwise, no nF\_B has occurred. The BEI/BIAE information is also used for BIAE defect detection. - -**TCMOH-STAT:** The status information shall be recovered from the STAT bits in the TCM[MI\_Level] field in the first ODU overhead instance of the ODU signal at the ODU\_TCP as defined in clause 8.8 (→ AcSTAT). It shall be used for AIS, OCI, LCK, LTC and IAE defect detection. - -![Block diagram of ODUTm_TT_Sk_MP processes showing internal components and their interactions with ODUT_AP and ODU_CP.](ea6b9ace0ed0694c2ce8dcdb8b5ea52b_img.jpg) - -The diagram illustrates the internal architecture of the ODUTm\_TT\_Sk\_MP process. It is divided into several functional blocks: - -- Process TTI:** Receives inputs MI\_TIMActDis, MI\_ExSAPI, MI\_ExDAPI, MI\_TIMDetMo, MI\_GetAcTI, and MI\_AcTI. It outputs dTIM and RxTI. RxTI is sent to 'Extract TTI' and also to 'Defect correlations'. -- Defect correlations:** Receives dTIM, RxTI, and various defect signals (dDEG, dLCK, dOCI, dAIS, dLTC, CI\_SSF). It outputs a set of defect signals (dTIM, dDEG, dBDI, dLTC, dLCK, dOCI, dAIS, CI\_SSF) to 'Process STAT'. -- Process STAT:** Receives defect signals from 'Defect correlations' and outputs dIAE, dLTC, dLCK, dOCI, and dAIS to 'Extract STAT'. -- Extract STAT:** Receives signals from 'Process STAT' and interacts with 'TCM[MI\_level] OH access'. -- Performance monitoring:** Receives MI\_Level, MI\_1second, MI\_pF\_DS, MI\_pBIAE, MI\_pF\_EBC, MI\_pN\_DS, MI\_pIAE, and MI\_pN\_EBC. It outputs dBDI, dBIAE, nF\_B, aTSF, dIAE, nN\_B, and nBIPV[1..n]. -- Extract BDI:** Receives dBDI from 'Performance monitoring' and interacts with 'TCM[MI\_level] OH access'. -- Extract BEI/BIAE:** Receives dBIAE and nF\_B from 'Performance monitoring' and interacts with 'TCM[MI\_level] OH access'. -- Extract BIP-8:** Receives nN\_B from 'Performance monitoring' and interacts with 'TCM[MI\_level] OH access'. -- Compute BIP-8:** Receives nBIPV[1..n] from 'Performance monitoring' and interacts with 'TCM[MI\_level] OH access'. -- Compare:** Receives nBIPV[1..n] from 'Performance monitoring' and nN\_B from 'Extract BIP-8'. It outputs dDEG to 'Process errors'. -- Process errors:** Receives MI\_DEGThr, MI\_DEGM, and dDEG from 'Compare'. It outputs aTSD and aTSF to 'Consequent actions'. -- Consequent actions:** Receives aTSD and aTSF from 'Process errors' and outputs AI\_TSD and AI\_TSF to the top. -- TCM[MI\_level] OH access:** A central vertical block that interacts with 'Extract TTI', 'Extract STAT', 'Extract BDI', 'Extract BEI/BIAE', 'Extract BIP-8', and 'Compute BIP-8'. - -External interfaces include ODUT\_AP (AI\_TSD, AI\_TSF) at the top and ODU\_CP (CI\_SSF, CI\_MFS, CI\_FS, CI\_CK, CI\_D) at the bottom. - -Block diagram of ODUTm\_TT\_Sk\_MP processes showing internal components and their interactions with ODUT\_AP and ODU\_CP. - -G.798(17)\_F14-121 - -Figure 14-121 – ODUTm\_TT\_Sk processes - -### Defects - -The function shall detect dLTC, dAIS, dOCI, dLCK, dTIM, dDEG, dIAE, dBIAE and dBDI defects. - -**dLTC:** See clause 6.2.1.5.1; dLTC shall be set to false during CI\_SSF. - -**dAIS:** See clause 6.2.6.3.2. - -**dOCI:** For ODUk, see clause 6.2.6.8.2; dOCI shall be set to false during CI\_SSF. For ODUCn dOCI shall be assumed false. - -**dLCK:** See clause 6.2.6.9.1; dLCK shall be set to false during CI\_SSF. - -**dTIM:** See clause 6.2.2.1; dTIM shall be set to false during CI\_SSF and dAIS. - -**dDEG:** See clause 6.2.3.4. - -NOTE 1 – IAE suppresses the one-second near-end errored block count, which is the input for the dDEG detection. This avoids wrong dDEG declaration due to alignment errors already incoming in an OTUk trail. - -**dBDI:** See clause 6.2.6.6.1; dBDI shall be set to false during CI\_SSF and dAIS. - -**dIAE:** See clause 6.2.6.10.2; dIAE shall be set to false during CI\_SSF, dAIS and dTIM. - -**dBIAE:** See clause 6.2.6.11.1; dBIAE shall be set to false during CI\_SSF, dAIS and dTIM. - -### Consequent actions - -The function shall perform the following consequent actions (see clause 6.3 of [ITU-T G.806]): - -aTSF $\leftarrow$ CI\_SSF or (dAIS or dLTC or dOCI or dLCK or (dTIM and (not TIMActDis)))) - -aTSD $\leftarrow$ dDEG - -### Defect correlations - -The function shall perform the following defect correlations to determine the most probable fault cause (see clause 6.4 of [ITU-T G.806]). This fault cause shall be reported to the EMF. - -cSSF $\leftarrow$ CI\_SSF or dAIS - -cLTC $\leftarrow$ dLTC and (not CI\_SSF) - -cOCI $\leftarrow$ dOCI and (not CI\_SSF) - -cLCK $\leftarrow$ dLCK and (not CI\_SSF) - -cTIM $\leftarrow$ dTIM and (not CI\_SSF) and (not dAIS) and (not dLTC) and (not dOCI) and (not dLCK) - -cDEG $\leftarrow$ dDEG and (not CI\_SSF) and (not dAIS) and (not dLTC) and (not dOCI) and (not dLCK) and (not (dTIM and (not TIMActDis)))) - -cBDI $\leftarrow$ dBDI and (not CI\_SSF) and (not dAIS) and (not dLTC) and (not dOCI) and (not dLCK) and (not (dTIM and (not TIMActDis)))) - -### Performance monitoring - -The function shall perform the following performance monitoring primitives processing (see clause 6.5 of [ITU-T G.806]). The performance monitoring primitives shall be reported to the EMF. - -pN\_DS $\leftarrow$ CI\_SSF or (dAIS or dLTC or dOCI or dLCK or dTIM) - -pF\_DS $\leftarrow$ dBDI - -pN\_EBC $\leftarrow \sum nN\_B$ - -NOTE 3 – During CI\_SSF, dAIS, dLTC, dLCK and dOCI, no errored blocks shall be counted. - -pF\_EBC $\leftarrow \sum nF\_B$ - -NOTE 4 – During CI\_SSF, dAIS, dLTC, dLCK and dOCI, no errored blocks shall be counted. - -pBIAE $\leftarrow$ dBIAE - -NOTE 5 – pBIAE is activated at the end of the second if dBIAE was active once during the second. - -pIAE $\leftarrow$ dIAE - -NOTE 6 – pIAE is activated at the end of the second if dIAE was active once during the second. - -NOTE 7 – pIAE and pBIAE are used for the suppression of the PM data in the equipment management functions (see [ITU-T G.874]). If pBIAE is active, the F\_DS and F\_EBC values of the previous and current second have to be discarded (EBC = 0 and DS = false). If pIAE is active, the N/F\_DS and N/F\_EBC values of the previous and current second have to be discarded (EBC = 0 and DS = false). The previous second has to be included due to the delay of the IAE information coming from the remote source. - -#### 14.5.1.2 ODUT to ODU adaptation function (ODUT/ODU\_A) - -The ODUT/ODU\_A function starts and ends a selected TCM level if it is OPERATIONAL. - -Furthermore, the ODUT/ODU\_A function provides access to the TCM status information in the ODU overhead over the TCM control point (TCMCP) for the tandem connection monitor control (TCMC) function that can be connected to an ODUT/ODU\_A. - -##### 14.5.1.2.1 ODUT to ODU adaptation source function (ODUT/ODU\_A\_So) - -The ODUT/ODU\_A\_So function starts a selected TCM level and can initiate maintenance signals (LCK) if it is OPERATIONAL. - -Furthermore, the ODUT/ODU\_A\_So function provides access to the TCM status information in the ODU overhead over the TCMCP for the TCMC function that can be connected to an ODUT/ODU\_A. Additionally, the ODUkT/ODUk\_A\_So provides access to the ODUk TCM APS overhead. - -The information flow and processing of the ODUT/ODU\_A\_So function is defined with reference to Figures 14-122 and 14-123. - -#### Symbol - -![Diagram of ODUT/ODU_A_So function symbols for ODUk and ODUCn levels.](6d7989325053731fda7ae4de0e946b24_img.jpg) - -The diagram illustrates two functional blocks for the ODUT/ODU\_A\_So function. The top block is for the ODUk level, represented by a trapezoidal symbol labeled 'ODUkT/ODUk'. It has four input/output points: 'ODUk\_CP' at the top, 'ODUkT/ODUk\_A\_So\_MP' on the left, 'ODUkT/ODUk\_A\_So\_TCMCP' on the right, and 'ODUkT\_AP' at the bottom. The bottom output is labeled with 'k = 0, 1, 2, 2e, 3, 4, flex'. The bottom block is for the ODUCn level, represented by a similar trapezoidal symbol labeled 'ODUCnT/ODUCn'. It has four input/output points: 'ODUCn\_CP' at the top, 'ODUCnT/ODUCn\_A\_So\_MP' on the left, 'ODUCnT/ODUCn\_A\_So\_TCMCP' on the right, and 'ODUCnT\_AP' at the bottom. - -Diagram of ODUT/ODU\_A\_So function symbols for ODUk and ODUCn levels. - -G.798(17)\_F14-122 - -Figure 14-122 – ODUT/ODU\_A\_So function - -## Interfaces - -**Table 14-56 – ODUT/ODU\_A\_So inputs and outputs** - -| Input(s) | Output(s) | -|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|--------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| ODU_CP:
ODU_CI_CK
ODU_CI_D
ODU_CI_FS
ODU_CI_MFS
ODU_CI_RP
ODU_CI_TSCC
ODUT_PP:
ODU_PI_APS (Note)
ODUT/ODU_A_So_MP:
ODUT/ODU_A_So_MI_AdminState
ODUT/ODU_A_So_TCMCP:
ODUT/ODU_A_So_TCMCI_Mode
ODUT/ODU_A_So_TCMCI_Level | ODUT_AP:
ODUT_AI_CK
ODUT_AI_D
ODUT_AI_FS
ODUT_AI_MFS
ODUT_AI_RP
ODUT_AI_TSCC
ODUT/ODU_A_So_TCMCP:
ODUT/ODU_A_So_TCMCI_AcSTAT[1..6] | -| NOTE – For ODUkT/ODUk_A_So only. | | - -## Processes - -The processes associated with the ODUT/ODU\_A\_So function are as depicted in Figure 14-123. - -**TCMOH-STAT Rx:** The status of all six TCM levels is recovered from the TCM OH [1..6] STAT field and provided to the TCM control function via TCMCI\_STAT[1..6]. For the STAT acceptance process, see clause 8.8. - -**ODU-LCK:** The function shall generate the ODU-LCK signal as defined in clause 16.5 of [ITU-T G.709]. The clock, frame start and multiframe start are defined by the incoming ODU signal. - -**Mode:** If the TCMCI\_Mode has the value OPERATIONAL, the following processes shall be performed. If the TCMCI\_Mode has the value TRANSPARENT, all information shall be passed through transparently and the following processes shall not be performed. - -**IAE:** If the incoming ODU frame start (CI\_FS) position is not at the expected frame start position, incoming alignment error (IAE) shall be activated. IAE shall be deactivated if the incoming ODU frame start (CI\_FS) position is at the expected frame start position. The expected frame start position is based on the previous incoming ODU frame start. - -**Selector:** If TCMCI\_Mode is OPERATIONAL, the normal signal may be replaced by the ODU-LCK signal. ODU-LCK signal is selected if the MI\_AdminState is LOCKED. - -**ODUk TCM APS:** If TCMCI\_Mode is OPERATIONAL, the ODUkT/ODUk\_S\_So function shall insert the PI\_APS value into the ODUk TCM APS/PCC[TCMCI\_Level] field, which is available once per eight ODUk frames as specified in Table 15-6 of [ITU-T G.709]. - -**TCMOH-STAT Tx:** If TCMCI\_Mode is OPERATIONAL, the TC status is inserted into the STAT bit positions of TCM OH[TCMCI\_Level] based on the incoming alignment error (IAE) information. Normally, the code "in use without IAE" (001) is inserted. Upon the declaration of IAE at this function, the function shall insert the code "in use with IAE" (010) in the STAT field for the next 16 multiframes. Each new declaration of aIAE restarts the 16-multiframe insertion time. - -**TCMOH-Others:** If TCMCI\_Mode is OPERATIONAL, all other TCM OH[TCMCI\_Level] bits are set to "0". - -![Figure 14-123 – ODUT/ODU_A_So processes. This block diagram illustrates the internal signal processing and control flow of the ODUT/ODU_A_So function. At the top, the ODU_CP (Control Plane) provides inputs: CI_D, CI_CK, CI_FS, CI_MFS, CI_RP, and CI_TSCC. CI_CK feeds into 'Generate ODU-LCK', which also receives FS and MFS. CI_RP and CI_TSCC feed into 'TCMOH[TCMCI_Level] access'. CI_D feeds into 'Normal' and 'LCK' blocks. 'Generate ODU-LCK' outputs D_LCK to 'LCK'. 'Normal' and 'LCK' feed into 'Select normal/LCK'. 'Select normal/LCK' outputs to 'TCM OH STAT Rx' and 'TCMOH[TCMCI_Level] access'. 'TCM OH STAT Rx' outputs TCMCI_AcSTAT[1..6]. 'TCMOH[TCMCI_Level] access' outputs to 'ODUk TCM APS' (labeled 'ODUkT/ODUk only') and 'STAT Tx'. 'ODUk TCM APS' outputs PI_APS. 'STAT Tx' outputs aIAE to 'IAE detection'. 'IAE detection' also receives CK, FS, MFS, RP, and TSCC. The bottom, ODUT_AP (Adaptation Plane), provides inputs: AI_D, AI_CK, AI_FS, AI_MFS, AI_RP, and AI_TSCC. AI_CK, AI_FS, AI_MFS, AI_RP, and AI_TSCC feed into 'IAE detection'. AI_D feeds into 'TCMOH[TCMCI_Level] access'. On the right, external interfaces are shown: MI_AdminState, TCMCI_AcSTAT[1..6], TCMCI_Mode, TCMCI_Level, and PI_APS. Brackets on the right label the top section as ODUT/ODU_A_So_MP and the bottom section as ODUT/ODU_A_So_TCMCP. The diagram is labeled G.798(17)_F14-123.](733da1815169d31c06238e8cd6ae23f2_img.jpg) - -Figure 14-123 – ODUT/ODU\_A\_So processes. This block diagram illustrates the internal signal processing and control flow of the ODUT/ODU\_A\_So function. At the top, the ODU\_CP (Control Plane) provides inputs: CI\_D, CI\_CK, CI\_FS, CI\_MFS, CI\_RP, and CI\_TSCC. CI\_CK feeds into 'Generate ODU-LCK', which also receives FS and MFS. CI\_RP and CI\_TSCC feed into 'TCMOH[TCMCI\_Level] access'. CI\_D feeds into 'Normal' and 'LCK' blocks. 'Generate ODU-LCK' outputs D\_LCK to 'LCK'. 'Normal' and 'LCK' feed into 'Select normal/LCK'. 'Select normal/LCK' outputs to 'TCM OH STAT Rx' and 'TCMOH[TCMCI\_Level] access'. 'TCM OH STAT Rx' outputs TCMCI\_AcSTAT[1..6]. 'TCMOH[TCMCI\_Level] access' outputs to 'ODUk TCM APS' (labeled 'ODUkT/ODUk only') and 'STAT Tx'. 'ODUk TCM APS' outputs PI\_APS. 'STAT Tx' outputs aIAE to 'IAE detection'. 'IAE detection' also receives CK, FS, MFS, RP, and TSCC. The bottom, ODUT\_AP (Adaptation Plane), provides inputs: AI\_D, AI\_CK, AI\_FS, AI\_MFS, AI\_RP, and AI\_TSCC. AI\_CK, AI\_FS, AI\_MFS, AI\_RP, and AI\_TSCC feed into 'IAE detection'. AI\_D feeds into 'TCMOH[TCMCI\_Level] access'. On the right, external interfaces are shown: MI\_AdminState, TCMCI\_AcSTAT[1..6], TCMCI\_Mode, TCMCI\_Level, and PI\_APS. Brackets on the right label the top section as ODUT/ODU\_A\_So\_MP and the bottom section as ODUT/ODU\_A\_So\_TCMCP. The diagram is labeled G.798(17)\_F14-123. - -Figure 14-123 – ODUT/ODU\_A\_So processes - -**Defects:** None. - -**Consequent actions** - -The function shall perform the following consequent actions: - -aIAE ← IAE - -**Defect correlations:** None. - -**Performance monitoring:** None. - -**14.5.1.2.2 ODUT to ODU adaptation sink function (ODUT/ODU\_A\_Sk)** - -The ODUT/ODU\_A\_Sk function ends a selected TCM level and can initiate maintenance signals (ODU-AIS, ODU-LCK) if it is OPERATIONAL. - -Furthermore, the ODUT/ODU\_A\_Sk function provides access to the TCM status information in the ODU overhead over the TCMCP for the TCMC function that can be connected to an ODUT/ODU\_A. Additionally, the ODUkT/ODUk\_A\_Sk provides access to ODUk TCM APS overhead. - -The information flow and processing of the ODUT/ODU\_A\_Sk function is defined with reference to Figures 14-124 and 14-125. - -## Symbol - -![Figure 14-124 – ODUT/ODU_A_Sk function symbol diagram. The diagram shows two identical functional blocks. The top block is labeled 'ODUKT/ODUK' and has four interfaces: 'ODUK_T_CP' (top), 'ODUKT/ODUk_A_Sk_MP' (left), 'ODUKT/ODUk_A_Sk_TCMCP' (right), and 'ODUKT_AP' (bottom). The bottom interface is labeled with 'k = 0, 1, 2, 2e, 3, 4, flex'. The bottom block is labeled 'ODUCnT/ODUCn' and has four interfaces: 'ODUCn_CP' (top), 'ODUCnT/ODUCn_A_Sk_MP' (left), 'ODUCnT/ODUCn_A_Sk_TCMCP' (right), and 'ODUCnT_AP' (bottom). Below the bottom block is the text 'G.798(17)_F14-124'.](87253027e8bb658bf7d211cb23248bcb_img.jpg) - -Figure 14-124 – ODUT/ODU\_A\_Sk function symbol diagram. The diagram shows two identical functional blocks. The top block is labeled 'ODUKT/ODUK' and has four interfaces: 'ODUK\_T\_CP' (top), 'ODUKT/ODUk\_A\_Sk\_MP' (left), 'ODUKT/ODUk\_A\_Sk\_TCMCP' (right), and 'ODUKT\_AP' (bottom). The bottom interface is labeled with 'k = 0, 1, 2, 2e, 3, 4, flex'. The bottom block is labeled 'ODUCnT/ODUCn' and has four interfaces: 'ODUCn\_CP' (top), 'ODUCnT/ODUCn\_A\_Sk\_MP' (left), 'ODUCnT/ODUCn\_A\_Sk\_TCMCP' (right), and 'ODUCnT\_AP' (bottom). Below the bottom block is the text 'G.798(17)\_F14-124'. - -Figure 14-124 – ODUT/ODU\_A\_Sk function - -## Interfaces - -Table 14-57 – ODUT/ODU\_A\_Sk inputs and outputs - -| Input(s) | Output(s) | -|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| ODUT_AP:
ODUT_AI_CK
ODUT_AI_D
ODUT_AI_FS
ODUT_AI_MFS
ODUT_AI_TSF
ODUT_AI_TSD
ODUT_AI_AIS
ODUT_AI_RP
ODUT_AI_TSCC
ODUT/ODU_A_Sk_MP:
ODUT/ODU_A_Sk_MI_AdminState
ODUT/ODU_A_Sk_TCMCP:
ODUT/ODU_A_Sk_TCMCI_Mode
ODUT/ODU_A_Sk_TCMCI_Level | ODU_CP:
ODU_CI_CK
ODU_CI_D
ODU_CI_FS
ODU_CI_MFS
ODU_CI_SSF
ODU_CI_SSD
ODU_CI_RP
ODU_CI_TSCC
ODUT_PP:
ODUT_PI_APS (Note)
ODUT_PI_TSF (Note)
ODUT_PI_TSD (Note)
ODUT/ODU_A_Sk_TCMCP:
ODUT/ODU_A_Sk_TCMCI_AcSTAT[1..6] | -| NOTE – For OTUk/ODUk_A_Sk only. | | - -## Processes - -The processes associated with the ODUT/ODU\_A\_Sk function are as depicted in Figure 14-125. - -**ODUk TCM APS:** If the TCMCI\_Mode has the value OPERATIONAL, the ODUkT/ODUk\_A\_Sk function shall extract the information from the ODUk TCM APS/PCC[TCMCI\_Level] field, which is available once per eight ODUk frames as specified in Table 15-6 of [ITU-T G.709] and apply this to the PI\_APS. - -**TCMOH-STAT Rx:** The status of all six TCM levels is recovered from the TCM OH [1..6] STAT field and provided to the control function via TCMCI\_AcSTAT[1..6]. For the STAT acceptance process, see clause 8.8. - -**ODU-LCK, ODU-AIS:** The function shall generate the ODU-LCK and ODU-AIS signals as defined in [ITU-T G.709]. The clock, frame start and multiframe start are defined by the incoming ODU signal. - -**Mode:** If the TCMCI\_Mode has the value OPERATIONAL, the following processes shall be performed. If the TCMCI\_Mode has the values MONITOR or TRANSPARENT, all information shall be passed through transparently and the following processes shall not be performed. - -**Selector:** If TCMCI\_Mode is OPERATIONAL, the normal signal may be replaced by either the ODU-AIS or the ODU-LCK signal. ODU-LCK signal is selected if the MI\_AdminState is LOCKED. ODU-AIS is selected if MI\_AdminState is not LOCKED and aAIS is true. If TCMCI\_Mode has the values MONITOR or TRANSPARENT, the normal signal is always selected. - -**Remove TCMOH:** If the TCMCI\_Mode has the value OPERATIONAL, an all-ZEROs pattern shall be inserted in the TCMOH and TCM APS/PCC at location TCMCI\_Level. If the TCMCI\_Mode has the values TRANSPARENT or MONITOR, the information shall be passed through transparently. - -![Figure 14-125 – ODUT/ODU_A_Sk processes. This block diagram illustrates the internal signal processing within an ODUT/ODU_A_Sk block. The block is divided into two main sections: ODUT/ODU_A_Sk_MP (top) and ODUT/ODU_A_Sk_TCMCP (bottom). Inputs on the left include MI_AdminState, TCMCI_Mode, TCMCI_Level, and TCMCI_AcSTAT[1..6]. The TCMCI_AcSTAT[1..6] input connects to a 'TCM OH STAT Rx' block. The 'ODUT/ODU_A_Sk_MP' section contains a 'Consequent actions' block that receives AI_TSD, AI_TSF, and AI_AIS signals and outputs aTSD, aTSF, and aAIS signals. The aAIS signal connects to a 'Select normal/AIS/LCK' block, which also receives D_AIS, D_LCK, and D_normal signals. The 'Select normal/AIS/LCK' block outputs RP, TSCC, MFS, FS, CK, and D signals. The 'ODUT/ODU_A_Sk_TCMCP' section contains a 'Generate ODU-AIS' block and a 'Generate ODU-LCK' block, both receiving MFS, FS, and CK signals. These blocks output D_AIS and D_LCK signals respectively. A 'Remove TCMOH[TCMCI_Level]' block receives TCMCI_Mode and TCMCI_Level signals and outputs a signal to the 'ODUk TCM APS' block. The 'ODUk TCM APS' block outputs PI_APS, PI_TSF, and PI_TSD signals. The bottom section of the diagram shows the ODUT_AP section, which receives AI_TSD, AI_TSF, AI_AIS, AI_RP, AI_TSCC, AI_MFS, AI_FS, AI_CK, and AI_D signals and outputs RP, TSCC, MFS, FS, and CK signals. The diagram is labeled G.798(17)_F14-125.](8453d7dc9225bb210abd09f5d0af3c9b_img.jpg) - -Figure 14-125 – ODUT/ODU\_A\_Sk processes. This block diagram illustrates the internal signal processing within an ODUT/ODU\_A\_Sk block. The block is divided into two main sections: ODUT/ODU\_A\_Sk\_MP (top) and ODUT/ODU\_A\_Sk\_TCMCP (bottom). Inputs on the left include MI\_AdminState, TCMCI\_Mode, TCMCI\_Level, and TCMCI\_AcSTAT[1..6]. The TCMCI\_AcSTAT[1..6] input connects to a 'TCM OH STAT Rx' block. The 'ODUT/ODU\_A\_Sk\_MP' section contains a 'Consequent actions' block that receives AI\_TSD, AI\_TSF, and AI\_AIS signals and outputs aTSD, aTSF, and aAIS signals. The aAIS signal connects to a 'Select normal/AIS/LCK' block, which also receives D\_AIS, D\_LCK, and D\_normal signals. The 'Select normal/AIS/LCK' block outputs RP, TSCC, MFS, FS, CK, and D signals. The 'ODUT/ODU\_A\_Sk\_TCMCP' section contains a 'Generate ODU-AIS' block and a 'Generate ODU-LCK' block, both receiving MFS, FS, and CK signals. These blocks output D\_AIS and D\_LCK signals respectively. A 'Remove TCMOH[TCMCI\_Level]' block receives TCMCI\_Mode and TCMCI\_Level signals and outputs a signal to the 'ODUk TCM APS' block. The 'ODUk TCM APS' block outputs PI\_APS, PI\_TSF, and PI\_TSD signals. The bottom section of the diagram shows the ODUT\_AP section, which receives AI\_TSD, AI\_TSF, AI\_AIS, AI\_RP, AI\_TSCC, AI\_MFS, AI\_FS, AI\_CK, and AI\_D signals and outputs RP, TSCC, MFS, FS, and CK signals. The diagram is labeled G.798(17)\_F14-125. - -**Figure 14-125 – ODUT/ODU\_A\_Sk processes** - -**Defects:** None. - -**Consequent actions** - -aAIS $\leftarrow$ AI\_AIS and (TCMCI\_Mode = OPERATIONAL) and -(not MI\_AdminState = LOCKED) - -aSSF $\leftarrow$ AI\_TSF and (not MI\_AdminState = LOCKED) - -aSSD $\leftarrow$ AI\_TSD and (not MI\_AdminState = LOCKED) - -On declaration of aAIS, the function shall output an ODU-AIS signal within two frames. On clearing aAIS, the ODU-AIS signal shall be removed within two frames with normal data being output. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -**14.5.1.3 ODUT TCM control functions (ODUT\_TCMC)** - -The ODUT\_TCMC functions are responsible for the activation/deactivation of a TCM trail. An ODUT\_TCMC function is connected to the ODUT\_TT and ODUT/ODU\_A functions at the TCM control points (TCMCP) as shown in Figure 14-126. - -Currently only an ODUT\_TCMC function for manual activation/deactivation via the management interface is defined. ODUT\_TCMC functions for automatic activation are for further study. - -![Diagram showing ODUT_TCMC connections for two levels: ODUT/ODUk and ODUCnT/ODUCn. Each level shows a central TCMC block connected to source (So) and sink (Sk) functions via TCMCP signals, and a management point (MP) at the bottom. The diagram is labeled G.798(17)_F14-126.](088fd744940924d37de4d237e53bb684_img.jpg) - -The diagram illustrates the connections for ODUT\_TCMC functions at two levels. The top level shows the ODUT/ODUk functions, and the bottom level shows the ODUCnT/ODUCn functions. Each level consists of a central ODUT\_TCMC (or ODUCnT\_TCMC) block connected to source (So) and sink (Sk) functions via TCM control points (TCMCP). The source functions are connected to the TCMC block via ODUT/ODUk\_A\_So\_TCMCP (or ODUCnT/ODUCn\_A\_So\_TCMCP) and ODUT\_TT\_So\_TCMCP (or ODUCnT\_TT\_So\_TCMCP) signals. The sink functions are connected via ODUT/ODUk\_A\_Sk\_TCMCP (or ODUCnT/ODUCn\_A\_Sk\_TCMCP) and ODUT\_TT\_Sk\_TCMCP (or ODUCnT\_TT\_Sk\_TCMCP) signals. A management point (MP) is also connected to each TCMC block via ODUCnT\_TCMC\_MP signals. The diagram is labeled G.798(17)\_F14-126. - -Diagram showing ODUT\_TCMC connections for two levels: ODUT/ODUk and ODUCnT/ODUCn. Each level shows a central TCMC block connected to source (So) and sink (Sk) functions via TCMCP signals, and a management point (MP) at the bottom. The diagram is labeled G.798(17)\_F14-126. - -**Figure 14-126 – ODUT\_TCMC connections** - -**14.5.1.3.1 ODUT control function for manual activation (ODUT\_TCMCm)** - -The ODUT\_TCMCm function performs manual activation/deactivation of a TCM trail via the management interface. - -The TCM status of the sink and source is provided to the management interface. The TCM level and the mode of the sink and source functions is selected by the management interface. - -The information flow and processing of the ODUT\_TCMCm function is defined with reference to Figures 14-127 and 14-128. - -## Symbol - -![Diagram showing the symbol for ODUT_TCMCm function. It consists of two rectangular blocks. The top block is labeled ODUT_TCMCm and has four external connections: ODUKT/ODUk_A_So_TCMCP (input), ODUKT_TT_So_TCMCP (input), ODUKT/ODUk_A_Sk_TCMCP (output), and ODUKT_TT_Sk_TCMCP (output). A vertical double-headed arrow labeled 'k = 0, 1, 2, 2e, 3, 4, flex' connects the top block to a bottom block labeled ODUCnT_TCMCm. The bottom block has four external connections: ODUCnT/ODUCn_A_So_TCMCP (input), ODUCnT_TT_So_TCMCP (input), ODUCnT/ODUCn_A_Sk_TCMCP (output), and ODUCnT_TT_Sk_TCMCP (output). A vertical double-headed arrow labeled 'k = 0, 1, 2, 2e, 3, 4, flex' connects the bottom block to ODUCnT_TCMCm_MP. The text G.798(17)_F14-127 is in the bottom right corner.](74c3f93d2f82f78de6a3925bb8e15977_img.jpg) - -Diagram showing the symbol for ODUT\_TCMCm function. It consists of two rectangular blocks. The top block is labeled ODUT\_TCMCm and has four external connections: ODUKT/ODUk\_A\_So\_TCMCP (input), ODUKT\_TT\_So\_TCMCP (input), ODUKT/ODUk\_A\_Sk\_TCMCP (output), and ODUKT\_TT\_Sk\_TCMCP (output). A vertical double-headed arrow labeled 'k = 0, 1, 2, 2e, 3, 4, flex' connects the top block to a bottom block labeled ODUCnT\_TCMCm. The bottom block has four external connections: ODUCnT/ODUCn\_A\_So\_TCMCP (input), ODUCnT\_TT\_So\_TCMCP (input), ODUCnT/ODUCn\_A\_Sk\_TCMCP (output), and ODUCnT\_TT\_Sk\_TCMCP (output). A vertical double-headed arrow labeled 'k = 0, 1, 2, 2e, 3, 4, flex' connects the bottom block to ODUCnT\_TCMCm\_MP. The text G.798(17)\_F14-127 is in the bottom right corner. - -Figure 14-127 – ODUT\_TCMCm function - -## Interfaces - -Table 14-58 – ODUT\_TCMCm inputs and outputs - -| Input(s) | Output(s) | -|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| ODUT_TCMCm_MP:
ODUT_TCMCm_MI_Level
ODUT_TCMCm_MI_ModeSo
ODUT_TCMCm_MI_ModeSk
ODUT_TCMCm_MI_TCM_Extension
ODUT/ODU_A_So_TCMCP:
ODUT/ODU_A_So_TCMCI_AcSTAT[1..6]
ODUT/ODU_A_Sk_TCMCP:
ODUT/ODU_A_Sk_TCMCI_AcSTAT[1..6] | ODUT_TCMCm_MP:
ODUT_TCMCm_MI_AcSTATSo[1..6]
ODUT_TCMCm_MI_AcSTATSk[1..6]
ODUT/ODU_A_So_TCMCP:
ODUT/ODU_A_So_TCMCI_Mode
ODUT/ODU_A_So_TCMCI_Level
ODUT/ODU_A_Sk_TCMCP:
ODUT/ODU_A_Sk_TCMCI_Mode
ODUT/ODU_A_Sk_TCMCI_Level
ODUT_TT_So_TCMCP:
ODUT_TT_So_TCMCI_Mode
ODUT_TT_So_TCMCI_Level
ODUT_TT_Sk_TCMCP:
ODUT_TT_Sk_TCMCI_Mode
ODUT_TT_Sk_TCMCI_Level | - -## Processes - -The processes associated with the ODUT\_TCMCm function are as depicted in Figure 14-128. - -The TCM level is provided by the management via MI\_Level and distributed to sink and source termination and adaptation functions. - -The mode is provided independently for sink and source by the management (MI\_ModeSo and MI\_ModeSk). - -The sink and source TCM status of all six levels is provided to the management (MI\_AcSTATSo[1..6] and MI\_AcSTATSk[1..6]). - -TCM information forwarding and erasing: TCM information can be forwarded or erased for continuing TCM information into sections at the end of a TCM section and the related ODUT\_TT\_Sk function. With the MI\_TCM\_Extension control that can take three values: normal, pass through or erase, this function is controlled to either terminate TCM information or let it continue or erase. The default of the MI\_TCM\_Extension must be set to "Normal". - -NOTE – Equipment prior to Edition 4.4 of this Recommendation does not provide the MI\_TCM\_Extension and will always behave as configured "Normal". - -![Diagram of ODUT_TCMCm_MP processes showing signal flow and management information exchange between ODUT/ODU_A_So_TCMCP and ODUT/ODU_A_Sk_TCMCP interfaces.](34921caa1996eef32dd520e93a1e64b8_img.jpg) - -The diagram illustrates the ODUT\_TCMCm\_MP process. It shows the flow of TCM information and management signals between two interfaces: ODUT/ODU\_A\_So\_TCMCP on the left and ODUT/ODU\_A\_Sk\_TCMCP on the right. At the top, management signals MI\_AcSTATSo[1..6], MI\_ModeSo, MI\_Level, MI\_ModeSk, MI\_TCM\_Extension, and MI\_AcSTATSk[1..6] are shown. The TCM information flow is indicated by arrows: TCMCI\_AcSTAT[1..6] and TCMCI\_Level/Mode signals are passed from the source to the sink. The MI\_TCM\_Extension control is shown with three options: 'normal' (solid line), 'Transparent' (dashed line), 'pass-through' (dotted line), and 'Operational' (dash-dot line). The 'normal' option is the default. The diagram also shows the TCMCI\_Mode and TCMCI\_Level signals being passed from the sink back to the source. The reference G.798(17)\_F14-128 is noted at the bottom right. - -Diagram of ODUT\_TCMCm\_MP processes showing signal flow and management information exchange between ODUT/ODU\_A\_So\_TCMCP and ODUT/ODU\_A\_Sk\_TCMCP interfaces. - -Figure 14-128 – ODUT\_TCMCm processes - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -## 14.6 Blank clause - -NOTE – This clause is intentionally left blank. - -## 15 FlexO functions - -Figure 15-1 illustrates the FlexO layer and client layer adaptation functions. The information crossing the FlexO connection point (FlexO\_CP) is referred to as the FlexO characteristic information (FlexO\_CI). The information crossing the FlexO access point (FlexO\_AP) is referred to as the FlexO adapted information (FlexO\_AI). The information crossing the FlexO-x connection point (FlexO-x\_CP) is referred to as the FlexO-x characteristic information (FlexO-x\_CI). The information crossing the FlexO-x access point (FlexO-x\_AP) is referred to as the FlexO-x adapted information (FlexO-x\_AI). - -The FlexO-x to FCC adaptation function (FlexO-x/FCC\_A) is optional. - -The $m^{\text{th}}$ FlexO-x/FlexO\_A\_So function may have the last $x \times m - n$ FlexO\_CPs not connected. These input ports should assume the presence of an unequipped FlexO signal. - -![Figure 15-1: FlexO functions diagram showing the flow of data through various FlexO components like SD_CP, OTUCn_(T)CPs, FlexO/SD, FlexO-n/OTUCn, FlexO, FCC_CP, FlexO-x/FCC, FlexO-x/FlexO, and FlexO-x_(T)CP. It illustrates the mapping and adaptation of client signals into FlexO frames.](08246879b7e3340f5c7af67ca43e48ff_img.jpg) - -Figure 15-1: FlexO functions diagram showing the flow of data through various FlexO components like SD\_CP, OTUCn\_(T)CPs, FlexO/SD, FlexO-n/OTUCn, FlexO, FCC\_CP, FlexO-x/FCC, FlexO-x/FlexO, and FlexO-x\_(T)CP. It illustrates the mapping and adaptation of client signals into FlexO frames. - -G.798(17)-Amd.3(20)\_F15-1 - -Figure 15-1 – FlexO functions - -FlexO characteristic information - -The FlexO characteristic information (FlexO\_CI) is the FlexO frame as defined in [ITU-T G.709.1] with valid FlexO payload overhead (GID, IID, MAP, PT and client-mapping specific) as defined in [ITU-T G.709.1] and [ITU-T G.709.3], together with a frame and multi-frame start. The remaining overhead fields contain all-ZERO's. - -In case of a synchronous FlexO interface, the FlexO\_CI also includes the FlexO synchronization message channel overhead (OSMC) in FlexO instance #1. - -The FlexO overhead present at the FlexO\_CP is shown in Figure 15-1.1. - -![Figure 15-1.1: FlexO overhead at FlexO_CP and FlexO_AP. This figure includes a detailed byte map of a 128-bit block, a table for OSMC/RES fields, a table for client-mapping multiplexed OTUCn, and a detailed view of the overhead fields (GID, IID, PT, Client mapping specific) for a 128-bit block.](0c360dc1fae48be6b928e626f9e7569b_img.jpg) - -| 128-bit block # | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | Byte | -|-----------------|-----------|---|---|---|---|---|---|---|---|----|----|----|----|----|----|-----------|------| -| 1 | | | | | | | | | | | | | | | | | | -| 2 | | | | | | | | | | | | | | | | | | -| 3 | | | | | | | | | | | | | | | | | | -| 4 | | | | | | | | | | | | | | | | | | -| 5 | | | | | | | | | | | | | | | | | | -| 6 | | | | | | | | | | | | | | | | | | -| 7 | | | | | | | | | | | | | | | | | | -| 8 | | | | | | | | | | | | | | | | | | -| 9 | MAP (LSB) | | | | | | | | | | | | | | | MAP (MSB) | | -| 10 | OSMC/RES | | | | | | | | | | | | | | | | | - - - -| 128-bit block #9 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | Byte | -|------------------|---|---|---|---|---|---|---|---|---|----|----|----|----|----|----|----|------| -| Frame # | | | | | | | | | | | | | | | | | | -| 1 | | | | | | | | | | | | | | | | | | -| 2 | | | | | | | | | | | | | | | | | | -| 3 | | | | | | | | | | | | | | | | | | -| 4 | | | | | | | | | | | | | | | | | | -| 5 | | | | | | | | | | | | | | | | | | -| 6 | | | | | | | | | | | | | | | | | | -| 7 | | | | | | | | | | | | | | | | | | -| 8 | | | | | | | | | | | | | | | | | | - - - -| 128-bit block #8 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | Byte | -|------------------|---|---|---|---|---|---|---|---|---|----|----|----|----|----|----|----|------| -| Frame # | | | | | | | | | | | | | | | | | | -| 1 | | | | | | | | | | | | | | | | | | -| 2 | | | | | | | | | | | | | | | | | | -| 3 | | | | | | | | | | | | | | | | | | -| 4 | | | | | | | | | | | | | | | | | | -| 5 | | | | | | | | | | | | | | | | | | -| 6 | | | | | | | | | | | | | | | | | | -| 7 | | | | | | | | | | | | | | | | | | -| 8 | | | | | | | | | | | | | | | | | | - - - -| Frame # | OSMC | RES | FlexO instance #1 | FlexO instance #2..#n or #m × x | -|---------|------|-----|-------------------|---------------------------------| -| 1 | | | | | -| 2 | | | | | -| 3 | | | | | -| 4 | | | | | -| 5 | | | | | -| 6 | | | | | -| 7 | | | | | -| 8 | | | | | - - - -| Frame # | Client-mapping: Multiplexed OTUCn | | -|---------|-----------------------------------|-----| -| 2 | JC4 | JC1 | -| 3 | JC5 | JC2 | -| 4 | JC6 | JC3 | -| 5 | MSI | | -| 6 | JC4 | JC1 | -| 7 | JC5 | JC2 | -| 8 | JC6 | JC3 | - - - -| Frame # | GID | IID | PT | Client mapping specific | -|---------|-----|-----|----|-------------------------| -| 1 | | | | | -| 2 | | | | | -| 3 | | | | | -| 4 | | | | | -| 5 | | | | | -| 6 | | | | | -| 7 | | | | | -| 8 | | | | | - -Figure 15-1.1: FlexO overhead at FlexO\_CP and FlexO\_AP. This figure includes a detailed byte map of a 128-bit block, a table for OSMC/RES fields, a table for client-mapping multiplexed OTUCn, and a detailed view of the overhead fields (GID, IID, PT, Client mapping specific) for a 128-bit block. - -G.798(17)-Amd.3(21)\_F15-1.1 - -Figure 15-1.1 – FlexO overhead at FlexO\_CP and FlexO\_AP - -FlexO adapted information - -The FlexO adapted information (FlexO\_AI) consists of the client layer CI adapted to the FlexO frame as defined in [ITU-T G.709.1] and [ITU-T G.709.3], and valid FlexO payload overhead (GID, IID, MAP, PT and client-mapping specific) as shown in Figure 15-1.1, together with a frame and multi-frame start. The mapping-specific overhead depends on the client mapping scheme; e.g., for - -the multiplexed OTUCn client-mapping it consists of MSI and JC1 to JC6. For the case of a synchronous FlexO interface, the FlexO\_AI also includes the FlexO synchronization message channel overhead (OSMC) in FlexO instance #1. - -### Unequipped FlexO characteristic and adapted information - -An unequipped FlexO signal contains an all-ZEROs bit stream with FlexO clock, frame start and multi-frame start common with FlexO\_CI instance #1 of the last FlexO-x instance of the FlexO-x--m interface group and with SSF = false. - -NOTE – The FlexO\_AI and FlexO\_CI overhead (GID, IID and MAP) in an unequipped FlexO have the value all-ZEROs. - -### FlexO-x adapted information - -The FlexO-x adapted information (FlexO-x\_AI) consists of *x* instances of the FlexO\_CI and one instance of valid FlexO-x specific overhead (FCC plus FlexO\_CI overhead) as shown in Figure 15-1.2, together with a frame and multi-frame start. - -In case of COMMS access at the FlexO-x\_AP, it also includes the FlexO-x FCC overhead. - -![Figure 15-1.2 – FlexO overhead at FlexO-x_AP. The diagram shows the structure of FlexO overhead across 16 bytes (128 bits) for two blocks, block #9 and block #8. Block #9 contains MAP (LSB), FCC (LSB/RES), and OSMC/RES. Block #8 contains GID, IID, and Client mapping specific information. The Client mapping specific information includes a table for multiplexed OTUCn client mapping and a table for FlexO instance specific information. The diagram also shows the structure of the FlexO-x characteristic information (FlexO-x_CI) and the FlexO-x adapted information (FlexO-x_AI).](8c43614237e5bb57f1d5cf614291b32e_img.jpg) - -The diagram illustrates the FlexO overhead structure at the FlexO-x\_AP. It is divided into two 128-bit blocks, block #9 and block #8, each shown as a 16-byte grid. - -- Block #9:** - - Bytes 1-8: MAP (LSB) - - Bytes 9-12: FCC (LSB/RES) - - Bytes 13-16: OSMC/RES -- Block #8:** - - Bytes 1-8: GID - - Bytes 9-12: IID - - Bytes 13-16: Client mapping specific information - -The Client mapping specific information in Block #8 is further detailed with two tables: - -| Frame # | JC4 | JC1 | -|---------|-----|-----| -| 2 | JC5 | JC2 | -| 3 | JC6 | JC3 | -| 4 | MSI | | -| 5 | JC4 | JC1 | -| 6 | JC5 | JC2 | -| 7 | JC6 | JC3 | -| 8 | | | - - - -| Frame # | FlexO instance #1 in a FlexO-x | FlexO instance #2..n in a FlexO-x | -|---------|--------------------------------|-----------------------------------| -| 1 | FCC (MSB) | FCC (LSB) | -| 2 | RES | RES | - -Figure 15-1.2 – FlexO overhead at FlexO-x\_AP. The diagram shows the structure of FlexO overhead across 16 bytes (128 bits) for two blocks, block #9 and block #8. Block #9 contains MAP (LSB), FCC (LSB/RES), and OSMC/RES. Block #8 contains GID, IID, and Client mapping specific information. The Client mapping specific information includes a table for multiplexed OTUCn client mapping and a table for FlexO instance specific information. The diagram also shows the structure of the FlexO-x characteristic information (FlexO-x\_CI) and the FlexO-x adapted information (FlexO-x\_AI). - -Figure 15-1.2 – FlexO overhead at FlexO-x\_AP - -### FlexO-x characteristic information - -The FlexO-x characteristic information (FlexO-x\_CI) is the FlexO-x\_AI plus one instance of valid FlexO-x trail overhead (STAT(RPF), CRC16), together with a frame and multi-frame start. - -The FlexO-x overhead present at the FlexO-x\_CP is shown in Figure 15-1.3. - -![Figure 15-1.3: FlexO overhead at FlexO-x_CP. This diagram shows the structure of FlexO overhead across multiple 128-bit blocks. The top part shows a grid of 16 bytes per block, with rows 1-8 for data and rows 9-10 for overhead. Row 9 contains MAP (LSB), CRC16, and FCC (MSB)/RES. Row 10 contains FCC (LSB)/RES and OSMC/RES. Below this, two detailed overhead structures are shown. The left structure for '128-bit block #9' shows a frame number, OSMC, RES, and FlexO instance #1. The right structure for '128-bit block #8' shows a frame number, GID, IID, and a 'Client mapping specific' section containing PT. At the bottom, a table shows the mapping of FlexO instances to client mappings (JC1-JC6, MSI) across multiple frames.](d11039755489421fdcdad3ed6edd05d8_img.jpg) - -Figure 15-1.3: FlexO overhead at FlexO-x\_CP. This diagram shows the structure of FlexO overhead across multiple 128-bit blocks. The top part shows a grid of 16 bytes per block, with rows 1-8 for data and rows 9-10 for overhead. Row 9 contains MAP (LSB), CRC16, and FCC (MSB)/RES. Row 10 contains FCC (LSB)/RES and OSMC/RES. Below this, two detailed overhead structures are shown. The left structure for '128-bit block #9' shows a frame number, OSMC, RES, and FlexO instance #1. The right structure for '128-bit block #8' shows a frame number, GID, IID, and a 'Client mapping specific' section containing PT. At the bottom, a table shows the mapping of FlexO instances to client mappings (JC1-JC6, MSI) across multiple frames. - -Figure 15-1.3 – FlexO overhead at FlexO-x\_CP - -## 15.1 Connection functions - -Not applicable. - -## 15.2 Termination functions - -### 15.2.1 FlexO trail termination function (FlexO\_TT) - -The FlexO\_TT function terminates the section monitoring overhead of the FlexO overhead to determine the status of the FlexO trail. Figure 15-2 shows the combination of the unidirectional sink and source functions to form a bidirectional function. - -![Figure 15-2: FlexO_TT. This diagram shows two unidirectional FlexO_TT functions. The left side shows a sink function where a signal flows from FlexO_AP through a FlexO triangle to FlexO_TCP. The right side shows a source function where a signal flows from FlexO_TCP through a FlexO triangle to FlexO_AP. The text 'G.798(17)-Amd.3(21)_F15-2' is at the bottom.](53c60f255aa58c330efd23c77dfdc762_img.jpg) - -Figure 15-2: FlexO\_TT. This diagram shows two unidirectional FlexO\_TT functions. The left side shows a sink function where a signal flows from FlexO\_AP through a FlexO triangle to FlexO\_TCP. The right side shows a source function where a signal flows from FlexO\_TCP through a FlexO triangle to FlexO\_AP. The text 'G.798(17)-Amd.3(21)\_F15-2' is at the bottom. - -Figure 15-2 – FlexO\_TT - -#### 15.2.1.1 FlexO trail termination source function (FlexO\_TT\_So) - -The FlexO\_TT\_So function relays the FlexO signal at its FlexO\_AP input to its FlexO\_TCP. - -The information flow and processing of the FlexO\_TT\_So function is defined with reference to Figures 15-3 and 15-4. - -## Symbol - -![Symbol diagram for FlexO_TT_So function. It shows a downward arrow from FlexO_AP to a triangle labeled FlexO, which then points down to FlexO_TCP. Below the diagram is the text G.798(17)-Amd.3(21)_F15-3.](ce543c6123474723be64e31597330590_img.jpg) - -G.798(17)-Amd.3(21)\_F15-3 - -Symbol diagram for FlexO\_TT\_So function. It shows a downward arrow from FlexO\_AP to a triangle labeled FlexO, which then points down to FlexO\_TCP. Below the diagram is the text G.798(17)-Amd.3(21)\_F15-3. - -**Figure 15-3 – FlexO\_TT\_So function** - -## Interfaces - -**Table 15-1 – FlexO\_TT\_So inputs and outputs** - -| Input(s) | Output(s) | -|------------------------------------------------------------------------------|-------------------------------------------------------------------------------| -| FlexO_AP:
FlexO_AI_CK
FlexO_AI_D
FlexO_AI_FS
FlexO_AI_MFS | FlexO_TCP:
FlexO_CI_CK
FlexO_CI_D
FlexO_CI_FS
FlexO_CI_MFS | - -## Processes - -The processes associated with the FlexO\_TT\_So function are as depicted in Figure 15-3. - -![Process diagram for FlexO_TT_So. It shows four vertical arrows representing data flows from FlexO_AP (labeled AI_D, AI_CK, AI_FS, AI_MFS) to FlexO_TCP (labeled CI_D, CI_CK, CI_FS, CI_MFS). Below the diagram is the text G.978(17)-Amd.3(21)_F15-4.](4a5c1280cac5c4924f49158846cde66c_img.jpg) - -G.978(17)-Amd.3(21)\_F15-4 - -Process diagram for FlexO\_TT\_So. It shows four vertical arrows representing data flows from FlexO\_AP (labeled AI\_D, AI\_CK, AI\_FS, AI\_MFS) to FlexO\_TCP (labeled CI\_D, CI\_CK, CI\_FS, CI\_MFS). Below the diagram is the text G.978(17)-Amd.3(21)\_F15-4. - -**Figure 15-4 – FlexO\_TT\_So processes** - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -### 15.2.1.2 FlexO trail termination sink function (FlexO\_TT\_Sk) - -The FlexO\_TT\_Sk function reports the state of the FlexO trail. - -The information flow and processing of the FlexO\_TT\_Sk function is defined with reference to Figures 15-5 and 15-6. - -## Symbol - -![Symbol diagram for FlexO function. A triangle labeled 'FlexO' has an input arrow from 'FlexO_TCP' at the bottom vertex, an output arrow from the top vertex to 'FlexO_AP', and an output arrow from the left side to 'FlexO_TT_Sk_MP'. Below the diagram is the text 'G.798(17)-Amd.3(21)_F15-5'.](278814bf2c6d42b5817a334979f10bc0_img.jpg) - -Symbol diagram for FlexO function. A triangle labeled 'FlexO' has an input arrow from 'FlexO\_TCP' at the bottom vertex, an output arrow from the top vertex to 'FlexO\_AP', and an output arrow from the left side to 'FlexO\_TT\_Sk\_MP'. Below the diagram is the text 'G.798(17)-Amd.3(21)\_F15-5'. - -Figure 15-5 – FlexO\_TT\_Sk function - -## Interfaces - -Table 15-2 – FlexO\_TT\_Sk inputs and outputs - -| Input(s) | Output(s) | -|------------------------------------------------------------------------------------------------------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| FlexO_TCP:
FlexO_CI_CK
FlexO_CI_D
FlexO_CI_FS
FlexO_CI_MFS
FlexO_CI_CRCerr
FlexO_CI_SSF | FlexO_AP:
FlexO_AI_CK
FlexO_AI_D
FlexO_AI_FS
FlexO_AI_MFS
FlexO_AI_CRCerr
FlexO_AI_TSF
FlexO_TT_Sk_MP:
FlexO_TT_Sk_MI_cSSF | - -## Processes - -The processes associated with the FlexO\_TT\_Sk function are as depicted in Figure 15-6. - -![Diagram of FlexO_TT_Sk processes showing internal components and interfaces.](14d497ab16a07c50b3215ffef2149ab9_img.jpg) - -The diagram illustrates the internal structure of the FlexO\_TT\_Sk\_MP process. It features a central grey rectangular block representing the process. Inside, there are two white boxes: 'Consequent actions' at the top and 'Defect correlations' on the left. Arrows indicate internal flow: from 'CI\_SSF' to 'Consequent actions', and from 'CI\_SSF' to 'Defect correlations'. From 'Defect correlations', an arrow points to 'MI\_cSSF', which then points out of the process boundary to the left. On the right side, several vertical arrows point upwards from the bottom (FlexO\_TCP) to the top (FlexO\_AP). These are labeled from left to right: 'CI\_SSF', 'CI\_FS', 'CI\_MFS', 'CI\_CK', 'CI\_CRCerr', and 'CI\_D'. Above the 'Consequent actions' box, an arrow labeled 'aTSF' points upwards to the top interface 'AI\_TSF'. Other top interfaces are labeled 'AI\_FS', 'AI\_MFS', 'AI\_CK', 'AI\_CRCerr', and 'AI\_D'. The bottom of the diagram is labeled 'FlexO\_TCP' and the top 'FlexO\_AP'. A small text 'G.798(17)-Amd.3(21)\_F15-6' is at the bottom right. - -Diagram of FlexO\_TT\_Sk processes showing internal components and interfaces. - -Figure 15-6 – FlexO\_TT\_Sk processes - -**Defects:** None. - -**Consequent actions** - -The function shall perform the following consequent action: - -aTSF ← CI\_SSF - -**Defect correlations** - -The function shall perform the following defect correlation to determine the most probable fault cause. This fault cause shall be reported to the EMF. - -cSSF ← CI\_SSF - -**Performance monitoring:** None. - -**15.2.2 FlexO-x trail termination function (FlexO-x\_TT)** - -The FlexO-x\_TT function terminates the section monitoring overhead of the FlexO-x overhead to determine the status of the FlexO-x trail. Figure 15-6.1 shows the combination of the unidirectional sink and source functions to form a bidirectional function. - -![Diagram of FlexO-x_TT showing bidirectional flow between FlexO-x_AP and FlexO-x_TCP via FlexO-x blocks.](af664ceebdaf69ac46f3af52f51df20e_img.jpg) - -The diagram shows two identical FlexO-x blocks, each represented by a downward-pointing triangle. The left block has an input arrow from 'FlexO-x\_AP' at the top and an output arrow to 'FlexO-x\_TCP' at the bottom. The right block has an input arrow from 'FlexO-x\_TCP' at the bottom and an output arrow to 'FlexO-x\_AP' at the top. A horizontal arrow labeled 'FlexO-x\_RP' points from the right block to the left block, indicating a bidirectional relationship between the two unidirectional functions. A small text 'G.798(17)-Amd.3(21)\_F15-6.1' is at the bottom right. - -Diagram of FlexO-x\_TT showing bidirectional flow between FlexO-x\_AP and FlexO-x\_TCP via FlexO-x blocks. - -Figure 15-6.1 – FlexO-x\_TT - -### 15.2.2.1 FlexO-x trail termination source function (FlexO-x\_TT\_So) - -The FlexO\_TT\_So function adds FlexO-x section monitoring overhead – including the RPF signal – in the STAT overhead field to the FlexO-x signal at its FlexO-x\_AP. - -The information flow and processing of the FlexO-x\_TT\_So function is defined with reference to Figures 15-6.2 and 15-6.3. - -#### Symbol - -![Symbol diagram for the FlexO-x_TT_So function. It shows an input FlexO-x_AP entering a triangle labeled 'FlexO-x' from the top. An input FlexO-x_RP enters the triangle from the right. The output is FlexO-x_TCP exiting from the bottom. Below the triangle is the text 'G.798(17)-Amd.3(21)_F15-6.2'.](95ca5789af2916f3ebaf64172683c29b_img.jpg) - -Symbol diagram for the FlexO-x\_TT\_So function. It shows an input FlexO-x\_AP entering a triangle labeled 'FlexO-x' from the top. An input FlexO-x\_RP enters the triangle from the right. The output is FlexO-x\_TCP exiting from the bottom. Below the triangle is the text 'G.798(17)-Amd.3(21)\_F15-6.2'. - -Figure 15-6.2 – FlexO-x\_TT\_So function - -#### Interfaces - -Table 15-2.1 – FlexO-x\_TT\_So inputs and outputs - -| Input(s) | Output(s) | -|--------------------------------------------------------------------------------------------------------------------------------------|-----------------------------------------------------------------------------------------------| -| FlexO-x_AP:
FlexO-x_AI_CK
FlexO-x_AI_D[1..x]
FlexO-x_AI_FS
FlexO-x_AI_MFS
FlexO-x_RP:
FlexO-x_RI_RPF | FlexO-x_TCP:
FlexO-x_CI_CK
FlexO-x_CI_D[1..x]
FlexO-x_CI_FS
FlexO-x_CI_MFS | - -#### Processes - -The processes associated with the FlexO-x\_TT\_So function are as depicted in Figure 15-12. - -**STAT-RPF:** The remote PHY fault indication is inserted in the RPF bit position of the STAT field of FlexO instance #1 of the FlexO-x as described in clause 9.2.5 of [ITU-T G.709.1]. Its value is derived from reference point FlexO-x\_RP. Upon the declaration/clearing of aRPF at the termination sink function, the trail termination source function shall have inserted/removed the RPF indication within 50 ms. - -**STAT-RES:** The RES field is reserved for future international standardization. The value shall be fixed to 00. - -**CRC-16:** The function shall compute the CRC-16 and insert the calculated CRC-16 value into the CRC-16 byte of the FlexO overhead field in every FlexO instance of the FlexO-x as described in clause 9.2.7 of [ITU-T G.709.1]. - -![Figure 15-6.3 – FlexO-x_TT_So processes. This diagram shows the internal processing of FlexO-x_TT_So. At the top, FlexO-x_AP inputs include AI_D[x], AI_D[2], AI_D[1], AI_CK, AI_FS, and AI_MFS. These pass through a series of 'OH insertion' and 'Compute and insert CRC-16' blocks. An 'Insert RPF' block receives RI_RPF and outputs to the third 'OH insertion' block. The bottom outputs are FlexO-x_TCP signals: CI_D[x], CI_D[2], CI_D[1], CI_CK, CI_FS, and CI_MFS. A label 'FlexO-x_RP' is on the right side. Reference G.798(17)-Amd.3(21)_F15-6.3 is at the bottom right.](04a21eb4cd167fac602b875e961ded35_img.jpg) - -Figure 15-6.3 – FlexO-x\_TT\_So processes. This diagram shows the internal processing of FlexO-x\_TT\_So. At the top, FlexO-x\_AP inputs include AI\_D[x], AI\_D[2], AI\_D[1], AI\_CK, AI\_FS, and AI\_MFS. These pass through a series of 'OH insertion' and 'Compute and insert CRC-16' blocks. An 'Insert RPF' block receives RI\_RPF and outputs to the third 'OH insertion' block. The bottom outputs are FlexO-x\_TCP signals: CI\_D[x], CI\_D[2], CI\_D[1], CI\_CK, CI\_FS, and CI\_MFS. A label 'FlexO-x\_RP' is on the right side. Reference G.798(17)-Amd.3(21)\_F15-6.3 is at the bottom right. - -Figure 15-6.3 – FlexO-x\_TT\_So processes - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -**15.2.2.2 FlexO-x trail termination sink function (FlexO-x\_TT\_Sk)** - -The FlexO-x\_TT\_Sk function reports the state of the FlexO-x trail. It extracts FlexO-x monitoring overhead – including the RPF signal – in the STAT overhead field from the FlexO signal at its FlexO-x\_TCP, detects for the RPF defect, and forwards the error and defect information as backward indications to the companion FlexO-x\_TT\_So function. - -The information flow and processing of the FlexO-x\_TT\_Sk function is defined with reference to Figures 15-6.4 and 15-6.5. - -**Symbol** - -![Figure 15-6.4 – FlexO-x_TT_Sk function. This symbol diagram shows a central triangle labeled 'FlexO-x'. Inputs/Outputs are: FlexO-x_AP (top, pointing up), FlexO-x_TT_Sk_MP (left, pointing left), FlexO-x_RP (right, pointing right), and FlexO-x_TCP (bottom, pointing up). Reference G.798(17)-Amd.3(21)_F15-6.4 is at the bottom right.](f3d0615dd9e87088a29786cc6a1c8a35_img.jpg) - -Figure 15-6.4 – FlexO-x\_TT\_Sk function. This symbol diagram shows a central triangle labeled 'FlexO-x'. Inputs/Outputs are: FlexO-x\_AP (top, pointing up), FlexO-x\_TT\_Sk\_MP (left, pointing left), FlexO-x\_RP (right, pointing right), and FlexO-x\_TCP (bottom, pointing up). Reference G.798(17)-Amd.3(21)\_F15-6.4 is at the bottom right. - -Figure 15-6.4 – FlexO-x\_TT\_Sk function - -## Interfaces - -**Table 15-2.2 – FlexO-*x*\_TT\_Sk inputs and outputs** - -| Input(s) | Output(s) | -|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| FlexO-x_TCP:
FlexO- x _CI_CK
FlexO- x _CI_D[1.. x ]
FlexO- x _CI_FS
FlexO- x _CI_MFS
FlexO- x _CI_SSF | FlexO-x_AP:
FlexO- x _AI_CK
FlexO- x _AI_D[1.. x ]
FlexO- x _AI_FS
FlexO- x _AI_MFS
FlexO- x _AI_CRCerr[1.. x ]
FlexO- x _AI_TSF
FlexO-x_RP:
FlexO- x _RI_RPF
FlexO-x_TT_Sk_MP:
FlexO- x _TT_Sk_MI_cRDI
FlexO- x _TT_Sk_MI_cSSF | - -## Processes - -The processes associated with the FlexO-*x*\_TT\_Sk function are as depicted in Figure 15-14. - -**CRC-16:** See clause 9.2.7 of [ITU-T G.709.1]. The CRC-16 is extracted from the CRC-16 field in every FlexO instance of the FlexO-*x*. If the extracted CRC-16 value can be divided by the expected polynomial, CRCerr[*j*] (*j* = 1..*x*) is set to 0 (the default value); otherwise, CRCerr[*j*] is set to 1. - -**STAT-RPF:** The remote PHY fault indication shall be recovered from the RPF bit position of the accepted STAT value in FlexO instance #1 of the FlexO-*x* as described in clause 9.2.5 of [ITU-T G.709.1]. A new STAT value is accepted if a new value of the STAT field is received in a FlexO overhead frame with good CRC. The STAT-RPF shall be used for RPF defect detection. - -**STAT-RES:** RES in the STAT field in the FlexO signal at the FlexO\_TCP is reserved for future international standardization. For this version of this Recommendation, its value shall be ignored. - -![Figure 15-6.5 – FlexO-x_TT_Sk processes. This block diagram illustrates the internal processing flow of the FlexO-x_TT_Sk function. On the left, the FlexO-x_TT_Sk_MP interface provides inputs MI_cRDI and MI_cSSF. MI_cRDI enters an 'Extract RPF' block, which outputs aRPF to 'Consequent actions' and dRDI to 'Defect correlations'. MI_cSSF enters 'Defect correlations', which outputs RI_RPF. 'Consequent actions' outputs aTSF. The main processing path consists of multiple instances (1 to x) of 'Overhead access' blocks. Each instance receives CI_D[i] and produces CRCerr[i] and AI_D[i]. Between each 'Overhead access' block is an 'Extract, compute and compare CRC-16' block that receives CRCerr[i-1] and produces CRCerr[i]. The first instance also receives CI_SSF, CI_FS, CI_MFS, and CI_CK, and produces AI_TSF, AI_FS, AI_MFS, and AI_CK. The final instance produces AI_CRCerr[x] and AI_D[x]. The entire process is labeled FlexO-x_TT_Sk_MP on the left and FlexO-x_AP on the right. The bottom of the diagram is labeled FlexO-x_TCP.](98a6715208267336f8339163b005c28f_img.jpg) - -Figure 15-6.5 – FlexO-x\_TT\_Sk processes. This block diagram illustrates the internal processing flow of the FlexO-x\_TT\_Sk function. On the left, the FlexO-x\_TT\_Sk\_MP interface provides inputs MI\_cRDI and MI\_cSSF. MI\_cRDI enters an 'Extract RPF' block, which outputs aRPF to 'Consequent actions' and dRDI to 'Defect correlations'. MI\_cSSF enters 'Defect correlations', which outputs RI\_RPF. 'Consequent actions' outputs aTSF. The main processing path consists of multiple instances (1 to x) of 'Overhead access' blocks. Each instance receives CI\_D[i] and produces CRCerr[i] and AI\_D[i]. Between each 'Overhead access' block is an 'Extract, compute and compare CRC-16' block that receives CRCerr[i-1] and produces CRCerr[i]. The first instance also receives CI\_SSF, CI\_FS, CI\_MFS, and CI\_CK, and produces AI\_TSF, AI\_FS, AI\_MFS, and AI\_CK. The final instance produces AI\_CRCerr[x] and AI\_D[x]. The entire process is labeled FlexO-x\_TT\_Sk\_MP on the left and FlexO-x\_AP on the right. The bottom of the diagram is labeled FlexO-x\_TCP. - -G.798(17)-Amd.3(21)\_F15-6.5 - -**Figure 15-6.5 – FlexO-*x*\_TT\_Sk processes** - -**Defects** - -The function shall detect the dRDI defect. - -**dRDI:** If the extracted RPF is "1", dRDI shall be declared; Otherwise, dRDI shall be cleared; dRDI shall be set to false during CI\_SSF. - -**Consequent actions** - -The function shall perform the following consequent actions: - -aRPF $\leftarrow$ CI\_SSF - -aTSF $\leftarrow$ CI\_SSF - -**Defect correlations** - -The function shall perform the following defect correlations to determine the most probable fault cause. This fault cause shall be reported to the EMF. - -cRDI $\leftarrow$ dRDI - -cSSF $\leftarrow$ CI\_SSF - -**Performance monitoring:** None. - -**15.3 Adaptation functions****15.3.1 FlexO-n to OTUCn adaptation function (FlexO-n/OTUCn\_A)** - -The FlexO-n to OTUCn adaptation functions perform the adaptation between the FlexO-n layer adapted information and the characteristic information of the OTUCn layer signal. - -**15.3.1.1 FlexO-n to OTUCn adaptation source function (FlexO-n/OTUCn\_A\_So)** - -The FlexO-n to OTUCn adaptation source function is defined for OTUCn. - -The information flow and processing of the FlexO-n/OTUCn\_A\_So function is defined with reference to Figures 15-7 and 15-8. - -**Symbol**![Functional block diagram of FlexO-n/OTUCn_A_So. A trapezoidal block labeled 'FlexO-n/OTUCn' has a top input 'OTUCn_CP', a side input 'FlexO-n/OTUCn_A_So_MP', and multiple bottom outputs 'FlexO_AP[1]' through 'FlexO_AP[n]'.](eaaf53ac65d77e590778a391a25b92e4_img.jpg) - -``` - -graph TD - MP[FlexO-n/OTUCn_A_So_MP] --> Block - CP[OTUCn_CP] --> Block - subgraph Block [FlexO-n/OTUCn] - direction TB - L1[1] --- Ln[n] - end - Block --> AP1[FlexO_AP[1]] - Block --> APn[FlexO_AP[n]] - -``` - -G.798(17)\_F15-7 - -Functional block diagram of FlexO-n/OTUCn\_A\_So. A trapezoidal block labeled 'FlexO-n/OTUCn' has a top input 'OTUCn\_CP', a side input 'FlexO-n/OTUCn\_A\_So\_MP', and multiple bottom outputs 'FlexO\_AP[1]' through 'FlexO\_AP[n]'. - -**Figure 15-7 – FlexO-n/OTUCn\_A\_So function** - -## Interfaces - -**Table 15-3 – FlexO-n/OTUCn\_A\_So inputs and outputs** - -| Input(s) | Output(s) | -|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|----------------------------------------------------------------------------------| -| OTUCn_CP:
OTUCn_CI_CK
OTUCn_CI_D
OTUCn_CI_FS
OTUCn_CI_MFS
FlexO-n/OTUCn_A_So_MP:
FlexO-n/OTUCn_A_So_MI_TxGID
FlexO-n/OTUCn_A_So_MI_TxIID[1..n]
FlexO-n/OTUCn_A_So_MI_TxFMAP | n × FlexO_AP:
FlexO_AI_D
FlexO_AI_CK
FlexO_AI_FS
FlexO_AI_MFS | - -## Processes - -The processes associated with the FlexO-n/OTUCn\_A\_So function are as depicted in Figure 15-8. - -**OTUCn FAS/MFAS insertion:** The function shall insert the FAS and MFAS into the OTUCn OH area as described in clause 11.3 of [ITU-T G.709]. - -**OTUCn distribution:** The function shall divide OTUCn into n OTUC instance signals as described in clause 10.1.1 of [ITU-T G.709.1]. - -**Clock generation:** The function shall generate the FlexO (AI\_CK) clock by multiplying the incoming OTUCn clock (CI\_CK) by a factor of $1/n \times 4112/4097$ . The clock parameters, including jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCb clock), apply. During failure conditions of the incoming OTUCn clock signal (CI\_CK), the FlexO clock shall stay within its limits as defined in [ITU-T G.8251] and no frame phase discontinuity shall be introduced. - -**FS and MFS generator:** The function shall generate FlexO frame and multi-frame starter identifier as described in clause 8.1 and 8.2 of [ITU-T G.709.1]. - -**Mapping:** The function shall map the OTUC instance signal into FlexO frame payload area as defined in clause 10.2.2 of [ITU-T G.709.1] and the fixed stuff bits in the 8-frame multi-frame payload area shall be set to all-ZEROs. - -NOTE – In order to minimize implementation complexity and avoid the skew introduction between n OTUC instance signals, n lanes of mapping may use one unified mapping control mechanism to complete all the mapping processes and keep actions consistent between them. - -**All-0's OH insertion:** The function shall insert all-ZEROs into all the FlexO AM, EOH and BOH bit locations. - -**FlexO OH Insertion:** The function shall insert the overhead information of FlexO group signal in the corresponding overhead area (GID, IID, MAP and RES) as defined in clause 9.2 of [ITU-T G.709.1]. - -**FlexO GID:** The FlexO group identifier is inserted in the GID field. Its value is derived from reference point FlexO\_TT\_So\_MP. The GID format is described in clause 9.2.2.1 of [ITU-T G.709.1]. - -**FlexO IID:** The FlexO Instance Identifier is inserted in the IID field. Its value is derived from reference point FlexO\_TT\_So\_MP. The IID format is described in clause 9.2.2.2 of [ITU-T G.709.1]. - -**FlexO MAP:** The FlexO instance map is inserted in the FlexO MAP field. Its value is derived from reference point FlexO\_TT\_So\_MP. The FlexO MAP format is described in clause 9.2.2.3 of [ITU-T G.709.1]. - -**RES:** The function shall insert all-ZEROs into the RES bytes. - -![Figure 15-8 – FlexO-n/OTUCn_A_So processes. This block diagram illustrates the transmission path for FlexO-n signals to OTUCn. At the top, OTUCn_CP inputs (CI_D, CI_CK, CI_FS, CI_MFS) enter an 'OTUCn FAS/MFAS insertion' block. This block outputs CI_CK to a 'Clock generator', which in turn provides AI_CK, AI_FS, and AI_MFS to an 'FS and MFS generator'. The 'OTUCn FAS/MFAS insertion' block also outputs D, CK, and FS signals to an 'OTUCn distribution' block. The 'OTUCn distribution' block outputs OTUC #1 and OTUC #n signals. Each OTUC signal (e.g., OTUC #1) enters an 'Elastic store' block with inputs D, CK, and FS, and outputs WR and RD. The 'Elastic store' block outputs AI_CK, AI_FS, and AI_MFS signals. Below the 'Elastic store' is a block 'Insert all-0's in all FlexO AM, EOH, BOH bits'. This is followed by a 'FlexO overhead insertion' block. The 'FlexO overhead insertion' block receives inputs from 'Insert IID' (MI_TxIID[1]), 'Insert GID' (MI_TxGID), 'Insert MAP' (MI_TxFMAP), and 'Insert RES'. The 'FlexO overhead insertion' block outputs AI_D, AI_CK, AI_FS, and AI_MFS signals, which are grouped as FlexO_AP[1]. The same process is shown for OTUC #n, with inputs MI_TxIID[n], MI_TxGID, MI_TxFMAP, and MI_TxRES, resulting in FlexO_AP[n] outputs. A vertical label on the right side reads 'FlexO-n/OTUCn_A_So_MP'. The diagram is labeled G.798(17)-Amd.4(22)_F15-8.](5d70cb9af3e025f57d437dc84524e9a4_img.jpg) - -Figure 15-8 – FlexO-n/OTUCn\_A\_So processes. This block diagram illustrates the transmission path for FlexO-n signals to OTUCn. At the top, OTUCn\_CP inputs (CI\_D, CI\_CK, CI\_FS, CI\_MFS) enter an 'OTUCn FAS/MFAS insertion' block. This block outputs CI\_CK to a 'Clock generator', which in turn provides AI\_CK, AI\_FS, and AI\_MFS to an 'FS and MFS generator'. The 'OTUCn FAS/MFAS insertion' block also outputs D, CK, and FS signals to an 'OTUCn distribution' block. The 'OTUCn distribution' block outputs OTUC #1 and OTUC #n signals. Each OTUC signal (e.g., OTUC #1) enters an 'Elastic store' block with inputs D, CK, and FS, and outputs WR and RD. The 'Elastic store' block outputs AI\_CK, AI\_FS, and AI\_MFS signals. Below the 'Elastic store' is a block 'Insert all-0's in all FlexO AM, EOH, BOH bits'. This is followed by a 'FlexO overhead insertion' block. The 'FlexO overhead insertion' block receives inputs from 'Insert IID' (MI\_TxIID[1]), 'Insert GID' (MI\_TxGID), 'Insert MAP' (MI\_TxFMAP), and 'Insert RES'. The 'FlexO overhead insertion' block outputs AI\_D, AI\_CK, AI\_FS, and AI\_MFS signals, which are grouped as FlexO\_AP[1]. The same process is shown for OTUC #n, with inputs MI\_TxIID[n], MI\_TxGID, MI\_TxFMAP, and MI\_TxRES, resulting in FlexO\_AP[n] outputs. A vertical label on the right side reads 'FlexO-n/OTUCn\_A\_So\_MP'. The diagram is labeled G.798(17)-Amd.4(22)\_F15-8. - -Figure 15-8 – FlexO-n/OTUCn\_A\_So processes - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -### 15.3.1.2 FlexO-n to OTUCn adaptation sink function (FlexO-n/OTUCn\_A\_Sk) - -The FlexO-n to OTUCn adaptation sink function is defined for OTUCn. - -The information flow and processing of the FlexO-n/OTUCn\_A\_Sk function is defined with reference to Figures 15-9 and 15-10. - -## Symbol - -![Diagram of the FlexO-n/OTUCn_A_Sk function symbol. It shows a trapezoidal block labeled 'FlexO-n/OTUCn'. Above the block, an arrow points up to 'OTUCn_CP'. Below the block, multiple arrows point up from 'FlexO_AP[1]' to 'FlexO_AP[n]', with a dashed line and ellipsis between them. To the left of the block, an arrow points left to 'FlexO-n/OTUCn_A_Sk_MP'. The reference 'G.798(17)_F15-9' is shown at the bottom right.](30b76717cca15621840d1c16fff50f89_img.jpg) - -Diagram of the FlexO-n/OTUCn\_A\_Sk function symbol. It shows a trapezoidal block labeled 'FlexO-n/OTUCn'. Above the block, an arrow points up to 'OTUCn\_CP'. Below the block, multiple arrows point up from 'FlexO\_AP[1]' to 'FlexO\_AP[n]', with a dashed line and ellipsis between them. To the left of the block, an arrow points left to 'FlexO-n/OTUCn\_A\_Sk\_MP'. The reference 'G.798(17)\_F15-9' is shown at the bottom right. - -Figure 15-9 – FlexO-n/OTUCn\_A\_Sk function - -## Interfaces - -Table 15-4 – FlexO-n/OTUCn\_A\_Sk inputs and outputs - -| Input(s) | Output(s) | -|----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| n × FlexO_AP:
FlexO_AI_D
FlexO_AI_CK (Note)
FlexO_AI_FS
FlexO_AI_MFS
FlexO_AI_CRCerr
FlexO_AI_TSF
FlexO-n/OTUCn_A_Sk_MP:
FlexO-n/OTUCn_A_Sk_MI_ExGID
FlexO-n/OTUCn_A_Sk_MI_ExFMAP | OTUCn_CP:
OTUCn_CI_CK
OTUCn_CI_D
OTUCn_CI_FS
OTUCn_CI_MFS
OTUCn_CI_SSF
FlexO-n/OTUCn_A_Sk_MP:
FlexO-n/OTUCn_A_Sk_MI_AcGID[1..n]
FlexO-n/OTUCn_A_Sk_MI_AcFMAP[1..n]
FlexO-n/OTUCn_A_Sk_MI_AcIID[1..n]
FlexO-n/OTUCn_A_Sk_MI_cLOFLOM[1..n]
FlexO-n/OTUCn_A_Sk_MI_cGIDM
FlexO-n/OTUCn_A_Sk_MI_cFMM
FlexO-n/OTUCn_A_Sk_MI_cLOL | -| NOTE – The function only needs one FlexO_AI_CK, e.g., FlexO_AI_CK[1]. | | - -## Processes - -The processes associated with the FlexO-n/OTUCn\_A\_Sk function are as depicted in Figure 15-10. - -**FlexO OH Extraction:** The function shall extract the overhead of FlexO group interface (GID, IID and MAP) from each FlexO frame as defined in clause 9.2 of [ITU-T G.709.1]. - -**FlexO GID:** The GID fields shall be extracted from the FlexO overhead and processed as specified in clause B.2.2.1. The accepted GID values are available at the MP (MI\_AcGID[i]) and are used for dGIDM defect detection. - -NOTE – A GID field carrying an all-0's value indicates the presence of an unequipped FlexO instance. Such unequipped FlexO instance represents a FlexO-x configuration mistake. - -**FlexO IID:** The IID fields shall be extracted from the FlexO overhead and processed as specified in clause B.2.2.2.1. The accepted IID values are available at the MP (MI\_AcIID[i]) and are used for dFMM defect detection. - -**FlexO MAP:** The FlexO MAP fields shall be extracted from the FlexO overhead and processed as specified in clause B.2.2.3.1. The accepted MAP values are available at the MP (MI\_AcFMAP[i]) and are used for dFMM defect detection. - -**FlexO-n Reorder:** The function shall reorder n FlexO instances based on IID as described in clauses 9.2.3 and 10.3 of [ITU-T G.709.1]. - -**Demapping:** The function shall demap the OTUC instance signal from FlexO frame as described in clause 10.1.2 of [ITU-T G.709.1]. - -**OTUCn Frame and multi-frame alignment:** The function shall recover the OTUC instance frame start and multi-frame start as described in clause 8.2.3. - -**OTUCn Deskew:** The function shall compensate the skew between n OTUC instances based on OTUC instance frame start indication as described in clause 10.1.4 of [ITU-T G.709.1]. The alignment process shall establish the delay compensation, compensating the differential delay between the FlexO instance signals as given in clause 10.1.4 of [ITU-T G.709.1]. The compensation between the FlexO instances is achieved by an elastic store per OTUC instance. Each OTUC instance signal shall be written into an elastic store with the OTUC frame start indication. Each elastic store shall be capable of compensating at least 300 ns of absolute differential delay between the OTUC instances for FlexO-SR applications and at least 1 $\mu$ s of absolute differential delay between the OTUC instances for FlexO-LR applications. The process has two states, out-of-multilane-alignment (OLA) and in-multilane-alignment (ILA). The alignment start shall be maintained during the OLA state. In the OLA state, if the bytes of the OTUC instances signals can be written consistently into the elastic store in the presence of a differential delay in line without exceeding the buffering time, the ILA state shall be entered. In this case, the differential delay can be compensated. In the ILA state, if the differential delay between two OTUC instances exceeds the maximum delay that can be compensated, the OLA state shall be entered. - -**OTUCn Recover:** The function shall recombine n OTUC instances into an OTUCn as described in clause 10.1.1 of [ITU-T G.709.1]. - -![Figure 15-10 – FlexO-n/OTUCn_A_Sk processes. This block diagram illustrates the internal architecture of the FlexO-n/OTUCn_A_Sk processes. At the bottom, multiple FlexO_AP inputs (labeled FlexO_AP[1] to FlexO_AP[n]) are shown, each with signals AI_D, AI_CK, AI_FS, AI_MFS, AI_TSF, and AI_CRCerr. These inputs feed into 'Extract GID', 'Extract IID', and 'Extract MAP' blocks, which output AcGID, AcIID, and AcFMAP respectively, along with CRCerr. These signals then pass through a 'FlexO-n Reorder' block. Above this, 'Elastic store' blocks (WR and RD) are connected to 'Frame and multiframe alignment' blocks, which output dLOFLOM[1] to dLOFLOM[n]. A 'Clock generator' block receives CK[1] and provides WR and RD signals. The alignment blocks feed into 'OTUCn deskew' and 'OTUCn recover' blocks, which output CL_D, CL_CK, CL_FS, and CL_MFS. To the right, detection blocks for 'dGIDM detection', 'dFMM detection', and 'Defect correlations' receive various inputs (AI_TSF, AcGID, dLOFLOM, dLOL, dFMM, dGIDM) and output MI_ExGID, MI_ExFMAP, MI_cLOFLOM, MI_cLOL, MI_cFMM, MI_cGIDM, MI_AcGID, MI_AcIID, and MI_AcFMAP. A 'Consequent actions' block at the top right receives dGIDM, dFMM, dLOL, dLOFLOM, and AI_TSF, and outputs aSSF. The diagram is labeled G.798(17)-Amd.4(22)_F15-10 and has a vertical label FlexO-n/OTUCn_A_Sk_MP on the right.](7a24dd6d3d2059e1251e5cac12dabbd0_img.jpg) - -Figure 15-10 – FlexO-n/OTUCn\_A\_Sk processes. This block diagram illustrates the internal architecture of the FlexO-n/OTUCn\_A\_Sk processes. At the bottom, multiple FlexO\_AP inputs (labeled FlexO\_AP[1] to FlexO\_AP[n]) are shown, each with signals AI\_D, AI\_CK, AI\_FS, AI\_MFS, AI\_TSF, and AI\_CRCerr. These inputs feed into 'Extract GID', 'Extract IID', and 'Extract MAP' blocks, which output AcGID, AcIID, and AcFMAP respectively, along with CRCerr. These signals then pass through a 'FlexO-n Reorder' block. Above this, 'Elastic store' blocks (WR and RD) are connected to 'Frame and multiframe alignment' blocks, which output dLOFLOM[1] to dLOFLOM[n]. A 'Clock generator' block receives CK[1] and provides WR and RD signals. The alignment blocks feed into 'OTUCn deskew' and 'OTUCn recover' blocks, which output CL\_D, CL\_CK, CL\_FS, and CL\_MFS. To the right, detection blocks for 'dGIDM detection', 'dFMM detection', and 'Defect correlations' receive various inputs (AI\_TSF, AcGID, dLOFLOM, dLOL, dFMM, dGIDM) and output MI\_ExGID, MI\_ExFMAP, MI\_cLOFLOM, MI\_cLOL, MI\_cFMM, MI\_cGIDM, MI\_AcGID, MI\_AcIID, and MI\_AcFMAP. A 'Consequent actions' block at the top right receives dGIDM, dFMM, dLOL, dLOFLOM, and AI\_TSF, and outputs aSSF. The diagram is labeled G.798(17)-Amd.4(22)\_F15-10 and has a vertical label FlexO-n/OTUCn\_A\_Sk\_MP on the right. - -**Figure 15-10 – FlexO-n/OTUCn\_A\_Sk processes** - -### Defects - -The function shall detect dGIDM, dFMM, dLOL and dLOFLOM[i], where 'i' is 1..n. - -**dGIDM:** See clause B.1.1.2.1. dGIDM shall be set to false during $\sum AI\_TSF[i]$ . - -**dFMM:** See clause B.1.1.2.2. dFMM shall be set to false during $\sum AI\_TSF[i]$ . - -**dLOFLOM[i]:** See clause 6.2.5.3. - -**dLOL:** If the alignment process is in the OLA state, dLOL shall be set to true. dLOL shall be set to false when the alignment process is in the ILA state; dLOL shall be set to false during $\sum AI\_TSF[i]$ . - -**Consequent actions** - -aSSF $\leftarrow$ dGIDM or dFMM or dLOL or $\sum dLOFLOM[i]$ or $\sum AI\_TSF[i]$ - -**Defect correlations** - -cGIDM $\leftarrow$ dGIDM - -cFMM $\leftarrow$ dFMM and (not dGIDM) - -cLOFLOM $\leftarrow \sum (dLOFLOM[i] \text{ and (not } AI\_TSF[i])) \text{ and (not dGIDM) and (not dFMM)}$ - -cLOL $\leftarrow$ dLOL and (not dGIDM) and (not dFMM) and (not $\sum dLOFLOM[i]$ ) - -**Performance monitoring:** None. - -**15.3.2 FlexO-x to FCC adaptation functions** - -The FlexO-x to FCC adaptation functions provide access to the FCC overhead in the FlexO interface for interface management. - -**15.3.2.1 FlexO-x to FCC adaptation source function (FlexO-x/FCC\_A\_So)** - -The FlexO-x/FCC\_A\_So function maps the FlexO-x interface management FCC data into the FlexO FCC overhead. - -The information flow and processing of the FlexO-x/FCC\_A\_So functions is defined with reference to Figures 15-11 and 15-12. - -**Symbol** - -![Flowchart showing the FlexO-x/FCC_A_So function. It starts with FCC_CP at the top, pointing down to a trapezoidal block labeled 'FlexO-x/FCC', which then points down to FlexO-x_AP at the bottom. Below the diagram is the text G.798(17)-Amd.3(21)_F15-11.](beb1af5db94ec438ceeab4ef895ffb48_img.jpg) - -``` - -graph TD - FCC_CP --> FlexO_x_FCC{{FlexO-x/FCC}} - FlexO_x_FCC --> FlexO_x_AP - style FCC_CP fill:none,stroke:none - style FlexO_x_AP fill:none,stroke:none - -``` - -G.798(17)-Amd.3(21)\_F15-11 - -Flowchart showing the FlexO-x/FCC\_A\_So function. It starts with FCC\_CP at the top, pointing down to a trapezoidal block labeled 'FlexO-x/FCC', which then points down to FlexO-x\_AP at the bottom. Below the diagram is the text G.798(17)-Amd.3(21)\_F15-11. - -**Figure 15-11 – FlexO-x/FCC\_A\_So function** - -**Interfaces** - -**Table 15-5 – FlexO-x/FCC\_A\_So inputs and outputs** - -| Input(s) | Output(s) | -|------------------------------------------------------------------------------------------------|-------------------------------------------------------------------| -| FCC_CP:
FCC_CI_D
FlexO-x_AP:
FlexO-x
FlexO-x_AI_FS
FlexO-x_AI_MFS | FCC_CP:
FCC_CI_CK
FlexO-x_AP:
FlexO-x_AI_D | - -**Processes** - -The processes associated with the FlexO-x/FCC\_A\_So function are as depicted in Figure 15-12. - -**FCC clock generation:** The function shall generate the FCC clock (CI\_CK) by dividing the FlexO-x clock (AI\_CK) by a factor of 14/82240. - -**Mapping:** The function shall map the incoming FCC data (CI\_D) into the FCC overhead of the FlexO frame #1 of the FlexO-x (AI\_D) as described in clause 9.2.8 of [ITU-T G.709.1]. The bit rate of the FCC data is defined by the outgoing FCC clock (CI\_CK). - -The insertion of the FlexO-x interface management data follows the transmission order of the FCC overhead bits and bytes. - -![Figure 15-12: FlexO-x/FCC_A_So processes diagram. A grey box labeled 'FCC_CP' contains two white boxes: 'Mapping' and 'FCC clock generation'. Inputs from the bottom are AI_MFS, AI_FS, AI_D, and AI_CK. AI_D and AI_CK enter the 'Mapping' and 'FCC clock generation' boxes respectively. CI_D and CI_CK exit the 'Mapping' and 'FCC clock generation' boxes respectively. The label 'FlexO_AP' is positioned below the box.](1ba9045eb6dc22039a16b92b1427e696_img.jpg) - -Figure 15-12: FlexO-x/FCC\_A\_So processes diagram. A grey box labeled 'FCC\_CP' contains two white boxes: 'Mapping' and 'FCC clock generation'. Inputs from the bottom are AI\_MFS, AI\_FS, AI\_D, and AI\_CK. AI\_D and AI\_CK enter the 'Mapping' and 'FCC clock generation' boxes respectively. CI\_D and CI\_CK exit the 'Mapping' and 'FCC clock generation' boxes respectively. The label 'FlexO\_AP' is positioned below the box. - -G.798(17)\_F15-12 - -**Figure 15-12 – FlexO-x/FCC\_A\_So processes** - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -### 15.3.2.2 FlexO-x to FCC adaptation sink function (FlexO-x/FCC\_A\_Sk) - -The FlexO-x/FCC\_A\_Sk extracts the FlexO-x interface management data from the FlexO FCC overhead. - -The information flow and processing of the FlexO-x/FCC\_A\_Sk functions is defined with reference to Figures 15-13 and 15-14. - -#### Symbol - -![Figure 15-13: FlexO-x/FCC_A_Sk function symbol diagram. A trapezoidal symbol labeled 'FlexO-x/FCC' has an input arrow from the bottom labeled 'FlexO-x_AP' and an output arrow pointing upwards labeled 'FCC_CP'.](e96884b4726abd1ef715e32b100b05e6_img.jpg) - -Figure 15-13: FlexO-x/FCC\_A\_Sk function symbol diagram. A trapezoidal symbol labeled 'FlexO-x/FCC' has an input arrow from the bottom labeled 'FlexO-x\_AP' and an output arrow pointing upwards labeled 'FCC\_CP'. - -G.798(17)-Amd.3(21)\_F15-13 - -**Figure 15-13 – FlexO-x/FCC\_A\_Sk function** - -## Interfaces - -**Table 15-6 – FlexO-x/FCC\_A\_Sk inputs and outputs** - -| Input(s) | Output(s) | -|----------------------------------------------------------------------------------------------------------|-------------------------------------------------------| -| FlexO-x_AP:
FlexO-x_AI_CK
FlexO-x_AI_D
FlexO-x_AI_FS
FlexO-x_AI_MFS
FlexO-x_AI_TSF | FCC_CP:
FCC_CI_CK
FCC_CI_D
FCC_CI_SSF | - -## Processes - -The processes associated with the FlexO-x/FCC\_A\_Sk function are as depicted in Figure 15-14. - -**FCC clock generation:** The function shall generate the FCC clock (CI\_CK) by dividing the FlexO-x clock (AI\_CK) by a factor of $x \times 14/82240$ . - -**Demapping:** The function shall extract the FCC data (CI\_D) from the FCC overhead of the FlexO frame #1 of the FlexO-x (AI\_D) as described in clause 9.2.8 of [ITU-T G.709.1]. The bit rate of the FCC data is defined by the outgoing FCC clock (CI\_CK). - -The extraction of the FlexO-x interface management data follows the transmission order of the FCC overhead bits and bytes. - -![Figure 15-14 – FlexO-x/FCC_A_Sk processes diagram. The diagram shows a grey box labeled 'FCC_CP' containing two sub-processes: 'Demapping' and 'FCC clock generation'. Inputs from 'FlexO-x_AP' (AI_MFS, AI_FS, AI_D, AI_CK, AI_TSF) enter from the bottom. AI_D and AI_FS enter the 'Demapping' block. AI_CK enters the 'FCC clock generation' block. AI_TSF enters a label 'aSSF'. Outputs CI_D, CI_CK, and CI_SSF exit from the top. CI_D is output from 'Demapping'. CI_CK is output from 'FCC clock generation'. CI_SSF is output from the 'aSSF' label. A small text 'G.798(17)-Amd.3(21)_F15-14' is in the bottom right.](3b1646c728aab109f7312ecb46537a4a_img.jpg) - -Figure 15-14 – FlexO-x/FCC\_A\_Sk processes diagram. The diagram shows a grey box labeled 'FCC\_CP' containing two sub-processes: 'Demapping' and 'FCC clock generation'. Inputs from 'FlexO-x\_AP' (AI\_MFS, AI\_FS, AI\_D, AI\_CK, AI\_TSF) enter from the bottom. AI\_D and AI\_FS enter the 'Demapping' block. AI\_CK enters the 'FCC clock generation' block. AI\_TSF enters a label 'aSSF'. Outputs CI\_D, CI\_CK, and CI\_SSF exit from the top. CI\_D is output from 'Demapping'. CI\_CK is output from 'FCC clock generation'. CI\_SSF is output from the 'aSSF' label. A small text 'G.798(17)-Amd.3(21)\_F15-14' is in the bottom right. - -**Figure 15-14 – FlexO-x/FCC\_A\_Sk processes** - -**Defects:** None. - -### Consequent actions - -The function shall perform the following consequent actions: - -$aSSF \leftarrow AI\_TSF$ - -**Defect correlations:** None. - -**Performance monitoring:** None. - -### 15.3.3 FlexO to synchronization distribution adaptation functions - -FlexO to synchronization distribution (SD) adaptation functions are given in clause 8.12 of [ITU-T G.781]. - -### 15.3.4 FlexO-*x* to FlexO adaptation function (FlexO-*x*/FlexO\_A) - -The FlexO-*x* to FlexO adaptation functions perform the adaptation between the FlexO-*x* layer adapted information and the characteristic information of the FlexO layer signals. - -#### 15.3.4.1 FlexO-*x* to FlexO adaptation source function (FlexO-*x*/FlexO\_A\_So) - -The FlexO-*x*/FlexO\_A\_So function interleaves *x* FlexO signals from the *x* × FlexO\_CPs into a FlexO-*x* signal. For the case that up to *x*-1 FlexO\_CPs are not connected and do not receive an input signal, the function replaces these FlexO\_CI by an all-0's unequipped FlexO signal. - -The information flow and processing of the FlexO-*x*/FlexO\_A\_So function is defined with reference to Figures 15-15 and 15-16. - -#### Symbol - -![Diagram of the FlexO-x/FlexO_A_So function symbol. It shows x FlexO_CP inputs (labeled 1, 2, ..., x) entering a trapezoidal block labeled 'FlexO-x/FlexO'. An arrow points from the block to an output labeled 'FlexO-x_AP'. Below the output is the text 'G.798(17)-Amd.3(21)_F15-15'.](60590b20ec9994e388840f5fc4572e39_img.jpg) - -Diagram of the FlexO-x/FlexO\_A\_So function symbol. It shows x FlexO\_CP inputs (labeled 1, 2, ..., x) entering a trapezoidal block labeled 'FlexO-x/FlexO'. An arrow points from the block to an output labeled 'FlexO-x\_AP'. Below the output is the text 'G.798(17)-Amd.3(21)\_F15-15'. - -Figure 15-15 – FlexO-*x*/FlexO\_A\_So function - -#### Interfaces - -Table 15-9 – FlexO-*x*/FlexO\_A\_So inputs and outputs - -| Input(s) | Output(s) | -|-----------------------------|--------------------------------------| -| x × FlexO_CP: | FlexO-x_AP: | -| FlexO_CI_CK | FlexO- x _AI_CK | -| FlexO_CI_D | FlexO- x _AI_D[1.. x ] | -| FlexO_CI_FS | FlexO- x _AI_FS | -| FlexO_CI_MFS | FlexO- x _AI_MFS | - -#### Processes - -The processes associated with the FlexO-*x*/FlexO\_A\_So function are as depicted in Figure 15-16. - -The function shall forward the CI\_CK, CI\_FS, CI\_MFS from FlexO\_CP[1] and the CI\_D from FlexO\_CP[1] to FlexO\_CP[*x*] to the FlexO-*x*\_AP. For the case that one or more FlexO\_CPs are not connected, their FlexO\_CI\_D contains the all-0's pattern. Such all-0's pattern is referred to as unequipped FlexO pattern. - -NOTE – 10-bit frame and multi-frame synchronous interleaving of the *x* FlexO instances is performed in the OTSiG/FlexO-*x*\_A\_So function. - -![Figure 15-16: FlexO-x/FlexO_A_So processes diagram. It shows multiple FlexO_CP[j] blocks (1, 2, ..., x) at the top, each with four input signals: CI_MFS, CI_FS, CI_CK, and CI_D. Below these is a large grey box representing the FlexO-x_AP. Arrows point from the CI signals down into the FlexO-x_AP box. From the bottom of the box, arrows point up to output signals: AI_MFS, AI_FS, AI_CK, and AI_D[j] (for j=1, 2, ..., x). A note inside the box states: 'NOTE – CI_D[j] contains all-0s pattern if FlexO_CP[j] (j = 2..x) is not connected'. The diagram is labeled G.798(17)-Amd.3(21)_F15-16.](6347ebb7bc58aba4272fc340a410bd97_img.jpg) - -Figure 15-16: FlexO-x/FlexO\_A\_So processes diagram. It shows multiple FlexO\_CP[j] blocks (1, 2, ..., x) at the top, each with four input signals: CI\_MFS, CI\_FS, CI\_CK, and CI\_D. Below these is a large grey box representing the FlexO-x\_AP. Arrows point from the CI signals down into the FlexO-x\_AP box. From the bottom of the box, arrows point up to output signals: AI\_MFS, AI\_FS, AI\_CK, and AI\_D[j] (for j=1, 2, ..., x). A note inside the box states: 'NOTE – CI\_D[j] contains all-0s pattern if FlexO\_CP[j] (j = 2..x) is not connected'. The diagram is labeled G.798(17)-Amd.3(21)\_F15-16. - -Figure 15-16 – FlexO-x/FlexO\_A\_So processes - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -**15.3.4.2 FlexO-x to FlexO adaptation sink function (FlexO-x/FlexO\_A\_Sk)** - -The FlexO-x/FlexO\_A\_Sk function disinterleaves $x$ FlexO signals from the FlexO\_AP and present these at the $x$ FlexO\_CPs. - -The information flow and processing of the FlexO-x/FlexO\_A\_Sk function is defined with reference to Figures 15-17 and 15-18. - -**Symbol** - -![Figure 15-17: FlexO-x/FlexO_A_Sk function symbol diagram. A trapezoidal block labeled 'FlexO-x/FlexO' has an input arrow from the bottom labeled 'FlexO-x_AP'. It has an output arrow to the left labeled 'FlexO-x/FlexO_A_Sk_MP'. At the top, there are multiple output arrows labeled 'FlexO_CP' with subscripts 1, 2, ..., x.](1c453289f9bc736ca66bdaf7178601c3_img.jpg) - -Figure 15-17: FlexO-x/FlexO\_A\_Sk function symbol diagram. A trapezoidal block labeled 'FlexO-x/FlexO' has an input arrow from the bottom labeled 'FlexO-x\_AP'. It has an output arrow to the left labeled 'FlexO-x/FlexO\_A\_Sk\_MP'. At the top, there are multiple output arrows labeled 'FlexO\_CP' with subscripts 1, 2, ..., x. - -Figure 15-17 – FlexO-x/FlexO\_A\_Sk function - -**Interfaces** - -Table 15-10 – FlexO-x/FlexO\_A\_Sk inputs and outputs - -| Input(s) | Output(s) | -|-------------------------|----------------------------------------| -| FlexO-x_AP: | x \times FlexO_CP: | -| FlexO-x_AI_CK | FlexO_CI_CK | -| FlexO-x_AI_D[1..x] | FlexO_CI_D | -| FlexO-x_AI_FS | FlexO_CI_FS | -| FlexO-x_AI_MFS | FlexO_CI_MFS | -| FlexO-x_AI_CRCerr[1..x] | FlexO_CI_CRCerr | -| FlexO-x_AI_TSF | FlexO_CI_SSF | - -**Processes** - -The processes associated with the FlexO-x/FlexO\_A\_Sk function are as depicted in Figure 15-18. - -NOTE – 10-bit frame and multi-frame synchronous disinterleaving of the $x$ FlexO instances in the FlexO- $x$ is performed in the OTSiG/FlexO- $x$ A\_Sk function. - -![Diagram of FlexO-x/FlexO_A_Sk processes showing signal flow from AI_TSF and AI_D[x] inputs through a FlexO-x_AP block to multiple FlexO_CP[x] outputs. The diagram includes signal labels such as AI_MFS, AI_FS, AI_CK, AI_D[1], AI_D[2], AI_D[x], CI_D, CI_CK, CI_FS, CI_MFS, CI_CRCerr, and CI_SSF. A box labeled 'Consequent actions' is connected to the aSSF signal.](d23fe5b7e93dc24c2ffa70b743025c5b_img.jpg) - -The diagram illustrates the FlexO-x/FlexO\_A\_Sk processes. At the bottom, a large grey block labeled 'FlexO-x\_AP' receives several input signals: AI\_MFS, AI\_FS, AI\_CK, AI\_D[1], AI\_D[2], AI\_D[x], CI\_CRCerr[1], CI\_CRCerr[2], CI\_CRCerr[x], and AI\_TSF. Above this block, multiple output signal groups are shown, labeled FlexO\_CP[1], FlexO\_CP[2], ..., FlexO\_CP[x]. Each group contains the signals CI\_D, CI\_CK, CI\_FS, CI\_MFS, CI\_CRCerr, and CI\_SSF. Lines connect the inputs to the FlexO-x\_AP block and then to the corresponding outputs. A signal labeled 'aSSF' is shown on the right, entering a box labeled 'Consequent actions'. - -Diagram of FlexO-x/FlexO\_A\_Sk processes showing signal flow from AI\_TSF and AI\_D[x] inputs through a FlexO-x\_AP block to multiple FlexO\_CP[x] outputs. The diagram includes signal labels such as AI\_MFS, AI\_FS, AI\_CK, AI\_D[1], AI\_D[2], AI\_D[x], CI\_D, CI\_CK, CI\_FS, CI\_MFS, CI\_CRCerr, and CI\_SSF. A box labeled 'Consequent actions' is connected to the aSSF signal. - -G.798(17)-Amd.3(21)\_F15-18 - -Figure 15-18 – FlexO- $x$ /FlexO A\_Sk processes - -### Consequent actions - -The function shall perform the following consequent actions: - -aSSF $\leftarrow$ AI\_TSF - -**Defect correlations:** None. - -**Performance monitoring:** None. - -### 15.3.5 FlexO- $n$ to OTUC $n_i$ adaptation function (FlexO- $n$ /OTUC $n_i$ A) - -The FlexO- $n$ to OTUC $n_i$ multiplexing adaptation functions perform the adaptation between the FlexO layer adapted information and the characteristic information of the OTUC $n_i$ layer signals. - -The set of $n$ FlexO instances may carry multiple OTUC $n_i$ ( $i = 1..N$ ) signals via GMP. In the most general case, the $n = n_1 + n_2 + \dots + n_N$ OTUC instances of the OTUC $n_i$ ( $i = 1..N$ ) are mapped to a FlexO- $x$ -- $m$ group of $m$ FlexO- $x$ - interfaces, each with a FlexO- $x$ - interface bandwidth of $\lceil n/m \rceil \times 100G$ . - -Tributary ports are dynamically created and deleted under the control of management. Each tributary port is associated with one OTUC $n_i$ connection point on one hand, and $n_i$ FlexO instances on the other hand. The multiplex structure identifier (MSI) carries the configuration of tributary ports to FlexO instances. - -#### 15.3.5.1 FlexO- $n$ to OTUC $n_i$ adaptation source function (FlexO- $n$ /OTUC $n_i$ A\_So) - -The FlexO- $n$ /OTUC $n_i$ A\_So function creates the $n$ FlexO signals from a free-running clock or an external synchronization clock. It asynchronously maps the up to $n$ OTUC client signals from the $N \times$ OTUC $n_i$ CPs into $n$ FlexO instances including justification control (JC) information. It adds FlexO payload and group management overhead. - -The information flow and processing of the FlexO- $n$ /OTUC $n_i$ A\_So function is defined with reference to Figures 15-19 and 15-20. - -## Symbol - -![Figure 15-19 – FlexO-n/OTUCn_i_A_So function symbol. The diagram shows a trapezoidal block labeled 'FlexO-n/OTUCn_i'. Inputs from the top are 'OTUCn_i_CP's (labeled 1, 2, 3, ..., N). Inputs from the left are 'FlexO-n/OTUCn_i_A_So_MP'. Input from the right is 'FlexO_TP'. Outputs from the bottom are 'FlexO_AP[1]' and 'FlexO_AP[n]', with a dashed oval indicating multiple outputs. A small text 'G.798(17)-Amd.3(21)_F15-19' is at the bottom right.](ea72687397bac53eb690650f371bfd63_img.jpg) - -Figure 15-19 – FlexO-n/OTUCn\_i\_A\_So function symbol. The diagram shows a trapezoidal block labeled 'FlexO-n/OTUCn\_i'. Inputs from the top are 'OTUCn\_i\_CP's (labeled 1, 2, 3, ..., N). Inputs from the left are 'FlexO-n/OTUCn\_i\_A\_So\_MP'. Input from the right is 'FlexO\_TP'. Outputs from the bottom are 'FlexO\_AP[1]' and 'FlexO\_AP[n]', with a dashed oval indicating multiple outputs. A small text 'G.798(17)-Amd.3(21)\_F15-19' is at the bottom right. - -Figure 15-19 – FlexO-n/OTUCni\_A\_So function - -## Interfaces - -Table 15-11 – FlexO-n/OTUCni\_A\_So inputs and outputs - -| Input(s) | Output(s) | -|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|----------------------------------------------------------------------------------| -| N × OTUCn_CP:
OTUCn_CI_CK
OTUCn_CI_D
OTUCn_CI_FS
OTUCn_CI_MFS
FlexO_TP:
FlexO_TI_CK
FlexO-n/OTUCni_A_So_MP:
FlexO-n/OTUCn i _A_So_MI_TxMSI[1..n]
FlexO-n/OTUCn i _A_So_MI_TxGID
FlexO-n/OTUCn i _A_So_MI_TxIID[1..n]
FlexO-n/OTUCn i _A_So_MI_TxFMAP | n × FlexO_AP:
FlexO_AI_D
FlexO_AI_CK
FlexO_AI_FS
FlexO_AI_MFS | - -## Processes - -The processes associated with the FlexO-n/OTUCni\_A\_So function are specific processes for each OTUCni\_CP, common processes and specific processes for each OTUC instance of each OTUCni and each FlexO instance of the n FlexO as depicted in Figure 15-20. - -### OTUCni specific processes - -The specific processes are performed independently for each OTUCni client signal that is multiplexed into the FlexO group. The specific processes perform the mapping of the OTUCni into a group of ni FlexO instances. - -**OTUCni FAS/MFAS insertion:** The function shall insert the FAS and MFAS into the OTUCni OH area as described in clause 11.3 of [ITU-T G.709]. - -**OTUCni distribution:** The function shall divide OTUCni into ni OTUC instance signals as described in clause 10.1.1 of [ITU-T G.709.1]. - -### Common processes - -**Clock generation:** The function shall generate a local FlexO clock (FlexO\_AI\_CK) of $4112/4097 \times 239/226 \times 99\,532\,800$ kbit/s $\pm 20$ ppm from the synchronization timing information clock input (TI\_CK) or, if the TI\_CK is absent, a free-running oscillator. The clock parameters, including jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCa clock), apply. - -**FS and MFS generator:** The function shall generate the (multi)frame start reference signals AI\_FS and AI\_MFS for the FlexO signal. The AI\_FS signal shall be active once per 657 920 clock cycles. AI\_MFS shall be active once every 8 frames. - -**OTUCn to FlexO distribution:** The function assigns each OTUCn to $n_i$ specific FlexO instances of the FlexO group as defined by the multiplex structure (see Annex F of [ITU-T G.709.3]) under control of TxMSI[1..n]. The $n_i$ OTUC instances of an OTUCn are allocated to the assigned $n_i$ FlexO instances in sequential order. - -#### **OTUC and FlexO specific processes** - -**Mapping, frequency justification and bit-rate adaptation:** The function shall provide an elastic store (buffer) process for the OTUC client signal. The data signal OTUC\_CI shall be written into the buffer under the control of the associated input clock. - -Justification method GMP, as described below, is provided. The OTUC rate determines the base value and ranges for the parameters $C_n$ and $C_m$ . - -*FlexO payload:* The OTUC data shall be read out of the buffer and written onto groups of 256 successive bits of the FlexO 4-frame multi-frame payload area under the control of the FlexO clock and the GMP data/stuff control mechanism as defined in clause F.4 of [ITU-T G.709.3]. The 256-bit word alignment of the OTUC is preserved through the mapping procedure; i.e., the position of the first 256-bits of the OTUC is always located after an integer number of 256-bit words from the start of the FlexO 4-frame multi-frame payload structure. - -NOTE – In order to minimize implementation complexity and avoid the skew introduction between $n$ OTUC instance signals, $n_i$ lanes of mapping may use one unified mapping control mechanism to complete all the mapping processes and keep actions consistent between them. - -*Buffer size:* In the presence of jitter as specified by [ITU-T G.8251] and a frequency within the range specified in Table 8-1 of [ITU-T G.709.1], this mapping process shall not introduce any errors. The maximum buffer hysteresis, and therefore the maximum phase error introduced, is for further study. - -**All-0's OH insertion:** The function shall insert all-ZEROs into all the FlexO AM, EOH and BOH bit locations. - -**FlexO OH Insertion:** The function shall insert the overhead information of FlexO group signal in the corresponding overhead area (GID, IID, MAP) as defined in clause 9.2 of [ITU-T G.709.1]. - -**FlexO JC1/JC2/JC3, JC4/JC5/JC6:** The function shall generate the GMP $C_m$ and GMP $\sum C_{nD}$ information and insert this into the JC1/JC2/JC3 and JC4/JC5/JC6 bytes, respectively, according to the specification in clause F. and Annex D of [ITU-T G.709]. - -**FlexO MSI:** The function shall insert the TxMSI[p] into the MSI overhead byte as defined in clause F.3.1 of [ITU-T G.709.3]. The TxMSI[p] value, and as such the multiplex structure, is configurable via MI\_TxMSI[1..n]. - -**FlexO PT:** The function shall insert code "0000 0010" (GMP based OTUC mapping for OTUCn multiplexing) into the PT overhead byte as defined in clause 9.2.6.2 of [ITU-T G.709.1]. - -**FlexO GID:** The FlexO group identifier is inserted in the GID field. Its value is derived from reference point FlexO\_TT\_So\_MP. The GID format is described in clause 9.2.2.1 of [ITU-T G.709.1]. - -**FlexO IID:** The function shall insert the TxIID[p] into the IID overhead byte as defined in clause 9.2.2.2 of [ITU-T G.709.1]. The TxIID[p] value is configurable via MI\_TxIID[1..n]. - -**FlexO MAP:** The FlexO instance map is inserted in the FlexO MAP field. Its value is derived from reference point FlexO\_TT\_So\_MP. The FlexO MAP format is described in clause 9.2.2.3 of [ITU-T G.709.1]. - -![Figure 15-20 – FlexO-n/OTUCn_i_A_So processes. This block diagram illustrates the transmission (So) process for FlexO-n signals. At the top, multiple OTUCn inputs (OTUCn_CP[1] to OTUCn_CP[N]) are processed through FAS/MFAS insertion, resulting in OTUCn #1 distribution and OTUCn #N distribution. These are then mapped to a common FlexO distribution bus. A free-running clock generator provides a base clock (TI_CK) which is divided by 657920 and then by 8 to generate the Master FlexO Clock (MFS). The FlexO distribution bus carries signals for OTUC #1.1 to OTUC #N.n_N. Each OTUC signal is processed through an Elastic store (with Write Read pointers) and a Justification control and JC generation block. This is followed by the insertion of overhead bits (all-0's in AM, EOH, BOH) and specific overhead fields: MSI, PT, IID, GIP, MAP, and RES. The final output for each OTUC signal is a FlexO_AP signal, which includes data (D), clock (CK), frame sync (FS), and master flexo clock (MFS) components. The diagram also shows various management interface signals (MI_TxMSI, MI_TxIID, MI_TxGID, MI_TxFMAP) and timing signals (AI_D, AI_CK, AI_FS, AI_MFS).](1b683c1801ad8e24cf113cede25b36f0_img.jpg) - -Figure 15-20 – FlexO-n/OTUCn\_i\_A\_So processes. This block diagram illustrates the transmission (So) process for FlexO-n signals. At the top, multiple OTUCn inputs (OTUCn\_CP[1] to OTUCn\_CP[N]) are processed through FAS/MFAS insertion, resulting in OTUCn #1 distribution and OTUCn #N distribution. These are then mapped to a common FlexO distribution bus. A free-running clock generator provides a base clock (TI\_CK) which is divided by 657920 and then by 8 to generate the Master FlexO Clock (MFS). The FlexO distribution bus carries signals for OTUC #1.1 to OTUC #N.n\_N. Each OTUC signal is processed through an Elastic store (with Write Read pointers) and a Justification control and JC generation block. This is followed by the insertion of overhead bits (all-0's in AM, EOH, BOH) and specific overhead fields: MSI, PT, IID, GIP, MAP, and RES. The final output for each OTUC signal is a FlexO\_AP signal, which includes data (D), clock (CK), frame sync (FS), and master flexo clock (MFS) components. The diagram also shows various management interface signals (MI\_TxMSI, MI\_TxIID, MI\_TxGID, MI\_TxFMAP) and timing signals (AI\_D, AI\_CK, AI\_FS, AI\_MFS). - -Figure 15-20 – FlexO-n/OTUCn\_i\_A\_So processes - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -### 15.3.5.2 FlexO-n to OTUCn\_i adaptation sink function (FlexO-n/OTUCn\_i\_A\_Sk) - -The FlexO-n/OTUCn\_i\_A\_Sk function extracts the FlexO group management and payload overhead and monitors the reception of the correct payload type. It recovers the up to $n \times$ OTUC signals from - -the N OTUCn using the justification control information (JC, JC1/2/3/4/5/6 overhead). It performs frame and multi-frame alignment of the OTUC. - -The information flow and processing of the FlexO-n/OTUCn\_A\_Sk function is defined with reference to Figures 15-21, 15-22 and 15-23. - -### Symbol - -![Figure 15-21 – FlexO-n/OTUCn_i_A_Sk function symbol diagram. The diagram shows a trapezoidal block labeled 'FlexO-n/OTUCn_i'. On the left, an arrow labeled 'FlexO-n/OTUCn_i_A_Sk_MP' points into the block. On the right, an arrow labeled 'OTUCn_i_CPs' points out of the block, with sub-indices 1, 2, 3, and N. Below the block, two dashed arrows represent input and output vectors: 'FlexO_AP[1]' pointing into the block and 'FlexO_AP[n]' pointing out of the block. A small note 'G.798(17)-Amd.3(21)_F15-21' is at the bottom right.](a70d42d1621bc4d20c0f9d2e396222c1_img.jpg) - -Figure 15-21 – FlexO-n/OTUCn\_i\_A\_Sk function symbol diagram. The diagram shows a trapezoidal block labeled 'FlexO-n/OTUCn\_i'. On the left, an arrow labeled 'FlexO-n/OTUCn\_i\_A\_Sk\_MP' points into the block. On the right, an arrow labeled 'OTUCn\_i\_CPs' points out of the block, with sub-indices 1, 2, 3, and N. Below the block, two dashed arrows represent input and output vectors: 'FlexO\_AP[1]' pointing into the block and 'FlexO\_AP[n]' pointing out of the block. A small note 'G.798(17)-Amd.3(21)\_F15-21' is at the bottom right. - -Figure 15-21 – FlexO-n/OTUCn\_A\_Sk function - -### Interfaces - -Table 15-12 – FlexO-n/OTUCn\_A\_Sk inputs and outputs - -| Input(s) | Output(s) | -|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| n × FlexO_AP:
FlexO_AI_D
FlexO_AI_CK (Note)
FlexO_AI_FS
FlexO_AI_MFS
FlexO_AI_CRCerr
FlexO_AI_TSF
FlexO-n/OTUCn_A_Sk_MP:
FlexO-n/OTUC n _A_Sk_MI_ExGID
FlexO-n/OTUC n _A_Sk_MI_ExFMAP
FlexO-n/OTUC n _A_Sk_MI_ExMSI[1..n] | N × OTUCn_CP:
OTUC n _CI_CK
OTUC n _CI_D
OTUC n _CI_FS
OTUC n _CI_MFS
OTUC n _CI_SSF
FlexO-n/OTUCn_A_Sk_MP:
FlexO-n/OTUC n _A_Sk_MI_AcGID[1..n]
FlexO-n/OTUC n _A_Sk_MI_AcFMAP[1..n]
FlexO-n/OTUC n _A_Sk_MI_AcIID[1..n]
FlexO-n/OTUC n _A_Sk_MI_AcPT[1..n]
FlexO-n/OTUC n _A_Sk_MI_AcMSI[1..n]
FlexO-n/OTUC n _A_Sk_MI_cGIDM
FlexO-n/OTUC n _A_Sk_MI_cFMM
FlexO-n/OTUC n _A_Sk_MI_cPLM
FlexO-n/OTUC n _A_Sk_MI_cMSIM[1..N]
FlexO-n/OTUC n _A_Sk_MI_cLOFLOM[1..N]
FlexO-n/OTUC n _A_Sk_MI_cLOL[1..N] | -| NOTE – The function only needs one FlexO_AI_CK, e.g., FlexO_AI_CK[1]. | | - -### Processes - -The processes associated with the FlexO-n/OTUCn\_A\_Sk function are specific processes for each FlexO instance of the n FlexO, common processes, specific processes for each OTUC instance of each OTUCn and specific processes for each OTUCn\_CP as depicted in Figures 15-22 and 15-23. - -### FlexO specific processes - -**FlexO OH Extraction:** The function shall extract the overhead of FlexO group interface (GID, IID and MAP) from each FlexO frame as defined in clause 9.2 of [ITU-T G.709.1]. - -**FlexO GID:** The GID fields shall be extracted from the FlexO overhead and processed as specified in clause B.2.2.1. The accepted GID values are available at the MP (MI\_AcGID[i]) and are used for dGIDM defect detection. - -NOTE – A GID field carrying an all-0's value indicates the presence of an unequipped FlexO instance. Such unequipped FlexO instance represents a FlexO-x configuration mistake. - -**FlexO IID:** The IID fields shall be extracted from the FlexO overhead and processed as specified in clause B.2.2.1. The accepted IID values are available at the MP (MI\_AcIID[i]) and are used for dFMM defect detection. - -**FlexO MAP:** The FlexO MAP fields shall be extracted from the FlexO overhead and processed as specified in clause B.2.2.3.1. The accepted MAP values are available at the MP (MI\_AcFMAP[i]) and are used for dFMM defect detection. - -**PT:** The function shall extract the PT byte from the PT overhead as defined in clause 8.7.1.2. The accepted PT value is available at the MP (MI\_AcPT) and is used for PLM defect detection. The PLM detection shall be based on the comparison of the accepted PT with the value 0x02. - -**MSI:** The function shall extract the MSI byte from the MSI overhead as defined in clause 8.7.2.4. The accepted MSI (AcMSI[1..n]) is available at the MP (MI\_AcMSI[1..n]). The multiplex structure is defined by ExMSI[1..n], which is configurable via MI\_ExMSI[1..n]. - -#### **Common processes** - -**FlexO-n Reorder:** The function shall reorder n FlexO instances based on IID as described in clauses 9.2.3 and 10.3 of [ITU-T G.709.1]. - -**FlexO to OTUCn distribution:** The function assigns the individual FlexO instances to specific OTUCn instances as defined by the multiplex structure (see Annex F of [ITU-T G.709.3]) under control of MI\_ExMSI[1..n]. - -![Figure 15-22 – FlexO-n/OTUCn_i_A_Sk processes. This block diagram illustrates the internal architecture of FlexO-n/OTUCn_i_A_Sk processes. At the top, multiple OTUCn specific processes (labeled #1 to #N) are shown, each receiving inputs from FlexO-n to OTUCn distribution blocks and outputting to ODUCn_CP [1] and ODUCn_CP [N] via CI_D, CI_CK, CI_FS, CI_MFS, and CI_SSF signals. Each OTUCn process contains internal blocks for AI_TSF, dFMM, dGIDM, dPLM, dMSIM, MI_cMSIM, MI_cLOL, and MI_cLOFLOM. Below the OTUCn processes, FlexO-n Reorder blocks are shown, which receive inputs from FlexO_AP blocks (containing AI_D, AI_CK, AI_FS, AI_MFS, AI_TFS, and AI_CRCerr) and output to Extract MSI, Extract PT, Extract GID, Extract IID, and Extract MAP blocks. These extraction blocks output to AcMSI, AcPT, AcGID, AcIID, and AcFMAP signals, which are then processed by detection blocks (dMSIM, dPLM, dGIDM, dFMM) to produce MI_ExMSI, MI_ExGID, and MI_ExFMAP signals. A central 'Defect correlations' block receives inputs from AI_TSF, dFMM, dGIDM, dPLM, dMSIM, dLOL, and dLOFLOM across all OTUCn processes and outputs to MI_cFMM, MI_cGIDM, MI_cPLM, MI_cMSIM, MI_cLOL, and MI_cLOFLOM signals. A vertical label on the right side reads 'FlexO-n/OTUCn_A_Sk_MP'.](601a4295d83c115fcd66101f49de0c4e_img.jpg) - -Figure 15-22 – FlexO-n/OTUCn\_i\_A\_Sk processes. This block diagram illustrates the internal architecture of FlexO-n/OTUCn\_i\_A\_Sk processes. At the top, multiple OTUCn specific processes (labeled #1 to #N) are shown, each receiving inputs from FlexO-n to OTUCn distribution blocks and outputting to ODUCn\_CP [1] and ODUCn\_CP [N] via CI\_D, CI\_CK, CI\_FS, CI\_MFS, and CI\_SSF signals. Each OTUCn process contains internal blocks for AI\_TSF, dFMM, dGIDM, dPLM, dMSIM, MI\_cMSIM, MI\_cLOL, and MI\_cLOFLOM. Below the OTUCn processes, FlexO-n Reorder blocks are shown, which receive inputs from FlexO\_AP blocks (containing AI\_D, AI\_CK, AI\_FS, AI\_MFS, AI\_TFS, and AI\_CRCerr) and output to Extract MSI, Extract PT, Extract GID, Extract IID, and Extract MAP blocks. These extraction blocks output to AcMSI, AcPT, AcGID, AcIID, and AcFMAP signals, which are then processed by detection blocks (dMSIM, dPLM, dGIDM, dFMM) to produce MI\_ExMSI, MI\_ExGID, and MI\_ExFMAP signals. A central 'Defect correlations' block receives inputs from AI\_TSF, dFMM, dGIDM, dPLM, dMSIM, dLOL, and dLOFLOM across all OTUCn processes and outputs to MI\_cFMM, MI\_cGIDM, MI\_cPLM, MI\_cMSIM, MI\_cLOL, and MI\_cLOFLOM signals. A vertical label on the right side reads 'FlexO-n/OTUCn\_A\_Sk\_MP'. - -**Figure 15-22 – FlexO-n/OTUCni\_A\_Sk processes** - -### OTUC specific processes - -**Demapping:** The function shall demap the OTUC instance signal from FlexO frame as described in clause F of [ITU-T G.709.3]. - -Justification method GMP as described below is provided. The OTUC rate determines the base value and ranges for the parameters $C_{n}$ and $C_{m}$ . - -**FlexO JC1/2/3 and JC4/5/6:** The function shall interpret the GMP overhead information in the JC1/2/3 and JC4/5/6 bytes as defined in clause F of [ITU-T G.709.3] in order to determine the number of 256-bit OTUC entities in the next FlexO 4-frame multi-frame. - -**Demapping, CBR clock generation:** The function shall provide an elastic store (buffer) process. - -*FlexO:* The OTUC data shall be extracted from the groups of 256 successive bits of the FlexO payload area under the control of the GMP data/stuff control mechanism as defined in clause F.4 of [ITU-T G.709.3] and be written into the buffer. The $C_n$ information associated with the OTUC is computed from the GMP $C_m$ and $\sum C_{nD}$ parameters carried within the JC1/2/3 and JC 4/5/6 overhead of the FlexO 4-frame multi-frame as specified in clause F.3.2 of [ITU-T G.709.3]. For the GMP data/stuff control mechanism, refer to Annex D of [ITU-T G.709]. - -The OTUC data (CI\_D) shall be read out of the buffer under the control of the OTUC clock (CI\_CK). - -*Smoothing and jitter limiting process:* The function shall provide for a clock smoothing and elastic store (buffer) process. The OTUC data signal shall be written into the buffer under the control of the associated (gapped) FlexO payload input clock (with a frequency accuracy within $\pm 20$ ppm). The data signal shall be read out of the buffer under the control of a smoothed (equally spaced) OTUC clock (the rate is determined by the OTUC signal at the input of the remote FlexO-nP/OTUCni\_A\_So). - -The clock parameters, including jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCp clock), apply. - -*Buffer size:* In the presence of jitter as specified by [ITU-T G.8251] and a frequency within the tolerance range specified for the OTUC signal in Table 7-1 of [ITU-T G.709], this justification process shall not introduce any errors. - -Following a step in frequency of the OTUC signal transported (for example, due to reception of OTUCni\_CI from a new OTUCni\_TT\_So at the far end or removal of an OTUCni-AIS or ODUCni-AIS signal with a frequency offset), there will be a maximum recovery time of X seconds after which this process shall not generate any bit errors. The value of X is for further study; a value of one second has been proposed. - -#### **OTUCni specific processes** - -**OTUCni Frame and multi-frame alignment:** The function shall recover the OTUC instance frame start and multi-frame start as described in clause 8.2.3. - -**OTUCni Deskew:** The function shall compensate the skew between ni OTUC instances based on OTUC instance frame start indication (alignment markers) as described in clause 10.1.4 of [ITU-T G.709.1]. The alignment process shall establish the delay compensation, compensating the differential delay between the OTUC instance signals as given in clause 10.1.4 of [ITU-T G.709.1]. The compensation between the OTUC instances is achieved by an elastic store per OTUC instance. Each OTUC instance signal shall be written into an elastic store with the OTUC frame start indication. Each elastic store shall be capable of compensating at least 300 ns of absolute differential delay between the OTUC instances for FlexO short reach applications and at least 1 $\mu$ s of absolute differential delay between the OTUC instances for FlexO long reach applications. The process has two states, out-of-alignment (OOA) and in-alignment (IA). The alignment start shall be maintained during the OOA state. In the OOA state, if the bytes of the OTUC instances signals can be written consistently into the elastic store in the presence of a differential delay in line without exceeding the buffering time, the IA state shall be entered. In this case, the differential delay can be compensated. In the IA state, if the differential delay between two OTUC instances exceeds the maximum delay that can be compensated, the OOA state shall be entered. - -**OTUCni Recover:** The function shall recombine ni OTUC instances into an OTUCni as described in clause F.1 of [ITU-T G.709.3]. - -![Figure 15-23 – FlexO-n/OTUCn_i_A_Sk client specific processes. This block diagram illustrates the internal architecture of a FlexO-n/OTUCn_i_A_Sk client. At the bottom, multiple tributary ports (i=1..N) provide data (D[i, n_j]), clock (CK[i, n_j]), and frame synchronization (FS[i, n_j]) signals. Each port has an 'Extract JC' block feeding into a 'Justification control'. These controls manage 'Elastic store' units (WR/Read, RD/Write) which output data (D[i, n_j]), clock (CK[i, n_j]), and frame synchronization (FS[i, n_j]) signals. A 'Clock generator (ODCp)' receives clock signals (CK[i, 1]) and provides write (WR) and read (RD) signals to the elastic stores. Above the elastic stores, 'OTUC frame and multiframe alignment' blocks process the data to produce 'dLOFLOM[i, 1]' and 'dLOFLOM[i, n_j]' signals. These are followed by 'OTUCn_i deskew' and 'OTUCn_i recover' blocks, which output 'MFS', 'FS', 'CK', and 'D' signals. A 'Select normal/AIS' block contains 'Normal' and 'AIS' sub-blocks, receiving 'aAIS' and 'aSSF' signals from 'Consequent actions'. The 'Consequent actions' block also receives 'AI_TSF[i, 1..n_j]' and various defect signals: 'dFMM', 'dGIDM', 'dPLM', 'dMSIM[i]', 'dLOL[i]', and 'dLOFLOM[i, 1..n_j]'. The 'Select normal/AIS' block outputs 'CI_MFS', 'CI_FS', 'CI_CK', and 'CI_D' signals. Finally, an 'OTUCn_CP[i]' block at the top outputs 'CI_SSF'.](600c8f9d34f98c395e29c266aebfbd8e_img.jpg) - -Figure 15-23 – FlexO-n/OTUCn\_i\_A\_Sk client specific processes. This block diagram illustrates the internal architecture of a FlexO-n/OTUCn\_i\_A\_Sk client. At the bottom, multiple tributary ports (i=1..N) provide data (D[i, n\_j]), clock (CK[i, n\_j]), and frame synchronization (FS[i, n\_j]) signals. Each port has an 'Extract JC' block feeding into a 'Justification control'. These controls manage 'Elastic store' units (WR/Read, RD/Write) which output data (D[i, n\_j]), clock (CK[i, n\_j]), and frame synchronization (FS[i, n\_j]) signals. A 'Clock generator (ODCp)' receives clock signals (CK[i, 1]) and provides write (WR) and read (RD) signals to the elastic stores. Above the elastic stores, 'OTUC frame and multiframe alignment' blocks process the data to produce 'dLOFLOM[i, 1]' and 'dLOFLOM[i, n\_j]' signals. These are followed by 'OTUCn\_i deskew' and 'OTUCn\_i recover' blocks, which output 'MFS', 'FS', 'CK', and 'D' signals. A 'Select normal/AIS' block contains 'Normal' and 'AIS' sub-blocks, receiving 'aAIS' and 'aSSF' signals from 'Consequent actions'. The 'Consequent actions' block also receives 'AI\_TSF[i, 1..n\_j]' and various defect signals: 'dFMM', 'dGIDM', 'dPLM', 'dMSIM[i]', 'dLOL[i]', and 'dLOFLOM[i, 1..n\_j]'. The 'Select normal/AIS' block outputs 'CI\_MFS', 'CI\_FS', 'CI\_CK', and 'CI\_D' signals. Finally, an 'OTUCn\_CP[i]' block at the top outputs 'CI\_SSF'. - -G.798(17)-Amd.3(21)\_F15-23 - -**Figure 15-23 – FlexO-n/OTUCni\_A\_Sk client specific processes** - -## Defects - -The function shall detect dGIDM, dFMM, dPLM, dMSIM[i], dLOFLOM[i,j] and dLOL[i] where 'i' is 1..N, j = 1..ni, and ji = 1..ni. - -**dGIDM:** See clause B.1.1.2.1. dGIDM shall be set to false during $\sum AI\_TSF[j]$ . - -**dFMM:** See clause B.1.1.2.2. dFMM shall be set to false during $\sum AI\_TSF[j]$ . - -**dPLM:** See clause 6.2.4.2. The expected payload type is "0000 0010". dPLM shall be set to false during $\sum AI\_TSF[j]$ . - -Per OTUCni tributary port #i (i = 1..N): - -**dMSIM[i]:** See clause 6.2.9.2. dMSIM is detected per active OTUCni. - -**dLOL[i]**: If the alignment process is in the OLA state, dLOL[i] shall be set to true. dLOL[i] shall be set to false when the alignment process is in the ILA state; dLOL[i] shall be set to false during $\sum_{AI\_TSF}[i, 1..n_i]$ . - -Per OTUC instance #(i,ji) (i = 1 .. N, ji = 1..ni): - -**dLOFLOM[i,ji]**: See clause 6.2.5.3. - -### Consequent actions - -Per OTUCn tributary port #i (i = 1..N): - -$$aSSF[i] \leftarrow dGIDM \text{ or } dFMM \text{ or } dPLM \text{ or } dLOL[i] \text{ or } \sum_j dLOFLOM[i,j] \text{ or } dMSIM[i] \text{ or } \sum_{AI\_TSF}[j]$$ - -$$aAIS[i] \leftarrow dGIDM \text{ or } dFMM \text{ or } dPLM \text{ or } dLOL[i] \text{ or } \sum_j dLOFLOM[i,j] \text{ or } dMSIM[i] \text{ or } \sum_{AI\_TSF}[j]$$ - -On declaration of aAIS[i], the function shall output an all-ONES pattern/signal within two frames on the OTUCn\_CP[i]. On clearing aAIS[i], the all-ONES pattern/signal shall be removed within two frames, with normal data being output. The AIS clock, frame start and multi-frame start shall be independent from the incoming clock, frame start and multi-frame start. The clock has to be within the OTUCn frequency tolerance range as specified in Table 7-1 of [ITU-T G.709]. Jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCa clock) apply. - -### Defect correlations - -$$cGIDM \leftarrow dGIDM$$ - -$$cFMM \leftarrow dFMM \text{ and (not } dGIDM)$$ - -$$cPLM \leftarrow dPLM \text{ and (not } dGIDM) \text{ and (not } dFMM)$$ - -Per OTUCn tributary port #i (i = 1..N, ji = 1..ni): - -$$cMSIM[i] \leftarrow dMSIM[i] \text{ and (not } dGIDM) \text{ and (not } dFMM) \text{ and (not } dPLM)$$ - -$$cLOFLOM[i] \leftarrow \sum_j (dLOFLOM[i,j] \text{ and (not } AI\_TSF[j])) \text{ and (not } dGIDM) \text{ and (not } dFMM)$$ - -$$cLOL[i] \leftarrow dLOL[i] \text{ and (not } dGIDM) \text{ and (not } dFMM) \text{ and (not } dPLM) \text{ and (not } \sum_j dLOFLOM[i,j])$$ - -**Performance monitoring:** None. - -## 15.4 Compound functions - -### 15.4.1 FlexO-x compound trail termination function (FlexO-x\_CTT) - -The FlexO-x compound trail termination function (FlexO-x\_CTT) contains one FlexO-x\_TT function, one FlexO-x/FlexO\_A function and 1 to x FlexO\_TT functions. - -NOTE – This FlexO-x\_CTT function is typically deployed on FlexO-x-RS interfaces. This FlexO-x\_CTT function may also be deployed on other FlexO-x- interfaces. - -Figure 15-24 shows the combination of the unidirectional sink and source functions to form a bidirectional function. - -![Figure 15-24: FlexO-x_CTT diagram showing two FlexO-x blocks. The left block has inputs FlexO-x_APs (1, 2, ..., x) and FlexO-x_TCP at the bottom. The right block has outputs FlexO-x_APs (1, 2, ..., x) and FlexO-x_TCP at the bottom. A horizontal arrow labeled FlexO-x_RP points from the right block to the left block. A small note G.798(17)-Amd.3(21)_F15-24 is at the bottom right.](29e446c8e2363d27e282737c3d7c3421_img.jpg) - -Figure 15-24: FlexO-x\_CTT diagram showing two FlexO-x blocks. The left block has inputs FlexO-x\_APs (1, 2, ..., x) and FlexO-x\_TCP at the bottom. The right block has outputs FlexO-x\_APs (1, 2, ..., x) and FlexO-x\_TCP at the bottom. A horizontal arrow labeled FlexO-x\_RP points from the right block to the left block. A small note G.798(17)-Amd.3(21)\_F15-24 is at the bottom right. - -Figure 15-24 – FlexO-*x* \_CTT - -**15.4.1.1 FlexO-*x* compound trail termination source function (FlexO-*x* \_CTT\_So)** - -The FlexO-*x* \_CTT\_So function interleaves *x* FlexO signals from the *x* × FlexO\_APs into a FlexO-*x* signal adding FlexO-*x* section monitoring overhead – including the RPF signal – in the STAT overhead field. For the case that up to *x*-1 FlexO\_APs are not connected and do not receive an input signal, the function replaces these FlexO\_AI by an all-0's unequipped FlexO signal. - -The information flow and processing of the FlexO-*x* \_CTT\_So function is defined with reference to Figures 15-25 and 15-26. - -**Symbol** - -![Figure 15-25: FlexO-x_TT_So function symbol. A FlexO-x block has inputs FlexO_APs (1, 2, ..., x) at the top and FlexO-x_RP from the right. It has an output FlexO-x_TCP at the bottom. A small note G.798(17)-Amd.3(21)_F15-25 is at the bottom right.](d7a98a717edbc26ca1508aaab7a566f4_img.jpg) - -Figure 15-25: FlexO-x\_TT\_So function symbol. A FlexO-x block has inputs FlexO\_APs (1, 2, ..., x) at the top and FlexO-x\_RP from the right. It has an output FlexO-x\_TCP at the bottom. A small note G.798(17)-Amd.3(21)\_F15-25 is at the bottom right. - -Figure 15-25 – FlexO-*x* \_TT\_So function - -**Interfaces** - -Table 15-13 – FlexO-*x* \_CTT\_So inputs and outputs - -| Input(s) | Output(s) | -|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|----------------------------------------------------------------------------------------------------------------------------------------------------| -| 1 to x × FlexO_AP:
FlexO- x _AI_CK
FlexO- x _AI_D[1.. x ]
FlexO- x _AI_FS
FlexO- x _AI_MFS
FlexO-x _RP:
FlexO- x _RI_RPF | FlexO-x _TCP:
FlexO- x _CI_CK
FlexO- x _CI_D[1.. x ]
FlexO- x _CI_FS
FlexO- x _CI_MFS | - -**Atomic functions** - -The atomic functions associated with the FlexO-*x* \_CTT\_So function and the inputs and outputs are as depicted in Figure 15-26. - -**FlexO\_TT\_So:** 1 to $x$ instances of this atomic function are present. Typically, the first $m-1$ FlexO- $x$ \_CTT\_So functions that support the FlexO- $x$ -- $m$ interface group contain $x$ instances of this atomic function and the last FlexO- $x$ \_CTT\_So function contains $n - x \times m$ instances, with $n$ determined by the FlexO- $n$ /\_A\_So function. - -**FlexO- $x$ /FlexO\_A\_So:** 1 instance of this atomic function is present. - -**FlexO- $x$ \_TT\_So:** 1 instance of this atomic function is present. - -**FlexO\_AP:** 1 to $x$ instances of this reference point are present. Typically, the first $m-1$ FlexO- $x$ \_CTT\_So functions that support the FlexO- $x$ -- $m$ interface group contain $x$ instances of this reference point and the last FlexO- $x$ \_CTT\_So function contains $n - x \times m$ instances, with $n$ determined by the FlexO- $n$ /\_A\_So function. - -**FlexO- $x$ \_TCP:** 1 instance of this reference point is present. - -**FlexO- $x$ \_RP:** 1 instance of this reference point is present. - -![Diagram of FlexO-x_CTT_So atomic functions showing signal flow from FlexO-APs through FlexO and FlexO-x blocks to FlexO-x_TCP.](000a505684f871e191bad335434f58a9_img.jpg) - -The diagram illustrates the signal flow within the FlexO- $x$ \_CTT\_So atomic functions. At the top, multiple input signals, labeled 1, 2, ..., $x$ , enter from the FlexO\_APs. Each input signal passes through a trapezoidal block labeled 'FlexO'. The outputs of these 'FlexO' blocks converge into a single horizontal bar labeled 'FlexO- $x$ /FlexO'. Below this bar, the signal passes through a trapezoidal block labeled 'FlexO- $x$ '. The final output of the system is labeled 'FlexO- $x$ \_TCP' at the bottom. A small text label 'G.798(17)-Amd.3(21)\_F15-26' is located at the bottom right of the diagram. - -Diagram of FlexO-x\_CTT\_So atomic functions showing signal flow from FlexO-APs through FlexO and FlexO-x blocks to FlexO-x\_TCP. - -**Figure 15-26 – FlexO- $x$ \_CTT\_So atomic functions** - -#### **15.4.1.2 FlexO- $x$ compound trail termination sink function (FlexO- $x$ \_CTT\_Sk)** - -The FlexO- $x$ \_CTT\_Sk function reports the state of the FlexO- $x$ trail. It extracts FlexO- $x$ monitoring overhead – including the RPF signal – in the STAT overhead field from the FlexO signal at its FlexO- $x$ \_TCP, detects for the RPF defect, and forwards the error and defect information as backward indications to the companion FlexO- $x$ \_CTT\_So function. The function disinterleaves $x$ FlexO signals from the FlexO- $x$ signal and present these at the $x$ FlexO\_APs. - -The information flow and processing of the FlexO- $x$ \_CTT\_Sk function is defined with reference to Figures 15-27 and 15-28. - -## Symbol - -![Symbol diagram for FlexO-x_CTT_Sk function. A central triangle labeled 'FlexO-x' has an input arrow from the bottom labeled 'FlexO-x_TCP'. It has an output arrow to the right labeled 'FlexO-x_RP' and an output arrow to the left labeled 'FlexO-x_CTT_Sk_MP'. Above the triangle, there are x output arrows labeled 'FlexO-x_AP' with subscripts 1, 2, and x.](2339cc41fe4145cad3d90c1cd295dfd3_img.jpg) - -G.798(17)-Amd.3(21)\_F15-27 - -Symbol diagram for FlexO-x\_CTT\_Sk function. A central triangle labeled 'FlexO-x' has an input arrow from the bottom labeled 'FlexO-x\_TCP'. It has an output arrow to the right labeled 'FlexO-x\_RP' and an output arrow to the left labeled 'FlexO-x\_CTT\_Sk\_MP'. Above the triangle, there are x output arrows labeled 'FlexO-x\_AP' with subscripts 1, 2, and x. - -Figure 15-27 – FlexO-*x*\_CTT\_Sk function - -## Interfaces - -Table 15-14 – FlexO-*x*\_CTT\_Sk inputs and outputs - -| Input(s) | Output(s) | -|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| FlexO-x_TCP:
FlexO- x _CI_CK
FlexO- x _CI_D[1.. x ]
FlexO- x _CI_FS
FlexO- x _CI_MFS
FlexO- x _CI_SSF | 1 to x × FlexO-x_AP:
FlexO_AI_CK
FlexO_AI_D[1.. x ]
FlexO_AI_FS
FlexO_AI_MFS
FlexO_AI_CRCerr[1.. x ]
FlexO_AI_TSF
FlexO-x_RP:
FlexO- x _RI_RPF
FlexO-x_CTT_Sk_MP:
FlexO- x _CTT_Sk_MI_cRDI
FlexO- x _CTT_Sk_MI_cSSF | - -## Atomic functions - -The atomic functions associated with the FlexO-*x*\_CTT\_Sk function and the inputs and outputs are as depicted in Figure 15-28. - -**FlexO\_TT\_Sk:** 1 to *x* instances of this atomic function are present. Typically, the first *m*-1 FlexO-*x*\_CTT\_Sk functions that support the FlexO-*x*--*m* interface group contain *x* instances of this atomic function and the last FlexO-*x*\_CTT\_Sk function contains *n* – *x* × *m* instances, with *n* determined by the FlexO-*n*/\_A\_Sk function. - -**FlexO-*x*/FlexO\_A\_Sk:** 1 instance of this atomic function is present. - -**FlexO-*x*\_TT\_Sk:** 1 instance of this atomic function is present. - -**FlexO\_AP:** 1 to *x* instances of this reference point are present. Typically, the first *m*-1 FlexO-*x*\_CTT\_Sk functions that support the FlexO-*x*--*m* interface group contain *x* instances of this reference point and the last FlexO-*x*\_CTT\_Sk function contains *n* – *x* × *m* instances, with *n* determined by the FlexO-*n*/\_A\_Sk function. - -**FlexO-*x*\_TCP:** 1 instance of this reference point is present. - -**FlexO-*x*\_RP:** 1 instance of this reference point is present. - -**FlexO-*x*\_CTT\_Sk\_MP:** 1 instance of this reference point is present and presents the information of the FlexO-*x*\_TT\_Sk\_MP. - -![Diagram of FlexO-x_CTT_Sk atomic functions showing multiple FlexO units (1, 2, ..., x) connected to a central FlexO-x block. The diagram shows data flow from FlexO-x_TCP through FlexO-x_CTT_Sk_MP, then through a central FlexO-x block to FlexO-x_RP. Above the central block, multiple FlexO units are shown, each with a FlexO-x_TT_Sk_MP input and a FlexO output. The FlexO outputs are connected to FlexO_APs. The diagram is labeled G.798(17)-Amd.3(21)_F15-28.](5083128e335a383c042e15d2d8795c95_img.jpg) - -Diagram of FlexO-x\_CTT\_Sk atomic functions showing multiple FlexO units (1, 2, ..., x) connected to a central FlexO-x block. The diagram shows data flow from FlexO-x\_TCP through FlexO-x\_CTT\_Sk\_MP, then through a central FlexO-x block to FlexO-x\_RP. Above the central block, multiple FlexO units are shown, each with a FlexO-x\_TT\_Sk\_MP input and a FlexO output. The FlexO outputs are connected to FlexO\_APs. The diagram is labeled G.798(17)-Amd.3(21)\_F15-28. - -**Figure 15-28 – FlexO-*x* CTT\_Sk atomic functions** - -## 16 OTSi adaptation functions - -### 16.1 OTSi to OTUk or OTUk-RS adaptation function (OTSi/OTUk\_A or OTSi/OTUk-RS\_A) - -The OTSi to OTUk (*k* = 0, 1, 2, 3, 4) or OTUk-RS (*k* = 25u, 25, 50u, 50) adaptation functions perform the adaptation between the OTSi layer adapted information and the characteristic information of the completely standardized OTUk or OTUk-RS layer signal. For OTUk with *k* = 0, 1, 2, 3, 4, three types of functions are defined: one that supports the standardized forward error correction (FEC), one that does not support FEC, and one that supports vendor-specific FEC. For OTUk-RS with *k* = 25u, 25, 50u, 50, the functions support the RS FEC schemes specified in [ITU-T G.709.4]. - -**Table 16-1 – OTSi to OTUk adaptation functions (*k* = 0, 1, 2, 3, 4)** - -| Function type | Function name | OTUk | -|---------------|-----------------------------------------------------------|---------------------| -| OTSi/OTUk-a_A | OTSi to OTUk adaptation function with FEC | k =0,1,2,3,4 | -| OTSi/OTUk-b_A | OTSi to OTUk adaptation function without FEC | k =0,1,2,3 | -| OTSi/OTUk-v_A | OTSi to OTUk adaptation function with vendor-specific FEC | k =0,1,2,3,4 | - -NOTE 1 – OTSi/OTUk\_A is used throughout this clause as shorthand for the specific function type for *k* = 0, 1, 2, 3, 4. - -NOTE 2 – The OTSi to OTU4-SC adaptation function with SC FEC (OTSi/OTU4-SC\_A) is specified in clause 16.3. - -#### 16.1.1 OTSi to OTUk adaptation source function (OTSi/OTUk\_A\_So; *k* = 0, 1, 2, 3, 4) - -The information flow and processing of the OTSi/OTUk\_A\_So function is defined with reference to Figures 16-1 and 16-2. - -## Symbol - -![Symbol diagram for OTSi/OTUk_A_So function. An input OTUk_CP enters a trapezoidal block labeled OTSi/OTUk from the top. An output OTSi_AP exits the block from the bottom. The reference G.798(17)_F16-1 is shown below the output.](09e709f61c6ce948e16ddcc0f7efebcb_img.jpg) - -Symbol diagram for OTSi/OTUk\_A\_So function. An input OTUk\_CP enters a trapezoidal block labeled OTSi/OTUk from the top. An output OTSi\_AP exits the block from the bottom. The reference G.798(17)\_F16-1 is shown below the output. - -Figure 16-1 – OTSi/OTUk\_A\_So function (k = 0, 1, 2, 3, 4) - -## Interfaces - -Table 16-2 – OTSi/OTUk\_A\_So inputs and outputs (k = 0, 1, 2, 3, 4) - -| Input(s) | Output(s) | -|-------------------------------------------------------------------------|--------------------------------| -| OTUk_CP:
OTUk_CI_CK
OTUk_CI_D
OTUk_CI_FS
OTUk_CI_MFS | OTSi_AP:
OTSi_AI_PLD | - -## Processes - -The processes associated with the OTSi/OTUk\_A\_So function are as depicted in Figure 16-2. - -**FAS/MFAS insertion:** The function shall insert the FAS and MFAS into the OTU frame alignment area as described in [ITU-T G.709]. - -**FEC encoder:** See clause 8.5.2 for the OTSi/OTUk-a\_A\_So function, clause 8.5.1 for the OTSi/OTUk-b\_A\_So function and clause 8.5.3 for the OTSi/OTUk-v\_A\_So function. - -**Scrambler:** The function shall scramble the signal as defined in clause 11.2 of [ITU-T G.709]. - -![Process diagram for OTSi/OTUk_A_So. The input OTUk_CP is shown at the top with four vertical lines labeled CI_D, CI_CK, CI_FS, and CI_MFS entering a large grey box. Inside the box, the signals pass through three blocks: 'FAS/MFAS insertion', 'FEC encoder', and 'Scrambler'. Between each block, the signals are labeled D, CK, and FS. An output line labeled AI_PLD exits the bottom of the grey box, leading to the final output OTSi_AP. The reference G.798(17)_F16-2 is shown next to the exit point.](7e19e42b9cf476a0c228935fa4d635d5_img.jpg) - -Process diagram for OTSi/OTUk\_A\_So. The input OTUk\_CP is shown at the top with four vertical lines labeled CI\_D, CI\_CK, CI\_FS, and CI\_MFS entering a large grey box. Inside the box, the signals pass through three blocks: 'FAS/MFAS insertion', 'FEC encoder', and 'Scrambler'. Between each block, the signals are labeled D, CK, and FS. An output line labeled AI\_PLD exits the bottom of the grey box, leading to the final output OTSi\_AP. The reference G.798(17)\_F16-2 is shown next to the exit point. - -Figure 16-2 – OTSi/OTUk\_A\_So processes (k = 0, 1, 2, 3, 4) - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -### 16.1.2 OTSi to OTUk adaptation sink function (OTSi/OTUk\_A\_Sk; k = 0, 1, 2, 3, 4) - -The information flow and processing of the OTSi/OTUk\_A\_Sk function is defined with reference to Figures 16-3 and 16-4. - -#### Symbol - -![Diagram of the OTSi/OTUk_A_Sk function symbol. A central trapezoidal block labeled 'OTSi/OTUk' has two input arrows pointing to its bottom from 'OTSi_AP' and 'OTSiG-O_AP'. It has one output arrow pointing upwards to 'OTUk_CP'. A double-headed horizontal arrow on the left points to the block from 'OTSi/OTUk_A_Sk_MP'. Below the diagram is the text 'G.798(17)-Amd.4(22)_F16-3'.](4b4b9c9c016880edb872f25cefc85eb1_img.jpg) - -Diagram of the OTSi/OTUk\_A\_Sk function symbol. A central trapezoidal block labeled 'OTSi/OTUk' has two input arrows pointing to its bottom from 'OTSi\_AP' and 'OTSiG-O\_AP'. It has one output arrow pointing upwards to 'OTUk\_CP'. A double-headed horizontal arrow on the left points to the block from 'OTSi/OTUk\_A\_Sk\_MP'. Below the diagram is the text 'G.798(17)-Amd.4(22)\_F16-3'. - -**Figure 16-3 – OTSi/OTUk\_A\_Sk function (k = 0, 1, 2, 3, 4)** - -#### Interfaces - -**Table 16-3 – OTSi/OTUk\_A\_Sk inputs and outputs (k = 0, 1, 2, 3, 4)** - -| Input(s) | Output(s) | -|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| OTSi_AP:
OTSi_AI_PLD
OTSiG-O_AP:
OTSiG-O_AI_TSF-P
OTSiG-O_AI_TSF-O
OTSi/OTUk_A_Sk_MP:
OTSi/OTUk_A_Sk_MI_FECEn (Note)
OTSi/OTUk_A_Sk_MI_1second (Note) | OTUk_CP:
OTUk_CI_CK
OTUk_CI_D
OTUk_CI_FS
OTUk_CI_MFS
OTUk_CI_SSF
OTSi/OTUk_A_Sk_MP:
OTSi/OTUk_A_Sk_MI_cLOS-P
OTSi/OTUk_A_Sk_MI_cLOF
OTSi/OTUk_A_Sk_MI_cLOM
OTSi/OTUk_A_Sk_MI_pFECcorrErr (Note) | -| NOTE – For OTSi/OTUk-a_A_Sk and OTSi/OTUk-v_A_Sk only. | | - -#### Processes - -The processes associated with the OTSi/OTUk\_A\_Sk function are as depicted in Figure 16-4. - -**Clock recovery:** The function shall recover the OTUk clock signal from the incoming data. The function shall introduce no errors in case of jitter and wander as defined in clause 6 of [ITU-T G.8251]. - -**Frame alignment:** The function shall recover the OTUk frame start as described in clause 8.2.1. - -**Descrambler:** The function shall perform descrambling as defined in clause 11.2 of [ITU-T G.709]. - -**FEC decoder:** See clause 8.5.2 for the OTSi/OTUk-a\_A\_Sk function, clause 8.5.1 for the OTSi/OTUk-b\_A\_Sk function and clause 8.5.3 for the OTSi/OTUk-v\_A\_Sk function. - -**Multiframe alignment:** The function shall recover the OTUk multiframe start as described in clause 8.2.2. - -![Figure 16-4 – OTSi/OTUk_A_Sk processes (k = 0, 1, 2, 3, 4). This block diagram illustrates the signal processing flow for OTSi/OTUk_A_Sk processes. The diagram is divided into two main sections: OTUk_CP (top) and OTSi_AP (bottom). The signal flow starts from the bottom (OTSi_AP) with inputs AI_PLD, AI_TSF-O, and AI_TSF-P. AI_TSF-O and AI_TSF-P feed into a 'Clock recovery' block, which outputs D, CK, and FS. These signals feed into a 'Frame alignment' block, which outputs D, CK, and FS. The 'Frame alignment' block feeds into 'dLOF detection' (outputting dLOF), 'dAIS detection' (outputting dAIS), and 'LOS detection' (outputting dLOS-P). The 'dLOF detection', 'dAIS detection', and 'LOS detection' blocks feed into 'Defect correlations', which outputs MI_cLOM, MI_cLOF, and MI_cLOS. The 'Frame alignment' block also feeds into a 'Descrambler' block, which outputs D, CK, and FS. The 'Descrambler' block feeds into a 'FEC decoder' block, which outputs D, CK, and FS. The 'FEC decoder' block feeds into 'Multiframe alignment', which outputs CI_D, CI_CK, CI_FS, and CI_MFS. The 'Multiframe alignment' block feeds into 'dLOM detection' (outputting dLOM). The 'dLOM detection' block feeds into 'Consequent actions', which outputs aSSF. The 'Consequent actions' block also receives inputs dLOF, dAIS, dLOS-P, and AI_TSF-P. The 'Consequent actions' block feeds into CI_SSF. The 'Performance monitoring' block receives inputs nFECcorrErr, MI_FECEn, MI_1second, and MI_pFECcorrErr. The 'Performance monitoring' block feeds into 'Defect correlations'.](0b733c1407312c5b063e9bb458ef99db_img.jpg) - -Figure 16-4 – OTSi/OTUk\_A\_Sk processes (k = 0, 1, 2, 3, 4). This block diagram illustrates the signal processing flow for OTSi/OTUk\_A\_Sk processes. The diagram is divided into two main sections: OTUk\_CP (top) and OTSi\_AP (bottom). The signal flow starts from the bottom (OTSi\_AP) with inputs AI\_PLD, AI\_TSF-O, and AI\_TSF-P. AI\_TSF-O and AI\_TSF-P feed into a 'Clock recovery' block, which outputs D, CK, and FS. These signals feed into a 'Frame alignment' block, which outputs D, CK, and FS. The 'Frame alignment' block feeds into 'dLOF detection' (outputting dLOF), 'dAIS detection' (outputting dAIS), and 'LOS detection' (outputting dLOS-P). The 'dLOF detection', 'dAIS detection', and 'LOS detection' blocks feed into 'Defect correlations', which outputs MI\_cLOM, MI\_cLOF, and MI\_cLOS. The 'Frame alignment' block also feeds into a 'Descrambler' block, which outputs D, CK, and FS. The 'Descrambler' block feeds into a 'FEC decoder' block, which outputs D, CK, and FS. The 'FEC decoder' block feeds into 'Multiframe alignment', which outputs CI\_D, CI\_CK, CI\_FS, and CI\_MFS. The 'Multiframe alignment' block feeds into 'dLOM detection' (outputting dLOM). The 'dLOM detection' block feeds into 'Consequent actions', which outputs aSSF. The 'Consequent actions' block also receives inputs dLOF, dAIS, dLOS-P, and AI\_TSF-P. The 'Consequent actions' block feeds into CI\_SSF. The 'Performance monitoring' block receives inputs nFECcorrErr, MI\_FECEn, MI\_1second, and MI\_pFECcorrErr. The 'Performance monitoring' block feeds into 'Defect correlations'. - -**Figure 16-4 – OTSi/OTUk\_A\_Sk processes (k = 0, 1, 2, 3, 4)** - -## Defects - -The function shall detect dLOS-P, dAIS, dLOF and dLOM. - -**dLOS-P:** See clause 6.2.1.2. - -**dAIS:** See clause 6.2.6.3.1 for k = 1, 2, 3; otherwise dAIS shall be assumed false. - -**dLOF:** See clause 6.2.5.1. - -**dLOM:** See clause 6.2.5.2. - -## Consequent actions - -aSSF $\leftarrow$ dLOS-P or dAIS or dLOF or dLOM or AI\_TSF-P - -## Defect correlations - -cLOS-P $\leftarrow$ dLOS-P and (not AI\_TSF-P) - -cLOF $\leftarrow$ dLOF and (not dLOS-P) and (not dAIS) and (not AI\_TSF-P) - -cLOM $\leftarrow$ dLOM and (not dLOS-P) and (not dLOF) and (not dAIS) and (not AI\_TSF-P) - -NOTE 1 – dAIS is not reported as fault cause as it is a secondary alarm and will result in aSSF, which is reported as cSSF fault cause in the OTUk\_TT\_Sk that directly follows this function. - -## Performance monitoring - -The OTSi/OTUk-a\_A\_Sk and OTSi/OTUk-v\_A\_Sk functions shall perform the following performance monitoring primitives processing. The performance monitoring primitives shall be reported to the EMF. - -$$pFECcorrErr \leftarrow \sum nFECcorrErr$$ - -NOTE 2 – During AI\_TSF-P, dAIS, dLOF and dLOM, no corrected bits shall be counted. - -### 16.1.3 OTSi to OTUk-RS adaptation source function (OTSi/OTUk-RS\_A\_So; k = 25u, 25, 50u, 50) - -The information flow and processing of the OTSi/OTUk-RS\_A\_So function is defined with reference to Figures 16-4.1 and 16-4.2. - -#### Symbol - -![Diagram of the OTSi/OTUk-RS_A_So function symbol. It shows an input labeled OTUk_CP entering a trapezoidal block labeled OTSi/OTUk-Rs from the top. An output labeled OTSi_AP exits the block from the bottom. Below the output label is the reference G.798(23)_F16-4.1.](527fb299e6996504538a9cb5ef733d84_img.jpg) - -Diagram of the OTSi/OTUk-RS\_A\_So function symbol. It shows an input labeled OTUk\_CP entering a trapezoidal block labeled OTSi/OTUk-Rs from the top. An output labeled OTSi\_AP exits the block from the bottom. Below the output label is the reference G.798(23)\_F16-4.1. - -Figure 16-4.1 – OTSi/OTUk-RS\_A\_So function (k = 25u, 25, 50u, 50) - -#### Interfaces - -Table 16-3.1 – OTSi/OTUk-RS\_A\_So inputs and outputs (k = 25u, 25, 50u, 50) - -| Input(s) | Output(s) | -|-------------------------------------------------------------------------|--------------------------------| -| OTUk_CP:
OTUk_CI_CK
OTUk_CI_D
OTUk_CI_FS
OTUk_CI_MFS | OTSi_AP:
OTSi_AI_PLD | - -#### Processes - -The processes associated with the OTSi/OTUk-RS\_A\_So function are as depicted in Figure 16-4.2. - -**FAS/MFAS insertion:** The function shall insert the FAS and MFAS into the OTU frame alignment area as described in [ITU-T G.709]. - -**Scrambler:** The function shall scramble the signal as defined in clause 8.4 of [ITU-T G.709.4] for k = 25, 25u and clause 9.4 of [ITU-T G.709.4] for k = 50, 50u. - -**Clock generation:** The function shall generate the OTUk-RS clock by multiplying the incoming OTUk clock (CI\_CK) by [21760/20559] for k = {25, 50u, 50} or by [640/623] for k = 25u to the frequencies as listed in [ITU-T G.709.4] Table B.1 (k = 25u, 50u), Table 8-1 (k = 25) or Table 9-1 (k = 50). - -**FS generator:** The function shall generate OTUk-RS frame starter identifier as described in clause 8.1 (k=25), clause 9.1 (k=50u,50) or clause B.1 (k=25u) of [ITU-T G.709.4]. - -**Mapping:** The function shall map (i.e., addition of alignment/codeword marker overhead area and FEC parity area) the incoming OTUk frame into the OTUk-RS frame payload area as defined in clause 10 of [ITU-T G.709.4]. - -**Alignment insertion:** The function shall insert the alignment/codeword marker into the OTUk-RS frame alignment area as described in clauses 8.3.1 and 9.3.1 of [ITU-T G.709.4]. - -**FEC encoder:** See clause 8.5.6 for k = 25, 50u, 50 and clause 8.5.7 for k = 25u. - -**Symbol Distribution:** For k = 50 the function shall divide the OTU50-RS frame signal into 2 OTL50.2-RS lanes based on 10-bit symbol granularity as described in clause 9.6 of [ITU-T G.709.4]. - -**2:1 bit interleaver:** For k = 50, the process bit multiplexes the two logical lanes of the OTU50-RS signal to a single physical optical OTSi signal according to clause 9.6 of [ITU-T G.709.4]. - -![Figure 16-4.2 – OTSi/OTUk-RS_A_So processes (k = 25u, 25, 50u, 50). The diagram shows two parallel processing paths. The left path is for OTU50_CP, starting with inputs CI_D, CI_CK, CI_FS, and CI_MFAS. It includes blocks for OTU50-RS clock generation (x21760/20559), FAS/MFAS insertion, Scrambler, Mapping, Alignment insertion, FEC encoder, Symbol distribution (outputting 1...2 lanes), and a 2:1 bit interleaver, resulting in OTL50.1-RS and OTSi_AP outputs. The right path is for OTU25_CP, starting with the same inputs. It includes blocks for OTU25-RS clock generation (x21760/20559 for k=25, x640/623 for k=25u), FAS/MFAS insertion, Scrambler, Mapping, Alignment insertion, and FEC encoder, resulting in OTSi_AP output. Both paths include an FS_RS generator block that provides clock and frame signal inputs to the Mapping and Alignment insertion blocks.](f6dcf82b673244b5b8c95616ca0d0556_img.jpg) - -Figure 16-4.2 – OTSi/OTUk-RS\_A\_So processes (k = 25u, 25, 50u, 50). The diagram shows two parallel processing paths. The left path is for OTU50\_CP, starting with inputs CI\_D, CI\_CK, CI\_FS, and CI\_MFAS. It includes blocks for OTU50-RS clock generation (x21760/20559), FAS/MFAS insertion, Scrambler, Mapping, Alignment insertion, FEC encoder, Symbol distribution (outputting 1...2 lanes), and a 2:1 bit interleaver, resulting in OTL50.1-RS and OTSi\_AP outputs. The right path is for OTU25\_CP, starting with the same inputs. It includes blocks for OTU25-RS clock generation (x21760/20559 for k=25, x640/623 for k=25u), FAS/MFAS insertion, Scrambler, Mapping, Alignment insertion, and FEC encoder, resulting in OTSi\_AP output. Both paths include an FS\_RS generator block that provides clock and frame signal inputs to the Mapping and Alignment insertion blocks. - -G.798(17)-Amd.4(22)\_F16-4.2 - -**Figure 16-4.2 – OTSi/OTUk-RS\_A\_So processes (k = 25u, 25, 50u, 50)** - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -### 16.1.4 OTSi to OTUk-RS adaptation sink function (OTSi/OTUk-RS\_A\_Sk; k = 25u, 25, 50u, 50) - -The information flow and processing of the OTSi/OTUk-RS\_A\_Sk function is defined with reference to Figures 16-4.3 and 16-4.4. - -#### Symbol - -![Figure 16-4.3: Symbol diagram for the OTSi/OTUk-RS_A_Sk function. A central trapezoidal block labeled 'OTSi/OTUk-RS' has two input arrows from below labeled 'OTSi_AP' and 'OTSiG-O_AP'. It has one output arrow pointing upwards labeled 'OTUk_CP'. A double-headed horizontal arrow to the left of the block is labeled 'OTSi/OTUk-RS_A_Sk_MP'. Below the diagram is the text 'G.798(17)-Amd.4(22)_F16-4.3'.](45b71f54324c8fd8c2830610b367dced_img.jpg) - -Figure 16-4.3: Symbol diagram for the OTSi/OTUk-RS\_A\_Sk function. A central trapezoidal block labeled 'OTSi/OTUk-RS' has two input arrows from below labeled 'OTSi\_AP' and 'OTSiG-O\_AP'. It has one output arrow pointing upwards labeled 'OTUk\_CP'. A double-headed horizontal arrow to the left of the block is labeled 'OTSi/OTUk-RS\_A\_Sk\_MP'. Below the diagram is the text 'G.798(17)-Amd.4(22)\_F16-4.3'. - -Figure 16-4.3 – OTSi/OTUk-RS\_A\_Sk function (k = 25u, 25, 50u, 50) - -#### Interfaces - -Table 16-3.2 – OTSi/OTUk-RS\_A\_Sk inputs and outputs (k = 25u, 25, 50u, 50) - -| Input(s) | Output(s) | -|--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| OTSi_AP:
OTSi_AI_PLD
OTSiG-O_AP:
OTSiG-O_AI_TSF-P
OTSiG-O_AI_TSF-O
OTSi/OTUk-RS_A_Sk_MP:
OTSi/OTUk-RS_A_Sk_MI_FECEn
OTSi/OTUk-RS_A_Sk_MI_1second | OTUk_CP:
OTUk_CI_CK
OTUk_CI_D
OTUk_CI_FS
OTUk_CI_MFS
OTUk_CI_SSF
OTSi/OTUk-RS_A_Sk_MP:
OTSi/OTUk-RS_A_Sk_MI_cLOS-P
OTSi/OTUk-RS_A_Sk_MI_cLOL
OTSi/OTUk-RS_A_Sk_MI_cLOF
OTSi/OTUk-RS_A_Sk_MI_cLOM
OTSi/OTUk-RS_A_Sk_MI_pFECcorrErr | - -#### Processes - -The processes associated with the OTSi/OTUk-RS\_A\_Sk function are as depicted in Figure 16-4.4. - -**Clock recovery:** The function shall recover the OTUk clock signal from the incoming data. The function shall introduce no errors in case of jitter and wander as defined in clause 6 of [ITU-T G.8251]. - -**1:2 bit dis-interleaver:** For k=50 the process shall bit de-multiplex the bitstream of the OTL50.1-RS physical lane into two logical lanes as defined in clause 9.6 of [ITU-T G.709.4]. - -**Alignment lock:** The function shall recover the start of OTUk-RS frame through obtaining LOCK to the alignment/codeword markers as specified by the FEC synchronization state diagram in clause 108.5.3.1 of [IEEE 802.3] for k = 25u, 25, or clause 134.5.3.1 of [IEEE 802.3] for k = 50u, 50. Additionally, the synchronization process on all logical lanes shall be restarted (restart\_lock set to true) if five consecutive alignment markers fail to match on any of the logical lanes. - -**Deskew & Reorder:** For k = 50 the function shall include deskewing and reordering processes. The deskewing process shall remove the skew of the two OTL50.2-RS lanes as specified by the FEC alignment state diagram in clause 134.5.3.1 of [IEEE 802.3]. It shall support a maximum skew of 180 - -ns between FEC lanes and a maximum skew variation of 4 ns. The reordering process shall reorder these two OTL50.2-RS lanes according to its lane number (see clause 9.6 of [ITU-T G.709.4]). - -**FEC decoder:** See clause 8.5.6 for k = 25, 50u, 50 and clause 8.5.7 for k = 25u. - -**Demapping:** The function shall demap (i.e., removal of alignment/codeword marker overhead area and FEC parity area) the OTUk frame from the OTUk-RS frame payload area as defined in clause 10 of [ITU-T G.709.4]. - -**Frame alignment:** The function shall recover the OTUk frame start as described in clause 8.2.9. - -**Descrambler:** The function shall perform descrambling as defined in clause 8.4 of [ITU-T G.709.4] for k = 25, 25u and clause 9.4 of [ITU-T G.709.4] for k = 50, 50u. - -**Multiframe alignment:** The function shall recover the OTUk multi-frame start as described in clause 8.2.2. - -![Block diagram of OTSi/OTU25(u)-R_A_Sk processes showing signal flow from OTSi_AP to OTU25_CP through various processing stages including Clock recovery, Alignment lock, FEC decoder, Demapping, Frame alignment, Descrambler, and Multi-frame alignment. It also includes detection blocks for dLOM, dLOF, dLOS-P, and a Defect correlation block.](fffcd82cf1347760ecef4f2db3059360_img.jpg) - -The diagram illustrates the OTSi/OTU25(u)-R\_A\_Sk processing pipeline. The signal flow is as follows: - -- Inputs:** OTSi\_AP (AI\_PLD, AI\_TSF-O, AI\_TSF-P) enter the bottom of the diagram. -- Clock recovery:** Receives AI\_TSF-O and AI\_TSF-P. It outputs D, CK, and FS signals upwards. It also connects to a **LOS detection** block which outputs **dLOS-P**. -- Alignment lock:** Receives D, CK, and FS. It outputs **dLOL** to the right. -- FEC decoder:** Receives D, CK, and FS. It outputs **nFECcorrErr** to the **Performance monitoring** block. -- Demapping:** Receives D, CK, and FS. -- Frame alignment:** Receives D, CK, and FS. It connects to a **dLOF detection** block which outputs **dLOF**. -- Descrambler:** Receives D, CK, FS, and MFS (from frame alignment). It outputs D, CK, FS, and MFS upwards. -- Multi-frame alignment:** Receives D, CK, FS, and MFS. It connects to a **dLOM detection** block which outputs **dLOM**. -- Outputs:** The final output is **OTU25\_CP**, which includes signals **CI\_D, CI\_CK, CI\_FS, and CI\_MFS**. -- Monitoring and Defect Correlation:** - - Performance monitoring:** Receives **nFECcorrErr** from the FEC decoder. It outputs **MI\_1second** and **MI\_pFECcorrErr** to the right. - - Defect correlation:** Receives **dLOM, dLOF, dLOL, dLOS-P, and AI\_TSF-P**. It outputs **MI\_cLOM, MI\_cLOF, MI\_cLOL, and MI\_cLOS-P** to the right. - - Consequent actions:** Receives **dLOM, dLOF, dLOS-P, and AI\_TSF-P**. It outputs **aSSF** to the **CI\_SSF** output line. -- Vertical Label:** OTSi/OTU25-RS\_A\_Sk\_MP is located on the far right side of the diagram. -- Diagram Code:** G.798(23)\_F16-4.4 is located at the bottom right of the diagram area. - -Block diagram of OTSi/OTU25(u)-R\_A\_Sk processes showing signal flow from OTSi\_AP to OTU25\_CP through various processing stages including Clock recovery, Alignment lock, FEC decoder, Demapping, Frame alignment, Descrambler, and Multi-frame alignment. It also includes detection blocks for dLOM, dLOF, dLOS-P, and a Defect correlation block. - -Figure 16-4.4 – OTSi/OTU25(u)-R\_A\_Sk processes - -![Block diagram of OTSi/OTU50(u)-RS_A_Sk processes showing signal flow from OTU50_CP to OTSi_AP through various processing stages including clock recovery, alignment, deskew, and FEC decoding. It also shows defect detection and monitoring blocks.](f4b7c84516339d37b6c63b18287d1493_img.jpg) - -The diagram illustrates the OTSi/OTU50(u)-RS\_A\_Sk processes. The signal flow is as follows: - -- OTU50\_CP** (top) provides signals **CI\_D**, **CI\_CK**, **CI\_FS**, and **CI\_MFS** to a **Multi-frame alignment** block. -- The **Multi-frame alignment** block outputs **dLOM** to a **dLOM detection** block and **aSSF** to **CI\_SSF** (top right). -- The **dLOM detection** block outputs **dLOM** to **Consequent actions**. -- The **Multi-frame alignment** block also outputs **D**, **CK**, **FS**, and **MFS** to a **Descrambler** block. -- The **Descrambler** block outputs **D**, **CK**, **FS**, and **MFS** to a **Frame alignment** block. -- The **Frame alignment** block outputs **dLOF** to a **dLOF detection** block. -- The **dLOF detection** block outputs **dLOF** to **Consequent actions**. -- The **Frame alignment** block also outputs **D**, **CK**, and **FS** to a **Demapping** block. -- The **Demapping** block outputs **D**, **CK**, and **FS** to a **FEC decoder** block. -- The **FEC decoder** block outputs **nFECcorrErr** to **Performance monitoring**. -- Performance monitoring** outputs **MI\_1second** and **MI\_pFECcorrErr** to **OTSIG/OTU50-RS\_A\_Sk\_MP** (right). -- The **FEC decoder** block also outputs **D**, **CK**, and **FS** to a **Lane reorder** block. -- The **Lane reorder** block outputs **D**, **CK**, and **FS** to a **Deskew** block. -- The **Deskew** block outputs **dLOL** to **Defect correlation**. -- Defect correlation** outputs **MI\_cLOM**, **MI\_cLOF**, **MI\_cLOL**, and **MI\_cLOS-P** to **OTSIG/OTU50-RS\_A\_Sk\_MP**. -- The **Deskew** block also outputs **D**, **CK**, and **FS** to two **Alignment lock** blocks (Lane #1 and Lane #2). -- The **Alignment lock** blocks output **restart\_lock[1]** and **restart\_lock[2]** to a **Lane marker process** block. -- The **Lane marker process** block outputs **restart** to the **Alignment lock** blocks. -- The **Alignment lock** blocks output **D[1]**, **CK[1]**, and **FS[1]** to a **1:2 bit dis-interleaver** block (Lane #1). -- The **1:2 bit dis-interleaver** block outputs **D[2]**, **CK[2]**, and **FS[2]** to the **Alignment lock** block (Lane #2). -- The **1:2 bit dis-interleaver** block also outputs **D** and **CK** to a **Clock recovery** block. -- The **Clock recovery** block outputs **dLOS-P** to **LOS detection**. -- The **LOS detection** block outputs **dLOS-P** to **Consequent actions**. -- The **Physical lane** (bottom left) contains the **Clock recovery** and **LOS detection** blocks. -- The **Physical lane** outputs **OTL50.1-RS** to **OTSIG/OTU50-RS\_A\_Sk\_MP**. -- OTSIG/OTU50-RS\_A\_Sk\_MP** outputs **AI\_PLD**, **AI\_TSF-O**, and **AI\_TSF-P** to **OTSi\_AP** (bottom). - -Labels on the right side of the diagram include: **OTSIG/OTU50-RS\_A\_Sk\_MP**, **Consequent actions**, **Performance monitoring**, and **Defect correlation**. - -Labels on the left side of the diagram include: **OTU50\_CP**, **CI\_D**, **CI\_CK**, **CI\_FS**, **CI\_MFS**, **CI\_SSF**, **Multi-frame alignment**, **dLOM detection**, **dLOM**, **aSSF**, **Descrambler**, **Frame alignment**, **dLOF detection**, **dLOF**, **Demapping**, **FEC decoder**, **nFECcorrErr**, **MI\_1second**, **MI\_pFECcorrErr**, **Lane reorder**, **Deskew**, **dLOL**, **Defect correlation**, **MI\_cLOM**, **MI\_cLOF**, **MI\_cLOL**, **MI\_cLOS-P**, **Alignment lock**, **restart\_lock[1]**, **restart\_lock[2]**, **Lane #1**, **Lane #2**, **D[1]**, **CK[1]**, **FS[1]**, **D[2]**, **CK[2]**, **FS[2]**, **1:2 bit dis-interleaver**, **Clock recovery**, **LOS detection**, **dLOS-P**, **Physical lane**, **OTSIG/OTU50-RS\_A\_Sk\_MP**, **OTL50.1-RS**, **AI\_PLD**, **AI\_TSF-O**, **AI\_TSF-P**, **OTSi\_AP**, **Lane marker process**, and **restart**. - -Block diagram of OTSi/OTU50(u)-RS\_A\_Sk processes showing signal flow from OTU50\_CP to OTSi\_AP through various processing stages including clock recovery, alignment, deskew, and FEC decoding. It also shows defect detection and monitoring blocks. - -G.798(23)\_F16-4.5 - -Figure 16-4.5 – OTSi/OTU50(u)-RS\_A\_Sk processes - -**Defects** - -The function shall detect dLOS-P, dLOL, dLOF and dLOM. - -**dLOS-P:** See clause 6.2.1.2. - -**dLOL:** For $k = 50u$ , 50 dLOL is generated based on the multilane FEC alignment lock process specified in clause 134.5.3.1 of [IEEE 802.3]. For $k = 25u$ , 25 dLOL is generated based on the codeword marker alignment lock and monitor processes specified in clauses 108.5.3.1 and 108.5.3.3 of [IEEE 802.3]. dLOL shall be declared if *fec\_alignment\_valid* is false for 3 ms. To provide for the case of intermittent out-of-locks (*fec\_alignment\_valid* is false), the integrating timer shall not be reset to zero until an in-lock (*fec\_alignment\_valid* is true) condition persists continuously for 3 ms. dLOL shall be cleared if *fec\_alignment\_valid* is true for 3 ms. - -**dLOF:** See clause 6.2.5.1. - -**dLOM:** See clause 6.2.5.2. - -#### Consequent actions - -aSSF $\leftarrow$ dLOS-P or dLOL or dLOF or dLOM or AI\_TSF-P - -#### Defect correlations - -cLOS-P $\leftarrow$ dLOS-P and (not AI\_TSF-P) - -cLOL $\leftarrow$ dLOL and (not dLOS-P) and (not AI\_TSF-P) - -cLOF $\leftarrow$ dLOF and (not dLOL) and (not dLOS-P) and (not AI\_TSF-P) - -cLOM $\leftarrow$ dLOM and (not dLOF) and (not dLOL) and (not dLOS-P) and (not AI\_TSF-P) - -#### Performance monitoring - -The function shall perform the following performance monitoring primitives processing. The performance monitoring primitives shall be reported to the EMF. - -pFECcorrErr $\leftarrow \sum nFECcorrErr$ - -NOTE – During AI\_TSF-P, dLOL, no corrected bits shall be counted. - -### 16.2 OTSi to OTUkV adaptation function (OTSi/OTUkV\_A) - -The OTSi to OTUkV adaptation functions perform the adaptation between the OTSi layer adapted information and the characteristic information of functionally standardized OTUkV layer signal. - -#### 16.2.1 OTSi to OTUkV adaptation source function (OTSi/OTUkV\_A\_So) - -The information flow and processing of the OTSi/OTUkV\_A\_So function is defined with reference to Figure 16-5. - -#### Symbol - -![Diagram of the OTSi/OTUkV_A_So function symbol. It shows a vertical flow: OTUkV_CP at the top, an arrow pointing down to a trapezoidal symbol labeled OTSi/OTUkV, and an arrow pointing down from that symbol to OTSi_AP at the bottom. The text G.798(17)_F16-5 is located to the right of the bottom arrow.](2977acb9333aa9e25450fff36691806b_img.jpg) - -``` -graph TD; A[OTUkV_CP] --> B{{OTSi/OTUkV}}; B --> C[OTSi_AP]; -``` - -G.798(17)\_F16-5 - -Diagram of the OTSi/OTUkV\_A\_So function symbol. It shows a vertical flow: OTUkV\_CP at the top, an arrow pointing down to a trapezoidal symbol labeled OTSi/OTUkV, and an arrow pointing down from that symbol to OTSi\_AP at the bottom. The text G.798(17)\_F16-5 is located to the right of the bottom arrow. - -**Figure 16-5 – OTSi/OTUkV\_A\_So function** - -## Interfaces - -**Table 16-4 – OTSi/OTUkV\_A\_So inputs and outputs** - -| Input(s) | Output(s) | -|-------------------------------------------------------------------------------------|--------------------------------| -| OTUkV_CP:
OTUkV_CI_CK
OTUkV_CI_D
OTUkV_CI_FS
OTUkV_VI_MFS (Note) | OTSi_AP:
OTSi_AI_PLD | -| NOTE – If OTUkV has a multiframe. | | - -## Processes - -The OTSi/OTUkV\_A\_So function provides all processes necessary for the adaptation to the OTSi layer, which includes processes that ensure clock and frame recovery at the adaptation sink and optional forward error correction coding. - -The specific processes are outside the scope of this Recommendation. - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -### 16.2.2 OTSi to OTUkV adaptation sink function (OTSi/OTUkV\_A\_Sk) - -The information flow and processing of the OTSi/OTUkV\_A\_Sk function is defined with reference to Figure 16-6. - -#### Symbol - -![Diagram of the OTSi/OTUkV_A_Sk function symbol. A central trapezoidal block labeled 'OTSi/OTUkV' has three connections: a horizontal double-headed arrow on the left labeled 'OTSi/OTUkV_A_Sk_MP', an upward-pointing arrow on top labeled 'OTUkV_CP', and two downward-pointing arrows on the bottom labeled 'OTSi_AP' and 'OTSiG-O_AP'. Below the block is the reference text 'G.798(17)-Amd.4(22)_F16-6'.](ea3fc2de81f3b1ff5c2f12cdeadcf831_img.jpg) - -Diagram of the OTSi/OTUkV\_A\_Sk function symbol. A central trapezoidal block labeled 'OTSi/OTUkV' has three connections: a horizontal double-headed arrow on the left labeled 'OTSi/OTUkV\_A\_Sk\_MP', an upward-pointing arrow on top labeled 'OTUkV\_CP', and two downward-pointing arrows on the bottom labeled 'OTSi\_AP' and 'OTSiG-O\_AP'. Below the block is the reference text 'G.798(17)-Amd.4(22)\_F16-6'. - -**Figure 16-6 – OTSi/OTUkV\_A\_Sk function** - -## Interfaces - -**Table 16-5 – OTSi/OTUkV\_A\_Sk inputs and outputs** - -| Input(s) | Output(s) | -|----------------------------------------------------------------------------------------------------------------------------------------------------------------------------|----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| For each OTSi_AP:
OTSi_AI_PLD
OTSiG-O_AP:
OTSiG-O_AI_TSF-P
OTSiG-O_AI_TSF-O
OTSi/OTUkV_A_Sk_MP:
OTSi/OTUkV_A_Sk_MI_1second (Note 2) | OTUkV_CP:
OTUkV_CI_CK
OTUkV_CI_D
OTUkV_CI_FS
OTUkV_CI_MFS (Note 1)
OTUkV_CI_SSF
OTSi/OTUkV_A_Sk_MP:
OTSi/OTUkV_A_Sk_MI_cLOS-P
OTSi/OTUkV_A_Sk_MI_cLOF
OTSi/OTUkV_A_Sk_MI_cLOM (Note 1)
OTSi/OTUkV_A_Sk_MI_pFECcorrErr (Note 2) | -| NOTE 1 – If OTUkV has a multiframe.
NOTE 2 – If the function performs FEC. | | - -## Processes - -The OTSi/OTUkV\_A\_Sk function provides all processes necessary for the adaptation from the OTSi layer, which includes processes for clock and frame start recovery and optional forward error correction decoding. - -The specific processes are outside the scope of this Recommendation. - -## Defects - -The function shall detect dAIS and dLOF. If the OTUkV includes a multiframe, it shall in addition detect dLOM. - -**dLOS-P:** See clause 6.2.1.2. - -**dAIS:** See clause 6.2.6.3.1. - -**dLOF:** The dLOF detection depends on the specific frame structure and is outside the scope of this Recommendation. - -**dLOM:** The dLOM detection is only required if the OTUkV has a multiframe, the detection depends on the specific multiframe structure and is outside the scope of this Recommendation. - -## Consequent actions: - -aSSF ← dLOS-P or dAIS or dLOF or AI\_TSF-P or dLOM - -NOTE 1 – dLOM is only included if the OTUkV has a multiframe. - -## Defect correlations - -cLOS-P ← dLOS-P and (not AI\_TSF-P) - -cLOF ← dLOF and (not dLOS-P) and (not dAIS) and (not AI\_TSF-P) - -cLOM ← dLOM and (not dLOS-P) and (not dLOF) and (not dAIS) and (not AI\_TSF-P) - -NOTE 2 – cLOM is only defined if the OTUkV has a multiframe. - -NOTE 3 – dAIS is not reported as fault cause as it is a secondary alarm and will result in aSSF, which is reported as cSSF fault cause in the ODU\_TT\_Sk that directly follows this function. - -## Performance monitoring - -The function shall perform the following performance monitoring primitives processing if it includes FEC processing. The performance monitoring primitives shall be reported to the EMF. - -$$pFECcorrErr \leftarrow \sum nFECcorrErr$$ - -NOTE 4 – During AI\_TSF-P, dAIS, dLOF and dLOM no corrected bits shall be counted. - -### 16.3 OTSiG to OTUk adaptation function (OTSiG/OTUk\_A) - -The OTSiG to OTUk adaptation functions perform the adaptation between the OTSiG layer adapted information and the characteristic information of the completely standardized OTUk layer signal. Three types of functions are defined: one that supports G.709 forward error correction (FEC), one that does not support FEC, and one that does support SC FEC. The functions without FEC are only defined for OTU3. - -**Table 16-6 – OTSiG to OTUk adaptation functions** - -| Function type | Function name | OTUk | -|----------------|--------------------------------------------------|----------| -| OTSiG/OTUk-a_A | OTSiG to OTUk adaptation function with G.709 FEC | k = 3, 4 | -| OTSiG/OTUk-b_A | OTSiG to OTUk adaptation function without FEC | k = 3 | -| OTSi/OTU4-SC_A | OTSi to OTU4 adaptation function with SC FEC | k = 4 | - -NOTE – OTSiG/OTUk\_A is used throughout this clause as shorthand for the specific function type. - -#### 16.3.1 OTSiG to OTUk adaptation source function (OTSiG/OTUk\_A\_So) - -The information flow and processing of the OTSiG/OTUk\_A\_So function is defined with reference to Figures 16-7 and 16-8. - -##### Symbol - -![Diagram of the OTSiG/OTUk_A_So function symbol. An input labeled OTUk_CP enters a trapezoidal block labeled OTSiG/OTUk from the top. From the bottom of the block, multiple output lines emerge, labeled 1, ..., m, leading to OTSi_AP[1] and OTSi_AP[m]. Below the diagram is the text G.798(17)-Amd.4(22)_F16-7.](96be3e8be94c247917bab0d91881b5dc_img.jpg) - -Diagram of the OTSiG/OTUk\_A\_So function symbol. An input labeled OTUk\_CP enters a trapezoidal block labeled OTSiG/OTUk from the top. From the bottom of the block, multiple output lines emerge, labeled 1, ..., m, leading to OTSi\_AP[1] and OTSi\_AP[m]. Below the diagram is the text G.798(17)-Amd.4(22)\_F16-7. - -**Figure 16-7 – OTSiG/OTUk\_A\_So function** - -##### Interfaces - -**Table 16-7 – OTSiG/OTUk\_A\_So inputs and outputs** - -| Input(s) | Output(s) | -|-------------------------------------------------------------------------|------------------------------------| -| OTUk_CP:
OTUk_CI_CK
OTUk_CI_D
OTUk_CI_FS
OTUk_CI_MFS | per OTSi_AP:
OTSi_AI_PLD | - -## Processes - -The processes associated with the OTSiG/OTUk\_A\_So function are as depicted in Figure 16-8. - -The processes associated with the OTSiG/OTUk\_A\_So function are specific processes for each OTSi lane signal of the OTSiG, and common processes for the compound signal as depicted in Figure 16-8. - -### Common processes - -**FAS/MFAS insertion:** The function shall insert the FAS and MFAS into the OTUk OH area as described in [ITU-T G.709]. - -**FEC encoder:** See clause 8.5.2 for the OTSiG/OTUk-a\_A\_So function, clause 8.5.1 for the OTSiG/OTU3-b\_A\_So function and clause 8.5.4 for the OTSiG/OTU4-SC\_A\_So. - -**Scrambler:** The function shall scramble the signal as defined in clause 11.2 of [ITU-T G.709]. - -**LLM insertion:** The function shall insert the logical lane marker (LLM) as defined in Annex C of [ITU-T G.709] for OTU4. The LLM replaces the 3rd OA2 byte position of the OTU4 FAS signal. In the case that no OTU4 frame is present (no FS indication), no LLM shall be inserted. - -NOTE 2 – No LLM insertion for OTU3 is required as this function is performed by the MFAS LSB positions of the OTU3 frame. - -**16-byte block distributor and rotator:** The function shall distribute each 16-byte block of the OTU3/OTU4 signal in round-robin way to the related lane structure ( $y = 20$ logical lanes for OTU4 and $y = 4$ lanes for OTU3), as defined in Annex C of [ITU-T G.709]. The distribution is aligned to the OTUk frame and for OTU3 to the LSB positions of the multiframe. After every 16320th byte the mapping to the lanes shall be rotated forward by one lane, so that the OTUk FAS position will be located in the next lane as specified in Annex C of [ITU-T G.709] (see Figures C.2 and C.3 of [ITU-T G.709]). - -### Lane specific processes - -**5:1 bit interleaver:** The process bit multiplexes groups of five logical lanes of the 20 logical lanes of the OTU4 signal to four physical optical OTSi signals according to Annex C of [ITU-T G.709]. - -![Figure 16-8: OTSiG/OTUk_A_So processes. The diagram shows two flowcharts for k=3 (left) and k=4 (right). Both start with OTUk_CP inputs (CI_D, CI_CK, CI_FS, CI_MFS) entering a 'FAS/MFAS insertion' block. The output (D, CK, FS, MFS) goes to an 'FEC encoder', then a 'Scrambler', and finally a '16-byte block distributor and rotator'. The outputs (1 to 4) are labeled AI_PLD and OTSi_AP[1] to OTSi_AP[4]. The k=4 diagram adds an 'LLM insertion' block between the scrambler and the distributor, and splits the distributor outputs into two '5.1 bit interleaver' blocks before reaching the AI_PLD and OTSi_AP outputs. A reference code G.798(17)_F16-8 is present.](385c524299e3256900f891bc068d62b6_img.jpg) - -Figure 16-8: OTSiG/OTUk\_A\_So processes. The diagram shows two flowcharts for k=3 (left) and k=4 (right). Both start with OTUk\_CP inputs (CI\_D, CI\_CK, CI\_FS, CI\_MFS) entering a 'FAS/MFAS insertion' block. The output (D, CK, FS, MFS) goes to an 'FEC encoder', then a 'Scrambler', and finally a '16-byte block distributor and rotator'. The outputs (1 to 4) are labeled AI\_PLD and OTSi\_AP[1] to OTSi\_AP[4]. The k=4 diagram adds an 'LLM insertion' block between the scrambler and the distributor, and splits the distributor outputs into two '5.1 bit interleaver' blocks before reaching the AI\_PLD and OTSi\_AP outputs. A reference code G.798(17)\_F16-8 is present. - -Figure 16-8 – OTSiG/OTUk\_A\_So processes (left: k=3, right: k=4) - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -### 16.3.2 OTSiG to OTUk adaptation sink function (OTSiG/OTUk\_A\_Sk) - -The information flow and processing of the OTSiG/OTUk\_A\_Sk function is defined with reference to Figures 16-9 and 16-10. - -## Symbol - -![Diagram of the OTSiG/OTUk_A_Sk function symbol. A central trapezoidal block is labeled 'OTSiG/OTUk'. Above it, an arrow points up to 'OTUk_CP'. To the left, an arrow points left to 'OTSiG/OTUk_A_Sk_MP'. Below the block, three arrows point up from 'OTSi_AP[1]', 'OTSi_AP[m]', and 'OTSiG-O_AP'. A dashed oval with arrows labeled 'l' and 'm' is positioned between the input arrows and the block. A reference label 'G.798(17)-Amd.4(22)_F16-9' is at the bottom right.](189062b6daff39a4a33fb150b0aca878_img.jpg) - -Diagram of the OTSiG/OTUk\_A\_Sk function symbol. A central trapezoidal block is labeled 'OTSiG/OTUk'. Above it, an arrow points up to 'OTUk\_CP'. To the left, an arrow points left to 'OTSiG/OTUk\_A\_Sk\_MP'. Below the block, three arrows point up from 'OTSi\_AP[1]', 'OTSi\_AP[m]', and 'OTSiG-O\_AP'. A dashed oval with arrows labeled 'l' and 'm' is positioned between the input arrows and the block. A reference label 'G.798(17)-Amd.4(22)\_F16-9' is at the bottom right. - -Figure 16-9 – OTSiG/OTUk\_A\_Sk function - -## Interfaces - -Table 16-8 – OTSiG/OTUk\_A\_Sk inputs and outputs - -| Input(s) | Output(s) | -|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| per OTSi_AP:
OTSi_AI_PLD
OTSiG-O_AP:
OTSiG-O_AI_TSF-P
OTSiG-O_AI_TSF-O
OTSiG/OTUk_A_Sk_MP:
OTSiG/OTUk_A_Sk_MI_FECEn (Note)
OTSiG/OTUk_A_Sk_MI_1second | OTUk_CP:
OTUk_CI_CK
OTUk_CI_D
OTUk_CI_FS
OTUk_CI_MFS
OTUk_CI_SSF
OTSiG/OTUk_A_Sk_MP:
OTSiG/OTUk_A_Sk_MI_cLOS-P
OTSiG/OTUk_A_Sk_MI_cLOL
OTSiG/OTUk_A_Sk_MI_cLOF
OTSiG/OTUk_A_Sk_MI_cLOM
OTSiG/OTUk_A_Sk_MI_pFECcorrErr | -| NOTE – This input does not exist for OTU4. | | - -## Processes - -The processes associated with the OTSiG/OTUk\_A\_Sk function are as depicted in Figures 16-10 and 16-11. - -### Frame alignment: - -- For OTSiG/OTUk-a\_A\_Sk and OTSiG/OTUk-b\_A\_Sk, this optional process shall recover the OTUk frame start as described in clause 8.2.1. -- For OTSiG/OTU4-SC\_A\_Sk, this optional process shall recover the OTU4 frame start. The detailed processing is for further study. - -### Pre-FEC Multiframe alignment: - -- For OTSiG/OTUk-a\_A\_Sk and OTSiG/OTUk-b\_A\_Sk, the process shall transparently pass the scrambled data at its input to the output. -- For OTSiG/OTU4-SC\_A\_Sk, the process shall recover the pre-FEC multiframe start. The detailed processing is for further study. - -**Descrambler:** The process shall perform descrambling as defined in clause 11.2 of [ITU-T G.709]. - -**FEC decoder:** See clause 8.5.2 for the OTSiG/OTUk-a\_A\_Sk function, clause 8.5.1 for the OTSiG/OTU3-b\_A\_Sk function and clause 8.5.4 for the OTSiG/OTU4-SC\_A\_Sk. - -**Multiframe alignment:** The function shall recover the OTUk multiframe start as described in clause 8.2.2. - -### Specific processes - -**Clock recovery:** The process shall recover the clock of the OTL physical lane signals from the incoming data. The function shall introduce no errors in case of jitter and wander, as defined in [ITU-T G.8251]. - -**1/5 Bit dis-interleaver (OTU4):** The process shall bit de-multiplex the bitstream of the OTL physical lane into five logical lanes as defined in Annex C of [ITU-T G.709]. - -#### Lane frame alignment: - -- For OTSiG/OTUk-a\_A\_Sk and OTSiG/OTUk-b\_A\_Sk, the process shall recover the logical lane frame start, as described in clause 8.2.5. -- For OTSiG/OTU4-SC\_A\_Sk, the process shall recover the logical lane frame start. The detailed processing is for further study. - -**Lane alignment recovery:** The process shall recover the lane alignment signal of the logical lane, as described in clause 8.2.6. - -**LLM removal (OTU4):** The process shall remove the LLM and re-establish the OTU4-FAS OA2 byte pattern in the 6th byte position of the individual logical lane stream. - -**Lane deskew:** The lane deskew consists of 4 or 20 elastic store processes, and the lane marker and delay process. The process shall establish the delay compensation, compensating the differential delay between the logical lane signals as given in Annex C of [ITU-T G.709] for OTU3 and OTU4. The compensation between the data lanes is achieved by an elastic store per lane, writing the lane data under the control of the marker processing at the correct time into the 16-byte data block multiplexer. Each elastic store shall be capable of compensating at least 180 ns of absolute differential delay between the lanes in line with [IEEE 802.3]. - -NOTE – [IEEE 802.3] considers the differential delay to be split into a static and variable part where the variable part of the differential delay may be up to 4 ns of variation. - -**OTU clock generator:** The process shall generate the OTUk clock from the incoming lane clock. - -**16-byte block mux:** The process shall interleave the 4 or 20 logical lane signals in 16-byte increments to restore the original OTUk, as given in Annex C of [ITU-T G.709], Figures C.2 and C.3. The OTUk frame start shall be recovered from the 4 or 20 lane frame start signals. - -![Block diagram of OTSiG/OTUk_A_Sk processes (k = 3). The diagram shows the signal flow from 4 physical lanes at the bottom to a single OTU3_CP output at the top. Each physical lane contains a Clock recovery and LOS detection block. These connect to 4 logical lanes, each containing a Lane frame alignment, Lane alignment recovery, and Elastic store (with RD and WR pointers). A central Lane marker and delay processing block connects the logical lanes and provides a dLOL signal. The signals then pass through a 16-byte block Mux (with Lane rotation and muxing control). Above the mux is an Optional section with Frame alignment and dLOF detection, followed by a Descrambler, FEC decoder, and Multiframe alignment block. This block outputs CI_D, CI_CK, CI_FS, and CI_MFS signals. Various detection signals (dLOM, dLOF, dLOL, dLOFLANE[1..4], dLOS-P[1..4]) are fed into Consequent actions (producing aSSF) and Defect correlation (producing MI_cLOM, MI_cLOF, MI_cLOL, MI_cLOS) blocks. Performance monitoring blocks receive nFECcorrErr and MI_FECEn signals and output MI_1second and MI_pFECcorrErr. The entire process is labeled OTSiG/OTU3_A_Sk_MP on the right. Inputs at the bottom are OTSi_AP[1] and OTSi_AP[4].](ffd430265e73d833a0aa30a5dd8261e3_img.jpg) - -The diagram illustrates the OTSiG/OTUk\_A\_Sk processes for k=3. It shows the aggregation of 4 physical lanes into a single OTU3\_CP output. - -- Physical Lanes (Bottom):** Four physical lanes (Lane #1 to Lane #4) are shown. Each lane contains a **Clock recovery** and **LOS detection** block. The inputs are OTSi\_AP[1] and OTSi\_AP[4]. The outputs are dLOS[1] and dLOS[4]. -- Logical Lanes:** Each physical lane connects to a logical lane. Each logical lane contains a **Lane frame alignment**, **Lane alignment recovery**, and an **Elastic store** (with RD and WR pointers). The outputs are dLOFLANE[1] and dLOFLANE[4]. -- Central Processing:** A **Lane marker and delay processing** block connects all logical lanes and provides a dLOL signal. A **16-byte block Mux** (with **Lane rotation and muxing control**) aggregates the signals from the logical lanes. -- Optional Section:** Above the mux is an **Optional** section containing **Frame alignment** and **dLOF detection**, which outputs a dLOF signal. -- Descrambler and FEC:** The signal then passes through a **Descrambler**, **FEC decoder**, and **Multiframe alignment** block. The **Multiframe alignment** block outputs CI\_D, CI\_CK, CI\_FS, and CI\_MFS signals. -- Defect Detection and Monitoring:** - - dLOM detection** receives signals from the **Multiframe alignment** block and outputs a dLOM signal. - - Consequent actions** block receives dLOM, dLOF, dLOL, dLOFLANE[1..4], and dLOS-P[1..4] signals and outputs aSSF. - - Defect correlation** block receives dLOM, dLOF, dLOL, dLOFLANE[1..4], and dLOS-P[1..4] signals and outputs MI\_cLOM, MI\_cLOF, MI\_cLOL, and MI\_cLOS signals. - - Performance monitoring** block receives nFECcorrErr and MI\_FECEn signals and outputs MI\_1second and MI\_pFECcorrErr signals. -- Labels:** The entire process is labeled **OTSiG/OTU3\_A\_Sk\_MP** on the right side. The top output is labeled **OTU3\_CP**. - -Block diagram of OTSiG/OTUk\_A\_Sk processes (k = 3). The diagram shows the signal flow from 4 physical lanes at the bottom to a single OTU3\_CP output at the top. Each physical lane contains a Clock recovery and LOS detection block. These connect to 4 logical lanes, each containing a Lane frame alignment, Lane alignment recovery, and Elastic store (with RD and WR pointers). A central Lane marker and delay processing block connects the logical lanes and provides a dLOL signal. The signals then pass through a 16-byte block Mux (with Lane rotation and muxing control). Above the mux is an Optional section with Frame alignment and dLOF detection, followed by a Descrambler, FEC decoder, and Multiframe alignment block. This block outputs CI\_D, CI\_CK, CI\_FS, and CI\_MFS signals. Various detection signals (dLOM, dLOF, dLOL, dLOFLANE[1..4], dLOS-P[1..4]) are fed into Consequent actions (producing aSSF) and Defect correlation (producing MI\_cLOM, MI\_cLOF, MI\_cLOL, MI\_cLOS) blocks. Performance monitoring blocks receive nFECcorrErr and MI\_FECEn signals and output MI\_1second and MI\_pFECcorrErr. The entire process is labeled OTSiG/OTU3\_A\_Sk\_MP on the right. Inputs at the bottom are OTSi\_AP[1] and OTSi\_AP[4]. - -G.798(17)-Cor.2(21)\_F16-10 - -Figure 16-10 – OTSiG/OTUk\_A\_Sk processes (k = 3) - -![Block diagram of OTSiG/OTU4_A_Sk_MP processes (k=4).](d081abfd06a4b868f797e5669c6dff78_img.jpg) - -The diagram illustrates the OTSiG/OTU4\_A\_Sk\_MP processes (k=4). The signal flow starts at the bottom with physical lanes and moves upwards to the OTU4\_CP interface. - -- Physical Layer:** At the bottom, there are 4 physical lanes (represented by OTSi\_AP[1] to OTSi\_AP[4]). Each physical lane contains a **Clock recovery** block and a **LOS detection** block (outputting dLOS-P[1..4]). These feed into **1:5 bit dis-interleaver** blocks, which expand the 4 physical lanes into 20 logical lanes. -- Logical Lanes:** There are 20 logical lanes (Lane #1 to Lane #20). Each logical lane consists of: - - Lane frame alignment** (outputting dLOFLANE[1..20]) - - Lane alignment recovery** - - LLM removal** - - Elastic store** (with RD and WR clock domains) - A central **Lane marker and delay processing** block coordinates across all 20 logical lanes and outputs a **dLOL** (Loss of Lane Alignment) signal. -- Multiplexing and Alignment:** The 20 logical lanes are combined by a **16-byte block Mux**. This is followed by an **Optional Frame alignment** block and **dLOF detection** (outputting dLOF). -- Processing Chain:** The signal then passes through: - - Descrambler** - - Pre-FEC Multiframe alignment** - - FEC decoder** (outputting nFECcorrErr) - - Multiframe alignment** (outputting dLOM detection and dLOM) -- Outputs and Monitoring:** The final data output is **OTU4\_CP** (with signals CI\_D, CI\_CK, CI\_FS, CI\_MFS). - - Performance monitoring** block outputs MI\_1second and MI\_pFECcorrErr. - - Defect correlation** block outputs MI\_cLOM, MI\_cLOF, MI\_cLOL, and MI\_cLOS. - - Consequent actions** block receives various defect signals (dLOM, dLOF, dLOL, dLOFLANE, dLOS-P) and outputs **aSSF** and **CI\_SSF**. -- Control:** A **Lane rotation and mixing control** block (labeled 'A') interfaces with the Mux and Lane marker processing. - -Block diagram of OTSiG/OTU4\_A\_Sk\_MP processes (k=4). - -G.798(17)-Cor.2(21)\_F16-11 - -OTSiG/OTU4-a\_A\_Sk\_MP - -Figure 16-11 – OTSiG/OTUk\_A\_Sk processes (k = 4) - -## Defects - -The function shall detect dLOS-P[1...4], dLOFLANE[1...y], dLOL, dLOF and dLOM. - -For OTU3, y = 4; for OTU4, y = 20. - -For each physical lane #i with i = 1..4: - -**dLOS-P[i]**: See clause 6.2.1.2. - -For each logical lane #i with i = 1..y: - -**dLOFLANE[i]**: See clause 6.2.5.6. - -**dLOL**: See clause 6.2.5.5. - -**dLOF**: If the optional frame alignment process is present, see clause 6.2.5.1, otherwise - -$$\text{dLOF} \leftarrow \sum \text{dLOFLANE}[i]$$ - -**dLOM**: See clause 6.2.5.2. - -## Consequent actions - -$$\text{aSSF} \leftarrow \text{dLOF or dLOM or } \sum \text{dLOS-P}[i] \text{ or dLOL or } \sum \text{dLOFLANE}[i]$$ - -## Defect correlations - -$$\text{cLOS} \leftarrow \sum \text{dLOS-P}[i]$$ -$$\text{cLOL} \leftarrow (\text{dLOL or } \sum \text{dLOFLANE}[i]) \text{ and (not } \sum \text{dLOS-P}[i])$$ -$$\text{cLOF} \leftarrow \text{dLOF and (not } \sum \text{dLOS-P}[i])$$ -$$\text{cLOM} \leftarrow \text{dLOM and (not dLOF) and (not } \sum \text{dLOS-P}[i])$$ - -## Performance monitoring - -The OTSiG/OTUk-a\_A\_Sk function shall perform the following performance monitoring primitives processing. The performance monitoring primitives shall be reported to the equipment management function (EMF). - -$$\text{pFECorrErr} \leftarrow \sum \text{nFECorrErr}$$ - -NOTE 2 – During AI\_TSF-P, dAIS, dLOF and dLOM, no corrected bits shall be counted. - -## 16.4 OTSiG to OTUkV adaptation function (OTSiG/OTUkV\_A) - -The OTSiG to OTUkV adaptation functions perform the adaptation between the OTSiG layer adapted information and the characteristic information of functionally standardized OTUkV layer signal. - -### 16.4.1 OTSiG to OTUkV adaptation source function (OTSiG/OTUkV\_A\_So) - -The information flow and processing of the OTSiG/OTUkV\_A\_So function is defined with reference to Figure 16-12. - -## Symbol - -![Diagram of the OTSiG/OTUkV_A_So function symbol. An input OTUkV_CP enters a trapezoidal block labeled OTSiG/OTUkV. Inside the block, a dashed oval with arrows at both ends is labeled '1' on the left and 'm' on the right. Below the block, two output arrows are shown, labeled OTSi_AP[1] and OTSi_AP[m]. Below the diagram is the text G.798(17)-Amd.4(22)_F16-12.](34f4f0a61ba9563367acac205416e28c_img.jpg) - -Diagram of the OTSiG/OTUkV\_A\_So function symbol. An input OTUkV\_CP enters a trapezoidal block labeled OTSiG/OTUkV. Inside the block, a dashed oval with arrows at both ends is labeled '1' on the left and 'm' on the right. Below the block, two output arrows are shown, labeled OTSi\_AP[1] and OTSi\_AP[m]. Below the diagram is the text G.798(17)-Amd.4(22)\_F16-12. - -Figure 16-12 – OTSiG/OTUkV\_A\_So function - -## Interfaces - -Table 16-9 – OTSiG/OTUkV\_A\_So inputs and outputs - -| Input(s) | Output(s) | -|-------------------------------------------------------------------------------------|-------------------------------------------| -| OTUkV_CP:
OTUkV_CI_CK
OTUkV_CI_D
OTUkV_CI_FS
OTUkV_VI_MFS (Note) | For each OTSiG_AP:
OTSiG_AI_PLD | -| NOTE – If OTUkV has a multiframe | | - -## Processes - -The OTSiG/OTUkV\_A\_So function provides all processes necessary for the adaptation to the OTSiG layer, which includes processes that ensure clock and frame recovery at the adaptation sink and optional forward error correction coding. - -The specific processes are outside the scope of this Recommendation. - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -### 16.4.2 OTSiG to OTUkV adaptation sink function (OTSiG/OTUkV\_A\_Sk) - -The information flow and processing of the OTSiG/OTUkV\_A\_Sk function is defined with reference to Figure 16-13. - -## Symbol - -![Diagram of the OTSiG/OTUkV_A_Sk function symbol. The symbol is a trapezoid labeled 'OTSiG/OTUkV'. It has multiple input arrows from the bottom: 'OTSi_AP[1]', 'OTSi_AP[m]', and 'OTSiG-O_AP'. A dashed oval with arrows labeled '1' and 'm' is positioned between the bottom inputs and the trapezoid, with the label 'OTSiG' to its left. An output arrow points from the top of the trapezoid to 'OTUkV_CP'. Another output arrow points from the left side of the trapezoid to 'OTSiG/OTUkV_A_Sk_MP'. A small note 'G.798(17)-Amd.4(22)_F16-13' is at the bottom right.](eaa8ee2530516c47ef4dcc8a5db20fd0_img.jpg) - -Diagram of the OTSiG/OTUkV\_A\_Sk function symbol. The symbol is a trapezoid labeled 'OTSiG/OTUkV'. It has multiple input arrows from the bottom: 'OTSi\_AP[1]', 'OTSi\_AP[m]', and 'OTSiG-O\_AP'. A dashed oval with arrows labeled '1' and 'm' is positioned between the bottom inputs and the trapezoid, with the label 'OTSiG' to its left. An output arrow points from the top of the trapezoid to 'OTUkV\_CP'. Another output arrow points from the left side of the trapezoid to 'OTSiG/OTUkV\_A\_Sk\_MP'. A small note 'G.798(17)-Amd.4(22)\_F16-13' is at the bottom right. - -Figure 16-13 – OTSiG/OTUkV\_A\_Sk function - -## Interfaces - -Table 16-10 – OTSiG/OTUkV\_A\_Sk inputs and outputs - -| Input(s) | Output(s) | -|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| For each OTSi_AP:
OTSi_AI_PLD
OTSiG-O_AP:
OTSiG-O_AI_TSF-P
OTSiG-O_AI_TSF-O
OTSiG/OTUkV_A_Sk_MP:
OTSiG/OTUkV_A_Sk_MI_1second (Note 2) | OTUkV_CP:
OTUkV_CI_CK
OTUkV_CI_D
OTUkV_CI_FS
OTUkV_CI_MFS (Note 1)
OTUkV_CI_SSF
OTSiG/OTUkV_A_Sk_MP:
OTSiG/OTUkV_A_Sk_MI_cLOS-P
OTSiG/OTUkV_A_Sk_MI_cLOF
OTSiG/OTUkV_A_Sk_MI_cLOM (Note 1)
OTSiG/OTUkV_A_Sk_MI_pFECcorrErr (Note 2) | -| NOTE 1 – If OTUkV has a multiframe. | | -| NOTE 2 – If the function performs FEC. | | - -## Processes - -The OTSiG/OTUkV\_A\_Sk function provides all processes necessary for the adaptation from the OTSiG layer, which includes processes for clock and frame start recovery and optional forward error correction decoding. - -The specific processes are outside the scope of this Recommendation. - -## Defects - -The function shall detect dAIS and dLOF. If the OTUkV includes a multiframe, it shall in addition detect dLOM. - -**dLOS-P:** See clause 6.2.1.2. - -**dAIS:** See clause 6.2.6.3.1. - -**dLOF:** The dLOF detection depends on the specific frame structure and is outside the scope of this Recommendation. - -**dLOM:** The dLOM detection is only required if the OTUkV has a multiframe, the detection depends on the specific multiframe structure and is outside the scope of this Recommendation. - -**Consequent actions:** - -aSSF $\leftarrow$ dLOS-P or dAIS or dLOF or AI\_TSF-P or dLOM - -NOTE 1 – dLOM is only included if the OTUkV has a multiframe. - -**Defect correlations** - -cLOS-P $\leftarrow$ dLOS-P and (not AI\_TSF-P) - -cLOF $\leftarrow$ dLOF and (not dLOS-P) and (not dAIS) and (not AI\_TSF-P) - -cLOM $\leftarrow$ dLOM and (not dLOS-P) and (not dLOF) and (not dAIS) and (not AI\_TSF-P) - -NOTE 2 – cLOM is only defined if the OTUkV has a multiframe. - -NOTE 3 – dAIS is not reported as fault cause as it is a secondary alarm and will result in aSSF, which is reported as cSSF fault cause in the ODU\_TT\_Sk that directly follows this function. - -**Performance monitoring** - -The function shall perform the following performance monitoring primitives processing if it includes FEC processing. The performance monitoring primitives shall be reported to the EMF. - -pFECcorrErr $\leftarrow \sum$ nFECcorrErr - -NOTE 4 – During AI\_TSF-P, dAIS, dLOF and dLOM no corrected bits shall be counted. - -**16.5 OTSi to OTUCn adaptation function (OTSi/OTUCn\_A)** - -The OTSi to OTUCn adaptation functions perform the adaptation between the OTSi layer adapted information and the characteristic information of the completely standardized OTUCn layer signal. - -**16.5.1 OTSi to OTUCn adaptation source function (OTSi/OTUCn\_A\_So)** - -The information flow and processing of the OTSi/OTUCn\_A\_So function is defined with reference to Figure 16-14. - -**Symbol** - -![Diagram of the OTSi/OTUCn_A_So function symbol. It shows an input OTUCn_CP entering a trapezoidal block labeled OTSi/OTUCn, with an output OTSi_AP exiting the block. Below the diagram is the text G.798(17)_F16-14.](e09924f32278bb6a47909ae24bbea647_img.jpg) - -G.798(17)\_F16-14 - -Diagram of the OTSi/OTUCn\_A\_So function symbol. It shows an input OTUCn\_CP entering a trapezoidal block labeled OTSi/OTUCn, with an output OTSi\_AP exiting the block. Below the diagram is the text G.798(17)\_F16-14. - -**Figure 16-14 – OTSi/OTUCn\_A\_So function** - -**Interfaces** - -**Table 16-11 – OTSi/OTUCn\_A\_So inputs and outputs** - -| Input(s) | Output(s) | -|------------------------------------------------------------------------------|--------------------------------| -| OTUCn_CP:
OTUCn_CI_CK
OTUCn_CI_D
OTUCn_CI_FS
OTUCn_CI_MFS | OTSi_AP:
OTSi_AI_PLD | - -## Processes - -The OTSi/OTUCn\_A\_So function provides all processes necessary for the adaptation to the OTSi layer, which includes processes that ensure clock and frame recovery at the adaptation sink and optional forward error correction coding. - -The specific processes are outside the scope of this Recommendation. - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -### 16.5.2 OTSi to OTUCn adaptation sink function (OTSi/OTUCn\_A\_Sk) - -The information flow and processing of the OTSi/OTUCn\_A\_Sk function is defined with reference to Figure 16-15. - -#### Symbol - -![Diagram of the OTSi/OTUCn_A_Sk function. A central trapezoidal block labeled 'OTSi/OTUCn' has two input arrows from below labeled 'OTSi_AP' and 'OTSiG-O_AP'. It has one output arrow pointing upwards labeled 'OTUCn_CP'. It also has a bidirectional horizontal arrow on the left labeled 'OTSiG/OTUCn_A_Sk_MP'. Below the diagram is the text 'G.798(17)-Amd.4(22)_F16-15'.](f01f6190861749ff3bb7749fd05d4a18_img.jpg) - -Diagram of the OTSi/OTUCn\_A\_Sk function. A central trapezoidal block labeled 'OTSi/OTUCn' has two input arrows from below labeled 'OTSi\_AP' and 'OTSiG-O\_AP'. It has one output arrow pointing upwards labeled 'OTUCn\_CP'. It also has a bidirectional horizontal arrow on the left labeled 'OTSiG/OTUCn\_A\_Sk\_MP'. Below the diagram is the text 'G.798(17)-Amd.4(22)\_F16-15'. - -**Figure 16-15 – OTSi/OTUCn\_A\_Sk function** - -#### Interfaces - -**Table 16-12 – OTSi/OTUCn\_A\_Sk inputs and outputs** - -| Input(s) | Output(s) | -|------------------------------------------------------------------------------------------------------------------------------------------------------|----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| OTSi_AP:
OTSi_AI_PLD
OTSiG-O_AP:
OTSiA_AI_TSF-O
OTSiA_AI_TSF-P
OTSi/OTUCn_A_Sk_MP:
OTSi/OTUCn_A_Sk_MI_1second | OTUCn_CP:
OTUCn_CI_CK
OTUCn_CI_D
OTUCn_CI_FS
OTUCn_CI_MFS
OTUCn_CI_SSF
OTSi/OTUCn_A_Sk_MP:
OTSi/OTUCn_A_Sk_MI_cLOS-P
OTSi/OTUCn_A_Sk_MI_cLOL
OTSi/OTUCn_A_Sk_MI_cLOF
OTSi/OTUCn_A_Sk_MI_cLOM
OTSi/OTUCn_A_Sk_MI_pFECcorrErr | - -## Processes - -The OTSi/OTUCn\_A\_Sk function provides all processes necessary for the adaptation from the OTSi layer, which includes processes for clock and frame start recovery and optional forward error correction decoding. - -The specific processes are outside the scope of this Recommendation. - -## Defects - -The function shall detect dLOS-P[1..m], dLOF and dLOM. - -**dLOS-P[i]:** See clause 6.2.1.2. - -**dLOF:** See clause 6.2.5.1. - -**dLOM:** See clause 6.2.5.2. - -## Consequent actions: - -$a\text{SSF} \leftarrow \sum d\text{LOS-P}[i] \text{ or } d\text{LOF} \text{ or } \text{AI\_TSF-P} \text{ or } d\text{LOM}$ - -## Defect correlations - -$c\text{LOS-P} \leftarrow \sum d\text{LOS-P}[i] \text{ and (not AI\_TSF-P)}$ - -$c\text{LOF} \leftarrow d\text{LOF} \text{ and (not } \sum d\text{LOS-P}[i] \text{) and (not AI\_TSF-P)}$ - -$c\text{LOM} \leftarrow d\text{LOM} \text{ and (not } \sum d\text{LOS-P}[i] \text{) and (not } d\text{LOF) and (not AI\_TSF-P)}$ - -## Performance monitoring - -The function shall perform the following performance monitoring primitives processing if it includes FEC processing. The performance monitoring primitives shall be reported to the EMF. - -$p\text{FECcorrErr} \leftarrow \sum n\text{FECcorrErr}$ - -NOTE – During AI\_TSF-P, dLOF and dLOM no corrected bits shall be counted. - -## 16.6 OTSiG to OTUCn adaptation function (OTSiG/OTUCn\_A) - -The OTSiG to OTUCn adaptation functions perform the adaptation between the OTSiG layer adapted information and the characteristic information of the completely standardized OTUCn layer signal. - -### 16.6.1 OTSiG to OTUCn adaptation source function (OTSiG/OTUCn\_A\_So) - -The information flow and processing of the OTSiG/OTUCn\_A\_So function is defined with reference to Figure 16-16. - -#### Symbol - -![Diagram of the OTSiG/OTUCn_A_So function symbol. An input labeled OTUCn_CP enters a trapezoidal block labeled OTSiG/OTUCn. Inside the block, a dashed oval contains two vertical arrows pointing downwards, labeled 1 and m respectively. The output consists of two parallel lines labeled OTSi_AP[1] and OTSi_AP[m]. Below the diagram is the text G.798(17)-Amd.4(22)_F16-16.](9a53cf0c36d7542a25d60835be986e5a_img.jpg) - -G.798(17)-Amd.4(22)\_F16-16 - -Diagram of the OTSiG/OTUCn\_A\_So function symbol. An input labeled OTUCn\_CP enters a trapezoidal block labeled OTSiG/OTUCn. Inside the block, a dashed oval contains two vertical arrows pointing downwards, labeled 1 and m respectively. The output consists of two parallel lines labeled OTSi\_AP[1] and OTSi\_AP[m]. Below the diagram is the text G.798(17)-Amd.4(22)\_F16-16. - -**Figure 16-16 – OTSiG/OTUCn\_A\_So function** - -## Interfaces - -**Table 16-13 – OTSiG/OTUCn\_A\_So inputs and outputs** - -| Input(s) | Output(s) | -|------------------------------------------------------------------------------|-----------------------------------------| -| OTUCn_CP:
OTUCn_CI_CK
OTUCn_CI_D
OTUCn_CI_FS
OTUCn_CI_MFS | For each OTSi_AP:
OTSi_AI_PLD | - -## Processes - -The OTSiG/OTUCn\_A\_So function provides all processes necessary for the adaptation to the OTSiA layer, which includes processes that ensure clock and frame recovery at the adaptation sink and optional forward error correction coding. - -The specific processes are outside the scope of this Recommendation. - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -### 16.6.2 OTSiG to OTUCn adaptation sink function (OTSiG/OTUCn\_A\_Sk) - -The information flow and processing of the OTSiG/OTUCn\_A\_Sk function is defined with reference to Figure 16-17. - -#### Symbol - -![Diagram of the OTSiG/OTUCn_A_Sk function. A central trapezoidal block is labeled 'OTSiG/OTUCn'. To its left, an arrow labeled 'OTSiG/OTUCn_A_Sk_MP' points into the block. Above the block, an arrow labeled 'OTUCn_CP' points out. Below the block, three arrows point into it: 'OTSi_AP[1]', 'OTSi_AP[m]', and 'OTSiG-O_AP'. A dashed oval labeled 'OTSiG' encloses the bottom input arrows, with '1' and 'm' indicating multiple inputs.](50d5b503f4b41d7a601c1340dfd6aa74_img.jpg) - -G.798(17)-Amd.4(22)\_F16-17 - -Diagram of the OTSiG/OTUCn\_A\_Sk function. A central trapezoidal block is labeled 'OTSiG/OTUCn'. To its left, an arrow labeled 'OTSiG/OTUCn\_A\_Sk\_MP' points into the block. Above the block, an arrow labeled 'OTUCn\_CP' points out. Below the block, three arrows point into it: 'OTSi\_AP[1]', 'OTSi\_AP[m]', and 'OTSiG-O\_AP'. A dashed oval labeled 'OTSiG' encloses the bottom input arrows, with '1' and 'm' indicating multiple inputs. - -**Figure 16-17 – OTSiG/OTUCn\_A\_Sk function** - -## Interfaces - -**Table 16-14 – OTSiG/OTUCn\_A\_Sk inputs and outputs** - -| Input(s) | Output(s) | -|-----------------------------------------------------------------------------------------------------------------------------------------------------------------|----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| For each OTSi_AP:
OTSi_AI_PLD
OTSiG-O_AP:
OTSiA_AI_TSF-O
OTSiA_AI_TSF-P
OTSiG/OTUCn_A_Sk_MP:
OTSiG/OTUCn_A_Sk_MI_1second | OTUCn_CP:
OTUCn_CI_CK
OTUCn_CI_D
OTUCn_CI_FS
OTUCn_CI_MFS
OTUCn_CI_SSF
OTSiG/OTUCn_A_Sk_MP:
OTSiG/OTUCn_A_Sk_MI_cLOS-P
OTSiG/OTUCn_A_Sk_MI_cLOL
OTSiG/OTUCn_A_Sk_MI_cLOF
OTSiG/OTUCn_A_Sk_MI_cLOM
OTSiG/OTUCn_A_Sk_MI_pFECcorrErr | - -## Processes - -The OTSiG/OTUCn\_A\_Sk function provides all processes necessary for the adaptation from the OTSiG layer, which includes processes for clock and frame start recovery and optional forward error correction decoding. - -The specific processes are outside the scope of this Recommendation. - -## Defects - -The function shall detect dLOS-P[1..m], dLOF and dLOM. - -**dLOS-P[i]:** See clause 6.2.1.2. - -**dLOF:** See clause 6.2.5.1. - -**dLOM:** See clause 6.2.5.2. - -## Consequent actions: - -aSSF $\leftarrow \sum$ dLOS-P[i] or dLOF or AI\_TSF-P or dLOM - -## Defect correlations - -cLOS-P $\leftarrow \sum$ dLOS-P[i] and (not AI\_TSF-P) - -cLOF $\leftarrow$ dLOF and (not $\sum$ dLOS-P[i]) and (not AI\_TSF-P) - -cLOM $\leftarrow$ dLOM and (not $\sum$ dLOS-P[i]) and (not dLOF) and (not AI\_TSF-P) - -## Performance monitoring - -The function shall perform the following performance monitoring primitives processing if it includes FEC processing. The performance monitoring primitives shall be reported to the EMF. - -pFECcorrErr $\leftarrow \sum$ nFECcorrErr - -NOTE – During AI\_TSF-P, dLOF and dLOM no corrected bits shall be counted. - -## 16.7 OTSi to FlexO-x adaptation function (OTSi/FlexO-x\_A) - -The OTSi to FlexO-x ( $x = 1, 2, 4$ ) adaptation functions perform the adaptation between the Modulator/Demodulator layer adapted information and the characteristic information of the FlexO-x - -layer signal for the flexible OTN long reach interfaces with different FEC schemes and targeting various modulation schemes. For each FEC scheme, two types of functions are defined: one that supports the standardized FlexOsec encryption and authentication functions (GCM-AES-256) and one that does not support FlexOsec encryption and authentication. - -**Table 16-14.1 – OTSi to FlexO-*x* adaptation functions (*x* = 1, 2, 4)** - -| Function type | Function name | FlexO- x | -|-----------------------------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-----------------------------------------------------| -| M-AI/FlexO-1-SC_A | OTSi to FlexO-1 adaptation function with Staircase FEC code (no DSP frame) with 4 lanes towards the M-AP and without FlexOsec encryption and authentication | x =1 | -| M-AI/FlexO-1-GCM-SC_A | OTSi to FlexO- x adaptation source function with Staircase FEC code (no DSP frame), with 4 lanes towards the M-AP and with GCM-AES-256 FlexOsec encryption and authentication | x =1 | -| M-AI/FlexO- x -DSH-Z_A | OTSi to FlexO- x adaptation function with Staircase plus Hamming concatenated FEC code using the DSH frame format, with Z lanes towards the M-AP and without FlexOsec encryption and authentication | { x , Z }= {1,4}, {2,4}, {2,8}, {4,8} | -| M-AI/FlexO- x -GCM-DSH-Z_A | OTSi to FlexO- x adaptation source function with Staircase plus Hamming concatenated FEC code using the DSH frame format, with Z lanes towards the M-AP and with GCM-AES-256 FlexOsec encryption and authentication | { x , Z }= {1,4}, {2,4}, {2,8}, {4,8} | -| M-AI/FlexO- x -DO-Z_A | OTSi to FlexO- x adaptation function with OFEC code using the DO frame format, with Z lanes towards the M-AP and without FlexOsec encryption and authentication | { x , Z }= {1,4}, {2,4}, {2,8}, {4,8} | -| M-AI/FlexO- x -GCM-DO-Z_A | OTSi to FlexO- x adaptation source function with OFEC code using the DO frame format, with Z lanes towards the M-AP and with GCM-AES-256 FlexOsec encryption and authentication | { x , Z }= {1,4}, {2,4}, {2,8}, {4,8} | - -### 16.7.1 OTSi to FlexO-1-SC adaptation source function (OTSi/FlexO-1-SC\_A\_So and OTSi/FlexO-1-GCM-SC\_A\_So) - -The information flow and processing of the OTSi/FlexO-1-SC\_A\_So and M-AI/FlexO-1-GCM-SC\_A\_So functions is defined with reference to Figures 16-17.1 and 16-17.2. The interfaces of these functions are defined in Table 16-14.1. - -## Symbol - -![Diagram showing two functional symbols. The left symbol is 'M-AI/FlexO-1-SC' with input 'FlexO-1_CP (x = 1, 2, 4)' and output 'OTSi_AP' via 'M-AP[1..4]'. The right symbol is 'M-AI/FlexO-1-GCM-SC' with inputs 'FlexO-1_CP (x = 1, 2, 4)' and 'SK_COMMS_CP', and output 'OTSi_AP' via 'M-AP[1..4]'. It also has an input 'M-AI/FlexO-1-GCM-SC_A_So_SKP'.](18d75b5fb1019ed4bc5384d14f8d1b7a_img.jpg) - -G.798(17)-Amd.4(22)\_F16-17.1 - -Diagram showing two functional symbols. The left symbol is 'M-AI/FlexO-1-SC' with input 'FlexO-1\_CP (x = 1, 2, 4)' and output 'OTSi\_AP' via 'M-AP[1..4]'. The right symbol is 'M-AI/FlexO-1-GCM-SC' with inputs 'FlexO-1\_CP (x = 1, 2, 4)' and 'SK\_COMMS\_CP', and output 'OTSi\_AP' via 'M-AP[1..4]'. It also has an input 'M-AI/FlexO-1-GCM-SC\_A\_So\_SKP'. - -**Figure 16-17.1 – OTSi/FlexO-1-SC\_A\_So and M-AI/FlexO-1-GCM-SC\_A\_So function** - -## Interfaces - -**Table 16-14.1 – OTSi/FlexO-1-SC\_A\_So inputs and outputs** - -| Input(s) | Output(s) | -|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|------------------------------------------------------------------------------| -| FlexO_CP :
FlexO_CI_CK
FlexO_CI_D
FlexO_CI_FS
FlexO_CI_MFS
M-AI/FlexO-1-GCM-SC_A_So_SKP: (Note)
M-AI/FlexO-1-GCM-SC_A_So_SKI_Key[0,1,2,3]
M-AI/FlexO-1-GCM-SC_A_So_SKI_KI
M-AI/FlexO-1-GCM-SC_A_So_SKI_IV_Fixed_ID
SK_COMMS_CP: (Note)
SK_COMMS_CI_D | M-AP:
M-AI_D[1..4]
SK_COMMS_CP: (Note)
SK_COMMS_CI_CK | -| NOTE – For OTSiG/FlexO-1-GCM-SC_A_So only. | | - -## Processes - -The processes associated with the OTSi/FlexO-1-SC\_A\_So and M-AI/FlexO-1-GCM-SC\_A\_So function are as depicted in Figure 16-17.2. - -**MFAS insertion:** The function shall insert the MFAS into the FlexO overhead area as described in [ITU-T G.709.1]. - -### FlexOsec processes: - -- For M-AI/FlexO-1-GCM-SC\_A\_So function, see clause 8.14.1, and clause 8.14.3.1 for the specific FlexOsec GCM-AES-256 encryption and authentication processes with the cipher suite type (CST) code point value 000001, as defined in clause B.1 of [ITU-T G.709.1]. The secure key information (SKI) inputs from the key exchange and agreement functions provide a set of configurable keys and trigger the switch to a new key through SKI\_KI input. -- For M-AI/FlexO-1-SC\_A\_So function, this is a null process connecting its output signals to the corresponding input signals. - -**COMMS clock generation:** For M-AI/FlexO-1-GCM-SC\_A\_So function, the process shall generate SK\_COMMS clock (CK\_COM) by dividing the FlexO clock (CI\_CK) by a factor of 82240. - -**Insert KCC:** The in-band key exchange communication channel (KCC) is optional for M-AI/FlexO-1-GCM-SC\_A\_So function and unused for M-AI/FlexO-1-SC\_A\_So function. When used, the - -incoming SK\_COMMS\_CI\_D data is inserted after FlexOsec authentication and encryption into the KCC field of the FlexO-1 frame (CI\_D) as described in clause 9.3.2.5 of [ITU-T G.709.1]. When it is not used, the all-ZEROS reserved value is inserted into the KCC field. - -**Alignment insertion:** The function shall insert the alignment marker into the FlexO-1 frame AM area as described in clause 9 of [ITU-T G.709.3]. - -**Mapping:** The function shall map (i.e., addition of staircase FEC parity area) the incoming FlexO-1 frame into the FlexO-1-SC frame payload area as defined in clause 11.1 of [ITU-T G.709.3]. - -**Clock generation:** The function shall generate the FlexO-1-SC clock by multiplying the incoming FlexO clock (CI\_CK) by $[5485/5140]$ to the frequency as listed in Table 11-2 of [ITU-T G.709.3]. The FOIC1.4-SC lane clock is obtained by dividing the FlexO-1-SC clock by a factor 4. - -**FBS, FBGS and MBS generation:** The function shall generate the staircase (SC) FEC block start (BS) and group start (FBGS) using the incoming FlexO-1 frame start (FS) to align the Staircase FEC blocks structure with the FlexO-1-SC frame structure as described in clause 11.1 of [ITU-T G.709.3]. An SC FEC block group (FBG) consists of 238 consecutive FlexO-1-SC frame rows that is exactly $5140 \times 238$ bits; it contains five SC FEC blocks. In addition, the function shall generate the SC FEC multi-block sequence start (MBS) every 128 SC FEC blocks, to synchronize the state of the staircase (SC) FEC error decorrelator (ED) as described in clause 11.3.2 of [ITU-T G.709.3]. - -**Generate FBA:** The function shall generate the FEC block alignment (FBA) overhead as described in clause 11.3.1 of [ITU-T G.709.3]. - -**FEC OH insertion:** The function shall insert the FEC block alignment (FBA) overhead into the FEC overhead area within the extended overhead of the FlexO-1-SC frame as described in clause 11.3 of [ITU-T G.709.3]. - -**Generate MBAS:** The function shall generate the 6-bit SC FEC multi block alignment signal (MBAS) to be inserted into the FlexO-1-SC OH area as described in clause 11.3.2 and Annex C of [ITU-T G.709.3]. - -**FEC adapter and encoder:** See clause 8.5.4. - -**Scrambler:** The function shall scramble FlexO-1-SC frame payload, FEC parity, fixed stuffing, extended overhead and basic overhead area as defined in clause 11.5 of [ITU-T G.709.3]. - -**Symbol Distribution:** The function shall divide FlexO-1-SC frame signal into 4 FOIC1.4-SC lanes based on 10-bit symbol granularity as described in clause 11.6 of [ITU-T G.709.3]. - -Note that the 4 FOIC1.4-SC logical lanes carry a dual polarization symbol, so that 2 lanes are to be associated with polarization X, while the other 2 lanes are to be associated with the polarization Y. The mapping of the 4 lanes to the dual polarization symbol is specified in clause 11.6.1 of [ITU-T G.709.3]. - -**PMA process:** The process shall map the FOIC1.4-SC lanes onto the physical media adapted interface. The details are out of scope of this Recommendation. - -![Block diagram of OTSi/FlexO-1-SC_A_So and M-AI/FlexO-1-GCM-SC_A_So processes. The diagram shows the signal flow from FlexO-1_CP and SK_COMMS_CP inputs through various processing stages including MFAS insertion, FlexOsec processes, Alignment insertion, Mapping, FEC OH insertion, FEC adapter and encoder, Scrambler, Symbol distribution, and PMA to M-AP outputs. Control signals like CK_D, CK_CK, CK_FS, CK_MFS, CK_COM, D_COM, CK_SC, and various keys (SKI_Key, SKI_KI, SKI_IV_Fixed_ID) are also shown.](9ef8e686bf7d4fdc4504d136e1b350f0_img.jpg) - -The diagram illustrates the signal processing flow for OTSi/FlexO-1-SC\_A\_So and M-AI/FlexO-1-GCM-SC\_A\_So. At the top, FlexO-1\_CP inputs (CI\_D, CI\_CK, CI\_FS, CI\_MFS) enter the 'MFAS insertion' block. SK\_COMMS\_CP inputs (CI\_CK, CI\_D) enter the 'COMMS clock generation' block. The 'COMMS clock generation' block outputs CK\_COM and D\_COM signals. The 'FlexOsec processes' block receives D, CK, and FS signals from 'MFAS insertion' and control signals (SKI\_Key[0, 1, 2, 3], SKI\_KI, SKI\_IV\_Fixed\_ID) from the right. It also receives CK\_COM and D\_COM from 'COMMS clock generation' and D\_sec from 'Insert KCC'. The 'Insert KCC' block receives CK\_COM and D\_COM from 'COMMS clock generation'. The 'FlexOsec processes' block outputs D, CK, and FS signals to the 'Alignment insertion' block. The 'Alignment insertion' block outputs D, CK, and FS signals to the 'Mapping (to-SC frame)' block. The 'Mapping (to-SC frame)' block receives CK\_SC from 'FlexO-1 SC clock generation (×5485/5140)' and outputs D and FS signals. The 'FEC OH insertion' block receives D and FS signals from 'Mapping (to-SC frame)' and FBA from 'Generate FBA'. It outputs D and FS signals to the 'FEC adapter and encoder' block. The 'Generate FBA' block receives FBGS, MBS, and BS from the 'BS, MBS and FBGS generator' and outputs FBA. The 'FEC adapter and encoder' block receives D and FS signals from 'FEC OH insertion' and MBAS from 'Generate MBAS'. It outputs D and FS signals to the 'Scrambler' block. The 'Generate MBAS' block receives FBGS, MBS, and BS from the 'BS, MBS and FBGS generator' and outputs MBAS. The 'Scrambler' block receives D and FS signals from 'FEC adapter and encoder' and outputs D and FS signals to the 'Symbol distribution' block. The 'Symbol distribution' block outputs FOIC1.4-SC D[1..4] and CK\_SC signals to the 'PMA' block. The 'PMA' block outputs 1, ..., 4 signals to the 'M-AP' block. The 'M-AP' block outputs M-AI\_D[1] ... M-AI\_D[4] signals. The 'BS, MBS and FBGS generator' block receives CK\_SC from 'FlexO-1 SC clock generation (×5485/5140)' and outputs FBGS, MBS, and BS signals to 'Generate FBA' and 'Generate MBAS' blocks. The 'FlexO-1 SC clock generation (×5485/5140)' block receives CK\_COM from 'COMMS clock generation' and outputs CK\_SC signals to 'Mapping (to-SC frame)' and 'BS, MBS and FBGS generator' blocks. The diagram is labeled G.798(23)\_F16-17.2 and M-AI/FlexO-1-(GCM)-SC\_A\_So\_SKP. - -Block diagram of OTSi/FlexO-1-SC\_A\_So and M-AI/FlexO-1-GCM-SC\_A\_So processes. The diagram shows the signal flow from FlexO-1\_CP and SK\_COMMS\_CP inputs through various processing stages including MFAS insertion, FlexOsec processes, Alignment insertion, Mapping, FEC OH insertion, FEC adapter and encoder, Scrambler, Symbol distribution, and PMA to M-AP outputs. Control signals like CK\_D, CK\_CK, CK\_FS, CK\_MFS, CK\_COM, D\_COM, CK\_SC, and various keys (SKI\_Key, SKI\_KI, SKI\_IV\_Fixed\_ID) are also shown. - -Figure 16-17.2 – OTSi/FlexO-1-SC\_A\_So and M-AI/FlexO-1-GCM-SC\_A\_So processes - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -## 16.7.2 OTSi to FlexO-1-SC adaptation sink function (OTSi/FlexO-1-SC\_A\_Sk and M-AI/FlexO-1-GCM-SC\_A\_Sk) - -The information flow and processing of the OTSi/FlexO-1-SC\_A\_Sk and OTSi/FlexO-1-GCM-SC\_A\_Sk functions is defined with reference to Figures 16-17.3 and 16-17.4. The interfaces of these functions are defined in Table 16-14.2. - -### Symbol - -![Figure 16-17.3 shows two block diagrams. The left diagram represents the OTSi/FlexO-1-SC_A_Sk function, showing a block 'M-AI/FlexO-1-SC' with inputs 'M-AP[1..Z]' (from OTSi_AP) and 'M-AI/FlexO-1-SC_Sk_MP' (from M-AI/FlexO-1-SC_Sk_MP), and output 'FlexO-1_CP'. The right diagram represents the M-AI/FlexO-1-GCM-SC_A_Sk function, showing a block 'M-AI/FlexO-1-GCM-SC' with inputs 'M-AP[1..Z]' (from OTSi_AP), 'M-AI/FlexO-1-GCM-SC_Sk_MP' (from M-AI/FlexO-1-GCM-SC_Sk_MP), and 'M-AI/FlexO-1-GCM-SC_A_Sk_SKP' (from M-AI/FlexO-1-GCM-SC_A_Sk_SKP), and outputs 'FlexO-1_CP' and 'SK_COMMS_CP'. A note 'G.798(17)-Amd.4(22)_F16-17.3' is present below the right diagram.](c8262867e39639276066c34941705aed_img.jpg) - -Figure 16-17.3 shows two block diagrams. The left diagram represents the OTSi/FlexO-1-SC\_A\_Sk function, showing a block 'M-AI/FlexO-1-SC' with inputs 'M-AP[1..Z]' (from OTSi\_AP) and 'M-AI/FlexO-1-SC\_Sk\_MP' (from M-AI/FlexO-1-SC\_Sk\_MP), and output 'FlexO-1\_CP'. The right diagram represents the M-AI/FlexO-1-GCM-SC\_A\_Sk function, showing a block 'M-AI/FlexO-1-GCM-SC' with inputs 'M-AP[1..Z]' (from OTSi\_AP), 'M-AI/FlexO-1-GCM-SC\_Sk\_MP' (from M-AI/FlexO-1-GCM-SC\_Sk\_MP), and 'M-AI/FlexO-1-GCM-SC\_A\_Sk\_SKP' (from M-AI/FlexO-1-GCM-SC\_A\_Sk\_SKP), and outputs 'FlexO-1\_CP' and 'SK\_COMMS\_CP'. A note 'G.798(17)-Amd.4(22)\_F16-17.3' is present below the right diagram. - -Figure 16-17.3 – OTSi/FlexO-1-SC\_A\_Sk and M-AI/FlexO-1-GCM-SC\_A\_Sk functions - -### Interfaces - -Table 16-14.2 – OTSi/FlexO-1-SC\_A\_Sk inputs and outputs - -| Input(s) | Output(s) | -|--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| M_AP:
M-AI_D[1..4]
OTSiG-O_AP:
OTSiA_AI_TSF-O
OTSiA_AI_TSF-P
M-AI/FlexO-1-SC_A_Sk_MP:
M-AI/FlexO-1-SC_A_Sk_MI_1second
M-AI/FlexO-1-SC_A_Sk_MI_SquelchEn (Note)
M-AI/FlexO-1-GCM-SC_A_Sk_SKP: (Note)
M-AI/FlexO-1-GCM-SC_A_Sk_SKI_Key[0,1,2,3]
M-AI/FlexO-1-GCM-SC_A_Sk_SKI_IV_Fixed_ID | FlexO-1_CP:
FlexO-1_CI_CK
FlexO-1_CI_D
FlexO-1_CI_FS
FlexO-1_CI_MFS
FlexO-1_CI_SSF
M-AI/FlexO-1-SC_A_Sk_MP:
M-AI/FlexO-1-SC_A_Sk_MI_AcCST (Note)
M-AI/FlexO-1-SC_A_Sk_MI_cLOS-P
M-AI/FlexO-1-SC_A_Sk_MI_cLOL
M-AI/FlexO-1-SC_A_Sk_MI_cLOM
M-AI/FlexO-1-SC_A_Sk_MI_cCSTM (Note)
M-AI/FlexO-1-SC_A_Sk_MI_cUnlockSec (Note)
M-AI/FlexO-1-SC_A_Sk_MI_pFECcorrErr
M-AI/FlexO-1-SC_A_Sk_MI_pAuthCheckErr (Note)
M-AI/FlexO-1-GCM-SC_A_Sk_SKP: (Note)
M-AI/FlexO-1-GCM-SC_A_Sk_SKI_AcKI
SK_COMMS_CP: (Note)
SK_COMMS_CI_D
SK_COMMS_CI_CK | -| NOTE – For OTSiG/FlexO-1-GCM-SC_A_Sk only. | | - -### Processes - -The processes associated with the OTSi/FlexO-1-SC\_A\_Sk and M-AI/FlexO-1-GCM-SC\_A\_Sk function are as depicted in Figure 16-17.4. - -**PMA process:** The process shall recover the data and clock of the FOIC1.4-SC lanes from the physical media adapted interface. The details are out of scope of this Recommendation. - -**FOIC1.4 Frame alignment:** The function shall recover the start of ¼ FlexO-1-SC frame (FOIC1.4-SC) through obtaining LOCK to the alignment markers as specified by the FEC synchronization state diagram in clause 91.5.3.1 of [IEEE 802.3]. The specific alignment marker to be locked shall be CM0 to CM5 (48 bits) per frame as specified in clause 9.1 of [ITU-T G.709.1] while the distance between alignment markers (counted by amp\_counter) shall correspond to 128 rows as specified in clause 11.1 of [ITU-T G.709.3]. Additionally, the synchronization process on all logical lanes shall be restarted (restart\_lock set to true) if five consecutive alignment markers fail to match on any of the logical lanes. - -**Deskew:** The deskewing process shall remove the skew of all four FOIC1.4-SC lanes as specified by the FEC alignment state diagram in clause 91.5.3.1 of [IEEE 802.3]. It shall support a maximum skew of 180 ns between FEC lanes and a maximum skew variation of 4 ns. - -**Recombination:** The function shall multiplex the aligned and ordered four FOIC1.4-SC lanes into the original stream of FEC-1-SC and reconstruct the FlexO-1-SC frame as described in clause 11.6 of [ITU-T G.709.3]. - -**Descrambler:** The function shall perform descrambling for FlexO-1-SC frame payload, fixed stuffing and extended overhead and basic overhead area as described in clause 11.5 of [ITU-T G.709.3]. - -**FEC OH Extraction:** The function shall extract the FEC Block Alignment (FBA) overhead from the FEC overhead area within the extended overhead of the FlexO-1-SC frame as described in clause 11.3 of [ITU-T G.709.3]. - -**FEC Adapter and Decoder:** See clause 8.5.4. - -NOTE – In this process, the Multi Block Alignment Signal (MBAS) overhead is extracted from FlexO-1-SC overhead as described in clause B.2 of [ITU-T G.709.3] and MBAS sequence is aligned to synchronize SC FEC Error Decorrelator (ED). - -**Demapping:** The function shall demap (i.e., removal of staircase SC FEC parity area) the FlexO-1 frame from the incoming FlexO-1-SC frame as defined in clause 11.1 of [ITU-T G.709.3]. - -**Extract and replace KCC:** The in-band key exchange communication channel (KCC) is optional for M-AI/FlexO-1-GCM-SC\_A\_Sk and unused for M-AI/FlexO-1-SC\_A\_Sk. When used, the function shall extract the KCC data (SK\_COMMS\_CI\_D) from the FlexOsec KCC overhead field of the FlexO-1 as described in clause 9.2.8 of [ITU-T G.709.1]. The bit rate of the KCC data is defined by the outgoing KCC clock. The function shall generate the KCC clock (SK\_COMMS\_CI\_CK) by dividing the FlexO-*x* clock by a factor of 82240. After extraction, the KCC byte in the FlexOsec overhead is replaced with value 0x00 at the input of the FlexOsec sink processes. - -#### **FlexOsec processes:** - -- For M-AI/FlexO-1-GCM-SC\_A\_Sk function, see clause 8.14.2 and clause 8.14.3.1 for the specific GCM-AES-256 decryption and authentication processes with the cipher suite type (CST) code point value 000001, as defined in clause B.1 of [ITU-T G.709.1]. The Secure Key Information (SKI) inputs from the key exchange and agreement functions provide a set of configurable keys and trigger the switch to a new key through SKI\_KI input. -- For M-AI/FlexO-1-SC\_A\_Sk function, this is a null process connecting its output signals to the corresponding input signals. - -**Multiframe alignment:** The process shall recover the FlexO multi-frame start as described in clause 8.2.2. - -![Functional block diagram of OTSi/FlexO-1-SC_A_Sk and M-AI/FlexO-1-GCM-SC_A_Sk processes. The diagram shows a vertical flow of data from bottom to top through various processing stages including PMA, FOIC1.4-SC, Alignment lock, Recombination, Descrambler, FBA extract and alignment, FEC adapter and decoder, Demapping, FlexOsec processes, and Multiframe alignment. It also includes side blocks for Consequent actions, Performance monitoring, Defect correlation, and dCSTM detection. Numerous control and monitoring signals (MI, AI, CI, d-series defects) are shown entering and leaving the blocks.](0bce130a8686477232911728d05b4b13_img.jpg) - -The diagram illustrates the internal architecture of OTSi/FlexO-1-SC\_A\_Sk and M-AI/FlexO-1-GCM-SC\_A\_Sk processes. At the bottom, the **PMA** and **FOIC1.4-SC** blocks receive inputs from **AI\_CKLOC**, **AI\_D[1]..AI\_D[4]** (via **M-AP**), and **AI\_TSF-P** (via **OTSiG-O\_AP**). It outputs **dLOL** and **dLOS-P**. Above this is a lane-based **Alignment lock** stage (4 logical lanes) with **Lane marker process**, feeding into **Recombination**, **Descrambler**, **FBA extract and alignment**, **FEC adapter and decoder**, and **Demapping (from SC-Frame)**. Each block has **D** (data), **CK** (clock), and **FS** (frame sync) interfaces. The **Demapping** block feeds into **FlexOsec processes**, which in turn feed into **Multiframe alignment**. **Multiframe alignment** outputs **dLOM** and various control signals (**Dsec**, **CK**, **FS**) to the **FlexO\_CP** interface. **FlexOsec processes** also output **AuthCheckErr**, **dUnlockSec**, **dLOL**, **MI\_SquelchEn**, and **AcCST**. **AcCST** is processed by **dCSTM detection** to produce **dCSTM**. **dCSTM** and other signals (**dLOM**, **dUnlockSec**, **dLOL**, **dLOS-P**, **AI\_TSF-P**) are processed by **Consequent actions** to produce **aSSF**. **Performance monitoring** and **Defect correlation** blocks receive various error and status signals and output management information (MI) signals. A **Replace and extract KCC** block handles **SK\_COMM\_CP** signals. On the right, vertical text labels the processes as **M-AI/FlexO-1-GCM-SC\_A\_Sk\_SKP** and **M-AI/FlexO-1-GCM-SC\_A\_Sk\_MP**. The diagram is labeled **G.798(23)\_F16-17.4** at the bottom right. - -Functional block diagram of OTSi/FlexO-1-SC\_A\_Sk and M-AI/FlexO-1-GCM-SC\_A\_Sk processes. The diagram shows a vertical flow of data from bottom to top through various processing stages including PMA, FOIC1.4-SC, Alignment lock, Recombination, Descrambler, FBA extract and alignment, FEC adapter and decoder, Demapping, FlexOsec processes, and Multiframe alignment. It also includes side blocks for Consequent actions, Performance monitoring, Defect correlation, and dCSTM detection. Numerous control and monitoring signals (MI, AI, CI, d-series defects) are shown entering and leaving the blocks. - -Figure 16-17.4 – OTSi/FlexO-1-SC\_A\_Sk and M-AI/FlexO-1-GCM-SC\_A\_Sk processes - -## Defects - -The function shall detect dLOS-P, dCSTM, dUnlockSec, dLOL and dLOM. - -**dLOS-P:** See clause 6.2.1.2. - -**dLOL:** dLOL is generated for multilane interfaces based on the FEC alignment state diagram in clause 91.5.3.1 of [IEEE 802.3]. dLOL shall be declared if fec\_alignment\_valid is false for 3 ms. To provide for the case of intermittent out-of-locks (fec\_alignment\_valid is false), the integrating timer shall not be reset to zero until an in-lock (fec\_alignment\_valid is true) condition persists continuously for 3 ms. dLOL shall be cleared if fec\_alignment\_valid is true for 3 ms. - -**dCSTM:** See clause 6.2.11. The expected cipher suite type is "0000 0001". Set to false for M-AI/FlexO-1-SC\_Sk function without FlexOsec. - -**dUnlockSec:** See clause 6.2.7.2.1. Set to false for M-AI/FlexO-1-SC\_Sk function without FlexOsec. - -**dLOM:** See clause 6.2.5.2. - -## Consequent actions - -aSSF $\leftarrow$ dLOM or dLOS-P or dUnlockSec or dCSTM or dLOL or AI\_TSF-P - -## Defect correlations - -cLOS-P $\leftarrow$ dLOS-P and (not AI\_TSF-P) - -cLOL $\leftarrow$ dLOL and (not dLOS-P) and (not AI\_TSF-P) - -cCSTM $\leftarrow$ dCSTM and (not dLOL) and (not AI\_TSF-P) - -cUnlockSec $\leftarrow$ UnlockSec and (not dCSTM) and (not dLOL) and (not AI\_TSF-P) - -cLOM $\leftarrow$ dLOM and (not dCSTM) and (not dLOL) and (not AI\_TSF-P) - -## Performance monitoring - -The function shall perform the following performance monitoring primitives processing. The performance monitoring primitives shall be reported to the equipment management function (EMF). - -pFECcorrErr $\leftarrow \sum$ nFECcorrErr - -pAuthcheckErr $\leftarrow \sum$ AuthcheckErr - -NOTE – During AI\_TSF-P, dUnlockSec and dLOL no corrected bits or authentication failure shall be counted. - -### 16.7.3 OTSi to FlexO-x-DSH adaptation source functions (M-AI/FlexO-x-DSH-Z\_A\_So and M-AI/FlexO-x-GCM-DSH-Z\_A\_So) - -The information flow and processing of the M-AI/FlexO-x-DSH-Z\_A\_So and M-AI/FlexO-x-GCM-DSH-Z\_A\_So functions ( $\{x,Z\}=\{1,4\}, \{2,4\}, \{2,8\}, \{4,8\}$ ) is defined with reference to Figures 16-17.5 and 16-17.6. The interfaces of these functions are defined in Table 16-14.3. - -## Symbol - -![Figure 16-17.5: Symbol diagrams for M-AI/FlexO-x-DSH-Z_A_So and M-AI/FlexO-x-GCM-DSH-Z_A_So functions. The left diagram shows FlexO-x_CP (x = 1, 2, 4) as input to M-AI/FlexO-x-DSH-Z, which outputs M-AP[1..Z] and OTSi_AP. The right diagram shows FlexO-x_CP (x = 1, 2, 4) and SK_COMMS_CP as inputs to M-AI/FlexO-x-GCM-DSH-Z, which also outputs M-AP[1..Z] and OTSi_AP. A note G.798(17)-Amd.4(22)_F16-17.5 is present.](4e716e2091c1c947b7a687ed4e6dae2f_img.jpg) - -Figure 16-17.5: Symbol diagrams for M-AI/FlexO-x-DSH-Z\_A\_So and M-AI/FlexO-x-GCM-DSH-Z\_A\_So functions. The left diagram shows FlexO-x\_CP (x = 1, 2, 4) as input to M-AI/FlexO-x-DSH-Z, which outputs M-AP[1..Z] and OTSi\_AP. The right diagram shows FlexO-x\_CP (x = 1, 2, 4) and SK\_COMMS\_CP as inputs to M-AI/FlexO-x-GCM-DSH-Z, which also outputs M-AP[1..Z] and OTSi\_AP. A note G.798(17)-Amd.4(22)\_F16-17.5 is present. - -**Figure 16-17.5 – M-AI/FlexO-x-DSH-Z\_A\_So and M-AI/FlexO-x-GCM-DSH-Z\_A\_So functions ( $\{x,Z\}=\{1,4\}, \{2,4\}, \{2,8\}, \{4,8\}$ )** - -## Interfaces - -**Table 16-14.3 – M-AI/FlexO-x-DSH-Z\_A\_So inputs and outputs** - -| Input(s) | Output(s) | -|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|----------------------------------------------------------------------------------| -| FlexO-x_CP :
FlexO-x_CI_CK
FlexO-x_CI_D[1..x]
FlexO-x_CI_FS
FlexO-x_CI_MFS

M-AI/FlexO-x-GCM-DSH-Z_A_So_SKP: (Note)
M-AI/FlexO-x-GCM-DSH-Z_A_So_SKI_Key[0,1,2,3]
M-AI/FlexO-x-GCM-DSH-Z_A_So_SKI_KI
M-AI/FlexO-x-GCM-DSH-Z_A_So_SKI_IV_Fixed_ID

SK_COMMS_CP: (Note)
SK_COMMS_CI_D | M_AP:
M-AI_D[1..Z]

SK_COMMS_CP: (Note)
SK_COMMS_CI_CK | -| NOTE – For OTSiG/FlexO-x-GCM-DSH-Z_A_So only. | | - -## Processes - -The processes associated with the M-AI/FlexO-x-GCM-DSH-Z\_A\_So function are as depicted in Figure 16-17.6. For the M-AI/FlexO-x-DSH-Z\_A\_So function, Figure 16-17.6 could also be used, except that the FlexOsec process is a null process connecting its output signals to the corresponding input signals. - -**MFAS insertion:** The function shall insert the MFAS into the FlexO basic overhead area in every FlexO instance of the FlexO-x as described in [ITU-T G.709.1]. - -### FlexOsec processes: - -- For M-AI/FlexO-x-GCM-DSH-Z\_A\_So function, see clause 8.14.1 and clause 8.14.3.1 for the specific GCM-AES-256 encryption and authentication processes with the cipher suite type (CST) code point value 000001, as defined in clause B.1 of [ITU-T G.709.1]. The FlexOsec encryption and authentication processes are performed for each individual FlexO instance frame signal in parallel, prior to interleaving into the FlexO-x. The same management information (MI) input from the EMF and Secure Key Information (SKI) input from the key exchange and agreement functions are shared by the $x$ sets of FlexOsec processes. The same key is used by the $x$ sets of FlexOsec source processes which are - -simultaneously triggered by the key exchange and agreement functions (through SKI\_KI input) to switch to a new key. - -- For M-AI/FlexO-*x*-DSH-Z\_A\_So function, this is a null process connecting its output signals to the corresponding input signals. - -**COMMS Clock generation:** For M-AI/FlexO-*x*-GCM-DSH-Z\_A\_So function, the process shall generate SK\_COMMS clock (CK\_COM) by dividing the FlexO clock (CI\_CK) by a factor of 82240. - -**Insert KCC:** The in-band key exchange communication channel (KCC) is optional for M-AI/FlexO-*x*-GCM-DSH-Z\_A\_So function and unused for M-AI/FlexO-*x*-DSH-Z\_A\_So function. When used, the incoming SK\_COMMS\_CI\_D data is inserted after FlexOsec authentication and encryption into the KCC field of the first FlexO instance frame (CI\_D[1]) of the FlexO-*x* as described in clause 9.3.2.5 of [ITU-T G.709.1]. When it is not used, the all-ZEROS reserved value is inserted into the KCC field. - -**Interleaving:** See clause 8.13.1 for the *x* FlexO instance signals interleaving to FlexO-*x*. - -**Alignment insertion:** The function shall insert the alignment marker into the FlexO-*x* frame AM area as described in clause 9.1.1, 9.1.3 or 9.1.5 of [ITU-T G.709.1] for 100G FlexO-1 (*x*=1), 200G FlexO-2 (*x*=2) or 400G FlexO-4 (*x*=4), respectively. - -**Clock generation:** The function shall generate the FlexO-*x*-DSH clock by multiplying the incoming FlexO clock (CI\_CK) by [*x* × 25984/21845] to the frequencies as listed in Table 15-2 of [ITU-T G.709.3] for 100G FlexO-1-DSH (*x*=1), 200G FlexO-2-DSH (*x*=2) or 400G FlexO-4-DSH (*x*=4). The FOIC*x*Z-DSH lane clock is obtained by dividing the FlexO-*x*-DSH clock by a factor *Z*. - -NOTE – The function also generates the intermediate FlexO-*x*-SC clock by multiplying the incoming FlexO clock (CI\_CK) by [*x* × 5485/5140] to the frequencies as listed in Table 11-2, 12-2 or 13-1 of [ITU-T G.709.3] for FlexO-1-SC (*x*=1), FlexO-2-SC (*x*=2) or FlexO-4-SC (*x*=4), respectively. - -**Mapping to -SC frame:** The function shall map (i.e., addition of staircase FEC parity area) the incoming FlexO-*x* frame into the FlexO-*x*-SC frame payload area as defined in clause 11.1, 12.1 or 13-1 of [ITU-T G.709.3] for 100G FlexO-1-SC (*x*=1), 200G FlexO-2-SC (*x*=2) or 400G FlexO-4-SC (*x*=4), respectively. - -**FBS, FBGS and MBS generation:** The function shall generate the staircase (SC) FEC block start (BS) and group start (FBGS) using the incoming FlexO-*x* frame start (FS) to align the Staircase FEC blocks structure with the FlexO-*x*-SC frame structure as described in clause 11.1, 12.1 and 13.1 of [ITU-T G.709.3] for FlexO-1-SC (*x*=1), FlexO-2-SC (*x*=2) or FlexO-4-SC (*x*=4), respectively. An SC FEC block group (FBG) consists of 238 (*x*=1) or 119 (*x*=2 or 4) consecutive FlexO-*x*-SC frame rows that is exactly 10970×119 bits; it contains five SC FEC blocks. In addition, the function shall generate the SC FEC multi-block sequence start every 128 SC FEC blocks, to synchronize the state of the Staircase (SC) FEC Error Decorrelator (ED) as described in clause 11.3.2 (*x*=1), 12.3 (*x*=2), or 13.2 (*x*=4) of [ITU-T G.709.3]. - -**Generate MBAS:** The function shall generate the 6-bit SC FEC multi block alignment signal (MBAS) to be inserted into the FlexO-*x*-SC OH area as described in clause 11.3.2 and Annex C of [ITU-T G.709.3]. - -**Staircase (SC) FEC adapter and encoder:** See clause 8.5.4. - -**Padding:** The function shall add six 119-bit padding blocks (i.e., 714-bit pad) at the end of every FlexO-*x*-SC FBG of 10970×119-bit block as described in clauses 15.4.2 and 15.4.1 of [ITU-T G.709.3]. The extended FBG is a structure consisting in 10976×119-bit blocks. - -**Scrambler:** The function shall scramble the extended FBG as defined in clause 15.4.1 of [ITU-T G.709.3], meaning that all data within the FlexO-*x*-SC frame are scrambled. - -**Convolution Interleaving:** The function shall interleave 119-bit blocks within the extended FBG as defined in clause 15.4.3 of [ITU-T G.709.3]. - -**Hamming FEC mapping and encoder:** See clause 8.5.8. After Hamming FEC mapping and encoding, the extended FBG structure consists of $10976 \times 128$ -bit blocks. - -**DFS, DMFS and DSFS generation:** The function shall generate the FlexO-*x*-DSH frame start (DFS), 49-frame multiframe start (DMFS) and 4-multiframe super-frame start (DSFS) using the incoming extended FEC block group start (FBGS) to synchronize the extended FBG structure after Hamming FEC encoding with the FlexO-*x*-DSH DSP frame structure as described in clause 15.1 of [ITU-T G.709.3]. The FlexO-*x*-DSH frame consists of $(3712 \times Z)$ bits as described in [ITU-T G.709.3] clause 14.1 ( $Z=4$ for $x=1$ or 2; $Z=8$ for $x=2$ or 4). For $Z=8$ a FlexO-*x*-DSH multiframe carries one FBG, while for $Z=4$ a FlexO-*x*-DSH super-frame carries two FBG. - -**Mapping to -DSH frame:** The function shall map the incoming extended FBG signal (carrying the FlexO-*x*-SC signal after padding, scrambling, convolution interleaving and Hamming FEC encoding) into the payload area of the FlexO-*x*-DSH DSP frame signal as defined in clauses 15.4.5.1 ( $Z=8$ for $x=2$ or 4) and 15.4.5.2 ( $Z=4$ for $x=1$ or 2) of [ITU-T G.709.3]. - -**Generate and insert training sequence:** The function shall generate and insert the training sequence into the TS overhead position (11 Z-bit) at the start of the FlexO-*x*-DSH frame as defined in clause 14.2.1 of [ITU-T G.709.3]. - -**Generate and insert pilot sequence:** The function shall generate and insert the pilot sequence into the PS overhead position (Z-bit) at the start of each FlexO-*x*-DSH frame row as defined in clause 14.2.2 of [ITU-T G.709.3]. - -**Generate and insert MFAS:** The function shall generate and insert the DSH 49-frame multiframe alignment signal into the MFAS overhead position (22 Z-bit) in the first FlexO-*x*-DSH frame of each multiframe as defined in clause 15.1.1 of [ITU-T G.709.3]. - -**Generate and insert FS:** The function shall generate and insert the 54 Z-bit fixed stuff into the FS overhead position in the first FlexO-*x*-DSH frame of each 49-frame multiframe as defined in clause 15.3.3 of [ITU-T G.709.3]. - -**Generate and insert SFAS:** The function shall generate and insert the DSH 4-multiframe super-frame alignment signal into the SFAS overhead position (22 Z-bit) in the first FlexO-*x*-DSH frame of each super-frame as defined in clause 15.1.2 of [ITU-T G.709.3]. - -**Lane Distribution:** The function shall divide FlexO-*x*-DSH frame signal into *Z* FOIC*x*-*Z*-DSH logical lanes based on a bit-by-bit distribution as described in clause 15.5.1, 15.5.2, 15.5.3 or 15.5.4 of [ITU-T G.709.3] for FOIC2.4-DSH ( $x=2$ , $Z=4$ ), FOIC2.8-DSH ( $x=2$ , $Z=8$ ), FOIC4.8-DSH ( $x=4$ , $Z=8$ ) or FOIC1.4-DSH ( $x=1$ , $Z=4$ ), respectively. - -Note that the *Z* FOIC*x*-*Z*-DSH logical lanes carry a dual polarization symbol, so that *Z*/2 lanes are to be associated with polarization X, while the other *Z*/2 lanes are to be associated with the polarization Y. The mapping of the *Z* lanes to the dual polarization symbol is specified in clause 15.4.5 of [ITU-T G.709.3]. - -**PMA process:** The process shall map the FOIC*x*-*z*-DSH lanes onto the physical media adapted interface. The details are out of scope of this Recommendation. - -![Block diagram of M-AI/FlexO-x-GCM-DSH-Z_A_So processes showing data flow from inputs through various processing stages to the PMA and OTSi_AP.](9fd6d80e1aab4be30024f5d67f3a4a53_img.jpg) - -The diagram illustrates the internal processing flow of the M-AI/FlexO-x-GCM-DSH-Z\_A\_So processes. At the top, multiple input streams labeled $CI\_D[1], CI\_D[2], \dots, CI\_D[x]$ enter the system. Each stream passes through an **MFAS insertion** block, which outputs $CK, D, FS, MFS$ . These are then processed by **FlexOsec processes**, which also receive $CK\_COM$ from a **COMMS clock generation** block and $D\_COM$ from an **Insert KCC** block. The FlexOsec processes output $D_{sec1}, D_{sec2}, \dots, D_{secx}$ to an **Interleaving** block. The Interleaving block also receives $CK$ from a **FlexO-x clock gen. ( $\times x$ )** block. The interleaved data $D, FS$ goes to an **Alignment insertion** block, which outputs $CK, D, FS$ . This is followed by **Mapping to-SC frame**, which receives $CK\_SC$ from a **FlexO-x-SC clock generation/ ( $\times 5485/5140$ )** block. The mapping block outputs $D, FS$ to an **SC FEC adapter and encoder (FlexO-x-SC)**. This block also receives **MBAS** from a **Generate MBAS** block and **FBGS** from a **BS, MBS and FBGS generator** block. The SC FEC adapter outputs $CK, D, FBGS$ to a **Padding** block, which outputs $D, FBGS$ to a **Scrambler** block, which outputs $D, FBGS$ to a **Convolutional interleaving** block, which outputs $D, FBGS$ to a **Hamming FEC map and encoder** block. This block also receives $CK_{DSH}$ from a **FlexO-x-DSH clock generation/ ( $\times 25984/21845$ )** block and outputs $CK, D, FBGS$ to a **Mapping to-DSH frame and multiframe** block. This mapping block also receives **DFS, DMFS** from a **DFS, DMFS and DSFS generator** block and outputs $D, CK_{DSH}, DFS, DMFS$ to a **Lane distribution (for symbol/Pol. distribution)** block. The lane distribution block also receives $CK_L$ from a **FlexO-x-Z-DSH clock generation/ ( $\times 1/Z$ )** block. The lane distribution block outputs $D[1..Z], CK_L, DFS, DMFS$ to a **PMA** block. The PMA block is connected to an **M-AP** block, which outputs $AI\_D[1], \dots, AI\_D[Z]$ to an **OTSi\_AP** block. Various other blocks generate specific sequences: **Generate and insert training sequence** (DFS), **Generate and insert pilot sequence** (DFS), **Generate and insert MFAS** (DMFS), **Generate and insert fixed Stuff** (DMFS), and **Generate and insert SFAS** (SMFS). These are also inputs to the lane distribution block. The diagram also includes labels for **SK\\_COMMS\\_CP**, **SKI\\_Key[0,1,2,3]**, **SKI\\_KI**, **SKI\\_IV\\_Fixed\\_ID**, and **FOIC1.4-DSH ( $x=1, Z=4$ )**, **FOIC2.4-DSH ( $x=2, Z=4$ )**, **FOIC2.8-DSH ( $x=2, Z=8$ )**, and **FOIC4.8-DSH ( $x=4, Z=8$ )**. A vertical label on the right side reads **M-AI/FlexO-1-GCM-DSH-Z\_A\_So\_SKP**. The bottom right corner contains the text **G.798(17)-Amd.4(22)\_F16-17.6**. - -Block diagram of M-AI/FlexO-x-GCM-DSH-Z\_A\_So processes showing data flow from inputs through various processing stages to the PMA and OTSi\_AP. - -Figure 16-17.6 – M-AI/FlexO-x-GCM-DSH-Z\_A\_So processes - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -#### 16.7.4 OTSi to FlexO-x-DSH adaptation sink functions (M-AI/FlexO-x-DSH-Z\_A\_Sk and M-AI/FlexO-x-GCM-DSH-Z\_A\_Sk) - -The information flow and processing of the M-AI/FlexO-x-DSH-Z\_A\_Sk and M-AI/FlexO-x-GCM-DSH-Z\_A\_Sk functions ( $\{x,Z\}=\{1,4\}, \{2,4\}, \{2,8\}, \{4,8\}$ ) is defined with reference to Figures 16-17.7 and 16-17.8. The interfaces of these functions are defined in Table 16-14.4. - -##### Symbol - -![Diagram showing two adaptation sink function symbols. The left symbol is 'M-AI/FlexO-x-DSH-Z' with inputs 'OTSi_AP' and 'M-AP[1..Z]' (via a dashed oval) and output 'FlexO-x_CP'. It has a bidirectional interface 'M-AI/FlexO-x-DSH-Z_A_Sk_MP'. The right symbol is 'M-AI/FlexO-x-GCM-DSH-Z' with inputs 'OTSi_AP' and 'M-AP[1..Z]' (via a dashed oval) and outputs 'FlexO-x_CP' and 'SK_COMMS_CP'. It has bidirectional interfaces 'M-AI/FlexO-x-GCM-DSH-Z_A_Sk_MP' and 'M-AI/FlexO-x-GCM-DSH-Z_A_Sk_SKP'. A reference code 'G.798(17)-Amd.4(22)_F16-17.7' is at the bottom right.](82a7d47fd0aee910d598c30998c23e08_img.jpg) - -G.798(17)-Amd.4(22)\_F16-17.7 - -Diagram showing two adaptation sink function symbols. The left symbol is 'M-AI/FlexO-x-DSH-Z' with inputs 'OTSi\_AP' and 'M-AP[1..Z]' (via a dashed oval) and output 'FlexO-x\_CP'. It has a bidirectional interface 'M-AI/FlexO-x-DSH-Z\_A\_Sk\_MP'. The right symbol is 'M-AI/FlexO-x-GCM-DSH-Z' with inputs 'OTSi\_AP' and 'M-AP[1..Z]' (via a dashed oval) and outputs 'FlexO-x\_CP' and 'SK\_COMMS\_CP'. It has bidirectional interfaces 'M-AI/FlexO-x-GCM-DSH-Z\_A\_Sk\_MP' and 'M-AI/FlexO-x-GCM-DSH-Z\_A\_Sk\_SKP'. A reference code 'G.798(17)-Amd.4(22)\_F16-17.7' is at the bottom right. - -**Figure 16-17.7 – M-AI/FlexO-x-DSH-Z\_A\_Sk and M-AI/FlexO-x-GCM-DSH-Z\_A\_Sk functions ( $\{x,Z\}=\{1,4\}, \{2,4\}, \{2,8\}, \{4,8\}$ )** - -## Interfaces - -**Table 16-14.4 – M-AI/FlexO-*x*-DSH-Z\_A\_Sk inputs and outputs** - -| Input(s) | Output(s) | -|--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| M_AP:
M-AI_D[1..Z]
OTSiG-O_AP:
OTSiA_AI_TSF-O
OTSiA_AI_TSF-P
M-AI/FlexO-x-DSH-Z_A_Sk_MP:
M-AI/FlexO- x -DSH-Z_A_Sk_MI_1second
M-AI/FlexO- x -DSH-Z_A_Sk_MI_SquelchEn (Note)
M-AI/FlexO-x-GCM-DSH_A_Sk_SKP: (Note)
M-AI/FlexO- x -GCM-DSH-Z_A_Sk_SKI_Key[0,1,2,3]
M-AI/FlexO- x -GCM-DSH-Z_A_Sk_SKI_IV_Fixed_ID | FlexO-x_CP:
FlexO- x _CI_CK
FlexO- x _CI_D[1.. x ]
FlexO- x _CI_FS
FlexO- x _CI_MFS
FlexO- x _CI_SSF
M-AI/FlexO-x-DSH-Z_A_Sk_MP:
M-AI/FlexO- x -DSH-Z_A_Sk_MI_AcCST[1.. x ] (Note)
M-AI/FlexO- x -DSH-Z_A_Sk_MI_cLOS-P
M-AI/FlexO- x -DSH-Z_A_Sk_MI_cLOL
M-AI/FlexO- x -DSH-Z_A_Sk_MI_cLOF
M-AI/FlexO- x -DSH-Z_A_Sk_MI_cLOM
M-AI/FlexO- x -DSH-Z_A_Sk_MI_cCSTM (Note)
M-AI/FlexO- x -DSH-Z_A_Sk_MI_cUnlockSec (Note)
M-AI/FlexO- x -DSH-Z_A_Sk_MI_pFECcorrErr
M-AI/FlexO- x -DSH-Z_A_Sk_MI_pAuthCheckErr (Note)
M-AI/FlexO-x-GCM-DSH_A_Sk_SKP: (Note)
M-AI/FlexO- x -GCM- DSH-Z_A_Sk_SKI_AcKI
SK_COMMS_CP: (Note)
SK_COMMS_CI_D
SK_COMMS_CI_CK | -| NOTE – For OTSiG/FlexO- x -GCM-DSH-Z_A_Sk only. | | - -## Processes - -The processes associated with the M-AI/FlexO-*x*-GCM-DSH-Z\_A\_Sk function are as depicted in Figure 6-17.8. For the M-AI/FlexO-*x*-DSH-Z\_A\_Sk function, Figure 16-17.8 could also be used, except that the FlexOsec process is a null process connecting its output signals to the corresponding input signals. - -**PMA process:** The process shall recover the data and clock of the FOIC $x$ .Z-DSH lanes from the physical media adapted interface. The details are out of scope of this Recommendation. - -**Recombination:** The function shall recombine the *Z* FOIC $x$ .Z-DSH logical lanes and reconstruct the FlexO-*x*-DSH frame and Hamming FEC codewords soft signal for FOIC2.4-DSH (*x*=2, *Z*=4), FOIC2.8-DSH (*x*=2, *Z*=8), FOIC4.8-DSH (*x*=4, *Z*=8) or FOIC1.4-DSH (*x*=1, *Z*=4), respectively. - -**Demapping from-DSH frame and multiframe:** The function shall demap the extended FBG signal structure (carrying the padded, scrambled, interleaved and Hamming FEC encoded FlexO-*x*-SC signal) from the payload area of the FlexO-*x*-DSH DSP frame signal as defined in clause 15.4.5.1 (*Z*=8 for *x*=2 or 4) and 15.4.5.2 (*Z*=4 for *x*=1 or 2) of [ITU-T G.709.3]. It shall generate the FBGS block start indication derived from the FlexO-*x*-DSH multiframe and superframe start indication. - -**Soft decision Hamming FEC decoder and demapping:** See clause 8.5.8 for the soft decision extended Hamming decoder. After Hamming FEC decoding and demapping, the extended FBG structure consists of 10976×119-bit blocks. - -**Convolution deinterleaving:** The function shall deinterleave the 119-bit blocks within the extended FBG as defined in clause 15.4.3 of [ITU-T G.709.3]. - -**Descrambler:** The function shall descramble the extended FBG as defined in clause 15.4.1 of [ITU-T G.709.3], resulting into the unscrambled FlexO-*x*-SC frame. - -**Unpadding:** The function shall remove the six 119-bit padding blocks (i.e., 714-bit pad) from the end of every extended FlexO-*x*-SC FBG structure of 10976×119-bit block as described in clauses 15.4.2 and 15.4.1 of [ITU-T G.709]. The resulting FBG structure consists in 10970×119-bit blocks. - -**Staircase (SC) FEC decoder and adapter:** See clause 8.5.4. - -NOTE – In this process, the Multi Block Alignment Signal (MBAS) overhead is extracted from FlexO-*x*-SC overhead as described in clause B.2 (*x*=1) or C.2 (*x*=2 or 4) of [ITU-T G.709.3] and MBAS sequence is aligned to synchronize SC FEC Error Decorrelator (ED). - -**SC-frame demapping:** The function shall demap (i.e., removal of staircase SC FEC parity area) the FlexO-*x* frame from the incoming FlexO-*x*-SC frame as defined in clause 11.1, 12.1 or 13-1 of [ITU-T G.709.3] for 100G FlexO-1-SC (*x*=1), 200G FlexO-2-SC (*x*=2) or 400G FlexO-4-SC (*x*=4), respectively. - -**FlexO-*x* frame alignment:** See clause 8.2.8. - -**De-interleaving:** See clause 8.13.2. - -**Extract and replace KCC:** The in-band key exchange communication channel (KCC) is optional in M-AI/FlexO-*x*-GCM-DSH-Z\_A\_Sk and unused in M-AI/FlexO-*x*-DSH-Z\_A\_Sk function. When used, the function shall extract the KCC data (SK\_COMMS\_CI\_D) from the FlexOsec KCC overhead field of the first FlexO instance frame of the FlexO-*x* as described in clause 9.2.8 of [ITU-T G.709.1]. The bit rate of the KCC data is defined by the outgoing KCC clock. The function shall generate the KCC clock (SK\_COMMS\_CI\_CK) by dividing the FlexO-*x* clock by a factor of 82240. After extraction, the KCC byte in the FlexOsec overhead is replaced with value 0x00 at the input of the FlexOsec sink processes. - -**FlexOsec processes:** - -- For M-AI/FlexO-*x*-GCM-DSH-Z\_A\_Sk function, see clause 8.14.2 and clause 8.14.3.1 for the specific GCM-AES-256 decryption and authentication processes with the cipher suite type (CST) code point value 000001, as defined in clause B.1 of [ITU-T G.709.1]. The FlexOsec decryption and authentication processes are performed for each individual FlexO instance frame signal in parallel, after to deinterleaving from FlexO-*x*. The same management information (MI) input from the EMF and Secure Key Information (SKI) input from the key exchange and agreement functions are shared by the *x* sets of FlexOsec processes. The same sets of keys are configured to be used by the *x* sets of FlexOsec sink processes. -- For M-AI/FlexO-*x*-DSH-Z\_A\_Sk function, this is a null process connecting its output signals to the corresponding input signals. - -**Multiframe alignment:** The process shall recover the FlexO multi-frame start as described in clause 8.2.2. - -![Figure 16-17.8 – M-AI/FlexO-x-GCM-DSH-Z_A_Sk processes. This is a complex block diagram showing the signal processing flow for FlexO-x interfaces. At the bottom, multiple FlexO-x interfaces (FOIC1.4-DSH, FOIC2.4-DSH, FOIC2.8-DSH, FOIC4.8-DSH) are shown with their respective Z values. These connect to a PMA block, which outputs dLOL and dLOS-P signals. Above the PMA is a 'Lane recombination (from Pol/symbol)' block. The signal then passes through a series of processing stages: 'Demapping from-DSH frame and multiframe', 'Soft decision hamming FEC decoder and demap', 'Convolutional deinterleaving', 'Descrambler', 'Unpadding', 'SC FEC adapter and decoder (FlexO-x-SC)', 'Demapping from-SC frame', and 'FlexO-x frame alignment'. This stage outputs dLOF. The signal then enters a 'De-interleaving' block. Above this, there are multiple 'FlexOsec processes' (labeled 1, 2, ..., x). Each process includes 'Multiframe alignment' (outputting dLOM[1], dLOM[2], ..., dLOM[x]) and 'FlexOsec processes' blocks. These blocks output various signals including AuthCheckErr[j], dUnlockSec[j], dLOL, MI_SquelchEn, AcCST[j], SKI_Key[0,1,2,3], SKI_IV_Fixed_ID, and SKI_AcKII[j]. A 'Replace and extract KCC' block is also shown. On the right side, there are 'Performance monitoring' and 'Defect correlation' blocks that receive inputs from the FlexOsec processes and output MI signals like MI_pAuthcheckErr, MI_lsecond, MI_pFECorrErr, MI_cCSTM, MI_cUnlockSec, MI_cLOM, MI_cLOF, MI_cLOL, and MI_cLOS-P. The top of the diagram shows the SK_COMM_CP and FlexO-x_CP (x = 1, 2 or 4) interfaces with signals like D_COM, CK_COM, CL_SK_D, CL_SK_CK, CL_D[1], CL_CK, CL_FS, CL_MFS, CL_D[2], ..., CL_D[x], and CL_SSF. Vertical labels on the far right identify the sections as 'M-AI/FlexO-x-GCM-DSH-Z_A_Sk_SKP' and 'M-AI/FlexO-x-GCM-DSH-Z_A_Sk_MP'. The diagram is labeled G.798(23)_F16-17.8 at the bottom right.](9f1b05b6b77146b0d62dbc084ebbe162_img.jpg) - -Figure 16-17.8 – M-AI/FlexO-x-GCM-DSH-Z\_A\_Sk processes. This is a complex block diagram showing the signal processing flow for FlexO-x interfaces. At the bottom, multiple FlexO-x interfaces (FOIC1.4-DSH, FOIC2.4-DSH, FOIC2.8-DSH, FOIC4.8-DSH) are shown with their respective Z values. These connect to a PMA block, which outputs dLOL and dLOS-P signals. Above the PMA is a 'Lane recombination (from Pol/symbol)' block. The signal then passes through a series of processing stages: 'Demapping from-DSH frame and multiframe', 'Soft decision hamming FEC decoder and demap', 'Convolutional deinterleaving', 'Descrambler', 'Unpadding', 'SC FEC adapter and decoder (FlexO-x-SC)', 'Demapping from-SC frame', and 'FlexO-x frame alignment'. This stage outputs dLOF. The signal then enters a 'De-interleaving' block. Above this, there are multiple 'FlexOsec processes' (labeled 1, 2, ..., x). Each process includes 'Multiframe alignment' (outputting dLOM[1], dLOM[2], ..., dLOM[x]) and 'FlexOsec processes' blocks. These blocks output various signals including AuthCheckErr[j], dUnlockSec[j], dLOL, MI\_SquelchEn, AcCST[j], SKI\_Key[0,1,2,3], SKI\_IV\_Fixed\_ID, and SKI\_AcKII[j]. A 'Replace and extract KCC' block is also shown. On the right side, there are 'Performance monitoring' and 'Defect correlation' blocks that receive inputs from the FlexOsec processes and output MI signals like MI\_pAuthcheckErr, MI\_lsecond, MI\_pFECorrErr, MI\_cCSTM, MI\_cUnlockSec, MI\_cLOM, MI\_cLOF, MI\_cLOL, and MI\_cLOS-P. The top of the diagram shows the SK\_COMM\_CP and FlexO-x\_CP (x = 1, 2 or 4) interfaces with signals like D\_COM, CK\_COM, CL\_SK\_D, CL\_SK\_CK, CL\_D[1], CL\_CK, CL\_FS, CL\_MFS, CL\_D[2], ..., CL\_D[x], and CL\_SSF. Vertical labels on the far right identify the sections as 'M-AI/FlexO-x-GCM-DSH-Z\_A\_Sk\_SKP' and 'M-AI/FlexO-x-GCM-DSH-Z\_A\_Sk\_MP'. The diagram is labeled G.798(23)\_F16-17.8 at the bottom right. - -**Figure 16-17.8 – M-AI/FlexO-x-GCM-DSH-Z\_A\_Sk processes** - -## Defects - -The function shall detect dLOS-P, dLOL, dLOF, dCSTM, dUnlockSec[j] and dLOM[j]. - -**dLOS-P:** See clause 6.2.1.2. - -**dLOL:** dLOL is generated for FlexO-x-DSH interfaces based on the pilot symbols, DSP frame and DSP multiframe alignment. dLOL shall be declared if alignment is false for 3 ms. To provide for the - -case of intermittent out-of-alignment, the integrating timer shall not be reset to zero until an alignment condition persists continuously for 3 ms. dLOL shall be cleared if alignment is true for 3 ms. - -**dLOF:** See clause 6.2.5.1. - -**dCSTM:** See clause 6.2.11. The expected cipher suite type is "0000 0001". Set to false for M-AI/FlexO-*x*-DSH-Z\_Sk function without FlexOsec. - -Per FlexO instance #*j* detection (*j* = 1..*x*): - -**dLOM[*j*]:** See clause 6.2.5.2. - -**dUnlockSec[*j*]:** See clause 6.2.7.2.1. Set to false for M-AI/FlexO-*x*-DSH-Z\_Sk function without FlexOsec. - -### Consequent actions - -aSSF $\leftarrow \sum dLOM[j] \text{ or } \sum dUnlockSec[j] \text{ or } dCSTM \text{ or } dLOF \text{ or } \sum dLOS-P[i] \text{ or } dLOL \text{ or } AI\_TSF-P$ - -### Defect correlations - -cLOS-P $\leftarrow dLOS-P \text{ and (not } AI\_TSF-P)$ - -cLOL $\leftarrow dLOL \text{ and (not } dLOS-P) \text{ and (not } AI\_TSF-P)$ - -cLOF $\leftarrow dLOF \text{ and (not } dLOL) \text{ and (not } AI\_TSF-P)$ - -cCSTM $\leftarrow dCSTM \text{ and (not } dLOF) \text{ and (not } dLOL) \text{ and (not } AI\_TSF-P)$ - -cUnlockSec $\leftarrow \sum dUnlockSec[j] \text{ and (not } dCSTM) \text{ and (not } dLOF) \text{ and (not } dLOL) \text{ and (not } AI\_TSF-P)$ - -cLOM $\leftarrow \sum dLOM[j] \text{ and (not } dCSTM) \text{ and (not } dLOF) \text{ and (not } dLOL) \text{ and (not } AI\_TSF-P)$ - -### Performance monitoring - -The function shall perform the following performance monitoring primitives processing. The performance monitoring primitives shall be reported to the equipment management function (EMF). - -pFECcorrErr $\leftarrow \sum nFECcorrErr$ - -pAuthcheckErr $\leftarrow \sum AuthcheckErr$ - -NOTE – During AI\_TSF-P, $\sum dUnlockSec[j]$ and dLOL, no corrected bits or authentication failure shall be counted. - -### 16.7.5 OTSi to FlexO-*x*-DO adaptation source functions (M-AI/FlexO-*x*-DO-Z\_A\_So and M-AI/FlexO-*x*-GCM-DO-Z\_A\_So) - -The information flow and processing of the M-AI/FlexO-*x*-DO-Z\_A\_So and M-AI/FlexO-*x*-GCM-DO-Z\_A\_So functions ( $\{x, Z\} = \{1, 4\}, \{2, 4\}, \{2, 8\}, \{4, 8\}$ ) is defined with reference to Figures 16-17.9 and 16-17.10. The interfaces of these functions are defined in Table 16-14.5. - -## Symbol - -![Diagram showing the symbols for M-AI/FlexO-x-DO-Z_A_So and M-AI/FlexO-x-GCM-DO-Z_A_So functions. The left symbol for M-AI/FlexO-x-DO-Z takes FlexO-x_CP (x = 1, 2, 4) as input and produces M-AP[1..Z] and OTSi_AP as outputs. The right symbol for M-AI/FlexO-x-GCM-DO-Z takes FlexO-x_CP (x = 1, 2, 4), SK_COMMS_CP, and M-AI/FlexO-x-GCM-DO-Z_A_So_SKP as inputs and produces M-AP[1..Z] and OTSi_AP as outputs. A note G.798(17)-Amd.4(22)_F16-17.9 is present.](c8b66b38ad7369d0771b91b51c155b32_img.jpg) - -Diagram showing the symbols for M-AI/FlexO-x-DO-Z\_A\_So and M-AI/FlexO-x-GCM-DO-Z\_A\_So functions. The left symbol for M-AI/FlexO-x-DO-Z takes FlexO-x\_CP (x = 1, 2, 4) as input and produces M-AP[1..Z] and OTSi\_AP as outputs. The right symbol for M-AI/FlexO-x-GCM-DO-Z takes FlexO-x\_CP (x = 1, 2, 4), SK\_COMMS\_CP, and M-AI/FlexO-x-GCM-DO-Z\_A\_So\_SKP as inputs and produces M-AP[1..Z] and OTSi\_AP as outputs. A note G.798(17)-Amd.4(22)\_F16-17.9 is present. - -**Figure 16-17.9 – M-AI/FlexO-x-DO-Z\_A\_So and M-AI/FlexO-x-GCM-DO-Z\_A\_So functions** - $(\{x,Z\}=\{1,4\}, \{2,4\}, \{2,8\}, \{4,8\})$ - -## Interfaces - -**Table 16-14.5 – M-AI/FlexO-x-DO-Z\_A\_So inputs and outputs** - -| Input(s) | Output(s) | -|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|------------------------------------------------------------------------------| -| FlexO-x_CP :
FlexO-x_CI_CK
FlexO-x_CI_D[1..x]
FlexO-x_CI_FS
FlexO-x_CI_MFS
M-AI/FlexO-x-GCM-DO-Z_A_So_SKP: (Note)
M-AI/FlexO-x-GCM-DO-Z_A_So_SKI_Key[0,1,2,3]
M-AI/FlexO-x-GCM-DO-Z_A_So_SKI_KI
M-AI/FlexO-x-GCM-DO-Z_A_So_SKI_IV_Fixed_ID
SK_COMMS_CP: (Note)
SK_COMMS_CI_D | M_AP:
M-AI_D[1..Z]
SK_COMMS_CP: (Note)
SK_COMMS_CI_CK | -| NOTE – For OTSiG/FlexO-x-GCM-DO-Z_A_So only. | | - -## Processes - -The processes associated with the M-AI/FlexO-x-GCM-DO-Z\_A\_So function are as depicted in Figure 16-17.10. For the M-AI/FlexO-x-DO-Z\_A\_So function, Figure 16-17.10 could also be used, except that the FlexOsec process is a null process connecting its output signals to the corresponding input signals. - -**MFAS insertion:** The function shall insert the MFAS into the FlexO basic overhead area in every FlexO instance of the FlexO-x as described in [ITU-T G.709.1]. - -### FlexOsec processes: - -- For M-AI/FlexO-x-GCM-DO-Z\_A\_So function, see clause 8.14.1 and clause 8.14.3.1 for the specific GCM-AES-256 encryption and authentication processes with the cipher suite type (CST) code point value 000001, as defined in clause B.1 of [ITU-T G.709.1]. The FlexOsec encryption and authentication processes are performed for each individual FlexO instance frame signal in parallel, prior to interleaving into the FlexO-x. The same management information (MI) input from the EMF and Secure Key Information (SKI) input from the key exchange and agreement functions are shared by the $x$ sets of FlexOsec processes. The same key is used by the $x$ sets of FlexOsec source processes which are simultaneously triggered by the key exchange and agreement functions (through SKI\_KI input) to switch to a new key. - -– For M-AI/FlexO-*x*-DO-Z\_A\_So function, this is a null process connecting its output signals to the corresponding input signals. - -**COMMS Clock generation:** For M-AI/FlexO-*x*-GCM-DO-Z\_A\_So function, the process shall generate SK\_COMMS clock (CK\_COM) by dividing the FlexO clock (CI\_CK) by a factor of 82240. - -**Insert KCC:** The in-band key exchange communication channel (KCC) is optional for M-AI/FlexO-*x*-GCM-DO-Z\_A\_So function and unused for M-AI/FlexO-*x*-DO-Z\_A\_So function. When used, the incoming SK\_COMMS\_CI\_D data is inserted after FlexOsec authentication and encryption into the KCC field of the first FlexO instance frame (CI\_D[1]) of the FlexO-*x* as described in clause 9.3.2.5 of [ITU-T G.709.1]. When it is not used, the all-ZEROS reserved value is inserted into the KCC field - -**Interleaving:** See clause 8.13.1 for the *x* FlexO instance signals interleaving to FlexO-*x*. - -**Alignment insertion:** The function shall insert the alignment marker into the FlexO-*x* frame AM area as described in clause 9.1.1, 9.1.3 or 9.1.5 of [ITU-T G.709.1] for 100G FlexO-1 (*x*=1), 200G FlexO-2 (*x*=2) or 400G FlexO-4 (*x*=4), respectively. - -**Clock generation:** The function shall generate the FlexO-*x*-DO clock by multiplying the incoming FlexO clock (CI\_CK) by [*x*× 1536/1285] to the frequencies as listed in Table 16-2 of [ITU-T G.709.3] for 100G FlexO-1-DO (*x*=1), 200G FlexO-2-DO (*x*=2) or 400G FlexO-4-DO (*x*=4). The FOIC*x*-Z-DO lane clock is obtained by dividing the FlexO-*x*-DO clock by a factor *Z*. - -**OFBGS and OFCS generation:** The function shall generate the open FEC block group start of order *Z* (OFBG*Z*S, with *Z*=4 or 8) providing the OFEC coders alignment (OFCi) using the incoming FlexO-*x* frame start (FS) to align the OFBG*Z* structure with the FlexO-*x* frame structure as described in clause 16.4.1 of [ITU-T G.709.3]. An OFEC block group (OFBG*Z*) is aligned with 116 consecutive FlexO-*x* frame rows ( $\{x,Z\}=\{4,8\}$ , $\{2,8\}$ or $\{1,4\}$ ) or 58 consecutive FlexO-*x* frame rows ( $\{x,Z\}=\{2,4\}$ ). It contains exactly 149184×*Z* bits data. For $\{x,Z\}=\{4,8\}$ or $\{x,Z\}=\{2,8\}$ , it corresponds to 10280×116 bits of FlexO-*x* data plus 992-bit pad and contains 168 OFEC coder blocks (OFCs). For $\{x,Z\}=\{2,4\}$ or $\{x,Z\}=\{1,4\}$ , it corresponds to 10280×58 or 5140×116 bits of FlexO-*x* data plus 496-bit pad and contains 84 OFEC coder blocks (OFCs). - -**Padding:** For $\{x,Z\}=\{4,8\}$ or $\{x,Z\}=\{2,8\}$ , the function shall add 992-bit pad at the end of every set of 116 FlexO-*x* rows to create an OFBG8 of 149184× 8-bit data (*Z*= 8) as described in clause 16.4.1 of [ITU-T G.709.3]. For $\{x,Z\}=\{2,4\}$ or $\{x,Z\}=\{1,4\}$ , the function shall add 496-bit pad at the end of every set of 116 FlexO-1 rows or 58 FlexO-2 rows to create an OFBG4 of 149184× 4-bit data (*Z*=4) as described in clause 16.4.1 of [ITU-T G.709.3]. - -**Scrambler:** The function shall scramble the OFBG*Z* as defined in clause 16.4.2 of [ITU-T G.709.3], meaning that all data within the FlexO-*x* frame are scrambled. - -**FEC mapping and encoder:** See clause 8.5.9. After OFEC mapping and encoding, the OFBG*Z*P structure (OFBG*Z* plus OFEC parity bits) consists of 172032×*Z*-bit blocks. - -**Interleaving:** The function shall interleave the bits within the OFBG*Z*P as defined in clause 16.4.5 of [ITU-T G.709.3]. - -**DFS and DMFS generation:** The function shall generate the FlexO-*x*-DO frame start (DFS) and 48-frame multiframe start (DMFS) using the incoming OFEC block group start (OFBGS) to synchronize the OFBG*Z*P structure after OFEC encoding with the FlexO-*x*-DO DSP frame structure as described in clauses 16.1 of [ITU-T G.709.3]. The FlexO-*x*-DO frame consists of (3712×*Z*) bits as described in [ITU-T G.709.3] clause 14.1 (*Z*=4 for *x*=1 or 2; *Z*=8 for *x*=2 or 4). A FlexO-*x*-DO multiframe carries one OFBG*Z*P. - -**Mapping to -DO frame:** The function shall map the incoming OFBG*Z*P signal (carrying the FlexO-*x* signal after padding, scrambling, OFEC encoding and interleaving) into the payload area of the FlexO-*x*-DO DSP frame signal as defined in clause 16.4.6.1 (*Z*=8 for *x*=2 or 4) and 15.4.6.2 (*Z*=4 for *x*=1 or 2) of [ITU-T G.709.3]. - -**Generate and insert training sequence:** The function shall generate and insert the training sequence into the TS overhead position (11 Z-bit) at the start of the FlexO-*x*-DO frame as defined in clause 14.2.1 of [ITU-T G.709.3]. - -**Generate and insert pilot sequence:** The function shall generate and insert the pilot sequence into the PS overhead position (Z-bit) at the start of each FlexO-*x*-DO frame row as defined in clause 14.2.2 of [ITU-T G.709.3]. - -**Generate and insert MFAS:** The function shall generate and insert the DO 48-frame multiframe alignment signal into the MFAS overhead position (22 Z-bit) in the first FlexO-*x*-DO frame of each multiframe as defined in clauses 16.1.1 and 16.3.1 of [ITU-T G.709.3]. - -**Generate and insert FS:** The function shall generate and insert the 54 Z-bit fixed stuff into the FS overhead position in the first FlexO-*x*-DO frame of each 49-frame multiframe as defined in clause 16.3.2 of [ITU-T G.709.3]. - -**Lane Distribution:** The function shall divide FlexO-*x*-DO frame signal into Z FOIC*x*-Z-DO logical lanes based on a bit-by-bit distribution as described in clause 16.5.1, 16.5.2, 16.5.3 or 16.5.4 of [ITU-T G.709.3] for FOIC2.4-DO (*x*=2, Z=4), FOIC2.8-DO (*x*=2, Z=8), FOIC4.8-DO (*x*=4, Z=8) or FOIC1.4-DO (*x*=1, Z=4), respectively. - -Note that the Z FOIC*x*-Z-DO logical lanes carry a dual polarization symbol, so that Z/2 lanes are to be associated with polarization X, while the other Z/2 lanes are to be associated with the polarization Y. The mapping of the Z lanes to the dual polarization symbol is specified in clause 16.4.6 of [ITU-T G.709.3]. - -**PMA process:** The process shall map the FOIC*x*-Z-DO lanes onto the physical media adapted interface. The details are out of scope of this Recommendation. - -![Block diagram of M-AI/FlexO-x-GCM-DO-Z_A_So processes showing data flow from FlexO-x_CP inputs through various processing stages (MFAS insertion, FlexOsec Processes, Interleaving, Alignment Insertion, padding, Scrambler, FEC map and encoder, Interleaving, Mapping to -DO frame & multiframe) to a PMA and finally to OTSi_AP outputs. The diagram includes clock generation blocks, sequence insertion blocks, and configuration parameters like SKI_Key, FOICx.Z-DO clock generation, and lane distribution.](d3581354fc6f1b5e27d3c990e41cc805_img.jpg) - -The diagram illustrates the M-AI/FlexO-x-GCM-DO-Z\_A\_So processes. At the top, FlexO-x\_CP (x=1, 2 or 4) inputs (CI\_CK, CI\_D[1], CI\_FS, CI\_MFS, CI\_D[2], ..., CI\_D[x]) are processed through MFAS insertion and FlexOsec Processes. SK\_COMMS\_CP inputs (CI\_CK, CI\_D) are also processed. The data from FlexOsec Processes is interleaved and then processed through Alignment Insertion, padding, Scrambler, FEC map and encoder, and another Interleaving stage. The data is then mapped to -DO frame & multiframe. Various sequences are generated and inserted: Training Sequence (DFS), Pilot Sequence (DFS), MFAS (DMFS), and Fixed Stuff (DMFS). Clock signals (CK, CK\_com, CK\_o, CK\_DO, CK\_DSH) are generated and distributed throughout the process. The final data is sent to the PMA, which outputs to the OTSi\_AP (AI\_D[1], ..., AI\_D[Z]). - -Configuration parameters and labels include: - -- SKI\_Key[0,1,2,3] -- SKI\_KI -- SKI\_IV\_Fixed\_ID -- M-AI/FlexO-x-DO-Z\_A\_So\_SKP -- FOIC1.4-DO (x=1, Z=4) -- FOIC2.4-DO (x=2, Z=4) -- FOIC2.8-DO (x=2, Z=8) -- FOIC4.8-DO (x=4, Z=8) - -Block diagram of M-AI/FlexO-x-GCM-DO-Z\_A\_So processes showing data flow from FlexO-x\_CP inputs through various processing stages (MFAS insertion, FlexOsec Processes, Interleaving, Alignment Insertion, padding, Scrambler, FEC map and encoder, Interleaving, Mapping to -DO frame & multiframe) to a PMA and finally to OTSi\_AP outputs. The diagram includes clock generation blocks, sequence insertion blocks, and configuration parameters like SKI\_Key, FOICx.Z-DO clock generation, and lane distribution. - -Figure 16-17.10 – M-AI/FlexO-x-GCM-DO-Z\_A\_So processes - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -### 16.7.6 OTSi to FlexO-x-DO adaptation sink functions (M-AI/FlexO-x-DO-Z\_A\_Sk and M-AI/FlexO-x-GCM-DO-Z\_A\_Sk) - -The information flow and processing of the M-AI/FlexO-x-DO-Z\_A\_Sk and M-AI/FlexO-x-GCM-DO-Z\_A\_Sk functions ( $\{x,Z\}=\{1,4\}, \{2,4\}, \{2,8\}, \{4,8\}$ ) is defined with reference to Figures 16-17.11 and 16-17.12. The interfaces of these functions are defined in Table 16-14.6. - -#### Symbol - -![Diagram showing the symbols for M-AI/FlexO-x-DO-Z and M-AI/FlexO-x-GCM-DO-Z functions. The left symbol for M-AI/FlexO-x-DO-Z has an input OTSi_AP at the bottom, an output FlexO-x_CP at the top, and a bidirectional interface M-AI/FlexO-x-DO-Z_A_Sk_MP on the left. A dashed oval labeled M-AP[1..Z] is inside. The right symbol for M-AI/FlexO-x-GCM-DO-Z has an input OTSi_AP at the bottom, outputs FlexO-x_CP and SK_COMMS_CP at the top, a bidirectional interface M-AI/FlexO-x-GCM-DO-Z_A_Sk_MP on the left, and an output M-AI/FlexO-x-GCM-DO-Z_A_Sk_SKP on the right. It also has a dashed oval labeled M-AP[1..Z] inside. A small text 'G.798(17)-Amd.4(22)_F16-17.11' is at the bottom right.](a6a834290f84822c2d026a3da95617c5_img.jpg) - -G.798(17)-Amd.4(22)\_F16-17.11 - -Diagram showing the symbols for M-AI/FlexO-x-DO-Z and M-AI/FlexO-x-GCM-DO-Z functions. The left symbol for M-AI/FlexO-x-DO-Z has an input OTSi\_AP at the bottom, an output FlexO-x\_CP at the top, and a bidirectional interface M-AI/FlexO-x-DO-Z\_A\_Sk\_MP on the left. A dashed oval labeled M-AP[1..Z] is inside. The right symbol for M-AI/FlexO-x-GCM-DO-Z has an input OTSi\_AP at the bottom, outputs FlexO-x\_CP and SK\_COMMS\_CP at the top, a bidirectional interface M-AI/FlexO-x-GCM-DO-Z\_A\_Sk\_MP on the left, and an output M-AI/FlexO-x-GCM-DO-Z\_A\_Sk\_SKP on the right. It also has a dashed oval labeled M-AP[1..Z] inside. A small text 'G.798(17)-Amd.4(22)\_F16-17.11' is at the bottom right. - -**Figure 16-17.11 – M-AI/FlexO-x-DO-Z\_A\_Sk and M-AI/FlexO-x-GCM-DO-Z\_A\_Sk functions ( $\{x,Z\}=\{1,4\}, \{2,4\}, \{2,8\}, \{4,8\}$ )** - -## Interfaces - -**Table 16-14.6– M-AI/FlexO-*x*-DO-*Z* *A\_Sk* inputs and outputs** - -| Input(s) | Output(s) | -|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| M_AP:
M-AI_D[1.. Z ]
OTSiG-O_AP:
OTSiA_AI_TSF-O
OTSiA_AI_TSF-P
M-AI/FlexO-x-DO-Z A_Sk_MP:
M-AI/FlexO- x -DO- Z A_Sk _MI_1second
M-AI/FlexO- x -DO- Z A_Sk _MI_SquelchEn (Note)
M-AI/FlexO-x-GCM-DO A_Sk SKP: (Note)
M-AI/FlexO- x -GCM-DO- Z A_Sk _SKI_Key[0,1,2,3]
M-AI/FlexO- x -GCM-DO- Z A_Sk _SKI_IV_Fixed_ID | FlexO-x CP:
FlexO- x CI_CK
FlexO- x CI_D[1.. x ]
FlexO- x CI_FS
FlexO- x CI_MFS
FlexO- x CI_SSF
M-AI/FlexO-x-DO-Z A_Sk_MP:
M-AI/FlexO- x -DO- Z A_Sk _MI_AcCST[1.. x ] (Note)
M-AI/FlexO- x -DO- Z A_Sk _MI_cLOS-P
M-AI/FlexO- x -DO- Z A_Sk _MI_cLOL
M-AI/FlexO- x -DO- Z A_Sk _MI_cLOF
M-AI/FlexO- x -DO- Z A_Sk _MI_cLOM
M-AI/FlexO- x -DO- Z A_Sk _MI_cCSTM (Note)
M-AI/FlexO- x -DO- Z A_Sk _MI_cUnlockSec (Note)
M-AI/FlexO- x -DO- Z A_Sk _MI_pFECcorrErr
M-AI/FlexO- x -DO- Z A_Sk _MI_pAuthCheckErr (Note)
M-AI/FlexO-x-GCM-DO A_Sk SKP: (Note)
M-AI/FlexO- x -GCM- DO- Z A_Sk _SKI_AcKI
SK_COMMS_CP: (Note)
SK_COMMS_CI_D
SK_COMMS_CI_CK | -| NOTE – For OTSiG/FlexO- x -GCM-DO- Z A_Sk only. | | - -## Processes - -The processes associated with the M-AI/FlexO-*x*-GCM-DO-*Z* *A\_Sk* function are as depicted in Figure 16-17.12. For the M-AI/FlexO-*x*-DO-*Z* *A\_Sk* function, Figure 16-17.12 could also be used, except that the FlexOsec process is a null process connecting its output signals to the corresponding input signals. - -**PMA process:** The process shall recover the data and clock of the FOIC*x.Z*-DO lanes from the physical media adapted interface. The details are out of scope of this Recommendation. - -**Recombination:** The function shall recombine the *Z* FOIC*x.Z*-DO logical lanes and reconstruct the OFBGz soft signal and FlexO-*x*-DO frame for FOIC2.4-DO (*x*=2, *Z*=4), FOIC2.8-DO (*x*=2, *Z*=8), FOIC4.8-DO (*x*=4, *Z*=8) or FOIC1.4-DO (*x*=1, *Z*=4), respectively. - -**Demapping from -DO frame and multiframe:** The function shall demap the OFBGzP signal structure (carrying the padded, scrambled, OFEC encoded and interleaved FlexO-*x* signal data) from the payload area of the FlexO-*x*-DO DSP frame signal as defined in clause 16.4.6.1 (*Z*=8 for *x*=2 or 4) and 15.4.6.2 (*Z*=4 for *x*=1 or 2) of [ITU-T G.709.3]. It shall generate the OFBGzS block start indication derived from the FlexO-*x*-DO multiframe start indication - -**Deinterleaving:** The function shall deinterleave the bits within the OFBGzP as defined in clause 16.4.5 of [ITU-T G.709.3]. - -**Soft decision FEC decoder and demapping:** See clause 8.5.9 for the soft decision OFEC decoder. After OFEC decoding and demapping, the OFBGz structure consists of $149184 \times Z$ -bit blocks. - -**Descrambler:** The function shall descramble the OFBGz as defined in clause 16.4.2 of [ITU-T G.709.3], resulting into the unscrambled FlexO-*x* frame with pads. - -**Unpadding:** For $\{x, Z\} = \{4, 8\}$ or $\{x, Z\} = \{2, 8\}$ , the function shall remove the 992-bit pad at the end of every OFBG8 structure of $149184 \times 8$ -bit data ( $Z = 8$ ), resulting in of 116 FlexO-*x* frame rows of 10280-bit as described in clause 16.4.1 of [ITU-T G.709.3]. For $\{x, Z\} = \{2, 4\}$ or $\{x, Z\} = \{1, 4\}$ , the function shall remove the 496-bit pad at the end of every OFBG4 of $149184 \times 4$ -bit data ( $Z = 4$ ), resulting in 58 FlexO-2 frame rows of 10280-bit or 116 FlexO-1 frame rows of 5140-bit as described in clause 16.4.1 of [ITU-T G.709.3]. - -**FlexO-*x* frame alignment:** See clause 8.2.8. - -**De-interleaving:** See clause 8.13.2. - -**Extract and replace KCC:** The in-band key exchange communication channel (KCC) is optional in M-AI/FlexO-*x*-GCM-DO-Z\_A\_Sk and unused in M-AI/FlexO-*x*-DO-Z\_A\_Sk function. When used, the function shall extract the KCC data (SK\_COMMS\_CI\_D) from the FlexOsec KCC overhead field of the first FlexO instance frame of the FlexO-*x* as described in clause 9.2.8 of [ITU-T G.709.1]. The bit rate of the KCC data is defined by the outgoing KCC clock. The function shall generate the KCC clock (SK\_COMMS\_CI\_CK) by dividing the FlexO-*x* clock by a factor of 82240. After extraction, the KCC byte in the FlexOsec overhead is replaced with value 0x00 at the input of the FlexOsec sink processes. - -**FlexOsec processes:** - -- For M-AI/FlexO-*x*-GCM-DO-Z\_A\_Sk function See clause 8.14.2 and clause 8.14.3.1 for the specific GCM-AES-256 decryption and authentication processes with the cipher suite type (CST) code point value 000001, as defined in clause B.1 of [ITU-T G.709.1]. The FlexOsec decryption and authentication processes are performed for each individual FlexO instance frame signal in parallel, after to deinterleaving from FlexO-*x*. The same management information (MI) input from the EMF and Secure Key Information (SKI) input from the key exchange and agreement functions are shared by the *x* sets of FlexOsec processes. The same sets of keys are configured to be used by the *x* sets of FlexOsec sink processes. -- For M-AI/FlexO-*x*-DO-Z\_A\_Sk function, this is a null process connecting its output signals to the corresponding input signals. - -**Multiframe alignment:** The process shall recover the FlexO multi-frame start as described in clause 8.2.2. - -![Figure 16-17.12 – M-AI/FlexO-x-GCM-DO-Z_A_Sk processes](64b6966c073f3c3789a8070dbd6106c5_img.jpg) - -The diagram shows the functional architecture of the M-AI/FlexO-x-GCM-DO-Z\_A\_Sk sink function. At the bottom, it starts with the PMA and Lane recombination (from Pol./symbol/) for various FOIC interfaces (FOIC1.4-DO, FOIC2.4-DO, FOIC2.8-DO, FOIC4.8-DO). The signal flows upward through Demapping, Deinterleaving, Soft decision FEC decoder, Descrambler, Unpadding, and FlexO-x frame alignment. From there, it goes through De-interleaving to multiple parallel paths (x = 1, 2, or 4) each containing Multiframe alignment and FlexOsec processes. Management and monitoring signals (MI\_...) are extracted on the right side, including performance monitoring (nFECcorrErr) and defect correlation (dCSTM, dUnlockSec, dLOM, dLOF, dLOL, dLOS-P). Consequent actions (aSSF) are triggered based on these defects. Key management signals (SKI\_Key, SKI\_IV, SKI\_AckI) are also shown interacting with the FlexOsec processes. - -**Figure 16-17.12 – M-AI/FlexO-x-GCM-DO-Z\_A\_Sk processes** - -Figure 16-17.12 – M-AI/FlexO-x-GCM-DO-Z\_A\_Sk processes - -**Defects** - -The function shall detect dLOS-P, dLOL, dLOF, dCSTM, dUnlockSec[*j*] and dLOM[*j*]. - -**dLOS-P**: See clause 6.2.1.2. - -**dLOL**: dLOL is generated for FlexO-*x*-DO interfaces based on the pilot symbols, DSP frame and DSP multiframe alignment. dLOL shall be declared if alignment is false for 3 ms. To provide for the case of intermittent out-of-alignment, the integrating timer shall not be reset to zero until an alignment condition persists continuously for 3 ms. dLOL shall be cleared if alignment is true for 3 ms. - -**dLOF**: See clause 6.2.5.1. - -**dCSTM**: See clause 6.2.11. The expected cipher suite type is "0000 0001". Set to false for M-AI/FlexO-*x*-DO-Z\_Sk function without FlexOsec. - -**Rec. ITU-T G.798 (09/2023)**     403 - -Per FlexO instance #j detection (j = 1..x): - -**dLOM[j]**: See clause 6.2.5.2. - -**dUnlockSec[j]**: See clause 6.2.7.2.1. Set to false for M-AI/FlexO-x-DO-Z\_Sk function without FlexOsec. - -### Consequent actions - -aSSF $\leftarrow \sum dLOM[j]$ or $\sum dUnlockSec[j]$ or dCSTM or dLOF or or dLOS-P or dLOL or AI\_TSF-P - -### Defect correlations - -cLOS-P $\leftarrow$ dLOS-P and (not AI\_TSF-P) - -cLOL $\leftarrow$ dLOL and (not dLOS-P) and (not AI\_TSF-P) - -cLOF $\leftarrow$ dLOF and (not dLOL) and (not AI\_TSF-P) - -cCSTM $\leftarrow$ dCSTM and (not dLOF) and (not dLOL) and (not AI\_TSF-P) - -cUnlockSec $\leftarrow \sum dUnlockSec[j]$ and (not dCSTM) and (not dLOF) and (not dLOL) and (not AI\_TSF-P) - -cLOM $\leftarrow \sum dLOM[j]$ and (not dCSTM) and (not dLOF) and (not dLOL) and (not AI\_TSF-P) - -### Performance monitoring - -The function shall perform the following performance monitoring primitives processing. The performance monitoring primitives shall be reported to the equipment management function (EMF). - -pFECcorrErr $\leftarrow \sum nFECcorrErr$ - -pAuthcheckErr $\leftarrow \sum AuthcheckErr$ - -NOTE – During AI\_TSF-P, $\sum dUnlockSec[j]$ and dLOL, no corrected bits or authentication failure shall be counted. - -## 16.8 OTSiG to FlexO-x adaptation function (OTSiG/FlexO-x\_A) - -The OTSiG to FlexO-x (x = 1, 2, 4) adaptation functions perform the adaptation between the OTSiG layer adapted information and the characteristic information of the FlexO-x layer signal for the flexible OTN short reach interfaces with RS(544,514) FEC code. Two types of functions are defined: one that supports the standardized FlexOsec encryption and authentication functions (GCM-AES-256) and one that does not support FlexOsec encryption and authentication. - -**Table 16-14.7 – OTSi to FlexO-x adaptation functions (x=1,2,4)** - -| Function type | Function name | FlexO-x | -|------------------------|-----------------------------------------------------------------------------------------------------------------------|---------| -| OTSiG/FlexO-x-RS_A | OTSiG to FlexO-x adaptation function with RS(544,514) FEC code and without FlexOsec encryption and authentication | x=1,2,4 | -| OTSiG/FlexO-x-GCM-RS_A | OTSiG to FlexO-x adaptation function with RS(544,514) FEC code and GCM-AES-256 FlexOsec encryption and authentication | x=1,2,4 | - -NOTE – OTSiG/FlexO-x-RS\_A is used throughout this clause as shorthand for the specific function type. - -### 16.8.1 OTSiG to FlexO-*x*-RS adaptation source function (OTSiG/FlexO-*x*-RS\_A\_So) - -The information flow and processing of the OTSiG/FlexO-*x*-RS\_A\_So and OTSiG/FlexO-*x*-GCM-RS\_A\_So functions (*x* = 1, 2, 4) is defined with reference to Figures 16-18 and 16-19. - -#### Symbol - -![Diagram showing the symbols for OTSiG/FlexO-x-RS_A_So and OTSiG/FlexO-x-GCM-RS_A_So functions. The top part shows the OTSiG/FlexO-x-RS_A_So function with input FlexO-x_CP (x=1, 2, 4) entering a trapezoidal block. Inside the block, a dashed oval with arrows indicates a loop. The block has two outputs: OTSi_AP[1] and OTSi_AP[k]. The bottom part shows the OTSiG/FlexO-x-GCM-RS_A_So function with inputs FlexO-x_CP (x=1, 2, 4) and SK_COMMS_CP entering a trapezoidal block. Inside this block, a dashed oval with arrows indicates a loop. The block has two outputs: OTSi_AP[1] and OTSi_AP[k]. A label OTSiG/FlexO-x-GCM-RS_A_So_SKP points to the block. A reference G.798(17)-Amd.4(22)_F16-18 is shown below the bottom block.](7d2489babb3bf789de160fddd90c535b_img.jpg) - -Diagram showing the symbols for OTSiG/FlexO-x-RS\_A\_So and OTSiG/FlexO-x-GCM-RS\_A\_So functions. The top part shows the OTSiG/FlexO-x-RS\_A\_So function with input FlexO-x\_CP (x=1, 2, 4) entering a trapezoidal block. Inside the block, a dashed oval with arrows indicates a loop. The block has two outputs: OTSi\_AP[1] and OTSi\_AP[k]. The bottom part shows the OTSiG/FlexO-x-GCM-RS\_A\_So function with inputs FlexO-x\_CP (x=1, 2, 4) and SK\_COMMS\_CP entering a trapezoidal block. Inside this block, a dashed oval with arrows indicates a loop. The block has two outputs: OTSi\_AP[1] and OTSi\_AP[k]. A label OTSiG/FlexO-x-GCM-RS\_A\_So\_SKP points to the block. A reference G.798(17)-Amd.4(22)\_F16-18 is shown below the bottom block. - -Figure 16-18 – OTSiG/FlexO-*x*-RS\_A\_So and OTSiG/FlexO-*x*-GCM-RS\_A\_So functions - -#### Interfaces - -Table 16-15 – OTSiG/FlexO-*x*-RS\_A\_So inputs and outputs - -| Input(s) | Output(s) | -|----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|------------------------------------------------------------------------------------| -| FlexO-x_CP :
FlexO- x _CI_CK
FlexO- x _CI_D
FlexO- x _CI_FS
FlexO- x _CI_MFS
OTSiG/FlexO-x-GCM-RS_A_So_SKP: (Note)
OTSiG/FlexO- x -GCM-RS_A_So_SKI_Key[0,1,2,3]
OTSiG/FlexO- x -GCM-RS_A_So_SKI_KI
OTSiG/FlexO- x -GCM-RS_A_So_SKI_IV_Fixed_ID
SK_COMMS_CP: (Note)
SK_COMMS_CI_D | per OTSi_AP:
OTSi_AI_PLD
SK_COMMS_CP: (Note)
SK_COMMS_CI_CK | -| NOTE – For OTSiG/FlexO- x -GCM-RS_A_So only. | | - -#### Processes - -The processes associated with the OTSiG/FlexO-*x*-RS\_A\_So function are as depicted in Figure 16-19. - -**MFAS insertion:** The function shall insert the MFAS into the FlexO basic overhead area in every FlexO instance of the FlexO-*x* as described in [ITU-T G.709.1]. - -**FlexOsec processes:** For OTSiG/FlexO-*x*-GCM-RS\_A\_So, see clause 8.14.1 and clause 8.14.3.1 for the specific GCM-AES-256 encryption and authentication processes with the cipher suite type (CST) - -code point value 000001, as defined in clause B.1 of [ITU-T G.709.1]. The FlexOsec encryption and authentication processes are performed for each individual FlexO instance frame signal in parallel, prior to interleaving into the FlexO-*x*. The same management information (MI) input from the EMF and Secure Key Information (SKI) input from the key exchange and agreement functions are shared by the *x* sets of FlexOsec processes. The same key is used by the *x* sets of FlexOsec source processes which are simultaneously triggered by the key exchange and agreement functions (through SKI\_KI input) to switch to a new key. - -For OTSiG/FlexO-*x*-RS\_A\_So the FlexOsec processes are not present. - -**Interleaving:** See clause 8.13.1. - -**COMMS Clock generation:** For OTSiG/FlexO-*x*-GCM-RS\_A\_So, the function shall generate the SK\_COMMS clock (CK\_COM) by dividing the FlexO clock (CI\_CK) by a factor of 82240. For OTSiG/FlexO-*x*-RS\_A\_So this process is not present. - -**Insert KCC:** For OTSiG/FlexO-*x*-GCM-RS\_A\_So, the in-band key exchange communication channel (KCC) is optional. When used, the incoming SK\_COMMS\_CI\_D data is inserted after FlexOsec authentication and encryption into the KCC field of the first FlexO instance frame (CI\_D[1]) of the FlexO-*x* as described in clause 9.3.2.5 of [ITU-T G.709.1]. When it is not used, the all-ZEROS reserved value is inserted into the KCC field. For OTSiG/FlexO-*x*-RS\_A\_So this process is not present. - -**Clock generation:** The function shall generate the FlexO-*x*-RS clock by multiplying the incoming FlexO clock (CI\_CK) by $[x \times 544/514]$ to the frequencies as listed in Table 11-2, 12-2 or 13-2 of [ITU-T G.709.1] for 100G FlexO-1-RS (*x*=1), 200G FlexO-2-RS (*x*=2) or 400G FlexO-4-RS (*x*=4), respectively. - -**Mapping:** The function shall map (i.e., addition of FEC parity area) the incoming FlexO-*x* frame into the FlexO-*x*-RS frame payload area as defined in clause 11.1, 12.1 or 13-1 of [ITU-T G.709.1] for 100G FlexO-1-RS (*x*=1), 200G FlexO-2-RS (*x*=2) or 400G FlexO-4-RS (*x*=4), respectively. - -**Scrambler:** The function shall scramble FlexO-*x*-RS frame payload, fixed stuffing, extended overhead and basic overhead area as defined in clause 11.4, 12.4 or 13.4 of [ITU-T G.709.1] for 100G FlexO-1-RS (*x*=1), 200G FlexO-2-RS (*x*=2) or 400G FlexO-4-RS (*x*=4) respectively. - -**Alignment insertion:** The function shall insert the alignment marker into the FlexO-*x* frame AM area as described in clause 9.1.1, 9.1.3 or 9.1.5 of [ITU-T G.709.1] for 100G FlexO-1-RS (*x*=1), 200G FlexO-2-RS (*x*=2) or 400G FlexO-4-RS (*x*=4) respectively. - -**FEC encoder:** See clause 8.5.5. - -**Symbol Distribution:** The function shall divide FlexO-*x*-RS frame signal into $(4 \times x)$ FOIC*x*.*k* logical lanes based on 10-bit symbol granularity as described in clause 11.6.1, 12.6.1 or 13.6.1 of [ITU-T G.709.1] for 100G FlexO-1-RS (*x*=1), 200G FlexO-2-RS (*x*=2) or 400G FlexO-4-RS (*x*=4) respectively. - -For *x*=1, the 4 logical lanes of the FlexO-1-RS signal correspond to four FOIC1.4-RS physical lanes and optical OTSi payload signals per clause 11.6.1 of [ITU-T G.709.1]. - -**Bit interleaver:** - -The bit interleaver process bit multiplexes $(4 \times x)/k$ specific logical lanes of the $(4 \times x)$ logical lanes of the FlexO-*x*-RS signal to *k* FOIC*x*.*k*-RS physical lanes and optical OTSi payload signals according to clauses 11.6.5 (*x*=1), 12.6.1 (*x*=2), 13.6.1 and 13.6.6 (*x*=4) of [ITU-T G.709.1]. - -In case $(4 \times x)$ equals *k* the process transparently connects its input to its output. - -![Block diagram of OTSiG/FlexO-x-GCM-RS_A_So processes showing data flow from FlexO-x_CP and SK_COMMS_CP through various processing stages including MFAS insertion, FlexOsec processes, interleaving, mapping, scrambling, alignment insertion, FEC encoding, and symbol distribution to physical lanes.](ca29ffd592187cc2b1719b98a5417521_img.jpg) - -The diagram illustrates the OTSiG/FlexO-x-GCM-RS\_A\_So processes. At the top, **FlexO-x\_CP** provides inputs $CI\_CK$ , $CI\_D[1]$ , $CI\_FS$ , and $CI\_MFS$ to multiple **MFAS insertion** blocks. These blocks output $CK$ , $D^1$ , $FS$ , and $MFS$ to **FlexOsec processes**. **SK\_COMMS\_CP** provides $CI\_CK$ and $CI\_D$ to a **COMMS clock generation** block, which outputs $CK_{COM}$ . A **FlexO-x clock gen. ( $\times x$ )** block also outputs $CK_{COM}$ and $D_{COM}$ to an **Insert KCC** block. The **FlexOsec processes** receive $SKI\_Key[0,1,2,3]$ , $SKI\_KI$ , and $SKI\_IV\_Fixed\_ID$ and output $D_{sec1}$ , $FS$ , and $D_{sec2}$ to an **Interleaving** block. The **Interleaving** block outputs $CK$ , $D$ , and $FS$ to a **Mapping** block. A **FlexO-x-RS clock generation ( $\times 544/514$ )** block outputs $CK_{RS}$ to the **Mapping**, **Scrambler**, **Alignment insertion**, and **FEC encoder** blocks. The **Mapping** block outputs $D$ and $FS$ to the **Scrambler**, which outputs $D$ and $FS$ to the **Alignment insertion**, which outputs $D$ and $FS$ to the **FEC encoder**, which outputs $D$ and $FS$ to a **Symbol distribution** block. The **Symbol distribution** block outputs $1$ , $(4x/k)$ , $4x(k-1)/k+1$ , and $(4x)$ to **(4x) logical lanes**. These lanes are distributed across **Physical lane** blocks, each containing a **(4x/k):1 bit interleaver**. The outputs of the interleavers are $1$ and $(4x/k)$ to **$k$ physical lanes**. The physical lanes are labeled **AI\_PLD** and **OTSi\_AP[1]** through **OTSi\_AP[k]**. A list of FOIC standards is provided at the bottom left: FOIC1.4-RS ( $x = 1, k = 4$ ), FOIC1.1-RS ( $x = 1, k = 1$ ), FOIC2.4-RS ( $x = 2, k = 4$ ), FOIC4.8-RS ( $x = 4, k = 8$ ), and FOIC4.4-RS ( $x = 4, k = 4$ ). The diagram is labeled G.798(23)\_F16-19. - -Block diagram of OTSiG/FlexO-x-GCM-RS\_A\_So processes showing data flow from FlexO-x\_CP and SK\_COMMS\_CP through various processing stages including MFAS insertion, FlexOsec processes, interleaving, mapping, scrambling, alignment insertion, FEC encoding, and symbol distribution to physical lanes. - -OTSiG/FlexO-x-GCM-RS\_A\_So\_SKP - -Figure 16-19 – OTSiG/FlexO-x-GCM-RS\_A\_So processes - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -### 16.8.2 OTSiG to FlexO-x-RS adaptation sink function (OTSiG/FlexO-x-RS\_A\_Sk) - -The information flow and processing of the OTSiG/FlexO-x-RS\_A\_Sk and OTSiG/FlexO-x-GCM-RS\_A\_Sk functions is defined with reference to Figures 16-20 and 16-21. - -#### Symbol - -![Diagram showing the symbols for OTSiG/FlexO-x-RS_A_Sk and OTSiG/FlexO-x-GCM-RS_A_Sk functions.](56a00f931e8602f822917af7fa379c0d_img.jpg) - -The diagram illustrates two functional blocks representing adaptation sink functions. - -**Top Block: OTSiG/FlexO-x-RS** - -- A central trapezoidal block labeled **OTSiG/FlexO-x-RS**. -- An input arrow labeled **OTSiG/FlexO-x-RS\_A\_Sk\_MP** enters from the left. -- An output arrow labeled **FlexO-x\_CP** exits from the top. -- Multiple input arrows labeled **OTSi\_AP[1]**, **OTSi\_AP[k]**, and **OTSiG-O\_AP** enter from the bottom. A dashed oval with arrows indicates a series of inputs from 1 to k. - -**Bottom Block: OTSiG/FlexO-x-GCM-RS** - -- A central trapezoidal block labeled **OTSiG/FlexO-x-GCM-RS**. -- An input arrow labeled **OTSiG/FlexO-x-GCM-RS\_A\_Sk\_MP** enters from the left. -- An output arrow labeled **FlexO-x\_CP** exits from the top. -- An output arrow labeled **SK\_COMMS\_CP** exits from the top right. -- An input arrow labeled **OTSiG/FlexO-x-GCM-RS\_A\_Sk\_SKP** enters from the right. -- Multiple input arrows labeled **OTSi\_AP[1]**, **OTSi\_AP[k]**, and **OTSiG-O\_AP** enter from the bottom. A dashed oval with arrows indicates a series of inputs from 1 to k. - -G.798(17)-Amd.4(22)\_F16-20 - -Diagram showing the symbols for OTSiG/FlexO-x-RS\_A\_Sk and OTSiG/FlexO-x-GCM-RS\_A\_Sk functions. - -**Figure 16-20 – OTSiG/FlexO-x-RS\_A\_Sk and OTSiG/FlexO-x-GCM-RS\_A\_Sk functions** - -## Interfaces - -**Table 16-16 – OTSiG/FlexO-*x*-RS\_A\_Sk inputs and outputs** - -| Input(s) | Output(s) | -|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| per OTSi_AP:
OTSi_AI_PLD
OTSiG-O_AP:
OTSiA_AI_TSF-O
OTSiA_AI_TSF-P
OTSiG/FlexO-x-RS_A_Sk_MP:
OTSiG/FlexO- x -RS_A_Sk_MI_1second
OTSiG/FlexO- x -RS_A_Sk_MI_SquelchEn (Note)
OTSiG/FlexO-x-GCM-RS_A_Sk_SKP: (Note)
OTSiG/FlexO- x -GCM-
RS_A_Sk_SKI_Key[0,1,2,3]
OTSiG/FlexO- x -GCM-
RS_A_Sk_SKI_IV_Fixed_ID | FlexO-x_CP:
FlexO- x _CI_CK
FlexO- x _CI_D[1.. x ]
FlexO- x _CI_FS
FlexO- x _CI_MFS
FlexO- x _CI_SSF
OTSiG/FlexO-x-RS_A_Sk_MP:
OTSiG/FlexO- x -RS_A_Sk_AcCST (Note)
OTSiG/FlexO- x -RS_A_Sk_MI_cLOS-P
OTSiG/FlexO- x -RS_A_Sk_MI_cLOL
OTSiG/FlexO- x -RS_A_Sk_MI_cLOF
OTSiG/FlexO- x -RS_A_Sk_MI_cLOM
OTSiG/FlexO- x -RS_A_Sk_MI_cCSTM (Note)
OTSiG/FlexO- x -RS_A_Sk_MI_cUnlockSec (Note)
OTSiG/FlexO- x -RS_A_Sk_MI_pFECcorrErr
OTSiG/FlexO- x -RS_A_Sk_MI_pAuthCheckErr (Note)
OTSiG/FlexO-x-GCM-RS_A_Sk_SKP: (Note)
OTSiG/FlexO- x -GCM-RS_A_Sk_SKI_AcKI
SK_COMMS_CP: (Note)
SK_COMMS_CI_D
SK_COMMS_CI_CK | -| NOTE – For OTSiG/FlexO- x -GCM-RS_A_Sk only. | | - -## Processes - -The processes associated with the OTSiG/FlexO-*x*-RS\_A\_Sk function are as depicted in Figure 16-21.1 (*x*=1) and Figure 16-21.2 (*x*=2,4). - -**Lane Clock Recovery:** The process shall recover the clock of the FOIC*x.k*-RS lane signal from the incoming data. The function shall introduce no errors in case of jitter and wander, as defined in [ITU-T G.8251]. - -### Bit de-interleaver: - -The bit de-interleaver process bit de-multiplexes each of the *k* FOIC*x.k*-RS physical lanes into (4×*x*)/*k* logical lanes of the (4×*x*) logical lanes of the FlexO-*x*-RS signal according to clauses 11.6.5 (*x*=1), 12.6.1 (*x*=2), 13.6.1 and 13.6.6 (*x*=4) of [ITU-T G.709.1]. - -In case (4×*x*) equals *k* the process transparently connects its inputs to its outputs. - -**Alignment lock:** The function shall recover the FOIC*x.k* logical lane frame start (1/(4×*x*) of FlexO-*x*-RS frame) through obtaining LOCK to the alignment markers as specified by the FEC synchronization state diagram in clause 91.5.3.1 of [IEEE 802.3] for FOIC1.4 or in clause 119.2.5.1 of [IEEE 802.3] for FOIC2.8 or FOIC4.16. The specific alignment marker to be locked shall be CM0 to CM5 (48 bits) per frame as specified in clause 9.1.1, 9.1.3 or 9.1.5 of [ITU-T G.709.1] while the distance between alignment markers (counted by amp\_counter) shall correspond to 128, 256 or 512 FEC codewords as specified in clause 11.1, 12.1 or 13.1 of [ITU-T G.709.1] for FlexO-1-RS, - -FlexO-2-RS or FlexO-4-RS respectively. Additionally, the synchronization process on all logical lanes shall be restarted (restart\_lock set to true) if five consecutive alignment markers fail to match on any of the logical lanes. - -**Deskew & Reorder:** The function shall include deskewing and reordering processes. The deskewing process shall remove the skew of all $(4 \times x)$ FOICx.k logical lanes as specified by the FEC alignment state diagram in clause 91.5.3.1 of [IEEE 802.3] for FOIC1.4 or in clause 119.2.5.1 of [IEEE 802.3] for FOIC2.8 or FOIC4.16. It shall support a maximum skew of 180 ns between logical lanes and a maximum skew variation of 4 ns. The reordering process shall reorder these $(4 \times x)$ FOICx.k logical lanes according to their lane number (see clause 9.1.1, 9.1.3 or 9.1.5 of [ITU-T G.709.1] for FOIC1.4, FOIC2.8 or FOIC4.16 respectively). The FOICx.k lane number is identified by six 8-bit unique markers from the UMx area. - -**Recombination:** The function shall multiplex the aligned and ordered $(4 \times x)$ FOICx.k logical lanes into the original stream of FEC codewords and reconstruct the FlexO-x-RS frame. - -**FEC Decoder:** See clause 8.5.5. - -**Descrambler:** The function shall perform descrambling for FlexO-x-RS frame payload, fixed stuffing, basic overhead and extended overhead area as described in clause 11.4, 12.4 or 13.4 of [ITU-T G.709.1] for 100G FlexO-1-RS ( $x=1$ ), 200G FlexO-2-RS ( $x=2$ ) or 400G FlexO-4-RS ( $x=4$ ) respectively. - -**Demapping:** The function shall demap (i.e., removal of FEC parity area) the FlexO-x frame from the incoming FlexO-x-RS frame as defined in clause 11.1, 12.1 or 13.1 of [ITU-T G.709.1] for 100G FlexO-1-RS ( $x=1$ ), 200G FlexO-2-RS ( $x=2$ ) or 400G FlexO-4-RS ( $x=4$ ), respectively. - -**Extract and replace KCC:** For OTSiG/FlexO-x-GCM-RS\_A\_Sk the in-band key exchange communication channel (KCC) is optional. When used, the function shall extract the KCC data (SK\_COMMS\_CI\_D) from the FlexOsec KCC overhead field of the first FlexO instance frame of the FlexO-x as described in clause 9.2.8 of [ITU-T G.709.1]. The bit rate of the KCC data is defined by the outgoing KCC clock. The function shall generate the KCC clock (SK\_COMMS\_CI\_CK) by dividing the FlexO-x clock by a factor of 82240. After extraction, the KCC byte in the FlexOsec overhead is replaced with value 0x00 at the input of the FlexOsec sink processes. - -For OTSiG/FlexO-x-RS\_A\_Sk this process is not present. - -**FlexOsec processes:** For OTSiG/FlexO-x-GCM-RS\_A\_Sk see clause 8.14.2 and clause 8.14.3.1 for the specific GCM-AES-256 decryption and authentication processes with the cipher suite type (CST) code point value 000001, as defined in clause B.1 of [ITU-T G.709.1]. The FlexOsec decryption and authentication processes are performed for each individual FlexO instance frame signal in parallel, after deinterleaving from FlexO-x. The same management information (MI) input from the EMF and Secure Key Information (SKI) input from the key exchange and agreement functions are shared by the $x$ sets of FlexOsec processes. The same sets of keys are configured to be used by the $x$ sets of FlexOsec sink processes. - -For OTSiG/FlexO-x-RS\_A\_Sk this process is not present. - -**De-interleaving:** See clause 8.13.2. - -**Multiframe alignment:** The process shall recover the FlexO multi-frame start as described in clause 8.2.2. - -![Figure 16-21 – OTSiG/FlexO-x-GCM-RS_A_Sk processes. This is a complex block diagram showing the signal processing flow for OTSiG/FlexO-x-GCM-RS_A_Sk. At the bottom, multiple physical lanes (k physical lanes) are shown. Each lane has a 'Clock recovery' block followed by a 'LOS detection' block, which outputs dLOS-P[i]. Above this, there are '(4x/k) bit deinterleaver' blocks. The next stage is 'Alignment lock' blocks, which take inputs from the deinterleavers and produce 'restart_lock[i]' and 'restart' signals. These are followed by 'Deskew' and 'Lane reorder and recombination' blocks. The signal then passes through a 'FEC decoder', 'Descrambler', and 'Demapping' blocks. Above these are 'De-interleaving' blocks. The next major stage consists of 'FlexOsec processes' (labeled 1, 2, ..., x). Each process takes inputs from the de-interleaving stage and produces 'AuthCheckErr[i]', 'dUnlockSec[i]', 'AcCST[i]', 'SKI_AcKI[i]', and 'dLOM[i]'. These are followed by 'Multiframe alignment' blocks, which produce 'dLOM[i]'. At the top, there are 'Consequent actions' blocks that take inputs from the multiframe alignment and produce 'dCSTM', 'dLOL', 'dUnlockSec[1..x]', and 'dLOM[1..x]'. Various other signals like 'CK', 'D', 'FS', 'MI_SquelchEn', 'MI_AcCST[1..x]', 'MI_pAuthcheckErr', 'MI_1second', 'MI_pFECorrErr', 'MI_cCSTM', 'MI_cUnlockSec', 'MI_cLOM', 'MI_cLOL', 'MI_cLOS-P', 'aSSF', and 'SKI_Key[0, 1, 2, 3]' are shown throughout the diagram. On the right side, there are labels for 'OTSiG/FlexO-x-GCM-RS_A_Sk_SKP' and 'OTSiG/FlexO-x-RS_A_Sk_MP'. At the bottom right, there is a list of FOIC configurations: FOIC1.4-RS (x = 1, k = 4), FOIC1.1-RS (x = 1, k = 1), FOIC2.4-RS (x = 2, k = 4), FOIC4.8-RS (x = 4, k = 8), and FOIC4.4-RS (x = 4, k = 4).](51b3f989269d40b52bbf69c7a448bf52_img.jpg) - -Figure 16-21 – OTSiG/FlexO-x-GCM-RS\_A\_Sk processes. This is a complex block diagram showing the signal processing flow for OTSiG/FlexO-x-GCM-RS\_A\_Sk. At the bottom, multiple physical lanes (k physical lanes) are shown. Each lane has a 'Clock recovery' block followed by a 'LOS detection' block, which outputs dLOS-P[i]. Above this, there are '(4x/k) bit deinterleaver' blocks. The next stage is 'Alignment lock' blocks, which take inputs from the deinterleavers and produce 'restart\_lock[i]' and 'restart' signals. These are followed by 'Deskew' and 'Lane reorder and recombination' blocks. The signal then passes through a 'FEC decoder', 'Descrambler', and 'Demapping' blocks. Above these are 'De-interleaving' blocks. The next major stage consists of 'FlexOsec processes' (labeled 1, 2, ..., x). Each process takes inputs from the de-interleaving stage and produces 'AuthCheckErr[i]', 'dUnlockSec[i]', 'AcCST[i]', 'SKI\_AcKI[i]', and 'dLOM[i]'. These are followed by 'Multiframe alignment' blocks, which produce 'dLOM[i]'. At the top, there are 'Consequent actions' blocks that take inputs from the multiframe alignment and produce 'dCSTM', 'dLOL', 'dUnlockSec[1..x]', and 'dLOM[1..x]'. Various other signals like 'CK', 'D', 'FS', 'MI\_SquelchEn', 'MI\_AcCST[1..x]', 'MI\_pAuthcheckErr', 'MI\_1second', 'MI\_pFECorrErr', 'MI\_cCSTM', 'MI\_cUnlockSec', 'MI\_cLOM', 'MI\_cLOL', 'MI\_cLOS-P', 'aSSF', and 'SKI\_Key[0, 1, 2, 3]' are shown throughout the diagram. On the right side, there are labels for 'OTSiG/FlexO-x-GCM-RS\_A\_Sk\_SKP' and 'OTSiG/FlexO-x-RS\_A\_Sk\_MP'. At the bottom right, there is a list of FOIC configurations: FOIC1.4-RS (x = 1, k = 4), FOIC1.1-RS (x = 1, k = 1), FOIC2.4-RS (x = 2, k = 4), FOIC4.8-RS (x = 4, k = 8), and FOIC4.4-RS (x = 4, k = 4). - -**Figure 16-21 – OTSiG/FlexO-x-GCM-RS\_A\_Sk processes** - -## Defects - -The function shall detect dLOS-P[1..k], dLOL, dCSTM, dUnlockSec[1..x] and dLOM[1..x]. - -**dLOS-P[i]:** See clause 6.2.1.2. - -**dLOL:** dLOL is generated for multilane interfaces based on the FEC alignment state diagram in clause 91.5.3.1 of [IEEE 802.3] for FOIC1.4 or on the PCS synchronization state diagram in clause 119.2.5.1 of [IEEE 802.3] for FOIC2.8 or FOIC4.16. dLOL shall be declared if fec\_alignment\_valid is false for 3 ms. To provide for the case of intermittent out-of-locks - -(fec\_alignment\_valid is false), the integrating timer shall not be reset to zero until an in-lock (fec\_alignment\_valid is true) condition persists continuously for 3 ms. dLOL shall be cleared if fec\_alignment\_valid is true for 3 ms. - -NOTE – The hi\_ser variable shall be assumed to be zero in the PCS synchronization state diagram of clause 119.2.5.1 of [IEEE 802.3] because the FEC\_bypass\_indication\_enable is always set to zero in the case of OTN. - -**dCSTM:** For OTSiG/FlexO-x-GCM-RS\_A\_Sk see clause 6.2.11. The expected cipher suite type is "0000 0001". For OTSiG/FlexO-x-RS\_A\_Sk dCSTM is assumed to be false. - -Per FlexO instance #j detection (j = 1..x): - -**dLOM[j]:** See clause 6.2.5.2. - -**dUnlockSec[j]:** For OTSiG/FlexO-x-GCM-RS\_A\_Sk see clause 6.2.7.2.1; for OTSiG/FlexO-x-RS\_A\_Sk dUnlockSec[j] is assumed to be false. - -#### Consequent actions - -aSSF $\leftarrow \sum dLOM[j]$ or $\sum dUnlockSec[j]$ or dCSTM or $\sum dLOS-P[i]$ or dLOL or AI\_TSF-P - -#### Defect correlations - -cLOS-P $\leftarrow \sum dLOS-P[i]$ and (not AI\_TSF-P) - -cLOL $\leftarrow dLOL$ and (not $\sum dLOS-P[i]$ ) and (not AI\_TSF-P) - -cCSTM $\leftarrow dCSTM$ and (not dLOL) and (not AI\_TSF-P) - -cUnlockSec $\leftarrow \sum dUnlockSec[j]$ and (not dCSTM) and (not dLOL) and (not AI\_TSF-P) - -cLOM $\leftarrow \sum dLOM[j]$ and (not dCSTM) and (not dLOL) and (not AI\_TSF-P) - -#### Performance monitoring - -The function shall perform the following performance monitoring primitives processing. The performance monitoring primitives shall be reported to the equipment management function (EMF). - -pFECcorrErr $\leftarrow \sum nFECcorrErr$ - -For OTSiG/FlexO-x-GCM-RS\_A\_Sk only: - -pAuthcheckErr $\leftarrow \sum AuthcheckErr$ - -NOTE – During AI\_TSF-P and dLOL, no corrected bits or authentication failure shall be counted. - -### 16.9 OTSi to OSC adaptation function (OTSi/OSC\_A) - -The OTSi to OSC adaptation functions perform the adaptation between the OTSi layer adapted information and the characteristic information of functionally standardized OSC layer signal. - -#### 16.9.1 OTSi to OSC adaptation source function (OTSi/OSC\_A\_So) - -The information flow and processing of the OTSi/OSC\_A\_So function is defined with reference to Figure 16-22. - -## Symbol - -![Symbol diagram for OTSi/OSC_A_So function. It shows a trapezoidal block labeled 'OTSi/OSC'. An arrow labeled 'OSC_CP' points into the top of the block, and an arrow labeled 'OTSi_AP' points out from the bottom. The diagram is labeled G.798(17)_F16-22.](5cb3b242ac7ea1fa7007ebd51b80e5b9_img.jpg) - -Symbol diagram for OTSi/OSC\_A\_So function. It shows a trapezoidal block labeled 'OTSi/OSC'. An arrow labeled 'OSC\_CP' points into the top of the block, and an arrow labeled 'OTSi\_AP' points out from the bottom. The diagram is labeled G.798(17)\_F16-22. - -Figure 16-22 – OTSi/OSC\_A\_So function - -## Interfaces - -Table 16-17 – OTSi/OSC\_A\_So inputs and outputs - -| Input(s) | Output(s) | -|------------------------------------------|--------------------------------| -| OSC_CP:
OSC_CI_OH
OSC_CI_CK | OTSi_AP:
OTSi_AI_PLD | - -## Processes - -The OTSi/OSC\_A\_So function provides all processes necessary for the adaptation to the OTSi layer, which includes processes that ensure clock and frame recovery at the adaptation sink and optional forward error correction coding. - -The specific processes are outside the scope of this Recommendation. - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -### 16.9.2 OTSi to OSC adaptation sink function (OTSi/OSC\_A\_Sk) - -The OTSi/OSC\_A\_Sk detects the dLOS-O defectand counts during one-second periods defects to feed performance monitoring when connected. - -The information flow and processing of the OTSi/OSC\_A\_Sk function is defined with reference to Figure 16-23. - -## Symbol - -![Symbol diagram for OTSi/OSC_A_Sk function. It shows a trapezoidal block labeled 'OTSi/OSC'. An arrow labeled 'OTSi_AP' points into the bottom of the block, and an arrow labeled 'OSC_CP' points out from the top. A double-headed arrow labeled 'OTSi/OSC_A_Sk_MP' is connected to the left side of the block. The diagram is labeled G.798(17)_F16-23.](1ff7740e14c18789657d277030fb69ce_img.jpg) - -Symbol diagram for OTSi/OSC\_A\_Sk function. It shows a trapezoidal block labeled 'OTSi/OSC'. An arrow labeled 'OTSi\_AP' points into the bottom of the block, and an arrow labeled 'OSC\_CP' points out from the top. A double-headed arrow labeled 'OTSi/OSC\_A\_Sk\_MP' is connected to the left side of the block. The diagram is labeled G.798(17)\_F16-23. - -Figure 16-23 – OTSi/OSC\_A\_Sk function - -## Interfaces - -**Table 16-18 – OTSi/OSC\_A\_Sk inputs and outputs** - -| Input(s) | Output(s) | -|----------------------------------------------------------------------------------------|-------------------------------------------------------------------------------------------------------------------------------------------| -| OTSi_AP:
OTSi_AI_PLD
OTSi/OSC_A_Sk_MP:
OTSi/OSC_A_Sk_MI_1second | OSC_CP:
OSC_CI_OH
OSC_CI_CK
OSC_CI_SSF
OTSi/OSC_A_Sk_MP:
OTSi/OSC_A_Sk_MI_cLOS-O
OTSi/OSC_A_Sk_MI_pN_DS-O | - -## Processes - -The OTSi/OSC\_A\_Sk function provides all processes necessary for the adaptation from the OTSi layer, which includes processes for clock recovery. - -The specific processes are outside the scope of this Recommendation. - -## Defects - -The OTSi/OSC\_A\_Sk function shall detect the dLOS-O defect. - -**dLOS-O:** See clause 6.2.1.3. - -## Consequent actions - -The OTSi/OSC\_A\_Sk function shall perform the following consequent action: - -aSSF $\leftarrow$ dLOS-O - -## Defect correlations - -The OTSi/OSC\_A\_Sk function shall perform the following defect correlation: - -cLOS-O $\leftarrow$ dLOS-O - -## Performance monitoring - -The OTSi/OSC\_A\_Sk function shall perform the following performance monitoring primitives. The performance monitoring primitives shall be reported to the EMF. - -pN\_DS-O $\leftarrow$ dLOS-O - -## 17 Media element - -The optical transmission layer is described by media elements. Non-associated overhead (see clauses 9, 10, 11, and 12) provides management structure for the optical media layer. - -A media element operates on the envelope of any optical signals that are present in a media channel (e.g., amplify the signal, constrain or direct the media channel etc.) and is not aware of the information being carried. Media elements do not demodulate the signal and therefore do not process the digital information that is carried by the signal. - -A media element has N ports. An optical signal that is present at a port may be transferred to 0 or more other ports on the media element. - -- Each pair of ports that allow signal transfer has one or more media channels with a frequency slot (defined by m and n; see [ITU-T G.694.1]) for each media channel. - -- Each media channel has zero or more transfer parameters. The transfer parameters (the optical characteristics of the media channel) are defined in other Recommendations including for example [ITU-T G.663] and [ITU-T G.680]. - -The media channel and signal transfer are modelled independently for each direction of signal propagation. The internal structure of a media element is not visible, only the media channels between the ports are defined. - -The media element has a management port to allow exchange of management information with the equipment management function. - -To facilitate management of the optical network, non-associated overhead can be used with a media element to provide maintenance entities that can assist with fault isolation, management communications, and other OAM functions. The media element has a defect port that is used to communicate loss of signal information to the atomic functions that provide this management structure. - -### Internal signal monitors - -A media element may include an optical parameter monitor (OPM) function that monitors the bulk properties (e.g., power) of any of the optical signals that are present in a media channel. Depending on the frequency slot of the media channel the OPM may operate on for example an aggregated set of OTSi (e.g., the input to an optical line amplifier) or a single OTSi. The output of the OPM is an electrical signal that is quantized and encoded to a binary value that is proportional to the observed optical power. The mapping between the optical power and the binary values is vendor specific and is not subject to standardization. - -The OPM may be associated via an internal media channel with any of the externally visible ports, or it may monitor an OMS\_ME end point or an OTS\_ME end point that are implemented within the media element. Note that the OPM functions may be integrated into an optical amplifier. The location of the OMS and OTS are defined in [ITU-T G.872]. Appendix VII provides some examples of the case where the OMS and OTS end points are encapsulated within a media element. - -### Attachment of external signal monitors - -The ability to attach an external signal monitor to the optical signal that is present on a port of a media element is provided by an additional media channel (within the media element) from the subject port to another external port. - -### Symbol - -![Diagram of MediaElement function showing various ports and signal flow.](f4bcd6496e0add3544afc0a70f7973ec_img.jpg) - -The diagram illustrates the MediaElement function as a central grey rounded rectangle. It features several external connections: at the top, multiple bidirectional arrows represent OTSi\_AP (Optical Transport Signal Interface - Administrative Point) connections, indicated by an ellipsis between two arrows; on the right side, two single-headed arrows point outwards to ME\_MP (Media Element Management Point) and ME\_DP (Media Element Defect Point); at the bottom, a single bidirectional arrow represents the Optical signal input/output. The text 'G.798(17)\_F17-1' is located in the bottom right corner of the diagram area. - -Diagram of MediaElement function showing various ports and signal flow. - -Figure 17-1 – MediaElement function - -## Interfaces - -**Table 17-1 – MediaElement inputs and outputs** - -| Input(s) | Output(s) | -|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| MediaElement_MP:
ME_MI_configureMediaChannel(port j, port k, freqSlot, signalTransfer)
ME_MI_configureOPM(port j, freqSlot, threshold)

per OTSi_AP:
OTSi_AI_PLD | MediaElement_MP:
ME_MI_queryMediaChannel(port j, port k, freqSlot, signalTransfer)
ME_MI_OPM(port j, freqSlot, value)
ME_MI_dLOS-P[i]

per OTSi_AP:
OTSi_AI_PLD

MediaElement_DP:
ME_DI_dLOS-P[i] | - -## Processes - -The specific processes performed in a media element are outside the scope of this Recommendation. They are expressed in terms of the transfer function associated with each of the media channels within the media element. - -## Defects - -If the MediaElement function includes an OPM then each OPM *i* shall detect dLOS-P[*i*]. The presence of dLOS-P[*i*] is reported at either the Management Point (for communication with the equipment management function, in cases where there is no non-associated overhead) or the Defect Point (for communication with atomic functions related to non-associated overhead). - -**Consequent actions:** None. - -**Defect correlations:** None. - -## Performance monitoring - -The OPM may in addition to dLOS-P[*i*] may also provide an electrical signal that is quantized and encoded to a binary value that is proportional to the observed optical power. The mapping between the optical power and the binary values is vendor specific and is not subject to standardization. - -## Annex A - -### Optical section (OSx) and constant bit rate (CBRx) layer functions - -(This annex forms an integral part of this Recommendation.) - -#### Introduction - -The OSx and CBRx layer functions are not part of the OTN. They are defined in this Recommendation in order to provide transparent transport of constant bit rate (CBR) signals over the OTN. The CBR signal is mapped into the ODU (see clause 14.3). - -The parameter x defines the supported bit rate or bit-rate range. The values x = 2G5, 10G and 40G are defined for client signals that correspond to the SDH bit rates defined in Table A.1. The values x = FC-100, FC-200, FC-400, FC-800, FC-1200, FC-1600 and FC-3200 are defined for client signals that comply to the Fibre Channel bit rates as defined in Table A.1A. Support for other bit rates and bit-rate ranges are for further study. - -**Table A.1 – Defined values for x (SDH)** - -| OS type | x | Bit rate | Clock range | -|-------------------|-----|--------------------------------|-----------------------------| -| OS16 | 2G5 | 2 488 320 kbit/s $\pm$ 20 ppm | 2 488 320 kHz $\pm$ 20 ppm | -| OS64 | 10G | 9 953 280 kbit/s $\pm$ 20 ppm | 9 953 280 kHz $\pm$ 20 ppm | -| OS256 or OSM256.4 | 40G | 39 813 120 kbit/s $\pm$ 20 ppm | 39 813 120 kHz $\pm$ 20 ppm | - -**Table A.1A – Defined values for x (fibre channel)** - -| x | Bit rate | Clock range | Jitter standard | -|---------|---------------------------------|---------------------------------|---------------------| -| FC-100 | 1 062 500 kbit/s $\pm$ 100 ppm | 1 062 500 kbit/s $\pm$ 100 ppm | [b-ANSI INCITS 352] | -| FC-200 | 2 125 000 kbit/s $\pm$ 100 ppm | 2 125 000 kbit/s $\pm$ 100 ppm | [b-ANSI INCITS 352] | -| FC-400 | 4 250 000 kbit/s $\pm$ 100 ppm | 4 250 000 kbit/s $\pm$ 100 ppm | [b-ANSI INCITS 352] | -| FC-800 | 8 500 000 kbit/s $\pm$ 100 ppm | 8 500 000 kbit/s $\pm$ 100 ppm | [b-ANSI INCITS 352] | -| FC-1200 | 10 518 750 kbit/s $\pm$ 100 ppm | 10 518 750 kbit/s $\pm$ 100 ppm | [b-ANSI INCITS 364] | -| FC-1600 | 14 025 000 kbit/s $\pm$ 100 ppm | 14 025 000 kbit/s $\pm$ 100 ppm | [b-ANSI INCITS 352] | -| FC-3200 | 28 050 000 kbit/s $\pm$ 100 ppm | 28 050 000 kbit/s $\pm$ 100 ppm | [b-INCITS 512] | - -**Table A.1B – Jitter standard and replacement signals (fibre channel)** - -| x | Jitter standard | Replacement signal | FEC | -|---------|---------------------|---------------------------|------------------------------| -| FC-100 | [b-ANSI INCITS 352] | 17.7.1.2 of [ITU-T G.709] | None | -| FC-200 | [b-ANSI INCITS 352] | 17.7.2.1 of [ITU-T G.709] | None | -| FC-400 | [b-ANSI INCITS 352] | 17.9.1 of [ITU-T G.709] | None | -| FC-800 | [b-ANSI INCITS 352] | 17.9.1 of [ITU-T G.709] | None | -| FC-1200 | [b-ANSI INCITS 364] | 17.8.2 of [ITU-T G.709] | None | -| FC-1600 | [b-ANSI INCITS 352] | 17.9.2 of [ITU-T G.709] | Optional [b-ANSI INCITS 470] | -| FC-3200 | [b-INCITS 512] | 17.9.3 of [ITU-T G.709] | Mandatory [b-INCITS 488] | - -NOTE – FC-y is used throughout this clause as shorthand for the defined values for x for fibre channel type interfaces. - -Figure A.1 illustrates the OSx layer network and CBRx layer adaptation functions. The OSx layer network represents physical optical interface for constant bit-rate signals. The information crossing the OSx termination connection point (OSx\_TCP) is referred to as the OSx characteristic information (OSx\_CI). The information crossing the OSx access point (OSx\_AP) is referred to as the OSx adapted information (OSx\_AI). - -![Diagram of OSx layer network and client layer adaptation functions](5b9a924d48ea39458bd16a3c89a576d5_img.jpg) - -The diagram shows a vertical stack of components. At the top is 'CBRx\_CP'. Below it is a trapezoidal block labeled 'OSx/CBRx'. Below that is a double-headed vertical arrow labeled 'OSx\_AP'. Below that is a trapezoidal block labeled 'OSx'. Below that is another double-headed vertical arrow labeled 'OSx\_TCP'. At the bottom is the text 'G.798(12)\_FA.1'. - -Diagram of OSx layer network and client layer adaptation functions - -Figure A.1 – OSx layer network and client layer adaptation functions - -#### A.1 Connection functions - -Not applicable. - -#### A.2 Termination functions - -##### A.2.1 OSx trail termination function (OSx\_TT) (x = 2G5, 10G, 40G, FC-y) - -The OSx\_TT functions are responsible for the end-to-end supervision of the OSx trail. Figure A.2 shows the combination of the unidirectional sink and source functions to form a bidirectional function. - -NOTE – For the case where an STM-N signal is to be transported as a CBR signal, the OSx\_TT functions are equivalent to the OSn\_TT or OSMn.m\_TT functions specified in [ITU-T G.783]. - -![Diagram of OSx_TT functions](df1e7f3029a414245762364710a6a63e_img.jpg) - -The diagram shows two separate vertical paths. The left path starts with 'OSx\_AP' at the top, a downward arrow to a trapezoidal block labeled 'OSx', and a downward arrow to 'OSx\_TCP' at the bottom. The right path starts with 'OSx\_TCP' at the bottom, an upward arrow to a trapezoidal block labeled 'OSx', and an upward arrow to 'OSx\_AP' at the top. Below the right path is the text 'G.798(12)\_FA.2'. - -Diagram of OSx\_TT functions - -Figure A.2 – OSx\_TT - -##### A.2.1.1 OS trail termination source function (OSx\_TT\_So) (x = 2G5, 10G, 40G, FC-y) - -The information flow and processing of the OSx\_TT\_So function is defined with reference to Figures A.3 and A.4. The OSx\_TT\_So generates an optical signal. The physical parameters of the signal depend on the application. For SDH OSn type interfaces, the specifications in [ITU-T G.957] or [ITU-T G.691] apply. For SDH OSM256.4 type interfaces, [ITU-T G.783] clause 9.2.3 and the specifications in [ITU-T G.695] apply. - -## Symbol - -![Figure A.3: OSx_TT_So function symbol. A triangle labeled OSx has three input arrows from the top (OSx_AP), left (OSx_RP), and right (OSx_TT_So_MP). It has one output arrow pointing downwards (OSx_TCP). The diagram is labeled G.798(12)_FA.3.](5817c9e42aa8e99964a2845d4adee0d0_img.jpg) - -Figure A.3: OSx\_TT\_So function symbol. A triangle labeled OSx has three input arrows from the top (OSx\_AP), left (OSx\_RP), and right (OSx\_TT\_So\_MP). It has one output arrow pointing downwards (OSx\_TCP). The diagram is labeled G.798(12)\_FA.3. - -Figure A.3 – OSx\_TT\_So function - -## Interfaces - -Table A.2 – OSx\_TT\_So inputs and outputs - -| Input(s) | Output(s) | -|-------------------------------------------------------------------------------------------------------------------------------------|---------------------------| -| OSx_AP:
OSx_AI_D
OSx_RP:
OSx_RI_APR (Note 1)
OSx_TT_So_MP:
OSx_TT_So_MI_APRCtrl (Notes 1 and 2) | OSx_TCP:
OSx_CI | -| NOTE 1 – If APR is required. | | -| NOTE 2 – The APRCtrl commands depend on the specific APR process. | | - -## Processes - -The processes associated with the OSx\_TT\_So function are depicted in Figure A.4. - -**Automatic power reduction (APR):** For eye safety considerations, according to [IEC 60825-1] and [IEC 60825-2], it may be necessary to provide for a capability for automatic (optical) power reduction (APR) in case of loss of the optical input signal at the sink function. The OSx\_TT\_So performs in this case the power reduction for the outgoing OSx signal based on the trigger criteria from the sink (RI\_APR) and control information (MI\_APRCtrl). The specific APR procedures and trigger criteria are outside the scope of this Recommendation. Clause 6.2 of [ITU-T G.664] provides basic requirements for APR. - -![Figure A.4: OSx_TT_So processes diagram. A large rectangle contains a dashed box labeled 'APR process'. Inputs include OSx_AP (with sub-input AI_D) from the top, MI_APRCtrl and RI_APR from the right, and OSx_RP from the bottom right. The output is OSx_TCP (with sub-output CI) at the bottom. The diagram is labeled G.798(12)_FA.4.](97f616c98c1526454f9a6c183492b2b5_img.jpg) - -Figure A.4: OSx\_TT\_So processes diagram. A large rectangle contains a dashed box labeled 'APR process'. Inputs include OSx\_AP (with sub-input AI\_D) from the top, MI\_APRCtrl and RI\_APR from the right, and OSx\_RP from the bottom right. The output is OSx\_TCP (with sub-output CI) at the bottom. The diagram is labeled G.798(12)\_FA.4. - -Figure A.4 – OSx\_TT\_So processes - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -#### A.2.1.2 OSx trail termination sink function (OSx\_TT\_Sk) (x = 2G5, 10G, 40G, FC-y) - -The information flow and processing of the OSx\_TT\_Sk function is defined with reference to Figures A.5 and A.6. The OSx\_TT\_Sk reports the state of the OSx trail. The OSx\_TT\_Sk accepts an optical signal. The physical parameters of the signal depend on the application. For SDH OSn type interfaces, the specifications in [ITU-T G.957] or [ITU-T G.691] apply. For SDH OSM256.4 type interfaces, [ITU-T G.783] clause 9.2.3 and the specifications in [ITU-T G.695] apply. - -##### Symbol - -![Symbol diagram for OSx_TT_Sk function. A central triangle labeled 'OSx' has an input arrow from the bottom labeled 'OSx_TCP'. It has three output arrows: one pointing up labeled 'OSx_AP', one pointing left labeled 'OSx_TT_Sk_MP', and one pointing right (dashed) labeled 'OSx_RP'. The diagram is labeled 'G.798(12)_FA.5' at the bottom right.](13df7f8b1a0bebbe3b52a35d9af93631_img.jpg) - -Symbol diagram for OSx\_TT\_Sk function. A central triangle labeled 'OSx' has an input arrow from the bottom labeled 'OSx\_TCP'. It has three output arrows: one pointing up labeled 'OSx\_AP', one pointing left labeled 'OSx\_TT\_Sk\_MP', and one pointing right (dashed) labeled 'OSx\_RP'. The diagram is labeled 'G.798(12)\_FA.5' at the bottom right. - -**Figure A.5 – OSx\_TT\_Sk function** - -##### Interfaces - -**Table A.3 – OSx\_TT\_Sk inputs and outputs** - -| Input(s) | Output(s) | -|----------------------------|----------------------------------------------------------------------------------------------------------------------------------------------------| -| OSx_TCP:
OSx_CI | OSx_AP:
OSx_AI_D
OSx_AI_TSF
OSx_RP:
OSx_RI_APR (Note)
OSx_TT_Sk_MP:
OSx_TT_Sk_MI_cLOS
OSx_TT_Sk_MI_pN_DS | -| NOTE – If APR is required. | | - -##### Processes - -The processes associated with the OSx\_TT\_Sk function are depicted in Figure A.6. - -**Automatic Power Reduction (APR):** For eye safety considerations, according to [IEC 60825-1] and [IEC 60825-2], it may be necessary to provide for a capability for automatic (optical) power reduction (APR) in case of loss of the optical input signal at the sink function. The OSx\_TT\_Sk generates in this case the APR trigger criteria based on the incoming OSx signal (OSx\_CI) and forwards it to the OSx\_TT\_So (RI\_APR). The specific APR procedures and trigger criteria are outside the scope of this Recommendation. Clause 6.2 of [ITU-T G.664] provides basic requirements for APR. - -![Diagram of OSx_TT_Sk processes showing internal components and their interactions with external interfaces.](fd6100880c96880a39d994338c9d5f36_img.jpg) - -The diagram illustrates the internal processes of the OSx\_TT\_Sk function. It is bounded by a grey rectangle labeled G.798(12)\_FA.6. Inside, there are several functional blocks: 'Defect correlations', 'Performance monitoring', 'Consequent actions', 'LOS supervision', and 'APR process' (dashed box). External interfaces and signals include OSx\_AP, AI\_TSF, AI\_D, OSx\_TT\_Sk\_MP, MI\_cLOS, MI\_pN\_DS, OSx\_RP, RI\_APR, and CI OSx\_TCP. Arrows indicate the flow of information: dLOS signals from 'Consequent actions', 'Defect correlations', and 'Performance monitoring' to 'aTSF' and 'LOS supervision'. 'aTSF' outputs to OSx\_AP and AI\_TSF. 'LOS supervision' outputs to dLOS and AI\_D. 'Performance monitoring' outputs to MI\_pN\_DS. 'Defect correlations' outputs to MI\_cLOS. 'APR process' outputs to RI\_APR. A dashed arrow points from 'Performance monitoring' to 'APR process'. - -Diagram of OSx\_TT\_Sk processes showing internal components and their interactions with external interfaces. - -**Figure A.6 – OSx\_TT\_Sk processes** - -### Defects - -The OSx\_TT\_Sk function shall detect the dLOS defect. - -**dLOS:** See clause 6.2.1.1 of [ITU-T G.783]. - -### Consequent actions - -The OSx\_TT\_Sk function shall perform the following consequent action: - -aTSF $\leftarrow$ dLOS - -### Defect correlations - -The OSx\_TT\_Sk function shall perform the following defect correlation: - -cLOS $\leftarrow$ dLOS - -### Performance monitoring - -The OSx\_TT\_Sk function shall perform the following performance monitoring primitive. The performance monitoring primitive shall be reported to the EMF. - -pN\_DS $\leftarrow$ dLOS - -## A.3 Adaptation functions - -### A.3.1 OSx to CBRx adaptation (OSx/CBRx\_A) (x = 2G5, 10G, 40G, FC-y) - -The OSx to CBRx adaptation functions perform the adaptation between the OSx layer adapted information and the characteristic information of a CBRx layer signal. - -#### A.3.1.1 OSx to CBRx adaptation source function without FEC (OSx/CBRx\_A\_So) (x = 2G5, 10G, 40G, FC-y) - -For SDH OSn type interfaces and fibre channel type interfaces, the information flow and processing of the OSx/CBRx\_A\_So function is defined with reference to Figures A.7 and A.8. - -NOTE – For SDH OSM256.4 type interfaces, please see A.3.1.3. - -## Symbol - -![Figure A.7: OSx/CBRx_A_So function symbol diagram. It shows a trapezoidal symbol labeled 'OSx/CBRx'. An arrow labeled 'CBRx_CP' points into the top of the symbol, and an arrow labeled 'OSx_AP' points out from the bottom. The text 'G.798(17)_FA.7' is located below the symbol.](04244205ef763574ac5ef2df0513c14d_img.jpg) - -Figure A.7: OSx/CBRx\_A\_So function symbol diagram. It shows a trapezoidal symbol labeled 'OSx/CBRx'. An arrow labeled 'CBRx\_CP' points into the top of the symbol, and an arrow labeled 'OSx\_AP' points out from the bottom. The text 'G.798(17)\_FA.7' is located below the symbol. - -Figure A.7 – OSx/CBRx\_A\_So function - -## Interfaces - -Table A.4 – OSx/CBRx\_A\_So inputs and outputs - -| Input(s) | Output(s) | -|--------------------------------------------|----------------------------| -| CBRx_CP:
CBRx_CI_D
CBRx_CI_CK | OSx_AP:
OSx_AI_D | - -## Processes - -The processes associated with the OSx/CBRx\_A\_So function are depicted in Figure A.8. - -**Mod (optical carrier modulation):** See clause 8.11. For parameters of SDH type interfaces, [ITU-T G.957] and [ITU-T G.691] apply. - -**Optical signal pre-conditioning:** Pre-conditioning of the single wavelength optical signal might be required. The specific conditioning processes depend on the OSx interface type (see [ITU-T G.957] and [ITU-T G.691] for SDH type interfaces). - -For SDH type interfaces, the jitter and wander requirements, as defined in clause 9.3.1.1 of [ITU-T G.783] apply. For fibre channel type interfaces, the input clock ranges are defined in Table A.1A and the jitter and wander requirements, as defined in the specifications referenced in Table A.1B, apply. - -![Figure A.8: OSx/CBRx_A_So processes diagram. It shows a grey rectangular box containing two sub-processes: 'Mod' (top) and 'Optical signal pre-conditioning' (bottom, enclosed in a dashed box). Inputs 'CBRx_CP', 'CI_D', and 'CI_CK' point into the 'Mod' process. An arrow points from 'Mod' to 'Optical signal pre-conditioning'. An arrow labeled 'AI_D' and 'OSx_AP' points out from the bottom of the 'Optical signal pre-conditioning' process. The text 'G.798(17)_FA.8' is located to the right of the box.](b98b6c7cbdaae63ffe90f117e507e81a_img.jpg) - -Figure A.8: OSx/CBRx\_A\_So processes diagram. It shows a grey rectangular box containing two sub-processes: 'Mod' (top) and 'Optical signal pre-conditioning' (bottom, enclosed in a dashed box). Inputs 'CBRx\_CP', 'CI\_D', and 'CI\_CK' point into the 'Mod' process. An arrow points from 'Mod' to 'Optical signal pre-conditioning'. An arrow labeled 'AI\_D' and 'OSx\_AP' points out from the bottom of the 'Optical signal pre-conditioning' process. The text 'G.798(17)\_FA.8' is located to the right of the box. - -Figure A.8 – OSx/CBRx\_A\_So processes - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -### A.3.1.2 OSx to CBRx adaptation sink function without FEC (OSx/CBRx\_A\_Sk) (x = 2G5, 10G, 40G, FC-y) - -For SDH OSn type interfaces and fibre channel type interfaces, the information flow and processing of the OSx/CBRx\_A\_Sk function is defined with reference to Figures A.9 and A.10. - -NOTE – For SDH OSM256.4 type interfaces, please see clause A.3.1.4. - -#### Symbol - -![Diagram of the OSx/CBRx_A_Sk function symbol. It shows a trapezoidal block labeled 'OSx/CBRx'. An arrow labeled 'OSx_AP' points into the block from below. An arrow labeled 'CBRx_CP' points out of the block from the top. The diagram is labeled 'G.798(17)_FA.9' at the bottom right.](a815ab84d8edcfc7061d7e8456ac7013_img.jpg) - -Diagram of the OSx/CBRx\_A\_Sk function symbol. It shows a trapezoidal block labeled 'OSx/CBRx'. An arrow labeled 'OSx\_AP' points into the block from below. An arrow labeled 'CBRx\_CP' points out of the block from the top. The diagram is labeled 'G.798(17)\_FA.9' at the bottom right. - -Figure A.9 – OSx/CBRx\_A\_Sk function - -#### Interfaces - -Table A.5 – OSx/CBRx\_A\_Sk inputs and outputs - -| Input(s) | Output(s) | -|------------------------------------------|-----------------------------------------------------------| -| OSx_AP:
OSx_AI_D
OSx_AI_TSF | CBRx_CP:
CBRx_CI_D
CBRx_CI_CK
CBRx_CI_SSF | - -#### Processes - -The processes associated with the OSx/CBRx\_A\_Sk function are depicted in Figure A.10. - -**Optical signal post-conditioning:** Post-conditioning of the single wavelength signal might be required. The specific conditioning processes depend on the OSx interface type (see [ITU-T G.957] and [ITU-T G.691] for SDH type interfaces). - -**DMod (optical carrier demodulation):** See clause 8.11. For parameters of SDH type interfaces, [ITU-T G.957] and [ITU-T G.691] apply. - -**Clock recovery:** The function shall recover the clock signal from the incoming data. For SDH type interfaces, the input clock ranges are defined in Table A.1 and the jitter and wander requirements, as defined in clause 9.3.1.2 of [ITU-T G.783], apply. For fibre channel type interfaces, the input clock ranges are defined in Table A.1A and the jitter and wander requirements, as defined in the specifications referenced in Table A.1B, apply. - -To ensure adequate immunity against the presence of consecutive identical digits (CID) in the signal, the function shall comply with the specification in clause 15.1.4 of [ITU-T G.783] for SDH type interfaces. - -![Figure A.10: OSx/CBRx_A_Sk processes diagram. A grey box labeled 'OSx_AP' contains several components. At the bottom, 'AI_D' and 'AI_TSF' enter from below. 'AI_D' goes to 'Optical signal post-conditioning' (dashed box), which then connects to 'DMod', which connects to 'Clock recovery'. 'AI_TSF' enters from the right and connects to 'Clock recovery'. Above 'Clock recovery' is a 'Replacement signal generator' box. Three signals exit from the top of the box: 'CI_D', 'CI_CK', and 'CI_SSF'. The diagram is labeled 'G.798(17)_FA.10'.](228db097d546afebf934a1befb86a0a6_img.jpg) - -Figure A.10: OSx/CBRx\_A\_Sk processes diagram. A grey box labeled 'OSx\_AP' contains several components. At the bottom, 'AI\_D' and 'AI\_TSF' enter from below. 'AI\_D' goes to 'Optical signal post-conditioning' (dashed box), which then connects to 'DMod', which connects to 'Clock recovery'. 'AI\_TSF' enters from the right and connects to 'Clock recovery'. Above 'Clock recovery' is a 'Replacement signal generator' box. Three signals exit from the top of the box: 'CI\_D', 'CI\_CK', and 'CI\_SSF'. The diagram is labeled 'G.798(17)\_FA.10'. - -**Figure A.10 – OSx/CBRx\_A\_Sk processes** - -**Defects:** None. - -**Consequent actions** - -The OSx/CBRx\_A\_Sk function performs the following consequent actions. - -aSSF $\leftarrow$ AI\_TSF - -aAIS $\leftarrow$ AI\_TSF - -On declaration of aAIS, the function shall output a replacement signal as defined in clause 16.6 of [ITU-T G.709] for SDH type interfaces and in Table A.1B for fibre channel type interfaces within X ms. On clearing aAIS, the replacement signal shall be removed within Y ms, with normal data being output. The values for X and Y are for further study. - -The replacement signal clock start shall be independent from the incoming clock. For the defined values of x, the replacement signal clock has to be within the range defined in Table A.1 for SDH type interfaces and Table A.1A for fibre channel type interfaces. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -**A.3.1.3 OSM256.4 to CBRx adaptation source function** - -The information flow and processing of the OSM256.4/CBRx\_So function is defined with reference to Figures A.11 and A.12. This is a null function connecting the CBRx\_CP output signals to the corresponding OSM256.4\_AP input signals. - -**Symbol** - -![Figure A.11: OSM256.4/CBRx_So function diagram. A central trapezoidal block is labeled 'OSM256.4/CBRx'. An arrow labeled 'CBRx_CP' points into the top of the block. An arrow labeled 'OSM256.4_AP' points out from the bottom of the block. A horizontal arrow labeled 'OSM256.4/CBRx_A_So_MP' points out from the left side of the block. The diagram is labeled 'G.798(17)_FA.11'.](1cf7488717213a910c805cf83ee186ee_img.jpg) - -Figure A.11: OSM256.4/CBRx\_So function diagram. A central trapezoidal block is labeled 'OSM256.4/CBRx'. An arrow labeled 'CBRx\_CP' points into the top of the block. An arrow labeled 'OSM256.4\_AP' points out from the bottom of the block. A horizontal arrow labeled 'OSM256.4/CBRx\_A\_So\_MP' points out from the left side of the block. The diagram is labeled 'G.798(17)\_FA.11'. - -**Figure A.11 – OSM256.4/CBRx\_So function** - -## Interfaces - -**Table A.6 – OSM256.4/CBRx\_So inputs and outputs** - -| Input(s) | Output(s) | -|--------------------------------------------|-----------------------------------------------------------------------------------------------------------------------------------------| -| CBRx_CP:
CBRx_CI_D
CBRx_CI_CK | OSM256.4_AP:
OSM256.4_AI_D
OSM256.4_AI_CK
OSM256.4_AI_FS
OSM256.4/CBRx_A_So_MP:
OSM256.4/CBRx_A_So_MI_cLOF | - -## Processes - -The processes associated with the OSM256.4/CBRx\_So function are depicted in Figure A.12. - -![Figure A.12 – OSM256.4/CBRx_So processes. This block diagram shows the internal signal flow of the OSM256.4/CBRx_So function. Inputs CI_D and CI_CK enter the 'Frame alignment' block. The 'Frame alignment' block outputs dLOF and FS, and provides D and CK signals to the 'Replacement signal generator' and 'AIS insertion' blocks. The 'Replacement signal generator' outputs aAIS to the 'AIS insertion' block. The 'AIS insertion' block outputs AI_FS, AI_D, and AI_CK. The 'Defect correlations' block receives dLOF and outputs MI_cLOF. The 'Consequent actions' block receives dLOF and aAIS, and outputs AL_SSF. The entire process is labeled CBRx_CP at the top and OSM256.4_AP at the bottom. A vertical label on the right reads OSM256.4/CBRx_A_So_MP. A reference G.798(17)_FA.12 is noted at the bottom right.](2bb36c10542436112c2e54d97771bf32_img.jpg) - -Figure A.12 – OSM256.4/CBRx\_So processes. This block diagram shows the internal signal flow of the OSM256.4/CBRx\_So function. Inputs CI\_D and CI\_CK enter the 'Frame alignment' block. The 'Frame alignment' block outputs dLOF and FS, and provides D and CK signals to the 'Replacement signal generator' and 'AIS insertion' blocks. The 'Replacement signal generator' outputs aAIS to the 'AIS insertion' block. The 'AIS insertion' block outputs AI\_FS, AI\_D, and AI\_CK. The 'Defect correlations' block receives dLOF and outputs MI\_cLOF. The 'Consequent actions' block receives dLOF and aAIS, and outputs AL\_SSF. The entire process is labeled CBRx\_CP at the top and OSM256.4\_AP at the bottom. A vertical label on the right reads OSM256.4/CBRx\_A\_So\_MP. A reference G.798(17)\_FA.12 is noted at the bottom right. - -**Figure A.12 – OSM256.4/CBRx\_So processes** - -**Frame Alignment:** The function shall perform frame alignment on the STM-N frame as described in clause 8.2.1 of [ITU-T G.783]. The function is required before the signal can be output in a multi-lane, OSM256.4 format. - -### Defects - -The function shall detect dLOF. - -**dLOF:** See clause 6.2.5.1 of [ITU-T G.783]. - -### Consequent actions - -aAIS ← dLOF - -On declaration of aAIS, the function shall output a replacement signal as defined in clauses 17.2 and 17.9 of [ITU-T G.709] within two frames. On clearing of aAIS the replacement pattern/signal shall be removed within two frames and normal data being output. The replacement signal clock shall be independent from the incoming clock. The replacement signal clock has to be within the range specified by Table 14-9. Jitter and wander requirements, as defined in Annex A of [ITU-T G.8251] (ODCp clock), apply. - -### Defect correlations - -cLOF $\leftarrow$ dLOF - -Performance monitoring: None. - -### A.3.1.4 OSM256.4 to CBRx adaptation sink function - -The information flow and processing of the OSM256.4/CBRx\_A\_Sk function is defined with reference to Figures A.13 and A.14. - -### Symbol - -![Symbol diagram for OSM256.4/CBRx_A_Sk function. A trapezoidal block labeled 'OSM256.4/CBRx' has an input arrow from 'OSM256.4_AP' at the bottom and an output arrow pointing to 'CBRx_CP' at the top. Below the diagram is the text 'G.798(12)-Amd.1(14)_FA.13'.](0823130a6e07569e2fdb6bbdfc355d39_img.jpg) - -G.798(12)-Amd.1(14)\_FA.13 - -Symbol diagram for OSM256.4/CBRx\_A\_Sk function. A trapezoidal block labeled 'OSM256.4/CBRx' has an input arrow from 'OSM256.4\_AP' at the bottom and an output arrow pointing to 'CBRx\_CP' at the top. Below the diagram is the text 'G.798(12)-Amd.1(14)\_FA.13'. - -Figure A.13 – OSM256.4/CBRx\_A\_Sk function - -### Interfaces - -Table A.7 – OSM256.4/CBRx\_A\_Sk inputs and outputs - -| Input(s) | Output(s) | -|---------------------------------------------------------------------------|-----------------------------------------------------------| -| OSM256.4_AP:
OSM256.4_AI_D
OSM256.4_AI_CK
OSM256.4_AI_TSF | CBRx_CP:
CBRx_CI_D
CBRx_CI_CK
CBRx_CI_SSF | - -### Processes - -The processes associated with the OSM256.4/CBRx\_A\_Sk function are depicted in Figure A.14. - -![Process diagram for OSM256.4/CBRx_A_Sk. A large grey rectangle represents the function. At the bottom, three input labels 'AI_D', 'AI_CK', and 'AI_TSF' point to the rectangle. At the top, three output labels 'CI_D', 'CI_CK', and 'CI_SSF' point away from the rectangle. Above the top labels is 'CBRx_CP' and below the bottom labels is 'OSM256.4_AP'. To the right of the rectangle is the text 'G.798(12)-Amd.1(14)_FA.14'.](c40bbeb66e1572660694c68dcb5734e1_img.jpg) - -G.798(12)-Amd.1(14)\_FA.14 - -Process diagram for OSM256.4/CBRx\_A\_Sk. A large grey rectangle represents the function. At the bottom, three input labels 'AI\_D', 'AI\_CK', and 'AI\_TSF' point to the rectangle. At the top, three output labels 'CI\_D', 'CI\_CK', and 'CI\_SSF' point away from the rectangle. Above the top labels is 'CBRx\_CP' and below the bottom labels is 'OSM256.4\_AP'. To the right of the rectangle is the text 'G.798(12)-Amd.1(14)\_FA.14'. - -Figure A.14 – OSM256.4/CBRx\_A\_Sk processes - -Defects: None. - -Consequent actions: None. - -Defect correlations: None. - -**Performance monitoring:** None. - -#### A.3.1.5 OSx to CBRx adaptation source function for 64B/66B encoded clients with FEC (OSx/CBRx-b\_A\_So) (x = FC-y) - -The information flow and processing of the OSx/CBRx-b\_A\_So function is defined with reference to Figures A.15 and A.16. - -##### Symbol - -![Symbol diagram for the OSx/CBRx-b_A_So function. It shows a trapezoidal block labeled 'OSx/CBRx-b'. An arrow labeled 'CBRx_CP' points into the top of the block, and an arrow labeled 'OSx_AP' points out of the bottom. Below the block is the text 'G.798(17)_FA.15'.](9d81a26facbcf05a73cb7c027e66c1c8_img.jpg) - -``` -graph TD; CBRx_CP --> OSx_CBRx_b[OSx/CBRx-b]; OSx_CBRx_b --> OSx_AP; G.798(17)_FA.15 -``` - -Symbol diagram for the OSx/CBRx-b\_A\_So function. It shows a trapezoidal block labeled 'OSx/CBRx-b'. An arrow labeled 'CBRx\_CP' points into the top of the block, and an arrow labeled 'OSx\_AP' points out of the bottom. Below the block is the text 'G.798(17)\_FA.15'. - -**Figure A.15 – OSx/CBRx-b\_A\_So function** - -##### Interfaces - -**Table A.8 – OSx/CBRx-b\_A\_So inputs and outputs** - -| Input(s) | Output(s) | -|-----------------------------------------------------------|----------------------------| -| CBRx_CP:
CBRx_CI_D
CBRx_CI_CK
CBRx_CI_SSF | OSx_AP:
OSx_AI_D | - -##### Processes - -The processes associated with the OSx/CBRx-b\_A\_So function are depicted in Figure A.16. - -**Block alignment:** Block alignment consists of the recovering 64B/66B block lock per the state diagram in Figure 49-14 of [IEEE 802.3]. - -**Transcoder:** Transcoding of the 64B/66B blocks might be required. The specific transcoding processes depend on the CBRx client type, as defined in the specifications referenced in Table A.1B. The transcoder shall convert invalid 66B blocks to an error control block before transcoding. An invalid 66B block is one which does not have a sync header of "01" or "10", or one which has a sync header of "10" and an invalid control block type field. - -**FEC encoder:** The function shall generate and insert the FEC code words. The specific processes and FEC coding scheme depend on the CBRx client type, as defined in the specifications referenced in Table A.1B. - -**Scrambler:** Scrambling of the FEC code words might be required. The specific scrambling process depends on the CBRx client type, as defined in the specifications referenced in Table A.1B. - -**Mod (optical carrier modulation):** See clause 8.11. - -**Optical signal pre-conditioning:** Pre-conditioning of the single wavelength optical signal might be required. The specific conditioning processes depend on the OSx interface type. - -For fibre channel type interfaces, the input clock ranges are defined in Table A.1A and the jitter and wander requirements, as defined in the specifications referenced in Table A.1B, apply. - -![Figure A.16 – OSx/CBRx-b_A_So processes. This block diagram illustrates the signal flow and control logic for the OSx/CBRx-b_A_So function. At the top, three input signals are shown: CI_SSF, CI_D, and CI_CK. CI_SSF and CI_D enter an 'Alignment' block, which outputs 'dLOCA' (defect loss of client alignment) to 'Consequent actions'. CI_CK enters the 'Alignment' block and outputs 'CK' (clock) to the 'Transcoder'. The 'Alignment' block also outputs 'BlockStart' to the 'Replacement signal generator'. The 'Replacement signal generator' outputs a signal to the 'Transcoder'. The 'Transcoder' receives 'BlockStart', 'D' (data), and 'CK' (clock) from the 'Alignment' block and outputs 'BlockStart', 'D', and 'CK' to the 'FEC encoder'. The 'FEC encoder' receives 'BlockStart', 'D', and 'CK' from the 'Transcoder' and outputs 'FECWordStart', 'D', and 'CK' to the 'Scrambler'. The 'Scrambler' receives 'FECWordStart', 'D', and 'CK' from the 'FEC encoder' and outputs 'D' and 'CK' to the 'Mod' block. The 'Mod' block receives 'D' and 'CK' from the 'Scrambler' and outputs a signal to the 'Optical signal pre-conditioning' block (represented by a dashed box). The 'Optical signal pre-conditioning' block outputs 'AI_D' and 'OSx_AP' signals. A dashed line labeled 'aAIS' connects the 'Consequent actions' block to the 'Transcoder'.](d186ab1411a29b6f0938ab43178e9f0d_img.jpg) - -Figure A.16 – OSx/CBRx-b\_A\_So processes. This block diagram illustrates the signal flow and control logic for the OSx/CBRx-b\_A\_So function. At the top, three input signals are shown: CI\_SSF, CI\_D, and CI\_CK. CI\_SSF and CI\_D enter an 'Alignment' block, which outputs 'dLOCA' (defect loss of client alignment) to 'Consequent actions'. CI\_CK enters the 'Alignment' block and outputs 'CK' (clock) to the 'Transcoder'. The 'Alignment' block also outputs 'BlockStart' to the 'Replacement signal generator'. The 'Replacement signal generator' outputs a signal to the 'Transcoder'. The 'Transcoder' receives 'BlockStart', 'D' (data), and 'CK' (clock) from the 'Alignment' block and outputs 'BlockStart', 'D', and 'CK' to the 'FEC encoder'. The 'FEC encoder' receives 'BlockStart', 'D', and 'CK' from the 'Transcoder' and outputs 'FECWordStart', 'D', and 'CK' to the 'Scrambler'. The 'Scrambler' receives 'FECWordStart', 'D', and 'CK' from the 'FEC encoder' and outputs 'D' and 'CK' to the 'Mod' block. The 'Mod' block receives 'D' and 'CK' from the 'Scrambler' and outputs a signal to the 'Optical signal pre-conditioning' block (represented by a dashed box). The 'Optical signal pre-conditioning' block outputs 'AI\_D' and 'OSx\_AP' signals. A dashed line labeled 'aAIS' connects the 'Consequent actions' block to the 'Transcoder'. - -**Figure A.16 – OSx/CBRx-b\_A\_So processes** - -## Defects - -The OSx/CBRx-b\_A\_So function shall detect the loss of client alignment defect (dLOCA). - -**dLOCA:** If 66B block alignment is persistently lost for 3 ms, dLOCA shall be declared. dLOCA shall be cleared immediately when 66B block alignment is recovered. - -## Consequent actions - -The OSx/CBRx-b\_A\_So function shall perform the following consequent action: - -aAIS ← dLOCA - -On declaration of aAIS, the function shall output a replacement signal as defined in Table A.1B for fibre channel type interfaces within X ms. On clearing of aAIS, the replacement signal shall be removed within Y ms, with normal data being output. The values for X and Y are for further study. - -The replacement signal clock start shall be independent from the incoming clock. 66B Block alignment shall be maintained. For the defined values of x, the replacement signal clock has to be within the range defined in Table A.1A for fibre channel type interfaces. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -### A.3.1.6 OSx to CBRx adaptation sink function for 64B/66B encoded clients with optional FEC (OSx/CBRx-b\_A\_Sk) (x = FC-y) - -The information flow and processing of the OSx/CBRx-b\_A\_Sk function is defined with reference to Figures A.17 and A.18. - -## Symbol - -![Symbol diagram for OSx/CBRx-b_A_Sk function. A central trapezoidal block labeled 'OSx/CBRx-b' has three connections: an input arrow from the left labeled 'OSx/CBRx-b_A_Sk_MP', an output arrow pointing up labeled 'CBRx_CP', and an input arrow from below labeled 'OSx_AP'. A reference code 'G.798(12)-Amd.2(15)_FA.17' is shown to the right of the block.](3b330f29256259f2a9854f1c371ed269_img.jpg) - -Symbol diagram for OSx/CBRx-b\_A\_Sk function. A central trapezoidal block labeled 'OSx/CBRx-b' has three connections: an input arrow from the left labeled 'OSx/CBRx-b\_A\_Sk\_MP', an output arrow pointing up labeled 'CBRx\_CP', and an input arrow from below labeled 'OSx\_AP'. A reference code 'G.798(12)-Amd.2(15)\_FA.17' is shown to the right of the block. - -Figure A.17 – OSx/CBRx-b\_A\_Sk function - -## Interfaces - -Table A.9 – OSx/CBRx-b\_A\_Sk inputs and outputs - -| Input(s) | Output(s) | -|----------------------------------------------------------------------------------------------------------------------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| OSx_AP:
OSx_AI_D
OSx_AI_TSF
OSx/CBRx-b_A_Sk_MP:
OSx/CBRx-b_A_Sk_MI_FECEn
OSx/CBRx-b_A_Sk_MI_1second | CBRx_CP:
CBRx_CI_D
CBRx_CI_CK
CBRx_CI_SSF
OSx/CBRx-b_A_Sk_MP:
OSx/CBRx-b_A_Sk_MI_cLFA
OSx/CBRx-b_A_Sk_MI_pFECcorrErr
OSx/CBRx-b_A_Sk_MI_pFECuncorrErr | - -## Processes - -The processes associated with the OSx/CBRx-b\_A\_Sk function are depicted in Figure A.18. - -If FEC processing is enabled (MI\_FECEn is true), the function shall perform the FEC code word alignment, descrambler, FEC decoder and transcoder processes. Otherwise, the FEC data is ignored and no error correction is performed. - -**FEC code word alignment:** The function shall recover the FEC code word start (FCWS). This process is specific for the CBRx client type, as defined in the specifications referenced in Table A.1B. - -**Descrambler:** Descrambling of the FEC code words might be required. The specific descrambling process depends on the CBRx client type, as defined in the specifications referenced in Table A.1B. - -**FEC decoder:** The function shall extract the FEC data and perform error correction. The specific processes and FEC coding scheme depend on the CBRx client type, as defined in the specifications referenced in Table A.1B. Uncorrectable FEC words shall be replaced with the corresponding number of 66B error control blocks. The number of corrected and uncorrectable errors shall be reported (nFECcorrErr, nFECuncorrErr). - -**Transdecoder:** Transdecoding to 64B/66B blocks might be required. The specific transdecoding processes depend on the CBRx client type, as defined in the specifications referenced in Table A.1B. - -**Optical signal post-conditioning:** Post-conditioning of the single wavelength signal might be required. The specific conditioning processes depend on the OSx interface type. - -**DMod (optical carrier demodulation):** See clause 8.11. - -**Clock recovery:** The function shall recover the clock signal from the incoming data. For fibre channel type interfaces, the input clock ranges are defined in Table A.1A and the jitter and wander requirements, as defined in the specifications referenced in Table A.1B, apply. - -![Figure A.18 – OSx/CBRx-b_A_Sk processes. This block diagram illustrates the internal signal processing flow of the OSx/CBRx-b_A_Sk function. At the bottom, the 'Optical signal post-conditioning' block (dashed box) receives 'AI_D' and 'OSx_AP' inputs and sends data to the 'DMod' block. 'DMod' outputs to the 'Clock recovery' block, which provides 'CK' signals to the 'FEC code word alignment', 'Descrambler', and 'FEC decoder' blocks. The 'FEC code word alignment' block receives 'D' data and 'CK' clock, and outputs 'dLFA' to the 'Defect correlations' block. The 'Defect correlations' block outputs 'MI_cLFA' and 'MI_FECEn'. The 'FEC code word alignment' also outputs 'FCWS' to the 'Descrambler'. The 'Descrambler' outputs 'D' data and 'CK' clock to the 'FEC decoder'. The 'FEC decoder' outputs 'nFECcorrErr' and 'nFECuncorrErr' to the 'Performance monitoring' block. The 'Performance monitoring' block outputs 'MI_1second', 'MI_pFECcorrErr', and 'MI_pFECuncorrErr'. The 'FEC decoder' also outputs 'D' data and 'CK' clock to the 'Transdecoder'. The 'Transdecoder' outputs 'CI_D' and 'CI_CK' signals. A 'Replacement signal generator' block receives 'dLFA' and 'AI_TSF' inputs and outputs a signal to the 'Consequent actions' block. The 'Consequent actions' block also receives 'FECEn' and 'dLFA' inputs and outputs 'CI_SSF'. The entire process is labeled 'OSx/CBRx-b_A_Sk_MP' on the right side. Reference 'G.798(17)_FA.18' is noted at the bottom right of the diagram area.](43aeecf3cbc60c4418d560d8a4512ebb_img.jpg) - -Figure A.18 – OSx/CBRx-b\_A\_Sk processes. This block diagram illustrates the internal signal processing flow of the OSx/CBRx-b\_A\_Sk function. At the bottom, the 'Optical signal post-conditioning' block (dashed box) receives 'AI\_D' and 'OSx\_AP' inputs and sends data to the 'DMod' block. 'DMod' outputs to the 'Clock recovery' block, which provides 'CK' signals to the 'FEC code word alignment', 'Descrambler', and 'FEC decoder' blocks. The 'FEC code word alignment' block receives 'D' data and 'CK' clock, and outputs 'dLFA' to the 'Defect correlations' block. The 'Defect correlations' block outputs 'MI\_cLFA' and 'MI\_FECEn'. The 'FEC code word alignment' also outputs 'FCWS' to the 'Descrambler'. The 'Descrambler' outputs 'D' data and 'CK' clock to the 'FEC decoder'. The 'FEC decoder' outputs 'nFECcorrErr' and 'nFECuncorrErr' to the 'Performance monitoring' block. The 'Performance monitoring' block outputs 'MI\_1second', 'MI\_pFECcorrErr', and 'MI\_pFECuncorrErr'. The 'FEC decoder' also outputs 'D' data and 'CK' clock to the 'Transdecoder'. The 'Transdecoder' outputs 'CI\_D' and 'CI\_CK' signals. A 'Replacement signal generator' block receives 'dLFA' and 'AI\_TSF' inputs and outputs a signal to the 'Consequent actions' block. The 'Consequent actions' block also receives 'FECEn' and 'dLFA' inputs and outputs 'CI\_SSF'. The entire process is labeled 'OSx/CBRx-b\_A\_Sk\_MP' on the right side. Reference 'G.798(17)\_FA.18' is noted at the bottom right of the diagram area. - -**Figure A.18 – OSx/CBRx-b\_A\_Sk processes** - -## Defects - -The OSx/CBRx-b\_A\_Sk function shall detect the loss of FEC word alignment defect (dLFA). - -**dLFA:** The detection of dLFA depends on the CBRx client type, as defined in the specifications referenced in Table A.1B. - -## Consequent actions - -The OSx/CBRx\_A\_Sk function performs the following consequent actions: - -aSSF $\leftarrow$ AI\_TSF or (dLFA and FECEn) - -aAIS $\leftarrow$ AI\_TSF or (dLFA and FECEn) - -On declaration of aAIS, the function shall output a replacement signal as defined in Table A.1B for fibre channel type interfaces within X ms. On clearing of aAIS, the replacement signal shall be removed within Y ms, with normal data being output. The values for X and Y are for further study. - -The replacement signal clock start shall be independent from the incoming clock. For the defined values of x, the replacement signal clock has to be within the range defined in Table A.1A for fibre channel type interfaces. - -### Defect correlations - -The OSx/CBRx-b\_A\_Sk function shall perform the following defect correlation: - -cLFA $\leftarrow$ dLFA and FECEn and (not AI\_TSF) - -**Performance monitoring:** The function shall perform the following performance monitoring primitives processing. The performance monitoring primitives shall be reported to the EMF. - -pFECcorrErr $\leftarrow \sum$ nFECcorrErr - -pFECuncorrErr $\leftarrow \sum$ nFECuncorrErr - -NOTE – During AI\_TSF no corrected or uncorrectable errors shall be counted. - -### A.3.1.7 OSx to CBRx adaptation sink function for 64B/66B encoded clients with mandatory FEC (OSx/CBRx-c\_A\_Sk) (x = FC-y) - -The information flow and processing of the OSx/CBRx\_A\_Sk function is defined with reference to Figures A.19 and A.20. - -### Symbol - -![Diagram of the OSx/CBRx-c_A_Sk function symbol. A central trapezoidal block is labeled 'OSx/CBRx-c'. An arrow labeled 'OSx_AP' points into the block from the bottom. An arrow labeled 'CBRx_CP' points out of the block from the top. A double-headed arrow labeled 'OSx/CBRx-c_A_Sk_MP' is connected to the left side of the block. Below the diagram is the text 'G.798(12)-Amd.2(15)_FA.19'.](5f1f8e1973a0dd08d313a5aab38502ad_img.jpg) - -Diagram of the OSx/CBRx-c\_A\_Sk function symbol. A central trapezoidal block is labeled 'OSx/CBRx-c'. An arrow labeled 'OSx\_AP' points into the block from the bottom. An arrow labeled 'CBRx\_CP' points out of the block from the top. A double-headed arrow labeled 'OSx/CBRx-c\_A\_Sk\_MP' is connected to the left side of the block. Below the diagram is the text 'G.798(12)-Amd.2(15)\_FA.19'. - -Figure A.19 – OSx/CBRx-c\_A\_Sk function - -### Interfaces - -Table A.10 – OSx/CBRx-c\_A\_Sk inputs and outputs - -| Input(s) | Output(s) | -|------------------------------------------------------------------------------------------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| OSx_AP:
OSx_AI_D
OSx_AI_TSF
OSx/CBRx-c_A_Sk_MP:
OSx/CBRx-c_A_Sk_MI_1second | CBRx_CP:
CBRx_CI_D
CBRx_CI_CK
CBRx_CI_SSF
OSx/CBRx-c_A_Sk_MP:
OSx/CBRx-c_A_Sk_MI_cLFA
OSx/CBRx-c_A_Sk_MI_pFECcorrErr
OSx/CBRx-c_A_Sk_MI_pFECuncorrErr | - -### Processes - -The processes associated with the OSx/CBRx-c\_A\_Sk function are depicted in Figure A.20. - -**FEC code word alignment:** The function shall recover the FEC code word start (FCWS). This process is specific for the CBRx client type, as defined in the specifications referenced in Table A.1B. - -**Descrambler:** Descrambling of the FEC code words might be required. The specific descrambling process depends on the CBRx client type, as defined in the specifications referenced in Table A.1B. - -**FEC decoder:** The function shall extract the FEC data and perform error correction. The specific processes and FEC coding scheme depend on the CBRx client type, as defined in the specifications referenced in Table A.1B. Uncorrectable FEC words shall be replaced with the corresponding number of 66B error control blocks. The number of corrected and uncorrectable errors shall be reported (nFECcorrErr, nFECuncorrErr). - -**Transdecoder:** Transdecoding to 64B/66B blocks might be required. The specific transdecoding processes depend on the CBRx client type, as defined in the specifications referenced in Table A.1B. - -**Optical signal post-conditioning:** Post-conditioning of the single wavelength signal might be required. The specific conditioning processes depend on the OSx interface type. - -**DMod (optical carrier demodulation):** See clause 8.11. - -**Clock recovery:** The function shall recover the clock signal from the incoming data. For fibre channel type interfaces, the input clock ranges are defined in Table A.1A and the jitter and wander requirements, as defined in the specifications referenced in Table A.1B, apply. - -![Block diagram of OSx/CBRx-c_A_Sk processes showing signal flow from OSx_AP to CBRx_CP through various processing blocks including Optical signal post-conditioning, DMod, Clock recovery, FEC code word alignment, Descrambler, FEC decoder, and Transdecoder. It also includes monitoring blocks like Performance monitoring and Defect correlations, and a Replacement signal generator.](637fa2ec2e8639bc53dea306e19b7c05_img.jpg) - -The diagram illustrates the signal processing flow within the OSx/CBRx-c\_A\_Sk processes. The main components and their interactions are as follows: - -- Inputs:** AI\_D and AI\_TSF enter from the bottom (OSx\_AP side). A dashed box labeled "Optical signal post-conditioning" is at the bottom. -- Signal Path:** The signal flows upwards through a series of blocks: "DMod", "Clock recovery", "FEC code word alignment", "Descrambler", "FEC decoder", and "Transdecoder". -- Clock and Control Signals:** - - "Clock recovery" provides "D" and "CK" signals to "FEC code word alignment". - - "FEC code word alignment" provides "FCWS", "D", and "CK" signals to "Descrambler". - - "Descrambler" provides "FCWS", "D", and "CK" signals to "FEC decoder". - - "FEC decoder" provides "FCWS", "D", and "CK" signals to "Transdecoder". - - "Transdecoder" provides "D" and "CK" signals to a "Replacement signal generator". - - The "Replacement signal generator" provides "CI\_D", "CI\_CK", and "CI\_SSF" signals to the top (CBRx\_CP side). -- Monitoring and Correlation:** - - "FEC decoder" outputs "nFECcorrErr" and "nFECuncorrErr" to a "Performance monitoring" block. - - "Performance monitoring" outputs "MI\_1second", "MI\_pFECcorrErr", and "MI\_pFECuncorrErr" to the right (OSx/CBRx-c\_A\_Sk\_MP side). - - "FEC code word alignment" outputs "dLFA" to a "Defect correlations" block. - - "Defect correlations" outputs "MI\_cLFA" to the right. - - Both "Performance monitoring" and "Defect correlations" output "dLFA" and "AI\_TSF" signals to a "Consequent actions" block. - - "Consequent actions" outputs "CI\_SSF" to the top. -- Labels:** The diagram is labeled "CBRx\_CP" at the top and "OSx\_AP" at the bottom. A reference "G.798(17)\_FA.20" is in the bottom right corner. - -Block diagram of OSx/CBRx-c\_A\_Sk processes showing signal flow from OSx\_AP to CBRx\_CP through various processing blocks including Optical signal post-conditioning, DMod, Clock recovery, FEC code word alignment, Descrambler, FEC decoder, and Transdecoder. It also includes monitoring blocks like Performance monitoring and Defect correlations, and a Replacement signal generator. - -Figure A.20 – OSx/CBRx-c\_A\_Sk processes - -## Defects - -The OSx/CBRx-b\_A\_Sk function shall detect the loss of FEC word alignment defect (dLFA). - -**dLFA:** The detection of dLFA depends on the CBRx client type, as defined in the specifications referenced in Table A.1B. - -## Consequent actions - -The OSx/CBRx\_A\_Sk function performs the following consequent actions: - -aSSF $\leftarrow$ AI\_TSF or dLFA - -aAIS $\leftarrow$ AI\_TSF or dLFA - -On declaration of aAIS, the function shall output a replacement signal as defined in Table A.1B for fibre channel type interfaces within X ms. On clearing of aAIS, the replacement signal shall be removed within Y ms, with normal data being output. The values for X and Y are for further study. - -The replacement signal clock start shall be independent from the incoming clock. For the defined values of x, the replacement signal clock has to be within the range defined in Table A.1A for fibre channel type interfaces. - -## Defect correlations - -The OSx/CBRx-c\_A\_Sk function shall perform the following defect correlation: - -cLFA $\leftarrow$ dLFA and (not AI\_TSF) - -**Performance monitoring:** The function shall perform the following performance monitoring primitives processing. The performance monitoring primitives shall be reported to the EMF. - -pFECcorrErr $\leftarrow \sum nFECcorrErr$ - -pFECuncorrErr $\leftarrow \sum nFECuncorrErr$ - -NOTE – During AI\_TSF no corrected or uncorrectable errors shall be counted. - -## Annex B - -### Generic FlexE and FlexO supervision and processes - -(This annex forms an integral part of this Recommendation.) - -#### B.1 Supervision - -##### B.1.1 Defects - -###### B.1.1.1 Alignment supervision - -###### B.1.1.1.1 FlexE overhead Loss of Frame (dLOF) - -FlexE overhead dLOF is generated based on the state of the frame alignment process defined in clause B.2.1.1. - -dLOF shall be declared if the FlexE overhead frame alignment process is in the out-of-frame (OOF) state for 3ms. To provide for the case of intermittent OOFs, the integrating timer shall not be reset to zero until an in-frame (IF) condition persists continuously for 3 ms. - -dLOF shall be cleared when the IF state persists continuously for 3 ms. - -###### B.1.1.1.2 FlexE overhead Loss of Multi-frame (dLOM) - -FlexE overhead dLOM is generated based on the state of the multi-frame alignment process defined in clause B.2.1.2. - -dLOM shall be declared if the multi-frame alignment process is persistently in the out-of-multiframe (OOM) state for 10 ms. - -dLOM shall be cleared immediately when the multi-frame alignment process is in the in-multiframe (IM) state. - -##### B.1.1.2 Group supervision - -###### B.1.1.2.1 Group ID Mismatch (dGIDM) - -dGIDM shall be declared if the accepted GID (AcGID) of any of the group member interfaces is not equal to the expected GID (ExGID). - -dGIDM shall be cleared if the accepted GID of all group member interfaces is equal to the expected GID. - -dGIDM shall be detected within 100 ms of changes to the AcGID. - -###### B.1.1.2.2 FlexO/FlexE Map Mismatch (dFMM) - -The FlexO/FlexE Map mismatch defect of a FlexO group or FlexE (sub)group of p members is based on the comparison of the p AcFMAP values, the p AcIID values and the expected FlexO/FlexE Map (ExFMAP). - -dFMM shall be cleared if - -- the AcFMAP value of each member matches the value of ExFMAP, -- each value of AcIID has the corresponding bit set in ExFMAP, -- every AcIID value is unique. - -Otherwise, dFMM shall be declared. - -dFMM shall be detected within 100 ms of changes to the AcFMAP[1..p] or AcIID[1..p] values. - -## **B.2 Generic processes** - -### **B.2.1 Alignment processes** - -#### **B.2.1.1 FlexE overhead frame alignment** - -The FlexE overhead frame alignment shall be found by searching for FlexE block 1 of the FlexE overhead frame every $(1023 \times 20 + 1) \times 8$ blocks as described in clause 7.3.1 of [OIF FlexE IA]. - -NOTE – The FlexE block 1 of the FlexE overhead frame is encoded as a special ordered set. The sync header is 10, the control block type is 0x4B (ordered set), and the "O" code is 0x5. - -The process has two states, out-of-frame (OOF) and in-frame (IF). The frame alignment start shall be maintained during the OOF state. - -In the OOF state, the frame alignment shall be assumed to be recovered and the IF state shall be entered, when a valid FlexE block 1 is found in two consecutive FlexE overhead frames. - -In the IF state, OOF shall be entered when the FlexE block 1 of the FlexE overhead frame has mismatches on the sync header, control block type or O code fields for 5 occurrences. - -#### **B.2.1.2 FlexE overhead multi-frame alignment** - -The FlexE overhead multi-frame is a sequence of 32 FlexE overhead frames. The Flex overhead multi-frame alignment shall be found based on the overhead multi-frame (OMF) bit in the FlexE overhead. The OMF bit has a value of "0" for the first sixteen overhead frames of the FlexE overhead multi-frame, and a value of "1" for the last sixteen overhead frames of the FlexE overhead multi-frame, as described in clause 7.3.1 of [OIF FlexE IA]. - -The process has two states, out-of-multi-frame (OOM) and in-multi-frame (IM). The multi-frame start shall be maintained during the OOM state. - -In the OOM state, the state will change from OOM to IM upon detecting a "0" to "1" or a "1" to "0" transition of the OMF bit in two consecutive FlexE overhead frames with good CRC. In the IM state, the state shall change from IM to OOM, when the two consecutive FlexE overhead frames where the "0" to "1" or "1" to "0" transition of the OMF bit is expected, have a good CRC, but do not have the expected transition. - -### **B.2.2 Overhead acceptance processes** - -#### **B.2.2.1 Group Identification (GID) acceptance process** - -A new GID value (AcGID) is accepted if a new value of the Group Identification field of the FlexO overhead or the Group Number field of the FlexE overhead is received in an overhead frame with good CRC. - -#### **B.2.2.2 FlexO/FlexE Instance Identification (IID) acceptance process** - -##### **B.2.2.2.1 FlexO IID acceptance process** - -A new IID value (AcIID) is accepted if a new value of the FlexO Instance Identification field of the FlexO overhead is received in an overhead frame with good CRC. - -##### **B.2.2.2.2 FlexE IID acceptance process** - -A new IID value (AcIID) is accepted when the same value of the FlexE Instance Number field of the FlexE overhead is received in two consecutive overhead frames with good CRC. - -### **B.2.2.3 PHY Map acceptance process** - -#### **B.2.2.3.1 FlexO Map acceptance process** - -The 256-bit Map[0:255] is recovered from the MAP field of the FlexO overhead. - -When FlexO overhead frame #i in the 8 frame multi-frame is received with good CRC, the bits AcFMAP[(i-1)×32:(i-1)×32+31] are accepted from the FlexO MAP field. - -#### **B.2.2.3.2 FlexE Map acceptance process** - -The 256-bit Map[0:255] is recovered from the Map field of the FlexE overhead. - -When FlexE overhead frame #i in the 32 frame multi-frame is received with good CRC, the bits AcFMAP[(i-1)×8:(i-1)×8+7] are accepted from the FlexE Map field. - -## Appendix I - -### Applications and functional diagrams - -(This appendix does not form an integral part of this Recommendation.) - -This appendix shows example functional diagrams for a number of OTN and non-OTN interface ports on OTN equipment and a number of OTN interface ports on non-OTN equipment. - -NOTE – The following functional diagrams are for illustrative purposes only. - -#### **I.1 Transparent CBRx tributary interface port with optional SDH RS non-intrusive monitor on OTN equipment** - -NOTE – A generic, bit rate non-specific model is presented. Actual interface ports will be bit rate specific; e.g., 10 Gbit/s (n = 64, x = 10G). - -Figure I.1 shows the equipment functions for this application. The processing down to the ODUsk layer, in the direction of the line interface, is shown. - -The following operations are performed: - -- termination of the ITU-T G.957/ITU-T G.691 or ITU-T G.695 optical signal; -- optional RSn non-intrusive monitoring in ingress and egress directions; -- mapping of CBR signal into the ODUsk; -- termination of ODUsk path overhead; -- termination of up to three levels of ODUsk TCM overhead in line port direction. - -![Figure I.1: Transparent CBRx tributary interface port with optional SDH RS non-intrusive monitor on OTN equipment. The diagram shows two main signal paths. The left path represents the ingress direction, starting from an optical signal (STLn.m or STM-n) through an OSn layer, then an OSn/RSn or OSn/CBRx layer, and finally an RSn layer. The right path represents the egress direction, starting from an OTN signal (ODUk) through an ODUk/ODUk layer, then an ODUk layer, and finally an ODUkP/CBRx or ODUkP/RSn layer. Both paths include non-intrusive monitoring points for the RSn layer. The diagram is labeled with various interfaces and layers, and includes a reference to G.798(17)_Fl.1.](ea4d1f05669860c1f910e6cb1e7a22b6_img.jpg) - -STLn.m (ITU-T G.695) -STM-n (ITU-T G.957/ITU-T G.691) - -G.798(17)\_Fl.1 - -Figure I.1: Transparent CBRx tributary interface port with optional SDH RS non-intrusive monitor on OTN equipment. The diagram shows two main signal paths. The left path represents the ingress direction, starting from an optical signal (STLn.m or STM-n) through an OSn layer, then an OSn/RSn or OSn/CBRx layer, and finally an RSn layer. The right path represents the egress direction, starting from an OTN signal (ODUk) through an ODUk/ODUk layer, then an ODUk layer, and finally an ODUkP/CBRx or ODUkP/RSn layer. Both paths include non-intrusive monitoring points for the RSn layer. The diagram is labeled with various interfaces and layers, and includes a reference to G.798(17)\_Fl.1. - -**Figure I.1 – Transparent CBRx tributary interface port with optional SDH RS non-intrusive monitor on OTN equipment** - -## I.2 OTU tributary interface port on OTN equipment - -NOTE – A generic, bit rate non-specific model is presented. Actual interface ports will be bit rate specific; e.g., 10 Gbit/s (m = 2). - -Figure I.2 shows the equipment functions for this application. The processing down to the ODUk layer, in the direction of the line interface, is shown. - -The following operations are performed: - -- termination of the ITU-T G.959.1 optical signal; -- termination of OTUk section overhead; -- termination of up to three levels of ODUk TCM overhead in tributary port direction; -- ODUkP non-intrusive monitoring in ingress and egress directions; - -- termination of up to three levels of ODUk TCM overhead in the line port direction. - -![Diagram of OTU tributary interface port on OTN equipment showing signal flow and monitoring points.](7aaba112378eb1ada76b4c7ae2f7ab83_img.jpg) - -The diagram illustrates the internal structure of an OTN equipment's OTU tributary interface port. It shows two parallel signal paths within a yellow-shaded area, representing the equipment's internal processing. Both paths start from the bottom with an **OTUk (ITU-T G.959.1)** signal entering the equipment. The signal then passes through an **OTSiG** interface (indicated by a dashed circle and the number 1), followed by an **OTSi** block, an **OTSi/OTUk** block, and an **OTUk** block. Above these are several layers of **ODUk** processing, each consisting of an **ODUk** block, an **ODUk/ODUk** block, and an **ODUk\_TCMC** block. The text **ODUk\_CI** is used to label the interfaces between these blocks. At the top of the internal processing, there are two **ODUkP** blocks, with the text **ODUkP non-intrusive monitoring** between them. A horizontal line connects these two blocks. The signal then exits the equipment through the top of the yellow area. A label **G.798(17)-Amd.3(21)\_FI.2** is present in the bottom right of the yellow area. A text label **To/from ODUk\_C or OTUk[V]/ODUk\_A** is located near the bottom right of the internal processing section. - -Diagram of OTU tributary interface port on OTN equipment showing signal flow and monitoring points. - -Figure I.2 – OTU tributary interface port on OTN equipment - -### **I.3 Selectable CBRx/OTUk tributary interface port on OTN equipment** - -NOTE – A generic, bit rate non-specific model is presented. Actual interface ports will be bit rate specific; e.g., 10 Gbit/s (n = 64, x = 10G). - -As the optical interfaces for CBRx (STM-n) and OTUk interfaces are similar, it is possible to build equipment that can switch the processing between the two signals at the same tributary port. This is a combination of the two applications defined above. Depending on the selected interface mode, one of two function sets is active. - -Figure I.3 shows the equipment functions for this application. The processing down to the ODuk layer, in the direction of the line interface, is shown. - -The following operations, independent of the interface mode, are performed: - -- termination of up to three levels of ODuk TCM overhead in the line port direction; -- termination of OTUk section overhead. - -The following operations, specific to the OTUk mode, are performed: - -- termination of up to three levels of ODuk TCM overhead in tributary port direction; -- ODukP non-intrusive monitoring in ingress and egress directions. - -The following operations, specific to the CBRx mode, are performed: - -- optional RSn non-intrusive monitoring in ingress and egress directions; -- mapping of CBR signal into the ODuk; -- termination of ODuk path overhead. - - - -#### I.4 OTU interface ports on non-OTN equipment - -OTN interfaces can be used in non-OTN equipment in the same way as SDH interfaces in non-SDH equipment (e.g., STM-n interfaces for IP routers and IP switches). Figure I.4 shows two examples, an OTU2 interface port on an IP/Ethernet network element and an OTU3 interface port on an SDH network element: - -The OTU2 interface port on Ethernet equipment supports: - -- mapping and multiplexing of Ethernet MAC frames into the ODU2 using GFP-F; -- termination of ODU2 path overhead; -- termination of OTU2 section overhead; -- termination of the ITU-T G.959.1 optical signal. - -The OTU3 interface port on SDH equipment supports: - -- mapping and multiplexing of the STM-256 signal (RS256 layer) into the ODU3; -- termination of ODU3 path overhead; -- termination of up to one level of ODU3 TCM overhead; -- termination of OTU3 section overhead; -- termination of the ITU-T G.959.1 optical signal. - -![Diagram showing the internal structure of OTU2 and OTU3 interface ports on non-OTN equipment.](d94747f06bbc2d98d92f9ca113ab737e_img.jpg) - -The diagram illustrates the internal signal processing paths for two types of OTN interfaces on non-OTN equipment, both shown within yellow rectangular boxes. - -**Left Box (OTU2 on Ethernet equipment):** Labeled "To/from ETH\_C" at the top. The signal flow from top to bottom is: ODU2P/ETH (trapezoid), ODU2P (triangle), ODU2\_CI (text), OTU2/ODU2 (trapezoid), OTU2 (triangle), OTU2\_CI (text), OTSi/OTU2 (trapezoid), OTSi (triangle), OTSIG (text with a dashed circle and "1"). The bottom label is "OTU2 (ITU-T G.959.1)". - -**Right Box (OTU3 on SDH equipment):** Labeled "To/from RS\_TT" at the top. The signal flow from top to bottom is: ODU3P/RS256 (trapezoid), ODU3P (triangle), ODU3\_CI (text), ODU3T/ODU3 (trapezoid), OTU3T (triangle), ODU3\_CI (text), OTU3/ODU3 (trapezoid), OTU3 (triangle), OTU3\_CI (text), OTSi/OTU3 (trapezoid), OTSi (triangle), OTSIG (text with a dashed circle and "1"). A vertical box labeled "ODUk\_TCMC" is connected to the ODU3T/ODU3 and OTU3T stages. The bottom label is "OTU3 (ITU-T G.959.1)". - -G.798(17)-Amd.3(21)\_FI.4 - -Diagram showing the internal structure of OTU2 and OTU3 interface ports on non-OTN equipment. - -Figure I.4 – OTU interface ports on non-OTN equipment - -For the above applications without ODUk TCM processing, the OTUk/ODUk overhead has the following fields in use as a minimum (see Figure I.5): - -- client-specific overhead if applicable; -- OPUk payload type in the payload structure identifier (PSI); -- ODUk path monitoring (PM) overhead; -- OTUk section monitoring (SM) overhead; -- frame alignment (FAS, MFAS). - -The other overhead fields are set to all-ZEROs. - -![Figure I.5: Minimum OTUk/ODUk overhead diagram. A table showing the structure of the overhead with 16 columns (1-16) and 4 rows (1-4). Row 1: FAS (columns 1-6), MFAS (column 7), SM (columns 8-10), columns 11-14 are All-ZEROs. Row 2: columns 1-2 are All-ZEROs, column 3 is All-ZEROs, columns 4-6 are All-ZEROs, columns 7-10 are All-ZEROs, column 11 is All-ZEROs, column 12 is All-ZEROs, column 13 is All-ZEROs, column 14 is All-ZEROs. Row 3: columns 1-2 are All-ZEROs, columns 3-6 are All-ZEROs, columns 7-10 are All-ZEROs, PM (columns 11-12), columns 13-14 are All-ZEROs. Row 4: columns 1-2 are All-ZEROs, columns 3-6 are All-ZEROs, columns 7-10 are All-ZEROs, columns 11-14 are All-ZEROs, PSI (column 15), column 16 is All-ZEROs. To the right of the table, 'Client specific' is labeled for rows 1-3, 'OPUk payload' for row 1, and 'OTUk FEC' for row 4. A legend indicates that grey cells represent the 'All-ZEROs pattern'. Source: G.798(12)_FI.5](b56ccd10a090e772debb888ae457727b_img.jpg) - -Figure I.5: Minimum OTUk/ODUk overhead diagram. A table showing the structure of the overhead with 16 columns (1-16) and 4 rows (1-4). Row 1: FAS (columns 1-6), MFAS (column 7), SM (columns 8-10), columns 11-14 are All-ZEROs. Row 2: columns 1-2 are All-ZEROs, column 3 is All-ZEROs, columns 4-6 are All-ZEROs, columns 7-10 are All-ZEROs, column 11 is All-ZEROs, column 12 is All-ZEROs, column 13 is All-ZEROs, column 14 is All-ZEROs. Row 3: columns 1-2 are All-ZEROs, columns 3-6 are All-ZEROs, columns 7-10 are All-ZEROs, PM (columns 11-12), columns 13-14 are All-ZEROs. Row 4: columns 1-2 are All-ZEROs, columns 3-6 are All-ZEROs, columns 7-10 are All-ZEROs, columns 11-14 are All-ZEROs, PSI (column 15), column 16 is All-ZEROs. To the right of the table, 'Client specific' is labeled for rows 1-3, 'OPUk payload' for row 1, and 'OTUk FEC' for row 4. A legend indicates that grey cells represent the 'All-ZEROs pattern'. Source: G.798(12)\_FI.5 - -Figure I.5 – Minimum OTUk/ODUk overhead - -### I.5 Multi-channel interface port with 3-R regeneration functionality for an ODUk connection function - -Figure I.6 shows the equipment functions for this application. The processing up to the ODUk layer is shown. A vendor-specific OTUkV signal is used in the example. - -The multi-channel interface port supports: - -- termination of the optical DWDM signal; -- termination of the OTS-O and OMS-O; -- wavelength multiplexing and demultiplexing; -- termination of the OTSiG-O; -- termination of OTUkV section overhead; -- termination of up to three levels of ODUk TCM overhead; -- ODUkP non-intrusive monitoring in ingress and egress directions; -- ODUk cross-connection. - -![Functional block diagram of a multi-channel interface port with 3-R regeneration functionality for an ODUk connection function. The diagram shows signal flow from external sources through various ODUk and OTUk processing stages, including TCMC and CI functions, down to an optical section with amplifiers and filters, ending at a media element.](4eda1b9e9c4f581b9747ffacabeae936_img.jpg) - -``` - - graph TD - Top[To/from ODUkP_TT, OTUk[V]/ODUk_A, ODUkT/ODUk_A, ODUkT_TT] --> ODUk_Oval((ODUk)) - ODUk_Oval --> ODUkT1[ODUkT] - ODUk_Oval --> ODUkT2[ODUkT] - ODUkT1 --> ODUk_CI1[ODUk_CI] - ODUk_CI1 --> ODUkT_ODUk1[ODUkT/ODUk] - ODUkT_ODUk1 --> ODUkT3[ODUkT] - ODUkT3 --> ODUk_CI2[ODUk_CI] - ODUkT_ODUk1 --- TCMC1[ODUk_TCMC] - ODUk_CI2 --> ODUkT_ODUk2[ODUkT/ODUk] - ODUkT_ODUk2 --- TCMC2[ODUk_TCMC] - ODUkT_ODUk2 --> ODUkT4[ODUkT] - ODUkT4 --> ODUk_CI3[ODUk_CI] - ODUk_CI3 --> ODUkT_ODUk3[ODUkT/ODUk] - ODUkT_ODUk3 --- TCMC3[ODUk_TCMC] - ODUkT_ODUk3 --> ODUkT5[ODUkT] - ODUkT5 --> ODUk_CI4[ODUk_CI] - ODUk_CI4 --> OTUkV_ODUk[OTUkV/ODUk] - OTUkV_ODUk --> OTUkV[OTUkV] - OTUkV --> OTUk_CI[OTUk_CI] - OTUk_CI --> OTSiA_OTUkV[OTSiA/OTUkV] - OTSiA_OTUkV --> AI_TSF[AI_TSF] - OTSiA_OTUkV --> OTSi[OTSi] - OTSiA_OTUkV --> OTSiG_O[OTSiG-O] - OTSi --> OTSiG[OTSiG] - OTSiG_O --> OTSiA[OTSiA] - OTSiA --> OTSiA_OCh_Oval((OTSiA | OCh)) - - subgraph Media_Element [Media element] - OTSiA_OCh_Oval --> OTSi_filter[OTSi filter] - OTSi_filter --> Optical_amp[Optical amplifier] - Optical_amp --> OSC_filter[OSC filter] - - OTSiA_OCh_Oval --> OMS_O_OTSiG[OMS-O/OTSiG | OCh-O] - OMS_O_OTSiG --> OMS_O[OMS-O] - OMS_O --> OMS_O_CI[OMS-O_CI] - OMS_O_CI --> OTS_O_OMS_O[OTS-O/OMS-O] - OTS_O_OMS_O --> OTS_O[OTS-O] - OTS_O --> OTS_O_CI[OTS-O_CI] - OTS_O_CI --> OSC_OTS_O[OSC/OTS-O] - OSC_OTS_O --> OSC[OSC] - OSC --> OTSi_OSC[OTSi/OSC] - OTSi_OSC --> OTSi_Bottom[OTSi] - - OMS_P_OPM[OMS-P OPM] -- OMS-P_LOS --> OMS_O - OTS_P_OPM[OTS-P OPM] -- OTS-P_LOS --> OTS_O - end - - Media_Element --- MC_Interface[Multi-channel interface] - -``` - -The diagram illustrates the functional architecture of a multi-channel interface port. At the top, multiple input paths are labeled "To/from ODUkP\_TT, OTUk[V]/ODUk\_A, ODUkT/ODUk\_A, ODUkT\_TT". These connect to a central "ODUk" processing block. Below this, the signal path descends through a series of stages: - - ODUkT / ODUkT blocks with associated "ODUk\_CI" labels. - - ODUkT/ODUk blocks, each followed by an "ODUk\_TCMC" (Tandem Connection Monitoring Control) block. - - ODUkT / ODUkT blocks with "ODUk\_CI" labels. - - ODUkT/ODUk blocks, each followed by an "ODUk\_TCMC" block. - - ODUkT / ODUkT blocks with "ODUk\_CI" labels. - - OTUkV/ODUk blocks, followed by "OTUkV" blocks and "OTUk\_CI" labels. - - OTSiA/OTUkV blocks, followed by "AI\_TSF" and "OTSiG" blocks. - The signals then enter a section labeled "OTSiA | OCh". This section includes: - - An "Optical amplifier" block connected to "OTSi filter" and "OSC filter" blocks. - - "OMS-P OPM" and "OTS-P OPM" (Optical Monitoring Point) blocks providing "OMS-P\_LOS" and "OTS-P\_LOS" (Loss of Signal) information. - - Downstream processing: "OMS-O/OTSiG | OCh-O" → "OMS-O" → "OMS-O\_CI" → "OTS-O/OMS-O" → "OTS-O" → "OTS-O\_CI" → "OSC/OTS-O" → "OSC" → "OTSi/OSC" → "OTSi". - The entire assembly is connected to a "Media element" at the bottom, and the interface is labeled "Multi-channel interface". The diagram is identified by the code "G.798(17)-Amd.3(21)\_Fl.6". - -Functional block diagram of a multi-channel interface port with 3-R regeneration functionality for an ODUk connection function. The diagram shows signal flow from external sources through various ODUk and OTUk processing stages, including TCMC and CI functions, down to an optical section with amplifiers and filters, ending at a media element. - -**Figure I.6 – Multi-channel interface port with 3-R regeneration functionality for an ODUk connection function** - -## **Appendix II** - -### **Blank appendix** - -(This appendix does not form an integral part of this Recommendation.) - -This appendix is intentionally left blank. - -## Appendix III - -### Performance of processes - -(This appendix does not form an integral part of this Recommendation.) - -#### III.1 Introduction - -This appendix provides information on the performance of some processes such as defect detection and frame alignment. - -#### III.2 OTuk frame alignment process - -##### III.2.1 False out-of-frame events - -False out-of-frame events will occur whenever the in-frame state is lost due to the line bit error rate. This event is related to the probability $P_{wFAS}$ of receiving a corrupted FAS, which is equal to: - -$$P_{wFAS} = 1 - (1 - \varepsilon)^{FASL} \cong \varepsilon \times FASL$$ - -Where $\varepsilon$ is the line bit error rate, with Poisson distribution, and FASL is the number of bits of the FAS to be checked. The probability $P_{fOOF}$ that the system will detect an OOF state coincides with the probability that $\alpha$ consecutive FAS are received. It means that: - -$$P_{fOOF} = P_{wFAS}^{\alpha} \cong (\varepsilon \times FASL)^{\alpha}$$ - -It shall be noted that such a probability of occurrence is directly proportional to the FAS length and inversely proportional to the number of pre-alarm states (i.e., $\alpha - 1$ ) defined in the alignment process. - -The average time between two false out-of-frame events is defined as follows: - -$$T_{fOOF} = \frac{T_{frame}}{P_{fOOF}}$$ - -##### III.2.2 Minimum average time between false out-of-frame events - -It is not possible to give the exact expression for the minimum average time between two out-of-frame events, due to it being a stochastic process. It is instead possible to give an approximate value for it. Given that the distribution of the OOF events is Poisson-like, it is possible to evaluate the minimum interval between two events with a given probability of occurrence. In other words, assuming that the probability of occurrence of an out-of-frame event in an interval shorter than $T_{min}$ is $P[t \leq T_{min}] = p$ , it can be demonstrated that: - -$$T_{min} = -T_{OOF} \times \ln(1 - p)$$ - -With $p = 10^{-3}$ the minimum average time between false OOF events results: $T_{min} \cong T_{OOF} \times 10^{-3}$ . - -Figure III.1 shows the numerical results. - -![Figure III.1: Minimum average time between false out-of-frame events. The graph plots 'Minimum average time between two OOF events (minutes)' on the y-axis (0 to 30) against 'Line BER (10^-3)' on the x-axis (3 to 3.8). Three curves are shown: OTU1 (orange dashed), OTU2 (blue dash-dot), and OTU3 (green solid). A horizontal purple line at 6 minutes is labeled '6 min'. The curves show that as BER increases, the minimum average time between OOF events decreases. OTU1 reaches 6 minutes at approximately BER 3.35, OTU2 at approximately 3.55, and OTU3 at approximately 3.7. A small label 'G.798(12)_FIII.1' is in the bottom right corner.](e7b45a567404ef205acf9b0ae262216f_img.jpg) - -Figure III.1: Minimum average time between false out-of-frame events. The graph plots 'Minimum average time between two OOF events (minutes)' on the y-axis (0 to 30) against 'Line BER (10^-3)' on the x-axis (3 to 3.8). Three curves are shown: OTU1 (orange dashed), OTU2 (blue dash-dot), and OTU3 (green solid). A horizontal purple line at 6 minutes is labeled '6 min'. The curves show that as BER increases, the minimum average time between OOF events decreases. OTU1 reaches 6 minutes at approximately BER 3.35, OTU2 at approximately 3.55, and OTU3 at approximately 3.7. A small label 'G.798(12)\_FIII.1' is in the bottom right corner. - -**Figure III.1 – Minimum average time between false out-of-frame events** - -### III.2.3 False in-frame events - -The probability for false in-frame alignment can be obtained noting that the FAS is searched for up to one frame (FL bit long) with FL-1 possibilities for a false (simulated) FAS and confirmed the following $\delta$ frames. Given the equi-probability of receiving the symbol '0' or symbol '1', it is clear that the simulation of FAS only depends on FAS length. In fact, it results: - -$$P_{fFAS} = \left(\frac{1}{2}\right)^{FASL}$$ - -False frame recovery probability can be defined as: - -$$P_{ff} = 1 - (1 - P_{fFAS})^{FL-1}$$ - -The resulting probability for the false in-frame event thus results: - -$$P_{fIF} = P_{ff} \times P_{fFAS}^{\delta}$$ - -The resulting rate of false frame recovery occurrence depends on frame length and is equal to: - -$$T_{fIF} = \frac{T_{frame}}{P_{fIF}}$$ - -### III.2.4 Frame alignment time - -The frame alignment time is the time needed to reach the in-frame state starting from out-of-frame state. - -In case of no FAS simulation, it is clear that this time is $T_{frame} \times (1 + \delta)$ . Otherwise, the detection of a false FAS will start an alignment process that will lead inevitably to OOF state. This time is taken into account in the above defined relation with an aleatory variable, $H$ , depending on false frame alignment probability; that means: - -$$T_{IF} = T_{frame} \times (1 + \delta + H)$$ - -The value of the variable $H$ is approximated by: - -$$H = P_{fFAS} \times FASL$$ - -It shall be noted that in practice the frame alignment time is not affected by the false alignment occurrence. It means that, in any case, the in-frame state will be reached in two periods of the OTUk frame. - -### III.3 STAT acceptance process and related defect detection - -#### III.3.1 Average acceptance, raising and clearing time - -The average acceptance time for the STAT field can be calculated using Equation 33 of [b-Choi] as the STAT acceptance procedure is analogous to the misframe declaration procedure in Figure 7 of [b-Choi] by reading $p_d$ as probability for a disturbed STAT value. - -**Table III.1 – Average STAT acceptance time** - -| BER | ODU frames | | Time ( $\mu\text{s}$ ) | | | | | | | -|---------|------------|--------|------------------------|-------|------|-------|------|------|-------| -| | X = 3 | X = 15 | ODU0 | ODU1 | ODU2 | ODU2e | ODU3 | ODU4 | ODUCn | -| 1.0E-03 | 3.02 | 15.37 | 296.8 | 147.8 | 36.8 | 35.5 | 9.2 | 3.5 | 17.9 | -| 1.0E-04 | 3.00 | 15.04 | 295.2 | 147.0 | 36.6 | 35.3 | 9.1 | 3.5 | 17.5 | -| 1.0E-05 | 3.00 | 15.00 | 295.1 | 146.9 | 36.6 | 35.3 | 9.1 | 3.5 | 17.4 | -| 1.0E-06 | 3.00 | 15.00 | 295.1 | 146.9 | 36.6 | 35.3 | 9.1 | 3.5 | 17.4 | - -The average dAIS, dOCI, dLTC, dLCK and dIAE raising/clearing time is equal to the average acceptance time. - -#### III.3.2 Mean time between false OTUCn dAIS, ODUP/T dAIS and ODU T dIAE defects due to bit errors assuming a transmitted STAT value of "001" (normal path signal) - -$$p_d(\text{false dAIS}) = (\text{BER}^2 \cdot (1 - \text{BER}))^X$$ - -where X is the number of consecutive STAT fields for acceptance (X = 3 for ODUk, X = 15 for ODUCn). - -The mean number of frames between false defects is approximately the reciprocal of $p_d$ : $t_{dm} = 1/p_d$ . - -**Table III.2 – Mean time between false ODUCn dAIS, ODUP/T dAIS and ODUT dIAE defects** - -| BER | ODU frames | | Time (year) | | | | | | | -|---------|------------|----------|-------------|---------|---------|---------|---------|---------|----------| -| | X=3 | X=15 | ODU0 | ODU1 | ODU2 | ODU2e | ODU3 | ODU4 | ODUCn | -| 1.0E-03 | 1.0E+18 | 1.0E+90 | 3.1E+06 | 1.6E+06 | 3.9E+05 | 3.7E+05 | 9.7E+04 | 3.7E+04 | 3.7E+76 | -| 1.0E-04 | 1.0E+24 | 1.0E+120 | 3.1E+12 | 1.6E+12 | 3.9E+11 | 3.7E+11 | 9.6E+10 | 3.7E+10 | 3.7E+106 | -| 1.0E-05 | 1.0E+30 | 1.0E+150 | 3.1E+18 | 1.6E+18 | 3.9E+17 | 3.7E+17 | 9.6E+16 | 3.7E+16 | 3.7E+136 | -| 1.0E-06 | 1.0E+36 | 1.0E+180 | 3.1E+24 | 1.6E+24 | 3.9E+23 | 3.7E+23 | 9.6E+22 | 3.7E+22 | 3.7E+166 | - -#### III.3.3 Mean time between false ODU dOCI defects due to bit errors assuming a transmitted STAT value of "001" (normal path signal) - -$$p_d(\text{false dOCI}) = (\text{BER}^3)^X$$ - -where X is the number of consecutive STAT fields for acceptance (X = 3 for ODUk, X = 15 for ODUCn). - -The mean number of frames between false defects is approximately the reciprocal of $p_d$ : $t_{dm} = 1/p_d$ . - -**Table III.3 – Mean time between false ODU dOCI defects** - -| BER | ODU frames | | Time (year) | | | | | | | -|---------|------------|----------|-------------|---------|---------|---------|---------|---------|----------| -| | X=3 | X=15 | ODU0 | ODU1 | ODU2 | ODU2e | ODU3 | ODU4 | ODUCn | -| 1.0E-03 | 1.0E+27 | 1.0E+135 | 3.1E+15 | 1.6E+15 | 3.9E+14 | 3.7E+14 | 9.6E+13 | 3.7E+13 | 3.7E+121 | -| 1.0E-04 | 1.0E+36 | 1.0E+180 | 3.1E+24 | 1.6E+24 | 3.9E+23 | 3.7E+23 | 9.6E+22 | 3.7E+22 | 3.7E+166 | -| 1.0E-05 | 1.0E+45 | 1.0E+225 | 3.1E+33 | 1.6E+33 | 3.9E+32 | 3.7E+32 | 9.6E+31 | 3.7E+31 | 3.7E+211 | -| 1.0E-06 | 1.0E+54 | 1.0E+270 | 3.1E+42 | 1.6E+42 | 3.9E+41 | 3.7E+41 | 9.6E+40 | 3.7E+40 | 3.7E+256 | - -### III.3.4 Mean time between false ODUT dLTC and ODUP/T dLCK defects due to bit errors assuming a transmitted STAT value of "001" (normal path signal) - -$$p_d(\text{false dLTC, dLCK}) = (\text{BER} \cdot (1 - \text{BER})^2)^X$$ - -where X is the number of consecutive STAT fields for acceptance (X = 3 for ODUk, X = 15 for ODUCn). - -The mean number of frames between false defects is approximately the reciprocal of $p_d$ : $t_{dm} = 1/p_d$ . - -**Table III.4 – Mean time between false ODUkTdLTC and ODUP/TdLCK defects** - -| BER | | 1.0E-03 | 1.0E-04 | 1.0E-05 | 1.0E-06 | -|------------|------|---------------|---------------|---------------|---------------| -| ODU frames | X=3 | 1.01E+09 | 1.00E+12 | 1.00E+15 | 1.00E+18 | -| ODU0 | | 27.5 h | 3,1 years | 3.1E+03 years | 3.1E+06 years | -| ODU1 | | 13.7 h | 1.6 years | 1.6E+03 years | 1.6E+06 years | -| ODU2 | | 3.4 h | 3.9E-01 years | 3.9E+02 years | 3.9E+05 years | -| ODU2e | | 3.3 h | 3.7E-01 years | 3.7E+02 years | 3.7E+05 years | -| ODU3 | | 0.8 h | 843.6 h | 9.6E+01 years | 9.6E+04 years | -| ODU4 | | 0.3 h | 324.6 h | 3.7E+01 years | 3.7E+04 years | -| ODU frames | X=15 | 1.03E+45 | 1.00E+60 | 1.00E+75 | 1.00E+90 | -| ODUCn | | 3.8E+31 years | 3.7E+46 years | 3.7E+61 years | 3.7E+76 years | - -## III.4 OTU dIAE, OTU dBDI, ODU dBDI detection - -### III.4.1 Average raising and clearing time - -The average raising/clearing delay can be calculated using Equation 33 of [b-Choi] as the detection procedure is analogous to the misframe declaration procedure in Figure 7 of [b-Choi] by reading $p_d$ as probability for a disturbed value. - -**Table III.5 – Average OTU dIAE, ODU dBDI, ODU dBDI raising/clearing time** - -| BER | OTU/ODU frames | Time (μs) | | | | | | | -|---------|----------------|-----------|-------|------|-------|------|------|-------| -| | | ODU0 | ODU1 | ODU2 | ODU2e | ODU3 | ODU4 | ODUCn | -| 1.0E-03 | 5.02 | 493.2 | 245.6 | 61.1 | 59.0 | 15.2 | 5.9 | 5.8 | -| 1.0E-04 | 5.00 | 491.9 | 244.9 | 61.0 | 58.9 | 15.2 | 5.8 | 5.8 | -| 1.0E-05 | 5.00 | 491.8 | 244.9 | 61.0 | 58.8 | 15.2 | 5.8 | 5.8 | -| 1.0E-06 | 5.00 | 491.8 | 244.9 | 61.0 | 58.8 | 15.2 | 5.8 | 5.8 | - -### III.4.2 Mean time between false defects due to bit errors - -$$p_d(\text{false dBDI}) = \text{BER}^X$$ - -where X is the number of consecutive fields for acceptance ( $X = 5$ ). - -The mean number of frames between false defects is approximately the reciprocal of $p_d$ : $t_{dm} = 1/p_d$ . - -**Table III.6 – Mean time between false OTU dIAE, OTUk dBDI, ODU dBDI defects** - -| BER | OTU/ODU frames | Time (year) | | | | | | | -|---------|----------------|-------------|---------|---------|---------|---------|---------|---------| -| | | ODU0 | ODU1 | ODU2 | ODU2e | ODU3 | ODU4 | ODUCn | -| 1.0E-03 | 1.00E+15 | 3.1E+03 | 1.6E+03 | 3.9E+02 | 3.7E+02 | 9.6E+01 | 3.7E+01 | 3.7E+01 | -| 1.0E-04 | 1.00E+20 | 3.1E+08 | 1.6E+08 | 3.9E+07 | 3.7E+07 | 9.6E+06 | 3.7E+06 | 3.7E+06 | -| 1.0E-05 | 1.00E+25 | 3.1E+13 | 1.6E+13 | 3.9E+12 | 3.7E+12 | 9.6E+11 | 3.7E+11 | 3.7E+11 | -| 1.0E-06 | 1.00E+30 | 3.1E+18 | 1.6E+18 | 3.9E+17 | 3.7E+17 | 9.6E+16 | 3.7E+16 | 3.7E+16 | - -## III.5 PT acceptance process and ODUPdPLM detection - -### III.5.1 Average acceptance, raising and clearing time - -The average acceptance time for the PT field can be calculated using Equation 33 of [b-Choi] as the PT acceptance procedure is analogous to the misframe declaration procedure in Figure 7 of [b-Choi] by reading $p_d$ as probability for a disturbed PT value. - -**Table III.7 – Average PT acceptance time** - -| BER | ODU multiframes | Time (ms) | | | | | | | -|---------|-----------------|-----------|------|------|-------|------|------|-------| -| | | ODU0 | ODU1 | ODU2 | ODU2e | ODU3 | ODU4 | ODUCn | -| 1.0E-03 | 3.05 | 76.8 | 38.2 | 9.5 | 9.2 | 2.4 | 0.9 | 0.9 | -| 1.0E-04 | 3.00 | 75.7 | 37.7 | 9.4 | 9.1 | 2.3 | 0.9 | 0.9 | -| 1.0E-05 | 3.00 | 75.5 | 37.6 | 9.4 | 9.0 | 2.3 | 0.9 | 0.9 | -| 1.0E-06 | 3.00 | 75.5 | 37.6 | 9.4 | 9.0 | 2.3 | 0.9 | 0.9 | - -The average dPLM raising/clearing time is equal to the average acceptance time. - -### III.5.2 Mean time between false PLM defects due to bit errors - -A false PLM defect is declared if the same i bits (out of $n = 8$ ) are disturbed in $X = 3$ consecutive multiframes. According to Equation 33 of [b-Choi], the mean number of multiframes between the acceptance of a false PT byte with i certain false bits is: - -$$t_{mf, i} = \frac{1}{p_i^X} \frac{1 - p_i^X}{1 - p_i}$$ - -with the probability $p_i$ of i certain bits being disturbed within one multiframe. - -$$p_i = \text{BER}^i \cdot (1 - \text{BER})^{n-i}$$ - -The mean number of multiframes between any false acceptance resulting in a false dPLM is: - -$$t_{mf} = \frac{1}{\sum_i \binom{n}{i} \cdot \frac{1}{t_{mf,i}}}$$ - -**Table III.8 – Mean time between false ODUPL defects** - -| BER | | 1.0E-03 | 1.0E-04 | 1.0E-05 | 1.0E-06 | -|-------------------|-----|----------|-------------|----------------|----------------| -| ODU frames | X=3 | 1.25E+08 | 1.25E+11 | 1.25E+14 | 1.25E+17 | -| ODU0 | | 893.7 h | 100.0 years | 9.98E+04 years | 9.98E+04 years | -| ODU1 | | 445.0 h | 49.6 years | 4.97E+04 years | 4.97E+07 years | -| ODU2 | | 110.8 h | 12.4 years | 1.24E+04 years | 1.24E+07 years | -| ODU2e | | 106.9 h | 12.0 years | 1.19E+04 years | 1.19E+07 years | -| ODU3 | | 27.6 h | 3.1 years | 3.08E+03 years | 3.08E+06 years | -| ODU4 | | 10.6 h | 1.2 years | 1.19E+03 years | 1.18E+06 years | -| ODUCn | | 10.6 h | 1.2 years | 1.18E+03 years | 1.18E+06 years | - -### III.6 Generic AIS and OTUk-AIS (k = 1, 2, 3) detection - -#### III.6.1 Average dAIS detection time - -The probability of detecting the generic AIS pattern within one counting interval is: - -$$p_d = \sum_{k=0}^{255} \binom{Nb}{k} \cdot (3 \cdot BER)^k \cdot (1 - 3 \cdot BER)^{(Nb-k)}$$ - -with Nb = 8192 being the number of bits per counting interval. Inserting $p_d$ and the number of counting intervals in which the generic AIS signal must be detected before raising the defect, $c = 3$ , into Equation 33 of [b-Choi] leads to the average dAIS detection time. The factors of three found in the above equation are due to the error multiplication that occurs within the generic AIS detection circuit (see clause 6.2.6.3.3). - -**Table III.9 – Average dAIS detection time** - -| BER | | 2.0E-02 | 1.0E-02 | 1.0E-03 | 1.0E-04 | 1.0E-05 | 1.0E-06 | -|--------------|-------------|---------|---------|---------|---------|---------|---------| -| intervals | (8192 bits) | 5.0E+98 | 5.68 | 3 | 3 | 3 | 3 | -| | | (years) | (μs) | | | | | -| ODU0 | | 1.0E+86 | 37.40 | 19.75 | 19.75 | 19.75 | 19.75 | -| ODU1 | | 5.2E+85 | 18.62 | 9.84 | 9.84 | 9.84 | 9.84 | -| ODU2 | | 1.3E+85 | 4.64 | 2.45 | 2.45 | 2.45 | 2.45 | -| ODU2e | | 1.2E+85 | 4.47 | 2.36 | 2.36 | 2.36 | 2.36 | -| ODU3 | | 3.2E+84 | 1.15 | 0.61 | 0.61 | 0.61 | 0.61 | -| ODU4 | | 1.2E+84 | 0.44 | 0.23 | 0.23 | 0.23 | 0.23 | -| ODUCn | | 1.2E+84 | 0.44 | 0.23 | 0.23 | 0.23 | 0.23 | - -**III.7 OTU and ODUT dBIAE detection process** - -**III.7.1 Average dBIAE detection time** - -The average dBIAE detection/clearing time can be calculated using Equation 33 of [b-Choi], as the procedure is analogous to the misframe declaration procedure in Figure 7 of [b-Choi] by reading $q_d$ as probability for an undisturbed BIAE value. - -$$q_d = (1 - BER)^n$$ - -$$t_d = \frac{1}{q_d^X} \frac{1 - q_d^X}{1 - q_d}$$ - -n: number of BEI/BIAE bits (n = 4) - -X: number of consecutive BIAE values for dBIAE (X = 3). - -**Table III.10 – Average dBIAE detection/clearing time** - -| BER | OTU/ODU frames | | Time (μs) | | | | | | | -|---------|----------------|-------|-----------|-------|------|-------|------|------|-------| -| | X=3 | X=15 | ODU0 | ODU1 | ODU2 | ODU2e | ODU3 | ODU4 | ODUCn | -| 1.0E-03 | 3.02 | 15.49 | 297.4 | 148.1 | 36.9 | 35.6 | 9.2 | 3.5 | 18.0 | -| 1.0E-04 | 3.00 | 15.05 | 295.3 | 147.0 | 36.6 | 35.3 | 9.1 | 3.5 | 17.5 | -| 1.0E-05 | 3.00 | 15.00 | 295.1 | 146.9 | 36.6 | 35.3 | 9.1 | 3.5 | 17.4 | -| 1.0E-06 | 3.00 | 15.00 | 295.1 | 146.9 | 36.6 | 35.3 | 9.1 | 3.5 | 17.4 | - -**III.7.2 Mean time between false BIAE defects due to bit errors** - -A false BIAE defect is declared if the received BEI value is disturbed in such a way that the BIAE value (i.e., '1011') is falsely detected in X = 3 consecutive frames. Since the BEI value changes each frame due to received far-end bit errors, the probability of a false BIAE value occurring depends on the specific value of BEI generated each frame. Therefore, the probability of detecting a false BIAE value is the product of the conditional probability of a false BIAE value occurring given a particular BEI value and the probability of the occurrence of the particular BEI value. Summing over all possible BEI values gives the total probability of a false BIAE being detected in any single frame: - -$$p = \sum_{k=0}^8 p_{BEI,k} \cdot p_{BIAE|BEI,k}$$ - -where: - -$$p_{BEI, k} = \binom{8}{k} (p_{BIP1})^k \cdot (1 - p_{BIP1})^{8-k}, \quad 0 \leq k \leq 8$$ - -and: - -$$p_{BIAE|BEI, k} = (BER)^n \cdot (1 - BER)^{4-n}, \quad 0 \leq k \leq 8$$ - -where $n$ represents the number of BEI bit errors required to convert the BEI value to a false BIAE value ( $n = 3, 2, 2, 1, 4, 3, 3, 2, 2$ , for $k = 0, 1, 2, 3, 4, 5, 6, 7$ and $8$ , respectively). Additionally, Equation C.3 of [b-ATIS 0300231.01] provides a closed form expression for the probability of an error in a single BIP thread as follows: - -$$p_{BIP1} = \frac{1 - (1 - 2 \cdot BER)^m}{2}, \quad m = 15240$$ - -The value 15240 represents the number of bits per thread of the BIP-8 of the ODU tandem connection and path monitors. - -According to Equation 33 of [b-Choi], the mean number of frames between false BIAE defects because of bit errors within the BEI/BIAE field is: - -$$t_{mf} = \frac{1}{p^X} \frac{1 - p^X}{1 - p}$$ - -with the probability $p$ of a false BIAE. - -In Table III.11, the same BER for both directions of a bidirectional connection is assumed. - -**Table III.11 – Mean time between false BIAE defects** - -| BER | | 1.0E-03 | 1.0E-04 | 1.0E-05 | 1.0E-06 | -|-------------------|-----|---------|---------|---------|---------| -| ODU frames | X=3 | 9.6E+10 | 7.4E+13 | 4.0E+18 | 1.8E+29 | -| | | (h) | (years) | | | -| ODU0 | | 2628 | 230 | 1.3E+07 | 5.7E+17 | -| ODU1 | | 1308 | 115 | 6.3E+06 | 2.9E+17 | -| ODU2 | | 326 | 28.6 | 1.6E+06 | 7.2E+16 | -| ODU2e | | 314 | 27.6 | 1.5E+05 | 6.9E+16 | -| ODU3 | | 81.1 | 7.1 | 3.9E+05 | 1.8E+16 | -| ODU4 | | 31.2 | 2.74 | 1.5E+05 | 6.8E+15 | -| ODUCn | | 31.1 | 2.72 | 1.5E+05 | 6.8E+15 | - -## Appendix IV - -### TTI processing examples - -(This appendix does not form an integral part of this Recommendation.) - -This appendix gives implementation examples for TTI processing that fulfil the definitions given in the main body of this Recommendation. Other implementations that fulfil the definitions are possible. - -#### IV.1 Example 1 - -##### IV.1.1 Trail trace identifier (TTI) acceptance and reporting process - -A new TTI is accepted if a new consistent value is received in the 64 TTI bytes in X consecutive multiframes. X shall be 3. - -The accepted TTI shall be reported to the management system (MI\_AcTI) if requested (MI\_GetAcTI). The SAPI and DAPI part of the accepted TTI shall be compared with the expected SAPI and DAPI for TTI mismatch detection (see clause IV.I.2). - -##### IV.1.2 SAPI/DAPI compare process - -The SAPI/DAPI compare process compares the SAPI/DAPI part of the accepted TTI (AcTI, see clause IV.1.1) with the equivalent expected SAPI/DAPI values set via the MP (MI\_ExSAPI/DAPI). The comparison result is "match" if all 16 bytes were equal, and "mismatch" if one or more bytes were unequal. - -For the dTIM generation based on the results of the SAPI/DAPI compare process, see clause 6.2.2.1. - -#### IV.1.3 Performance of example 1 - -##### IV.1.3.1 Average TTI acceptance time - -The average TTI acceptance time can be calculated using Equation 33 of [b-Choi], as the procedure is analogous to the misframe declaration procedure in Figure 7 of [b-Choi] by reading $q_d$ as probability for the received TTI value being equal to the last one. - -$$q_d = (1 - BER)^n$$ - -$$t_d = \frac{1}{q_d^X} \frac{1 - q_d^X}{1 - q_d}$$ - -n: number of TTI bits (n = 512) - -X: number of consecutive equal comparison results for TTI acceptance (X = 3). - -Table IV.1 – Average TTI acceptance time - -| BER | TTI periods | Time (ms) | | | | | | | -|---------|-------------|-----------|------|------|-------|------|------|-------| -| | | ODU0 | ODU1 | ODU2 | ODU2e | ODU3 | ODU4 | ODUCn | -| 1.0E-03 | 9.10 | 57.3 | 28.5 | 7.1 | 6.9 | 1.8 | 0.7 | 0.7 | -| 1.0E-04 | 3.33 | 20.9 | 10.4 | 2.6 | 2.5 | 0.6 | 0.2 | 0.2 | -| 1.0E-05 | 3.03 | 19.1 | 9.5 | 2.4 | 2.3 | 0.6 | 0.2 | 0.2 | -| 1.0E-06 | 3.00 | 18.9 | 9.4 | 2.3 | 2.3 | 0.6 | 0.2 | 0.2 | - -#### IV.1.3.2 Average dTIM detection and clearing time - -The average dTIM detection and clearing times are equal to the TTI acceptance time. - -#### IV.1.3.3 Mean time between false TIM defects due to bit errors - -A false TTI defect is declared if a TTI with bit errors is accepted and an errored bit is within the compared SAPI, respectively DAPI, field of the TTI. The same $i$ bits (out of $n = 512$ ) have to be disturbed in $X = 3$ consecutive TTIs. According to Equation 33 of [b-Choi], the mean number of TTIs between the acceptance of a false TTI with $i$ certain false bits is: - -$$t_{mf,i} = \frac{1}{p_i^X} \cdot \frac{1-p_i^X}{1-p_i}$$ - -with the probability $p_i$ of $i$ certain bits being disturbed within one TTI: - -$$p_i = BER^i \cdot (1-BER)^{n-i}$$ - -The mean number of TTIs between any false dTIM is: - -$$t_{mf} = \frac{1}{\sum_i \frac{p_{API,i}}{t_{mf,i}}}$$ - -with the probability $p_{API,i}$ that the API field contains an errored bit of the false accepted TTI with $i$ bit errors. - -$n$ : number of TTI bits - -$X$ : number of consecutive equal comparison results for TTI acceptance ( $X = 3$ ) - -**Table IV.2 – Mean time between false TIM defects** - -| BER | | 1.0E-03 | 1.0E-04 | 1.0E-05 | 1.0E-06 | -|------------|-------|----------|----------|----------|-----------| -| ODU frames | $X=3$ | 3.62E+07 | 9.11E+09 | 7.93E+12 | 7.82E+15 | -| | | (h) | (years) | | | -| ODU0 | | 63.4 | 1.8 | 1583 | 1 561 785 | -| ODU1 | | 31.5 | 0.9 | 788 | 777 625 | -| ODU2 | | 7.9 | 0.23 | 196 | 193 589 | -| ODU2e | | 7.6 | 0.22 | 189 | 186 846 | -| ODU3 | | 2.0 | 0.06 | 49 | 48 193 | -| ODU4 | | 0.8 | 0.02 | 19 | 18 542 | -| ODUCn | | 0.7 | 0.02 | 19 | 18 460 | - -## IV.2 Example 2 - -### IV.2.1 TTI reporting - -TTI reporting consists of control, compare and store, and persistency processes as shown in Figure IV.1. When a request for TTI reporting is received via MI\_GetAcTI by the control process, it starts the compare and store, and persistency processes. - -The compare and store process contains a 64-byte store, holding the latest stored TTI. Once started, this process compares the received TTI byte with the equivalent byte in the store. After the comparison the byte is copied into the store. After all 64 bytes have been compared and stored, the - - - -$$t_d = \frac{1}{q_d^X} \frac{1 - q_d^X}{1 - q_d}$$ - -n: number of TTI bits (n = 512) - -X: number of consecutive equal comparison results for a stable TTI (X = 3) - -**Table IV.3 – Average TTI acceptance time** - -| BER | TTI periods | Time (ms) | | | | | | | -|---------|-------------|-----------|------|------|-------|------|------|-------| -| | | ODU0 | ODU1 | ODU2 | ODU2e | ODU3 | ODU4 | ODUCn | -| 1.0E-03 | 9.10 | 57.3 | 28.5 | 7.1 | 6.9 | 1.8 | 0.7 | 0.7 | -| 1.0E-04 | 3.33 | 20.9 | 10.4 | 2.6 | 2.5 | 0.6 | 0.2 | 0.2 | -| 1.0E-05 | 3.03 | 19.1 | 9.5 | 2.4 | 2.3 | 0.6 | 0.2 | 0.2 | -| 1.0E-06 | 3.00 | 18.9 | 9.4 | 2.3 | 2.3 | 0.6 | 0.2 | 0.2 | - -#### IV.2.3.2 Average dTIM detection time - -The average dTIM detection time can be calculated using Equation 33 of [b-Choi], as the procedure is analogous to the misframe declaration procedure in Figure 7 of [b-Choi] by reading $q_d$ as probability for an unequal SAPI, respectively DAPI, value. Here the worst case is calculated where ExSAPI and RxSAPI, respectively ExDAPI and RxDAPI, differ in only one bit. - -$$q_d = 1 - BER$$ - -$$t_d = \frac{1}{q_d^X} \frac{1 - q_d^X}{1 - q_d}$$ - -X: number of consecutive unequal comparison results for dTIM (X = 7) - -**Table IV.4 – Average dTIM detection time** - -| BER | TTI periods | Time (ms) | | | | | | | -|---------|-------------|-----------|------|------|-------|------|------|-------| -| | | ODU0 | ODU1 | ODU2 | ODU2e | ODU3 | ODU4 | ODUCn | -| 1.0E-03 | 7.03 | 44.2 | 22.0 | 5.5 | 5.3 | 1.4 | 0.5 | 0.5 | -| 1.0E-04 | 7.00 | 44.1 | 21.9 | 5.5 | 5.3 | 1.4 | 0.5 | 0.5 | -| 1.0E-05 | 7.00 | 44.1 | 21.9 | 5.5 | 5.3 | 1.4 | 0.5 | 0.5 | -| 1.0E-06 | 7.00 | 44.1 | 21.9 | 5.5 | 5.3 | 1.4 | 0.5 | 0.5 | - -#### IV.2.3.3 Average dTIM clearing time - -The average dTIM clearing time can be calculated using Equation 33 of [b-Choi], as the procedure is analogous to the misframe declaration procedure in Figure 7 of [b-Choi] by reading $q_d$ as probability for an equal SAPI, respectively DAPI, value. - -$$q_d = (1 - BER)^n$$ - -$$t_d = \frac{1}{q_d^X} \frac{1 - q_d^X}{1 - q_d}$$ - -n: number of SAPI, respectively DAPI, bits (n = 128) - -X: number of consecutive equal comparison results for dTIM clearance (X = 3) - -**Table IV.5 – Average dTIM clearance time for point-to-multipoint and multipoint-to-point configurations** - -| BER | TTI periods | Time (ms) | | | | | | | -|---------|-------------|-----------|------|------|-------|------|------|-------| -| | | ODU0 | ODU1 | ODU2 | ODU2e | ODU3 | ODU4 | ODUCn | -| 1.0E-03 | 3.90 | 24.5 | 12.2 | 3.0 | 2.9 | 0.8 | 0.3 | 0.3 | -| 1.0E-04 | 3.08 | 19.4 | 9.6 | 2.4 | 2.3 | 0.6 | 0.2 | 0.2 | -| 1.0E-05 | 3.01 | 18.9 | 9.4 | 2.3 | 2.3 | 0.6 | 0.2 | 0.2 | -| 1.0E-06 | 3.00 | 18.9 | 9.4 | 2.3 | 2.3 | 0.6 | 0.2 | 0.2 | - -**IV.2.3.4 Mean time between false TIM defects due to bit errors** - -The mean time between false TIM defects can be calculated using Equation 33 of [b-Choi], as the procedure is analogous to the misframe declaration procedure in Figure 7 of [b-Choi] by reading $q_d$ as probability for an unequal SAPI, respectively DAPI, value due to bit errors. - -$$q_d = 1 - (1 - BER)^n$$ - -$$t_d = \frac{1}{q_d^X} \frac{1 - q_d^X}{1 - q_d}$$ - -n: number of SAPI, respectively DAPI, bits (n = 128) - -X: number of consecutive unequal comparison results for dTIM (X = 7) - -**Table IV.6 – Mean time between false TIM defects for point-to-multipoint and multipoint-to-point configurations** - -| BER | | 1.0E-03 | 1.0E-04 | 1.0E-05 | 1.0E-06 | -|--------------|-----|----------|----------|----------|----------| -| ODU frames | X=7 | 3.13E+06 | 1.88E+13 | 1.79E+20 | 1.78E+27 | -| | | (h) | (years) | | | -| ODU0 | | 5.5 | 3754 | 3.6E+10 | 3.5E+17 | -| ODU1 | | 2.7 | 1869 | 1.8E+10 | 1.8E+17 | -| ODU2 | | 0.7 | 465 | 4.4E+09 | 4.4E+16 | -| ODU2e | | 0.7 | 449 | 4.3E+09 | 4.2E+16 | -| ODU3 | | 0.2 | 116 | 1.1E+09 | 1.1E+16 | -| ODU4 | | 0.1 | 45 | 4.2E+08 | 4.2E+15 | -| ODUCn | | 0.1 | 44 | 4.2E+08 | 4.2E+15 | - -## **Appendix V** - -### **Blank appendix** - -(This appendix does not form an integral part of this Recommendation.) - -This appendix is intentionally left blank. - -## **Appendix VI** - -### **Blank appendix** - -(This appendix does not form an integral part of this Recommendation.) - -This appendix is intentionally left blank. - -**Appendix VII** - -**Examples of media elements** - -(This appendix does not form an integral part of this Recommendation.) - -This appendix provides examples where a media element encapsulates the OMS or OTS end points. - -![Figure VII.1 – Example of an OTN terminal implemented with a single media element](782eaa616e0b199419dde477a878be7d_img.jpg) - -The diagram illustrates the functional model of an OTN terminal. At the top, an OTUk\_CI signal enters an OTSi/OTUKV adaptation function. Below this, an OTSi signal is formed, which then enters an OTSiG group. A dashed line indicates coordination (AI\_TSF) with an OTSiG-O function. The signals pass through an OTSiA|OCh layer. A large grey box labeled 'Media element' contains several components: an OTSi filter, an optical amplifier, and an OSC filter. Monitoring points (OMS-P OPM and OTS-P OPM) provide defect indications (DI\_dLOS-P[OMS] and DI\_dLOS-P[OTS]) to the overhead processing chain on the right. This chain includes functions for OMS-O/OTSiG|OCh-O, OMS-O, OTS-O/OMS-O, OTS-O, OSC/OTS-O, OSC, and OTSi/OSC, ending in an OTSi termination. The bottom of the media element connects to a Multi-channel interface. - -Figure VII.1 – Example of an OTN terminal implemented with a single media element - -G.798(23)\_FVII.1 - -Multi-channel interface - -**Figure VII.1 – Example of an OTN terminal implemented -with a single media element** - -Rec. ITU-T G.798 (09/2023)    461 - -![Diagram of a single vendor OTN line system with three media elements connected by fibre. Each element contains an OSC filter, OTSi, OTS-P OPM, Optical amplifier, OMS-P OPM, and OTSi filter connected to a Media subnetwork. OSC network connections are shown between the elements.](4e09aad97504825adf16d63ace42b461_img.jpg) - -The diagram illustrates a single vendor OTN line system implemented with a single media element in each location. It consists of three main components connected by fibre: - -- Left Media Element:** Contains an OSC filter, OTSi, OTS-P OPM, Optical amplifier, OMS-P OPM, and OTSi filter. The OTSi filter is connected to a Media subnetwork, which in turn connects to two OTSi units. The OSC filter is connected to a fibre line and an OSC network connection (via an OSC unit and OTSi unit). -- Central Media Element:** Contains an OSC filter, OTS-P OPM, Optical amplifier, and OTS-P OPM. The OSC filter is connected to a fibre line and an OSC network connection (via an OSC unit and OTSi unit). The OTS-P OPM units are connected to the Optical amplifier. -- Right Media Element:** Similar to the left element, it contains an OSC filter, OTSi, OTS-P OPM, Optical amplifier, OMS-P OPM, and OTSi filter. The OTSi filter is connected to a Media subnetwork, which connects to two OTSi units. The OSC filter is connected to a fibre line and an OSC network connection (via an OSC unit and OTSi unit). - -The fibre lines connect the OSC filters of adjacent media elements. Dashed lines represent various OSME (Optical Subnetwork Management Entity) boundaries: OTSi OSME, OMS OSME, and OTS OSME. The OSC network connections are shown between the OSC units and OTSi units of adjacent media elements. - -G.798(17)-Amd.4(22)\_FVII.2 - -Diagram of a single vendor OTN line system with three media elements connected by fibre. Each element contains an OSC filter, OTSi, OTS-P OPM, Optical amplifier, OMS-P OPM, and OTSi filter connected to a Media subnetwork. OSC network connections are shown between the elements. - -**Figure VII.2 – Example of a single vendor OTN line system implemented with a single media element in each location** - -## Appendix VIII - -### Trail protection of OTS-O/OMS-O layers in support of media layer protection - -(This appendix does not form an integral part of this Recommendation.) - -Appendix III of [ITU-T G.873.1] describes media layer protection schemes for OTS and OMS maintenance entities. These schemes use an optical switch within the media element to protect the optical signal, and an associated trail protection scheme for the OTS-O or OMS-O layer. Trail protection is modelled as an expansion of the access point for a trail to include a protection sublayer. The expansion is identical for both of the layers, so it is described here with 'OxS-O' nomenclature. - -#### VIII.1 OxS-O trail protection sub-layer functions - -The OxS-O trail protection sub-layer (OxS-OP) is generated by expanding the OxS access point, as shown in Figure VIII.1. OxS-O trail protection provides 1+1 unidirectional protection. - -![Figure VIII.1 – OxS-O trail protection sub-layer functions. The diagram illustrates the functional architecture of the OxS-O trail protection sub-layer. On the left, a 'Media element' box contains 'Other media functions', an 'Optical switch/splitter', and two more 'Other media functions' blocks. The optical switch/splitter is connected to an 'OxS-OP/Client' block at the top and to an 'OxS-OP 1+1u' block via a 'Switch coordination' line. The 'OxS-OP 1+1u' block has three ports: 'n' (top), 'w' (left), and 'p' (right). Port 'n' is connected to an 'OxS-OP' block, which is further connected to an 'OxS-O/OxS-OP' block. Port 'w' is connected to an 'OxS-O' block labeled 'Working trail'. Port 'p' is connected to an 'OxS-O' block labeled 'Protection trail'. Both 'OxS-O' blocks are connected to an 'OxS-O' layer at the bottom. Dashed lines labeled 'DI_dLOS-P[OxS]' connect the 'Other media functions' in the media element to the 'OxS-O' blocks. Vertical labels on the right identify the 'OxS-O trail protection sublayer' and the 'OxS-O layer'. The diagram is labeled 'G.798(23)_FVIII.1' at the bottom right.](7a4168ad9aed51fc9c5f121a863b8dbb_img.jpg) - -Figure VIII.1 – OxS-O trail protection sub-layer functions. The diagram illustrates the functional architecture of the OxS-O trail protection sub-layer. On the left, a 'Media element' box contains 'Other media functions', an 'Optical switch/splitter', and two more 'Other media functions' blocks. The optical switch/splitter is connected to an 'OxS-OP/Client' block at the top and to an 'OxS-OP 1+1u' block via a 'Switch coordination' line. The 'OxS-OP 1+1u' block has three ports: 'n' (top), 'w' (left), and 'p' (right). Port 'n' is connected to an 'OxS-OP' block, which is further connected to an 'OxS-O/OxS-OP' block. Port 'w' is connected to an 'OxS-O' block labeled 'Working trail'. Port 'p' is connected to an 'OxS-O' block labeled 'Protection trail'. Both 'OxS-O' blocks are connected to an 'OxS-O' layer at the bottom. Dashed lines labeled 'DI\_dLOS-P[OxS]' connect the 'Other media functions' in the media element to the 'OxS-O' blocks. Vertical labels on the right identify the 'OxS-O trail protection sublayer' and the 'OxS-O layer'. The diagram is labeled 'G.798(23)\_FVIII.1' at the bottom right. - -Figure VIII.1 – OxS-O trail protection sub-layer functions - -##### VIII.1.1 OxS-OP 1+1 unidirectional trail protection connection function (OxS-OP1+1u\_C) - -The OxS-OP1+1u\_C provide 1+1 unidirectional trail protection at the OxS-O layer. - -###### VIII.1.1.1 OxS-OP 1+1 unidirectional trail protection connection source function (OxS-OP1+1u\_C\_So) - -The information flow and processing of the OxS-OP1+1u\_C\_So function is defined with reference to Figure VIII.2. - -## Symbol - -![Diagram of the OxS-OP1+1u_C_So function symbol. An oval labeled 'OxS-OP 1+1u' has an input 'n' from 'OxS-OP_CPn' entering from the top. It has two outputs: 'w' leading to 'OxS-OP_CPw' and 'p' leading to 'OxS-OP_CPp'. A small note 'G.798(17)-Amd.1(18)_FVIII.2' is at the bottom right.](f863cb8837fe502a913bc2be8d1afd8a_img.jpg) - -G.798(17)-Amd.1(18)\_FVIII.2 - -Diagram of the OxS-OP1+1u\_C\_So function symbol. An oval labeled 'OxS-OP 1+1u' has an input 'n' from 'OxS-OP\_CPn' entering from the top. It has two outputs: 'w' leading to 'OxS-OP\_CPw' and 'p' leading to 'OxS-OP\_CPp'. A small note 'G.798(17)-Amd.1(18)\_FVIII.2' is at the bottom right. - -**Figure VIII.2 – OxS-OP1+1u\_C\_So function** - -## Interfaces - -**Table VIII.1 – OxS-OP1+1u\_C\_So inputs and outputs** - -| Input(s) | Output(s) | -|------------------------------------|---------------------------------------------------| -| OxS-OP_CPn:
OxS-OP_CI_OH | OxS-OP_CPw and OxS-OP_CPp:
OxS-OP_CI_OH | - -## Processes - -The function performs the bridge for the 1+1 unidirectional trail protection. - -For 1+1 architecture, the CI coming from the normal (protected) OxS-OP\_CP is bridged permanently to both the working and protection OxS-OP\_CP. - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -### **VIII.1.1.2 OxS-OP 1+1 unidirectional trail protection connection sink function (OxS-OP1+1u\_C\_Sk)** - -The information flow and processing of the OxS-OP1+1u\_C\_Sk function is defined with reference to Figure VIII.3. - -## Symbol - -![Symbol diagram for the OxS-OP1+1u_C_Sk function. It shows an oval labeled 'OxS-OP 1+1u'. At the top, an arrow labeled 'n' points to an output 'OxS-OP_CPn'. At the bottom left, an arrow labeled 'w' points from input 'OxS-OP_CPw'. At the bottom right, an arrow labeled 'p' points from input 'OxS-OP_CPp'. On the right side, a double-headed arrow connects to 'OxS-OP1+1u_C_Sk_MP'. Below the diagram is the text 'G.798(17)-Amd.1(18)_FVIII.3'.](806faec01366b8a02de54ed0de2b6a83_img.jpg) - -Symbol diagram for the OxS-OP1+1u\_C\_Sk function. It shows an oval labeled 'OxS-OP 1+1u'. At the top, an arrow labeled 'n' points to an output 'OxS-OP\_CPn'. At the bottom left, an arrow labeled 'w' points from input 'OxS-OP\_CPw'. At the bottom right, an arrow labeled 'p' points from input 'OxS-OP\_CPp'. On the right side, a double-headed arrow connects to 'OxS-OP1+1u\_C\_Sk\_MP'. Below the diagram is the text 'G.798(17)-Amd.1(18)\_FVIII.3'. - -Figure VIII.3 – OxS-OP1+1u\_C\_Sk function - -## Interfaces - -Table VIII.2 – OxS-OP1+1u\_C\_Sk inputs and outputs - -| Input(s) | Output(s) | -|--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-----------------------------------------------------------------------------------------------------------------------------| -| OxS-OP_CPw and OxS-OP_CPp:
OxS-OP_CI_OH
OxS-OP_CI_SSF-P
OxS-OP_CI_SSF-O
OxS-OP1+1u_C_Sk_MP:
OxS-OP_C_MI_OperType
OxS-OP_C_MI_WTR
OxS-OP_C_MI_HoTime
OxS-OP_C_MI_ExtCMD | OxS-OP_CPn:
OxS-OP_CI_OH
OxS-OP_CI_SSF-P
OxS-OP_CI_SSF-O
OxS-OP1+1u_C_Sk_MP:
For further study | - -## Processes - -For a 1+1 architecture, the CI from either the working or protection OxS-OP\_CP is switched to the normal (protected) OxS-OP\_CP. A switch-over from working to protection OxS-OP\_CP or vice versa is initiated by the switch initiation criteria defined below. - -### *Switch initiation criteria:* - -Automatic protection switching is based on the defect conditions of the working and protection trail. These condition(s) are server signal fail payload (SSF-P), and server signal fail overhead (SSF-O). Note that defects detected by the media element will be reported to the OxS-O\_TT\_Sk via the defect port and cause TSF-P to be asserted, which will cause SSF-P to be seen by the OxS-OP1+1u\_C\_Sk. - -In order to allow interworking between nested protection schemes, a hold-off timer is provided. The hold-off timer delays switch initiation in case of signal fail in order to allow a nested protection to react and clear the fault condition. The hold-off timer is started by the activation of signal fail and runs for the hold-off time. Protection switching is only initiated if signal fail is still present at the end of the hold-off time. The hold-off time shall be provisionable between 0 and 10 s in steps of 100 ms. - -Protection switching can also be initiated by external switch commands received via the MP. - -Depending on the mode of operation, internal states (e.g., wait to restore) may also initiate a switch-over. - -*Switch restoration:* - -In the revertive mode of operation, the protected signal shall be switched back from the protection trail to the working trail when the working trail has recovered from the fault. - -To prevent frequent operation of the protection switch due to an intermittent fault, a failed working trail must become fault-free for a certain period of time before it is used again. This period, called the wait to restore (WTR) period should be on the order of 5-12 minutes and should be capable of being set. - -In the non-revertive mode of operation, no switchback to the working trail is performed when it has recovered from the fault. - -Protection switching notifications to the MP are for further study. - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -**VIII.1.2 OxS-OP trail termination function (OxS-OP\_TT)** - -**VIII.1.2.1 OxS-OP trail termination source function (OxS-OP\_TT\_So)** - -The information flow and processing of the OxS-OP\_TT\_So function is defined with reference to Figure VIII.4. - -**Symbol** - -![Symbol diagram for OxS-OP_TT_So function. It shows an input labeled OxS-OP_AP entering a triangle labeled OxS-OP from the top. An output labeled OxS-OP_TCP exits the triangle from the bottom. Below the output label is the text 'G.798(17)-Amd.1(18)_FVIII.4'.](07b57db1227a83b659cd2def7b8ba5ea_img.jpg) - -OxS-OP\_AP -↓ -OxS-OP -↓ -OxS-OP\_TCP -G.798(17)-Amd.1(18)\_FVIII.4 - -Symbol diagram for OxS-OP\_TT\_So function. It shows an input labeled OxS-OP\_AP entering a triangle labeled OxS-OP from the top. An output labeled OxS-OP\_TCP exits the triangle from the bottom. Below the output label is the text 'G.798(17)-Amd.1(18)\_FVIII.4'. - -**Figure VIII.4 – OxS-OP\_TT\_So function** - -**Interfaces** - -**Table VIII.3 – OxS-OP\_TT\_So inputs and outputs** - -| Input(s) | Output(s) | -|--------------------------|-----------------------------| -| OxS-O_AP:
OxS-O_AI_OH | OxS-OP_TCP:
OxS-OP_CI_OH | - -**Processes** - -No information processing is required in the OxS-OP\_TT\_So, the OxS-OP\_CI at its output being identical to the OxS-O\_AI at its input. - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -### VIII.1.2.2 OxS-OP trail termination sink function (OxS-OP\_TT\_Sk) - -The information flow and processing of the OxS-OP\_TT\_Sk function is defined with reference to Figure VIII.5. - -#### Symbol - -![Diagram of the OxS-OP_TT_Sk function symbol. It is a triangle pointing downwards with 'OxS-OP' written inside. An arrow points from 'OxS-OP_TCP' at the bottom vertex into the triangle. An arrow points from the top vertex to 'OxS-OP_AP'. An arrow points from the left side of the triangle to 'OxS-OP_TT_Sk_MP'. Below the diagram is the text 'G.798(17)-Amd.1(18)_FVIII.5'.](7450203d6606590615fbbeaf2f663b36_img.jpg) - -Diagram of the OxS-OP\_TT\_Sk function symbol. It is a triangle pointing downwards with 'OxS-OP' written inside. An arrow points from 'OxS-OP\_TCP' at the bottom vertex into the triangle. An arrow points from the top vertex to 'OxS-OP\_AP'. An arrow points from the left side of the triangle to 'OxS-OP\_TT\_Sk\_MP'. Below the diagram is the text 'G.798(17)-Amd.1(18)\_FVIII.5'. - -**Figure VIII.5 – OxS-OP\_TT\_Sk function** - -#### Interfaces - -**Table VIII.4 – OxS-OP\_TT\_Sk inputs and outputs** - -| Input(s) | Output(s) | -|--------------------------------------------------------------------------|----------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| OxS-OP_TCP:
OxS-OP_CI_OH
OxS-OP_CI_SSF-P
OxS-OP_CI_SSF-O | OxS-O_AP:
OxS-O_AI_OH
OxS-O_AI_TSF-P
OxS-O_AI_TSF-O
OxS-OP_TT_Sk_MP:
OxS-OP_TT_Sk_MI_cSSF-P
OxS-OP_TT_Sk_MI_cSSF-O
OxS-OP_TT_Sk_MI_cSSF | - -#### Processes - -The OxS-OP\_TT\_Sk function reports the state of the protected OxS-O trail. - -No additional information processing is required in the OxS-OP\_TT\_Sk, the OxS-O\_AI at its output being identical to the OxS-OP\_CI at its input. - -**Defects:** None. - -#### Consequent actions - -The OxS-OP\_TT\_Sk function performs the following consequent actions. - -$a\text{TSF-P} \leftarrow \text{CI\_SSF-P}$ - -$a\text{TSF-O} \leftarrow \text{CI\_SSF-O}$ - -#### Defect correlations - -The OxS-OP\_TT\_Sk function shall perform the following defect correlations. - -$\text{cSSF} \leftarrow \text{CI\_SSF-P and CI\_SSF-O}$ - -cSSF-P $\leftarrow$ CI\_SSF-P and (not CI\_SSF-O) - -cSSF-O $\leftarrow$ CI\_SSF-O and (not CI\_SSF\_P) - -**Performance monitoring:** None. - -### VIII.1.3 OxS-O to OxS-OP adaptation function (OxS-O/OxS-OP\_A) - -#### VIII.1.3.1 OxS-O to OxS-OP adaptation source function (OxS-O/OxS-OP\_A\_So) - -The information flow and processing of the OxS-O/OxS-OP\_A\_So functions is defined with reference to Figure VIII.6. - -##### Symbol - -![Diagram of the OxS-O/OxS-OP_A_So function symbol. It shows an input 'OxS-OP_CP' entering a trapezoidal block labeled 'OxS-O/OxS-OP', which then outputs 'OxS-OP_AP'. Below the diagram is the text 'G.798(17)-Amd.1(18)_FVIII.6'.](43100f35a10f651fb3685f9eb7abdf9d_img.jpg) - -G.798(17)-Amd.1(18)\_FVIII.6 - -Diagram of the OxS-O/OxS-OP\_A\_So function symbol. It shows an input 'OxS-OP\_CP' entering a trapezoidal block labeled 'OxS-O/OxS-OP', which then outputs 'OxS-OP\_AP'. Below the diagram is the text 'G.798(17)-Amd.1(18)\_FVIII.6'. - -**Figure VIII.6 – OxS-O/OxS-OP\_A\_So function** - -##### Interfaces - -**Table VIII.5 – OxS-O/OxS-OP\_A\_So inputs and outputs** - -| Input(s) | Output(s) | -|----------------------------|--------------------------| -| OxS-OP_CP:
OxS-OP_CI_OH | OxS-O_AP:
OxS-O_AI_OH | - -##### Processes - -No information processing is required in the OxS-O/OxS-OP\_A\_So, the OxS-O\_AI at its output being identical to the OxS-OP\_CI at its input. - -**Defects:** None. - -**Consequent actions:** None. - -**Defect correlations:** None. - -**Performance monitoring:** None. - -#### VIII.1.3.2 OxS-O to OxS-OP adaptation sink function (OxS-O/OxS-OP\_A\_Sk) - -The information flow and processing of the OxS-O/OxS-OP\_A\_Sk function is defined with reference to Figure VIII.7. - -## Symbol - -![Symbol diagram for the OxS-O/OxS-OP_A_Sk function. It shows a trapezoidal block labeled 'OxS-O/OxS-OP'. An arrow labeled 'OxS-OP_AP' points into the bottom of the block, and an arrow labeled 'OxS-OP_CP' points out of the top of the block. Below the diagram is the text 'G.798(17)-Amd.1(18)_FVIII.7'.](9947dd291b40f299948b56f3190ec7b0_img.jpg) - -Symbol diagram for the OxS-O/OxS-OP\_A\_Sk function. It shows a trapezoidal block labeled 'OxS-O/OxS-OP'. An arrow labeled 'OxS-OP\_AP' points into the bottom of the block, and an arrow labeled 'OxS-OP\_CP' points out of the top of the block. Below the diagram is the text 'G.798(17)-Amd.1(18)\_FVIII.7'. - -Figure VIII.7 – OxS-O/OxS-OP\_A\_Sk function - -## Interfaces - -Table VIII.8 – OxS-O/OxS-OP\_A\_Sk inputs and outputs - -| Input(s) | Output(s) | -|------------------|-------------------| -| OxS-O_AP: | OxS-OP_CP: | -| OxS-O_AI_OH | OxS-OP_CI_OH | -| OxS-O_AI_TSF-P | OxS-OP_CI_SSF-P | -| OxS-O_AI_TSF-O | OxS-OP_CI_SSF-O | - -## Processes - -No information processing is required in the OxS-O/OxS-OP\_A\_Sk, the OxS-OP\_CI at its output being identical to the OxS-O\_AI at its input. - -**Defects:** None. - -## Consequent actions - -aSSF-P $\leftarrow$ AI\_TSF-P - -aSSF-O $\leftarrow$ AI\_TSF-O - -**Defect correlations:** None. - -**Performance monitoring:** None. - -## Appendix IX - -### Examples of compound adaptation functions without SM monitoring - -(This appendix does not form an integral part of this Recommendation.) - -For a point-to-point, single optical span application, one client per wavelength, the ODUP PM overhead and the OTU SM overhead monitor the same entity. Figures IX.1 and IX.2 show examples of compound adaptation functions without SM monitoring. - -![Figure IX.1: OTSi(G) to ODU adaptation compound function. The diagram shows three examples of adaptation functions. The top-left diagram shows a single OTSi/ODU adaptation unit. The top-right diagram shows a compound adaptation function for a single OTSi/ODU unit, enclosed in a dashed box, with an OTU/ODU, OTU, and OTSi/OTU block, and a 'MI_Mode = transparent' label. The bottom-left diagram shows a compound adaptation function for multiple OTSi(AP) units (1 to m) adapted to a single OTSiG/ODU unit. The bottom-right diagram shows a compound adaptation function for multiple OTSi(AP) units (1 to m) adapted to a single OTSiG/OTU unit, enclosed in a dashed box, with an OTU/ODU, OTU, and OTSiG/OTU block, and a 'MI_Mode = transparent' label. All diagrams show interfaces for ODU_CP, OTSiA, OTSiG, OTSi_AP, and OTSiG-O_AP.](7c414f2c4afc45fae028f3d82cc6dbdf_img.jpg) - -The diagram illustrates three examples of compound adaptation functions without SM monitoring: - -- Top-left:** A single adaptation unit consisting of an **ODU\_CP** interface connected to an **OTSi/ODU** block. The **OTSi/ODU** block is connected to two interfaces: **OTSi\_AP** and **OTSiG-O\_AP**, with an **OTSiA** interface in between. -- Top-right:** A compound adaptation function for a single **OTSi/ODU** unit, enclosed in a dashed box. It consists of an **ODU\_CP** interface connected to an **OTU/ODU** block, which is connected to an **OTU** block (labeled **MI\_Mode = transparent**), which is connected to an **OTSi/OTU** block. The **OTSi/OTU** block is connected to two interfaces: **OTSi\_AP** and **OTSiG-O\_AP**, with an **OTSiA** interface in between. -- Bottom-left:** A compound adaptation function for multiple **OTSi(AP)** units (labeled 1 to m) adapted to a single **OTSiG/ODU** block. The **OTSiG/ODU** block is connected to an **ODU\_CP** interface at the top and three interfaces at the bottom: **OTSi\_AP[1]**, **OTSi\_AP[m]**, and **OTSiG-O\_AP**. The **OTSiG** and **OTSiA** interfaces are shown between the **OTSiG/ODU** block and the bottom interfaces. -- Bottom-right:** A compound adaptation function for multiple **OTSi(AP)** units (labeled 1 to m) adapted to a single **OTSiG/OTU** block, enclosed in a dashed box. It consists of an **ODU\_CP** interface connected to an **OTU/ODU** block, which is connected to an **OTU** block (labeled **MI\_Mode = transparent**), which is connected to an **OTSiG/OTU** block. The **OTSiG/OTU** block is connected to three interfaces: **OTSi\_AP[1]**, **OTSi\_AP[m]**, and **OTSiG-O\_AP**, with **OTSiG** and **OTSiA** interfaces in between. - -G.798(17)-Amd.1(18)\_FIX.1 - -Figure IX.1: OTSi(G) to ODU adaptation compound function. The diagram shows three examples of adaptation functions. The top-left diagram shows a single OTSi/ODU adaptation unit. The top-right diagram shows a compound adaptation function for a single OTSi/ODU unit, enclosed in a dashed box, with an OTU/ODU, OTU, and OTSi/OTU block, and a 'MI\_Mode = transparent' label. The bottom-left diagram shows a compound adaptation function for multiple OTSi(AP) units (1 to m) adapted to a single OTSiG/ODU unit. The bottom-right diagram shows a compound adaptation function for multiple OTSi(AP) units (1 to m) adapted to a single OTSiG/OTU unit, enclosed in a dashed box, with an OTU/ODU, OTU, and OTSiG/OTU block, and a 'MI\_Mode = transparent' label. All diagrams show interfaces for ODU\_CP, OTSiA, OTSiG, OTSi\_AP, and OTSiG-O\_AP. - -Figure IX.1 – OTSi(G) to ODU adaptation compound function - -![Diagram illustrating FlexO-n to ODU adaptation compound function. The left side shows a high-level view with FlexO-n/ODUCn block, ODUCn_CP, and multiple FlexO_AP interfaces. The right side shows a detailed internal structure with OTUCn/ODUCn and OTUCn blocks, including a transparent mode loop, all within a dashed boundary.](4834b6d862f59622ea6314c723c7572f_img.jpg) - -The diagram illustrates the FlexO-n to ODU adaptation compound function. On the left, a high-level view shows a **FlexO-n/ODUCn** block connected to **ODUCn\_CP** at the top and multiple **FlexO\_AP** interfaces (labeled **FlexO\_AP[1]** and **FlexO\_AP[n]**) at the bottom. The connections are labeled **1** and **n**. On the right, a detailed view shows the internal structure: **ODUCn\_CP** connects to an **OTUCn/ODUCn** block, which connects to an **OTUCn** block. The **OTUCn** block has a feedback loop labeled **MI\_Mode = transparent** and connects to another **FlexO-n/ODUCn** block. This block then connects to the **FlexO\_AP** interfaces. The internal components are enclosed in a dashed boundary. - -G.798(17)-Amd.1(18)\_FIX.2 - -Diagram illustrating FlexO-n to ODU adaptation compound function. The left side shows a high-level view with FlexO-n/ODUCn block, ODUCn\_CP, and multiple FlexO\_AP interfaces. The right side shows a detailed internal structure with OTUCn/ODUCn and OTUCn blocks, including a transparent mode loop, all within a dashed boundary. - -**Figure IX.2 – FlexO-n to ODU adaptation compound function** - -## Bibliography - -- [b-ANSI INCITS 296] ANSI INCITS 296-1997, *Single-Byte Command Code Sets CONnection (SBCON) Architecture (formerly ANSI X3.296-1997)*. -- [b-ANSI INCITS 352] ANSI INCITS 352-2002, *Information Technology – Fibre Channel – Physical Interfaces (FC-PI)*. -- [b-ANSI INCITS 364] ANSI INCITS 364-2003, *Information Technology – Fibre Channel 10 Gigabit (10GFC)*. -- [b-ATIS 0300231.01] ATIS 0300231.01-1997, *In-service Digital Transmission Performance Monitoring*. -- [b-Choi] Choi, D. (1990), *Frame alignment in digital carrier system – a tutorial*, IEEE Communications Magazine. -- [b-INCITS 470] INCITS 470:2011, *Information Technology – Fibre Channel – Framing and Signaling – 3 (FC-FS-3)*. -- [b-INCITS 488] INCITS 488:2016, *Information Technology – Fibre Channel – Framing and Signaling – 4 (FC-FS-4)*. -- [b-INCITS 512] INCITS 512:2015, *Information Technology – Fibre Channel – Physical Interfaces – 6 (FC-PI-6)*. - - - -## SERIES OF ITU-T RECOMMENDATIONS - -| | | -|-----------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------| -| Series A | Organization of the work of ITU-T | -| Series D | Tariff and accounting principles and international telecommunication/ICT economic and policy issues | -| Series E | Overall network operation, telephone service, service operation and human factors | -| Series F | Non-telephone telecommunication services | -| Series G | Transmission systems and media, digital systems and networks | -| Series H | Audiovisual and multimedia systems | -| Series I | Integrated services digital network | -| Series J | Cable networks and transmission of television, sound programme and other multimedia signals | -| Series K | Protection against interference | -| Series L | Environment and ICTs, climate change, e-waste, energy efficiency; construction, installation and protection of cables and other elements of outside plant | -| Series M | Telecommunication management, including TMN and network maintenance | -| Series N | Maintenance: international sound programme and television transmission circuits | -| Series O | Specifications of measuring equipment | -| Series P | Telephone transmission quality, telephone installations, local line networks | -| Series Q | Switching and signalling, and associated measurements and tests | -| Series R | Telegraph transmission | -| Series S | Telegraph services terminal equipment | -| Series T | Terminals for telematic services | -| Series U | Telegraph switching | -| Series V | Data communication over the telephone network | -| Series X | Data networks, open system communications and security | -| Series Y | Global information infrastructure, Internet protocol aspects, next-generation networks, Internet of Things and smart cities | -| Series Z | Languages and general software aspects for telecommunication systems | \ No newline at end of file diff --git a/marked/G/T-REC-G.8275.1-202211-I_PDF-E/0a42e05c07941450f34e4f7117725834_img.jpg b/marked/G/T-REC-G.8275.1-202211-I_PDF-E/0a42e05c07941450f34e4f7117725834_img.jpg deleted file mode 100644 index 595627fef1e729c7ac8c794242c52c5cc68296d4..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.8275.1-202211-I_PDF-E/0a42e05c07941450f34e4f7117725834_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:48aa9c9cadb22084cd87277ddb50d49fb3359e8e5e7c4ebb26328b61e8db21f0 -size 19988 diff --git a/marked/G/T-REC-G.8275.1-202211-I_PDF-E/21327313f7b18a481da0c87a6472a80d_img.jpg b/marked/G/T-REC-G.8275.1-202211-I_PDF-E/21327313f7b18a481da0c87a6472a80d_img.jpg deleted file mode 100644 index 042cb1995054c45241bc259af92fa6dcbef637ba..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.8275.1-202211-I_PDF-E/21327313f7b18a481da0c87a6472a80d_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:278977742508ffdca369c8eb0a9d7e4144bb5e071db83381ac4c326e8c33dca0 -size 19191 diff --git a/marked/G/T-REC-G.8275.1-202211-I_PDF-E/5b8a756d9a71c35f17db8bcb90b438a3_img.jpg b/marked/G/T-REC-G.8275.1-202211-I_PDF-E/5b8a756d9a71c35f17db8bcb90b438a3_img.jpg deleted file mode 100644 index c997c05923b782a017670cfdc54973e4473ac818..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.8275.1-202211-I_PDF-E/5b8a756d9a71c35f17db8bcb90b438a3_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:9a525e9a5250086d91943d86c2990349ea8c5629eda392b5aa3a7478ab77f637 -size 106472 diff --git a/marked/G/T-REC-G.8275.1-202211-I_PDF-E/5c3dd31372f59e15250f0ab1613ca485_img.jpg b/marked/G/T-REC-G.8275.1-202211-I_PDF-E/5c3dd31372f59e15250f0ab1613ca485_img.jpg deleted file mode 100644 index 0b70563610a063ff6528a4f1a9080114b6c5c3b7..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.8275.1-202211-I_PDF-E/5c3dd31372f59e15250f0ab1613ca485_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:5a94f021629877321a8a9b5ce8d82014617422ef2dd2396b5219ba92a4d8a961 -size 26164 diff --git a/marked/G/T-REC-G.8275.1-202211-I_PDF-E/60ffbad6c0fb7371a57fe8f267d2d141_img.jpg b/marked/G/T-REC-G.8275.1-202211-I_PDF-E/60ffbad6c0fb7371a57fe8f267d2d141_img.jpg deleted file mode 100644 index f43bb17abf0e16438b2f69aba5bec5b5bafcb947..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.8275.1-202211-I_PDF-E/60ffbad6c0fb7371a57fe8f267d2d141_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:0285067d41f119b6680cfe50d7c61212b7adeeb5d2d9c920b8ca47c7eb7614da -size 52547 diff --git a/marked/G/T-REC-G.8275.1-202211-I_PDF-E/6a7ea9d5162b0a0cfbd8d77c6cac90d1_img.jpg b/marked/G/T-REC-G.8275.1-202211-I_PDF-E/6a7ea9d5162b0a0cfbd8d77c6cac90d1_img.jpg deleted file mode 100644 index d69f6ae5af6f49986425e50e0296b8b6e08a610f..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.8275.1-202211-I_PDF-E/6a7ea9d5162b0a0cfbd8d77c6cac90d1_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:0d77e65b21f41d5fb53f9cb291af820c6dcfdebbb5bde5b73ec670d34389dd64 -size 21656 diff --git a/marked/G/T-REC-G.8275.1-202211-I_PDF-E/6ed175c791b5e156d9c98a8dbcc3318c_img.jpg b/marked/G/T-REC-G.8275.1-202211-I_PDF-E/6ed175c791b5e156d9c98a8dbcc3318c_img.jpg deleted file mode 100644 index abda52cbb1047d6649f89e40c898a1c33bed7267..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.8275.1-202211-I_PDF-E/6ed175c791b5e156d9c98a8dbcc3318c_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:6f3b7e07231c0f3e116c99c493bdda98ecd52313b6735faa6cea23815cf3162b -size 7190 diff --git a/marked/G/T-REC-G.8275.1-202211-I_PDF-E/74b540f71bcf10a8a66b2f01ea8c08ec_img.jpg b/marked/G/T-REC-G.8275.1-202211-I_PDF-E/74b540f71bcf10a8a66b2f01ea8c08ec_img.jpg deleted file mode 100644 index 86a123d3e995b22d386926db29f052026e8239ef..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.8275.1-202211-I_PDF-E/74b540f71bcf10a8a66b2f01ea8c08ec_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:af3d2c236f9e159168b38d1e5c98205800a225707c69da632bf65f0537055489 -size 57457 diff --git a/marked/G/T-REC-G.8275.1-202211-I_PDF-E/9c6461e1e94afae4dec455e69a2ce152_img.jpg b/marked/G/T-REC-G.8275.1-202211-I_PDF-E/9c6461e1e94afae4dec455e69a2ce152_img.jpg deleted file mode 100644 index 400bb282fa2cd1ec66717c0ce128058254101ce1..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.8275.1-202211-I_PDF-E/9c6461e1e94afae4dec455e69a2ce152_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:536191cedb4182aa0ee14760ad604d57771ab2c46025cb90cf360d1069089bf8 -size 111068 diff --git a/marked/G/T-REC-G.8275.1-202211-I_PDF-E/b44f89b176c971c7dd264c07bfef2c2a_img.jpg b/marked/G/T-REC-G.8275.1-202211-I_PDF-E/b44f89b176c971c7dd264c07bfef2c2a_img.jpg deleted file mode 100644 index 737bfeddf203ee1c364e3572043a585486b3cab8..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.8275.1-202211-I_PDF-E/b44f89b176c971c7dd264c07bfef2c2a_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:7b15d4be72e74c5ad41089fea31f571a1837a87b3c565656dac893405a51a035 -size 20856 diff --git a/marked/G/T-REC-G.8275.1-202211-I_PDF-E/b6671cfafda3820aafe9a24fa7a4d8c7_img.jpg b/marked/G/T-REC-G.8275.1-202211-I_PDF-E/b6671cfafda3820aafe9a24fa7a4d8c7_img.jpg deleted file mode 100644 index ae47487bd17f881ae207feea0c8f9cf3b79b9502..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.8275.1-202211-I_PDF-E/b6671cfafda3820aafe9a24fa7a4d8c7_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:2c2460d0404430b9ec0da4b6743ed58224001856a2133ca6a05395e1f216b283 -size 102078 diff --git a/marked/G/T-REC-G.8275.1-202211-I_PDF-E/daf05db9f13b34fb12da52f007bbfe5b_img.jpg b/marked/G/T-REC-G.8275.1-202211-I_PDF-E/daf05db9f13b34fb12da52f007bbfe5b_img.jpg deleted file mode 100644 index bb19d9e0c6a6628cd002df2008b0fe7c7631e00a..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.8275.1-202211-I_PDF-E/daf05db9f13b34fb12da52f007bbfe5b_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:56eaad655bc8363a6c287b6a1b943f07f4ad6c615bbba5f333dd67a9dad3004e -size 35147 diff --git a/marked/G/T-REC-G.8275.1-202211-I_PDF-E/raw.md b/marked/G/T-REC-G.8275.1-202211-I_PDF-E/raw.md deleted file mode 100644 index fbb700f7c3ba77fdbdad85e33f2aec95c8575196..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.8275.1-202211-I_PDF-E/raw.md +++ /dev/null @@ -1,1859 +0,0 @@ - - -# Recommendation**ITU-T G.827.1/Y.1369.1 (11/2022)** - -SERIES G: Transmission systems and media, digital systems and networks - -Packet over Transport aspects – Synchronization, quality and availability targets - -SERIES Y: Global information infrastructure, Internet protocol aspects, next-generation networks, Internet of Things and smart cities - -Internet protocol aspects – Transport - ---- - -### **Precision time protocol telecom profile for phase/time synchronization with full timing support from the network** - -![ITU logo](6ed175c791b5e156d9c98a8dbcc3318c_img.jpg) - -The logo of the International Telecommunication Union (ITU) is located in the bottom right corner. It features a blue globe with white lines representing latitude and longitude, and the letters 'ITU' in a bold, blue, sans-serif font superimposed on the globe. - -ITU logo - -## ITU-T G-SERIES RECOMMENDATIONS **TRANSMISSION SYSTEMS AND MEDIA, DIGITAL SYSTEMS AND NETWORKS** - -| | | -|----------------------------------------------------------------------------------------------------------------------------------------------|----------------------| -| INTERNATIONAL TELEPHONE CONNECTIONS AND CIRCUITS | G.100–G.199 | -| GENERAL CHARACTERISTICS COMMON TO ALL ANALOGUE CARRIER-TRANSMISSION SYSTEMS | G.200–G.299 | -| INDIVIDUAL CHARACTERISTICS OF INTERNATIONAL CARRIER TELEPHONE SYSTEMS ON METALLIC LINES | G.300–G.399 | -| GENERAL CHARACTERISTICS OF INTERNATIONAL CARRIER TELEPHONE SYSTEMS ON RADIO-RELAY OR SATELLITE LINKS AND INTERCONNECTION WITH METALLIC LINES | G.400–G.449 | -| COORDINATION OF RADIOTELEPHONY AND LINE TELEPHONY | G.450–G.499 | -| TRANSMISSION MEDIA AND OPTICAL SYSTEMS CHARACTERISTICS | G.600–G.699 | -| DIGITAL TERMINAL EQUIPMENTS | G.700–G.799 | -| DIGITAL NETWORKS | G.800–G.899 | -| DIGITAL SECTIONS AND DIGITAL LINE SYSTEM | G.900–G.999 | -| MULTIMEDIA QUALITY OF SERVICE AND PERFORMANCE – GENERIC AND USER-RELATED ASPECTS | G.1000–G.1999 | -| TRANSMISSION MEDIA CHARACTERISTICS | G.6000–G.6999 | -| DATA OVER TRANSPORT – GENERIC ASPECTS | G.7000–G.7999 | -| PACKET OVER TRANSPORT ASPECTS | G.8000–G.8999 | -| Ethernet over Transport aspects | G.8000–G.8099 | -| MPLS over Transport aspects | G.8100–G.8199 | -| Synchronization, quality and availability targets | G.8200–G.8299 | -| Mobile network transport aspects | G.8300–G.8399 | -| Service Management | G.8600–G.8699 | -| ACCESS NETWORKS | G.9000–G.9999 | - -*For further details, please refer to the list of ITU-T Recommendations.* - -# Recommendation ITU-T G.827.1/Y.1369.1 - -# Precision time protocol telecom profile for phase/time synchronization with full timing support from the network - -## Summary - -Recommendation ITU-T G.827.1/Y.1369.1 contains the ITU-T precision time protocol (PTP) profile for phase and time distribution with full timing support from the network. It provides the necessary details to utilize IEEE 1588 in a manner consistent with the architecture described in Recommendation ITU-T G.827.1/Y.1369. - -## History - -| Edition | Recommendation | Approval | Study Group | Unique ID* | -|---------|--------------------------------------|------------|-------------|---------------------------------------------------------------------------| -| 1.0 | ITU-T G.827.1/Y.1369.1 | 2014-07-22 | 15 | 11.1002/1000/12197 | -| 1.1 | ITU-T G.827.1/Y.1369.1 (2014) Cor. 1 | 2015-01-13 | 15 | 11.1002/1000/12397 | -| 2.0 | ITU-T G.827.1/Y.1369.1 | 2016-06-22 | 15 | 11.1002/1000/12815 | -| 2.1 | ITU-T G.827.1/Y.1369.1 (2016) Amd. 1 | 2017-08-29 | 15 | 11.1002/1000/13329 | -| 2.2 | ITU-T G.827.1/Y.1369.1 (2016) Amd. 2 | 2018-03-16 | 15 | 11.1002/1000/13553 | -| 2.3 | ITU-T G.827.1/Y.1369.1 (2016) Amd. 3 | 2019-08-29 | 15 | 11.1002/1000/14017 | -| 3.0 | ITU-T G.827.1/Y.1369.1 | 2020-03-15 | 15 | 11.1002/1000/14215 | -| 3.1 | ITU-T G.827.1/Y.1369.1 (2020) Amd. 1 | 2020-11-13 | 15 | 11.1002/1000/14543 | -| 3.2 | ITU-T G.827.1/Y.1369.1 (2020) Amd. 2 | 2021-06-29 | 15 | 11.1002/1000/14709 | -| 3.3 | ITU-T G.827.1/Y.1369.1 (2020) Amd. 3 | 2022-02-13 | 15 | 11.1002/1000/14913 | -| 4.0 | ITU-T G.827.1/Y.1369.1 | 2022-11-13 | 15 | 11.1002/1000/15131 | - -## Keywords - -IEEE 1588, phase, profile, PTP, time. - ---- - -\* To access the Recommendation, type the URL in the address field of your web browser, followed by the Recommendation's unique ID. For example, . - -## FOREWORD - -The International Telecommunication Union (ITU) is the United Nations specialized agency in the field of telecommunications, information and communication technologies (ICTs). The ITU Telecommunication Standardization Sector (ITU-T) is a permanent organ of ITU. ITU-T is responsible for studying technical, operating and tariff questions and issuing Recommendations on them with a view to standardizing telecommunications on a worldwide basis. - -The World Telecommunication Standardization Assembly (WTSA), which meets every four years, establishes the topics for study by the ITU-T study groups which, in turn, produce Recommendations on these topics. - -The approval of ITU-T Recommendations is covered by the procedure laid down in WTSA Resolution 1. - -In some areas of information technology which fall within ITU-T's purview, the necessary standards are prepared on a collaborative basis with ISO and IEC. - -## NOTE - -In this Recommendation, the expression "Administration" is used for conciseness to indicate both a telecommunication administration and a recognized operating agency. - -Compliance with this Recommendation is voluntary. However, the Recommendation may contain certain mandatory provisions (to ensure, e.g., interoperability or applicability) and compliance with the Recommendation is achieved when all of these mandatory provisions are met. The words "shall" or some other obligatory language such as "must" and the negative equivalents are used to express requirements. The use of such words does not suggest that compliance with the Recommendation is required of any party. - -## INTELLECTUAL PROPERTY RIGHTS - -ITU draws attention to the possibility that the practice or implementation of this Recommendation may involve the use of a claimed Intellectual Property Right. ITU takes no position concerning the evidence, validity or applicability of claimed Intellectual Property Rights, whether asserted by ITU members or others outside of the Recommendation development process. - -As of the date of approval of this Recommendation, ITU had not received notice of intellectual property, protected by patents/software copyrights, which may be required to implement this Recommendation. However, implementers are cautioned that this may not represent the latest information and are therefore strongly urged to consult the appropriate ITU-T databases available via the ITU-T website at . - -© ITU 2023 - -All rights reserved. No part of this publication may be reproduced, by any means whatsoever, without the prior written permission of ITU. - -## Table of Contents - -###### Page - -| | | | -|---------|-------------------------------------------------------------------------------------------------|----| -| 1 | Scope ..... | 1 | -| 2 | References..... | 1 | -| 3 | Definitions ..... | 2 | -| 3.1 | Terms defined elsewhere ..... | 2 | -| 3.2 | Terms defined in this Recommendation..... | 2 | -| 4 | Abbreviations and acronyms ..... | 3 | -| 5 | Conventions ..... | 4 | -| 6 | Use of PTP for phase/time distribution ..... | 4 | -| 6.1 | High-level design requirements..... | 5 | -| 6.2 | PTP modes and options ..... | 5 | -| 6.3 | Protection aspects and Alternate BMCA..... | 9 | -| 6.4 | Phase/time traceability information..... | 16 | -| 7 | ITU-T PTP profile for phase/time distribution with full timing support from the network ..... | 19 | -| 8 | Security aspects ..... | 19 | -| Annex A | – ITU-T PTP profile for phase/time distribution with full timing support from the network ..... | 20 | -| A.1 | Profile identification ..... | 20 | -| A.2 | PTP attribute values..... | 20 | -| A.3 | PTP options ..... | 29 | -| A.4 | Best master clock algorithm options ..... | 30 | -| A.5 | Path delay measurement option (delay request/delay response) ..... | 30 | -| A.6 | Clock identity format..... | 30 | -| A.7 | Configuration management options ..... | 30 | -| A.8 | Security aspects ..... | 30 | -| A.9 | Other optional features of IEEE 1588 ..... | 30 | -| A.10 | PTP common header flags..... | 30 | -| A.11 | Profile version compatibility ..... | 32 | -| Annex B | – Options to establish the PTP topology with the Alternate BMCA..... | 33 | -| Annex C | – Inclusion of an external phase/time input interface in a T-BC..... | 34 | -| Annex D | – Path trace (optional) ..... | 35 | -| Annex E | – Synchronization uncertain indication (optional)..... | 36 | -| Annex F | – Use of stepsRemoved to limit reference chain (optional)..... | 37 | -| Annex G | – Monitoring alternate master time information provided by a peer PTP port (optional) ..... | 38 | -| G.1 | Use Case 1 – PASSIVE port monitoring MASTER port..... | 39 | -| G.2 | Use Case 2 –MASTER port monitoring PASSIVE port..... | 39 | -| G.3 | Use Case 3 –MASTER port monitoring MASTER port..... | 40 | - -| | Page | -|----------------------------------------------------------------------------------------------------------------------------------------------------------------------------|------| -| Annex H – Transport of PTP over OTN ..... | 41 | -| Annex I – Transport PTP over MTN ..... | 42 | -| Annex J – Transport PTP over FlexE Links ..... | 43 | -| Annex K – Dynamic Monitoring based on PTSF (Optional) ..... | 44 | -| Appendix I – Considerations on the use of transparent clock..... | 45 | -| Appendix II – Considerations on the transmission of Delay_Req messages..... | 46 | -| Appendix III – Considerations on the choice of the PTP Ethernet multicast destination address ..... | 48 | -| Appendix IV – Considerations on the use of priority2 ..... | 49 | -| Appendix V – Description of PTP clock modes and associated contents of Announce messages ..... | 50 | -| Appendix VI – Operations over link aggregation..... | 51 | -| Appendix VII – Relationship between clockClass and holdover specification ..... | 52 | -| Appendix VIII – Considerations on a T-TSC connected to an end application ..... | 54 | -| Appendix IX – Calculation of offsetScaledLogVariance for T-GM timed by PRTC or ePRTC ..... | 55 | -| IX.1    Observation interval and TDEV noise generation..... | 55 | -| IX.2    Computation of PTP variance from TDEV ..... | 55 | -| IX.3    Computation of offsetScaledLogVariance from PTP variance ..... | 56 | -| Appendix X – Description of a T-BC extended clockClass application..... | 58 | -| X.1    Purpose of T-BC extended clockClass application ..... | 58 | -| X.2    DefaultDS data set member specifications under this extended application.. | 58 | -| Appendix XI – Considerations on native access equipment..... | 60 | -| Appendix XII – Monitoring alternate master time information provided by a peer PTP port..... | 61 | -| Appendix XIII – Considerations on the use of [IEEE 1588-2019]..... | 62 | -| Appendix XIV – Considerations in an environment of more than two PTP ports on a single PTP communication path when using transparent clocks and multicast addressing ..... | 63 | -| Appendix XV – Considerations of deploying ePRTC and PRTC in the network ..... | 65 | -| Bibliography..... | 66 | - -# Recommendation ITU-T G.827.1/Y.1369.1 - -# Precision time protocol telecom profile for phase/time synchronization with full timing support from the network - -# 1 Scope - -This Recommendation specifies a profile for telecommunication applications based on IEEE 1588 precision time protocol (PTP). The profile specifies the IEEE 1588 functions that are necessary to ensure network element interoperability for the delivery of accurate phase/time synchronization. The profile is based on the full timing support from the network architecture as described in [ITU-T G.827.5] and definitions described in [ITU-T G.826.0]. - -This version of the profile specifies the high-level design requirements, modes of operation for the exchange of PTP messages, the PTP protocol mapping, the best master clock algorithm (BMCA) options, as well as the PTP protocol configuration parameters. - -NOTE 1 – The parameters defined in this version of the profile are chosen based on the case where physical layer frequency support is provided, and the case without physical layer frequency support (i.e., PTP only) is for further study. - -This Recommendation also specifies some aspects necessary for use in a telecom environment that are outside the scope of and complement the PTP profile. - -An implementation compliant with this profile can claim compliance with either IEEE Std 1588-2008 [IEEE 1588-2008] or IEEE Std 1588-2019 [IEEE 1588-2019]. Considerations on the use of one or the other profile are provided in Appendix XIII. Compliance for a specific implementation with either the [IEEE 1588-2008] or [IEEE 1588-2019] versions of the standard should be stated when referring to this profile. - -# 2 References - -The following ITU-T Recommendations and other references contain provisions which, through reference in this text, constitute provisions of this Recommendation. At the time of publication, the editions indicated were valid. All Recommendations and other references are subject to revision; users of this Recommendation are therefore encouraged to investigate the possibility of applying the most recent edition of the Recommendations and other references listed below. A list of the currently valid ITU-T Recommendations is regularly published. The reference to a document within this Recommendation does not give it, as a stand-alone document, the status of a Recommendation. - -- [ITU-T G.709] Recommendation ITU-T G.709/Y.1331 (2020), *Interfaces for the optical transport network*. -- [ITU-T G.709.1] Recommendation ITU-T G.709.1/1331.1 (2018), *Flexible OTN short-reach interfaces*. -- [ITU-T G.781] Recommendation ITU-T G.781 (2020), *Synchronization layer functions for frequency synchronization based on the physical layer*. -- [ITU-T G.810] Recommendation ITU-T G.810 (1996), *Definitions and terminology for synchronization networks*. -- [ITU-T G.704.1] Recommendation ITU-T G.704.1/Y.1303 (2016), *Generic framing procedure*. -- [ITU-T G.826.0] Recommendation ITU-T G.826.0 (2022), *Definitions and terminology for synchronization in packet networks*. -- [ITU-T G.826.5.1] Recommendation ITU-T G.826.5.1/Y.1365.1 (2022), *Precision time protocol telecom profile for frequency synchronization*. - -- [ITU-T G.8271] Recommendation ITU-T G.8271/Y.1366 (2020), *Time and phase synchronization aspects of telecommunication networks*. -- [ITU-T G.8271.1] Recommendation ITU-T G.8271.1/Y.1366.1 (2022), *Network limits for time synchronization in packet networks with full timing support from the network*. -- [ITU-T G.8272] Recommendation ITU-T G.8272/Y.1367 (2018), *Timing characteristics of primary reference time clocks*. -- [ITU-T G.8272.1] Recommendation ITU-T G.8272.1/Y.1367.1 (2016), *Timing characteristics of enhanced primary reference time clocks*. -- [ITU-T G.8273] Recommendation ITU-T G.8273/Y.1368 (2018), *Framework of phase and time clocks*. -- [ITU-T G.8273.2] Recommendation ITU-T G.8273.2/Y.1368.2 (2020), *Timing characteristics of telecom boundary clocks and telecom time slave clocks for use with full timing support from the network*. -- [ITU-T G.8273.3] Recommendation ITU-T G.8273.3/Y.1368.3 (2020), *Timing characteristics of telecom transparent clocks for use with full timing support from the network*. -- [ITU-T G.8275] Recommendation ITU-T G.8275/Y.1369 (2020), *Architecture and requirements for packet-based time and phase distribution*. -- [ITU-T G.8312] Recommendation ITU-T G.8312 (2020), *Interfaces for metro transport networks*. -- [IEEE 1588] Either [IEEE 1588-2008] or [IEEE 1588-2019] depending on the specific implementation. See clause 5 Conventions for more details. -- [IEEE 1588-2008] IEEE 1588-2008, *IEEE Standard for a Precision Clock Synchronization Protocol for Networked Measurement and Control Systems*. -- [IEEE 1588-2019] IEEE 1588-2019, *IEEE Standard for a Precision Clock Synchronization Protocol for Networked Measurement and Control Systems*. -- [OIF FLEXE IA] Optical Internetworking Forum, IA OIF-FLEXE-02.2 (2021), *FlexE 2.2 Implementation Agreement*. - -# 3 Definitions - -## 3.1 Terms defined elsewhere - -This Recommendation uses the following terms defined elsewhere: - -The terms and definitions used in this Recommendation are contained in [ITU-T G.810] and [ITU-T G.8260]. - -## 3.2 Terms defined in this Recommendation - -This Recommendation defines the following term: - -**3.2.1 special port:** A PTP special port is a PTP port that translates between the native timing mechanism of a medium and PTP. - -# 4 Abbreviations and acronyms - -This Recommendation uses the following abbreviations and acronyms: - -| | | -|-------|---------------------------------------| -| AVAR | Allan Variance | -| BC | Boundary Clock | -| BMCA | Best Master Clock Algorithm | -| EEC | synchronous Ethernet Equipment Clock | -| ePRTC | Enhanced Primary Reference Time Clock | -| EUI | Extended Unique Identifier | -| FlexE | Flex Ethernet | -| FPM | Flicker Phase Modulation | -| GM | Grandmaster | -| GNSS | Global Navigation Satellite System | -| LAG | Link Aggregation | -| MA-L | MAC Address – Large | -| MA-M | MAC Address – Medium | -| MA-S | MAC Address – Small | -| MTN | Metro Transport Network | -| MVAR | Modified Allan Variance | -| OC | Ordinary Clock | -| OEC | OTN Equipment Clock | -| OSMC | OTN synchronization messaging channel | -| OUI | Organizationally Unique Identifier | -| PRC | Primary Reference Clock | -| PRS | Primary Reference Source | -| PRTC | Primary Reference Time Clock | -| PSD | Power Spectral Density | -| PTP | Precision Time Protocol | -| PTSF | Packet Timing Signal Fail | -| QL | Quality Level | -| SDH | Synchronous Digital Hierarchy | -| SSM | Synchronization Status Message | -| SSU | Synchronization Supply Unit | -| SSU-A | primary level SSU | -| SSU-B | secondary level SSU | -| ST2 | Stratum 2 | -| ST3E | Stratum 3 Enhanced | -| T-BC | Telecom Boundary Clock | - -| | | -|-------|----------------------------| -| TC | Transparent Clock | -| T-GM | Telecom Grandmaster | -| T-TC | Telecom Transparent Clock | -| T-TSC | Telecom Time Slave Clock | -| TLV | Type Length Value | -| TVAR | Time Variance | -| VLAN | Virtual Local Area Network | -| WPM | White Phase Modulation | - -# 5 Conventions - -Within this Recommendation, the following conventions are used: the term PTP refers to the PTP defined in [IEEE 1588]. PTP messages used within this Recommendation are defined in [IEEE 1588] and are identified using italicized text. - -The term telecom boundary clock (T-BC) refers to a device consisting of a boundary clock (BC) as defined in [IEEE 1588] and this Recommendation, with additional performance characteristics defined in [ITU-T G.8273.2]. - -The term telecom transparent clock (T-TC) refers to a device consisting of a transparent clock (TC) as defined in [IEEE 1588] and this Recommendation, with additional performance characteristics defined in [ITU-T G.8273.3]. - -The term telecom grandmaster (T-GM) refers to a device consisting of a grandmaster (GM) clock as defined in [IEEE 1588] and this Recommendation, with additional performance characteristics for further study. - -The term telecom time slave clock (T-TSC) refers to a device consisting of a slave-only ordinary clock (OC) as defined in [IEEE 1588] and this Recommendation, with additional performance characteristics defined in the Annex C of [ITU-T G.8273.2]. - -The term primary reference time clock (PRTC) refers to the clock defined in [ITU-T G.8272]. The term enhanced primary reference time clock (ePRTC) refers to an enhanced version of the PRTC, which is being studied. - -Within this Recommendation, some requirements are stated as requiring compliance to [IEEE 1588]. For implementations based on [IEEE 1588-2008], the reference to [IEEE 1588] means compliance to [IEEE 1588-2008]. For implementations based on [IEEE 1588-2019], the reference to [IEEE 1588] means compliance to [IEEE 1588-2019]. Some of these references to [IEEE 1588] includes a specific clause number. In these cases, the clause number is the same in both [IEEE 1588-2008] and [IEEE 1588-2019]. If the requirements are in different clauses in the two versions of IEEE 1588, then the text of this Recommendation shall include the specific clause for [IEEE 1588-2008] and the specific cause for [IEEE 1588-2019]. - -# 6 Use of PTP for phase/time distribution - -The [IEEE 1588] standard defines the precision time protocol designed to enable accurate time transfer. It introduces the concept of "profile", whereby aspects of the protocol may be selected and specified for a particular application. - -A PTP profile has been defined in [ITU-T G.8265.1] to address applications requiring frequency synchronization only. This Recommendation defines another PTP profile, for telecom applications requiring accurate phase and time synchronization. It supports the specific architecture described in - -[ITU-T G.8275] in order to allow the distribution of phase/time with full timing support from the network and is based on [IEEE 1588]. - -In order to claim compliance with the telecom profile, the requirements of this Recommendation and the relevant requirements of [IEEE 1588], as referenced in Annex A, must be met. - -The detailed aspects related to the telecom profile are described in the following clauses, while the profile itself is contained in Annex A. It follows the general rules for profile specification developed in [IEEE 1588]. - -This PTP telecom profile defines the parameters from [IEEE 1588] to be used in order to guarantee protocol interoperability between implementations and specifies the optional features, default values of configurable attributes and mechanisms that must be supported. However, it does not guarantee that the performance requirements of a given application will be met. These performance aspects are defined in other ITU-T Recommendations and imply additional elements beyond the content of the PTP profile itself. - -## 6.1 High-level design requirements - -[IEEE 1588] states: - -*"The purpose of a PTP profile is to allow organizations to specify specific selections of attribute values and optional features of PTP that, when using the same transport protocol, inter-work and achieve a performance that meets the requirements of a particular application."* - -For operation in a telecom network, some additional criteria are also required to be consistent with standard telecom synchronization practices. Therefore, the PTP profile for time and phase distribution must meet the following high-level requirements: - -- 1) Mechanisms must be specified to allow interoperability between the various phase/time clocks belonging to the architecture defined in [ITU-T G.8275] and described in [ITU-T G.8273]. -- 2) Mechanisms must permit consistent operation over managed wide area telecom networks. -- 3) Packet-based mechanisms must allow the synchronization network to be designed and configured in a fixed arrangement. -- 4) Protection schemes used by packet-based systems must be based on standard telecom operational practice and allow telecom time slave clocks the ability to take phase and time from multiple geographically separate telecom grandmaster clocks. -- 5) Phase/time reference source selection based on received phase/time traceability and local priority, as well as automatic establishment of the phase/time synchronization network topology, should be permitted. - -## 6.2 PTP modes and options - -#### 6.2.1 PTP domains - -A domain consists of a logical grouping of clocks communicating with each other using the PTP protocol. - -PTP domains are used to partition a network within an administrative entity. The PTP messages and data sets are associated with a domain and therefore, the PTP protocol is independent for different domains. - -In this PTP telecom profile, the default PTP domain number is 24, and the range of applicable PTP domain numbers is {24 – 43}. - -NOTE – This range has been selected from the user-defined PTP domain number range defined in [IEEE 1588]. Although non-overlapping ranges have been considered for the different PTP telecom profiles - -so that interactions between the profiles are prevented, nothing precludes another industry from using the same user-defined PTP domain number range when defining a non-telecom PTP profile. It is the responsibility of the network operator to identify if the risk of unintentional interactions between PTP profiles exists, and to take the necessary actions to prevent such behaviour. - -### 6.2.2 PTP messages used in the profile - -This PTP profile uses the messages: *Sync*, *Follow\_Up*, *Announce*, *Delay\_Req*, and *Delay\_Resp*. - -The use of *Signalling* and *Management* messages is for further study. - -*Pdelay\_Req*, *Pdelay\_Resp*, and *Pdelay\_Resp\_Follow\_Up* messages are not used. - -### 6.2.3 Types of PTP clocks supported in the profile - -The ordinary clock (OC), boundary clock (BC) and transparent clock (TC) according to [IEEE 1588] are used in this profile. - -There are two types of OCs: - -- 1) An OC that can only be a grandmaster (T-GM according to the architecture defined in [ITU-T G.8275], and as included in [ITU-T G.8272]). -- 2) An OC that can only be a slave, i.e., slave-only OC (T-TSC according to the architecture defined in [ITU-T G.8275], and compliant with [ITU-T G.8273.2]). - -There are two types of BCs: - -- 1) A BC that can only be a grandmaster (T-GM according to the architecture defined in [ITU-T G.8275], and as included in [ITU-T G.8272]). -- 2) A BC that can become a grandmaster and can also be slaved to another PTP clock (T-BC according to architecture defined in [ITU-T G.8275] and compliant with [ITU-T G.8273.2]). - -NOTE – T-GM and grandmaster (GM) are different concepts; GM is a status defined in [IEEE 1588] that a PTP clock may obtain if it wins the best master clock algorithm (BMCA), while T-GM is a type of clock defined in the [ITU-T G.8275] architecture. - -The transparent clock used in this profile (T-TC according to the architecture defined in [ITU-T G.8275] and compliant with [ITU-T G.8273.3]) is the end-to-end transparent clock defined in [IEEE 1588]. It is not permitted to use peer-to-peer transparent clocks in this profile. - -The support of OTN ports on a T-TC is for further study. - -The support of metro transport network (MTN) ports as defined in [ITU-T G.8312] on a T-TC is for further study. - -The support of FlexE as defined in [OIF FlexE IA] on a T-TC is for further study. - -The mapping between these PTP clockTypes and the phase/time clocks defined in the [ITU-T G.8275] architecture is described in Table 1. - -**Table 1 – Mapping between [ITU-T G.8275.1] deviceTypes and PTP clockTypes** - -| deviceType from [ITU-T G.8275.1] | Description | clockType from [IEEE 1588] | -|----------------------------------|--------------------------------------------------------------------------------------------------------------------|----------------------------| -| T-GM | Master-only ordinary clock
(master with a single PTP port, always a GM, cannot be slaved to another PTP clock) | OC | -| | Master-only boundary clock
(master with multiple PTP ports, always a GM, cannot be slaved to another PTP clock) | BC | - -**Table 1 – Mapping between [ITU-T G.8275.1] deviceTypes and PTP clockTypes** - -| deviceType from [ITU-T G.8275.1] | Description | clockType from [IEEE 1588] | -|-----------------------------------------|----------------------------------------------------------------------------|-----------------------------------| -| T-BC | Boundary clock
(may become a GM, or may be slaved to another PTP clock) | BC | -| T-TSC | Slave-only ordinary clock
(always a slave, cannot become a GM) | OC | -| T-TC | Transparent clock | End-to-end TC | - -#### 6.2.3.1 Dataset member for PTP clocks supported in the profile - -A management system can configure and/or read the deviceType of a PTP clock; this allows the management node to configure other properties that are specific for that type of clock implemented in the equipment that is being deployed in the network. Equipment may support different types of clocks, and therefore deviceType is a configurable attribute. - -The data type for deviceType is Enumeration8, using the enumerated value per Table 2. - -**Table 2 – deviceType enumeration value** - -| deviceType from [ITU-T G.8275.1] | Enumeration value (hex) | -|-----------------------------------------|--------------------------------| -| T-GM | 0x10 | -| T-BC | 0x11 | -| T-TSC | 0x12 | -| T-TC | 0x13 | - -### 6.2.4 One-way versus two-way operation - -PTP operation must be two-way in this profile in order to transport phase/time synchronization, because propagation delay must be measured. Therefore, only two-way mode is allowed in this profile. - -#### 6.2.5 One-step versus two-step clock mode - -Both one-step and two-step clocks are supported in the profile. A clock compliant with the profile may use either a one-step clock or a two-step clock. - -To be compliant with [IEEE 1588], a slave port must be capable of receiving and processing messages from both one-step clocks and two-step clocks, without any particular configuration. - -#### 6.2.6 Ethernet multicast addressing for PTP messages - -For the PTP profile specified in this Recommendation, when using the PTP mapping defined in [IEEE 1588-2008] Annex F or [IEEE 1588-2019] Annex E, Ethernet multicast addressing is used for the Ethernet frames that carry the PTP messages. Both the non-forwardable multicast address 01-80-C2-00-00-0E and the forwardable multicast address 01-1B-19-00-00-00 are supported. - -A T-GM, T-BC, T-TSC or T-TC clock compliant with this profile must be capable of handling both the non-forwardable multicast address 01-80-C2-00-00-0E and the forwardable multicast address 01-1B-19-00-00-00 on all its PTP-capable Ethernet ports. - -For a T-GM, T-BC and T-TSC clock, the choice of the multicast address is made by configuration on a per-port basis; all the PTP messages of an Ethernet port must use the configured address for transmitting PTP messages to the remote PTP port. In case the remote PTP port is configured with the other address, the local PTP port must accept and process the received messages. - -The default address depends on the operator policy. See information in Appendix III. - -On transmission, the default mode for a T-TC that supports only Ethernet transport does not require any configuration: the PTP messages retransmitted by the T-TC must use the same multicast destination address as the received PTP message. It is mandatory to support this default mode in transmission. The default mode of transmission at an Ethernet port for a T-TC that supports both Ethernet and non-Ethernet ports is for further study. - -NOTE – This profile uses [IEEE 1588-2008] Annex F, *Transport of PTP over IEEE802.3/Ethernet*, or [IEEE 1588-2019] Annex E, *Transport of PTP over IEEE 802.3 transports* for the transport layer when the transport layer is Ethernet. In particular, according to the relevant Ethernet bridge models, the appropriate MAC address of the transmit Ethernet port is placed into the source address field of the header of the Ethernet frame encapsulating the PTP packets sent by any of the PTP clocks defined in this profile (i.e., T-GM, T-BC, T-TC or T-TSC). - -#### 6.2.7 PTP mapping - -This PTP telecom profile is based on the PTP mapping defined in - -- a) [IEEE 1588-2008] Annex F, *Transport of PTP over IEEE 802.3/Ethernet*, or [IEEE 1588-2019] Annex E, *Transport of PTP over IEEE 802.3 transports*, -- b) Annex H of this Recommendation, *Transport of PTP over OTN*, -- c) Annex I of this Recommendation, *Transport of PTP over MTN*, and -- d) Annex J of this Recommendation, *Transport of PTP over FlexE*. - -Therefore, a PTP clock compliant with the profile described in this Recommendation must be compliant with [IEEE 1588] for ports that use Ethernet transport, with Annex H of this Recommendation for ports that use OTN transport, with Annex I of this Recommendation for ports that use MTN, and with Annex J of this Recommendation for ports that use FlexE. This profile processes PTP messages with: - -- a) Ethernet multicast encapsulation when the transport layer is Ethernet; -- b) Either: - - i) GFP-F encapsulation and insertion into the OTUk OSMC or FlexO OSMC, or - - ii) Vendor-specific encapsulation into the OSC OSMC, - -when the transport layer is OTN; - -NOTE – OSC OSMC does not allow interoperability between different vendors. The test of this function is for further study. - -- c) Ethernet multicast encapsulation, and insertion into the MTN overhead per clause 9.2.5 of [ITU-T G.8312], when the transport layer is MTN; -- d) Ethernet multicast encapsulation, and insertion into the Synchronization Messaging Channel per clause 7.3.5 of [OIF FlexE IA], when the transport layer is FlexE. - -PTP messages with other encapsulations should be forwarded based on the forwarding rules of the respective transport. - -The transportSpecific field is used in this profile and must be set to "0". - -In the scenarios currently considered, e.g., based on full timing support with T-BC and T-TC, the insertion of a virtual local area network (VLAN) tag in the frames carrying PTP messages over - -Ethernet is not allowed for T-GMs, T-BCs and T-TSC. In this case, when receiving a PTP message within a frame containing a VLAN tag, this frame must be discarded by the T-GM, T-BC, and T-TSC. - -Some specific T-TC based configurations are discussed in Appendix I. - -Using VLAN tags in other scenarios is for further study. - -#### 6.2.8 Message rates - -Within the scope of the profile, the following messages can be used, and the corresponding indicated nominal rates shall be respected: - -- *Sync* messages (if used, *Follow\_up* messages will have the same rate) – nominal rate: 16 packets-per-second. -- *Delay\_Req/Delay\_Resp* messages – nominal rate: 16 packets-per-second. -- *Announce* messages – nominal rate: 8 packets-per-second. - -Inter-message interval requirements shall also be respected for the transmission of *Sync* (clause 9.5.9 of [IEEE 1588]) and *Announce* (clause 9.5.8 of [IEEE 1588]) messages. In addition, the time between successive *Sync* messages shall not exceed twice the mean *Sync* interval specified above, and the time between successive *Announce* messages shall not exceed twice the mean *Announce* interval specified above. - -The transmission of *Delay\_Req* messages is specified in clause 9.5.11.2 of [IEEE 1588]. - -In addition to clause 9.5.11.2 of [IEEE 1588-2008] (first and second dashed items) or of [IEEE 1588-2019] (items (a) and (b)), a clock compliant to this profile shall follow one of the following options: - -- Transmission time requirements according to clause 9.5.11.2 of [IEEE 1588-2008] (third dashed item) or of [IEEE 1588-2019] (item (c), subitem (1)), using an implementation-specific distribution. In this case, the PTP node shall, with 90% confidence, issue *Delay\_Req* messages with inter-message intervals within $\pm 30\%$ of $2^{\log\text{MinDelayReqInterval}}$ seconds. -- Transmission time requirements specified in clause 9.5.11.2 of [IEEE 1588-2008] (forth dashed item) or of [IEEE 1588-2019] (item (c), subitem (2)). - -In addition, the time between successive *Delay\_Req* messages shall not exceed $2^{\log\text{MinDelayReqInterval}+1}$ seconds. - -As per clause 9.5.12 of [IEEE 1588], the Master sets the *logMessageInterval* in the header of *Delay\_Resp* messages to a value accepted by the Master. In this profile that value is $-4$ (16 pps). - -Additional background information concerning the *Delay\_Req* message transmission specified in clause 9.5.11.2 of [IEEE 1588] is included in Appendix II. - -The use of *signalling* and *management* messages is for further study. - -## 6.3 Protection aspects and Alternate BMCA - -### 6.3.1 Alternate BMCA - -The PTP profile specified in this Recommendation uses an Alternate BMCA, as described in clause 9.3.1 of [IEEE 1588]. This Alternate BMCA differs from the default BMCA of [IEEE 1588] as follows: - -- a) This profile uses the per port Boolean attribute *masterOnly* as specified in Annex E of [ITU-T G.8275]. -- b) The profile uses the per port Boolean attribute *notMaster* as specified in Annex E of [ITU-T G.8275]. - -- c) The profile allows for multiple clocks to be active GMs simultaneously (clocks with clockClass less than 128 cannot be a slave). If there are multiple active GMs, every clock that is not a GM is synchronized by a single GM in the PTP domain. -- d) The per-port attribute localPriority is assigned to each port r of a clock and is used in the determination of Erbest and Ebest. Each parent clock or foreign master clock data set, whose *Announce* information was received on the port r, is appended with the localPriority attribute of the local port r before the data set comparison defined in Figure 2 and Figure 3 below is invoked. The localPriority attribute is not transmitted in *Announce* messages. This attribute is used as a tie-breaker in the data set comparison algorithm, in the event that all other previous attributes of the data sets being compared are equal. The localPriority attribute is set via the configurable, unsigned integer, port data set member portDS.localPriority. The data type for this attribute is UInt8. The range of values for this attribute is {1-255}. The default value for this attribute is 128. A clock compliant with this PTP profile is allowed to support a subset of the values defined in the range. -- e) The attribute localPriority is assigned to the local clock, to be used if needed when the data associated with the local clock, D0, is compared with data on another potential GM received via an *Announce* message. The local clock localPriority attribute is set via the configurable, unsigned integer, default data set member defaultDS.localPriority. The data type for this attribute is UInt8. The range of values for this attribute is {1-255}. The default value for this attribute is 128. A clock compliant with this PTP profile is allowed to support a subset of the values defined in the range. -- f) The data set comparison algorithm is modified according to Figures 2 and 3 in clause 6.3.7. - NOTE 1 – For a T-BC, the ports for which the masterOnly attribute is FALSE should be selected according to the network synchronization plan. One typical use case where this parameter should remain TRUE is to prevent timing from propagating from the access portion of the network to the core portion of the network. - NOTE 2 – The use of masterOnly is intended primarily to be used in two scenarios: - - 1) A PTP port of a T-GM; - - 2) A PTP port of a T-BC that is facing the 'downstream' direction towards the access portion of a tree topology. - -The use of the masterOnly parameter in other scenarios, such as on PTP ports participating in a ring architecture, may result in unintended operation, especially during re-configuration or topology changes. - -#### 6.3.2 Considerations on the use of the localPriority attributes - -The localPriority attributes provide a powerful tool in defining the synchronization network architecture. - -The use of the default values for these attributes as defined by the Alternate BMCA results in a timing-loop free synchronization network. - -Proper planning will be mandatory to avoid timing-loops when configuring values different from the default ones. - -#### 6.3.3 Static clock attribute priority1 - -In this PTP profile, the clock attribute priority1 is static. It is initialized to a default value equal to the midpoint value, 128, of its range, and this value must not be changed. - -The priority1 parameter is not used in this version of the PTP telecom profile. Future versions may consider using this attribute, this is for further study. - -#### 6.3.4 Clock attribute priority2 - -In this PTP profile, the clock attribute priority2 is configurable. - -It is initialized to a default value, equal for T-GM and T-BC clocks to the midpoint value, 128, of its range {0-255}. The default value for T-TSC clocks is 255, and the range is {255}. - -A T-GM or T-BC compliant with this PTP profile must support all the values of priority2 defined in the range. A T-TSC compliant with this profile must support, on reception, all the values of priority2 defined in the full [IEEE 1588] range (i.e., {0-255}). - -Appendix IV describes possible use cases for the priority2 attribute; Appendix X describes possible use cases for the priority2 attribute under Note 3 of Table 3; other cases are for further study. - -#### 6.3.5 Other clock attributes - -A PTP clock compliant with this PTP profile must support all the values of clockClass, clockAccuracy, and offsetScaledLogVariance upon reception [shall not discard] defined in the full [IEEE 1588] range. - -The applicable values of the clock attribute clockClass are specified in clause 6.4. - -NOTE – It is not expected that equipment compliant to this profile and deployed in an ITU-T G.8275.1 network will receive clockClass values not specified in Table 3 or Table 5. If a clockClass value not specified in Table 3 or Table 5 is received, then the equipment may raise an implementation specific alarm. Future revisions of this profile may include clockClass values not defined in Table 3 or Table 5. - -The following values of the clock attribute clockAccuracy apply for the following situations: - -- 0x20 for a T-GM connected to an enhanced primary reference time clock (ePRTC) in locked-mode (i.e., ePRTC traceable to global navigation satellite system (GNSS)); -- 0x21 for a T-GM connected to a PRTC in locked-mode (i.e., PRTC traceable to GNSS) or a T-GM connected to an ePRTC where the ePRTC is in phase/time holdover within ITU-T G.8272.1 ePRTC-A specification as specified in Table 3 of [ITU-T G.8272.1]; -- 0xFE for a T-GM not connected to an ePRTC nor a PRTC in locked-mode, or a T-GM connected to an ePRTC in phase/time holdover but outside the holdover specification in Table 3 of [ITU-T G.8272.1]; -- 0xFE for a T-BC, all the time. - -The following values of the clock attribute offsetScaledLogVariance apply for the following situations: - -- 0x4B32 for a T-GM connected to an ePRTC in locked-mode (i.e., ePRTC traceable to GNSS). This corresponds to TDEV of 10 ns, at observation interval of 1 000 000 s. The corresponding value of PTP Variance (PTPVAR) is $1.271 \times 10^{-16} \text{ s}^2$ (see Appendix IX); -- 0x4E5D for a T-GM connected to a PRTC in locked-mode (i.e., PRTC traceable to GNSS). This corresponds to TDEV of 30 ns, at observation interval of 10 000 s. The corresponding value of PTP Variance (PTPVAR) is $1.144 \times 10^{-15} \text{ s}^2$ (see Appendix IX); -- 0xFFFF for a T-GM not connected to an ePRTC in locked-mode nor to a PRTC in locked-mode; -- 0xFFFF for a T-BC, all the time. - -### 6.3.6 State decision algorithm - -The state decision algorithm applicable to the Alternate BMCA of the PTP profile specified in this Recommendation is given in Figure 1. After a decision is reached by use of this algorithm, the data sets of the local clock are updated as specified in clause 9.3.5 of [IEEE 1588]. Details on the use of the algorithm are given in clause 9.3.3 of [IEEE 1588]. - -#### 6.3.7 Data set comparison algorithm - -The data set comparison algorithm for the Alternate BMCA of the PTP profile specified in this Recommendation is given in Figures 2 and 3 below. With this algorithm, one clock is compared with another using the data sets representing those clocks, appended with the localPriority attribute. Details on the use of the algorithm are given in clause 9.3.4 of [IEEE 1588]. - -If either of the data sets, A or B, in Figures 2 and 3 contain the data of the parent clock or a foreign master clock, the corresponding localPriority for its data set is the localPriority of the local port $r$ on which the information from that parent clock or foreign master clock has been received (see item (d) of clause 6.3.1). - -If either of the data sets, A or B, in Figures 2 and 3 contain the data of the local clock, $D_0$ , the corresponding localPriority for that data set is the localPriority of the local clock (see item (e) of clause 6.3.1). - -NOTE 1 – It is recommended that the entire data set comparison algorithm described in Figures 2 and 3 be implemented even if some parameters are currently static, because they may be used in future versions of this Recommendation. - -NOTE 2 – The block in Figure 2 "GM clockClass of A is 127 or less" enables different T-BCs in the network to be synchronized by different T-GMs when multiple T-GMs are deployed. - -NOTE 3 – If portDS.SF is TRUE on port $r$ , then the PTP port should set the respective $E_{\text{rbest}}$ to the empty set. As a result, the computation of $E_{\text{best}}$ will not use the information contained in any Announce messages received on the port $r$ . Signal fail (SF) is described in clause 6.3.9. - -![Flowchart of the state decision algorithm for Alternate BMCA. The process starts with 'State decision algorithm for port 'r' on clock C0'. It checks if E_best is empty and the port is in LISTENING state. If yes, it remains in LISTENING. If no, it checks if D0 is Class 1 through 127. If yes, it checks if D0 is better or better by topology than E_rbest. If yes, it becomes BMC_MASTER (D0) M1. If no, it becomes BMC_PASSIVE (E_rbest) P1. If D0 is not Class 1 through 127, it checks if D0 is better or better by topology than E_best. If yes, it becomes BMC_MASTER (D0) M2. If no, it proceeds to check if E_best received on port 'r'. If yes, it becomes BMC_SLAVE (E_best = E_rbest) S1. If no, it checks if E_best is better by topology than E_rbest. If yes, it becomes BMC_PASSIVE (E_rbest) P2. If no, it becomes BMC_MASTER (E_best) M3. A key indicates that recommended states are in shaded boxes.](9c6461e1e94afae4dec455e69a2ce152_img.jpg) - -``` - -graph TD - Start([State decision algorithm for port 'r' on clock C0]) --> D1{E_best is the empty set AND Port state is LISTENING} - D1 -- Yes --> R1([Remain in LISTENING state]) - D1 -- No --> D2{D0 is Class 1 through 127} - D2 -- Yes --> D3{D0 better or better by topology than E_rbest} - D2 -- No --> D4{D0 better or better by topology than E_best} - D3 -- Yes --> M1([BMC_MASTER D0 M1]) - D3 -- No --> P1([BMC_PASSIVE E_rbest P1]) - D4 -- Yes --> M2([BMC_MASTER D0 M2]) - D4 -- No --> D5{E_best received on port 'r'} - D5 -- Yes --> S1([BMC_SLAVE E_best = E_rbest S1]) - D5 -- No --> D6{E_best better by topology than E_rbest} - D6 -- Yes --> P2([BMC_PASSIVE E_rbest P2]) - D6 -- No --> M3([BMC_MASTER E_best M3]) - -``` - -KEY - -Recommended state (basis for data set updates) - -G.8275.1-Y.1369.1(16)\_F01 - -Flowchart of the state decision algorithm for Alternate BMCA. The process starts with 'State decision algorithm for port 'r' on clock C0'. It checks if E\_best is empty and the port is in LISTENING state. If yes, it remains in LISTENING. If no, it checks if D0 is Class 1 through 127. If yes, it checks if D0 is better or better by topology than E\_rbest. If yes, it becomes BMC\_MASTER (D0) M1. If no, it becomes BMC\_PASSIVE (E\_rbest) P1. If D0 is not Class 1 through 127, it checks if D0 is better or better by topology than E\_best. If yes, it becomes BMC\_MASTER (D0) M2. If no, it proceeds to check if E\_best received on port 'r'. If yes, it becomes BMC\_SLAVE (E\_best = E\_rbest) S1. If no, it checks if E\_best is better by topology than E\_rbest. If yes, it becomes BMC\_PASSIVE (E\_rbest) P2. If no, it becomes BMC\_MASTER (E\_best) M3. A key indicates that recommended states are in shaded boxes. - -Figure 1 – State decision algorithm for Alternate BMCA - -![Flowchart of the data set comparison algorithm for Alternate BMCA. It starts with 'Compare data set A to B' and proceeds through a series of decision diamonds: 'Compare GM clockClass values of A and B', 'Compare GM clockAccuracy values of A and B', 'Compare GM offsetScaledLogVariance values of A and B', 'Compare GM priority2 values of A and B', 'Compare localPriority values of A and B', 'GM clockClass of A is 127 or less', and 'Compare GM clockIdentity values of A and B'. Each diamond has 'A > B', 'A = B', and 'A < B' branches. The 'A > B' branches lead to 'Return B better than A', the 'A = B' branches lead to a connector 'x', and the 'A < B' branches lead to 'Return A better than B'. A connector 'x' is also reached if 'GM clockClass of A is 127 or less' is 'Yes'.](b6671cfafda3820aafe9a24fa7a4d8c7_img.jpg) - -``` - -graph TD - Start([Compare data set A to B]) --> D1{Compare GM clockClass values of A and B} - D1 -- A > B --> EndB([Return B better than A]) - D1 -- A = B --> D2{Compare GM clockAccuracy values of A and B} - D1 -- A < B --> EndA([Return A better than B]) - D2 -- A > B --> EndB - D2 -- A = B --> D3{Compare GM offsetScaledLogVariance values of A and B} - D2 -- A < B --> EndA - D3 -- A > B --> EndB - D3 -- A = B --> D4{Compare GM priority2 values of A and B} - D3 -- A < B --> EndA - D4 -- A > B --> EndB - D4 -- A = B --> D5{Compare localPriority values of A and B} - D4 -- A < B --> EndA - D5 -- A > B --> EndB - D5 -- A = B --> D6{GM clockClass of A is 127 or less} - D5 -- A < B --> EndA - D6 -- Yes --> X1((x)) - D6 -- No --> D7{Compare GM clockIdentity values of A and B} - D7 -- A > B --> EndB - D7 -- A = B --> X2((x)) - D7 -- A < B --> EndA - -``` - -G.8275.1-Y.1369.1(16)\_F02 - -Flowchart of the data set comparison algorithm for Alternate BMCA. It starts with 'Compare data set A to B' and proceeds through a series of decision diamonds: 'Compare GM clockClass values of A and B', 'Compare GM clockAccuracy values of A and B', 'Compare GM offsetScaledLogVariance values of A and B', 'Compare GM priority2 values of A and B', 'Compare localPriority values of A and B', 'GM clockClass of A is 127 or less', and 'Compare GM clockIdentity values of A and B'. Each diamond has 'A > B', 'A = B', and 'A < B' branches. The 'A > B' branches lead to 'Return B better than A', the 'A = B' branches lead to a connector 'x', and the 'A < B' branches lead to 'Return A better than B'. A connector 'x' is also reached if 'GM clockClass of A is 127 or less' is 'Yes'. - -**Figure 2 – Data set comparison algorithm, part 1, for Alternate BMCA** - -![Flowchart of the data set comparison algorithm, part 2, for Alternate BMCA. The process starts at node 'x' and proceeds through a series of decision diamonds and action ovals. The first decision is 'Compare stepsRemoved values of A and B'. If A > B+1, it goes to 'Return B better than A' (Receiver < Sender). If A+1 < B, it goes to 'Return A better than B' (Receiver < Sender). If A is within 1 of B, it proceeds to the next decision: 'Compare portIdentities of receiver of A and sender of A' vs 'Compare portIdentities of receiver of B and sender of B'. If A > B, it goes to 'Compare portIdentities of sender of A and sender of B'. If A < B, it goes to 'Return A better by topology than B' (Receiver > Sender). If A = B, it proceeds to 'Compare portNumbers of receiver of A and receiver of B'. If A > B, it goes to 'Return B better by topology than A' (Receiver > Sender). If A < B, it goes to 'Return A better by topology than B' (Receiver > Sender). If A = B, it goes to 'error-2'. If Receiver = Sender at any point, it goes to 'error-1'.](5b8a756d9a71c35f17db8bcb90b438a3_img.jpg) - -``` - -graph TD - x((x)) --> D1{Compare stepsRemoved values of A and B} - D1 -- "A > B+1" --> O1([Return B better than A]) - O1 -- "Receiver < Sender" --> D2{Compare portIdentities of receiver of A and sender of A} - D1 -- "A+1 < B" --> O2([Return A better than B]) - O2 -- "Receiver < Sender" --> D3{Compare portIdentities of receiver of B and sender of B} - D1 -- "A within 1 of B" --> D4{Compare portIdentities of receiver of A and sender of A} - D4 -- "A > B" --> D5{Compare portIdentities of sender of A and sender of B} - D4 -- "A < B" --> D3 - D4 -- "A = B" --> D6{Compare portNumbers of receiver of A and receiver of B} - D5 -- "A > B" --> O3([Return B better by topology than A]) - O3 -- "Receiver > Sender" --> D2 - D5 -- "A < B" --> O4([Return A better by topology than B]) - O4 -- "Receiver > Sender" --> D3 - D5 -- "A = B" --> D6 - D6 -- "A > B" --> O3 - D6 -- "A < B" --> O4 - D6 -- "A = B" --> E2([error-2]) - D2 -- "Receiver < Sender" --> O1 - D2 -- "Receiver > Sender" --> O3 - D2 -- "Receiver = Sender" --> E1a([error-1]) - D3 -- "Receiver < Sender" --> O2 - D3 -- "Receiver > Sender" --> O4 - D3 -- "Receiver = Sender" --> E1b([error-1]) - -``` - -Flowchart of the data set comparison algorithm, part 2, for Alternate BMCA. The process starts at node 'x' and proceeds through a series of decision diamonds and action ovals. The first decision is 'Compare stepsRemoved values of A and B'. If A > B+1, it goes to 'Return B better than A' (Receiver < Sender). If A+1 < B, it goes to 'Return A better than B' (Receiver < Sender). If A is within 1 of B, it proceeds to the next decision: 'Compare portIdentities of receiver of A and sender of A' vs 'Compare portIdentities of receiver of B and sender of B'. If A > B, it goes to 'Compare portIdentities of sender of A and sender of B'. If A < B, it goes to 'Return A better by topology than B' (Receiver > Sender). If A = B, it proceeds to 'Compare portNumbers of receiver of A and receiver of B'. If A > B, it goes to 'Return B better by topology than A' (Receiver > Sender). If A < B, it goes to 'Return A better by topology than B' (Receiver > Sender). If A = B, it goes to 'error-2'. If Receiver = Sender at any point, it goes to 'error-1'. - -**Figure 3 – Data set comparison algorithm, part 2, for Alternate BMCA** - -#### 6.3.8 Unused PTP fields - -Some PTP fields are not used in this PTP profile. This clause defines the actions applicable to these unused PTP fields. - -Table A.8 in clause A.10 of this Recommendation defines the PTP common header flag values, and whether or not each flag is used in this profile. - -In addition, the following fields are not used in this profile: - -- The "controlField" in the common header of PTP messages is not used in this profile. This field must be ignored by the receiver for all types of PTP messages; -- The "priority1" field in the *Announce* message is not used and must be set to a fixed value specified in clause 6.3.3. - -When a PTP clock receives a PTP message with a field, whose use is not specified in this PTP profile, containing a value outside the allowed range, then this field of the PTP message must be ignored, without discarding the PTP message. - -As an example, a PTP clock compliant with this PTP profile must ignore on reception the field value for the following fields. A clock compliant with this PTP profile must not update its local data sets with the ingress value for these fields: - -- flagField – alternateMasterFlag; -- flagField – unicastFlag; -- flagField – PTP profile Specific 1; -- flagField – PTP profile Specific 2. - -When a PTP clock receives a PTP message with a field, whose use is specified in this PTP profile, containing a value outside the allowed range for reception, then this entire PTP message must be discarded. The allowed range for a parameter on reception is the same as the range for the corresponding default dataset parameter, except for the attributes clockClass, clockAccuracy, offsetScaledLogVariance, and priority2 (see clauses 6.3.4 and 6.3.5). - -As an example, a compliant clock must discard on reception the ingress packet (General and Event messages) when any of the following fields are outside of the allowed range for the profile: - -- domainNumber; -- versionPTP. - -The clock's local data set must not be updated with the ingress value. - -NOTE 1 – If a clock receives an *Announce* message with the "priority1" field set to a value other than 128, and if the clock advertising this value is selected as the GM, then 128 must be re-advertised by the receiving clock. The unused attribute priority1 is ignored by the receiving clock for the purpose of the Alternate BMCA. - -NOTE 2 – The allowed ranges for reception for the clock attributes priority2, clockClass, clockAccuracy, and offsetScaledLogVariance are the respective full [IEEE 1588] ranges, see clauses 6.3.4 and 6.3.5. - -#### 6.3.9 Packet timing signal fail - -This clause is optional but, if implemented, it is necessary for the equipment to conform to the requirements contained herein. An implementation may support all, none, or a subset of these types of PTSF. - -This clause defines the notion of packet timing signal fail (PTSF), which corresponds to a signal indicating a failure of the PTP packet timing signal received by a port. - -Three types of PTSF may be raised in a PTP clock: - -- 1) PTSF-lossOfTimingMessages, lack of reception of PTP timing messages from a master (loss of the packet timing signal): if the slave or passive port of a PTP clock no longer receives the timing messages sent by a master (i.e., *Sync* and subsequently *Follow\_Up* and *Delay\_Resp* messages), then a PTSF-lossOfTimingMessages associated with this master must occur. A timeout period for reception of *Sync* messages or *Delay\_Resp* messages (i.e., *syncReceiptTimeout* and *delayRespReceiptTimeout*) for these timing messages must be implemented in the PTP port before triggering the PTSF-lossOfTimingMessages (the range and default value of these timeout parameters are defined in Table A.5). - -The value of *syncReceiptTimeout* shall specify the number of *Sync* message intervals that have to pass without receipt of a *Sync* and, if the *twoStep* flag of the *Sync* message is TRUE, a *Follow\_Up* message before the triggering of the PTSF-lossOfTimingMessages event. - -The value of *delayRespReceiptTimeout* shall specify the number of *Delay\_Req* message intervals that have to pass without receipt of a *Delay\_Resp* message before the triggering of the PTSF-lossOfTimingMessages event. - -When the PTP port enters the UNCALIBRATED or PASSIVE state, a timer should be activated. - -- 2) PTSF-unusable, unusable PTP packet timing signal received by the slave or passive port of a PTP clock, exceeding the input tolerance of the PTP clock (noisy packet timing signal): if the PTP packet timing signal is not usable for the PTP clock to achieve the performance target (e.g., excessive noise or abnormal PTP timestamps), then a PTSF-unusable associated with this master must occur. The criteria used to determine that the packet timing signal is not suitable to be used are for further study. - -- 3) PTSF-synchronizationUncertain: uncertain timing signal received by the slave or passive port of a PTP clock, if the synchronizationUncertain flag of an Announce message received from an upstream clock is TRUE, a PTSF-synchronizationUncertain associated with this master must occur. - -When a PTSF occurs, the clock may set the PTP portDS.SF to TRUE and generate a state decision event, which triggers the running of the alternate BMCA. As described in clause 6.3.7 a value of portDS.SF of TRUE can be used to exclude PTP ports from the alternate BMCA selection process. An implementation may set the PTP portDS.SF to TRUE for only a subset of PTSF listed above; that is, the implementation may set portDS.SF to TRUE for some PTSF and leave portDS.SF as FALSE for others. For example, when PTSF-synchronizationUncertain is raised, if portDS.SF is not set to TRUE, then this would allow the PTP topology to be built as described in Annex D of [ITU-T G.8275]. - -NOTE 1 – See Appendix XIV for more discussion of deployments with transparent clocks. - -NOTE 2 – Annex K includes an option for dynamic monitoring by a PTP port when its portDS.SF has been set to TRUE due to PTSF. - -## 6.4 Phase/time traceability information - -To deliver phase/time traceability information, the clockClass values described in Table 3 must be used in this PTP telecom profile. Additional information for interworking purposes is provided in Table 5. - -The frequencyTraceable flag present in the header of the PTP messages is defined in this profile as follows: if the PTP clock - -- is a T-GM that is traceable to a PRTC in locked mode or -- is a T-GM or a T-BC in holdover or free-run mode that has a timescale traceable to a primary reference clock (PRC), - -then this parameter must be set to TRUE, otherwise it must be FALSE. This flag is not used in the Alternate BMCA defined in clause 6.3; the values provided for this flag in Table 3 can be used by a network operator for monitoring purposes or by end applications to take definitive action as described in Appendix VIII. - -When a T-GM first enters holdover, it downgrades the clockClass value that it uses to 7. It then calculates if the time error at its output is still within the holdover specification. When the T-GM determines that the time error at its output has exceeded the holdover specification, it downgrades the clockClass value that it uses to 140, 150 or 160 depending on the quality of its frequency reference (internal oscillator or received physical layer frequency signal on an external interface). - -When a T-BC first enters holdover, it downgrades the clockClass value that it uses to 135. It then calculates if the time error at its output is still within the holdover specification. When the T-BC determines that the time error at its output has exceeded the holdover specification, it downgrades the clockClass value that it uses to 165 (internal oscillator or received physical layer frequency signal on an external interface). - -NOTE 1 – The applicable holdover specification depends on the design and budgeting of the synchronization network. See Appendix V of [ITU-T G.8271.1] for examples of network budgeting. A typical value for the holdover budget, described in the failure scenario (b) depicted in [ITU-T G.8271.1] Table V.1, when using the T-GM or T-BC for holdover while still meeting a total time error of 1.5 µs, is 400 ns. - -NOTE 2 – When the term clockClass is used with respect to the property of the individual PTP clock (T-GM, T-BC, T-TSC) it is referring to data set member defaultDS.clockQuality.clockClass. - -NOTE 3 – For the T-BC in locked mode, the traceability information of the currently selected best master clock will be passed to the downstream nodes, as per PTP. This means that the attributes and flags in the PTP header will always reflect the phase/time traceability information from the current parent clock, regardless of - -the frequency traceability of the T-BC's physical layer clock. Failure scenarios including holdover are for further study. - -**Table 3 – Applicable clockClass values** - -| Phase/time traceability description | defaultDS.
clockQuality.
clockClass | frequencyTraceable
flag | timeTraceable
flag | -|--------------------------------------------------------------------------------------------------------|-------------------------------------------|----------------------------|-----------------------| -| T-GM connected to a PRTC in locked mode (e.g., PRTC traceable to GNSS) | 6 | TRUE | TRUE | -| T-GM in holdover, within holdover specification, traceable to Category 1 frequency source (Note 1) | 7 | TRUE | TRUE | -| T-GM in holdover, within holdover specification, non-traceable to Category 1 frequency source (Note 1) | 7 | FALSE | TRUE | -| T-BC in holdover, within holdover specification, traceable to Category 1 frequency source (Note 1) | 135 | TRUE | TRUE | -| T-BC in holdover, within holdover specification, non-traceable to Category 1 frequency source (Note 1) | 135 | FALSE | TRUE | -| T-GM in holdover, out of holdover specification, traceable to Category 1 frequency source (Note 1) | 140 | TRUE | FALSE | -| T-GM in holdover, out of holdover specification, traceable to Category 2 frequency source (Note 1) | 150 | FALSE | FALSE | -| T-GM in holdover, out of holdover specification, traceable to Category 3 frequency source (Note 1) | 160 | FALSE | FALSE | -| T-BC in holdover, out of holdover specification (Note 1) | 165 | (Note 2) | FALSE | -| T-GM or T-BC in free-run mode | 248 | (Note 2) | FALSE | -| Slave only OC (does not send Announce messages) | 255 | (Note 2) | As per PTP | - -NOTE 1 – The holdover specification threshold controlling the time spent advertising clockClass values 7 or 135 could be set to zero so that the T-GM or T-BC would advertise a degraded clockClass value directly after losing traceability to a PRTC. In this case, initially after advertising clockClass values 140, 150, 160, or 165, a clock may still be within the holdover specification. - -NOTE 2 – The frequencyTraceable flag may be TRUE or FALSE, depending on the availability of a PRC-traceable physical layer frequency input signal. - -NOTE 3 – As an option, the clockClass range of a T-BC can be extended from (135, 165, 248) to (135, 140, 150, 160, 165, 248) for some cases, where (a) 140, 150, 160, and 165 are related to the quality of the frequency reference, (b) the applicable circumstances of 140, 150, and 160 are the same as for the T-GM, and (c) 165 corresponds to synchronous Ethernet equipment clock (EEC) or the OTN equipment clock (OEC). Details are in Appendix X. If this option is used, then in a single PTP domain, all PTP clocks should implement this option (and should not be intermixed with clocks that do not implement this option). Details are for further study. - -NOTE 4 – The term "holdover" in this table refers to "time holdover". - -**Table 3 – Applicable clockClass values** - -| | -|--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| NOTE 5 – Refer to Appendix VII for more information about the behaviour of a T-BC that was previously synchronizing to a T-GM or a T-BC that is advertising 'within holdover specification', 'out of holdover specification', or 'free-run mode'. | -| NOTE 6 – A T-BC that is locked to a PRTC through virtual PTP port (refer to Figure II.1 in ITU-T G.8275, Appendix II) and meets the holdover performance requirements of a T-GM, may follow the clockClass assignments of a T-GM if the T-BC enters holdover (a) due to the loss of the connectivity to that PRTC, and (b) no other PTP source is available. | - -Table 4 describes how the clock quality levels (QLs) defined in [ITU-T G.781] are mapped to Category 1, 2 and 3 frequency sources used in Table 3. - -**Table 4 – Mapping of [ITU-T G.781] clock QLs to Category 1, 2, 3 frequency sources** - -| Category
(in Table 3 and 5) | ITU-T G.781
option I QLs | ITU-T G.781
option II QLs | -|--------------------------------|------------------------------------|------------------------------------| -| Category 1 frequency source | QL-ePRTC, QL-PRTC, QL-ePRC, QL-PRC | QL-ePRTC, QL-PRTC, QL-ePRC, QL-PRS | -| Category 2 frequency source | QL-SSU-A | QL-ST2 | -| Category 3 frequency source | QL-SSU-B | QL-ST3E | - -NOTE – Other frequency source categories, while not used in Table 3, are possible. An example is a category containing QL-EEC1 and QL-EEC2. - -NOTE 4 – The case of a T-BC acting as a GM, with an external phase/time input coming from a PRTC, is handled by means of a virtual PTP port with associated $E_{rbest}$ attributes as described in Annex C of this Recommendation. The general case of a T-BC with a phase/time external synchronization input different from PRTC is for further study. - -Table 5 presents a subset of the clockClass values of Table 3 based on the quality of the frequency reference, and the mapping of the corresponding values used by some equipment deployed prior to this Recommendation. - -NOTE 5 – When interoperability with equipment deployed prior to this Recommendation is needed, both sets of clockClass values would need to be supported. Other aspects may be required for full interoperability. - -**Table 5 – clockClass values for equipment deployed prior to this Recommendation** - -| Phase/time traceability description | Values
defined in
Table 3 | Values prior to
this Rec. | -|----------------------------------------------------------------------------------------------------|---------------------------------|------------------------------| -| T-GM connected to a PRTC in locked mode (e.g., PRTC traceable to GNSS) | 6 | 6 | -| T-GM in holdover, out of holdover specification, traceable to Category 1 frequency source (Note 1) | 140 | 7 | -| T-GM in holdover, out of holdover specification, traceable to Category 2 frequency source (Note 1) | 150 | (Note 2) | -| T-GM in holdover, out of holdover specification, traceable to Category 3 frequency source (Note 1) | 160 | 52 | -| T-BC in holdover, out of holdover specification, using unspecified frequency source (Note 1) | 165 | 187 | - -**Table 5 – clockClass values for equipment deployed prior to this Recommendation** - -| | | | -|--------------------------------------------------------------------------------------------------------------------------------|-----|-----| -| Slave only OC (does not send Announce messages) | 255 | 255 | -| NOTE 1 – Initially after advertising clockClass values greater than 6, a clock may still be within the holdover specification. | | | -| NOTE 2 – Refer to the applicable value specified for the equipment. | | | -| NOTE 3 – The term "holdover" in this table refers to "time holdover". | | | - -# **7 ITU-T PTP profile for phase/time distribution with full timing support from the network** - -The PTP profile for phase/time distribution with full timing support from the network is contained in Annex A. - -# **8 Security aspects** - -For further study. - -## Annex A - -## ITU-T PTP profile for phase/time distribution with full timing support from the network - -(This annex forms an integral part of this Recommendation.) - -This annex contains the PTP telecom profile for phase/time distribution with full timing support from the network, as required by [IEEE 1588]. In order to claim compliance with this PTP telecom profile, the requirements in this annex and in the body of this Recommendation must both be met. - -### A.1 Profile identification - -profileName: ITU-T PTP profile for phase/time distribution with full timing support from the network - -profileVersion: 2.4 (for an implementation based on IEEE Std 1588-2008 [IEEE 1588-2008]) - -profileVersion: 2.5 (for an implementation based on IEEE Std 1588-2019 [IEEE 1588-2019]) - -profileIdentifier: 00-19-A7-01-02-04 (for an implementation based on IEEE Std 1588-2008 [IEEE 1588-2008]) - -profileIdentifier: 00-19-A7-01-02-05 (for an implementation based on IEEE Std 1588-2019 [IEEE 1588-2019]) - -See clause A.11 for details of compatibility between profile versions. - -This profile is specified by ITU-T. - -A copy may be obtained from [www.itu.int](http://www.itu.int). - -### A.2 PTP attribute values - -The default values and ranges of the PTP attributes for use in this profile are contained in Tables A.1, A.2, A.3, A.4, A.5, A.6 and A.7. For the attributes clockClass, clockAccuracy, offsetScaledLogVariance, and priority2, the ranges shown are those for the defaultDS. - -NOTE 1 – A boundary clock follows the rules of [IEEE 1588] for selection of parent clock, updating of parentDS, and transmission of Announce messages, so it may transmit values different from the defaultDS values. - -Attributes not specified by this profile must use the default initialization values and ranges defined in [IEEE 1588]. - -These tables provide a default initialization value and range for each data set member for: - -- Telecom grandmaster: ordinary clock or boundary clock that can only act as a GM (T-GM according to [ITU-T G.8275] – first PTP clock of the chain); -- Telecom time slave clock: ordinary clock with a clockClass = 255 (T-TSC according to [ITU-T G.8275] – last PTP clock of the chain); -- Telecom boundary clock: boundary clock that may or may not be a GM; such a clock will be a GM if it is the best clock in the network (T-BC according to [ITU-T G.8275] – intermediate PTP clocks of the chain); -- Telecom transparent clock: end-to-end transparent clock (T-TC according to [ITU-T G.8275] – intermediate PTP clock of the chain). - -The mapping between these PTP clockTypes and the phase/time clocks defined in the [ITU-T G.8275] architecture is described in Table 1, clause 6.2.3. - -The attributes defined in Tables A.6 and A.7 are only required for implementations based on [IEEE 1588-2008]; they have been deprecated in [IEEE 1588-2019]. For implementations based on [IEEE 1588-2008], these transparent clock datasets are not used for telecom grandmasters, telecom time slave clocks and telecom boundary clocks. For implementations based on [IEEE 1588-2008], they are mandatory for telecom transparent clocks. For implementations based on [IEEE 1588-2019], these transparent clock datasets are optional. - -NOTE 2 – A feature that is deprecated by [IEEE 1588], is no longer recommended or required. - -Some attributes in these tables are associated with optional features of this Recommendation. Therefore, these attributes are also optional, unless the associated feature is implemented, in which case these attributes must be supported. - -Unless explicitly documented within these tables, the data type of a dataset member is as per PTP. - -**Table A.1 – defaultDS data set member specifications** - -| [IEEE 1588-2008] | | [IEEE 1588-2019] | | Members of the data set | Telecom grandmaster requirements | | Telecom time slave clock requirements | | Telecom boundary clock requirements | | -|------------------|--------------|------------------|--------------|-----------------------------------------------------------|---------------------------------------|---------------------------------|---------------------------------------|---------------|---------------------------------------|-----------------| -| Clause | Data type | Clause | Data type | | Default initialization value (Note 5) | Range | Default initialization value (Note 5) | Range | Default initialization value (Note 5) | Range | -| 8.2.1.2.1 | As per PTP | (Note 3) | (Note 3) | defaultDS.twoStepFlag (static) | As per PTP | {FALSE, TRUE} | As per PTP | {FALSE, TRUE} | As per PTP | {FALSE, TRUE} | -| 8.2.1.2.2 | As per PTP | 8.2.1.2.2 | As per PTP | defaultDS.clock Identity (static) (Note 2) | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | -| 8.2.1.2.3 | As per PTP | 8.2.1.2.3 | As per PTP | defaultDS.numberPorts (dynamic) (Note 2) | 1 for OC
As per PTP for BC | {1} for OC
As per PTP for BC | 1 | {1} | As per PTP | As per PTP | -| 8.2.1.3.1.1 | As per PTP | 8.2.1.3.1.2 | As per PTP | defaultDS.clock Quality.clockClass (dynamic) | 248 | {6, 7, 140, 150, 160, 248} | 255 | {255} | 248 | {135, 165, 248} | -| 8.2.1.3.1.2 | As per PTP | 8.2.1.3.1.3 | As per PTP | defaultDS.clock Quality.clockAccuracy (dynamic) | 0xFE | As per PTP (Note 1) | 0xFE | {0xFE} | 0xFE | {0xFE} | -| 8.2.1.3.1.3 | As per PTP | 8.2.1.3.1.4 | As per PTP | defaultDS.clock Quality.offsetScaledLogVariance (dynamic) | 0xFFFF | As per PTP (Note 1) | 0xFFFF | {0xFFFF} | 0xFFFF | {0xFFFF} | -| 8.2.1.4.1 | As per PTP | 8.2.1.4.1 | As per PTP | defaultDS.priority1 (configurable) | 128 | {128} | 128 | {128} | 128 | {128} | -| 8.2.1.4.2 | As per PTP | 8.2.1.4.2 | As per PTP | defaultDS.priority2 (configurable) | 128 | {0-255} | 255 | {255} | 128 | {0-255} | -| 8.2.1.4.3 | As per PTP | 8.2.1.4.3 | As per PTP | defaultDS.domain Number (configurable) (Note 2) | 24 | {24-43} | 24 | {24-43} | 24 | {24-43} | -| 8.2.1.4.4 | As per PTP | 8.2.1.4.4 | As per PTP | defaultDS.slave Only (configurable) | FALSE | {FALSE} | TRUE | {TRUE} | FALSE | {FALSE} | -| (Note 4) | As per PTP | 8.2.1.4.5 | As per PTP | defaultDS.sdoId (configurable) (Note 2) | 0x000 | 0x000 | 0x000 | 0x000 | 0x000 | 0x000 | -| New member | UInteger8 | New member | UInteger8 | defaultDS.local Priority (configurable) | 128 | {1-255} | 128 | {1-255} | 128 | {1-255} | -| New member | UInteger8 | 8.2.1.5.4 | As per PTP | defaultDS.maxStepsRemoved (configurable) | 255 | {2-255} | 255 | {2-255} | 255 | {2-255} | -| New member | Enumeration8 | New member | Enumeration8 | defaultDS.deviceType (configurable) | (Note 6) | (Note 6) | (Note 6) | (Note 6) | (Note 6) | (Note 6) | -| New member | Octet[6] | New member | Octet[6] | defaultDS.profileIdentifier (configurable) | (Note 7) | (Note 7) | (Note 7) | (Note 7) | (Note 7) | (Note 7) | - -**Table A.1 – defaultDS data set member specifications** - -| | -|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| NOTE 1 – Examples of applicable values are shown in clause 6.3.5. Additional values, not specified in clause 6.3.5, may be applicable to future use cases. These additional values are for further study. | -| NOTE 2 – Applicable also to T-TC in case of an [IEEE 1588-2019] based implementation. | -| NOTE 3 – In case of [IEEE 1588-2019] based implementations this data set member is deprecated. | -| NOTE 4 – Applicable to [IEEE 1588-2019] based implementations; this data set member does not exist in [IEEE 1588-2008]. | -| NOTE 5 – If a default value is not provided by this Recommendation, then it is implementation specific. | -| NOTE 6 – This attribute can be used to set the deviceType in use in the PTP clock instance. See clause 6.2.3.1 for more information and applicable values. | -| NOTE 7 – This dataset member is set according to the profileIdentifier specified in clause A.1 | - -**Table A.2 – currentDS data set member specifications** - -| Clause from [IEEE 1588-2008] | Clause from [IEEE 1588-2019] | Members of the data set | Telecom grandmaster requirements | | Telecom time slave clock requirements | | Telecom boundary clock requirements | | -|------------------------------|------------------------------|--------------------------------------|---------------------------------------|------------|---------------------------------------|------------|---------------------------------------|------------| -| | | | Default initialization value (Note 3) | Range | Default initialization value (Note 3) | Range | Default initialization value (Note 3) | Range | -| 8.2.2.2 | 8.2.2.2 | currentDS.stepsRemoved (dynamic) | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | -| 8.2.2.3 | 8.2.2.3 | currentDS.offsetFromMaster (dynamic) | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | -| 8.2.2.4 | (Note 1) | currentDS.meanPathDelay (dynamic) | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | -| (Note 2) | 8.2.2.4 | currentDS.meanDelay (dynamic) | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | - -| | -|-------------------------------------------------------------------------------------------------------------------------| -| NOTE 1 – In case of [IEEE 1588-2019] based implementations this data set member is deprecated. | -| NOTE 2 – Applicable to [IEEE 1588-2019] based implementations; this data set member does not exist in [IEEE 1588-2008]. | -| NOTE 3 – If a default value is not provided by this Recommendation, then it is implementation specific. | - -**Table A.3 – parentDS data set member specifications** - -| Clause from [IEEE 1588-2008] | Clause from [IEEE 1588-2019] | Members of the data set | Telecom grandmaster requirements | | Telecom time slave clock requirements | | Telecom boundary clock requirements | | -|------------------------------|------------------------------|----------------------------------------------------------|---------------------------------------|------------|---------------------------------------|------------|---------------------------------------|------------| -| | | | Default initialization value (Note 2) | Range | Default initialization value (Note 2) | Range | Default initialization value (Note 2) | Range | -| 8.2.3.2 | 8.2.3.2 | parentDS.parentPortIdentity (dynamic) | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | -| 8.2.3.3 | 8.2.3.3 | parentDS.parentStats (dynamic) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | -| 8.2.3.4 | 8.2.3.4 | parentDS.observedParentOffsetScaledLogVariance (dynamic) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | - -**Table A.3 – parentDS data set member specifications** - -| Clause from [IEEE 1588-2008] | Clause from [IEEE 1588-2019] | Members of the data set | Telecom grandmaster requirements | | Telecom time slave clock requirements | | Telecom boundary clock requirements | | -|------------------------------|------------------------------|-------------------------------------------------------|---------------------------------------|------------|---------------------------------------|------------|---------------------------------------|------------| -| | | | Default initialization value (Note 2) | Range | Default initialization value (Note 2) | Range | Default initialization value (Note 2) | Range | -| 8.2.3.5 | 8.2.3.5 | parentDS.observedParentClockPhaseChangeRate (dynamic) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | (Note) | (Note 1) | -| 8.2.3.6 | 8.2.3.6 | parentDS.grandmasterIdentity (dynamic) | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | -| 8.2.3.7 | 8.2.3.7 | parentDS.grandmasterClockQuality (dynamic) | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | -| 8.2.3.8 | 8.2.3.8 | parentDS.grandmasterPriority1 (dynamic) | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | -| 8.2.3.9 | 8.2.3.9 | parentDS.grandmasterPriority2 (dynamic) | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | - -NOTE 1 – It is not used in this profile, and therefore equipment is not required to support it. -NOTE 2 – If a default value is not provided by this Recommendation, then it is implementation specific. - -**Table A.4 – timePropertiesDS data set member specifications** - -| Clause from [IEEE 1588-2008] | Clause from [IEEE 1588-2019] | Members of the data set | Telecom grandmaster requirements | | Telecom time slave clock requirements | | Telecom boundary clock requirements | | -|------------------------------|------------------------------|--------------------------------------------------|---------------------------------------|---------------|---------------------------------------|---------------|---------------------------------------|---------------| -| | | | Default initialization value (Note 2) | Range | Default initialization value (Note 2) | Range | Default initialization value (Note 2) | Range | -| 8.2.4.2 | 8.2.4.2 | timePropertiesDS.currentUtcOffset (dynamic) | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | -| 8.2.4.3 | 8.2.4.3 | timePropertiesDS.currentUtcOffsetValid (dynamic) | FALSE | {FALSE, TRUE} | FALSE | {FALSE, TRUE} | FALSE | {FALSE, TRUE} | -| 8.2.4.4 | 8.2.4.4 | timePropertiesDS.leap59 (dynamic) | FALSE | {FALSE, TRUE} | FALSE | {FALSE, TRUE} | FALSE | {FALSE, TRUE} | -| 8.2.4.5 | 8.2.4.5 | timePropertiesDS.leap61 (dynamic) | FALSE | {FALSE, TRUE} | FALSE | {FALSE, TRUE} | FALSE | {FALSE, TRUE} | -| 8.2.4.6 | 8.2.4.6 | timePropertiesDS.timeTraceable (dynamic) | FALSE | {FALSE, TRUE} | FALSE | {FALSE, TRUE} | FALSE | {FALSE, TRUE} | - -**Table A.4 – timePropertiesDS data set member specifications** - -| Clause from [IEEE 1588-2008] | Clause from [IEEE 1588-2019] | Members of the data set | Telecom grandmaster requirements | | Telecom time slave clock requirements | | Telecom boundary clock requirements | | -|------------------------------|------------------------------|-----------------------------------------------|---------------------------------------|------------------------|---------------------------------------|------------------------|---------------------------------------|------------------------| -| | | | Default initialization value (Note 2) | Range | Default initialization value (Note 2) | Range | Default initialization value (Note 2) | Range | -| 8.2.4.7 | 8.2.4.7 | timePropertiesDS.frequencyTraceable (dynamic) | FALSE | {FALSE, TRUE} (Note 1) | FALSE | {FALSE, TRUE} (Note 1) | FALSE | {FALSE, TRUE} (Note 1) | -| 8.2.4.8 | 8.2.4.8 | timePropertiesDS.ptpTimescale (dynamic) | TRUE | {TRUE} | TRUE | {TRUE} | TRUE | {TRUE} | -| 8.2.4.9 | 8.2.4.9 | timePropertiesDS.timeSource (dynamic) | 0xA0 | As per PTP | 0xA0 | As per PTP | 0xA0 | As per PTP | - -NOTE 1 – Refer to clause 6.4 for details on when each value applies. -NOTE 2 – If a default value is not provided by this Recommendation, then it is implementation specific. - -**Table A.5 – portDS data set member specifications** - -| [IEEE 1588-2008] | | [IEEE 1588-2019] | | Members of the data set | Master port requirements of telecom grandmaster | | Slave port requirements of telecom time slave clock | | Telecom boundary clock requirements | | -|------------------|------------|------------------|------------|-----------------------------------------------------|-------------------------------------------------|---------------------------------|-----------------------------------------------------|------------|---------------------------------------|------------| -| Clause | Data type | Clause | Data type | | Default initialization value (Note 7) | Range | Default initialization value (Note 7) | Range | Default initialization value (Note 7) | Range | -| 8.2.5.2.1 | As per PTP | 8.2.15.2.1 | As per PTP | portDS.portIdentity.clockIdentity (static) (Note 3) | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | -| 8.2.5.2.1 | As per PTP | 8.2.15.2.1 | As per PTP | portDS.portIdentity.portNumber (static) (Note 3) | 1 for OC
As per PTP for BC | {1} for OC
As per PTP for BC | 1 | {1} | As per PTP | As per PTP | -| 8.2.5.3.1 | As per PTP | 8.2.15.3.1 | As per PTP | portDS.portState (dynamic) | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | -| 8.2.5.3.2 | As per PTP | 8.2.15.3.2 | As per PTP | portDS.logMinDelayReqInterval (dynamic) (Note 3) | -4 | {-4} | -4 | {-4} | -4 | {-4} | - -**Table A.5 – portDS data set member specifications** - -| [IEEE 1588-2008] | | [IEEE 1588-2019] | | Members of the data set | Master port requirements of telecom grandmaster | | Slave port requirements of telecom time slave clock | | Telecom boundary clock requirements | | -|------------------|------------|------------------|------------|---------------------------------------------------|-------------------------------------------------|---------------------|-----------------------------------------------------|---------------------|---------------------------------------|---------------------| -| Clause | Data type | Clause | Data type | | Default initialization value (Note 7) | Range | Default initialization value (Note 7) | Range | Default initialization value (Note 7) | Range | -| 8.2.5.3.3 | As per PTP | (Note 4) | (Note 4) | portDS.peerMeanPathDelay (dynamic) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | -| (Note 5) | (Note 5) | 8.2.15.3.3 | As per PTP | portDS.meanLinkDelay | (Note 1) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | -| 8.2.5.4.1 | As per PTP | 8.2.15.4.1 | As per PTP | portDS.logAnnounceInterval (configurable) | -3 | {-3} | -3 (Note 2) | {-3} (Note 2) | -3 | {-3} | -| 8.2.5.4.2 | As per PTP | 8.2.15.4.2 | As per PTP | portDS.announceReceiptTimeout (configurable) | 3 | {3 - z}
z is FFS | 3 | {3 - z}
z is FFS | 3 | {3 - z}
z is FFS | -| 8.2.5.4.3 | As per PTP | 8.2.15.4.3 | As per PTP | portDS.logSyncInterval (configurable) | -4 | {-4} | -4 (Note 2) | {-4} (Note 2) | -4 | {-4} | -| 8.2.5.4.4 | As per PTP | 8.2.15.4.4 | As per PTP | portDS.delayMechanism (configurable) | 01 | {01} | 01 | {01} | 01 | {01} | -| 8.2.5.4.5 | As per PTP | 8.2.15.4.5 | As per PTP | portDS.logMinPdelayReqInterval (configurable) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | -| 8.2.5.4.6 | As per PTP | 8.2.15.4.6 | As per PTP | portDS.versionNumber (configurable) | 2 | {2} | 2 | {2} | 2 | {2} | -| (Note 5) | (Note 5) | 8.2.15.4.7 | As per PTP | portDS.minorVersionNumber (configurable) (Note 3) | 1 | {1} | 1 | {1} | 1 | {1} | -| (Note 5) | (Note 5) | 8.2.15.4.8 | As per PTP | portDS.delayAsymmetry (configurable) (Note 3) | NA | NA | As per PTP | As per PTP | As per PTP | As per PTP | -| New member | Boolean | 9.2.2.2 | As per PTP | portDS.masterOnly (configurable) (Note 6) | TRUE | {TRUE, FALSE} | FALSE | {FALSE} | TRUE | {TRUE, FALSE} | -| New member | UInteger8 | New member | UInteger8 | portDS.localPriority (configurable) | 128 | {1-255} | 128 | {1-255} | 128 | {1-255} | -| New member | UInteger16 | New member | UInteger16 | portDS.syncReceiptTimeout (configurable) | NA | NA | FFS | FFS | FFS | FFS | - -**Table A.5 – portDS data set member specifications** - -| [IEEE 1588-2008] | | [IEEE 1588-2019] | | Members of the data set | Master port requirements of telecom grandmaster | | Slave port requirements of telecom time slave clock | | Telecom boundary clock requirements | | -|------------------|------------|------------------|------------|-----------------------------------------------|-------------------------------------------------|---------------|-----------------------------------------------------|---------------|---------------------------------------|---------------| -| Clause | Data type | Clause | Data type | | Default initialization value (Note 7) | Range | Default initialization value (Note 7) | Range | Default initialization value (Note 7) | Range | -| New member | UInteger16 | New member | UInteger16 | portDS.delayRespReceiptTimeout (configurable) | NA | NA | FFS | FFS | FFS | FFS | -| New member | Boolean | New member | Boolean | portDS.SF (dynamic) | FALSE | {FALSE} | FALSE | {TRUE, FALSE} | FALSE | {TRUE, FALSE} | -| New member | Boolean | New member | Boolean | portDS.notMaster (configurable) (Note 6) | FALSE | {TRUE, FALSE} | FALSE | {TRUE, FALSE} | FALSE | {TRUE, FALSE} | -| New member | Boolean | New member | Boolean | portDS.monitorSender (configurable) | FALSE | {TRUE, FALSE} | FALSE | {TRUE, FALSE} | FALSE | {TRUE, FALSE} | -| New member | Boolean | New member | Boolean | portDS.monitorReceiver (configurable) | FALSE | {TRUE, FALSE} | FALSE | {TRUE, FALSE} | FALSE | {TRUE, FALSE} | - -NOTE 1 – It is not used in this profile, and therefore equipment is not required to support it. -NOTE 2 – This type of message is not sent by a slave-only OC. -NOTE 3 – Applicable also to T-TC in case of an [IEEE 1588-2019] based implementation. -NOTE 4 – In case of [IEEE 1588-2019] based implementations this data set member is deprecated. -NOTE 5 – Applicable to [IEEE 1588-2019] based implementations; this data set member does not exist in [IEEE 1588-2008]. -NOTE 6 – Setting both portDS.masterOnly and portDS.notMaster with value TRUE concurrently is not permitted. -NOTE 7 – If a default value is not provided by this Recommendation, then it is implementation specific. - -**Table A.6 – transparentClockDefaultDS data set member specifications** - -| Clause from [IEEE 1588-2008] | Members of the data set | Telecom transparent clock requirements | | -|------------------------------|---------------------------------------------------------|----------------------------------------|-------------------| -| | | Default initialization value (Note) | Range | -| 8.3.2.2.1 | transparentClockDefaultDS.clockIdentity (static) | As per PTP | As per PTP | -| 8.3.2.2.2 | transparentClockDefaultDS.numberPorts (dynamic) | As per PTP for TC | As per PTP for TC | -| 8.3.2.3.1 | transparentClockDefaultDS.delayMechanism (configurable) | 01 | {01} | -| 8.3.2.3.2 | transparentClockDefaultDS.primaryDomain (configurable) | 24 | {24-43} | - -NOTE – If a default value is not provided by this Recommendation, then it is implementation specific. - -NOTE – According to [IEEE 1588-2019], the transparent clock data set members used in [IEEE 1588-2008] are deprecated. The relevant dataset members of a PTP instance should apply instead (see Tables A.1 and A.5). - -**Table A.7 – transparentClockPortDS data set member specifications** - -| Clause from [IEEE 1588-2008] | Members of the data set | Telecom transparent clock requirements | | -|------------------------------|----------------------------------------------------------|----------------------------------------|---------------| -| | | Default initialization value (Note 2) | Range | -| 8.3.3.2.1 | transparentClockPortDS.portIdentity (static) | As per PTP | As per PTP | -| 8.3.3.3.1 | transparentClockPortDS.logMinPdelayReqInterval (dynamic) | (Note 1) | (Note 1) | -| 8.3.3.3.2 | transparentClockPortDS.faultyFlag (dynamic) | FALSE | {FALSE, TRUE} | -| 8.3.3.3.3 | transparentClockPortDS.peerMeanPathDelay (dynamic) | (Note 1) | (Note 1) | - -NOTE 1 – It is not used in this profile, and therefore equipment is not required to support it. -NOTE 2 – If a default value is not provided by this Recommendation, then it is implementation specific - -NOTE – According to [IEEE 1588-2019], the transparent clock data set members used in [IEEE 1588-2008] are deprecated. The relevant dataset members of a PTP instance should apply instead (see Tables A.1 and A.5). - -### A.3 PTP options - -#### A.3.1 Node types required, permitted, or prohibited - -In this profile, the permitted node types are: ordinary clocks, boundary clocks and end-to-end transparent clocks. - -In this profile, the prohibited node types are: peer-to-peer transparent clocks. - -#### A.3.2 One-step versus two-step clock mode - -Both one-step and two-step clocks are permitted. A clock must be capable of receiving and handling messages transmitted from both one-step and two-step clocks. A clock is not required to support both one-step and two-step mode for transmitting messages. - -#### A.3.3 Transport mechanisms required, permitted, or prohibited - -In this profile, the allowed transport mechanisms are: - -- a) IEEE 802.3/Ethernet, as per Annex F of [IEEE 1588-2008] or Annex E of [IEEE 1588-2019]; -- b) OTN via: (i) GFP-F encapsulation as per [ITU-T G.704], and insertion of the GFP-F frames into the OTUk OSMC as per clause 15.7.2.4 of [ITU-T G.709] or into the FlexO OSMC as per clause 9.2.10.1 of [ITU-T G.709.1], or (ii) the OSC OSMC as per clause 14.1 of [ITU-T G.709], where in this case the encapsulation is vendor-specific; -- c) MTN, with PTP in Ethernet frames transported per clause 9.2.5 of [ITU-T G.832]; -- d) FlexE links, with PTP in Ethernet frames transported per clause 7.3.5 of [OIF FlexE IA]. - -At least one of the four transport mechanisms must be supported. For transport over IEEE 802.3/Ethernet, both the non-forwardable multicast address, 01-80-C2-00-00-0E, and the forwardable multicast address, 01-1B-19-00-00-00, are required to be supported for compliance with this profile. - -All other transport mechanisms are for further study within the scope of this profile. - -#### A.3.4 Unicast messages - -All messages are sent multicast, using one of the two multicast addresses in clause A.3.3. The unicast mode is not permitted in this version of the profile. - -### **A.4 Best master clock algorithm options** - -This profile uses the Alternate BMCA described in clause 6.3. - -### **A.5 Path delay measurement option (delay request/delay response)** - -The delay request/delay response mechanism is used in this profile. The peer delay mechanism must not be used in this profile. - -### **A.6 Clock identity format** - -For implementations based on [IEEE 1588-2008], the procedures to use an EUI-48 to create the EUI-64 clockIdentity as described in clause 7.5.2.2.2 of [IEEE 1588-2008] are no longer recommended. If a clockIdentity is formed by mapping an EUI-48 to an EUI-64, and if the EUI-48 was assigned from an MA-M or MA-S, it is possible that the clockIdentity will be a duplicate of a clockIdentity formed directly from a different MA-M or MA-S (i.e., by appending bits to the end of that different MA-M or MA-S). Only if the EUI-48 was formed from an OUI (MA-L), is the uniqueness ensured. For new implementations based on [IEEE 1588-2019], the clockIdentity shall be constructed as per clause 7.5.2.2.2 of [IEEE 1588-2019]. Non-IEEE clockIdentity formats are not supported. - -For implementations based on [IEEE 1588-2019], the clockIdentity shall be constructed as per clause 7.5.2.2.2 of [IEEE 1588-2019]. - -### **A.7 Configuration management options** - -Management aspects are for further study and will be specified in a future version of this profile. - -### **A.8 Security aspects** - -Security aspects are for further study. - -### **A.9 Other optional features of IEEE 1588** - -Other optional features of [IEEE 1588] are not used in this version of the profile. - -For implementations based on [IEEE 1588-2008] these include unicast message negotiation (clause 16.1 of [IEEE 1588-2008]), alternate timescales (clause 16.3 of [IEEE 1588-2008]), grandmaster clusters (clause 17.3 of [IEEE 1588-2008]), unicast discovery (clause 17.5 of [IEEE 1588-2008]), acceptable master table (clause 17.6 of [IEEE 1588-2008]), and the experimental cumulative frequency scale factor offset (Annex L of [IEEE 1588-2008]). - -For implementations based on [IEEE 1588-2019] these include unicast message negotiation (clause 16.1 of [IEEE 1588-2019]), alternate timescale offsets (clause 16.3 of [IEEE 1588-2019]), grandmaster clusters (clause 17.2 of [IEEE 1588-2019]), unicast discovery (clause 17.4 of [IEEE 1588-2019]), acceptable master table (clause 17.5 of [IEEE 1588-2019]), and the Cumulative frequency transfer method for synchronizing clocks (clause 16.10 of [IEEE 1588-2019]). - -Some aspects of the optional feature of alternate master are used by optional Annexes G and K of this Recommendation. - -### **A.10 PTP common header flags** - -The PTP common header flag values, and whether or not each flag is used in this profile, are given in Table A.8. - -NOTE – Some of these flags are used only in certain PTP messages, and not in all the PTP messages, see [IEEE 1588-2008] clause 13.3.2.6 or [IEEE 1588-2019] clause 13.3.2.8. - -For implementations based on [IEEE 1588-2008] the following rule defined in [IEEE 1588-2008] clause 13.3.2.6, must be respected: "For message types where the bit is not defined in Table 20, the values shall be FALSE." - -For implementations based on [IEEE 1588-2019] the following rule defined in [IEEE 1588-2019] clause 13.3.2.8, must be respected: "For message types where the bit is not defined in Table 37, the values shall be FALSE." - -**Table A.8 – PTP flags** - -| Octet | Bit | Flag | Value to be sent | Behaviour for the receiving node | -|-------|-----|------------------------|---------------------|-------------------------------------| -| 0 | 0 | alternateMasterFlag | FALSE | As per PTP | -| 0 | 1 | twoStepFlag | As per PTP | Used | -| 0 | 2 | unicastFlag | FALSE | Flag is ignored | -| 0 | 5 | PTP profile Specific 1 | FALSE | Flag is ignored | -| 0 | 6 | PTP profile Specific 2 | FALSE | Flag is ignored | -| 0 | 7 | Reserved | FALSE | Reserved by PTP and flag is ignored | -| 1 | 0 | leap61 | As per PTP (Note 2) | Used | -| 1 | 1 | leap59 | As per PTP (Note 2) | Used | -| 1 | 2 | currentUtcOffsetValid | As per PTP (Note 3) | Used (Notes 3, 4, 5, 6) | -| 1 | 3 | ptpTimescale | TRUE | Used | -| 1 | 4 | timeTraceable | See Table 3 | Used | -| 1 | 5 | frequencyTraceable | See Table 3 | Used | -| 1 | 6 | (Note 1) | (Note 1) | (Note 1) | - -NOTE 1 – An additional flag "synchronizationUncertain" has been defined in Annex E; the use of the "synchronizationUncertain" flag is optional. - -NOTE 2 – When a clock is in holdover, within holdover specification, the PTP clock may continue to advertise the last known leap second event. If there was no pending leap second event, then the PTP clock continues to advertise FALSE for the pending leap second fields (leap59 and leap61). If there was a pending leap second event, the PTP clock may choose either to advertise FALSE for the pending leap second fields immediately or to continue to advertise the leap second event. In the latter instance the PTP clock would clear the leap59 and leap61 second event field(s) and adjust the UTC offset field at the appropriate time based on its local PTP time (i.e., the local PTP time's UTC timescale rolling over at UTC midnight) if the PTP clock is still in holdover, within holdover specification. When a clock is in holdover, out of holdover specifications, the PTP clock behaviour with respect to leap second event is implementation specific. It is recommended that the PTP clock continue to advertise any upcoming leap second event as appropriate. - -NOTE 3 – When a clock is in holdover, within holdover specification, the PTP clock may continue to advertise the last known UTC offset with UTC offset valid TRUE. If the last known UTC offset valid was FALSE, then the PTP clock continues to advertise FALSE. If the last known UTC offset valid was TRUE then the PTP clock may choose either to advertise UTC offset valid FALSE immediately (freezing the UTC offset value) or to continue to advertise the last known UTC offset with UTC offset valid TRUE. The UTC offset field may be updated as described in Note 2 above. When a clock is in holdover, out of holdover specifications, the PTP clock behaviour with respect to UTC offset is implementation specific. - -NOTE 4 – Usage of currentUtcOffset from an Announce message, which indicates currentUtcOffsetValid as FALSE, may lead to wrong UTC time calculation. - -NOTE 5 – The alternate ABMCA in this profile does not consider or use currentUtcOffsetValid or currentUtcOffset. - -**Table A.8 – PTP flags** - -NOTE 6 – The PTP clocks in this profile do not use currentUtcOffsetValid or currentUtcOffset for phase/time synchronization. - -### A.11 Profile version compatibility - -A specific profile version may have backward compatibility with earlier versions of this profile. Table A.9 lists which earlier versions are compatible with each version. Compatibility means that the nodes can operate in the same network provided optional features in a specific profile that are not present in the earlier version are not enabled. - -**Table A.9 – profileVersion compatibility** - -| profileVersion | Base IEEE version | Compatible with the earlier profileVersions | -|----------------|-------------------|---------------------------------------------| -| 2.5 | [IEEE 1588-2019] | 2.4, 2.3, 2.2, 2.1, 2.0,
1.0 (Note) | -| 2.4 | [IEEE 1588-2008] | 2.2, 2.1, 2.0,
1.0 (Note) | -| 2.3 | [IEEE 1588-2019] | 2.2, 2.1, 2.0,
1.0 (Note) | -| 2.2 | [IEEE 1588-2008] | 2.1, 2.0,
1.0 (Note) | -| 2.1 | [IEEE 1588-2008] | 2.0,
1.0 (Note) | -| 2.0 | [IEEE 1588-2008] | 1.0 (Note) | -| 1.0 | [IEEE 1588-2008] | | - -NOTE – Version 1 of this profile enforced a limited range on acceptable values for clockClass, clockAccuracy, offsetScaledLogVariance and, for the T-TSC, priority2. Reception of values outside of the acceptable range caused the Announce message to be discarded. Version 2.x of the profile supports the full range of these attributes as defined by PTP. In networks deploying ePRTC, which use new values of clockAccuracy and offsetScaledLogVariance that are outside of the version 1 range, all clocks need to use version 2.x of the profile. If no ePRTC are to be deployed in the network, then the network can operate with a mixture of version 1 and version 2.x clocks. - -## **Annex B** - -## **Options to establish the PTP topology with the Alternate BMCA** - -(This annex forms an integral part of this Recommendation.) - -Options to establish the PTP topology with the Alternate BMCA are described in Annex C of [ITU-T G.8275]. - -## **Annex C** - -## **Inclusion of an external phase/time input interface in a T-BC** - -(This annex forms an integral part of this Recommendation.) - -The model for inclusion of a unidirectional, external phase/time interface on a PTP clock is provided in Annex B of [ITU-T G.8275]. - -## Annex D - -## Path trace (optional) - -(This annex forms an integral part of this Recommendation.) - -In order to track the actual path of the PTP synchronization reference in the network, the Path trace option as per clause 16.2 in [IEEE 1588] can be optionally supported by the PTP clock compliant with this profile. - -This feature is optional; however, if it is supported it is necessary that it be supported as described below. - -As an example, this option can be used to support troubleshooting analysis in case of failures in the network. - -It should be possible to configure a PTP clock so that the Path trace type length value (TLV) is not further forwarded by that clock (e.g., this could be required at the network administration interfaces). - -NOTE 1 – There might be cases when not all PTP clocks in the network support the Path trace TLV. The expected behaviour is that in the case of an incoming Announce message carrying the Path trace TLV, this TLV is dropped by these nodes. - -NOTE 2 – T-TCs in the path could add their own clockIdentity in the Path trace TLV. - -## **Annex E** - -## **Synchronization uncertain indication (optional)** - -(This annex forms an integral part of this Recommendation.) - -The synchronization uncertain indication is described in Annex D of [ITU-T G.8275]. - -## Annex F - -## Use of stepsRemoved to limit reference chain (optional) - -(This annex forms an integral part of this Recommendation.) - -The parameter stepsRemoved is defined in [IEEE 1588] is used to indicate the distance between a clock and the grandmaster clock in the network. It was originally intended to be used as a helpful tool to detect cyclic paths that may occur in PTP systems. By default, it is required that a clock not qualify any Announce messages where the stepsRemoved field is equal to, or greater than, 255 in order to ensure that rogue frames are extinguished. - -This profile includes a default dataset member, maxStepsRemoved, that allows the operator to configure the value to less than 255. The value configured is typically the same in all clocks in the PTP domain. When configured, a clock would not qualify any Announce messages received where the stepsRemoved field in the ingress header matched or exceeded the maxStepsRemoved field. There would be two primary use cases for this configurability. - -First, referring to [ITU-T G.8271.1] and [ITU-T G.8275] analysis has been performed to show that up to 20 clocks may be traversed between the grandmaster and slave while maintaining the proper network performance. If the operator wanted to ensure the network performance limit was not exceeded, or that the chain length was not exceeded, the operator may configure the value smaller (such as 20 or 21). - -Second, if the operator does deploy PTP in a ring topology, the operator may configure the maxStepsRemoved parameter to a smaller value so that the clocks may more quickly identify rogue frames and take corrective action to extinguish them and update the topology. - -## Annex G - -## Monitoring alternate master time information provided by a peer PTP port (optional) - -(This annex forms an integral part of this Recommendation.) - -This annex is optional but, if implemented, it is necessary for the equipment to conform to the requirements contained herein. - -A PTP clock must synchronize only to a PTP port of its parent clock that is in the MASTER state. The synchronization must be received on, and only on, the port of the PTP clock that is in the SLAVE state. However, in some instances it may be desirable for a PTP port to monitor a peer PTP port in a non-traditional situation, where the local PTP port is not in the SLAVE state and/or the peer PTP port is not in the MASTER state. - -The monitoring is enabled through the use of the portDS.monitorSender and portDS.monitorReceiver. When portDS.monitorSender is TRUE, and the portDS.portState is not MASTER, the PTP port sends Announce, Sync, Follow\_Up and Delay\_Resp messages with the alternateMasterFlag set to TRUE. When portDS.monitorReceiver is TRUE, and the portDS.portState is not SLAVE, the PTP port sends Delay\_Req messages with alternateMasterFlag set to FALSE. These messages may allow a PTP port to acquire knowledge of the characteristics of the transmission path. Some examples of use cases where a PTP port may want to acquire knowledge of the characteristics of the transmission path are included in the next sub-clauses. - -The monitoring feature uses some of the functionality of alternate master (clause 17.4 of [IEEE 1588-2008], clause 17.3 of [IEEE 1588-2019]), limited to the ability to transmit and process PTP messages in the PTP port states as described above, with the alternateMasterFlag set as appropriate. - -The following table captures various combinations of Port A and Port B states showing when Port A is able to monitor Port B. Some combinations may occur due to the use of masterOnly, notMaster, slaveOnly or some other means to override the default behaviour. - -**Table G.1 – Combination of PTP port states with monitoring** - -| Port A State | Port B State | Port A monitoring of Port B is supported when | | -|--------------|--------------|------------------------------------------------|----------------------------------------------| -| | | Port A configuration of portDS.monitorReceiver | Port B configuration of portDS.monitorSender | -| SLAVE | MASTER | (NOTE 1) | (NOTE 2) | -| PASSIVE | MASTER | TRUE | (NOTE 2) | -| MASTER | SLAVE | TRUE | TRUE | -| MASTER | PASSIVE | TRUE | TRUE | -| MASTER | MASTER | TRUE | (NOTE 2) | - -NOTE 1 – The configuration of portDS.monitorReceiver does not impact the operation of a PTP port in the SLAVE state (i.e., is not required to be TRUE). -NOTE 2 – The configuration of portDS.monitorSender does not impact the operation on a PTP port in the MASTER state (i.e., is not required to be TRUE). - -NOTE – Table G.1 lists the most typical combinations of PTP port states. The monitoring function described in this annex also applies to other combinations. - -### G.1 Use case 1 – PASSIVE port monitoring MASTER port - -Figure G.1 shows an example to illustrate where a PTP clock with a PTP port in the PASSIVE state (portDS.monitorReceiver is TRUE) monitors a peer PTP port in the MASTER state. As shown below, T-BC #4 has a PTP port in the PASSIVE state and it is desirable to monitor T-BC #2 that has a PTP port in the MASTER state. When the T-BC #4 PTP PASSIVE port receives the Sync and Delay\_Resp message from the T-BC #2 PTP MASTER port, the T-BC #4 can get the time error based on PTP timestamps. If the difference of the time error of PASSIVE port and the time error of SLAVE port exceeds a threshold, this PTP clock may generate an alarm, which means that a fibre asymmetric, or a clock failure could be present in this PTP network. Note this alarm is just used for PTP monitoring and should not trigger the BMCA. Additionally, the threshold used for this alarm should be properly configured to avoid inappropriate alarms. - -![Diagram illustrating Use case 1: PASSIVE port monitoring MASTER port. A PTP network (MASTER) is connected to T-BC #1. T-BC #1 has Port 1 (SLAVE), Port 3 (MASTER), and Port 4 (MASTER). Port 4 (MASTER) is connected to T-BC #2. T-BC #2 has Port 2 (SLAVE) and Port 3 (MASTER). Port 3 (MASTER) is connected to T-BC #3. T-BC #3 has Port 1 (SLAVE) and Port 4 (MASTER). Port 4 (MASTER) is connected to T-BC #4. T-BC #4 has Port 1 (PASSIVE) and Port 2 (SLAVE). A dashed arrow indicates monitoring from T-BC #4 Port 1 (PASSIVE) to T-BC #2 Port 3 (MASTER).](60ffbad6c0fb7371a57fe8f267d2d141_img.jpg) - -The diagram shows a hierarchy of PTP clocks. At the top is a cloud labeled 'PTP network (MASTER)'. Below it is T-BC #1, which has three ports: Port 1 (SLAVE), Port 3 (MASTER), and Port 4 (MASTER). Port 4 (MASTER) is connected to T-BC #2. T-BC #2 has two ports: Port 2 (SLAVE) and Port 3 (MASTER). Port 3 (MASTER) is connected to T-BC #3. T-BC #3 has two ports: Port 1 (SLAVE) and Port 4 (MASTER). Port 4 (MASTER) is connected to T-BC #4. T-BC #4 has two ports: Port 1 (PASSIVE) and Port 2 (SLAVE). A dashed arrow points from T-BC #4 Port 1 (PASSIVE) to T-BC #2 Port 3 (MASTER), indicating the monitoring path. The text 'G.8275.1-Y.1369.1(22)\_FG.1' is at the bottom right. - -Diagram illustrating Use case 1: PASSIVE port monitoring MASTER port. A PTP network (MASTER) is connected to T-BC #1. T-BC #1 has Port 1 (SLAVE), Port 3 (MASTER), and Port 4 (MASTER). Port 4 (MASTER) is connected to T-BC #2. T-BC #2 has Port 2 (SLAVE) and Port 3 (MASTER). Port 3 (MASTER) is connected to T-BC #3. T-BC #3 has Port 1 (SLAVE) and Port 4 (MASTER). Port 4 (MASTER) is connected to T-BC #4. T-BC #4 has Port 1 (PASSIVE) and Port 2 (SLAVE). A dashed arrow indicates monitoring from T-BC #4 Port 1 (PASSIVE) to T-BC #2 Port 3 (MASTER). - -Figure G.1 – PASSIVE port monitors MASTER port - -### G.2 Use case 2 – MASTER port monitoring PASSIVE port - -Figure G.2 shows an example to illustrate where a PTP clock with a PTP port in the MASTER state (portDS.monitorReceiver is TRUE) monitors a peer PTP port in the PASSIVE state (portDS.monitorSender is TRUE). In the situation shown, Port 2 could be a PTP port or a virtual PTP port in the SLAVE state preferring to synchronize to the local GNSS receiver. Port 1 in the MASTER state is used for monitoring of the PTP network, and through the monitoring function, the PTP clock is able to measure the time error on the PTP network. - -Note that in Figure G.2 it is assumed that the PTP Clock Port 1 is in the MASTER state and the peer port in the PTP network is in the PASSIVE state, but that the opposite may also occur (where Port 1 is PASSIVE and the peer port in the PTP Network is MASTER, which is described in clause G.1) depending on the network planning and the BMCA. - -![Diagram of a PTP clock with Port 1 (MASTER) connected to a passive PTP network and Port 2 (SLAVE) connected to a PRTC.](0a42e05c07941450f34e4f7117725834_img.jpg) - -The diagram shows a rectangular box labeled "PTP clock" at the bottom. Inside the box, there are two ports: "Port 1 (MASTER)" on the left and "Port 2 (SLAVE)" on the right. Above Port 1, an arrow points up to a cloud labeled "PTP network (PASSIVE)". Above Port 2, an arrow points down from a rectangle labeled "PRTC". Below the ports, the text "PTP clock" is written. At the bottom right of the diagram, the text "G.827.5.1-Y.1369.1(22)\_FG.2" is present. - -Diagram of a PTP clock with Port 1 (MASTER) connected to a passive PTP network and Port 2 (SLAVE) connected to a PRTC. - -**Figure G.2 – MASTER port monitors PASSIVE port** - -### G.3 Use Case 3 – MASTER port monitoring MASTER port - -Figure G.3 shows a use case where a PTP probe may monitor information from a PTP clock. Additionally, the PTP clock may likewise monitor information from the PTP probe. Considering a PTP probe working as a monitor function instead of a PTP reference, it is assumed that the PTP clock Port 2 is configured with portDS.masterOnly TRUE in order to prevent the PTP probe from being selected by the BMCA of the PTP clock. To allow the PTP probe to monitor the PTP clock, the port of the PTP probe is configured with portDS.monitorReceiver TRUE. To allow the PTP clock to monitor the PTP probe, Port 2 of PTP clock is configured with portDS.monitorReceiver TRUE. Once both are configured as described there may be a full exchange of information between the PTP probe and the PTP clock. As a result, the PTP probe may full characterize/probe the PTP clock (receiving Sync & Delay\_Resp), but also the PTP clock may gain the full knowledge of the PTP probe, by reception of Sync & Delay\_Resp from the PTP probe. - -Note, for some use cases, it may be only necessary to monitor the timing of one direction but not both, e.g., a PTP probe monitors a PTP clock, or a PTP clock monitors a PTP probe to estimate its accuracy. - -![Diagram of a PTP clock with Port 1 (SLAVE) connected to a master PTP network and Port 2 (MASTER) connected to a master PTP probe.](b44f89b176c971c7dd264c07bfef2c2a_img.jpg) - -The diagram shows a rectangular box labeled "PTP clock" at the bottom. Inside the box, there are two ports: "Port 1 (SLAVE)" on the left and "Port 2 (MASTER)" on the right. Above Port 1, an arrow points down from a cloud labeled "PTP network (MASTER)". Above Port 2, an arrow points down from a rectangle labeled "PTP probe (MASTER)". Below the ports, the text "PTP clock" is written. At the bottom right of the diagram, the text "G.827.5.1-Y.1369.1(22)\_FG.3" is present. - -Diagram of a PTP clock with Port 1 (SLAVE) connected to a master PTP network and Port 2 (MASTER) connected to a master PTP probe. - -**Figure G.3 – MASTER port monitors MASTER port** - -## Annex H - -## Transport of PTP over OTN - -(This annex forms an integral part of this Recommendation.) - -The transport of PTP over OTN shall be performed by encapsulating the PTP messages into GFP-F frames as specified in clause 7.10 of [ITU-T G.704], and then inserting the GFP-F frames into the OTUk OSMC as specified in clause 15.7.2.4 of [ITU-T G.709] and the FlexO OSMC as specified in clause 9.2.10 of [ITU-T G.709.1]. - -The PTP messages shall be timestamped as specified in clause 15.7.2.4.1 of [ITU-T G.709] and in clause 9.2.10.1 of [ITU-T G.709.1]. - -PTP messages may also be carried over the OSC OSMC as specified in clause 14.1 of [ITU-T G.709]. The PTP encapsulation in this latter case is vendor specific. - -All bits of the transportSpecific field (see clause 13.3.2.1 of (IEEE 1588-2008)) shall be transmitted as zero and shall be ignored by the receiver. - -The value of the networkProtocol enumeration for the transport of PTP over OTN shall be F000 (hex). - -## **Annex I** - -## **Transport PTP over MTN** - -(This annex forms an integral part of this Recommendation.) - -The transport of PTP over MTN is performed by encapsulating PTP messages into Ethernet frames that are transported by the MTN overhead per Clause 9.2.5 of [ITU-T G.8312]. The PTP event messages are timestamped. The timestamp generation is for further study. - -The value of the networkProtocol enumeration for the transport of PTP over MTN is F001 (hex). - -## **Annex J** - -## **Transport PTP over FlexE links** - -(This annex forms an integral part of this Recommendation.) - -The transport of PTP over FlexE shall be performed by encapsulating PTP messages into Ethernet frames that are transported by the FlexE overhead per clause 7.3.5 of [OIF FlexE IA]. The PTP event messages shall be timestamped as per clause 7.3.5 of [OIF FlexE IA]. - -The value of the networkProtocol enumeration for the transport of PTP over FlexE shall be F002 (hex). - -## Annex K - -## Dynamic Monitoring based on PTSF (Optional) - -(This annex forms an integral part of this Recommendation.) - -This annex is optional but, if implemented, it is necessary for the equipment to conform to the requirements contained herein. - -This annex describes an approach to dynamic monitoring of a neighbour PTP port by a PTP port with local PTSF. When this annex is implemented, a PTP port is additionally permitted to transmit Delay\_Req messages and process received Delay\_Resp messages irrespective of the PTP port state based on the PTSF status, as described below. The PTSF function is specified by clause 6.3.9. - -When a PTSF event has occurred at a PTP port of a PTP clock, the PTP clock may set portDS.SF to TRUE according to clause 6.3.9. Upon the change of portDS.SF to TRUE, even if the PTP port state is not in the SLAVE state, the PTP port is allowed to send Delay\_Req message and receive Delay\_Resp messages. This functionality allows the local PTP port to update the PTSF status. If it is verified that the PTSF has cleared, portDS.SF of the PTP port is set to FALSE. As a result, the PTP port is considered as a candidate reference with normal handling of PTP messages. - -The monitoring feature uses some of the functionality of alternate master (clause 17.4 of [IEEE 1588-2008], clause 17.3 of [IEEE 1588-2019]), limited to the ability to transmit and processes PTP messages in the PTP port states as described above, with the alternateMasterFlag set as appropriate. - -An example for the case of T-BC is shown by Figure K.1. - -![Diagram illustrating an example of PTSF restoration. T-BC #1 (bottom) has Port 1 (MASTER) and Port 2 (SLAVE). Port 1 is connected to Port 1 (MASTER) of T-BC #2 (top left) and Port 1 (MASTER) of T-BC #3 (top right). The diagram shows Port 1 of T-BC #1 in the MASTER state, indicating restoration after a failure.](5c3dd31372f59e15250f0ab1613ca485_img.jpg) - -The diagram shows three Time Boundary Clocks (T-BCs): T-BC #1, T-BC #2, and T-BC #3. T-BC #1 is at the bottom and contains two ports: Port 1 (MASTER) and Port 2 (SLAVE). T-BC #2 is at the top left and contains Port 1 (MASTER). T-BC #3 is at the top right and contains Port 1 (MASTER). Arrows indicate connections from Port 1 of T-BC #2 and Port 1 of T-BC #3 to Port 1 of T-BC #1. A label 'G.8275.1-Y.1369.1(22)\_FK.1' is located at the bottom right of the diagram. - -Diagram illustrating an example of PTSF restoration. T-BC #1 (bottom) has Port 1 (MASTER) and Port 2 (SLAVE). Port 1 is connected to Port 1 (MASTER) of T-BC #2 (top left) and Port 1 (MASTER) of T-BC #3 (top right). The diagram shows Port 1 of T-BC #1 in the MASTER state, indicating restoration after a failure. - -Figure K.1 – An example of PTSF restoration - -In Figure K.1, Port 1 of T-BC #1 was previously in the SLAVE state synchronizing with Port 1 of T-BC #2. After a while, T-BC #1 detects a PTSF event at Port 1 and changes its portDS.SF to TRUE. According to clause 6.3.9, T-BC #1 runs its alternate BMCA, selects Port 1 of T-BC #3 as its new reference, and sets Port 2 to SLAVE, Port 1 to MASTER. - -In order to recover the PTSF failure of Port 1 of T-BC #1, that T-BC needs to continue to send messages towards T-BC#2 to detect when the SF condition is resolved. The event of portDS.SF with TRUE triggers Port 1 of T-BC #1 to continue to send Delay\_Req messages. Port 1 of T-BC #2 in MASTER is able to reply with Delay\_Resp messages. As a result, Port 1 of T-BC #1 will continue to receive Announce, Sync and Delay\_Resp messages in order to determine if the signal fail condition has been cleared. If the failure is cleared, T-BC #1 puts portDS.SF of Port 1 to FALSE and then Announce messages received on Port 1 of T-BC #1 can be considered in the alternate BMCA. - -## Appendix I - -### Considerations on the use of transparent clock - -(This appendix does not form an integral part of this Recommendation.) - -The integration of the transparent clock in this profile is considered of particular interest for applications such as 2-port type of devices. - -For more complex topologies and multiport devices some careful analysis is recommended. In particular, some specific node configuration may be required if the operator wants to prevent multicast packets flooding the network. - -Some options could be considered, e.g., by configuration of the T-TCs with insertion of a VLAN tag in the frames carrying PTP. In this case all T-TCs in the PTP communication path where this option is used should support this option. The last T-TC node would need to remove the VLAN tag. By using this option to connect the physical ports of the T-GM, T-BC, and T-TSCs through VLAN virtual connections across the T-TCs, the multicast flooding can be avoided. In this way the PTP port of a T-GM, T-BC or T-TSC would never process a VLAN tagged frame. - -The related operational implications would need to be carefully considered. - -## Appendix II - -### Considerations on the transmission of Delay\_Req messages - -(This appendix does not form an integral part of this Recommendation.) - -This appendix discusses the requirements defined in [IEEE 1588] for the transmission of *Delay\_Req* messages when using the default uniform distribution defined in bullet 3 of clause 9.5.11.2 of [IEEE 1588-2008] and bullet (1) of clause 9.5.11.2 of [IEEE 1588-2019]. This uniform distribution is not used in the PTP telecom profile defined in this Recommendation; a profile-specific distribution has been defined in clause 6.2.8. - -The second dashed item of the requirements defined in clause 9.5.11.2 of [IEEE 1588-2008] and bullet (b) of clause 9.5.11.2 of [IEEE 1588-2019] controls the variability of the times between successive *Delay\_Req* messages. It is analogous to the corresponding requirement for the sending of *Sync* and *Announce* messages, given in clause 7.7.2.1 of [IEEE 1588]. However, a key difference is that, while the requirement for *Sync* messages applies to the population of inter-message intervals, the requirement for *Delay\_Req* messages applies only to the mean of the population. - -To be more precise, assume that a population of $N$ inter-message intervals has been measured, and let $T_j$ be the measured values, $j = 1, 2, \dots, N$ . The sample mean, $m$ , is just the numerical average, i.e., - -$$m = \frac{1}{N} \sum_{j=1}^N T_j \quad (\text{II.1})$$ - -Let $T_{min}$ be the minimum *Delay Request* interval; it is equal to $2^{\text{portDS.logMinDelayReqInterval}}$ s. The second dashed item above states that the mean of the distribution must be greater than or equal to $T_{min}$ with 90% or greater statistical confidence. - -The statistical test for this is well-known and is based on the fact that the distribution of $m$ approaches a normal distribution as $N$ becomes large (i.e., it is based on the central limit theorem). Let $\sigma$ be the standard deviation of the distribution of the inter-message times, i.e., the distribution of the $T_j$ . Let $z_{0.90}$ be the 90th percentile of the standard normal distribution; it is given by $z_{0.90} = 1.281$ . Then, the probability that the true mean of the distribution exceeds the quantity - -$$q_{0.1} = m - z_{0.90} \sqrt{\frac{\sigma}{N}} \quad (\text{II.2})$$ - -is 0.9, i.e., 90%. The probability that the mean of the distribution is less than this value is 0.1. In addition, if $\sigma$ is not known, the sample standard deviation, $s$ , may be used in equation (II.2) and the Normal distribution is replaced by the Student- $t$ distribution with $N - 1$ degrees of freedom. The sample standard deviation is given by: - -$$s = \left[ \frac{1}{N-1} \sum_{j=1}^N (T_j - m)^2 \right]^{1/2} \quad (\text{II.3})$$ - -To meet the requirement, the quantity $q_{0.1}$ must exceed $T_{min}$ . It is seen from equation (II.2) that $q_{0.1}$ approaches $m$ as $N$ approaches infinity. Since $m$ converges to the mean of the distribution of inter-message times as $N$ approaches infinity, the requirement can be met for sufficiently large $N$ as long as the mean of the distribution exceeds $T_{min}$ . The mean of the distribution must exceed $T_{min}$ ; the requirement cannot be met if the mean of the distribution is exactly equal to $T_{min}$ or less than $T_{min}$ . - -If it is chosen to comply with the requirement of the third dashed item of clause 9.5.11.2 of [IEEE 1588-2008] or bullet (1) of clause 9.5.11.2 of [IEEE 1588-2019], one way of meeting this - -requirement is to increase the upper end of the probability distribution by 10%. If this is done, the transmission times are selected such that the interval between successive *Delay\_Req* messages is taken from a uniform distribution over the interval between 0 and $2.2T_{min}$ . A new random value for the transmission interval is computed for each message transmitted. When computing the mean *Delay\_Req* interval from measured samples to check if it exceeds $T_{min}$ with 90% or greater statistical confidence (if the third dashed item is used), the number of measured samples $N$ must be at least 1000. The granularity of the distribution must be less than or equal to 1/16 *Sync* interval. - -If it is chosen to meet the requirement of the fourth dashed item of clause 9.5.11.2 of [IEEE 1588] or bullet (2) of clause 9.5.11.2 of [IEEE 1588-2019], a *Delay\_Req* message is transmitted as soon as possible after receipt of a *Sync* message, subject to not violating the second dashed item. - -## Appendix III - -### Considerations on the choice of the PTP Ethernet multicast destination address - -(This appendix does not form an integral part of this Recommendation.) - -This PTP profile supports both the non-forwardable multicast address 01-80-C2-00-00-0E and forwardable multicast address 01-1B-19-00-00-00 when the PTP mapping defined in Annex F of [IEEE 1588-2008] or Annex E of [IEEE 1588-2019] is used. - -The Ethernet multicast address to be used depends on the operator policy; further considerations are provided hereafter. - -Layer 2 bridging function associated with the PTP port of a T-BC or T-TC should not forward any frame with destination MAC address 01-1B-19-00-00-00; this could be done by properly provisioning this multicast address in the filtering database. - -#### Option 1 – Use of the non-forwardable multicast address 01-80-C2-00-00-0E - -Some network operators consider that the PTP messages must never be forwarded through PTP-unaware network equipment. - -The use of the non-forwardable multicast address 01-80-C2-00-00-0E guarantees this property most of the time (exceptions exist for some older Ethernet equipment). - -Therefore, in the case of network equipment misconfiguration (e.g., if the PTP functions are not enabled in PTP-aware network equipment), the use of this multicast address prevents incorrect distribution of synchronization, since the PTP messages will be blocked by the PTP-unaware network equipment. - -#### Option 2 – Use of the forwardable multicast address 01-1B-19-00-00-00 - -Some network operators consider that using a forwardable multicast address is more flexible and that it is preferable to forward the PTP messages to keep the synchronization link running in case some equipment is misconfigured as non PTP nodes, although there are potentially risks of performance degradation. The network management system (NMS) will easily find the misconfiguration and will send alarms. - -However, it is possible to block the PTP messages by properly provisioning this multicast address in the filtering database of each Ethernet equipment. - -## Appendix IV - -### Considerations on the use of priority2 - -(This appendix does not form an integral part of this Recommendation.) - -The PTP attribute priority2 is configurable in this profile. In some special circumstances, the use of the priority2 attribute can simplify the network management. This appendix describes two use cases; other possible cases are for further study. - -#### Case 1 - -Operators can configure the PTP attribute priority2 to make all of the T-BCs either traceable to one T-GM, or traceable to two different T-GMs at the same time. - -![Diagram illustrating the use of priority2 with two T-GMs in the network. Two T-GMs (orange circles) are shown at the top. The left T-GM is connected to a T-BC (EEC) (orange circle) via a red square. The right T-GM is connected to another T-BC (EEC) (orange circle) via a red square. The two T-BCs (EECs) are connected to each other via a dashed line, with red squares on the connections. The diagram is labeled G.8275.1-Y.1369.1(14)_FIV.1.](21327313f7b18a481da0c87a6472a80d_img.jpg) - -G.8275.1-Y.1369.1(14)\_FIV.1 - -Diagram illustrating the use of priority2 with two T-GMs in the network. Two T-GMs (orange circles) are shown at the top. The left T-GM is connected to a T-BC (EEC) (orange circle) via a red square. The right T-GM is connected to another T-BC (EEC) (orange circle) via a red square. The two T-BCs (EECs) are connected to each other via a dashed line, with red squares on the connections. The diagram is labeled G.8275.1-Y.1369.1(14)\_FIV.1. - -Figure IV.1 – Use of priority2 with two T-GMs in the network - -For example, in Figure IV.1, if all other PTP attributes of the two T-GMs are the same, and the two T-GMs are configured with the same priority2 value, each T-BC will select the T-GM with the shortest path. If the two T-GMs are configured with different priority2 values, all of the T-BCs will synchronize to the T-GM with the smallest priority2 value. - -#### Case 2 - -Operators can configure the PTP attribute priority2 to prevent the T-BCs of an upstream network from synchronizing with the T-BCs of a downstream network when the T-GM is in failure. - -![Diagram illustrating the use of priority2 with T-BCs of different network layers. A T-GM (orange circle) is connected to a T-BC (EEC) (orange circle) via a red square. This T-BC is part of an 'Upstream network' (oval) containing three T-BCs (EECs) (orange circles) connected in a chain. The last T-BC in the upstream network is connected to a T-BC (EEC) (orange circle) via a red square. This T-BC is part of a 'Downstream network' (oval) containing three T-BCs (EECs) (orange circles) connected in a chain. The last T-BC in the downstream network is connected to a T-TSC (EEC) (orange circle) via a red square. The diagram is labeled G.8275.1-Y.1369.1(14)_FIV.2.](daf05db9f13b34fb12da52f007bbfe5b_img.jpg) - -G.8275.1-Y.1369.1(14)\_FIV.2 - -Diagram illustrating the use of priority2 with T-BCs of different network layers. A T-GM (orange circle) is connected to a T-BC (EEC) (orange circle) via a red square. This T-BC is part of an 'Upstream network' (oval) containing three T-BCs (EECs) (orange circles) connected in a chain. The last T-BC in the upstream network is connected to a T-BC (EEC) (orange circle) via a red square. This T-BC is part of a 'Downstream network' (oval) containing three T-BCs (EECs) (orange circles) connected in a chain. The last T-BC in the downstream network is connected to a T-TSC (EEC) (orange circle) via a red square. The diagram is labeled G.8275.1-Y.1369.1(14)\_FIV.2. - -Figure IV.2 – Use of priority2 with T-BCs of different network layers - -For example, in Figure IV.2, if all other PTP attributes of all of the T-BCs are the same, and the PTP attribute priority2 of all of T-BCs are configured with the same value, then when the T-GM is in failure, the T-BCs in the upstream network can synchronize with the T-BCs in the downstream network, depending on the clockIdentity values of all of the T-BCs. If the T-BCs in the upstream network are configured with a smaller priority2 value than the T-BCs in the downstream network then, when the T-GM is in failure, the T-BCs in the downstream network will synchronize to the T-BCs in the upstream network. - -## Appendix V - -### **Description of PTP clock modes and associated contents of Announce messages** - -(This appendix does not form an integral part of this Recommendation.) - -Description of PTP clock modes and associated contents of Announce messages are described in Appendix VIII of [ITU-T G.8275]. - -## Appendix VI - -### Operations over link aggregation - -(This appendix does not form an integral part of this Recommendation.) - -When two devices embedding PTP clocks compliant with this profile are connected via a link aggregation (LAG) as defined in [b-IEEE 802.1AX], each physical link should be accessed directly to transmit PTP messages, bypassing the LAG. This method prevents potential asymmetries that may be present when the forward and reverse paths are delivered over different links belonging to the LAG. - -Alternative solutions taking advantage of some LAG features exist, such as the bidirectional congruity as defined by [b-IEEE 802.1AX]. For the scenarios currently considered, the insertion of a VLAN tag in the frames carrying PTP messages is not allowed. However, the bidirectional congruity alternative solution can be applied to untagged PTP frames by assigning a conversation ID equal to zero to a given physical link. These solutions are for further study. - -## Appendix VII - -### Relationship between clockClass and holdover specification - -(This appendix does not form an integral part of this Recommendation.) - -The clockClass values that are used in this profile are described in Table 3. The values may be divided into four different categories: - -- 1) T-GM locked to a PRTC or ePRTC; -- 2) T-GM or T-BC in holdover, within holdover specification; -- 3) T-GM or T-BC in holdover, outside of holdover specification; -- 4) Slave clock, or clock that has not been synchronized. - -A short footnote (Note 1 of clause 6.4) refers to Appendix V of [ITU-T G.8271.1] for more information on the meaning of "in holdover, within holdover specification" and "in holdover, out of holdover specification". That appendix describes possible budget models for the synchronization performance. The exact model depends on the operator's network and design parameters, but each budget is broken down into several components: - -- 1) PRTC/T-GM allocation; -- 2) Random time error from noise accumulation through the network (dTE); -- 3) Node asymmetry (cTE, the sum of the asymmetry of all the nodes in the system); -- 4) Link asymmetry (cTE, the sum of the asymmetry of all the links in the system); -- 5) Holdover budget; -- 6) End application budget. - -Table V.1 of [ITU-T G.8271.1] shows that for one example budget, 400 ns may be allocated to holdover within the network (this is termed failure scenario (b) in the table). The operator may have different budget allocations, depending on their deployment scenario. The 400 ns holdover budget is allocated to the entire synchronization chain, and not to an individual clock. - -The intended operation of the T-GM is, therefore, as follows: - -- When the T-GM is synchronised to a PRTC locked to GNSS, it outputs clockClass 6. -- If the PRTC loses its connection to GNSS, it enters holdover. The T-GM should degrade the advertised clockClass to indicate "in holdover, but within holdover specification" (clockClass 7). -- The T-GM estimates when the holdover budget will potentially be exceeded. Factors to consider include the known quality of any external frequency support (e.g., SyncE QL), temperature variations, and/or the quality of the internal oscillator. -- When the T-GM considers that the clock is out of holdover specification (i.e., it is now estimated to have drifted by more than the holdover budget), the T-GM will advertise a clockClass of 140, 150 or 160. - -In the event of a network failure, where the T-GM is disconnected from the synchronization chain, a T-BC will take over as the grandmaster of the chain. That T-BC will be operating in holdover. The clockClass that the T-BC is allowed to advertise depends on the clockClass of the T-GM to which it was synchronized prior to losing connectivity. - -For example, if the T-BC was synchronized to a T-GM of clockClass 6, none of the holdover budget will have been consumed, and therefore the T-BC may use a clockClass indicating "within holdover specification" (e.g., clockClass 135). This value is chosen to be higher than that of a T-GM that is out of holdover specification, since the T-BC is likely to have more accurate time because it has been locked to a traceable time source more recently. Therefore, if the two clocks (a T-BC in holdover, - -within holdover specification and a T-GM in holdover, but out of holdover specification) are compared in the Alternate BMCA operation of a subsequent clock, the subsequent clock will synchronize to the T-BC that is within holdover specification instead of a T-GM that is out of holdover specification. - -In another example, if the T-BC was synchronized to a T-GM indicating that the T-GM is in holdover but out of holdover specification (e.g., parentDS clockClass 140, 150 or 160), the T-BC should also use a clockClass indicating "out of holdover specification" (e.g., defaultDS clockClass 165). This is because the T-GM was indicating that, in its estimation, the holdover budget has already been consumed. - -In another example, if the T-BC was synchronized to another T-BC, and the other T-BC indicates that it is in holdover but out of holdover specification (e.g., parentDS clockClass 165), the original T-BC should also use a clockClass indicating "out of holdover specification" (e.g., defaultDS clockClass 165). This is because the other T-BC was indicating that, in its estimation, the holdover budget has already been consumed. - -In a final example, if the T-BC was synchronized to a T-GM or another T-BC that was already in holdover but still within the holdover specification, the original T-BC could indicate "within holdover specification". However, some of the holdover budget will have already been consumed by the T-GM or T-BC. If it is not known how much of the budget is left, the T-BC should indicate "out of holdover specification". - -NOTE 1 – When the term clockClass is used with respect to the property of the individual PTP clock (T-GM, T-BC, T-TSC) it is referring to data set member defaultDS.clockQuality.clockClass. - -NOTE 2 – If a T-BC was synchronized to a T-GM or to another T-BC that was in free-run mode (advertising clockClass 248), the T-BC should continue to advertise clockClass 248 even after it loses its reference. - -## Appendix VIII - -### Considerations on a T-TSC connected to an end application - -(This appendix does not form an integral part of this Recommendation.) - -The default T-TSC clockclass 255 implies that the T-TSC will always lock to an external PTP reference when available. - -The actual synchronization source ultimately used by the end application depends on the applicable synchronization needs. This process is out of the scope of this Recommendation. - -As an example, the decision to use the PTP reference that has been selected by the T-TSC (e.g., instead of entering holdover), could depend on the actual clockQuality, frequencyTraceable flag, timeTraceable flag, and synchronizationUncertain flag associated to the external PTP reference. Additional aspects as related to performance monitoring of the external reference might also be considered. This is implementation specific. - -As an example, when it is required to meet the network timing requirements as per e.g., [ITU-T G.8271.1], it would be necessary that the external PTP reference has clockClass 6, 7 or 135 and that the timeTraceable flag is TRUE in order to be used by the end application. When this condition is not met, the end application may decide to enter holdover (either using the internal oscillator or driven by SyncE). - -NOTE – The specific behaviour for a T-TSC embedded in the end application is outside the scope of this Recommendation. It is assumed that interoperability with the profile is maintained. - -## Appendix IX - -### Calculation of offsetScaledLogVariance for T-GM timed by PRTC or ePRTC - -(This appendix does not form an integral part of this Recommendation.) - -### IX.1 Observation interval and TDEV noise generation - -The offsetScaledLogVariance is an offset, scaled representation of the PTP variance (PTPVAR). PTPVAR is described in clause 7.6.3 of [IEEE 1588]; it is equal to Allan variance multiplied by $\tau^2/3$ , where $\tau$ is the observation interval. PTP variance is therefore not a single value; it is a function of observation interval. Clause 7.6.3 of [IEEE 1588] specifies that the observation interval $\tau$ shall be the value defined in the applicable PTP profile. Clause 7.6.3 of [IEEE 1588] refers to $\tau$ as the sampling period. However, comparison of the equations in clause 7.6.3.2 of [IEEE 1588] with the equations for Allan variance in clause II.1 of [ITU-T G.810] indicates that $\tau$ in clause 7.6.3 of [IEEE 1588] is the observation interval of [ITU-T G.810], and not the sampling interval $\tau_0$ . - -The offsetScaledLogVariance, i.e., defaultDS.clockQuality.offsetScaledLogVariance, is a clock attribute used in the BMCA. As indicated in clause 7.6.3.5 of [IEEE 1588], it is "an estimate of the variations of the local clock from a linear timescale when it is not synchronized to another clock using the protocol" (quoted text is from [IEEE 1588]; the "protocol" refers to the PTP protocol). Since a clock is not synchronized to another clock via PTP when it is grandmaster, the offsetScaledLogVariance should represent the long-term noise that the clock generates, because it is this noise that is generated if the clock is grandmaster. Therefore, the observation interval should be the longest interval over which noise generation for the clock in question is specified. - -For a T-GM timed by a PRTC, i.e., a clock that meets the requirements of [ITU-T G.8272], the longest observation interval for which noise generation TDEV is specified is 10000 s (see Figure 2 of [ITU-T G.8272]). For this interval, TDEV is 30 ns. The specified noise type for intervals ranging from 1000 s to 10000 s is flicker phase modulation (FPM), with TDEV equal to 30 ns in this range. For a T-GM timed by an ePRTC, the longest observation interval for which noise generation TDEV is specified is $10^6$ s. For this interval, TDEV is 10 ns. The specified noise type for intervals ranging from $3 \times 10^5$ s to $10^6$ s is FPM, with TDEV equal to 10 ns in this range. - -The value of the observation interval is not used directly in the PTP protocol and is not carried in any PTP messages. It is used only in evaluating PTP variance. - -The above values of observation interval and corresponding noise generation TDEV, for the PRTC and ePRTC, are summarized in Table IX.1. - -**Table IX.1 – Observation intervals, and corresponding noise generation TDEV values and noise type, for T-GM timed by PRTC and T-GM timed by ePRTC** - -| Clock that T-GM is timed by | Observation interval ( $\tau$ ) for offsetScaledLogVariance (s) | $n = \tau / \tau_0$ (see clause IX.2 below) | Noise type | TDEV (ns) | -|-----------------------------|-----------------------------------------------------------------|---------------------------------------------|------------|-----------| -| PRTC | 1000 – 10000 | $1.6 \times 10^4$ to $1.6 \times 10^5$ | FPM | 30 | -| ePRTC | 300 000 – 1 000 000 | $4.8 \times 10^6$ to $1.6 \times 10^7$ | FPM | 10 | - -### IX.2 Computation of PTP variance from TDEV - -The next step is to compute PTP variance from the TDEV values given in the previous clause. Since PTP variance is equal to $\tau^2/3$ multiplied by Allan variance, and time variance (TVAR) is equal to $\tau^2/3$ multiplied by modified Allan variance, the ratio of TVAR to PTP variance is equal to the ratio of modified Allan variance (MVAR) to Allan variance. This latter ratio is discussed and computed for various noise types in section A.6 of [b-Sullivan]. The results given there are based on [b-Walls] and - -[b-Lesage]. In addition, the relations between power spectral density (PSD) and Allan variance are given in Table 5.4 of [b-Bregni], and between PSD and modified Allan variance in Table 5.5 of [b-Bregni] (when using relations between PSD and various time-domain stability parameters, it is important to take note of whether the PSD is of time ( $S_x(f)$ ) or of frequency ( $S_y(f)$ )). - -Let $n$ be the ratio of observation interval $\tau$ to sampling interval $\tau_0$ , i.e., $\tau = n\tau_0$ . In general, the ratio of MVAR to AVAR, denoted $R(n)$ , depends on $n$ , though at least for the noise types white phase modulation (WPM), flicker FPM, white frequency modulation (WFM), flicker frequency modulation (FFM), and random-walk frequency modulation (RWFM), it approaches an asymptotic value for large $n$ . In addition, for the case of FPM $R(n)$ depends on the measurement system bandwidth (for WPM, both AVAR and MVAR individually depend on measurement system bandwidth, though their ratio does not). Since time synchronization information from whichever clock is selected as grandmaster is transported via Sync messages, the sampling interval $\tau_0$ can be taken equal to the Sync interval. The actual successive Sync intervals vary with time, as allowed by clause 7.7.2.1 of [IEEE 1588]; for simplicity, we may take $\tau_0$ equal to the mean Sync interval. This is 1/16 s in [ITU-T G.8275.1]. Then, using the observation interval values in Table IX.1 above, the corresponding values of $n$ range from $1.6 \times 10^4$ to $1.6 \times 10^5$ for a T-GM timed by a PRTC, and from $4.8 \times 10^5$ to $1.6 \times 10^5$ for a T-GM timed by an ePRTC. The values of $n$ are also summarized in Table IX.1 above. - -From Table IX.1, it is seen that the range of $n$ is different for the PRTC and ePRTC. This means that, even though the noise type in the ranges of interest for these clocks is the same, $R(n)$ will be different, and TVAR for each clock will be adjusted by a different factor to obtain PTPVAR. However, the PRTC and ePRTC stability (as well as the stability of other clocks used in telecommunications) are specified using TDEV (i.e., square root of TVAR), and not using PTPDEV or PTPVAR. It therefore would be desirable to adjust TVAR for the PRTC and ePRTC by the same factor. In previous work, in which TVAR for the PRTC was compared to TVAR for a T-BC timed by SyncE, $R(n)$ was equal to 0.787. This value is used here for convenience, for both the PRTC and ePRTC. - -With the above assumption, PTPVAR for the PRTC is given by: - -$$\text{PTPVAR (PRTC)} = \frac{\text{TVAR}}{R(n)} = \frac{(30 \times 10^{-9})^2 \text{ s}^2}{0.787} = 1.144 \times 10^{-15} \text{ s}^2 \quad (\text{IX.1})$$ - -and PTPVAR for the ePRTC is given by: - -$$\text{PTPVAR (ePRTC)} = \frac{\text{TVAR}}{R(n)} = \frac{(10 \times 10^{-9})^2 \text{ s}^2}{0.787} = 1.271 \times 10^{-16} \text{ s}^2 \quad (\text{IX.2})$$ - -### IX.3 Computation of offsetScaledLogVariance from PTP variance - -offsetScaledLogVariance is now computed from the PTPVAR results of the previous clause, using the procedure described in clause 7.6.3.3 of [IEEE 1588]. This procedure is: - -- a) The logarithm to base 2 of PTPVAR expressed in units of $\text{s}^2$ is computed; -- b) The result of (a) is multiplied by $2^8$ to produce a scaled value; -- c) The scaled value is modified per the hysteresis specification of clause 7.6.3.3 of [IEEE 1588]. (This step is not needed here, because offsetScaledLogVariance is being computed from a specification, rather than from real-time measurements.); -- d) The result of (c) is represented as a 2s complement Integer16 (i.e., it is represented as a signed integer, where negative values are represented in 2s complement form (since PTPVAR is less than $1 \text{ s}^2$ in almost all cases of practical interest, and certainly in the cases described in the previous clause, the result of (c) will almost always be negative)); -- e) The value 0x8000 is added to the result of (d), and any overflow is ignored; - -- f) The result of (e) is cast as an Integer16. This result, which may also be expressed in writing in hexadecimal form, is offsetScaledLogVariance. - -#### IX.3.1 Computation of offsetScaledLogVariance for a T-GM timed by a PRTC - -From Eq. (IX.1), PTPVAR = $1.144 \times 10^{-15}$ s2. Using steps (a) – (f) above, we obtain - -$$\begin{aligned} \log_2(\text{PTPVAR}) &= \frac{\ln(1.144 \times 10^{-15})}{\ln 2} = -49.6348 \\ 2^8 \log_2(\text{PTPVAR}) &= \frac{(256) \ln(1.144 \times 10^{-15})}{\ln 2} = -12706.5176 @ 12707 \end{aligned} \quad (\text{IX.3})$$ - -Representing the above as a signed integer in 2s complement form produces - -$$12707 = 31A3_{16} \mapsto CE5C_{16} \text{ (1s complement form)} \mapsto CE5D_{16} \text{ (2s complement form)} \quad (\text{IX.4})$$ - -Adding $8000_{16}$ to the above and ignoring any overflow produces - -$$CE5D_{16} + 8000_{16} = 14E5D_{16} \mapsto 4E5D_{16} \quad (\text{IX.5})$$ - -The resulting offsetScaledLogVariance is $4E5D_{16}$ . - -#### IX.3.2 Computation of offsetScaledLogVariance for a T-GM timed by an ePRTC - -The logarithm to base 2 of PTPVAR expressed in units of s2 is computed and the result is multiplied by $2^8$ to produce a scaled value. - -$$\begin{aligned} \log_2(\text{PTPVAR}) &= \frac{\ln(1.271 \times 10^{-16})}{\ln 2} = -52.8049 \\ 2^8 \log_2(\text{PTPVAR}) &= \frac{(256) \ln(1.271 \times 10^{-16})}{\ln 2} = -13518.0507 \cong -13518 \end{aligned} \quad (\text{IX.6})$$ - -Representing the above as a signed integer in 2s complement form produces - -$$13518 = 34CE_{16} \Rightarrow CB31_{16} \text{ (1s complement form)} \Rightarrow CB32_{16} \text{ (2s complement form)} \quad (\text{IX.7})$$ - -Adding $8000_{16}$ to the above and ignoring any overflow produces - -$$CB32_{16} + 8000_{16} = 14B32_{16} \Rightarrow 4B32_{16} \quad (\text{IX.8})$$ - -The resulting offsetScaledLogVariance is $4B32_{16}$ . - -## Appendix X - -## Description of a T-BC extended clockClass application - -(This appendix does not form an integral part of this Recommendation.) - -Table 3 of [ITU-T G.8275.1] defines a T-BC extended clockClass application. This appendix describes the purpose of this extended application, and its corresponding value amendments, including defaultDS data set member specifications of Annex A of [ITU-T G.8275.1] (corresponding to Table A.1) and T-BC Announce message contents of Appendix V of [ITU-T G.8275.1] (corresponding to Table V.3). - -### X.1 Purpose of T-BC extended clockClass application - -PTP is the only synchronization source in an [IEEE 1588] network, therefore the clockClass values have been only applied to the PTP clock for indicating its inherent characteristics. The clockClass in Table 5 of the [IEEE 1588-2008] and Table 4 of [IEEE 1588-2019], such as 6,7,52,187, only represents the T-GM. The clockClass may not reflect the change of synchronization states in the T-BCs deployed in the network. - -Since it is possible that there are two separate synchronization sources (GNSS time and physical frequency) in a telecom network, an extension mechanism of the clockClass range to cover the case of both T-GM and T-BC changes is provided. The definition of the clockClass values is extended into two parts: - -- 1) for a T-GM, the range of clockClass includes 6, 7, 140, 150 and 160. The clockClass values of 140/150/160 represent the time output of T-GM when it is in time holdover instead of tracking to GNSS. The time quality is consistent with the clock quality of the frequency category 1, 2, and 3 respectively; -- 2) for a T-BC, the clockClass includes 135 and 165. The value of 135 means that when a T-BC is in time holdover, the output time signal is within specification, clockClass 165 means that the output time signal is out of time holdover specification. - -The case of two separated sources has been considered in [ITU-T G.8271.1] HRM-2 and HRM-3. In order to extend the advantages of two separated sources, it is better to treat a T-BC differently when it is traceable to frequency of a different quality. The clockClass of 165 could be assigned to a T-BC when the T-BC is traceable to a frequency in QL-SEC, and the T-BC could share the clockClass value of 140/150/160 with the T-GM when it is traceable to a different quality of frequency. In this way, the appropriate T-BC can be selected to be the GM of the network so that better time signals can be sent to the end-users. - -For a telecom network, it is crucial to make sure that the best clock selection principle is valid in any PTP network, especially in the case where there exists an isolated time region (which cannot receive any signals from the T-GM) in the network. In this region, if the T-BC has a preferred frequency quality, the T-BC can act as a T-GM and send out precise time/phase signals (where the signal quality is still close to UTC). In telecom networks, from the perspective of synchronization performance, any of the T-BCs could supersede the old T-GM to be the new PTP source of the network. - -### X.2 DefaultDS data set member specifications under this extended application - -In some cases, the values of clockClass/accuracy/variance will likely be the same as that delivered by the announce packets from the T-GM and T-BC per Table 3/Note 3. As such, the T-BC should synchronize the T-GM. It is suitable for priority 2 to achieve this goal, and the range of priority 2 should be divided into two parts, 0-127 for the T-GM, 128-255 for the T-BC. - -In this PTP profile, the clock attribute priority2 is configurable. - -If this feature is used, then the *priority2* for the T-GM should be set to a lower value compared to T-BCs, in particular the range for *priority2* could be allocated as follows: - -- for T-GM, the range {0-127}; -- for T-BC, the range {128-255}. - -As an example of a default value for *priority2*, it is suggested to set the T-GM to 100 and the T-BC to 128. - -## Appendix XI - -### Considerations on native access equipment - -(This appendix does not form an integral part of this Recommendation.) - -In some deployments, native access equipment such as xDSL, xPON, and microwave equipment may have implemented T-BC functionality. This appendix provides information on how such equipment may be modeled as a pair of T-BCs defined in this Recommendation. The following Figure XI.1 shows an example of equipment that is transferring the PTP timing between native PTP and native access media. Examples of such equipment may be an xPON OLT & ONU, an xDSL DSLAM & RT-DSLAM, or microwave equipment. Only one PTP port and one Special port are shown in the diagram, although the equipment may contain multiple ports. Within this simplified diagram there are two PTP ports on the T-BC; one is a normal PTP port and one is a Special PTP port. On both the PTP port and the Special PTP port, the Announce information and Signalling messages are handled according to normal T-BC operation. The difference is that on the PTP port, the timing messages (Sync, Delay\_Req, Delay\_Resp) are handled normally, while on the Special PTP port they are not present as they are replaced by native timing messages. If the timing flow hierarchy is known in advance (such as that of a PON OLT, which will only transfer timing downstream on its Special PTP ports) then the PTP ports, Special PTP ports, or the PTP clock may be configured with masterOnly or slaveOnly parameters (such as a PON OLT configured with Special PTP ports as masterOnly TRUE, or a PON ONU configured with slaveOnly TRUE). - -![Diagram illustrating the timing flow between native PTP and native access media. The diagram shows a central box representing the equipment, divided into two main sections: 'Native-access clock' and 'PTP clock', separated by a 'Native-access to PTP IWF' (Interworking Function). The 'Native-access clock' section contains a 'Special port (state: timing slave)'. The 'PTP clock' section contains a 'PTP port (state: timing master)'. Arrows indicate the flow of messages: 'Native timing transfer' (blue) between the top external port and the Special port; 'Announce info' (purple) and 'Signalling' (purple) between the top external port and the PTP port; 'Sync', 'Delay Req', and 'Delay Resp' (blue) between the bottom external port and the PTP port; and 'Announce' (purple) and 'Signalling' (purple) between the bottom external port and the PTP port. Dashed lines indicate that the top and bottom external ports 'May be one physical port'.](74b540f71bcf10a8a66b2f01ea8c08ec_img.jpg) - -Diagram illustrating the timing flow between native PTP and native access media. The diagram shows a central box representing the equipment, divided into two main sections: 'Native-access clock' and 'PTP clock', separated by a 'Native-access to PTP IWF' (Interworking Function). The 'Native-access clock' section contains a 'Special port (state: timing slave)'. The 'PTP clock' section contains a 'PTP port (state: timing master)'. Arrows indicate the flow of messages: 'Native timing transfer' (blue) between the top external port and the Special port; 'Announce info' (purple) and 'Signalling' (purple) between the top external port and the PTP port; 'Sync', 'Delay Req', and 'Delay Resp' (blue) between the bottom external port and the PTP port; and 'Announce' (purple) and 'Signalling' (purple) between the bottom external port and the PTP port. Dashed lines indicate that the top and bottom external ports 'May be one physical port'. - -G.8275.1-Y.1369.1(16)-Amd.1(17)\_FXI.1 - -**Figure XI.1 – Timing flow between native PTP and native access media** - -This appendix shows one possible way to model native access media (as a pair of T-BCs). Other ways to model native access media may exist. - -## **Appendix XII** - -### **Monitoring alternate master time information provided by a peer PTP port** - -(This appendix does not form an integral part of this Recommendation.) - -The contents of this appendix have been moved into Annex G. - -## **Appendix XIII** - -### **Considerations on the use of [IEEE 1588-2019]** - -(This appendix does not form an integral part of this Recommendation.) - -Considerations on the use of [IEEE 1588-2019] are discussed in Appendix IX of [ITU-T G.8275]. - -## Appendix XIV - -### Considerations in an environment of more than two PTP ports on a single PTP communication path when using transparent clocks and multicast addressing - -(This appendix does not form an integral part of this Recommendation.) - -There are some aspects of PTP topology that are unique to a multicast environment that uses transparent clocks. When the network is restricted to ordinary and boundary clocks, each transport layer connection has only two PTP ports. On an ordinary clock or boundary clock each local PTP port will only ever communicate with one external PTP port. When transparent clocks are introduced, this situation changes and one local PTP port may communicate with more than one external PTP port. - -In Figure XIV.1, PTP clocks A, B, and C are connected using a transparent clock. This makes the three PTP ports A.1, B.1, and C.1 endpoints of a single PTP communication path. Each of these ports shall have a portDS dataset within their respective clocks. - -In this example, it is assumed that PTP ports A.1 and B.1 either have masterOnly set to TRUE or, due to some transport layer distribution of Announce messages (not shown in Figure XIV.1) and/or the rules of the alternate BCMA of [ITU-T G.8275.1], both ports are in MASTER state. Both ports will transmit Announce messages advertising the quality of the grandmaster clocks they are using. Port C.1 will receive the Announce messages from ports A.1 and B.1 due to the transparent clock connection. - -According to [IEEE 1588], port C.1 may use a foreign master table and compute an Erbbest based on the data of these two flows of Announce messages. In this example, the grandmaster information from port A.1 is better than the grandmaster information from port B.1. The BMCA in clock C shall cause clock A to be the parent PTP instance, shall set parentDS.parentPortIdentity to be port A.1 and shall place port C.1 into SLAVE state. - -If there is a problem in the PTP communication between PTP port A.1 and PTP port C.1 then one of the events specified in clause 6.3.9 may be raised by clock C. These PTSF conditions may only apply to that PTP communication; there may be no such condition in the PTP communication between ports B.1 and C.1. Clock C should switch from using port A.1 to port B.1 as its source of timing. - -If the PTP communication between Port A.1 and Port C.1 has a PTSF event, the Port C.1 should select the data set associated with the Port B.1 as its Erbbest data set instead of setting portDS.SF to TRUE. However, if both PTP communications with the Port A.1 and Port B.1 have a PTSF event, the Port C.1 should set portDS.SF to TRUE. - -![Diagram showing three PTP ports (Port A.1 (M), Port B.1 (M), Port C.1) interconnected via a central T-TC (Transparent Clock) using multicast addressing. Clock A, Clock B, and Clock C are associated with the ports. The diagram includes a small text label: G.8275.1-Y.1369.1(20)-Amd.2(21)_FXIV.1.](6a7ea9d5162b0a0cfbd8d77c6cac90d1_img.jpg) - -The diagram illustrates a network topology for Precision Time Protocol (PTP) using multicast addressing. At the top, two boxes represent Clock A and Clock B. Clock A contains 'Port A.1 (M)' and Clock B contains 'Port B.1 (M)'. Below them is a central box labeled 'T-TC' (Transparent Clock). At the bottom is another box containing 'Port C.1' and 'Clock C'. Blue arrows indicate the flow of PTP messages: from Port A.1 to the T-TC, from Port B.1 to the T-TC, and from the T-TC to Port C.1. A dashed blue line connects the T-TC to Port C.1. Below the Port C.1 box is the text 'G.8275.1-Y.1369.1(20)-Amd.2(21)\_FXIV.1'. - -Diagram showing three PTP ports (Port A.1 (M), Port B.1 (M), Port C.1) interconnected via a central T-TC (Transparent Clock) using multicast addressing. Clock A, Clock B, and Clock C are associated with the ports. The diagram includes a small text label: G.8275.1-Y.1369.1(20)-Amd.2(21)\_FXIV.1. - -**Figure XIV.1 – Three PTP ports interconnected using a transparent clock with multicast addressing** - -## Appendix XV - -### Considerations of deploying ePRTC and PRTC in the network - -(This appendix does not form an integral part of this Recommendation.) - -In some deployment scenarios, both ePRTC and PRTC may be deployed in a same PTP network, e.g., an ePRTC in a central location in the network, and a PRTC closer to the end application. In this scenario, there could be several T-BCs between the ePRTC and the end application, and there will be PTP noise accumulation through the chain of T-BCs. Therefore, for the end application closer to a PRTC, it may be better to select the PRTC instead of an ePRTC due to the noise accumulation through the chain of T-BCs. - -To allow the current Alternate BMCA of this recommendation to choose a T-GM connected to a PRTC instead of an ePRTC in such deployment scenario as described above, operators may choose to use clock accuracy of 0x21 for the ePRTC instead of 0x20, and to use offsetScaledLogVariance of 0x4E5D for the ePRTC instead of 0x4B32. - -NOTE – There may be other solutions to address this case (e.g., an Alternate BMCA using an enhanced synchronization accuracy metrics TLV); they are for further study. - -# Bibliography - -- [b-IEEE 802.1AX] IEEE 802.1AX (2020), *IEEE Standard for Local and metropolitan area networks – Link Aggregation*. -- [b-Bregni] Stefano Bregni, (2002), *Synchronization of Digital Telecommunications Networks*, Wiley. -- [b-Lesage] Paul Lesage and Theophane Ayi (1984), *Characterization of Frequency Stability: Analysis of the Modified Allan Variance and Properties of Its Estimate*, IEEE Transactions on Instrumentation and Measurement, Vol. IM-33, No. 4 (included in [b-Sullivan] as paper D.6). -- [b-Sullivan] D.B. Sullivan, D.W. Allan, D.A. Howe, and F.L. Walls (1990), *Characterization of Clocks and Oscillators*, NIST Technical Note 1337. -- [b-Walls] F.L. Walls, John Gary, Abbie O'Gallagher, Roland Sweet, and Linda Sweet (1991), *Time Domain Frequency Stability Calculated from the Frequency Domain Description: Use of the SIGINT Software Package to Calculate Time Domain Frequency Stability from the Frequency Domain*, NIST Report NISTR 89-3916 Revised (revision of 1989 version of this report). - -# ITU-T Y-SERIES RECOMMENDATIONS - -## **GLOBAL INFORMATION INFRASTRUCTURE, INTERNET PROTOCOL ASPECTS, NEXT-GENERATION NETWORKS, INTERNET OF THINGS AND SMART CITIES** - -### **GLOBAL INFORMATION INFRASTRUCTURE** - -| | | -|-------------------------------------------|-------------| -| General | Y.100–Y.199 | -| Services, applications and middleware | Y.200–Y.299 | -| Network aspects | Y.300–Y.399 | -| Interfaces and protocols | Y.400–Y.499 | -| Numbering, addressing and naming | Y.500–Y.599 | -| Operation, administration and maintenance | Y.600–Y.699 | -| Security | Y.700–Y.799 | -| Performances | Y.800–Y.899 | - -### **INTERNET PROTOCOL ASPECTS** - -| | | -|--------------------------------------------------------------------|----------------------| -| General | Y.1000–Y.1099 | -| Services and applications | Y.1100–Y.1199 | -| Architecture, access, network capabilities and resource management | Y.1200–Y.1299 | -| Transport | Y.1300–Y.1399 | -| Interworking | Y.1400–Y.1499 | -| Quality of service and network performance | Y.1500–Y.1599 | -| Signalling | Y.1600–Y.1699 | -| Operation, administration and maintenance | Y.1700–Y.1799 | -| Charging | Y.1800–Y.1899 | -| IPTV over NGN | Y.1900–Y.1999 | - -### **NEXT GENERATION NETWORKS** - -| | | -|-------------------------------------------------------------------|---------------| -| Frameworks and functional architecture models | Y.2000–Y.2099 | -| Quality of Service and performance | Y.2100–Y.2199 | -| Service aspects: Service capabilities and service architecture | Y.2200–Y.2249 | -| Service aspects: Interoperability of services and networks in NGN | Y.2250–Y.2299 | -| Enhancements to NGN | Y.2300–Y.2399 | -| Network management | Y.2400–Y.2499 | -| Computing power networks | Y.2500–Y.2599 | -| Packet-based Networks | Y.2600–Y.2699 | -| Security | Y.2700–Y.2799 | -| Generalized mobility | Y.2800–Y.2899 | -| Carrier grade open environment | Y.2900–Y.2999 | - -### **FUTURE NETWORKS** - -### **CLOUD COMPUTING** - -### **BIG DATA** - -### **QUANTUM KEY DISTRIBUTION NETWORKS** - -### **INTERNET OF THINGS AND SMART CITIES AND COMMUNITIES** - -| | | -|---------------------------------------------------------|---------------| -| General | Y.4000–Y.4049 | -| Definitions and terminologies | Y.4050–Y.4099 | -| Requirements and use cases | Y.4100–Y.4249 | -| Infrastructure, connectivity and networks | Y.4250–Y.4399 | -| Frameworks, architectures and protocols | Y.4400–Y.4549 | -| Services, applications, computation and data processing | Y.4550–Y.4699 | -| Management, control and performance | Y.4700–Y.4799 | -| Identification and security | Y.4800–Y.4899 | -| Evaluation and assessment | Y.4900–Y.4999 | - -For further details, please refer to the list of ITU-T Recommendations. - -## SERIES OF ITU-T RECOMMENDATIONS - -| | | -|-----------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------| -| Series A | Organization of the work of ITU-T | -| Series D | Tariff and accounting principles and international telecommunication/ICT economic and policy issues | -| Series E | Overall network operation, telephone service, service operation and human factors | -| Series F | Non-telephone telecommunication services | -| Series G | Transmission systems and media, digital systems and networks | -| Series H | Audiovisual and multimedia systems | -| Series I | Integrated services digital network | -| Series J | Cable networks and transmission of television, sound programme and other multimedia signals | -| Series K | Protection against interference | -| Series L | Environment and ICTs, climate change, e-waste, energy efficiency; construction, installation and protection of cables and other elements of outside plant | -| Series M | Telecommunication management, including TMN and network maintenance | -| Series N | Maintenance: international sound programme and television transmission circuits | -| Series O | Specifications of measuring equipment | -| Series P | Telephone transmission quality, telephone installations, local line networks | -| Series Q | Switching and signalling, and associated measurements and tests | -| Series R | Telegraph transmission | -| Series S | Telegraph services terminal equipment | -| Series T | Terminals for telematic services | -| Series U | Telegraph switching | -| Series V | Data communication over the telephone network | -| Series X | Data networks, open system communications and security | -| Series Y | Global information infrastructure, Internet protocol aspects, next-generation networks, Internet of Things and smart cities | -| Series Z | Languages and general software aspects for telecommunication systems | \ No newline at end of file diff --git a/marked/G/T-REC-G.8275.2-202211-I_PDF-E/08f6ace0c83e7394657fa372b47aec04_img.jpg b/marked/G/T-REC-G.8275.2-202211-I_PDF-E/08f6ace0c83e7394657fa372b47aec04_img.jpg deleted file mode 100644 index 089ce96528f90caf961bbd90c2cb7e3546fb13fe..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.8275.2-202211-I_PDF-E/08f6ace0c83e7394657fa372b47aec04_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:307a987a11f0a21d90c00a003c302399c5bfd416c8f899671dc2f59a41abecd6 -size 43037 diff --git a/marked/G/T-REC-G.8275.2-202211-I_PDF-E/0f26e70157bd4c45f825795cdcd20fbd_img.jpg b/marked/G/T-REC-G.8275.2-202211-I_PDF-E/0f26e70157bd4c45f825795cdcd20fbd_img.jpg deleted file mode 100644 index 1271c1cbef3d858f2578437e86395f7a12aceef9..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.8275.2-202211-I_PDF-E/0f26e70157bd4c45f825795cdcd20fbd_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:5171a6d87eb578d399e032b441b74b429bed1b869ffc788f91e9ce3567d2afea -size 20816 diff --git a/marked/G/T-REC-G.8275.2-202211-I_PDF-E/18e519d1f91133e080347562f681dfb5_img.jpg b/marked/G/T-REC-G.8275.2-202211-I_PDF-E/18e519d1f91133e080347562f681dfb5_img.jpg deleted file mode 100644 index 2bd68b2563e13a10eb422b6a43944a840cfc6cfd..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.8275.2-202211-I_PDF-E/18e519d1f91133e080347562f681dfb5_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:eea31e8542b953c5e6e23beb69dcbab164bf40728d4eb0ffcb60daa703febaf3 -size 62493 diff --git a/marked/G/T-REC-G.8275.2-202211-I_PDF-E/3c99312f83459559d9a301148555d7b9_img.jpg b/marked/G/T-REC-G.8275.2-202211-I_PDF-E/3c99312f83459559d9a301148555d7b9_img.jpg deleted file mode 100644 index dacff8cf2694f56beea700f53a83f360d2f6c3fc..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.8275.2-202211-I_PDF-E/3c99312f83459559d9a301148555d7b9_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:caceb9739490850e5ec79be8d014a964791f5c828da9cb512d5b501556b427ad -size 89250 diff --git a/marked/G/T-REC-G.8275.2-202211-I_PDF-E/5c3dd31372f59e15250f0ab1613ca485_img.jpg b/marked/G/T-REC-G.8275.2-202211-I_PDF-E/5c3dd31372f59e15250f0ab1613ca485_img.jpg deleted file mode 100644 index c69248eac24ce0c62ac2fda225e8a5fe64a8546a..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.8275.2-202211-I_PDF-E/5c3dd31372f59e15250f0ab1613ca485_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:ada5621b7553f59516b227ae37acd4fdb66cfa3a1b3a46557f1eb7ceedf19663 -size 40601 diff --git a/marked/G/T-REC-G.8275.2-202211-I_PDF-E/678ac9faaa56bb929499cebeea83a110_img.jpg b/marked/G/T-REC-G.8275.2-202211-I_PDF-E/678ac9faaa56bb929499cebeea83a110_img.jpg deleted file mode 100644 index 4257bcffa3b35d23020356a157a09d469a1e7a49..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.8275.2-202211-I_PDF-E/678ac9faaa56bb929499cebeea83a110_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:dc8256b305e3539657e20f28885a095cd0869c710a1491b98ded65e1396bde6a -size 35400 diff --git a/marked/G/T-REC-G.8275.2-202211-I_PDF-E/7913c315e0db8233cb1ac2455e4a0a81_img.jpg b/marked/G/T-REC-G.8275.2-202211-I_PDF-E/7913c315e0db8233cb1ac2455e4a0a81_img.jpg deleted file mode 100644 index 0e2bf3eb547a173f1f4d661120093741e98f272b..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.8275.2-202211-I_PDF-E/7913c315e0db8233cb1ac2455e4a0a81_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:e8a06fe46371a9f8d3419c472ea7b35c0b8bf24a9a8c4657c18b194d8b903ddc -size 29296 diff --git a/marked/G/T-REC-G.8275.2-202211-I_PDF-E/84a1d09fb489061482111515543b60dc_img.jpg b/marked/G/T-REC-G.8275.2-202211-I_PDF-E/84a1d09fb489061482111515543b60dc_img.jpg deleted file mode 100644 index ac295b1b0c7f14b1c5a33ef6682b1b017c812477..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.8275.2-202211-I_PDF-E/84a1d09fb489061482111515543b60dc_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:37aed4fc114a39843438175326e0b7e1d09a9d6075723d82fea32040fd560ee4 -size 7192 diff --git a/marked/G/T-REC-G.8275.2-202211-I_PDF-E/9b1ec0090070bdf52ea28763b8d52477_img.jpg b/marked/G/T-REC-G.8275.2-202211-I_PDF-E/9b1ec0090070bdf52ea28763b8d52477_img.jpg deleted file mode 100644 index 52659b8e1a1a00bfd6ba6019c489e555dcf73711..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.8275.2-202211-I_PDF-E/9b1ec0090070bdf52ea28763b8d52477_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:ababc06e9b7cc3dfe23c3d6d4089606825f697de8d2222139cfa619c19c55626 -size 71749 diff --git a/marked/G/T-REC-G.8275.2-202211-I_PDF-E/a2251e3bbfcd726b68cc50b091e53b02_img.jpg b/marked/G/T-REC-G.8275.2-202211-I_PDF-E/a2251e3bbfcd726b68cc50b091e53b02_img.jpg deleted file mode 100644 index 11547291deb14e4d3c3f7ca8d2a8e2be8496fe4f..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.8275.2-202211-I_PDF-E/a2251e3bbfcd726b68cc50b091e53b02_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:cc23dba5d67de7f9a0b8c7ebccbf82b065ea102af12fbf89ec5797c48dafecf2 -size 78411 diff --git a/marked/G/T-REC-G.8275.2-202211-I_PDF-E/c0b9e5fc63e19306394e0d4249da62cd_img.jpg b/marked/G/T-REC-G.8275.2-202211-I_PDF-E/c0b9e5fc63e19306394e0d4249da62cd_img.jpg deleted file mode 100644 index e2f5042d68c37f699f2ae46cfa5f41661f1ead04..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.8275.2-202211-I_PDF-E/c0b9e5fc63e19306394e0d4249da62cd_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:c04c867f3f9544257329202386093ef5f4027c9ad52c68e91495a3f83c8500cd -size 77171 diff --git a/marked/G/T-REC-G.8275.2-202211-I_PDF-E/c0c7f65c51c83fbe595b47326f6b089a_img.jpg b/marked/G/T-REC-G.8275.2-202211-I_PDF-E/c0c7f65c51c83fbe595b47326f6b089a_img.jpg deleted file mode 100644 index 1354ffffafd4e1825aec48efca9296613da035a9..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.8275.2-202211-I_PDF-E/c0c7f65c51c83fbe595b47326f6b089a_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:112a28b4da19876a645424f2f6ce0705853957be8f9724c4da816ca0df045846 -size 17355 diff --git a/marked/G/T-REC-G.8275.2-202211-I_PDF-E/c5452f95f3b28f1bfe29e84fbc2e1267_img.jpg b/marked/G/T-REC-G.8275.2-202211-I_PDF-E/c5452f95f3b28f1bfe29e84fbc2e1267_img.jpg deleted file mode 100644 index 9f66690f2f93d268b83204b8deb3ceebeeadc310..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.8275.2-202211-I_PDF-E/c5452f95f3b28f1bfe29e84fbc2e1267_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:e8380148a8107c2b62d2730370952c0c5f89b45be6808de6e6610a1f64ca5ad3 -size 114895 diff --git a/marked/G/T-REC-G.8275.2-202211-I_PDF-E/c914f51f4427bc672dd0526cfc90ebe9_img.jpg b/marked/G/T-REC-G.8275.2-202211-I_PDF-E/c914f51f4427bc672dd0526cfc90ebe9_img.jpg deleted file mode 100644 index ab7e4a28d3edbc7806aa4adff29e9ec47bc8e52e..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.8275.2-202211-I_PDF-E/c914f51f4427bc672dd0526cfc90ebe9_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:a201b14188b2e6e02f2d20a4a62101469f16634bea5329d186dd5e10a12ca28a -size 101433 diff --git a/marked/G/T-REC-G.8275.2-202211-I_PDF-E/cbab05075b3d7dc0d27c4cbb0c914a94_img.jpg b/marked/G/T-REC-G.8275.2-202211-I_PDF-E/cbab05075b3d7dc0d27c4cbb0c914a94_img.jpg deleted file mode 100644 index bf30deb588c131d0057fbf466c41d67f6acbf6ad..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.8275.2-202211-I_PDF-E/cbab05075b3d7dc0d27c4cbb0c914a94_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:87ccfe7db2b2e64655d2ee9b678dfdb8bf34abce6991ea070fd24423d98985c7 -size 69553 diff --git a/marked/G/T-REC-G.8275.2-202211-I_PDF-E/df82d77a0d2637cbf2da9ea920a554fa_img.jpg b/marked/G/T-REC-G.8275.2-202211-I_PDF-E/df82d77a0d2637cbf2da9ea920a554fa_img.jpg deleted file mode 100644 index f5f8af11f406e8e9958f3c4aa45086dc1be30747..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.8275.2-202211-I_PDF-E/df82d77a0d2637cbf2da9ea920a554fa_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:a3508da24af52666a93c4ab8b684e7e6fd42042265d8b3f82fd28e6d920b9ff6 -size 72051 diff --git a/marked/G/T-REC-G.8275.2-202211-I_PDF-E/e69b9188aa2c14ec6b21c83f711fef65_img.jpg b/marked/G/T-REC-G.8275.2-202211-I_PDF-E/e69b9188aa2c14ec6b21c83f711fef65_img.jpg deleted file mode 100644 index 93020dbdea7ab3c222a2661c3a70f23ad59c85e9..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.8275.2-202211-I_PDF-E/e69b9188aa2c14ec6b21c83f711fef65_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:cb59e4faaea64677bb2c76eb94c7b28dbcde50d9af05c75715e88450e8266071 -size 111222 diff --git a/marked/G/T-REC-G.8275.2-202211-I_PDF-E/raw.md b/marked/G/T-REC-G.8275.2-202211-I_PDF-E/raw.md deleted file mode 100644 index 1842a10da3cc4d841cd2e81c7e85cc7598a8549b..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.8275.2-202211-I_PDF-E/raw.md +++ /dev/null @@ -1,1810 +0,0 @@ - - -# Recommendation - -## **ITU-T G.827.2/Y.1369.2 (11/2022)** - -SERIES G: Transmission systems and media, digital systems and networks - -Packet over Transport aspects – Synchronization, quality and availability targets - -SERIES Y: Global information infrastructure, Internet protocol aspects, next-generation networks, Internet of Things and smart cities - -Internet protocol aspects – Transport - ---- - -**Precision time protocol telecom profile for phase/time synchronization with partial timing support from the network** - -![ITU logo](84a1d09fb489061482111515543b60dc_img.jpg) - -The logo of the International Telecommunication Union (ITU) is located in the bottom right corner. It features a blue globe with white lines representing latitude and longitude, and the letters 'ITU' in a bold, blue, sans-serif font superimposed on the globe. - -ITU logo - -## ITU-T G-SERIES RECOMMENDATIONS **TRANSMISSION SYSTEMS AND MEDIA, DIGITAL SYSTEMS AND NETWORKS** - -| | | -|----------------------------------------------------------------------------------------------------------------------------------------------|----------------------| -| INTERNATIONAL TELEPHONE CONNECTIONS AND CIRCUITS | G.100–G.199 | -| GENERAL CHARACTERISTICS COMMON TO ALL ANALOGUE CARRIER-TRANSMISSION SYSTEMS | G.200–G.299 | -| INDIVIDUAL CHARACTERISTICS OF INTERNATIONAL CARRIER TELEPHONE SYSTEMS ON METALLIC LINES | G.300–G.399 | -| GENERAL CHARACTERISTICS OF INTERNATIONAL CARRIER TELEPHONE SYSTEMS ON RADIO-RELAY OR SATELLITE LINKS AND INTERCONNECTION WITH METALLIC LINES | G.400–G.449 | -| COORDINATION OF RADIOTELEPHONY AND LINE TELEPHONY | G.450–G.499 | -| TRANSMISSION MEDIA AND OPTICAL SYSTEMS CHARACTERISTICS | G.600–G.699 | -| DIGITAL TERMINAL EQUIPMENTS | G.700–G.799 | -| DIGITAL NETWORKS | G.800–G.899 | -| DIGITAL SECTIONS AND DIGITAL LINE SYSTEM | G.900–G.999 | -| MULTIMEDIA QUALITY OF SERVICE AND PERFORMANCE – GENERIC AND USER-RELATED ASPECTS | G.1000–G.1999 | -| TRANSMISSION MEDIA CHARACTERISTICS | G.6000–G.6999 | -| DATA OVER TRANSPORT – GENERIC ASPECTS | G.7000–G.7999 | -| PACKET OVER TRANSPORT ASPECTS | G.8000–G.8999 | -| Ethernet over Transport aspects | G.8000–G.8099 | -| MPLS over Transport aspects | G.8100–G.8199 | -| Synchronization, quality and availability targets | G.8200–G.8299 | -| Mobile network transport aspects | G.8300–G.8399 | -| Service Management | G.8600–G.8699 | -| ACCESS NETWORKS | G.9000–G.9999 | - -*For further details, please refer to the list of ITU-T Recommendations.* - -# Recommendation ITU-T G.827.2/Y.1369.2 - -# Precision time protocol telecom profile for phase/time synchronization with partial timing support from the network - -## Summary - -Recommendation ITU-T G.827.2/Y.1369.2 contains the ITU-T precision time protocol (PTP) profile for phase/time distribution with partial timing support from the network (unicast mode). It provides the necessary details to utilize IEEE 1588 in a manner consistent with the architecture described in Recommendation ITU-T G.827.5/Y.1369. This Recommendation defines the PTP profile for unicast mode only. Future editions of this Recommendation may contain a separate profile for a mixed unicast/multicast case. - -## History - -| Edition | Recommendation | Approval | Study Group | Unique ID* | -|---------|--------------------------------------|------------|-------------|---------------------------------------------------------------------------| -| 1.0 | ITU-T G.827.2/Y.1369.2 | 2016-06-22 | 15 | 11.1002/1000/12833 | -| 1.1 | ITU-T G.827.2/Y.1369.2 (2016) Amd. 1 | 2017-08-29 | 15 | 11.1002/1000/13330 | -| 1.2 | ITU-T G.827.2/Y.1369.2 (2016) Amd. 2 | 2018-03-16 | 15 | 11.1002/1000/13556 | -| 1.3 | ITU-T G.827.2/Y.1369.2 (2016) Amd. 3 | 2019-08-29 | 15 | 11.1002/1000/14018 | -| 2.0 | ITU-T G.827.2/Y.1369.2 | 2020-03-15 | 15 | 11.1002/1000/14216 | -| 2.1 | ITU-T G.827.2/Y.1369.2 (2020) Amd. 1 | 2020-11-13 | 15 | 11.1002/1000/14544 | -| 2.2 | ITU-T G.827.2/Y.1369.2 (2020) Amd. 2 | 2021-06-29 | 15 | 11.1002/1000/14710 | -| 2.3 | ITU-T G.827.2/Y.1369.2 (2020) Amd. 3 | 2022-02-13 | 15 | 11.1002/1000/14906 | -| 3.0 | ITU-T G.827.2/Y.1369.2 | 2022-11-13 | 15 | 11.1002/1000/15132 | - -## Keywords - -IEEE 1588, phase, profile, PTP, time. - ---- - -\* To access the Recommendation, type the URL in the address field of your web browser, followed by the Recommendation's unique ID. For example, . - -## FOREWORD - -The International Telecommunication Union (ITU) is the United Nations specialized agency in the field of telecommunications, information and communication technologies (ICTs). The ITU Telecommunication Standardization Sector (ITU-T) is a permanent organ of ITU. ITU-T is responsible for studying technical, operating and tariff questions and issuing Recommendations on them with a view to standardizing telecommunications on a worldwide basis. - -The World Telecommunication Standardization Assembly (WTSA), which meets every four years, establishes the topics for study by the ITU-T study groups which, in turn, produce Recommendations on these topics. - -The approval of ITU-T Recommendations is covered by the procedure laid down in WTSA Resolution 1. - -In some areas of information technology which fall within ITU-T's purview, the necessary standards are prepared on a collaborative basis with ISO and IEC. - -## NOTE - -In this Recommendation, the expression "Administration" is used for conciseness to indicate both a telecommunication administration and a recognized operating agency. - -Compliance with this Recommendation is voluntary. However, the Recommendation may contain certain mandatory provisions (to ensure, e.g., interoperability or applicability) and compliance with the Recommendation is achieved when all of these mandatory provisions are met. The words "shall" or some other obligatory language such as "must" and the negative equivalents are used to express requirements. The use of such words does not suggest that compliance with the Recommendation is required of any party. - -## INTELLECTUAL PROPERTY RIGHTS - -ITU draws attention to the possibility that the practice or implementation of this Recommendation may involve the use of a claimed Intellectual Property Right. ITU takes no position concerning the evidence, validity or applicability of claimed Intellectual Property Rights, whether asserted by ITU members or others outside of the Recommendation development process. - -As of the date of approval of this Recommendation, ITU had received notice of intellectual property, protected by patents/software copyrights, which may be required to implement this Recommendation. However, implementers are cautioned that this may not represent the latest information and are therefore strongly urged to consult the appropriate ITU-T databases available via the ITU-T website at . - -© ITU 2023 - -All rights reserved. No part of this publication may be reproduced, by any means whatsoever, without the prior written permission of ITU. - -## Table of Contents - -###### Page - -| | | | -|------|---------------------------------------------------------------------------------------------------------------------|----| -| 1 | Scope ..... | 1 | -| 2 | References..... | 1 | -| 3 | Definitions ..... | 2 | -| 3.1 | Terms defined elsewhere ..... | 2 | -| 3.2 | Terms defined in this Recommendation..... | 2 | -| 4 | Abbreviations and acronyms ..... | 2 | -| 5 | Conventions ..... | 4 | -| 6 | Use of PTP for phase/time distribution ..... | 5 | -| 6.1 | High-level design requirements..... | 5 | -| 6.2 | PTP modes and options ..... | 6 | -| 6.3 | PTP modes..... | 8 | -| 6.4 | PTP mapping ..... | 9 | -| 6.5 | Message rates..... | 9 | -| 6.6 | Unicast message negotiation ..... | 10 | -| 6.7 | Alternate BMCA, telecom slave model and master selection process ..... | 12 | -| 6.8 | Phase/time traceability information..... | 20 | -| 6.9 | Use of alternate master flag ..... | 22 | -| 7 | ITU-T PTP profile for phase/time distribution with partial timing support from the network ..... | 23 | -| 8 | Security aspects ..... | 23 | -| | Annex A – ITU-T PTP profile for time distribution with partial timing support from the network (unicast mode) ..... | 24 | -| A.1 | Profile identification ..... | 24 | -| A.2 | PTP attribute values..... | 24 | -| A.3 | PTP options ..... | 30 | -| A.4 | Best master clock algorithm options ..... | 31 | -| A.5 | Path delay measurement option (delay request/delay response) ..... | 31 | -| A.6 | Configuration management options ..... | 31 | -| A.7 | Clock identity format..... | 32 | -| A.8 | Security aspects ..... | 32 | -| A.9 | Other optional features of IEEE 1588 ..... | 32 | -| A.10 | PTP common header flags..... | 32 | -| A.11 | Profile version compatibility ..... | 33 | -| | Annex B – Options to establish the PTP topology with the Alternate BMCA..... | 35 | -| | Annex C – Inclusion of an external phase/time input interface on a PTP clock..... | 36 | -| | Annex D – TLV for PTP interface rate (optional)..... | 37 | -| | Annex E – Synchronization uncertain indication (optional)..... | 39 | - -| | Page | -|-------------------------------------------------------------------------------------------------|------| -| Annex F – Mapping from PTP clockClass values to quality levels..... | 40 | -| Appendix I – Considerations on the use of priority2 ..... | 42 | -| Appendix II – Considerations on a T-TSC-A or T-TSC-P connected to an end application .. | 43 | -| Appendix III – PTP monitoring backup scenario example..... | 44 | -| Appendix IV – Description of PTP clock modes and associated contents of Announce messages ..... | 46 | -| Appendix V – BMCA cycling between masters..... | 47 | -| V.1    Scenario where a PTP clock's BMCA cycles between two masters ..... | 47 | -| V.2    Approaches to avoid a PTP clock's BMCA from cycling between two masters..... | 48 | -| Appendix VI – Considerations of PTP over IP transport in ring topologies ..... | 49 | -| Appendix VII – Considerations on the configuration of PTSF-lossOfTimingMessages ..... | 55 | -| Appendix VIII – Operations over link aggregation ..... | 56 | -| VIII.1  Functional model..... | 56 | -| VIII.2  Scenario ..... | 57 | -| Appendix IX – Considerations on the use of [IEEE 1588-2019] ..... | 58 | -| Appendix X – Considerations on selecting time out values ..... | 59 | -| X.1    Example receipt timeout calculation (Dynamic message rate) ..... | 59 | -| X.2    Example receipt timeout calculation (Fixed message rate)..... | 60 | -| X.3    Range of receipt timeout ..... | 60 | -| Bibliography..... | 61 | - -# Recommendation ITU-T G.827.2/Y.1369.2 - -# Precision time protocol telecom profile for phase/time synchronization with partial timing support from the network - -# 1 Scope - -This Recommendation specifies a profile for telecommunication applications based on [IEEE 1588] precision time protocol (PTP). The profile specifies the IEEE 1588 functions that are necessary to ensure network element interoperability for the delivery of accurate phase/time (and frequency) synchronization. The profile is based on the use of partial timing support (PTS) or assisted partial timing support (APTS) from the network architecture as described in [ITU-T G.827.5] and definitions described in [ITU-T G.8260]. - -It is assumed that this profile will be used in well-planned cases where network behaviour and performance can be constrained within well-defined limits, including limits on static asymmetry. Control of static asymmetries can be achieved in case of assisted partial timing support. Use of this profile in unassisted mode would require careful considerations on how to control static asymmetries. Additional considerations are included in [ITU-T G.827.1.2]. This version of the profile specifies the high-level design requirements, modes of operation for the exchange of PTP messages, the PTP protocol mapping, the best master clock algorithm (BMCA) options, as well as the PTP protocol configuration parameters. - -At the time of publication of this profile, performance analysis, network limits, and clocks used in the profile, namely boundary and slave clocks, are for further study. - -This Recommendation also specifies some aspects necessary for use in a telecom environment that are outside the scope of the PTP profile but complement it. - -An implementation compliant with this profile can claim compliance with either IEEE Std 1588-2008 [IEEE 1588-2008] or IEEE Std 1588-2019 [IEEE 1588-2019]. Considerations on the use of one or the other profile are provided in Appendix IX. Compliance for a specific implementation with either the [IEEE1588-2008] or [IEEE1588-2019] versions of the standard should be stated when referring to this profile. - -## 2 References - -The following ITU-T Recommendations and other references contain provisions which, through reference in this text, constitute provisions of this Recommendation. At the time of publication, the editions indicated were valid. All Recommendations and other references are subject to revision; users of this Recommendation are therefore encouraged to investigate the possibility of applying the most recent edition of the Recommendations and other references listed below. A list of the currently valid ITU-T Recommendations is regularly published. The reference to a document within this Recommendation does not give it, as a stand-alone document, the status of a Recommendation. - -- [ITU-T G.781] Recommendation ITU-T G.781 (2020), *Synchronization layer functions*. -- [ITU-T G.810] Recommendation ITU-T G.810 (1996), *Definitions and terminology for synchronization networks*. -- [ITU-T G.8260] Recommendation ITU-T G.8260 (2022), *Definitions and terminology for synchronization in packet networks*. -- [ITU-T G.8264] Recommendation ITU-T G.8265/Y.1365 (2010), *Architecture and requirements for packet-based frequency delivery*. - -- [ITU-T G.8265.1] Recommendation ITU-T G.8265.1/Y.1365.1 (2022), *Precision time protocol telecom profile for frequency synchronization.* -- [ITU-T G.8271] Recommendation ITU-T G.8271/Y.1366 (2020), *Time and phase synchronization aspects of telecommunication networks.* -- [ITU-T G.8271.2] Recommendation ITU-T G.8271.2/Y.1366.2 (2021), *Network limits for time synchronization in packet networks with partial timing support from the network.* -- [ITU-T G.8272] Recommendation ITU-T G.8272/Y.1367 (2018), *Timing characteristics of primary reference time clocks.* -- [ITU-T G.8272.1] Recommendation ITU-T G.8272.1/Y.1367.1 (2016), *Timing characteristics of enhanced primary reference time clocks.* -- [ITU-T G.8273] Recommendation ITU-T G.8273/Y.1368 (2018), *Framework of phase and time clocks.* -- [ITU-T G.8273.4] Recommendation ITU-T G.8273.4/Y.1368.4 (2020), *Timing characteristics of telecom boundary clocks and telecom time slave clocks for use with partial timing support from the network.* -- [ITU-T G.8275] Recommendation ITU-T G.8275/Y.1369 (2020), *Architecture and requirements for packet-based time and phase distribution.* -- [ITU-T G.8275.1] Recommendation ITU-T G.8275.1/Y.1369.1 (2022), *Precision time protocol telecom profile for phase/time synchronization with full timing support from the network.* -- [IEEE 1588] Either [IEEE 1588-2008] or [IEEE 1588-2019] depending on the specific implementation. See clause 5 Conventions for more details. -- [IEEE 1588-2008] IEEE 1588-2008, IEEE Standard for a Precision Clock Synchronization Protocol for Networked Measurement and Control Systems. -- [IEEE 1588-2019] IEEE 1588-2019, IEEE Standard for a Precision Clock Synchronization Protocol for Networked Measurement and Control Systems. - -# 3 Definitions - -### 3.1 Terms defined elsewhere - -The terms and definitions used in this Recommendation are contained in [ITU-T G.810] and [ITU-T G.8260]. - -### 3.2 Terms defined in this Recommendation - -None. - -# 4 Abbreviations and acronyms - -This Recommendation uses the following abbreviations and acronyms: - -| | | -|-------|---------------------------------------| -| APTS | Assisted Partial Timing Support | -| BC | Boundary Clock | -| BMCA | Best Master Clock Algorithm | -| ePRTC | Enhanced Primary Reference Time Clock | -| EUI | Extended Unique Identifier | - -| | | -|----------|--------------------------------------------------------------| -| GM | GrandMaster | -| GNSS | Global Navigation Satellite System | -| IP | Internet Protocol | -| MA-L | MAC Address – Large | -| MA-M | MAC Address – Medium | -| MA-S | MAC Address – Small | -| OC | Ordinary Clock | -| OUI | Organizationally Unique Identifier | -| ParentDS | Parent Data Set | -| PDV | Packet Delay Variation | -| PRC | Primary Reference Clock | -| PRS | Primary Reference Source | -| PRTC | Primary Reference Time Clock | -| PTP | Precision Time Protocol | -| PTPVAR | PTP Variance | -| PTS | Partial Timing Support | -| PTSF | Packet Timing Signal Fail | -| QL | Quality Level | -| SDH | Synchronous Digital Hierarchy | -| SF | Signal Fail | -| SSM | Synchronization Status Message | -| SSU | Synchronization Supply Unit | -| SSU-A | Primary level SSU | -| SSU-B | Secondary level SSU | -| ST2 | Stratum 2 | -| ST3E | Stratum 3 Enhanced | -| T-BC-A | Telecom Boundary Clock for Assisted partial timing support | -| T-BC-P | Telecom Boundary Clock for Partial timing support | -| TC | Transparent Clock | -| T-GM | Telecom Grandmaster | -| TLV | Type, Length, Value | -| T-TC-P | Telecom Transparent Clock for Partial timing support | -| T-TSC-A | Telecom Time Slave Clock for Assisted partial timing support | -| T-TSC-P | Telecom Time Slave Clock for Partial timing support | -| UDP | User Datagram Protocol | -| VLAN | Virtual Local Area Network | - -# 5 Conventions - -Within this Recommendation, the following conventions are used: the term PTP refers to the PTP protocol defined in [IEEE 1588]. PTP messages used within this Recommendation are defined in [IEEE 1588] and are identified using italicized text. - -The term telecom grandmaster (T-GM) refers to a device consisting of a grandmaster (GM) clock as defined in [IEEE 1588] and this Recommendation, with additional performance characteristics for further study. - -The term telecom boundary clock for partial timing support (T-BC-P) refers to a device consisting of a boundary clock (BC) as defined in [IEEE 1588], with additional performance characteristics as defined in [ITU-T G.8273.4]. The term telecom boundary clock for assisted partial timing support (T-BC-A) refers to a device consisting of a boundary clock (BC) as defined in [IEEE 1588] that is assisted by a local time reference (e.g., a PRTC or GNSS-based time source) as a primary source of time, with additional performance characteristics as defined in [ITU-T G.8273.4]. - -NOTE 1 – In comparing the operation of the T-BC-P and the T-BC-A, the T-BC-P uses PTP input as the primary source of synchronization. The T-BC-A is targeted for the APTS scenario described in [ITU-T G.8271.2], where the PTP input is used only as a secondary source of synchronization to hold the time for up to 72 hours, and is not intended to use PTP as the primary timing source. - -The term telecom transparent clock for partial timing support (T-TC-P) refers to a device consisting of a transparent clock (TC) as defined in [IEEE 1588], with additional performance characteristics for further study. - -The term telecom time slave clock for partial timing support (T-TSC-P) refers to a device consisting of either an ordinary clock (OC), with one PTP port, or a boundary clock (BC), with multiple PTP ports, as defined in [IEEE 1588] and this Recommendation, that does not support providing synchronization using PTP to other PTP clocks in the PTP domain, and with additional performance characteristics as defined in [ITU-T G.8273.4]. - -The term telecom time slave clock for assisted partial timing support (T-TSC-A) refers to a T-TSC-P that is assisted by a local time reference (e.g., a PRTC or GNSS-based time source) as a primary source of time, with additional performance characteristics as defined in [ITU-T G.8273.4]. Note that in the case of a T-TSC-A or T-TSC-P with multiple PTP ports (BC), only one PTP port can be in PTP SLAVE state at any instant in time based on the BMCA. Other PTP ports not in the PTP SLAVE state may actively exchange synchronization messages with other PTP clocks populated in the unicast master table using unicast negotiation. - -NOTE 2 – In comparing the operation of the T-TSC-P and the T-TSC-A, the T-TSC-P uses the PTP input as the primary source of synchronization. The T-TSC-A is targeted for the APTS scenario described in [ITU-T G.8271.2], where the PTP input is used only as a secondary source of synchronization to hold the time for up to 72 hours, and is not intended to use PTP as the primary timing source. - -The term primary reference time clock (PRTC) refers to the clock defined in [ITU-T G.8272]. The term enhanced primary reference time clock (ePRTC) refers to an enhanced version of the PRTC, which is being studied. - -In this Recommendation, T-BC-P/A means T-BC-P or T-BC-A. Likewise, T-TSC-P/A means T-TSC-P or T-TSC-A. - -Within this recommendation, some requirements are stated as requiring compliance to [IEEE 1588]. For implementations compliant to [IEEE 1588-2008], the reference to [IEEE 1588] means compliance to [IEEE 1588-2008]. For implementations compliant to [IEEE 1588-2019], the reference to [IEEE 1588] means compliance to [IEEE 1588-2019]. Some of these references to [IEEE 1588] include a specific clause number. In these cases, the clause number is the same in both [IEEE 1588-2008] and [IEEE 1588-2019]. If the requirements are in different clauses in the two - -versions of IEEE 1588, then the text of this Recommendation shall include the specific clause for [IEEE 1588-2008] and the specific cause for [IEEE 1588-2019]. - -# 6 Use of PTP for phase/time distribution - -The [IEEE 1588] standard defines the precision time protocol designed to enable accurate time transfer. It introduces the concept of "profile", whereby aspects of the protocol may be selected and specified for a particular application. - -A PTP profile was defined by ITU-T in [ITU-T G.8265.1] to address applications requiring frequency synchronization only. An additional PTP profile was defined by ITU-T in [ITU-T G.8275.1] in order to allow the distribution of phase/time with full timing support from the network. This Recommendation defines another PTP profile to allow the distribution of phase and time with partial timing support (PTS) from the network. - -The [IEEE 1588] telecom profile defined within this Recommendation is intended to be used by telecom applications requiring accurate phase and time synchronization. It covers applications where there is need for phase alignment and/or time of day. It supports the specific architecture described in [ITU-T G.8275] in order to allow the distribution of phase/time with PTS from the network and is based on the 2008 version of PTP defined in [IEEE 1588]. This includes the case of assisted partial timing support (APTS). - -This profile uses only the unicast mode. - -In order to claim compliance with the telecom profile, the requirements of this Recommendation and the relevant requirements of [IEEE 1588], as referenced in Annex A, must be met. - -The detailed aspects related to the telecom profile are described in the following clauses, while the profile itself is contained in Annex A. It follows the general rules for profile specification developed in [IEEE 1588]. - -This PTP telecom profile defines the [IEEE 1588] parameters to be used, in order to guarantee protocol interoperability between implementations and specifies the optional features, default values of configurable attributes and mechanisms that must be supported. However, it does not guarantee that the performance requirements of a given application will be met. Those performance aspects are currently under study and imply additional elements beyond the content of the PTP profile itself. These are planned to be addressed in other ITU-T Recommendations. - -## 6.1 High-level design requirements - -[IEEE 1588] states: - -*"The purpose of a PTP profile is to allow organizations to specify specific selections of attribute values and optional features of PTP that, when using the same transport protocol, inter-work and achieve a performance that meets the requirements of a particular application."* - -For operation in a telecom network, some additional criteria are also required to be consistent with standard telecom synchronization practices. With that in mind, the PTP profile for time and phase distribution must meet the following high-level requirements: - -- 1) Mechanisms must be specified to allow interoperability between the various phase/time clocks belonging to the architecture defined in [ITU-T G.8275] and described in [ITU-T G.8273]. -- 2) Mechanisms must permit consistent operation over managed wide area telecom networks. -- 3) Packet-based mechanisms must allow the synchronization network to be designed and configured in a fixed arrangement. - -- 4) Protection schemes used by packet-based systems must be based on standard telecom operational practice and allow T-TSC-P and T-TSC-A to have the ability to take phase and time from multiple geographically separate T-GM clocks. -- 5) Phase/time reference source selection based on received phase/time traceability and local priority, as well as automatic establishment of the phase/time synchronization network topology, should be permitted. - -### 6.2 PTP modes and options - -#### 6.2.1 PTP Domains - -A domain consists of a logical grouping of clocks communicating with each other using the PTP protocol. - -PTP domains are used to partition a network within an administrative domain. The PTP messages and data sets are associated with a domain and therefore the PTP protocol is independent for different domains. - -In this PTP telecom profile, the default PTP domain number is 44, and the range of applicable PTP domain numbers is {44 – 63}. - -NOTE – This range has been selected from the user-defined PTP domain number range defined in [IEEE 1588]. Although non-overlapping ranges have been considered for the different PTP telecom profiles so that interactions between the profiles are prevented, nothing precludes another industry from using the same user-defined PTP domain number range when defining a non-telecom PTP profile. It is the responsibility of the network operator to identify if the risk of unintentional interactions between PTP profiles exists, and to take the necessary actions to prevent such behaviour. - -#### 6.2.2 PTP messages - -[IEEE 1588] defines two categories of message types: event and general PTP messages. The two types differ in that event messages are timed messages and require or contain an accurate timestamp. General message types do not require accurate timestamps. - -[IEEE 1588] defines the following message types: *Sync*, *Delay\_Req* (i.e., "delay request"), *Announce*, *Follow\_Up*, *Delay\_Resp* (i.e., "delay response"), *Pdelay\_Req*, *Pdelay\_Resp*, and *Pdelay\_Resp\_Follow\_Up*, *Management* and *Signalling*. - -*Sync*, *Delay\_Req*, *Announce*, *Follow\_Up*, *Delay\_Resp*, and *Signalling* messages are used in this profile. - -*Pdelay\_Req*, *Pdelay\_Resp*, and *Pdelay\_Resp\_Follow\_Up* messages are not used in this profile. - -The use of *Management* messages is for further study. - -#### 6.2.3 Types of PTP clocks supported in the profile - -The OC and BC according to [IEEE 1588] are used in this profile. - -There are two types of OCs: - -- 1) OC that can only be a grandmaster (T-GM according to the architecture defined in [ITU-T G.8275], and as included in [ITU-T G.8272]). -- 2) OC that can only be a slave, i.e., slave-only OC (T-TSC-P with only one port or T-TSC-A with only one port according to the architecture defined in [ITU-T G.8275]). The clock specifications for T-TSC-P and T-TSC-A are defined in [ITU-T G.8273.4]. - -There are three types of BCs: - -- 1) BC that can only be a grandmaster (T-GM according to the architecture defined in [ITU-T G.8275], and as included in [ITU-T G.8272]). - -- 2) BC that can become a grandmaster and can also be slaved to another PTP clock (T-BC-P and T-BC-A according to architecture defined in [ITU-T G.8275]). The clock specifications for the T-BC-P and T-BC-A are defined in [ITU-T G.8273.4]. -- 3) BC that can only be a slave (T-TSC-P with more than one port or T-TSC-A with more than one port according to the architecture defined in [ITU-T G.8275]). The clock specifications for T-TSC-P and T-TSC-A are defined in [ITU-T G.8273.4]. - -NOTE – T-GM and GM are different concepts; GM is a status defined in [IEEE 1588] that a PTP clock may obtain if it wins the BMCA, while T-GM is a type of clock defined in the [ITU-T G.8275] architecture. - -The mapping between these PTP clockTypes and the phase/time clocks defined in the [ITU-T G.8275] architecture is described in Table 1. - -**Table 1 – Mapping between [ITU-T G.8275.2] deviceTypes and PTP clockTypes** - -| deviceType from [ITU-T G.8275.2] | Description | clockType from [IEEE 1588] | -|----------------------------------|--------------------------------------------------------------------------------------------------------------------------------------------------------|----------------------------| -| T-GM | Master-only ordinary clock (master with a single PTP port, cannot be slaved to another PTP clock) | OC | -| | Master-only boundary clock (master with multiple PTP ports, cannot be slaved to another PTP clock) | BC
(Note 1) | -| T-BC-P
(partial) | Boundary clock (may become a GM, or may be slaved to another PTP clock) | BC | -| T-BC-A
(assisted partial) | Boundary clock assisted by a local time reference that is used as a primary source of time (may become a GM, or may be slaved to another PTP clock) | BC
(Note 2) | -| T-TSC-P
(partial) | Slave-only, single port, ordinary clock (always a slave) | OC | -| | PTP clock at the end of the PTP synchronization chain, multiple port clock | BC
(Note 1) | -| T-TSC-A
(assisted partial) | Slave-only, single port, ordinary clock (always a slave) assisted by a local time reference that is used as a primary source of time | OC
(Note 2) | -| | PTP clock at the end of the PTP synchronization chain, multiple port clock assisted by a local time reference that is used as a primary source of time | BC
(Note 1)
(Note 2) | - -NOTE 1 – According to [IEEE 1588], a clock that has multiple PTP ports is by definition a boundary clock. -NOTE 2 – Examples of a local time reference: PRTC or GNSS-based time source. - -##### 6.2.3.1 Dataset member for PTP clocks supported in the profile - -A management system can configure and/or read the deviceType of an equipment; this allows the management node to configure other properties that are specific for that type of clock implemented in the equipment that is being deployed in the network. An equipment may support different types of clocks, and therefore deviceType is a configurable attribute. - -NOTE – The deviceType for a T-TSC-A that loses its local time reference will not change to reflect a T-TSC-P, it is still considered a T-TSC-A, as PTP is used for backup, and it is expected that the local time reference will be restored. - -The data type for deviceType is Enumeration8, using the enumerated value per Table 2. - -**Table 2 – deviceType enumeration value** - -| deviceType | Enumeration value (hex) | -|-------------------|--------------------------------| -| T-GM | 0x20 | -| T-BC-P | 0x21 | -| T-BC-A | 0x22 | -| T-TSC-P | 0x23 | -| T-TSC-A | 0x24 | - -### 6.3 PTP modes - -[IEEE 1588] describes several modes of operation between a master-port (which is a PTP in MASTER state) and a slave-port (which is a PTP port in SLAVE state). The term grant-port refers to a PTP port granting and providing PTP message service, and the term request-port refers to a PTP port requesting and receiving PTP message service. Typically, the grant-port is a master-port and the request-port is a slave-port. Information related to grant-ports and request-ports in other PTP states will be included in a future version of this Recommendation related to PTP clocks with multiple PTP ports. - -NOTE 1 – A grant-port may be in the MASTER state, PASSIVE state, LISTENING state, PRE\_MASTER state, UNCALIBRATED state, or SLAVE state. (but not INITIALIZING, FAULTY, or DISABLED state). - -NOTE 2 – A request-port may be in the MASTER state, PASSIVE state, LISTENING state, PRE\_MASTER state, UNCALIBRATED state, or SLAVE state. (but not INITIALIZING, FAULTY, or DISABLED state). - -This clause describes these modes with respect to functionality needed to be compliant with this profile. - -#### 6.3.1 One-way versus two-way operation - -A PTP master-port or grant-port compliant with the profile must be capable of supporting one-way and two-way timing transfers. For APTS, since only PTP synchronization may be required, a slave-port or request-port may only utilize one-way mode, or may utilize two-way mode, but is not required to support both methods; otherwise for PTS, a slave-port or request-port must utilize two-way. - -NOTE – In the APTS case, even if performance objectives are specified by means of two-way metrics, this does not prevent the slave-port or request-port from utilizing one-way mode, although for a more accurate interpretation of how the network characteristics relates to the expected performance of the clock, two-way operation may be preferred. - -#### 6.3.2 One-step versus two-step clock mode - -PTP defines two types of clock behaviour: the "one-step clock" and the "two-step clock". In a one-step clock, the precise timestamp is transported directly in the *Sync* message. In a two-step clock, a *Follow\_Up* message is used to carry the precise timestamp of the corresponding *Sync* message. The use of *Follow\_Up* messages is optional in the PTP protocol. - -The one-step clock approach enables equipment to reduce significantly the number of PTP messages sent by the master-port or grant-port and relax the master-port or grant-port capacities. - -However, there might be situations where the two-step clock approach might be required (e.g., when some security features are required). These situations are for further study. - -Both one-step and two-step clocks are allowed in the profile. A PTP master-port or grant-port compliant with the profile may use either a one-step clock or a two-step clock or both. - -NOTE – The performance of the PTP timing flow generated by the master-port or grant-port with those two approaches is for further study. - -To be compliant with [IEEE 1588], a slave-port or request-port must be capable of handling both one-step clock and two-step clock, without any particular configuration. - -As per [IEEE 1588], when a two-step clock is used, the value of the flag "twoStepFlag" shall be TRUE to indicate that a *Follow\_up* message will follow the *Sync* message, and that the slave-port or request-port must not consider the originTimestamp embedded in the *Sync* message. When a one-step clock is used, the value of the flag "twoStepFlag" shall be FALSE, and the slave-port or request-port must consider the originTimestamp embedded in the *Sync* message in this case. - -#### 6.3.3 Unicast versus multicast mode - -PTP allows the use of unicast and multicast modes for the transmission of the PTP messages. - -For the PTP profile specified in Annex A, the unicast mode is used for all the PTP messages. - -A master-port or grant-port compliant with the PTP profile specified in Annex A must support the unicast mode. - -A slave-port or request-port compliant with the PTP profile specified in Annex A must support the unicast mode. - -### 6.4 PTP mapping - -This PTP telecom profile is based on the PTP mapping *Transport of PTP over User Datagram Protocol over Internet Protocol Version 4* [IEEE 1588] and *Transport of PTP over User Datagram Protocol over Internet Protocol Version 6* [IEEE 1588]. - -A master-port, grant-port, slave-port, or a request-port compliant with the profile described in this Recommendation may be compliant with *Transport of PTP over User Datagram Protocol over Internet Protocol Version 4* [IEEE 1588] and must be compliant with *Transport of PTP over User Datagram Protocol over Internet Protocol Version 6* [IEEE 1588]. - -NOTE – The use of the Internet Protocol (IP)/user datagram protocol (UDP) mapping is to facilitate the use of IP addressing. It does not imply that the PTP flow can be carried over an unmanaged packet network. It is assumed that a well-controlled packet network will be used to control and minimize packet delay variation. - -### 6.5 Message rates - -The message rate values are only defined for protocol interoperability purposes. It is not expected that any slave clock shall meet the relevant target performance requirements at all packet rates within the given range, specifically at the lower packet rate. The appropriate value depends on the clock characteristics and on the target performance requirements. Different packet rate needs may also apply during the stabilization period. - -NOTE – A specific slave clock implementation, in order to meet its target performance requirements, may support a subset of the message rates within the ranges noted below. A master-port or grant-port, on the other hand, is required to support the full range of message transmission rates. Unless an implementation specifies otherwise, the default value listed below is assumed to be used. - -Within the scope of the profile, the following messages can be used and the corresponding indicated range of rates shall be respected for unicast messages: - -- *Sync* messages (if used, *Follow\_up* messages will have the same rate) – minimum rate: 1 packet-per-second, maximum rate: 128 packets-per-second. -- *Delay\_Req/Delay\_Resp* messages – minimum rate: 1 packet-per-second, maximum rate: 128 packets-per-second. -- *Announce* messages – minimum rate: 1 packet-per-second, maximum rate: eight packets-per-second. -- *Signalling* messages – no rate is specified. - -The use of *Management* messages is for further study. - -The requirements of clause 16.1.1 of [IEEE 1588] shall also be respected for the transmission of Announce, Sync and Delay\_Req messages. - -### 6.6 Unicast message negotiation - -Within a telecommunication network, there are benefits to allowing PTP request-ports to request the synchronization service from PTP grant-ports. [IEEE 1588] defines a unicast message negotiation mechanism to allow request-ports to request this service within a unicast environment. This profile supports the unicast message negotiation in accordance with [IEEE 1588] and as described below. - -PTP clocks compliant with the profile must support the unicast message negotiation mechanism as per clause 16.1 of [IEEE 1588] and as described in this clause. - -When using the unicast mode, PTP request-ports request synchronization service by sending a PTP *Signalling* message in unicast, containing the REQUEST\_UNICAST\_TRANSMISSION type, length, value (TLV), to the IP address of the selected PTP grant-port. - -NOTE 1 – In this telecom profile, unicast connection establishment without negotiation is for further study. - -The *Signalling* message containing the REQUEST\_UNICAST\_TRANSMISSION TLV is periodically renewed. - -When initiating unicast negotiation with a grant-port, a request-port can use all 1's as the initial value for the targetPortIdentity field of the *Signalling* message. Based on the response from the grant-port, the request-port can then learn the clockIdentity and portNumber of the grant-port and may use this in any subsequent *Signalling* message. The request-port may also continue to use all 1's. Similarly, the grant-port may either learn and use the clockIdentity and portNumber of the request-port, or use all 1's value for the targetPortIdentity field of the *Signalling* messages that it sends. Both grant-port and request-port must be prepared to handle both situations in reception, i.e., receive PTP *Signalling* messages with either their own clockIdentity and portNumber or with all 1's values for the targetPortIdentity field. A request-port should stop using a previously learned clockIdentity and portNumber when the established unicast session either expires or is cancelled, and the request-port has exhausted the re-try process described in clause 6.6. As indicated above, when a unicast session is granted, a grant-port may use (a) all 1's, or (b) the clockIdentity and portNumber from the sourcePortIdentity field of the received unicast session request, as the targetPortIdentity in the response. - -The logInterMessagePeriod can be configured to adjust the requested transmission rate of *Sync*, *Announce* and *Delay\_Resp* messages. - -The configurable range for the logInterMessagePeriod is given in Annex A for all the relevant messages. - -The durationField value in each REQUEST\_UNICAST\_TRANSMISSION TLV has a default initialization value of 300 seconds and a configurable range of 60 to 1000 seconds. - -In the event that a PTP grant-port is unable to meet a given request-port request, it should deny the request entirely rather than offer the request-port less than it originally requested. - -In the event of being denied service by a grant-port, or receiving no response to the service request: - -- A request-port should wait a minimum of one second (after denial or no response received) before issuing a new unicast service request for that message type to the same grant-port. -- If a request-port has issued three service requests for the same message type with a "grant denied" response, it should either: - -- cancel any granted unicast service it may have for other message types, and request service from a different grant-port, or -- wait a further 60 seconds before re-issuing the request to the same grant-port. - -An example of the message exchange to initiate the unicast synchronization service is shown in Figure 1. The timing diagram example represents the exchange of unicast messages for a one-step clock (i.e., no *Follow\_up* messages) using one-way mode (i.e., no *Delay\_Req* or *Delay\_Resp*). - -The example shows a unicast negotiation process for a packet request-port sending *Signalling* messages for *Announce* and *Sync* requests; a packet grant-port granting the packet request-port the requested message rates; a packet grant-port transmitting the requested *Announce* and *Sync* message rates and the renewal of *Announce* and *Sync* before the expiration of *durationField*. - -Note that several timing diagrams could be represented based on various exchanges of message types, the use of single or concatenated TLVs in *Signalling* messages, the use of different *durationFields* for each message type, etc. Figure 1 provides an example of message interaction; it is for illustrative purposes only and does not represent a particular implementation. - -![Figure 1 – Unicast negotiation example. A timing diagram showing message exchanges between a Request-port and a Grant-port. The diagram illustrates the initial negotiation and subsequent renewal of Announce and Sync messages. The Request-port sends Signalling (Announce-request) and Signalling (Sync-request) messages. The Grant-port responds with Signalling (Announce-grant) and Signalling (Sync-grant) messages. The Grant-port then transmits Announce and Sync messages. The Unicast renewal interval is shown on the Request-port side, and the Announce duration interval and Sync duration interval are shown on the Grant-port side. The diagram includes two sets of message exchanges, with the second set starting after the first set's renewal interval begins. The text 'G.8275.2-Y.1369.2(16)_F01' is in the bottom right corner.](df82d77a0d2637cbf2da9ea920a554fa_img.jpg) - -Figure 1 – Unicast negotiation example. A timing diagram showing message exchanges between a Request-port and a Grant-port. The diagram illustrates the initial negotiation and subsequent renewal of Announce and Sync messages. The Request-port sends Signalling (Announce-request) and Signalling (Sync-request) messages. The Grant-port responds with Signalling (Announce-grant) and Signalling (Sync-grant) messages. The Grant-port then transmits Announce and Sync messages. The Unicast renewal interval is shown on the Request-port side, and the Announce duration interval and Sync duration interval are shown on the Grant-port side. The diagram includes two sets of message exchanges, with the second set starting after the first set's renewal interval begins. The text 'G.8275.2-Y.1369.2(16)\_F01' is in the bottom right corner. - -**Figure 1 – Unicast negotiation example** - -PTP request-ports may request several types of PTP messages from a PTP grant-port (e.g., request-port working in two-way mode, which may request *Sync* and *Delay\_Resp* messages, or request-port requesting *Announce* and *Sync* messages from the same grant-port). To request unicast transmission of different PTP message types, and to respond to such requests, [IEEE 1588] allows the use of a single *Signalling* message containing multiple TLVs or the use of multiple *Signalling* messages. Grant-ports and request-ports compliant with this profile must be prepared to handle those two situations. The expected behaviour during the initial negotiation and during the consecutive unicast service renewals is described in the paragraphs that follow. - -Each request for unicast transmission from a specific request-port to a grant-port should start by issuing an *Announce* service type request first for that specific grant-port. Only after the request-port has been granted unicast service for the *Announce* message and received the first unicast *Announce* message from the specified grant-port, can the rest of the service type request take place. Such practice would ensure that the attributes (e.g., clockQuality) and capabilities of the specified grant-port are acceptable from the request-port's perspective before the rest of the services are contracted. - -Upon receiving the first *Announce* message from the grant-port, the first *Signalling* message containing a REQUEST\_UNICAST\_TRANSMISSION TLV issued by the request-port should include all the service types the specific request-port requires from the grant-port using multiple REQUEST\_UNICAST\_TRANSMISSION TLVs. Such practice will reduce the chance that the grant-port will only grant part of the requested services in case it has been over-subscribed (due to simultaneous requests from other request-ports). The grant-port is allowed to respond to this request either with a single *Signalling* message containing multiple TLVs, or with multiple *Signalling* messages (e.g., each containing a single TLV). - -When renewing the unicast services, the request-port, in sending *Signalling* messages (for 'keep-alive' purposes), may either continue to request all service types with a single *Signalling* message containing multiple TLVs, or with multiple independent *Signalling* messages (e.g., each containing a single TLV). The grant-port is allowed to respond to requests either with a single *Signalling* message containing multiple TLVs, or with multiple *Signalling* messages (e.g., each containing a single TLV). - -As defined in [IEEE 1588], in order to receive continuous service, a requester should reissue a request in advance of the end of the grant period. The recommended advance should include sufficient margin for reissuing the request at least two more times if no grant is received. - -In case the unicast transmission sessions are cancelled as defined in [IEEE 1588], a PTP clock cancelling several types of PTP messages may use a single *Signalling* message containing multiple TLVs or multiple *Signalling* messages. Grant-ports and request-ports compliant with this profile must be prepared to handle those two situations. - -The PTP clock cancelling the session may either cancel the multiple service types with a single *Signalling* message containing multiple CANCEL\_UNICAST\_TRANSMISSION TLVs, or with multiple independent *Signalling* messages (e.g., each containing a single CANCEL\_UNICAST\_TRANSMISSION TLV). The other PTP clock receiving the cancellation is allowed to respond to these requests either with a single *Signalling* message containing multiple ACKNOWLEDGE\_CANCEL\_UNICAST\_TRANSMISSION TLVs, or with multiple independent *Signalling* messages (e.g., each containing a single ACKNOWLEDGE\_CANCEL\_UNICAST\_TRANSMISSION TLV). - -NOTE 2 – The "Renewal Invited" flag described in [IEEE 1588] is not used in this profile. - -### 6.7 Alternate BMCA, telecom slave model and master selection process - -This clause describes the Alternate BMCA algorithm, the telecom slave model and the associated master selection process. These are described in the following clauses. - -#### 6.7.1 Alternate BMCA - -The PTP profile specified in this Recommendation uses an Alternate BMCA, as described in clause 9.3.1 of [IEEE 1588]. This Alternate BMCA differs from the default BMCA of [IEEE 1588] as follows: - -- a) This profile uses the per port Boolean attribute masterOnly as specified in Annex E of [ITU-T G.8275]. - -- b) The profile uses the per port Boolean attribute *notMaster* as specified in Annex E of [ITU-TG.8275]. -- c) The profile allows for multiple clocks to be active GMs simultaneously (clocks with *clockClass* less than 128 cannot be a slave). If there are multiple active GMs, every clock that is not a GM is synchronized by a single GM in the PTP domain. -- d) The per-port attribute *localPriority* is assigned to each port *r* of a clock and is used in the determination of *Erbest* and *Ebest*. Each parent clock or foreign master clock data set, whose *Announce* information was received on the port *r*, is appended with the *localPriority* attribute of the local port *r* before the data set comparison defined in Figure 3 and Figure 4 below is invoked. The *localPriority* attribute is not transmitted in *Announce* messages. This attribute is used as a tie-breaker in the data set comparison algorithm, in the event that all other previous attributes of the data sets being compared are equal. The *localPriority* attribute is set via the configurable, unsigned integer, port data set member *portDS.localPriority*. The data type for this attribute is *UInteger8*. The range of values for this attribute is {1-255}. The default value for this attribute is 128. A clock compliant with this PTP profile is allowed to support a subset of the values defined in the range. -- e) The attribute *localPriority* is assigned to the local clock, to be used if needed when the data associated with the local clock, *D0*, is compared with data on another potential GM received via an *Announce* message. The local clock *localPriority* attribute is set via the configurable, unsigned integer, default data set member *defaultDS.localPriority*. The data type for this attribute is *UInteger8*. The range of values for this attribute is {1-255}. The default value for this attribute is 128. A clock compliant with this PTP profile is allowed to support a subset of the values defined in the range. -- f) The data set comparison algorithm is modified according to Figures 3 and 4 in clause 6.7.9. - -NOTE – When the value of the *masterOnly* attribute is TRUE on a PTP port, the PTP port typically does not request unicast services from other ports. - -#### 6.7.2 Considerations on the use of the *localPriority* attributes - -The *localPriority* attributes provide a powerful tool in defining the synchronization network architecture. - -The use of the default values for these attributes as defined by the Alternate BMCA results in a timing-loop free synchronization network. - -Proper planning will be mandatory to avoid timing-loops when configuring values different from the default ones. - -#### 6.7.3 Static clock attribute *priority1* - -In this PTP profile, the clock attribute *priority1* is static. It is initialized to a default value equal to the midpoint value, 128, of its range, and this value must not be changed. - -The *priority1* parameter is not used in this version of the PTP telecom profile. Future versions may consider using this attribute, this is for further study. - -#### 6.7.4 Clock attribute *priority2* - -In this PTP profile, the clock attribute *priority2* is configurable. - -It is initialized to a default value, equal for T-GM, T-BC-P, and T-BC-A clocks to the midpoint value, 128, of its range {0-255}. The default value for T-TSC-P and T-TSC-A clocks is 255, and the range is {255}. - -A T-GM, T-BC-P, or T-BC-A compliant with this PTP profile must support all the values of *priority2* defined in the range. A T-TSC-P or T-TSC-A compliant with this profile must support, on reception, all the values of *priority2* defined in the full [IEEE 1588] range (i.e., {0-255}). - -Appendix I describes possible use cases for the priority2 attribute; other cases are for further study. - -#### 6.7.5 Clock attribute clockClass - -A PTP clock compliant with this PTP profile must support all values of clockClass upon reception (shall not discard) defined in the full [IEEE 1588] range. The applicable values of the clock attribute clockClass are specified in clause 6.8 of this Recommendation. - -NOTE – It is not expected that equipment compliant to this profile and deployed in an ITU-T G.8275.2 network will receive clockClass values not specified in Table 3. If a clockClass value not specified in Table 3 is received, then the equipment may raise an implementation specific alarm. Future revisions of this profile may include clockClass values not defined in Table 3. - -#### 6.7.6 Clock attribute clockAccuracy - -A PTP clock compliant with this PTP profile must support all the values of clockAccuracy upon reception (shall not discard) defined in the full [IEEE 1588] range. The values that can be transmitted in the clockAccuracy field are shown in Table A.1. The following values of the clock attribute clockAccuracy apply for the following situations: - -- 0x20 for a T-GM connected to an ePRTC in locked-mode (i.e., e PRTC traceable to GNSS). -- 0x21 for a T-GM connected to a PRTC in locked-mode (i.e., PRTC traceable to GNSS) or T-GM connected to ePRTC in phase/time holdover within [ITU-T G.8272.1] ePRTC-A specification as specified in Table 3 of [ITU-T G.8272.1]. -- 0xFE for a T-GM not connected to an ePRTC in locked-mode, nor to an ePRTC in phase/time holdover within the [ITU-T G.8272.1] Table 3 specification, nor to a PRTC in locked mode. -- 0xFE for a T-BC-P or T-BC-A not connected to a local time reference that is traceable to GNSS in locked mode on a virtual PTP port. - -The clockAccuracy for a T-BC-P or T-BC-A when connected to a local time reference that is traceable to GNSS in locked mode on a virtual PTP port is for further study. - -#### 6.7.7 Clock attribute offsetScaledLogVariance - -The following values of the clock attribute offsetScaledLogVariance apply for the following situations: - -- 0x4B32 for a T-GM connected to an ePRTC in locked-mode (i.e., ePRTC traceable to GNSS). This corresponds to TDEV of 10 ns, at observation interval of 1 000 000 seconds. The corresponding value of PTP Variance (PTPVAR) is $1.271 \times 10^{-16} \text{ s}^2$ (see Appendix IX of [ITU-T G.8275.1]). -- 0x4E5D for a T-GM connected to a PRTC in locked-mode (i.e., PRTC traceable to GNSS) This corresponds to TDEV of 30 ns, at observation interval of 10000 seconds. The corresponding value of PTPVAR is $1.144 \times 10^{-15} \text{ s}^2$ (see Appendix IX of [ITU-T G.8275.1]). -- 0xFFFF for a T-GM not connected to a PRTC in locked-mode. -- 0xFFFF for a T-BC-P or T-BC-A not connected to a local time reference that is traceable to GNSS in locked mode on a virtual PTP port. - -The offsetScaledLogVariance for a T-BC-P or T-BC-A when connected to a local time reference traceable to GNSS in locked mode on a virtual PTP port is for further study. - -#### 6.7.8 State decision algorithm - -The state decision algorithm applicable to the Alternate BMCA of the PTP profile specified in this Recommendation is given in Figure 2. After a decision is reached by use of this algorithm, the data sets of the local clock are updated as specified in clause 9.3.5 of [IEEE 1588]. Details on the use of the algorithm are given in clause 9.3.3 of [IEEE 1588]. - -#### 6.7.9 Data set comparison algorithm - -The data set comparison algorithm for the Alternate BMCA of the PTP profile specified in this Recommendation is given in Figures 3 and 4 below. With this algorithm, one clock is compared with another using the data sets representing those clocks, appended with the localPriority attribute. Details on the use of the algorithm are given in clause 9.3.4 of [IEEE 1588]. - -If either of the data sets, A or B, in Figures 3 and 4 contain the data of the parent clock or a foreign master clock, the corresponding localPriority for its data set is the localPriority of the local port *r* on which the information from that parent clock or foreign master clock has been received (see item (d) of clause 6.7.1). - -If either of the data sets, A or B, in Figures 3 and 4 contain the data of the local clock, *D*0, the corresponding localPriority for that data set is the localPriority of the local clock (see item (e) of clause 6.7.1). - -NOTE 1 – It is recommended that the entire data set comparison algorithm described in Figures 3 and 4 be implemented even if some parameters are currently static, because they may be used in future versions of this Recommendation. - -NOTE 2 – If portDS.SF is TRUE on port *r*, then the PTP port should set the respective *E*rbest to the empty set. As a result, the computation of *E*best will not use the information contained in any Announce messages received on the port *r*. Signal fail (SF) is described in clause 6.7.11. - -![Flowchart of the state decision algorithm for Alternate BMCA. The process starts with 'State decision algorithm for port 'r' on clock C0'. It checks if E_best is empty and the port is LISTENING. If yes, it remains in LISTENING. If no, it checks if D0 is Class 1 through 127. If yes, it checks if D0 is better than E_rbest. If yes, it becomes BMC_MASTER (D0) M1. If no, it becomes BMC_PASSIVE (E_rbest) P1. If D0 is not Class 1 through 127, it checks if D0 is better than E_best. If yes, it becomes BMC_MASTER (D0) M2. If no, it proceeds to check if E_best was received on port 'r'. If yes, it becomes BMC_SLAVE (E_best = E_rbest) S1. If no, it checks if E_best is better than E_rbest. If yes, it becomes BMC_PASSIVE (E_rbest) P2. If no, it becomes BMC_MASTER (E_best) M3. A key indicates that recommended states are in ovals.](e69b9188aa2c14ec6b21c83f711fef65_img.jpg) - -``` - -graph TD - Start([State decision algorithm for port 'r' on clock C0]) --> D1{E_best is the empty set AND Port state is LISTENING} - D1 -- Yes --> End1([Remain in LISTENING state]) - D1 -- No --> D2{D0 is Class 1 through 127} - D2 -- Yes --> D3{D0 better or better by topology than E_rbest} - D2 -- No --> D4{D0 better or better by topology than E_best} - D3 -- Yes --> M1([BMC_MASTER D0 M1]) - D3 -- No --> P1([BMC_PASSIVE E_rbest P1]) - D4 -- Yes --> M2([BMC_MASTER D0 M2]) - D4 -- No --> D5{E_best received on port 'r'} - D5 -- Yes --> S1([BMC_SLAVE E_best = E_rbest S1]) - D5 -- No --> D6{E_best better by topology than E_rbest} - D6 -- Yes --> P2([BMC_PASSIVE E_rbest P2]) - D6 -- No --> M3([BMC_MASTER E_best M3]) - M1 --> KEY([KEY Recommended state basis for data set updates]) - P1 --> KEY - M2 --> KEY - S1 --> KEY - P2 --> KEY - M3 --> KEY - -``` - -Flowchart of the state decision algorithm for Alternate BMCA. The process starts with 'State decision algorithm for port 'r' on clock C0'. It checks if E\_best is empty and the port is LISTENING. If yes, it remains in LISTENING. If no, it checks if D0 is Class 1 through 127. If yes, it checks if D0 is better than E\_rbest. If yes, it becomes BMC\_MASTER (D0) M1. If no, it becomes BMC\_PASSIVE (E\_rbest) P1. If D0 is not Class 1 through 127, it checks if D0 is better than E\_best. If yes, it becomes BMC\_MASTER (D0) M2. If no, it proceeds to check if E\_best was received on port 'r'. If yes, it becomes BMC\_SLAVE (E\_best = E\_rbest) S1. If no, it checks if E\_best is better than E\_rbest. If yes, it becomes BMC\_PASSIVE (E\_rbest) P2. If no, it becomes BMC\_MASTER (E\_best) M3. A key indicates that recommended states are in ovals. - -G.8275.2-Y.1369.2(16)\_F02 - -Figure 2 – State decision algorithm for Alternate BMCA - -![Flowchart of the data set comparison algorithm, part 1, for Alternate BMCA. The process starts with 'Compare data set A to B' and proceeds through a series of decision diamonds: 'Compare GM clockClass values of A and B', 'Compare GM clockAccuracy values of A and B', 'Compare GM offsetScaledLogVariance values of A and B', 'Compare GM priority2 values of A and B', 'Compare localPriority values of A and B', 'GM clockClass of A is 127 or less', and 'Compare GM clockIdentity values of A and B'. Each diamond has 'A > B', 'A < B', and 'A = B' branches. The 'A > B' branches lead to 'Return B better than A', the 'A < B' branches lead to 'Return A better than B', and the 'A = B' branches lead to the next comparison or a connector 'x'.](c914f51f4427bc672dd0526cfc90ebe9_img.jpg) - -``` - -graph TD - Start([Compare data set A to B]) --> D1{Compare GM clockClass values of A and B} - D1 -- "A > B" --> B_Better([Return B better than A]) - D1 -- "A < B" --> A_Better([Return A better than B]) - D1 -- "A = B" --> D2{Compare GM clockAccuracy values of A and B} - D2 -- "A > B" --> B_Better - D2 -- "A < B" --> A_Better - D2 -- "A = B" --> D3{Compare GM offsetScaledLogVariance values of A and B} - D3 -- "A > B" --> B_Better - D3 -- "A < B" --> A_Better - D3 -- "A = B" --> D4{Compare GM priority2 values of A and B} - D4 -- "A > B" --> B_Better - D4 -- "A < B" --> A_Better - D4 -- "A = B" --> D5{Compare localPriority values of A and B} - D5 -- "A > B" --> B_Better - D5 -- "A < B" --> A_Better - D5 -- "A = B" --> D6{GM clockClass of A is 127 or less} - D6 -- Yes --> X1((x)) - D6 -- No --> D7{Compare GM clockIdentity values of A and B} - D7 -- "A > B" --> B_Better - D7 -- "A < B" --> A_Better - D7 -- "A = B" --> X2((x)) - -``` - -G.8275.2-Y.1369.2(16)-Amd.1(17)\_F03 - -Flowchart of the data set comparison algorithm, part 1, for Alternate BMCA. The process starts with 'Compare data set A to B' and proceeds through a series of decision diamonds: 'Compare GM clockClass values of A and B', 'Compare GM clockAccuracy values of A and B', 'Compare GM offsetScaledLogVariance values of A and B', 'Compare GM priority2 values of A and B', 'Compare localPriority values of A and B', 'GM clockClass of A is 127 or less', and 'Compare GM clockIdentity values of A and B'. Each diamond has 'A > B', 'A < B', and 'A = B' branches. The 'A > B' branches lead to 'Return B better than A', the 'A < B' branches lead to 'Return A better than B', and the 'A = B' branches lead to the next comparison or a connector 'x'. - -**Figure 3 – Data set comparison algorithm, part 1, for Alternate BMCA** - -![Flowchart of the data set comparison algorithm, part 2, for Alternate BMCA. The process starts with 'x' and proceeds through a series of decision diamonds: 'Compare stepsRemoved values of A and B', 'Compare portIdentities of receiver of A and sender of A', 'Compare stepsRemoved values of A and B', 'Compare portIdentities of sender of A and sender of B', and 'Compare portNumbers of receiver of A and receiver of B'. It ends with outcomes like 'Return B better than A', 'Return A better than B', 'Return B better by topology than A', 'Return A better by topology than B', 'error-1', and 'error-2'.](c5452f95f3b28f1bfe29e84fbc2e1267_img.jpg) - -``` - -graph TD - x((x)) --> D1{Compare stepsRemoved values of A and B} - D1 -- "A > B+1" --> R1([Return B better than A]) - D1 -- "A+1 < B" --> R2([Return A better than B]) - D1 -- "A within 1 of B" --> D2{Compare portIdentities of receiver of A and sender of A} - D2 -- "Receiver < Sender" --> R1 - D2 -- "Receiver > Sender" --> R3([Return B better by topology than A]) - D2 -- "Receiver = Sender" --> E1([error-1]) - D2 -- "A > B" --> D3{Compare stepsRemoved values of A and B} - D3 -- "A < B" --> D4{Compare portIdentities of receiver of B and sender of B} - D3 -- "A = B" --> D5{Compare portIdentities of sender of A and sender of B} - D4 -- "Receiver < Sender" --> R2 - D4 -- "Receiver > Sender" --> R4([Return A better by topology than B]) - D4 -- "Receiver = Sender" --> E2([error-1]) - D5 -- "A > B" --> D6{Compare portNumbers of receiver of A and receiver of B} - D5 -- "A < B" --> R4 - D5 -- "A = B" --> D6 - D6 -- "A > B" --> R3 - D6 -- "A < B" --> R4 - D6 -- "A = B" --> E3([error-2]) - -``` - -Flowchart of the data set comparison algorithm, part 2, for Alternate BMCA. The process starts with 'x' and proceeds through a series of decision diamonds: 'Compare stepsRemoved values of A and B', 'Compare portIdentities of receiver of A and sender of A', 'Compare stepsRemoved values of A and B', 'Compare portIdentities of sender of A and sender of B', and 'Compare portNumbers of receiver of A and receiver of B'. It ends with outcomes like 'Return B better than A', 'Return A better than B', 'Return B better by topology than A', 'Return A better by topology than B', 'error-1', and 'error-2'. - -G.8275.2-Y.1369.2(16)\_F04 - -**Figure 4 – Data set comparison algorithm, part 2, for Alternate BMCA** - -NOTE 3 – stepsRemoved used in the BMCA does not characterize or reflect the amount of packet delay variation (PDV) or asymmetry on a connection. The BMCA may not select the path with the lowest PDV or asymmetry. - -#### 6.7.10 Unused PTP fields - -Some PTP fields are not used in this PTP profile. This clause defines the actions applicable to these unused PTP fields. - -Table A.6 in clause A.10 defines the PTP common header flag values, and whether or not each flag is used in this profile. - -In addition, the following fields are not used in this profile: - -- The "controlField" in the common header of PTP messages is not used in this profile. This field must be ignored by the receiver for all types of PTP messages. -- The "priority1" field in the *Announce* message is not used and must be set to a fixed value specified in clause 6.7.3. - -When a PTP clock receives a PTP message with a field, whose use is not specified in this PTP profile, containing a value outside the allowed range, then this field of the PTP message must be ignored, without discarding the PTP message. - -As an example, a PTP clock compliant with this PTP profile must ignore on reception the field value for the following fields. A clock compliant with this PTP profile must not update its local data sets with the ingress value for these fields. - -- flagField – PTP profile Specific 1 -- flagField – PTP profile Specific 2 - -When a PTP clock receives a PTP message with a field, whose use is specified in this PTP profile, containing a value outside the allowed range for reception, then this entire PTP message must be discarded. The allowed range for a parameter on reception is the same as the range for the corresponding default dataset parameter, except for the attributes clockClass, clockAccuracy, offsetScaledLogVariance, and priority2 (see clauses 6.7.4, 6.7.5, 6.7.6, and 6.7.7). - -As an example, a compliant clock must discard on reception the ingress packet (General and Event messages) when any of the following fields are outside of the allowed range for the profile. The clock's local data set must not be updated with the ingress value. - -- domainNumber -- versionPTP -- flagField – unicastFlag - -NOTE 1 – If a clock receives an *Announce* message with the "priority1" field set to a value other than 128, and if the clock advertising this value is selected as the GM, then 128 must be re-advertised by the receiving clock. The unused attribute priority1 is ignored by the receiving clock for the purpose of the Alternate BMCA. - -NOTE 2 – The allowed ranges for reception for the clock attributes priority2, clockClass, clockAccuracy, and offsetScaledLogVariance are the respective full [IEEE 1588] ranges, see clauses 6.7.4, 6.7.5, 6.7.6, and 6.7.7 of this Recommendation. - -#### 6.7.11 Packet timing signal fail - -This clause is optional but, if implemented, it is necessary for the equipment to conform to the requirements contained herein. An implementation may support all, none, or a subset of these types of PTSF. - -This clause defines the notion of packet timing signal fail (PTSF), which corresponds to a signal indicating a failure of the PTP packet timing signal received by the slave. - -Three types of PTSF may be raised in a PTP clock: - -- 1) PTSF-lossOfTimingMessages, lack of reception of PTP timing messages from a grant-port(loss of the packet timing signal): if the request-port no longer receives the timing messages sent by a grant-port (i.e., *Sync* and subsequently *Follow\_Up* and *Delay\_Resp* messages), then a PTSF-lossOfTimingMessages associated with this grant-port must occur. A timeout period for reception of *Sync* messages or *Delay\_Resp* messages (i.e., syncReceiptTimeout and delayRespReceiptTimeout) for these timing messages must be implemented in the request-port before triggering the PTSF-lossOfTimingMessages (the range and default value of these timeout parameters are defined in Table A.5). - -The value of syncReceiptTimeout shall specify the number of *Sync* message intervals that have to pass without receipt of a *Sync* and, if the twoStep flag of the *Sync* message is TRUE, a *Follow\_Up* message before the triggering of the PTSF-lossOfTimingMessages event. - -The value of delayRespReceiptTimeout shall specify the number of *Delay\_Req* message intervals that have to pass without receipt of a *Delay\_Resp* message before the triggering of the PTSF-lossOfTimingMessages event. - -A timer should be activated after receiving the grant message from the grant port. If the request port sends a new signalling message to change message rate, it shall terminate the timer. Once the request port receives the new grant message, the associated timer shall restart. - -- 2) PTSF-unusable, unusable PTP packet timing signal received by the request-port, exceeding the input tolerance of the request-port (noisy packet timing signal): if the PTP packet timing signal is not usable for the request-port to achieve the performance target (e.g., violates the request-port input tolerance because of excessive PDV noise), then a PTSF-unusable associated with this master must occur. The criteria used to determine that the packet timing signal is not suitable to be used are for further study (an example of criteria to be studied may relate to the PDV experienced by the packet timing signal as it traverses the network from the grant-port to the request-port). -- 3) PTSF-synchronizationUncertain, uncertain timing signal received by the request-port: if the synchronizationUncertain flag of an *Announce* message received from a grant-port is TRUE, a PTSF-synchronizationUncertain associated with this grant-port must occur. - -When a PTSF occurs, the clock may set the PTP portDS.SF to TRUE and generate a state decision event, which triggers the running of the alternate BMCA. As described in clause 6.7.9, a value of portDS.SF of TRUE can be used to exclude PTP ports from the alternate BMCA selection process. An implementation may set the PTP portDS.SF to TRUE for only a subset of PTSF listed above; that is, the implementation may set portDS.SF to TRUE for some and leave portDS.SF as FALSE for others. For example, when PTSF-synchronizationUncertain is raised, if portDS.SF is not set to TRUE, then this would allow the network topology to be built as described in Annex D of [ITU-T G.8275]. - -NOTE – See Appendix V and Appendix VII for further information. - -### 6.8 Phase/time traceability information - -In order to deliver phase/time traceability information, the clockClass values described in Table 3 below must be used in this PTP telecom profile. - -The frequencyTraceable flag present in the header of the PTP messages is defined in this profile as follows: if the PTP clock is traceable to a PRTC in locked mode or to a primary reference clock (PRC), e.g., using a PRC-traceable physical layer frequency input, then this parameter must be set to TRUE, otherwise it must be FALSE. This flag is not used in the Alternate BMCA defined in clause 6.7; the values provided for this flag in Table 3 can be used by the network operator for monitoring purposes or by the end applications to take definitive action as described in Appendix II. - -When a T-GM first enters holdover, it downgrades the clockClass value that it uses to 7. It then calculates if the time error at its output is still within the holdover specification. When the T-GM determines that the time error at its output has exceeded the holdover specification, it downgrades the clockClass value that it uses to 140, 150 or 160 depending on the quality of its frequency reference (internal oscillator or physical layer frequency signal received on an external interface). - -As an example, when a T-BC-P or T-BC-A first enters holdover, it downgrades the clockClass value that it uses to 135. It then calculates if the time error at its output is still within the holdover specification. When the T-BC-P or T-BC-A determines that the time error at its output has exceeded the holdover specification, it downgrades the clockClass value that it uses to 165 (internal oscillator or received physical layer frequency signal on an external interface). - -NOTE 1 – The applicable holdover specification depends on the design and budgeting of the synchronization network. - -NOTE 2 – The case of a T-BC-P or T-BC-A acting as a GM, with an external phase/time input coming from a PRTC, is handled by means of a virtual PTP port with associated $E_{rbest}$ attributes as described in Annex C of this Recommendation. The general case of a T-BC-P or T-BC-A with a phase/time external synchronization input different from PRTC is for further study. - -NOTE 3 – For the T-BC-P or T-BC-A in locked mode, the traceability information of the currently selected best master clock will be passed to the downstream nodes, as per PTP. This means that the attributes and flags in the PTP header will always reflect the phase/time traceability information from the current parent clock, regardless of the frequency traceability of the T-BC-P/A's physical layer clock. Failure scenarios including holdover are for further study. - -**Table 3 – Applicable clockClass values** - -| Phase/time traceability description | defaultDS clockClass | frequencyTraceable flag | timeTraceable flag | -|----------------------------------------------------------------------------------------------------------------------------|-----------------------------|--------------------------------|---------------------------| -| T-GM connected to a PRTC in locked mode (e.g., PRTC traceable to GNSS) | 6 | TRUE | TRUE | -| T-GM in holdover, within holdover specification, traceable to Category 1 frequency source (Note 1) | 7 | TRUE | TRUE | -| T-GM in holdover, within holdover specification, non-traceable to Category 1 frequency source (Note 1) | 7 | FALSE | TRUE | -| T-BC-P or T-BC-A in holdover, within holdover specification, traceable to Category 1 frequency source (Note 1) | 135 | TRUE | TRUE | -| T-BC-P or T-BC-A in holdover, within holdover specification, non-traceable to Category 1 frequency source (Note 1) | 135 | FALSE | TRUE | -| T-GM in holdover, out of holdover specification, traceable to Category 1 frequency source (Note 1) | 140 | TRUE | FALSE | -| T-GM in holdover, out of holdover specification, traceable to Category 2 frequency source (Note 1) | 150 | FALSE | FALSE | -| T-GM in holdover, out of holdover specification, traceable to Category 3 frequency source (Note 1) | 160 | FALSE | FALSE | -| T-BC-P or T-BC-A in holdover, out of holdover specification (Note 1) | 165 | (Note 2) | FALSE | -| T-GM, T-BC-P, T-BC-A, in free-run mode, or, T-TSC-P or T-TSC-A, acting as a BC in free-run mode | 248 | (Note 2) | FALSE | -| T-GM, T-BC-P, T-BC-A, without time reference since start-up, or, T-TSC-P or T-TSC-A, acting as a BC without time reference | 248 | (Note 2) | FALSE | -| T-TSC-P or T-TSC-A acting as an OC | 255 | (Note 2) | As per PTP | - -**Table 3 – Applicable clockClass values** - -| Phase/time traceability description | defaultDS clockClass | frequencyTraceable flag | timeTraceable flag | -|--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|----------------------|-------------------------|--------------------| -|

NOTE 1 – The holdover specification threshold controlling the time spent advertising clockClass values 7 or 135 could be set to zero so that the T-GM, T-BC-P, or T-BC-A would advertise a degraded clockClass value directly after losing traceability to a PRTC. In this case, initially after advertising clockClass values 140, 150, 160 or 165, a clock may still be within the holdover specification. For a description of frequency source "Category" see Table 4 below.

NOTE 2 – The frequencyTraceable flag may be TRUE or FALSE, depending on the availability of a PRC-traceable physical layer frequency input signal.

NOTE 3 – The term "holdover" in this table refers to "time holdover".

| | | | - -Table 4 describes how the clock quality levels (QLs) defined in [ITU-T G.781] are mapped to Category 1, 2, and 3 frequency sources used in Table 3. - -**Table 4 – Mapping of ITU-T G.781 clock QLs to Category 1, 2, 3 frequency sources** - -| Category (in Table 3) | ITU-T G.781 Option I QLs | ITU-T G.781 Option II QLs | -|----------------------------------------------------------------------------------------------------------------------------------------------------|--------------------------|---------------------------| -| Category 1 frequency source | QL-PRC | QL-PRS | -| Category 2 frequency source | QL-SSU-A | QL-ST2 | -| Category 3 frequency source | QL-SSU-B | QL-ST3E | -|

NOTE – Other frequency source categories, while not used in Table 3, are possible. An example is a category containing QL-EEC1 and QL-EEC2.

| | | - -## 6.9 Use of alternate master flag - -A PTP clock must only synchronize to a PTP timing service being provided by its parent clock, whose port is in the PTP MASTER state. To ensure this operation, this profile uses the alternateMasterFlag field defined in clause 7.3.8.2 of [IEEE 1588] with the following behaviour. - -- On transmission of an Announce message, a PTP port will set the alternateMasterFlag to 0 when the transmitting PTP port state is MASTER; otherwise the PTP port must set the alternateMasterFlag to 1. -- Referring to clause 13.3.2.6 of [IEEE 1588-2008] and clause 13.3.2.8 of [IEEE 1588-2019], the alternateMasterFlag is only set on transmission of Announce, Sync, Follow\_Up and Delay\_Resp messages. -- On reception, a PTP port that receives a PTP Announce message with alternateMasterFlag value 1 must discard (and not process) the message. For example, such an Announce message must not be input into the BMCA. - -While the alternateMasterFlag is used in this version of the profile, clause 17.4 of [IEEE 1588-2008] and clause 17.3 of [IEEE 1588-2019] are not used. - -# **7 ITU-T PTP profile for phase/time distribution with partial timing support from the network** - -The [IEEE 1588] profile that supports time distribution in unicast mode is contained in Annex A. - -# **8 Security aspects** - -Security aspects are for further study. - -## Annex A - -## ITU-T PTP profile for time distribution with partial timing support from the network (unicast mode) - -(This annex forms an integral part of this Recommendation.) - -This annex contains the telecom profile for time distribution as required by [IEEE 1588]. In order to claim compliance with the telecom profile, the requirements in this annex and in the body of this Recommendation must both be met. - -### A.1 Profile identification - -profileName: ITU-T PTP profile for time distribution with partial timing support from the network (unicast mode) - -profileVersion: 2.2 (for an implementation based on IEEE Std 1588-2008 [IEEE 1588-2008]) - -profileVersion: 2.3 (for an implementation based on IEEE Std 1588-2019 [IEEE 1588-2019]) - -profileIdentifier: 00-19-A7-02-02-02 (for an implementation based on IEEE Std 1588-2008 [IEEE 1588-2008]) - -profileIdentifier: 00-19-A7-02-02-03 (for an implementation based on IEEE Std 1588-2019 [IEEE 1588-2019]) - -See clause A.11 for details of compatibility between profile versions. - -This profile is specified by ITU-T. - -A copy may be obtained from [www.itu.int](http://www.itu.int). - -### A.2 PTP attribute values - -The default values and ranges of the PTP attributes for use in this profile are contained in Tables A.1, A.2, A.3, A.4, and A.5. For the attributes clockClass, clockAccuracy, offsetScaledLogVariance, and priority2, the ranges shown are those for the defaultDS. - -NOTE – A boundary clock follows the rules of [IEEE 1588] for selection of parent clock, updating of parentDS, and transmission of Announce messages, so it may transmit values different from the defaultDS values. - -Attributes not specified by this profile shall use the [IEEE 1588] default initialization values and ranges. - -Some attributes in these tables are associated with optional features of this Recommendation. Therefore, these attributes are also optional unless the associated feature is implemented, in which case these attributes must be supported. - -Unless explicitly documented within these tables, the data type of a dataset member is as per PTP. - -**Table A.1 – defaultDS data set member specifications** - -| [IEEE 1588-2008] | | [IEEE 1588-2019] | | Members of the data set | T-GM requirements | | T-TSC-P and T-TSC-A requirements | | T-BC-P and T-BC-A requirements | | -|------------------|--------------|------------------|--------------|----------------------------------------------------------|---------------------------------------|------------------------------|---------------------------------------|------------------------------|---------------------------------------|-----------------| -| | | | | | Default initialization value (Note 7) | Range | Default initialization value (Note 7) | Range | Default initialization value (Note 7) | Range | -| Clause | Data type | Clause | Data type | | | | | | | | -| 8.2.1.2.1 | As per PTP | (Note 5) | (Note 5) | defaultDS.twoStepFlag (static) | As per PTP | {FALSE, TRUE} | As per PTP | {FALSE, TRUE} | As per PTP | {FALSE, TRUE} | -| 8.2.1.2.2 | As per PTP | 8.2.1.2.2 | As per PTP | defaultDS.clockIdentity (static) | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | -| 8.2.1.2.3 | As per PTP | 8.2.1.2.3 | As per PTP | defaultDS.numberPorts (dynamic) | 1 for OC As per PTP for BC | {1} for OC As per PTP for BC | 1 for OC As per PTP for BC | {1} for OC As per PTP for BC | As per PTP | As per PTP | -| 8.2.1.3.1.1 | As per PTP | 8.2.1.3.1.2 | As per PTP | defaultDS.clockQuality.clockClass (dynamic) | 248 | {6, 7, 140, 150, 160, 248} | 255 for OC 248 for BC | {255} for OC {248} for BC | 248 | {135, 165, 248} | -| 8.2.1.3.1.2 | As per PTP | 8.2.1.3.1.3 | As per PTP | defaultDS.clockQuality.clockAccuracy (dynamic) | 0xFE (Note 2) | As per PTP (Note 2) (Note 4) | 0xFE (Note 2) | {0xFE} (Note 2) | 0xFE (Note 2) | {0xFE} (Note 2) | -| 8.2.1.3.1.3 | As per PTP | 8.2.1.3.1.4 | As per PTP | defaultDS.clockQuality.offsetScaledLogVariance (dynamic) | 0xFFFF | As per PTP (Note 4) | 0xFFFF | {0xFFFF} | 0xFFFF | {0xFFFF} | -| 8.2.1.4.1 | As per PTP | 8.2.1.4.1 | As per PTP | defaultDS.priority1 (configurable) | 128 (Note 1) | {128} (Note 1) | 128 (Note 1) | {128} (Note 1) | 128 (Note 1) | {128} (Note 1) | -| 8.2.1.4.2 | As per PTP | 8.2.1.4.2 | As per PTP | defaultDS.priority2 (configurable) | 128 | {0-255} | 255 | {255} | 128 | {0-255} | -| 8.2.1.4.3 | As per PTP | 8.2.1.4.3 | As per PTP | defaultDS.domainNumber (configurable) | 44 | {44-63} | 44 | {44-63} | 44 | {44-63} | -| 8.2.1.4.4 | As per PTP | 8.2.1.4.4 | As per PTP | defaultDS.slaOnly (configurable) | FALSE | {FALSE} | TRUE for OC FALSE for BC | {TRUE} for OC {FALSE} for BC | FALSE | {FALSE} | -| (Note 6) | As per PTP | 8.2.1.4.5 | As per PTP | defaultDS.sdoId (configurable) | 0x000 | 0x000 | 0x000 | 0x000 | 0x000 | 0x000 | -| New member | UInteger8 | New member | UInteger8 | defaultDS.localPriority (configurable) | 128 | {1-255} | 128 | {1-255} | 128 | {1-255} | -| New member | Octet[6] | New member | Octet[6] | defaultDS.profileIdentifier (configurable) | (Note 8) | (Note 8) | (Note 8) | (Note 8) | (Note 8) | (Note 8) | -| New member | Enumeration8 | New member | Enumeration8 | defaultDS.deviceType (configurable) | (Note 9) | (Note 9) | (Note 9) | (Note 9) | (Note 9) | (Note 9) | - -**Table A.1 – defaultDS data set member specifications** - -| [IEEE 1588-2008] | [IEEE 1588-2019] | Members of the data set | T-GM requirements | T-TSC-P and T-TSC-A requirements | T-BC-P and T-BC-A requirements | -|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|------------------|-------------------------|-------------------|----------------------------------|--------------------------------| -| NOTE 1 – It is not used in this profile, and therefore equipment is not required to support it.
NOTE 2 – For the case where the PTP grandmaster is syntonized to a PRC for frequency, but not synchronized to a reference source of time, the grandmaster should set defaultDS.clockQuality.clockAccuracy to 0xFE, "UNKNOWN".
NOTE 3 – Equipment implementing multiple slave ports, with defaultDS.clockClass value of 255, should be treated as having multiple instantiations of slave-only OCs. This is out of scope of this Recommendation.
NOTE 4 – Examples of applicable values are shown in clauses 6.7.6 and 6.7.7.
NOTE 5 – In the case of [IEEE 1588-2019] based implementations, this data set member is deprecated.
NOTE 6 – Applicable to [IEEE 1588-2019] based implementations; this data set member does not exist in [IEEE 1588-2008]
NOTE 7 – If a default value is not provided by this Recommendation, then it is implementation specific
NOTE 8 – This dataset member is set according to the profileIdentifier specified in clause A.1.
NOTE 9 – This attribute can be used to set the deviceType in use in the PTP clock instance. See clause 6.2.3.1 for more information and applicable values. | | | | | | - -**Table A.2 – currentDS data set member specifications** - -| Clause from [IEEE 1588-2008] | Clause from [IEEE 1588-2019] | Members of the data set | T-GM requirements | | T-TSC-P and T-TSC-A requirements | | T-BC-P and T-BC-A requirements | | -|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|------------------------------|--------------------------------------|---------------------------------------|------------|---------------------------------------|------------|---------------------------------------|------------| -| | | | Default initialization value (Note 3) | Range | Default initialization value (Note 3) | Range | Default initialization value (Note 3) | Range | -| 8.2.2.2 | 8.2.2.2 | currentDS.stepsRemoved (dynamic) | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | -| 8.2.2.3 | 8.2.2.3 | currentDS.offsetFromMaster (dynamic) | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | -| 8.2.2.4 | (Note 1) | currentDS.meanPathDelay (dynamic) | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | -| (Note 2) | 8.2.2.4 | currentDS.meanDelay (dynamic) | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | -| NOTE 1 – In the case of [IEEE 1588-2019] based implementations this data set member is deprecated.
NOTE 2 – Applicable to [IEEE 1588-2019] based implementations; this data set member does not exist in [IEEE 1588-2008].
NOTE 3 – If a default value is not provided by this Recommendation, then it is implementation specific. | | | | | | | | | - -**Table A.3 – parentDS data set member specifications** - -| Clause from [IEEE 1588-2008] | Clause from [IEEE 1588-2019] | Members of the data set | T-GM requirements | | T-TSC-P and T-TSC-A requirements | | T-BC-P and T-BC-A requirements | | -|------------------------------|------------------------------|----------------------------------------------------------|---------------------------------------|-------------------|---------------------------------------|-------------------|---------------------------------------|-------------------| -| | | | Default initialization value (Note 2) | Range | Default initialization value (Note 2) | Range | Default initialization value (Note 2) | Range | -| 8.2.3.2 | 8.2.3.2 | parentDS.parentPortIdentity (dynamic) | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | -| 8.2.3.3 | 8.2.3.3 | parentDS.parentStats (dynamic) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | -| 8.2.3.4 | 8.2.3.4 | parentDS.observedParentOffsetScaledLogVariance (dynamic) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | -| 8.2.3.5 | 8.2.3.5 | parentDS.observedParentClockPhaseChangeRate (dynamic) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | -| 8.2.3.6 | 8.2.3.6 | parentDS.grandmasterIdentity (dynamic) | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | -| 8.2.3.7 | 8.2.3.7 | parentDS.grandmasterClockQuality (dynamic) | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | -| 8.2.3.8 | 8.2.3.8 | parentDS.grandmasterPriority1 (dynamic) | As per PTP (Note) | As per PTP (Note) | As per PTP (Note) | As per PTP (Note) | As per PTP (Note) | As per PTP (Note) | -| 8.2.3.9 | 8.2.3.9 | parentDS.grandmasterPriority2 (dynamic) | As per PTP (Note) | As per PTP (Note) | As per PTP (Note) | As per PTP (Note) | As per PTP (Note) | As per PTP (Note) | - -NOTE 1 – It is not used in this profile, and therefore equipment is not required to support it. - -NOTE 2 – If a default value is not provided by this Recommendation, then it is implementation specific. - -**Table A.4 – timePropertiesDS data set member specifications** - -| Clause from [IEEE 1588-2008] | Clause from [IEEE 1588-2019] | Members of the data set | T-GM requirements | | T-TSC-P and T-TSC-A requirements | | T-BC-P and T-BC-A requirements | | -|------------------------------|------------------------------|---------------------------------------------------|---------------------------------------|------------------------|---------------------------------------|------------------------|---------------------------------------|------------------------| -| | | | Default initialization value (Note 2) | Range | Default initialization value (Note 2) | Range | Default initialization value (Note 2) | Range | -| 8.2.4.2 | 8.2.4.2 | timePropertiesDS.currentTimeOffset (dynamic) | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | -| 8.2.4.3 | 8.2.4.3 | timePropertiesDS.currentTimeOffsetValid (dynamic) | FALSE | {FALSE, TRUE} | FALSE | {FALSE, TRUE} | FALSE | {FALSE, TRUE} | -| 8.2.4.4 | 8.2.4.4 | timePropertiesDS.leap59 (dynamic) | FALSE | {FALSE, TRUE} | FALSE | {FALSE, TRUE} | FALSE | {FALSE, TRUE} | -| 8.2.4.5 | 8.2.4.5 | timePropertiesDS.leap61 (dynamic) | FALSE | {FALSE, TRUE} | FALSE | {FALSE, TRUE} | FALSE | {FALSE, TRUE} | -| 8.2.4.6 | 8.2.4.6 | timePropertiesDS.timeTraceable (dynamic) | FALSE | {FALSE, TRUE} | FALSE | {FALSE, TRUE} | FALSE | {FALSE, TRUE} | -| 8.2.4.7 | 8.2.4.7 | timePropertiesDS.frequencyTraceable (dynamic) | FALSE | {FALSE, TRUE} (Note 1) | FALSE | {FALSE, TRUE} (Note 1) | FALSE | {FALSE, TRUE} (Note 1) | -| 8.2.4.8 | 8.2.4.8 | timePropertiesDS.ptpTimescale (dynamic) | TRUE | {TRUE} | TRUE | {TRUE} | TRUE | {TRUE} | -| 8.2.4.9 | 8.2.4.9 | timePropertiesDS.timeSource (dynamic) | 0xA0 | As per PTP | 0xA0 | As per PTP | 0xA0 | As per PTP | - -NOTE 1 – If the clock is traceable to a PRTC in locked mode or a PRC (e.g., using a PRC-traceable physical layer frequency input), then this parameter must be set to TRUE, otherwise it must be FALSE. - -NOTE 2 – If a default value is not provided by this Recommendation, then it is implementation specific. - -**Table A.5 – portDS data set member specifications** - -| Clause from [IEEE 1588-2008] | | Clause from [IEEE 1588-2019] | | Members of the data set | Master port requirements of T-GM | | Slave port requirements of T-TSC-P and T-TSC-A | | T-BC-P and T-BC-A requirements | | -|------------------------------|------------|------------------------------|------------|-----------------------------------------------|---------------------------------------|---------------------------------|------------------------------------------------------------------|---------------------------------|---------------------------------------|------------| -| Clause | Data type | Clause | Data type | | Default initialization value (Note 9) | Range | Default initialization value (Note 9) | Range | Default initialization value (Note 9) | Range | -| 8.2.5.2.1 | As per PTP | 8.2.15.2.1 | As per PTP | portDS.portIdentity.clockIdentity (static) | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | -| 8.2.5.2.1 | As per PTP | 8.2.15.2.1 | As per PTP | portDS.portIdentity.portNumber (static) | 1 for OC
As per PTP for BC | {1} for OC
As per PTP for BC | 1 for OC
As per PTP for BC | {1} for OC
As per PTP for BC | As per PTP | As per PTP | -| 8.2.5.3.1 | As per PTP | 8.2.15.3.1 | As per PTP | portDS.portState (dynamic) | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | As per PTP | -| 8.2.5.3.2 | As per PTP | 8.2.15.3.2 | As per PTP | portDS.logMinDelayReqInterval (dynamic) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | -| 8.2.5.3.3 | As per PTP | (Note 5) | (Note 5) | portDS.peerMeanPathDelay (dynamic) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | -| (Note 7) | (Note 7) | 8.2.15.3.3 | As per PTP | portDS.meanLinkDelay | (Note 1) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | -| 8.2.5.4.1 | As per PTP | 8.2.15.4.1 | As per PTP | portDS.logAnnounceInterval (configurable) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | -| 8.2.5.4.2 | As per PTP | 8.2.15.4.2 | As per PTP | portDS.announceReceiptTimeout (configurable) | 2 | {2} | As per PTP | As per PTP | As per PTP | As per PTP | -| 8.2.5.4.3 | As per PTP | 8.2.15.4.3 | As per PTP | portDS.logSyncInterval (configurable) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | -| 8.2.5.4.4 | As per PTP | 8.2.15.4.4 | As per PTP | portDS.delayMechanism (configurable) | 01
(Note 2) | {01}
(Note 2) | '01' for a two-way slave-port, and 'FE' for a one-way slave-port | {01,FE} | 01 | {01} | -| 8.2.5.4.5 | As per PTP | 8.2.15.4.5 | As per PTP | portDS.logMinPdelayReqInterval (configurable) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | (Note 1) | -| 8.2.5.4.6 | As per PTP | 8.2.15.4.6 | As per PTP | portDS.versionNumber (configurable) | 2 | {2} | 2 | {2} | 2 | {2} | -| (Note 7) | (Note 7) | 8.2.15.4.7 | As per PTP | portDS.minorVersionNumber (configurable) | 1 | {1} | 1 | {1} | 1 | {1} | - -**Table A.5 – portDS data set member specifications** - -| Clause from [IEEE 1588-2008] | | Clause from [IEEE 1588-2019] | | Members of the data set | Master port requirements of T-GM | | Slave port requirements of T-TSC-P and T-TSC-A | | T-BC-P and T-BC-A requirements | | -|------------------------------|------------|------------------------------|------------|-----------------------------------------------|---------------------------------------|---------------|------------------------------------------------|-------------------------|---------------------------------------|-------------------------| -| Clause | Data type | Clause | Data type | | Default initialization value (Note 9) | Range | Default initialization value (Note 9) | Range | Default initialization value (Note 9) | Range | -| New member | Boolean | 9.2.2.2 | As per PTP | portDS.masterOnly (configurable) (Note 8) | TRUE | {TRUE} | FALSE | {FALSE} | TRUE | {TRUE, FALSE} | -| New member | UInteger8 | New member | UInteger8 | portDS.localPriority (configurable) | 128 | {1-255} | 128 | {1-255} | 128 | {1-255} | -| New member | UInteger16 | New member | UInteger16 | portDS.SF (dynamic) | FALSE | {FALSE} | FALSE | {TRUE, FALSE} | FALSE | {TRUE, FALSE} | -| New Member | UInteger16 | New Member | UInteger16 | portDS.syncReceiptTimeout (configurable) | NA | NA | (Note 3)
(Note 4) | {3 – 65535}
(Note 6) | (Note 3) | {3 – 65535}
(Note 6) | -| New Member | Boolean | New Member | Boolean | portDS.delayRespReceiptTimeout (configurable) | NA | NA | (Note 3)
(Note 4) | {3 – 65535}
(Note 6) | (Note 3) | {3 – 65535}
(Note 6) | -| New member | Boolean | New member | Boolean | portDS.notMaster (configurable) (Note 8) | FALSE | {TRUE, FALSE} | FALSE | {TRUE, FALSE} | FALSE | {TRUE, FALSE} | - -NOTE 1 – It is not used in this profile, and therefore equipment is not required to support it. -NOTE 2 – The master must support two-way operation. -NOTE 3 – Implementation specific. -NOTE 4 – An implementation can choose a fixed value or base it on negotiated message rate (e.g., a value proportional to the message rate). See Appendix X for further details. -NOTE 5 – In case of [IEEE 1588-2019] based implementations, this data set member is deprecated. -NOTE 6 – The full range is not expected to be supported by an implementation, as the receipt timeout value typically depends on the message rate and the ability of the PTP clock implementation to maintain frequency and time during loss of Sync and/or Delay\_Resp messages. An implementation should be verified only over the expected operating conditions. See Appendix X -NOTE 7 – Applicable to [IEEE 1588-2019] based implementations; this data set member does not exist in [IEEE 1588-2008]. -NOTE 8 – Setting both portDS.masterOnly and portDS.notMaster with value TRUE concurrently is not permitted. -NOTE 9 – If a default value is not provided by this Recommendation, then it is implementation specific. - -### A.3 PTP options - -#### A.3.1 Node types required, permitted or prohibited - -In this profile, the permitted node types are ordinary clocks and boundary clocks. - -The use of transparent clocks is for further study. - -#### A.3.2 Transport mechanisms required, permitted, or prohibited - -In this profile, the required transport mechanism is *Transport of PTP over User Datagram Protocol over Internet Protocol Version 6* as per [IEEE 1588]. - -In this profile, a permitted transport mechanism is *Transport of PTP over User Datagram Protocol over Internet Protocol Version 4* as per [IEEE 1588]. Bit 0 of the transportSpecific field defined in [IEEE 1588-2008] must be set to "0"; that field does not exist in [IEEE 1588-2019]. - -NOTE – Profile versions 1.x specify Internet Protocol Version 4 as "required", while Internet Protocol Version 6 was specified as optional ("permitted"). In principle, profile versions 2.x and later may result in some backward compatibility issues (e.g., in the case of already deployed T-GMs that only support IPv4 and new clocks that only support IPv6). For those cases it would be required to operate all nodes with the same transport mechanism (e.g., in the previous example change the operation of the already deployed T-GMs to IPv6). - -#### A.3.3 Unicast messages - -All messages are sent in unicast. - -In this telecom profile, unicast negotiation is enabled per default. - -The slave will initiate the session by following the unicast message negotiation procedure defined in [IEEE 1588] clause 16.1. - -#### A.3.4 REQUEST\_UNICAST\_TRANSMISSION TLV - -The value of logInterMessagePeriod is the logarithm, to base 2, of the requested mean period, in seconds, between the requested unicast messages. - -For requesting unicast *Announce* messages: The configurable range is 0 to –3 (which represents a range from 1 message per second to eight messages per second). No default rate is specified. - -For requesting unicast *Sync* messages: The configurable range is 0 to –7 (which represents a range from 1 message per second to 128 messages per second). No default rate is specified. - -For requesting unicast *Delay\_Resp* messages: The configurable range is 0 to –7 (which represents a range from 1 message per second to 128 messages per second). No default rate is specified. - -The durationField value in each REQUEST\_UNICAST\_TRANSMISSION TLV has a default initialization value of 300 seconds. The configurable range is 60 seconds to 1000 seconds. - -NOTE 1 – A specific slave implementation, in order to meet its target performance requirements, as normal operation, may support a subset of the message rates within the ranges noted above. A master, on the other hand, is required to support the full range of message transmission rates. Unless an implementation specifies otherwise, the default value listed above is assumed to be used. - -NOTE 2 – A specific slave implementation may support a subset of the durationField values within the range noted above. A master, on the other hand, is required to support the full range of durationField values. Unless an implementation specifies otherwise, the default value listed above is assumed to be used. - -The maintenance and configuration of these default and configuration range values is implementation specific. - -#### A.3.5 GRANT\_UNICAST\_TRANSMISSION TLV - -In implementing the GRANT\_UNICAST\_TRANSMISSION TLV mechanism, the granted values shall be the same as requested in the received REQUEST\_UNICAST\_TRANSMISSION TLV as long as the requests are in the configurable range. - -### A.4 Best master clock algorithm options - -This profile uses the Alternate BMCA described in clause 6.7 of this Recommendation. - -### A.5 Path delay measurement option (delay request/delay response) - -The delay request/delay response mechanism can be used in this profile. The peer delay mechanism shall not be used in this profile. - -### A.6 Configuration management options - -Management aspects are for further study and will be specified in a future version of this profile. - -### **A.7 Clock identity format** - -For implementations based on [IEEE 1588-2008], the procedures to use an EUI-48 to create the EUI-64 clockIdentity as described in clause 7.5.2.2.2 of [IEEE 1588-2008] are no longer recommended. If a clockIdentity is formed by mapping an EUI-48 to an EUI-64, and if the EUI-48 was assigned from an MA-M or MA-S, it is possible that the clockIdentity will be a duplicate of a clockIdentity formed directly from a different MA-M or MA-S (i.e., by appending bits to the end of that different MA-M or MA-S). Only if the EUI-48 was formed from an OUI (MA-L), is the uniqueness ensured. For new implementations based on [IEEE 1588-2019], the clockIdentity shall be constructed as per clause 7.5.2.2.2 of [IEEE 1588-2019]. Non-IEEE clockIdentity formats are not supported. - -For implementations compliant to [IEEE 1588-2019], the clockIdentity shall be constructed as per clause 7.5.2.2.2 of [IEEE 1588-2019]. - -### **A.8 Security aspects** - -Security aspects are for further study. - -### **A.9 Other optional features of IEEE 1588** - -Other optional features of [IEEE 1588] are not used in this version of the profile. - -For implementations compliant to [IEEE 1588-2008] these include alternate timescales (clause 16.3 of [IEEE 1588-2008]), grandmaster clusters (clause 17.3 of [IEEE 1588-2008]), alternate master (clause 17.4 of [IEEE 1588-2008]), acceptable master table (clause 17.6 of [IEEE 1588-2008]), and the experimental cumulative frequency scale factor offset (Annex L of [IEEE 1588-2008]) all within [IEEE 1588]. - -For implementations compliant to [IEEE 1588-2019] these include unicast message negotiation (clause 16.1 of [IEEE 1588-2019]), alternate timescale offsets (clause 16.3 of [IEEE 1588-2019]), grandmaster clusters (clause 17.2 of [IEEE 1588-2019]), alternate master (clause 17.3 of [IEEE 1588-2019]), unicast discovery (clause 17.4 of [IEEE 1588-2019]), acceptable master table (clause 17.5 of [IEEE 1588-2019]), and the Cumulative frequency transfer method for synchronizing clocks (clause 16.10 of [IEEE 1588-2019]). - -### **A.10 PTP common header flags** - -The PTP common header flag values, and whether or not each flag is used in this profile, are given in Table A.6. - -NOTE – Some of these flags are used only in certain PTP messages, and not in all the PTP messages, see [IEEE 1588-2008] clause 13.3.2.6 or clause 13.3.2.8 of [IEEE 1588-2019]. - -For implementations compliant to [IEEE 1588-2008] the following rule defined in [IEEE 1588-2008] clause 13.3.2.6, must be respected: "For message types where the bit is not defined in Table 20, the values shall be FALSE." - -For implementations compliant to [IEEE 1588-2019] the following rule defined in clause 13.3.2.8 of [IEEE 1588-2019], must be respected: "For message types where the bit is not defined in Table 37 of [IEEE 1588-2019], the values shall be FALSE." - -**Table A.6 – PTP flags** - -| Octet | Bit | Flag | Value to be sent | Behaviour for the receiving node | -|-------|-----|-----------------------|---------------------------------------|-------------------------------------| -| 0 | 0 | alternateMasterFlag | See clause 6.9 of this Recommendation | Used | -| 0 | 1 | twoStepFlag | As per PTP | Used | -| 0 | 2 | unicastFlag | TRUE | Used | -| 0 | 5 | PTP profile Specific1 | FALSE | Flag is ignored | -| 0 | 6 | PTP profile Specific2 | FALSE | Flag is ignored | -| 0 | 7 | Reserved | FALSE | Reserved by PTP and flag is ignored | -| 1 | 0 | leap61 | As per PTP (Note 2) | Used | -| 1 | 1 | leap59 | As per PTP (Note 2) | Used | -| 1 | 2 | currentUtcOffsetValid | As per PTP (Notes 2, 3) | Used (Notes 4, 5, 6) | -| 1 | 3 | ptpTimescale | TRUE | Used | -| 1 | 4 | timeTraceable | See Table 3 | Used | -| 1 | 5 | frequencyTraceable | See Table 3 | Used | -| 1 | 6 | (Note 1) | (Note 1) | (Note 1) | - -NOTE 1 – An additional flag "synchronizationUncertain" has been defined in Annex E; the use of the "synchronizationUncertain" flag is optional. - -NOTE 2 – When a clock is in holdover, within holdover specification, the PTP clock may continue to advertise the last known leap second event. If there was no pending leap second event, then the PTP clock continues to advertise FALSE for the pending leap second fields (leap59 and leap61). If there was a pending leap second event, the PTP clock may choose either to advertise FALSE for the pending leap second fields immediately or to continue to advertise the leap second event. In the latter instance the PTP clock would clear the leap59 and leap61 second event field(s) and adjust the UTC offset field at the appropriate time based on its local PTP time (i.e., the local PTP time's UTC timescale rolling over at UTC midnight) if the PTP clock is still in holdover, within holdover specification. When a clock is in holdover, out of holdover specifications, the PTP clock behaviour with respect to leap second event is implementation specific. It is recommended that the PTP clock continue to advertise any upcoming leap second event as appropriate. - -NOTE 3 – When a clock is in holdover, within holdover specification, the PTP clock may continue to advertise the last known UTC offset with UTC offset valid TRUE. If the last known UTC offset valid was FALSE, then the PTP clock continues to advertise FALSE. If the last known UTC offset valid was TRUE then the PTP clock may choose either to advertise UTC offset valid FALSE immediately (freezing the UTC offset value) or to continue to advertise the last known UTC offset with UTC offset valid TRUE. The UTC offset field may be updated as described in Note 2 above. When a clock is in holdover, out of holdover specifications, the PTP clock behaviour with respect to UTC offset is implementation specific. - -NOTE 4 – Usage of currentUtcOffset from an Announce message, which indicates currentUtcOffsetValid as FALSE, may lead to the wrong UTC time calculation. - -NOTE 5 – The alternate BMCA in this profile does not consider or use currentUtcOffsetValid or currentUtcOffset. - -NOTE 6 – The PTP clocks in this profile do not use currentUtcOffsetValid or currentUtcOffset for phase/time synchronization. - -### A.11 Profile version compatibility - -A specific profile version may have backward compatibility with earlier versions of this profile. Table A.7 lists which earlier versions are compatible with each version. Compatibility means that the nodes can operate in the same network provided optional features in a specific profile that are not present in the earlier version are not enabled. - -**Table A.7 – profileVersion compatibility** - -| profileVersion | Base IEEE version | Compatible with the earlier profileVersions | -|-----------------------|--------------------------|----------------------------------------------------| -| 2.3 | [IEEE 1588-2019] | 2.2, 2.1, 2.0,
1.0 (Note) | -| 2.2 | [IEEE 1588-2008] | 2.1, 2.0,
1.0 (Note) | -| 2.1 | [IEEE 1588-2019] | 2.0,
1.0 (Note) | -| 2.0 | [IEEE 1588-2008] | 1.0 (Note) | -| 1.0 | [IEEE 1588-2008] | | - -NOTE – Version 1 of this profile enforced a limited range on acceptable values for clockClass, clockAccuracy, offsetScaledLogVariance and, for the T-TSC, priority2. Reception of values outside of the acceptable range caused the Announce message to be discarded. Version 2.x of the profile supports the full range of these attributes as defined by PTP. In networks deploying ePRTC, which use new values of clockAccuracy and offsetScaledLogVariance that are outside of the version 1 range, all clocks need to use version 2.x of the profile. If no ePRTC are to be deployed in the network, then the network can operate with a mixture of version 1 and version 2.x clocks. - -## **Annex B** - -### **Options to establish the PTP topology with the Alternate BMCA** - -(This annex forms an integral part of this Recommendation.) - -Options to establish the PTP topology with the Alternate BMCA are described in Annex C of [ITU-T G.8275]. - -## Annex C - -## **Inclusion of an external phase/time input interface on a PTP clock** - -(This annex forms an integral part of this Recommendation.) - -The model for inclusion of a unidirectional, external phase/time interface on a PTP clock is provided in Annex B of [ITU-T G.8275]. - -## Annex D - -### TLV for PTP interface rate (optional) - -(This annex forms an integral part of this Recommendation.) - -This annex is optional but, if implemented, it is necessary for the equipment to conform to requirements contained herein. When a PTP port in MASTER state that is providing timing service has a different interface rate than a PTP port in SLAVE state receiving the timing service, delay asymmetry may occur as described in [ITU-T G.8271] Appendix V 'Delay asymmetry resulting from interface rate change in PTP-unaware network elements'. If the slave clock is aware of both its own PTP port interface rate, as well as the master clock PTP port interface rate, then the slave clock may compensate for such delay asymmetry. The following TLV may be appended to a signalling message that contains GRANT\_UNICAST\_TRANSMISSION TLV so that the master clock may communicate its PTP port interface rate to the slave clock. - -**Table D.1 – INTERFACE\_RATE TLV** - -| Bits | | | | | | | | Octets | TLV offset | -|---------------------------|---|---|---|---|---|---|---|--------|------------| -| 7 | 6 | 5 | 4 | 3 | 2 | 1 | 0 | | | -| tlvType | | | | | | | | 2 | 0 | -| lengthField | | | | | | | | 2 | 2 | -| organizationId | | | | | | | | 3 | 4 | -| organizationSubType | | | | | | | | 3 | 7 | -| interfaceBitPeriod | | | | | | | | 8 | 10 | -| numberBitsBeforeTimestamp | | | | | | | | 2 | 18 | -| numberBitsAfterTimestamp | | | | | | | | 2 | 20 | - -### **tlvType (Enum16)** - -The value of tlvType shall be the ORGANIZATION\_EXTENSION value (0x0003) - -#### **lengthField (UInteger16)** - -The value of lengthField shall be 18 bytes. - -### **organizationId (Octet [3])** - -The value of organizationId shall be the OUI value assigned by ITU-T = 0x0019A7. - -### **organizationSubType (Enum24)** - -The value of organizationSubType for the INTERFACE\_RATE TLV shall be 0x000002. - -### **interfaceBitPeriod (UInteger64)** - -The period of 1-bit of the transmitting PTP timestamp interface, excluding line encoding. The value is encoded as an unsigned integer in units of attoseconds ( $10^{-18}$ s) to accommodate interface bit periods less than 1 ns. - -### **numberBitsBeforeTimestamp (UInteger16)** - -The length of the packet prior to the timestamp point, in bits. - -#### **numberBitsAfterTimestamp (Uinteger16)** - -The length of the packet after the timestamp point, in bits. - -By way of example, the following values may be used for 1 GbE interface with Annex D encapsulation. - -- tlvType = 0x0003 -- lengthField = 18 -- organizationId = 0x0019A7 -- organizationSubType = 0x000002 -- interfaceBitPeriod = 0x0000,0000, 3B9A, CA00 -- numberBitsBeforeTimestamp = (8 bytes pre-amble x 8 bits/byte) = 64 -- numberBitsAfterTimestamp = ((86 bytes payload + 4 bytes FCS) x 8 bits/byte) = 720 - -NOTE 1 – The supported interfaces (and interface speed) for an equipment clock are listed in the relevant equipment clock specification (which is for further study), and not in this profile. - -NOTE 2 – The TLV and interfaceBitPeriod format is applicable to single-lane and mutli-lane interfaces. - -Table D.2 shows information about various interface speeds and the appropriate interfaceBitPeriod value. - -**Table D.2 – Informational interface speeds and type mappings** - -| Interface Speed | ns per bit | Atto-sec per bit | 64-bit atto-sec Representation | -|------------------------|-------------------|-------------------------|---------------------------------------| -| 1 | 1,000,000,000.000 | $10^{18}$ | 0x0DE0,B6B3,A764,0000 | -| 10 M | 100.000 | 100,000,000,000 | 0x0000,0017,4876,E800 | -| 100 M | 10.000 | 10,000,000,000 | 0x0000,0002,540B,E400 | -| 1G | 1.000 | 1,000,000,000 | 0x0000,0000,3B9A,CA00 | -| 10 G | 0.100 | 100,000,000 | 0x0000,0000,05F5,E100 | -| 25G | 0.040 | 40,000,000 | 0x0000,0000,0262,5A00 | -| 40G | 0.025 | 25,000,000 | 0x0000,0000,017D,7840 | -| 100G | 0.010 | 10,000,000 | 0x0000,0000,0098,9680 | -| 1 T | 0.001 | 1,000,000 | 0x0000,0000,000F,4240 | - -## **Annex E** - -## **Synchronization uncertain indication (optional)** - -(This annex forms an integral part of this Recommendation.) - -The synchronization uncertain indication is described in Annex D of [ITU-T G.8275]. - -## Annex F - -## Mapping from PTP clockClass values to quality levels - -(This annex forms an integral part of this Recommendation.) - -Referring to [ITU-T G.8275] Appendix IV 'Use cases for mapping from PTP clockClass values to quality levels' this annex covers the quality levels that a PTP clock will output on its frequency interface in various scenarios. - -There are three scenarios: - -- First, the output quality level when the PTP clock is synchronizing to an upstream PTP clock (i.e., the PTP clock parent data set is not that of the local clock) and the PTP clock does not have a physical layer frequency reference. -- Second, the output quality level when the PTP clock is synchronizing to an upstream PTP clock (i.e., the PTP clock parent data set is not that of the local clock) and the PTP clock does have a physical layer frequency reference. -- Third, the output quality level when the PTP clock is not synchronizing to an upstream PTP clock (i.e., the PTP clock parent data set is that of the local clock). - -For the first scenario, Table F.1 maps the received clockClass value to an egress quality level. - -**Table F.1 – Mapping of clockClass values for the first scenario** - -| PTP parentDS.
grandmasterClockQuality.
clockClass | PTP
timePropertiesDS.
frequencyTraceable
flag from PTP parent | ITU-T G.781/G.8264
Option I QLs | ITU-T
G.781/G.8264
Option II QLs | -|---------------------------------------------------------|------------------------------------------------------------------------|------------------------------------|----------------------------------------| -| 6 | N/A | QL-PRC | QL-PRS | -| 7 | TRUE | QL-PRC | QL-PRS | -| 7 | FALSE | Note | Note | -| 135 | TRUE | QL-PRC | QL-PRS | -| 135 | FALSE | Note | Note | -| 140 | N/A | QL-PRC | QL-PRS | -| 150 | N/A | QL-SSU-A | QL-ST2 | -| 160 | N/A | QL-SSU-B | QL-ST3E | -| 165 | N/A | QL-SEC/
QL-EEC1 | QL-ST3/
QL-EEC2 | -| 248 | N/A | QL-SEC/
QL-EEC1 | QL-ST3/
QL-EEC2 | -| 255 | N/A | QL-SEC/
QL-EEC1 | QL-ST3/
QL-EEC2 | - -NOTE – The PTP clock is synchronized to an upstream PTP clock that is non-traceable to a Category 1 frequency source, but is within holdover specification. Typically, a QL of Category 2 is sent, based on assumptions about the T-GM equipment, but it is implementation specific whether the PTP clock sends a QL of Category 1 (QL-PRC/PRS) or some other value. - -NOTE – Updates to [ITU-T G.781] may require updates to Table F.1. This is for further study. - -For the second scenario, the usage of an egress frequency signal can be either an optional physical layer frequency output ([ITU-T G.812], [b-ITU-T G.8262], [b-ITU-T G.8262.1]) if present or the frequency output of the PTP clock [ITU-T G.8273.4]. When the physical layer frequency is used, [ITU-T G.781] and [ITU-T G.8264] for SSM QL-TLV are applicable. When the frequency output of a PTP clock is used, as the PTP clock is synchronizing to an upstream PTP clock, Table F.1 should be used. - -For the third scenario, Table F.2 maps the local clock's clockClass value to an egress quality level. - -**Table F.2 – Mapping of clockClass values for the third scenario** - -| Phase/time traceability description | defaultDS.
clockQuality.
clockClass | ITU-T
G.781/G.8264
Option I QLs | ITU-T
G.781/G.8264
Option II QLs | -|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------|---------------------------------------|----------------------------------------| -| T-GM connected to a PRTC in locked mode (e.g., PRTC traceable to GNSS) | 6 | QL-PRC | QL-PRS | -| T-GM in holdover, within holdover specification, traceable to Category 1 frequency source | 7 | QL-PRC | QL-PRS | -| T-GM in holdover, within holdover specification, non-traceable to Category 1 frequency source | 7 | Note | Note | -| T-BC-P/A in holdover, within holdover specification, traceable to Category 1 frequency source | 135 | QL-PRC | QL-PRS | -| T-BC-P/A in holdover, within holdover specification, non-traceable to Category 1 frequency source | 135 | Note | Note | -| T-GM in holdover, out of holdover specification, traceable to Category 1 frequency source | 140 | QL-PRC | QL-PRS | -| T-GM in holdover, out of holdover specification, traceable to Category 2 frequency source | 150 | QL-SSU-A | QL-ST2 | -| T-GM in holdover, out of holdover specification, traceable to Category 3 frequency source | 160 | QL-SSU-B | QL-ST3E | -| T-BC-P/A in holdover, out of holdover specification | 165 | Note | Note | -| T-GM or T-BC-P/A without time reference since start-up | 248 | Note | Note | -| T-TSC-P/A, acting as an OC (does not send Announce messages) | 255 | Note | Note | -| NOTE – The egress QL is based on the category of the frequency traceable reference. If the clock is syntonized by a physical layer frequency source, then the egress QL is decided by the ingress QL of physical layer frequency source. If the clock is not syntonized (such as if it is relying solely on the local oscillator) then the quality of the local frequency clock is used. | | | | - -## Appendix I - -### Considerations on the use of priority2 - -(This appendix does not form an integral part of this Recommendation.) - -The PTP attribute priority2 is configurable in this profile. In some special circumstances, the use of the priority2 attribute can simplify the network management. This appendix describes two use cases; other possible cases are for further study. - -#### Case 1 - -Operators can configure the PTP attribute priority2 to make all of the T-BC-Ps either traceable to one T-GM, or traceable to two different T-GMs at the same time. - -![Diagram illustrating the use of priority2 with two T-GMs in the network. Two T-GMs (orange circles) are shown at the top. Each T-GM is connected to a T-BC (EEC) (orange circle) via a red square. The T-BC (EEC) from the left T-GM is connected to another T-BC (EEC) via a red square. This second T-BC (EEC) is connected to a third T-BC (EEC) via a dashed line and a red square. The third T-BC (EEC) is connected to a fourth T-BC (EEC) via a red square. The fourth T-BC (EEC) is connected to the T-GM from the right via a red square. The diagram is labeled G.8275.2-Y.1369.2(16)_FI.1.](0f26e70157bd4c45f825795cdcd20fbd_img.jpg) - -G.8275.2-Y.1369.2(16)\_FI.1 - -Diagram illustrating the use of priority2 with two T-GMs in the network. Two T-GMs (orange circles) are shown at the top. Each T-GM is connected to a T-BC (EEC) (orange circle) via a red square. The T-BC (EEC) from the left T-GM is connected to another T-BC (EEC) via a red square. This second T-BC (EEC) is connected to a third T-BC (EEC) via a dashed line and a red square. The third T-BC (EEC) is connected to a fourth T-BC (EEC) via a red square. The fourth T-BC (EEC) is connected to the T-GM from the right via a red square. The diagram is labeled G.8275.2-Y.1369.2(16)\_FI.1. - -Figure I.1 – Use of priority2 with two T-GMs in the network - -For example, in Figure I.1, if all other PTP attributes of the two T-GMs are the same, and the two T-GMs are configured with the same priority2 value, each T-BC-P will select the T-GM with the shortest path. If the two T-GMs are configured with different priority2 values, all of the T-BC-Ps will synchronize to the T-GM with the smallest priority2 value. - -#### Case 2 - -Operators can configure the PTP attribute priority2 to prevent the T-BC-Ps of an upstream network from synchronizing with the T-BC-Ps of a downstream network when the T-GM is in failure. - -![Diagram illustrating the use of priority2 with T-BC-P/As of different network layers. A T-GM (orange circle) is connected to a T-BC (EEC) (orange circle) via a red square. This T-BC (EEC) is part of an 'Upstream network' (oval) and is connected to another T-BC (EEC) via a red square. This second T-BC (EEC) is connected to a third T-BC (EEC) via a red square. The third T-BC (EEC) is connected to a fourth T-BC (EEC) via a red square. The fourth T-BC (EEC) is part of a 'Downstream network' (oval) and is connected to a fifth T-BC (EEC) via a red square. The fifth T-BC (EEC) is connected to a sixth T-BC (EEC) via a red square. The sixth T-BC (EEC) is connected to a seventh T-BC (EEC) via a red square. The seventh T-BC (EEC) is connected to a T-TSC (EEC) (orange circle) via a red square. The diagram is labeled G.8275.2-Y.1369.2(16)_FI.2.](678ac9faaa56bb929499cebeea83a110_img.jpg) - -G.8275.2-Y.1369.2(16)\_FI.2 - -Diagram illustrating the use of priority2 with T-BC-P/As of different network layers. A T-GM (orange circle) is connected to a T-BC (EEC) (orange circle) via a red square. This T-BC (EEC) is part of an 'Upstream network' (oval) and is connected to another T-BC (EEC) via a red square. This second T-BC (EEC) is connected to a third T-BC (EEC) via a red square. The third T-BC (EEC) is connected to a fourth T-BC (EEC) via a red square. The fourth T-BC (EEC) is part of a 'Downstream network' (oval) and is connected to a fifth T-BC (EEC) via a red square. The fifth T-BC (EEC) is connected to a sixth T-BC (EEC) via a red square. The sixth T-BC (EEC) is connected to a seventh T-BC (EEC) via a red square. The seventh T-BC (EEC) is connected to a T-TSC (EEC) (orange circle) via a red square. The diagram is labeled G.8275.2-Y.1369.2(16)\_FI.2. - -Figure I.2 – Use of priority2 with T-BC-P/As of different network layers - -For example, in Figure I.2, if all other PTP attributes of all of the T-BC-Ps are the same, and the PTP attribute priority2 of all of T-BC-Ps are configured with the same value, then when the T-GM is in failure, the T-BC-Ps in the upstream network can synchronize with the T-BC-Ps in the downstream network, depending on the clockIdentity values of all of the T-BC-Ps. If the T-BC-Ps in the upstream network are configured with a smaller priority2 value than the T-BC-Ps in the downstream network then, when the T-GM is in failure, the T-BC-Ps in the downstream network will synchronize to the T-BC-Ps in the upstream network. - -NOTE – The examples of this clause also apply when T-BC-As are deployed rather than T-BC-Ps. - -## Appendix II - -### Considerations on a T-TSC-A or T-TSC-P connected to an end application - -(This appendix does not form an integral part of this Recommendation.) - -The default T-TSC-A and T-TSC-P clockClass (248 for BC and 255 for OC) generally implies that the T-TSC-A or T-TSC-P will lock to the local time reference as a primary source of time (in case of APTS) or to an external PTP reference when available. - -The actual synchronization source ultimately used by the end application depends on the applicable synchronization needs. This process is out of the scope of this recommendation. - -As an example, the decision to use the PTP reference that has been selected by the T-TSC-A or T-TSC-P (e.g., instead of entering holdover), could depend on the actual clockQuality, frequencyTraceable flag and timeTraceable flag associated to the T-TSC-A or T-TSC-P input. Additional aspects as related to performance monitoring of the external reference might also be considered. This is implementation specific. - -As an example, when it is required to meet the network timing requirements as per e.g., [ITU-T G.8271], it would be necessary that the external reference has clockClass 6, 7 or 135 and that the timeTraceable flag is TRUE in order to be used by the End Application. When this condition is not met, the end application may decide to enter holdover (either on the internal oscillator or driven by synchronous Ethernet). - -NOTE – The specific behaviour for the T-TSC-P or T-TSC-A embedded in the end application is outside the scope of this Recommendation. It is assumed that interoperability with the profile is maintained. - -## Appendix III - -## PTP monitoring backup scenario example - -(This appendix does not form an integral part of this Recommendation.) - -Figure III.1 shows an example of a PTP deployment in steady-state, prior to a PTP connection failure between T-GM #A and T-BC-P #D. The following connectivity between the equipment is shown: - -- T-GM #A is providing PTP service to T-BC-P #C -- T-GM #A is providing PTP service to T-BC-P #D -- T-BC-P #C is providing PTP service to T-TSC-P#E -- T-BC-P #D is providing PTP service to T-TSC-P #F - -In addition, the figure shows two PTP connections that are not actively used for synchronization. - -- T-BC-P #D is providing PTP service to T-BC-P #C, but T-BC-P #C is not selecting T-BC-P #D as the best PTP clock source. T-BC-P #C is providing PTP service to T-BC-P #D with the alternateMasterFlag set to TRUE on egress PTP messages to indicate its local port is in the PASSIVE state. T-BC-P #D is not selecting T-BC-P #C as the best PTP clock source. - -The PTP connections between the T-BC-Ps allow the T-BC-Ps to support some specific types of monitoring. For example, the T-BC-P #D may monitor and learn the PDV characteristics of the PTP service from T-BC-P #C. This may be used to help the T-BC-P #D to synchronize more quickly to the T-BC-P #C backup PTP flow should the connection to the T-GM #A fail. - -![Diagram of a PTP deployment showing T-GM #A connected to two networks, which are then connected to T-BC-P #C and T-BC-P #D. T-BC-P #C is connected to a network leading to T-TSC-P #E. T-BC-P #D is connected to a network leading to T-TSC-P #F. There is also a connection between T-BC-P #C and T-BC-P #D.](5c3dd31372f59e15250f0ab1613ca485_img.jpg) - -The diagram illustrates a PTP deployment. At the top, a box labeled 'T-GM #A' has two ports labeled 'M'. Each port is connected to a cloud labeled 'Network'. Below the left 'Network' cloud is a box labeled 'T-BC-P #C' with ports 'S', 'P', and 'M'. Below the right 'Network' cloud is a box labeled 'T-BC-P #D' with ports 'M' and 'S'. A dashed double-headed arrow labeled 'Network' connects the 'P' port of T-BC-P #C to the 'M' port of T-BC-P #D. Below the 'M' port of T-BC-P #C is a 'Network' cloud leading to a box labeled 'T-TSC-P #E' with port 'S'. Below the 'S' port of T-BC-P #D is a 'Network' cloud leading to a box labeled 'T-TSC-P #F' with port 'S'. - -Diagram of a PTP deployment showing T-GM #A connected to two networks, which are then connected to T-BC-P #C and T-BC-P #D. T-BC-P #C is connected to a network leading to T-TSC-P #E. T-BC-P #D is connected to a network leading to T-TSC-P #F. There is also a connection between T-BC-P #C and T-BC-P #D. - -G.8275.2-Y.1369.2(16)-Amd.1(17)\_FIII.1 - -Figure III.1 – Steady-state, before A-D PTP connection failure - -Figure III.2 shows the PTP deployment example in a steady-state, after the PTP connection failure between T-GM #A and T-BC-P #D. The T-BC-P #D takes advantage of the pre-failure monitoring of the T-BC-P #C PTP connection to enable a faster and less disruptive switching of the PTP service to an alternate source. After reaching steady-state again, the following connectivity takes place between the equipment: - -- T-GM #A is providing PTP service to T-BC-P #C -- T-BC-P #C is providing PTP service to T-BC-P #D -- T-BC-P #C is providing PTP service to T-TSC-P#E -- T-BC-P #D is providing PTP service to T-TSC-P #F - -In addition, there is one PTP connection that is not actively used for synchronization. - -- T-BC-P #D is providing PTP service to T-BC-P #C with the alternateMasterFlag set to TRUE on egress PTP messages to indicate that its local port is in the SLAVE state. T-BC-P #C is not selecting T-BC-P #D as the best PTP clock source. - -![Diagram of PTP deployment in a steady-state after a failure. T-GM #A is at the top, connected via a network to T-BC-P #C. T-BC-P #C is connected via a network to T-TSC-P #E and via another network to T-BC-P #D. T-BC-P #D is connected via a network to T-TSC-P #F. There is a failed connection between T-GM #A and T-BC-P #D, indicated by a crossed-out network cloud. Port states are shown: T-GM #A has two Master (M) ports; T-BC-P #C has one Slave (S) port facing T-GM #A, one Master (M) port facing T-TSC-P #E, and one Master (M) port facing T-BC-P #D; T-BC-P #D has one Slave (S) port facing T-BC-P #C, one Master (M) port facing T-TSC-P #F, and one Master (M) port facing T-GM #A (failed).](08f6ace0c83e7394657fa372b47aec04_img.jpg) - -Diagram of PTP deployment in a steady-state after a failure. T-GM #A is at the top, connected via a network to T-BC-P #C. T-BC-P #C is connected via a network to T-TSC-P #E and via another network to T-BC-P #D. T-BC-P #D is connected via a network to T-TSC-P #F. There is a failed connection between T-GM #A and T-BC-P #D, indicated by a crossed-out network cloud. Port states are shown: T-GM #A has two Master (M) ports; T-BC-P #C has one Slave (S) port facing T-GM #A, one Master (M) port facing T-TSC-P #E, and one Master (M) port facing T-BC-P #D; T-BC-P #D has one Slave (S) port facing T-BC-P #C, one Master (M) port facing T-TSC-P #F, and one Master (M) port facing T-GM #A (failed). - -G.8275.2-Y.1369.2(16)-Amd.1(17)\_FIII.2 - -**Figure III.2 – Steady-state, after A-D PTP connection failure** - -In Figures III.1 and III.2 the inter-connection between T-BC-P #C and T-BC-P #D is shown using a single PTP port on T-BC-P #C and a single PTP port on T-BC-P #D. The inter-connection could alternatively be shown using two PTP ports; one PTP port on T-BC-P #C providing PTP service to one PTP port on T-BC-P #D, and a second PTP port on T-BC-P #D providing PTP service to a second PTP port on T-BC-P #C. - -NOTE – The examples of this clause also apply when T-BC-As are deployed rather than T-BC-Ps. - -## Appendix IV - -### **Description of PTP clock modes and associated contents of Announce messages** - -(This appendix does not form an integral part of this Recommendation.) - -Description of PTP clock modes and associated contents of Announce messages are described in Appendix VIII of [ITU-T G.8275]. - -## Appendix V - -## BMCA cycling between masters - -(This appendix does not form an integral part of this Recommendation.) - -This appendix describes a scenario where a PTP clock's BMCA may end up cycling (repeatedly switching) between master PTP clocks. - -### V.1 Scenario where a PTP clock's BMCA cycles between two masters - -Consider the example scenario shown in Figure V.1 where a PTP clock has two candidate masters available in its unicast master table. In this example a T-GM #A has a better clockIdentity than a T-GM #B. Here only the Sync service is described (rather than both Sync & Delay\_Resp service) to simplify the description. - -![Diagram showing a PTP clock connected to two candidate masters, T-GM #A and T-GM #B, via separate network paths.](c0c7f65c51c83fbe595b47326f6b089a_img.jpg) - -The diagram illustrates a PTP clock at the bottom connected to two candidate masters, T-GM #A and T-GM #B, at the top. Each master is connected to the PTP clock through a separate network cloud. Arrows indicate the flow of communication from each network cloud down to the PTP clock. - -Diagram showing a PTP clock connected to two candidate masters, T-GM #A and T-GM #B, via separate network paths. - -G.8275.2-Y.1369.2(16)-Amd.1(17)\_FV.1 - -Figure V.1 – Example of a PTP clock with two candidate T-GMs - -The following sequence of events may cause cycling of the PTP clock BMCA between a T-GM #A and a T-GM #B: - -- 1) The PTP clock requests Announce service from a T-GM #A and a T-GM #B -- 2) The PTP clock selects a T-GM #A as a best master based on the Announce information content (clockIdentity in this example) -- 3) The PTP clock requests Sync service from a T-GM #A -- 4) The PTP clock does not get the Sync service from the T-GM #A, raising PTSF-lossOfTimingMessages - - The PTSF-lossOfTimingMessages is a contributor to SF in the BMCA -- 5) The PTP clock selects T-GM #B based on T-GM-#A having PTSF alarm -- 6) The PTP clock requests Sync service from T-GM #B and receives that Sync service -- 7) The PTP clock chooses to cancel the Sync unicast session for T-GM #A as T-GM #A is no longer selected as best master -- 8) The PTP clock clears T-GM #A PTSF-lossOfTimingMessages alarm -- 9) The PTP clock selects T-GM #A based on better Announce clockClass [**repeats step #2**]. - -### V.2 Approaches to avoid a PTP clock's BMCA from cycling between two masters - -This clause describes possible approaches to avoid or reduce the BMCA cycling phenomenon. - -#### V.2.1 Requesting Sync and/or Delay\_Resp service for non-selected masters - -In order to avoid the cycling scenario, the PTP clock, when requesting Announce service from a non-selected master in the unicast master table, may request Sync and Delay\_Resp service from that non-selected master. This allows constant monitoring of the non-selected masters' ability to deliver expected Sync and Delay\_Resp service. - -Additionally, the PTP clock, when de-selecting a master, may choose not to cancel the existing Sync and Delay\_Resp unicast sessions. - -As a result, when Sync service is not received from the non-selected master, the PTSF-lossOfTimingMessages would not be cleared when a master moves from selected to non-selected role. - -With this approach, based on the above example, when the T-GM #A is not selected the PTP Clock will request (or not cancel) Sync service from T-GM #A. Given that the Sync service from T-GM #A is not received, the PTP clock will maintain the PTSF-lossOfTimingMessages alarm TRUE. - -As a result, the PTP clock will stay on T-GM #B until such time as T-GM #A Sync service is detected available (and PTSF-lossOfTimingMessages alarm is FALSE). - -NOTE – This mechanism is also fully applicable to single Master (T-GM #A without T-GM #B) configurations. It asserts PTSF-lossOfTimingMessages but allows detecting the return to normal behaviour by this Master. - -#### V.2.2 Disqualify master triggering PTSF lossSync alarm - -In order to avoid the cycling scenario, a slave can choose to cancel Sync and Delay\_Resp unicast sessions with a master that has triggered a PTSF lossSync alarm. With this approach, the slave will not request Sync and Delay\_Resp unicast sessions with any master in the unicast master table having a PTSF alarm set. Further, PTSF alarms on all masters will be cleared if and when the slave's local time source D0 is selected as best master by the BMCA (i.e., no external master is available) or by management. Any new master added to the unicast master table will start off with the PTSF flag set to FALSE, and the flag will remain FALSE until unicast negotiation is completed. As a result, any master that triggers a PTSF alarm will not be selected as best master until no other candidates are available. In order to use this feature, there must be a dedicated PTP port for each master in the unicast master table. - -NOTE – This mechanism is not recommended for single Master (T-GM #A without T-GM #B) configurations. It would allow detecting the return to normal behaviour by this Master, but also create endless and useless oscillations on the single Master's PTSF-lossOfTimingMessages. - -## Appendix VI - -### Considerations of PTP over IP transport in ring topologies - -(This appendix does not form an integral part of this Recommendation.) - -When using PTP messaging over an IP transport layer, there are some aspects of the Layer 3 protocol that need to be considered. The PTP layer delivers messages into the IP layer with a destination IP address. The IP layer then ensures the message is delivered to the destination as long as there is some path through the IP transport network from the source node to the destination address. The IP layer includes dynamic routing protocols that can adapt the path through the network based on available links between the IP routers. It can happen that the path taken by the IP transport layer may not be the path 'expected' by the synchronization planner. Applying some restrictions in the IP transport layer to control suboptimal paths for PTP messages may be beneficial. This is likely to be the case in ring topologies. - -Taking the topology shown in Figure VI.1 as an example, the slave is configured to request unicast service from both BC3 and BC4. After receiving the Announce messages from both BC3 and BC4, the slave will run the BMCA and select BC4 as its parent clock based on the fact that the steps-removed value of BC4 is 1, compared to a steps-removed value of 3 for BC3. The slave would then request Sync messages from BC4. - -![Diagram of a ring network topology showing PTP operation. The ring consists of four routers (R1, R2, R3, R4, R5, R6) and four boundary clocks (BC1, BC2, BC3, BC4). Two grandmasters (GM1, GM2) are connected to R1 and R2. The Slave is connected to R6. The Slave sends unicast request messages to BC3 and BC4. BC4 is selected as the parent clock because it has a lower steps-removed value (1) compared to BC3 (3).](18e519d1f91133e080347562f681dfb5_img.jpg) - -The diagram illustrates a ring network topology for PTP operation. At the top, two Grandmasters (GM1 and GM2) are connected to routers R1 and R2 respectively. R1 and R2 are connected to each other and to boundary clocks BC4 and BC1. BC1 is connected to router R3, which is connected to boundary clock BC2. BC2 is connected to router R4, which is connected to router R5. R5 is connected to boundary clock BC3, which is connected to router R6. R6 is connected to the Slave and back to BC4, completing the ring. The Slave sends unicast request messages (dashed arrows) to BC3 and BC4. BC4 is selected as the parent clock because it has a lower steps-removed value (1) compared to BC3 (3). A red arrow shows the Slave requesting Sync messages from BC4. - -Figure VI.1 – Normal operation - -G.8275.2-Y.1369.2(17)\_FVI.1 - -Diagram of a ring network topology showing PTP operation. The ring consists of four routers (R1, R2, R3, R4, R5, R6) and four boundary clocks (BC1, BC2, BC3, BC4). Two grandmasters (GM1, GM2) are connected to R1 and R2. The Slave is connected to R6. The Slave sends unicast request messages to BC3 and BC4. BC4 is selected as the parent clock because it has a lower steps-removed value (1) compared to BC3 (3). - -Figure VI.1 – Normal operation - -If the connection between BC4 and R6 breaks (see Figure VI.2), then BC4 is not reached through the expected path. However, it can still be reached because routing protocols will retain the connection by routing the IP packets around the ring. BC4 is retained as the parent clock because it is still considered better by the BMCA. - -![Diagram illustrating the operation during a link failure between BC4 and R6 in a network ring. The ring consists of four routers (R1, R2, R3, R4, R5, R6) and four boundary clocks (BC1, BC2, BC3, BC4). Two Grandmasters (GM1 and GM2) are connected to R1 and R2. A Slave is connected to R6. The link between BC4 and R6 is failed, indicated by an 'X'. Red arrows show the flow of PTP messages (Unicast request, announce, sync, Delay_Resp) from the Slave to BC3 and then to BC4. Green dashed arrows show the flow of PTP messages from BC4 to the Slave. Text labels indicate 'Steps removed 1' near BC4 and 'Steps removed 3' near BC3. The diagram is labeled G.8275.2-Y.1369.2(17)_FVI.2.](a2251e3bbfcd726b68cc50b091e53b02_img.jpg) - -The diagram shows a network ring with routers R1 through R6 and boundary clocks BC1 through BC4. GM1 and GM2 are connected to R1 and R2 respectively. A Slave is connected to R6. The link between BC4 and R6 is failed, marked with an 'X'. Red arrows indicate the path of PTP messages (Unicast request, announce, sync, Delay\_Resp) from the Slave to BC3 and then to BC4. Green dashed arrows indicate the path of PTP messages from BC4 to the Slave. Text labels 'Steps removed 1' and 'Steps removed 3' are present near BC4 and BC3 respectively. The diagram is labeled G.8275.2-Y.1369.2(17)\_FVI.2. - -Diagram illustrating the operation during a link failure between BC4 and R6 in a network ring. The ring consists of four routers (R1, R2, R3, R4, R5, R6) and four boundary clocks (BC1, BC2, BC3, BC4). Two Grandmasters (GM1 and GM2) are connected to R1 and R2. A Slave is connected to R6. The link between BC4 and R6 is failed, indicated by an 'X'. Red arrows show the flow of PTP messages (Unicast request, announce, sync, Delay\_Resp) from the Slave to BC3 and then to BC4. Green dashed arrows show the flow of PTP messages from BC4 to the Slave. Text labels indicate 'Steps removed 1' near BC4 and 'Steps removed 3' near BC3. The diagram is labeled G.8275.2-Y.1369.2(17)\_FVI.2. - -**Figure VI.2 – Operation during a link failure between BC4 and R6** - -It is most likely that the desired operation is that the slave should switch to BC3 for better performance. - -There are a few techniques that can be employed to ensure that in the failure scenario identified above, the slave will select BC3 as its parent clock. They are based on blocking the PTP IP messages from BC4 to the slave if those messages are transiting clockwise around the ring. The solution is based on blocking only the PTP messages and not the message of other protocols that might use the same IP addresses. - -### **Option 1 – Unique IP addresses and static routes** - -In some deployment models, it may be possible to allocate unique IP addresses for the use of PTP alone. This then allows the use of static routes to control the direction of the PTP flows between the nodes. BC4 would be configured such that the only path to use to reach 11.5.100.141 (slave) would be the link between BC4 and R6. In addition, R6 could be configured such that the only path to use to reach 11.5.100.104(BC4) would be the link between R6 and BC4. If the link between R6 and BC4 fails, then there is no route available to get the IP packets between 11.5.100.141 and 11.5.100.104 so the slave will not receive Announces from BC4 and the BMCA will select BC3 as the parent clock. This is shown in Figure VI.3. - -![Diagram illustrating a network topology with a link failure between BC4 and R6. The network includes two GMs (GM1, GM2), four BCs (BC1, BC2, BC3, BC4), and five Routers (R1, R2, R3, R4, R5, R6). A dashed yellow line shows the PTP path. A red arrow shows a unicast request from the Slave to BC3 via R6. A green dashed arrow shows a unicast request from the Slave to BC3. A red 'X' marks the failed link between BC4 and R6. Text labels indicate 'Steps removed 1' and 'Steps removed 3'.](cbab05075b3d7dc0d27c4cbb0c914a94_img.jpg) - -The diagram shows a network topology with the following components and connections: - -- GM1** (11.5.100.121/32) connected to **R1**. -- GM2** (11.5.100.122/32) connected to **R2**. -- R1** connected to **R2** and **BC4**. -- R2** connected to **R1** and **BC1**. -- BC1** (11.5.100.101/32) connected to **R2** and **R3**. -- R3** connected to **BC1** and **BC2**. -- BC2** (11.5.100.102/32) connected to **R3** and **R4**. -- R4** connected to **BC2** and **R5**. -- R5** connected to **R4** and **BC3**. -- BC3** (11.5.100.103/32) connected to **R5** and **R6**. -- R6** connected to **BC3** and **BC4**. -- BC4** (11.5.100.104/32) connected to **R6** and **R1**. -- A **Slave** (11.5.100.141/32) connected to **R6**. - -Key events and annotations: - -- A dashed yellow line represents the PTP path, which is broken at the link between **BC4** and **R6** (marked with a red 'X'). -- A red arrow points from the **Slave** to **BC3** via **R6**, labeled "Unicast request announce, sync, Delay\_Resp". -- A green dashed arrow points from the **Slave** to **BC3**, labeled "Unicast request announce – No response". -- Text "Steps removed 1" is near **BC4**. -- Text "Steps removed 3" is near **BC3**. -- Diagram code: G.8275.2-Y.1369.2(17)\_FVI.3 - -Diagram illustrating a network topology with a link failure between BC4 and R6. The network includes two GMs (GM1, GM2), four BCs (BC1, BC2, BC3, BC4), and five Routers (R1, R2, R3, R4, R5, R6). A dashed yellow line shows the PTP path. A red arrow shows a unicast request from the Slave to BC3 via R6. A green dashed arrow shows a unicast request from the Slave to BC3. A red 'X' marks the failed link between BC4 and R6. Text labels indicate 'Steps removed 1' and 'Steps removed 3'. - -**Figure VI.3 – Operation during a link failure between BC4 and R6 when static routes are used** - -### Option 2 – IP filters - -All routers support some level of IP filtering. Filters can be used to protect the control plane of the router from unwanted messages. They can be used in this case to control the acceptance of PTP messages on a subset of the routing interfaces. - -In this case, R6 would be configured to protect the slave from PTP messages taking the wrong route. On the interface on R6 facing BC3, a filter could be applied to only allow messages to UDP port 319 or 320 if the source address matches that of the PTP process on BC3. Any messages sourced from BC4 that are received on that interface would be dropped. This is shown in Figures VI.4 and VI.5. - -![Figure VI.4: Normal operation with IP filters in R6. This network diagram shows a mesh of routers (R1-R6) and boundary clocks (BC1-BC4) connected to Grandmasters (GM1, GM2). A Slave is connected to R6. R6 has two IP filter rules: 'If UDP port = 319 or 320 and source IP address # 11.5.100.104 then drop message' and 'If UDP port = 319 or 320 and source IP address # 11.5.100.103 then drop message'. A red arrow from BC4 to R6 is blocked by a filter. A green dashed arrow from Slave to BC4 is labeled 'Unicast request announce, sync, Delay_Resp' and 'Steps removed 1'. A yellow dashed arrow from Slave to BC3 is labeled 'Unicast request announce' and 'Steps removed 3'. A red arrow from R6 to BC4 is also blocked. A text label 'G.8275.2-Y.1369.2(17)_FVI.4' is in the bottom right.](c0b9e5fc63e19306394e0d4249da62cd_img.jpg) - -Figure VI.4: Normal operation with IP filters in R6. This network diagram shows a mesh of routers (R1-R6) and boundary clocks (BC1-BC4) connected to Grandmasters (GM1, GM2). A Slave is connected to R6. R6 has two IP filter rules: 'If UDP port = 319 or 320 and source IP address # 11.5.100.104 then drop message' and 'If UDP port = 319 or 320 and source IP address # 11.5.100.103 then drop message'. A red arrow from BC4 to R6 is blocked by a filter. A green dashed arrow from Slave to BC4 is labeled 'Unicast request announce, sync, Delay\_Resp' and 'Steps removed 1'. A yellow dashed arrow from Slave to BC3 is labeled 'Unicast request announce' and 'Steps removed 3'. A red arrow from R6 to BC4 is also blocked. A text label 'G.8275.2-Y.1369.2(17)\_FVI.4' is in the bottom right. - -**Figure VI.4 – Normal operation with IP filters in R6** - -![Figure VI.5: Operation during a link failure between BC4 and R6 with IP filters in R6. This diagram is similar to Figure VI.4 but shows a link failure between BC4 and R6, indicated by a large 'X' on the connection line. A yellow dashed arrow from BC4 to R6 is blocked by a filter and labeled 'PTP messages from BC4 dropped by filter'. A red arrow from R6 to BC3 is blocked by a filter. A green dashed arrow from Slave to BC3 is labeled 'Unicast request announce, sync, Delay_Resp' and 'Steps removed 3'. A text label 'G.8275.2-Y.1369.2(17)_FVI.5' is in the bottom right.](3c99312f83459559d9a301148555d7b9_img.jpg) - -Figure VI.5: Operation during a link failure between BC4 and R6 with IP filters in R6. This diagram is similar to Figure VI.4 but shows a link failure between BC4 and R6, indicated by a large 'X' on the connection line. A yellow dashed arrow from BC4 to R6 is blocked by a filter and labeled 'PTP messages from BC4 dropped by filter'. A red arrow from R6 to BC3 is blocked by a filter. A green dashed arrow from Slave to BC3 is labeled 'Unicast request announce, sync, Delay\_Resp' and 'Steps removed 3'. A text label 'G.8275.2-Y.1369.2(17)\_FVI.5' is in the bottom right. - -**Figure VI.5 – Operation during a link failure between BC4 and R6 with IP filters in R6** - -### Option 3 – BC processing of all PTP messages - -A BC could terminate all PTP messages received into any of its ports for any domains used by the BC. Then the PTP messages could either be dropped or forwarded based on decisions within the PTP process itself. The choices might be to drop the message if the destination address of the PTP message was not an address owned by the BC or to deliver to the forwarding engine to be sent onward to the destination. The latter case might be used if the PTP message is for a different domain than the BC. Also in the latter case, the network element containing the BC might also update the correctionField of any forwarded event messages to compensate for the PTP message extraction and processing, i.e., support the transparent clock function for these messages. The message extraction from the IP plane can be accomplished if the router supports the policy based routing of IP packets. - -This example is shown in Figure VI.6. - -![Diagram illustrating the operation during a link failure if all PTP messages are terminated. The diagram shows a ring network topology with two Grandmasters (GM1, GM2) connected to routers (R1, R2). R1 and R2 are connected to BC4 and BC1 respectively. BC4 and BC1 are connected to R6 and R3. R6 and R3 are connected to BC3 and BC2. BC3 and BC2 are connected to R5 and R4. R5 and R4 are connected to each other. A Slave is connected to R6. A link failure is indicated between BC4 and R6. The Slave sends a Unicast request announce - X to R6. R6 drops the message (indicated by a red 'X'). R6 also sends a Unicast request announce, sync, Delay_Resp to BC3 (indicated by a green dashed arrow). BC3 receives the message and updates the correctionField (indicated by 'Steps removed 3'). A note indicates that if UDP port = 319 or 320, the packet is forwarded to the local PTP process for forwarding decisions. The diagram is labeled G.8275.2-Y.1369.2(17)_FVI.6.](9b1ec0090070bdf52ea28763b8d52477_img.jpg) - -The diagram illustrates a ring network topology for PTP. At the top, GM1 (11.5.100.121/32) and GM2 (11.5.100.122/32) are connected to routers R1 and R2 respectively. R1 and R2 are connected to BC4 (11.5.100.104/32) and BC1 (11.5.100.101/32). BC4 and BC1 are connected to R6 and R3. R6 and R3 are connected to BC3 (11.5.100.103/32) and BC2 (11.5.100.102/32). BC3 and BC2 are connected to R5 and R4. R5 and R4 are connected to each other. A Slave (11.5.100.141/32) is connected to R6. A link failure is indicated between BC4 and R6 with a red 'X'. The Slave sends a 'Unicast request announce - X' to R6, which is dropped. R6 also sends a 'Unicast request announce, sync, Delay\_Resp' to BC3 via a green dashed arrow. BC3 receives the message and updates the correctionField, with a note 'Steps removed 3'. A text box indicates: 'If UDP port = 319 or 320, forward the packet to the local PTP process for forwarding decisions'. The diagram is labeled 'G.8275.2-Y.1369.2(17)\_FVI.6'. - -Diagram illustrating the operation during a link failure if all PTP messages are terminated. The diagram shows a ring network topology with two Grandmasters (GM1, GM2) connected to routers (R1, R2). R1 and R2 are connected to BC4 and BC1 respectively. BC4 and BC1 are connected to R6 and R3. R6 and R3 are connected to BC3 and BC2. BC3 and BC2 are connected to R5 and R4. R5 and R4 are connected to each other. A Slave is connected to R6. A link failure is indicated between BC4 and R6. The Slave sends a Unicast request announce - X to R6. R6 drops the message (indicated by a red 'X'). R6 also sends a Unicast request announce, sync, Delay\_Resp to BC3 (indicated by a green dashed arrow). BC3 receives the message and updates the correctionField (indicated by 'Steps removed 3'). A note indicates that if UDP port = 319 or 320, the packet is forwarded to the local PTP process for forwarding decisions. The diagram is labeled G.8275.2-Y.1369.2(17)\_FVI.6. - -Figure VI.6 – Operation during the link failure if all PTP messages are terminated - -### Option 4 – Use of the time to live (TTL) mechanism from IP transport - -A PTP node may send PTP packets with the IP/Transport header carrying a time to live (TTL) field set to the minimum number of routing hops required to reach the peer PTP port with which it has a PTP contract. In a typical PTP-unaware network having unaware routers between master and slave, if the number of PTP unaware routers is larger than the TTL value of the PTP message, the PTP message will be dropped by one of the PTP-unaware routers. This can be used to limit the number of IP hops traversed by PTP packets between adjacent routers and avoiding communication through unwanted longer paths. - -This behaviour may be per PTP port, or per PTP clock, and is implementation specific. It is assumed that in such a ring topology, IP routing will take care of ensuring that a shorter path to the PTP master is considered as a better route than the longer path around the ring. - -As an example, if a slave clock has a directly connected master that can also be reachable through a longer path, it can use the TTL value of 1 to ensure that PTP packets reach the master only through the directly connected path rather than the longer path around the ring. - -## Appendix VII - -## Considerations on the configuration of PTSF-lossOfTimingMessages - -(This appendix does not form an integral part of this Recommendation.) - -The PTSF-lossOfTimingMessages may be set in the following scenarios. The operator should carefully consider which scenarios are relevant to the deployment: - -- Failure to establish a contract with the best Master (as determined by the BMCA), due to no reply to a timing service request(s) or denial of a timing service request(s) (i.e., requests for timing messages, which include Sync, and Delay\_Resp but exclude Announce). - - To mitigate this issue, the implementation should generate the PTSF-lossOfTimingMessages alarm and select another available Master. - - Note that setting a shorter timeout value for the reception of granted messages would allow for faster selection of another Master, limiting the holdover period. -- Total loss of timing service (Announce, Sync, and Delay\_Resp) after a contract is established. - - To mitigate this issue, the implementation should enter holdover and try selecting another available Master. - - Note that setting a shorter timeout value for the reception of timing messages would allow for faster selection of another Master, limiting the holdover period. - - The BMCA cycling issue, discussed in Annex V, proposes two possible ways to avoid endless alternating selection among Masters. - - The PTSF-lossOfTimingMessages timer for missing timing messages (Sync and Delay\_Resp) is independent from the one used for the Announce messages. Simultaneous loss of all messages may result in the triggering of PTSF-lossOfTimingMessages or announceReceiptTimeout, depending on which timer expires first. - -As discussed in Appendix V, the PTSF-lossOfTimingMessages may be cleared after either normal delivery of timing service is restored, or other specific conditions to avoid the BMCA cycling issue occur. - -Operators should carefully consider which scenarios are relevant to their deployments. - -## Appendix VIII - -## Operations over link aggregation - -(This appendix does not form an integral part of this Recommendation.) - -When two devices embedding PTP clocks compliant with this profile are connected via a link aggregation (LAG) as defined in [b-IEEE 802.1AX], each physical link should be accessed directly to transmit PTP messages, bypassing the LAG. This method prevents potential asymmetries that may be present when the forward and reverse paths are delivered over different links belonging to the LAG. - -This functional model is only a suggested approach to implement this behaviour. - -### VIII.1 Functional model - -One way of selecting the same link under a LAG bundle between two nodes R1 and R2 (see Figure VIII.1), is to explicitly map/configure the child interfaces/links under a given LAG bundle as primary, secondary and/or tertiary interfaces for the exchange of PTP packets. - -By doing this, both ends of LAG bundle (R1 and R2) will deterministically select the same link for the PTP packet exchange (both in Tx and Rx direction). With the order of configuration, on failure of primary link, the secondary link will be selected, and on failure of secondary link, the tertiary link will be selected. - -NOTE 1 – This functional model considers only two T-BC-Ps or T-BC-P and T-TSC-P connected over direct links using a LAG bundle, there is no PTP unaware nodes between T-BC-Ps or T-BC-P and T-TSC-P. - -NOTE 2 – It is optional to specify more than two child interfaces for exchange of PTP packets in a LAG bundle. - -NOTE 3 – Specifying primary and secondary links is only applicable for the exchange of PTP packets. It will not alter any data or affect other non-PTP packets transmitted over the LAG bundle nor will it disturb any link selection algorithms used for other protocols. - -![Diagram illustrating the LAG bundle link selection example. Two nodes, R1 (T-BC-P) and R2 (T-BC-P), are connected via a LAG bundle (AE0) consisting of three child links: Link-1 (Primary), Link-2 (Secondary), and Link-3. R1 is connected to a T-GM (M) and R2 is connected to a T-TSC-P (S). The diagram shows the flow of PTP packets from the T-GM through R1, over the LAG bundle (specifically over Link-1 as the primary path), through R2, to the T-TSC-P.](7913c315e0db8233cb1ac2455e4a0a81_img.jpg) - -The diagram shows two main nodes, R1 (T-BC-P) and R2 (T-BC-P), connected via a LAG bundle labeled AE0. R1 is connected to a T-GM (M) and R2 is connected to a T-TSC-P (S). The LAG bundle contains three child links: Link-1 (Primary), Link-2 (Secondary), and Link-3. Arrows indicate the flow of PTP packets from the T-GM through R1, over the LAG bundle (specifically over Link-1 as the primary path), through R2, to the T-TSC-P. - -G.8275.2-Y.1369.2(16)-Amd.3(19)\_FVIII.1 - -Diagram illustrating the LAG bundle link selection example. Two nodes, R1 (T-BC-P) and R2 (T-BC-P), are connected via a LAG bundle (AE0) consisting of three child links: Link-1 (Primary), Link-2 (Secondary), and Link-3. R1 is connected to a T-GM (M) and R2 is connected to a T-TSC-P (S). The diagram shows the flow of PTP packets from the T-GM through R1, over the LAG bundle (specifically over Link-1 as the primary path), through R2, to the T-TSC-P. - -Figure VIII.1 – LAG bundle link selection example - -In both the R1 and R2 nodes, the PTP port is configured on the AE0 bundle port, with child Link-1 as the primary path for PTP packets and child Link-2 as the secondary path. While the primary link (child Link-1) is active, both R1 and R2 will exchange all event and non-event PTP packets over this link. When the primary link (Link-1) fails, R1 and R2 would detect the link loss and both nodes would failover to use the configured secondary link (Link-2) for the transmission of PTP packets within the LAG bundle. - -There are two cases when failed primary link recovers back: - -### **VIII.2 Scenario** - -Assume primary Link-1 failed, R1 and R2 exchanges PTP packets over secondary link (Link-2). Now primary link (Link-1) comes back up. - -#### **Case-1: Revertive** - -If revertive mode is configured, when the failed Primary link (Link-1 in this example) comes back up, both R1 and R2 will switch back from the secondary link to the primary link for the exchange of PTP packets. This will be the default behaviour unless explicitly configured as non-revertible (case 2). - -#### **Case-2: Non-revertive** - -If non-revertive mode is configured, then when the failed primary link comes back up, the R1 and R2 nodes will continue to exchange PTP packets over the secondary link without reverting to the primary link. - -NOTE 4 – In case of PTP over IP over a Layer 3 LAG bundle, it is not possible to configure PTP directly on the child interfaces of the LAG bundle, as child interfaces are L2 interfaces. It is necessary to enable PTP on the AE (Aggregated Ethernet) or bundled interface and further specify which child interfaces (i.e., primary, secondary, ...) should be used to exchange the PTP packets over the LAG bundle. When configured correctly at both ends, the same link would be used to exchange PTP packets in the forward and reverse direction that will help to minimize the link asymmetry. - -# **Appendix IX** - -## **Considerations on the use of [IEEE 1588-2019]** - -(This appendix does not form an integral part of this Recommendation.) - -Considerations on the use of [IEEE 1588-2019] are discussed in Appendix IX of [ITU-T G.8275]. - -# Appendix X - -## Considerations on selecting time out values - -(This appendix does not form an integral part of this Recommendation.) - -Careful consideration should be used when configuring `syncReceiptTimeout` and `delayReqReceiptTimeout` in a partially aware deployment. In a partially aware deployment there is a higher probability of loss of packets (or a burst of loss of packets) compared with fully aware networks. This leads to the desire to choose a good value for how many successive packet losses a PTP clock may tolerate before declaration of a receipt timeout, which may lead to raising a PTSF alarm, which in turn may lead to disqualification of the PTP connection from consideration for selection by the BMCA. - -Typically, the length of the time a PTP clock can tolerate loss of `Sync` and `Delay_Resp` messages is related to the target performance requirements and also the design implementation of the PTP clock (such as the stability of the PTP clock's local oscillator to maintain the performance in-between the reception of PTP synchronization messages). The performance requirements and design implementation is known prior to PTP connection establishment. - -The PTP clock receipt timeout properties are therefore configured by considering two additional related parameters - -- Negotiated PTP message rate -- Duration of PTP message loss before entering a holdover state (whether holdover in-spec or holdover out-of-spec) - -Note that the PTP clock that acts as the receiver of the PTP information is the one that initiates the contract negotiation with a request for a specific PTP message rate (per message type). With that negotiated PTP message information, combined with the known performance target and equipment design, it is then possible to determine the receipt timeout property for the connection. - -### X.1 Example receipt timeout calculation (Dynamic message rate) - -A PTP clock may use the following formulas for setting values on the `portDS.syncReciptTimeout` and `portDS.delayRespReceiptTimeout` data set members to achieve desired performance, based on the message rate granted by unicast negotiation. Here, the Tolerated Consecutive Synchronization Message Loss Time (TLT) must be known in advance, based on the performance target and the equipment design. The TLT is defined as the time period the PTP clock can be without `Sync` and/or `Delay_Resp` messages and not enter the holdover state (whether holdover in-spec or holdover out-of-spec). In addition, for a proper error report management, there should also be a reasonable upper time limit to the receipt timeout; as described in Appendix X.3 this is assumed to be 15 minutes. Using the 15 minutes as a reasonable time limit to the receipt timeout, the maximum TLT should be 900 seconds. - -TLT = Tolerated Consecutive Synchronization Message Loss Time [s] - -NRS = Negotiated Message Rate PTP `Sync` messages [messages/s] - -NRD = Negotiated Message Rate PTP `Delay_Resp` messages [messages/s] - -`portDS.syncReceiptTimeout` = The minimum of {TLT × NRS, 65535} - -`portDS.delayRespReceiptTimeout` = The minimum of {TLT × NRD, 65535} - -Example ~5 minutes TLT and 64 messages/s: - -`portDS.syncReceiptTimeout` = The minimum of {5×60×64, 65535} - -portDS.syncReceiptTimeout = 19200 - -Example ~**100** seconds TLT and **16** messages/s: - -portDS.syncReceiptTimeout = The minimum of { $100 \times 16$ , 65535} - -portDS.syncReceiptTimeout = 1600 - -### **X.2 Example receipt timeout calculation (Fixed message rate)** - -PTP clocks that operate only at one specific PTP message rate may use fixed values of the portDS.syncReceiptTimeout and portDS.delayRespReceiptTimeout data set members that are implementation specific. - -portDS.syncReceiptTimeout = fixed value by design - -portDS.delayRespReceiptTimeout = fixed value by design - -### **X.3 Range of receipt timeout** - -In some deployments that reference [b-ITU-T G.7710] on common equipment management function requirements, it may be desirable to report on loss of Sync or Delay\_Resp messages within 15 minutes of the failure event. This may be a reasonable upper limit to the receipt timeout configurable range in a partially aware network deployment. When operating at 128 messages per second, with a receipt timeout of 65535, yields about 8.5 minutes. When operating at lower message rates, care should be taken not to set the receipt timeout to the maximum allowed within the receipt timeout range to avoid unreasonably large timeout values in units of seconds. - -## Bibliography - -- [b-ITU-T G.7710] Recommendation ITU-T G.7710/Y.1701 (2020), *Common equipment management function requirements.* -- [b-ITU-T G.8262] Recommendation ITU-T G.8262/Y.1362 (2018), *Timing characteristics of a synchronous equipment slave clock.* -- [b-ITU-T G.8262.1] Recommendation ITU-T G.8262.1/Y.1362.1 (2022), *Timing characteristics of enhanced synchronous equipment slave clock.* -- [b-IEEE 802.1AX] IEEE 802.1AX-2020, *IEEE Standard for Local and metropolitan area networks – Link Aggregation.* - - - -## ITU-T Y-SERIES RECOMMENDATIONS - -## **GLOBAL INFORMATION INFRASTRUCTURE, INTERNET PROTOCOL ASPECTS, NEXT-GENERATION NETWORKS, INTERNET OF THINGS AND SMART CITIES** - -### **GLOBAL INFORMATION INFRASTRUCTURE** - -| | | -|-------------------------------------------|-------------| -| General | Y.100–Y.199 | -| Services, applications and middleware | Y.200–Y.299 | -| Network aspects | Y.300–Y.399 | -| Interfaces and protocols | Y.400–Y.499 | -| Numbering, addressing and naming | Y.500–Y.599 | -| Operation, administration and maintenance | Y.600–Y.699 | -| Security | Y.700–Y.799 | -| Performances | Y.800–Y.899 | - -### **INTERNET PROTOCOL ASPECTS** - -| | | -|--------------------------------------------------------------------|----------------------| -| General | Y.1000–Y.1099 | -| Services and applications | Y.1100–Y.1199 | -| Architecture, access, network capabilities and resource management | Y.1200–Y.1299 | -| Transport | Y.1300–Y.1399 | -| Interworking | Y.1400–Y.1499 | -| Quality of service and network performance | Y.1500–Y.1599 | -| Signalling | Y.1600–Y.1699 | -| Operation, administration and maintenance | Y.1700–Y.1799 | -| Charging | Y.1800–Y.1899 | -| IPTV over NGN | Y.1900–Y.1999 | - -### **NEXT GENERATION NETWORKS** - -| | | -|-------------------------------------------------------------------|---------------| -| Frameworks and functional architecture models | Y.2000–Y.2099 | -| Quality of Service and performance | Y.2100–Y.2199 | -| Service aspects: Service capabilities and service architecture | Y.2200–Y.2249 | -| Service aspects: Interoperability of services and networks in NGN | Y.2250–Y.2299 | -| Enhancements to NGN | Y.2300–Y.2399 | -| Network management | Y.2400–Y.2499 | -| Computing power networks | Y.2500–Y.2599 | -| Packet-based Networks | Y.2600–Y.2699 | -| Security | Y.2700–Y.2799 | -| Generalized mobility | Y.2800–Y.2899 | -| Carrier grade open environment | Y.2900–Y.2999 | - -### **FUTURE NETWORKS** - -### **CLOUD COMPUTING** - -### **BIG DATA** - -### **QUANTUM KEY DISTRIBUTION NETWORKS** - -### **INTERNET OF THINGS AND SMART CITIES AND COMMUNITIES** - -| | | -|---------------------------------------------------------|---------------| -| General | Y.4000–Y.4049 | -| Definitions and terminologies | Y.4050–Y.4099 | -| Requirements and use cases | Y.4100–Y.4249 | -| Infrastructure, connectivity and networks | Y.4250–Y.4399 | -| Frameworks, architectures and protocols | Y.4400–Y.4549 | -| Services, applications, computation and data processing | Y.4550–Y.4699 | -| Management, control and performance | Y.4700–Y.4799 | -| Identification and security | Y.4800–Y.4899 | -| Evaluation and assessment | Y.4900–Y.4999 | - -For further details, please refer to the list of ITU-T Recommendations. - -## **SERIES OF ITU-T RECOMMENDATIONS** - -| | | -|----------|-----------------------------------------------------------------------------------------------------------------------------------------------------------| -| Series A | Organization of the work of ITU-T | -| Series D | Tariff and accounting principles and international telecommunication/ICT economic and policy issues | -| Series E | Overall network operation, telephone service, service operation and human factors | -| Series F | Non-telephone telecommunication services | -| Series G | Transmission systems and media, digital systems and networks | -| Series H | Audiovisual and multimedia systems | -| Series I | Integrated services digital network | -| Series J | Cable networks and transmission of television, sound programme and other multimedia signals | -| Series K | Protection against interference | -| Series L | Environment and ICTs, climate change, e-waste, energy efficiency; construction, installation and protection of cables and other elements of outside plant | -| Series M | Telecommunication management, including TMN and network maintenance | -| Series N | Maintenance: international sound programme and television transmission circuits | -| Series O | Specifications of measuring equipment | -| Series P | Telephone transmission quality, telephone installations, local line networks | -| Series Q | Switching and signalling, and associated measurements and tests | -| Series R | Telegraph transmission | -| Series S | Telegraph services terminal equipment | -| Series T | Terminals for telematic services | -| Series U | Telegraph switching | -| Series V | Data communication over the telephone network | -| Series X | Data networks, open system communications and security | -| Series Y | Global information infrastructure, Internet protocol aspects, next-generation networks, Internet of Things and smart cities | -| Series Z | Languages and general software aspects for telecommunication systems | \ No newline at end of file diff --git a/marked/G/T-REC-G.874-202010-I_PDF-E/83852ec55d4802521a727926336bedab_img.jpg b/marked/G/T-REC-G.874-202010-I_PDF-E/83852ec55d4802521a727926336bedab_img.jpg deleted file mode 100644 index eb217f2399b8f7c1571e6981a3a2db42c2d1d04e..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.874-202010-I_PDF-E/83852ec55d4802521a727926336bedab_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:03309c54034dcdb6a51c3ee657a5dd5c925073bf6d2ff1289a8fe0ebe93c0ebf -size 65376 diff --git a/marked/G/T-REC-G.874-202010-I_PDF-E/84a1d09fb489061482111515543b60dc_img.jpg b/marked/G/T-REC-G.874-202010-I_PDF-E/84a1d09fb489061482111515543b60dc_img.jpg deleted file mode 100644 index 3dcc545e47ae63cc83d20fea48d321f441765029..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.874-202010-I_PDF-E/84a1d09fb489061482111515543b60dc_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:44ae291862c8665ffdee152cfc51ba277a3c375c4ea1c15e2f0da603ea5861bc -size 6891 diff --git a/marked/G/T-REC-G.874-202010-I_PDF-E/898fb89a50d9ec1dfb4e425c816976a7_img.jpg b/marked/G/T-REC-G.874-202010-I_PDF-E/898fb89a50d9ec1dfb4e425c816976a7_img.jpg deleted file mode 100644 index 53dee75e16dcb1080384db7b30e2f6c166885646..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.874-202010-I_PDF-E/898fb89a50d9ec1dfb4e425c816976a7_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:1ed592d89c0fe01bfb86104360b6734934e907af4cd7dd34ff234fad51a936ba -size 66032 diff --git a/marked/G/T-REC-G.874-202010-I_PDF-E/c5452f95f3b28f1bfe29e84fbc2e1267_img.jpg b/marked/G/T-REC-G.874-202010-I_PDF-E/c5452f95f3b28f1bfe29e84fbc2e1267_img.jpg deleted file mode 100644 index d2d534f5eaf24dffd1952806ed5449274f7b393b..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.874-202010-I_PDF-E/c5452f95f3b28f1bfe29e84fbc2e1267_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:9e81a91d8886a5e1982f9e25d6f49554867923cf67c7acf0f6c3269417eeef0c -size 121458 diff --git a/marked/G/T-REC-G.874-202010-I_PDF-E/c85ded401105f62f2d6ff26b3b5eb4af_img.jpg b/marked/G/T-REC-G.874-202010-I_PDF-E/c85ded401105f62f2d6ff26b3b5eb4af_img.jpg deleted file mode 100644 index 996846da8d0035360eb2c23f2ca167db65177e1d..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.874-202010-I_PDF-E/c85ded401105f62f2d6ff26b3b5eb4af_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:03ffb25332be6805da84ea6aaaa6d284c927cabf9204bf66f653251310594344 -size 133743 diff --git a/marked/G/T-REC-G.874-202010-I_PDF-E/e69b9188aa2c14ec6b21c83f711fef65_img.jpg b/marked/G/T-REC-G.874-202010-I_PDF-E/e69b9188aa2c14ec6b21c83f711fef65_img.jpg deleted file mode 100644 index 7e8a4727a23d2c5abe1bc623de96b817525b2a62..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.874-202010-I_PDF-E/e69b9188aa2c14ec6b21c83f711fef65_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:ff404a52a4c317b546e8288d148c32fa8cda3ab8c818d92570c1874dabe4870f -size 174712 diff --git a/marked/G/T-REC-G.874-202010-I_PDF-E/raw.md b/marked/G/T-REC-G.874-202010-I_PDF-E/raw.md deleted file mode 100644 index 111f3638ed0199bddbdb816125fc625fb8b3d1ab..0000000000000000000000000000000000000000 --- a/marked/G/T-REC-G.874-202010-I_PDF-E/raw.md +++ /dev/null @@ -1,2426 +0,0 @@ - - -International Telecommunication Union - -**ITU-T** - -TELECOMMUNICATION -STANDARDIZATION SECTOR -OF ITU - -**G.874** - -(10/2020) - -SERIES G: TRANSMISSION SYSTEMS AND MEDIA, -DIGITAL SYSTEMS AND NETWORKS - -Digital networks – Optical transport networks - -# --- **Management aspects of optical transport network elements** - -Recommendation ITU-T G.874 - -![ITU logo: A globe with a red lightning bolt and the text 'ITU International Telecommunication Union'.](84a1d09fb489061482111515543b60dc_img.jpg) - -The logo of the International Telecommunication Union (ITU) is located in the bottom right corner. It features a blue globe with a red lightning bolt striking across it. To the right of the globe, the text "ITU" is written in a large, bold, blue font, with "International Telecommunication Union" in a smaller, blue font underneath. - -ITU logo: A globe with a red lightning bolt and the text 'ITU International Telecommunication Union'. - -## ITU-T G-SERIES RECOMMENDATIONS **TRANSMISSION SYSTEMS AND MEDIA, DIGITAL SYSTEMS AND NETWORKS** - -| | | -|----------------------------------------------------------------------------------------------------------------------------------------------|--------------------| -| INTERNATIONAL TELEPHONE CONNECTIONS AND CIRCUITS | G.100–G.199 | -| GENERAL CHARACTERISTICS COMMON TO ALL ANALOGUE CARRIER-TRANSMISSION SYSTEMS | G.200–G.299 | -| INDIVIDUAL CHARACTERISTICS OF INTERNATIONAL CARRIER TELEPHONE SYSTEMS ON METALLIC LINES | G.300–G.399 | -| GENERAL CHARACTERISTICS OF INTERNATIONAL CARRIER TELEPHONE SYSTEMS ON RADIO-RELAY OR SATELLITE LINKS AND INTERCONNECTION WITH METALLIC LINES | G.400–G.449 | -| COORDINATION OF RADIOTELEPHONY AND LINE TELEPHONY | G.450–G.499 | -| TRANSMISSION MEDIA AND OPTICAL SYSTEMS CHARACTERISTICS | G.600–G.699 | -| DIGITAL TERMINAL EQUIPMENTS | G.700–G.799 | -| DIGITAL NETWORKS | G.800–G.899 | -| General aspects | G.800–G.809 | -| Design objectives for digital networks | G.810–G.819 | -| Synchronization, quality and availability targets | G.820–G.829 | -| Network capabilities and functions | G.830–G.839 | -| SDH network characteristics | G.840–G.849 | -| Management of transport network | G.850–G.859 | -| SDH radio and satellite systems integration | G.860–G.869 | -| Optical transport networks | G.870–G.879 | -| DIGITAL SECTIONS AND DIGITAL LINE SYSTEM | G.900–G.999 | -| MULTIMEDIA QUALITY OF SERVICE AND PERFORMANCE – GENERIC AND USER-RELATED ASPECTS | G.1000–G.1999 | -| TRANSMISSION MEDIA CHARACTERISTICS | G.6000–G.6999 | -| DATA OVER TRANSPORT – GENERIC ASPECTS | G.7000–G.7999 | -| PACKET OVER TRANSPORT ASPECTS | G.8000–G.8999 | -| ACCESS NETWORKS | G.9000–G.9999 | - -*For further details, please refer to the list of ITU-T Recommendations.* - -## Recommendation ITU-T G.874 - -# Management aspects of optical transport network elements - -# Summary - -Recommendation ITU-T G.874 addresses management aspects of optical transport network (OTN) elements containing transport functions of one or more of the layer networks of the OTN. The management of optical layer networks is separable from that of its client layer networks so that the same means of management can be used regardless of the client. The management functions for fault management, configuration management (CM) and performance monitoring are specified. - -Recommendation ITU-T G.874 (2008) updated the management information (MI) to align with Recommendation ITU-T G.798, reorganized the sections to align with the structure of Recommendation ITU-T G.7710/Y.1701, and replaced the generic text with pointers to Recommendation ITU-T G.7710/Y.1701. - -Recommendation ITU-T G.874 (2010) added the management of new transport functions that were introduced in ITU-T G.798 (2010), including OPSMnk\_TT, OPSM/OTUk a\_A, and ODUk for k=0, 2e, 4, and flex. - -Recommendation ITU-T G.874 (2013) added the management of hitless adjustment of ODUflex(GFP) (HAO), automatic protection switching (APS), application codes and performance management (PM) data collection. - -Recommendation ITU-T G.874 (2017) added a description to cover OTUCn GCC0, added the application code related MI signals, updated the MI signals for ODU2eP/FC-1200\_A, OSM256.4/CBRx\_A, OSx/CBRx-b\_A\_Sk and OSx/CBRx-c\_A\_Sk, removed the nDelay, nES, and fES primitives, moved the description of O.MN, O.MSN, and O.NE to the convention clause, updated the default values of DEGThr and DEGM, updated Appendix III to align with Table 15-9 of ITU-T G.709/Y.1331 (2016), and removed the adaptation function activation and MI\_Active to align with ITU-T G.798. - -Recommendation ITU-T G.874 (2020) aligns with the latest editions of ITU-T G.709 and ITU-T G.798, and harmonizes generic requirements with clauses 8 and 10 of ITU-T G.7710/Y.1701 . - -## History - -| Edition | Recommendation | Approval | Study Group | Unique ID* | -|---------|---------------------------|------------|-------------|---------------------------------------------------------------------------| -| 1.0 | ITU-T G.874 | 2001-11-29 | 15 | 11.1002/1000/5607 | -| 2.0 | ITU-T G.874 | 2008-03-29 | 15 | 11.1002/1000/9376 | -| 3.0 | ITU-T G.874 | 2010-07-29 | 15 | 11.1002/1000/10881 | -| 3.1 | ITU-T G.874 (2010) Cor. 1 | 2011-06-06 | 15 | 11.1002/1000/11121 | -| 3.2 | ITU-T G.874 (2010) Amd. 1 | 2012-04-06 | 15 | 11.1002/1000/11493 | -| 3.3 | ITU-T G.874 (2010) Amd. 2 | 2012-10-29 | 15 | 11.1002/1000/11792 | -| 4.0 | ITU-T G.874 | 2013-08-29 | 15 | 11.1002/1000/11987 | -| 4.1 | ITU-T G.874 (2013) Amd. 1 | 2015-08-13 | 15 | 11.1002/1000/12559 | -| 5.0 | ITU-T G.874 | 2017-08-13 | 15 | 11.1002/1000/13304 | -| 6.0 | ITU-T G.874 | 2020-10-29 | 15 | 11.1002/1000/14500 | - -## Keywords - -Optical transport network, OTN. - ---- - -\* To access the Recommendation, type the URL in the address field of your web browser, followed by the Recommendation's unique ID. For example, . - -# FOREWORD - -The International Telecommunication Union (ITU) is the United Nations specialized agency in the field of telecommunications, information and communication technologies (ICTs). The ITU Telecommunication Standardization Sector (ITU-T) is a permanent organ of ITU. ITU-T is responsible for studying technical, operating and tariff questions and issuing Recommendations on them with a view to standardizing telecommunications on a worldwide basis. - -The World Telecommunication Standardization Assembly (WTSA), which meets every four years, establishes the topics for study by the ITU-T study groups which, in turn, produce Recommendations on these topics. - -The approval of ITU-T Recommendations is covered by the procedure laid down in WTSA Resolution 1. - -In some areas of information technology which fall within ITU-T's purview, the necessary standards are prepared on a collaborative basis with ISO and IEC. - -## NOTE - -In this Recommendation, the expression "Administration" is used for conciseness to indicate both a telecommunication administration and a recognized operating agency. - -Compliance with this Recommendation is voluntary. However, the Recommendation may contain certain mandatory provisions (to ensure, e.g., interoperability or applicability) and compliance with the Recommendation is achieved when all of these mandatory provisions are met. The words "shall" or some other obligatory language such as "must" and the negative equivalents are used to express requirements. The use of such words does not suggest that compliance with the Recommendation is required of any party. - -# INTELLECTUAL PROPERTY RIGHTS - -ITU draws attention to the possibility that the practice or implementation of this Recommendation may involve the use of a claimed Intellectual Property Right. ITU takes no position concerning the evidence, validity or applicability of claimed Intellectual Property Rights, whether asserted by ITU members or others outside of the Recommendation development process. - -As of the date of approval of this Recommendation, ITU had not received notice of intellectual property, protected by patents, which may be required to implement this Recommendation. However, implementers are cautioned that this may not represent the latest information and are therefore strongly urged to consult the TSB patent database at . - -© ITU 2021 - -All rights reserved. No part of this publication may be reproduced, by any means whatsoever, without the prior written permission of ITU. - -# Table of Contents - -###### Page - -| | | | -|------|------------------------------------------------------------------------|----| -| 1 | Scope ..... | 1 | -| 2 | References..... | 1 | -| 3 | Definitions ..... | 3 | -| 3.1 | Terms defined elsewhere ..... | 3 | -| 3.2 | Terms defined in this Recommendation..... | 4 | -| 4 | Abbreviations and acronyms ..... | 4 | -| 5 | Conventions ..... | 9 | -| 6 | Optical transport network management architecture..... | 10 | -| 6.1 | OTN management network architecture ..... | 10 | -| 6.2 | Optical transport network equipment management architecture..... | 15 | -| 6.3 | Information flows over management points..... | 16 | -| 7 | Fault management..... | 16 | -| 7.1 | Fault management applications ..... | 16 | -| 7.2 | Fault management functions..... | 17 | -| 8 | Configuration management ..... | 31 | -| 8.1 | Hardware ..... | 31 | -| 8.2 | Software..... | 32 | -| 8.3 | Protection switching ..... | 32 | -| 8.4 | Trail termination..... | 32 | -| 8.5 | Adaptation ..... | 36 | -| 8.6 | Connection..... | 49 | -| 8.7 | DEG thresholds ..... | 50 | -| 8.8 | ZZZ_Reported ..... | 50 | -| 8.9 | Alarm severity ..... | 50 | -| 8.10 | Alarm reporting control..... | 51 | -| 8.11 | Performance management thresholds..... | 51 | -| 8.12 | Tandem connection monitoring activations ..... | 51 | -| 8.13 | Date and time..... | 51 | -| 8.14 | Control function..... | 52 | -| 8.15 | Application identifier management ..... | 52 | -| 8.16 | Media element management..... | 53 | -| 9 | Account management ..... | 54 | -| 10 | Performance management ..... | 54 | -| 10.1 | Performance management applications ..... | 54 | -| 10.2 | Performance management functions ..... | 57 | -| 11 | Security management..... | 60 | -| | Appendix I – Management information for configuration management ..... | 61 | - -| | | -|---------------------------------------------------------------------------------------|----| -| Appendix II – Management information for performance management ..... | 63 | -| Appendix III – Mapping between OPUk payload type and adaptation atomic function ..... | 64 | - -## Recommendation ITU-T G.874 - -# Management aspects of optical transport network elements - -# 1 Scope - -This Recommendation addresses management aspects of optical transport network (OTN) elements containing transport functions of one or more layer networks of the OTN as described in [ITU-T G.709]. The management of optical layer networks is separable from that of its client layer networks; therefore the same means of management can be used regardless of the client. This Recommendation specifies the management functions for fault management, configuration management (CM), account management, performance management (PM) and security management. - -This Recommendation describes the management network organizational model for communication between an element management layer (EML) operations system (OS) and the optical equipment management function (EMF) within an OTN network element (O.NE). - -The architecture described in this Recommendation for the management of OTNs is based upon the following considerations. - -- The management view of network element (NE) functional elements should be uniform whether those elements form part of an inter-domain interface (IrDI) or part of an intra-domain interface (IaDI). Those properties necessary to form such a uniform management view are to be included in this Recommendation. -- OTN layer network entities (OLNEs) include trail termination (TT), adaptation and connection functions as described in [ITU-T G.872] for the OTN digital layer. -- An NE may only contain OLNEs. -- An NE may contain both OLNEs and client layer network entities (CLNEs). -- CLNEs are managed as part of their own logical domain [e.g., a synchronous digital hierarchy (SDH) management network]. -- CLNEs and OLNEs may or may not share a common message communication function (MCF) and management application function (MAF) depending on application. -- CLNEs and OLNEs may or may not share the same agent. - -# 2 References - -The following ITU-T Recommendations and other references contain provisions which, through reference in this text, constitute provisions of this Recommendation. At the time of publication, the editions indicated were valid. All Recommendations and other references are subject to revision; users of this Recommendation are therefore encouraged to investigate the possibility of applying the most recent edition of the Recommendations and other references listed below. A list of the currently valid ITU-T Recommendations is regularly published. The reference to a document within this Recommendation does not give it, as a stand-alone document, the status of a Recommendation. - -- [ITU-T G.695] Recommendation ITU-T G.695 (2018), *Optical interfaces for coarse wavelength division multiplexing applications*. -- [ITU-T G.698.2] Recommendation ITU-T G.698.2 (2018), *Amplified multichannel dense wavelength division multiplexing applications with single channel optical interfaces*. -- [ITU-T G.7041] Recommendation ITU-T G.7041/Y.1303 (2016), *Generic framing procedure*. -- [ITU-T G.7044] Recommendation ITU-T G.7044/Y.1347 (2011), *Hitless adjustment of ODUflex(GFP)*. - -- [ITU-T G.709] Recommendation ITU-T G.709/Y.1331 (2020), *Interfaces for the optical transport network.* -- [ITU-T G.709.1] Recommendation ITU-T G.709.1/Y.1331.1 (2018), *Flexible OTN short-reach interfaces.* -- [ITU-T G.784] Recommendation ITU-T G.784 (2008), *Management aspects of synchronous digital hierarchy (SDH) transport network elements.* -- [ITU-T G.798] Recommendation ITU-T G.798 (2017), *Characteristics of optical transport network hierarchy equipment functional blocks.* -- [ITU-T G.806] Recommendation ITU-T G.806 (2012), *Characteristics of transport equipment – Description methodology and generic functionality.* -- [ITU-T G.826] Recommendation ITU-T G.826 (2002), *End-to-end error performance parameters and objectives for international, constant bit-rate digital paths and connections.* -- [ITU-T G.870] Recommendation ITU-T G.870/Y.1352 (2016), *Terms and definitions for optical transport networks.* -- [ITU-T G.872] Recommendation ITU-T G.872 (2019), *Architecture of optical transport networks.* -- [ITU-T G.873.1] Recommendation ITU-T G.873.1 (2017), *Optical transport network: Linear protection.* -- [ITU-T G.875] Recommendation ITU-T G.875 (2020), *Optical transport network: Protocol-neutral management information model for the network element view.* -- [ITU-T G.959.1] Recommendation ITU-T G.959.1 (2018), *Optical transport network physical layer interfaces.* -- [ITU-T G.7710] Recommendation ITU-T G.7710/Y.1701 (2020), *Common equipment management function requirements.* -- [ITU-T G.7712] Recommendation ITU-T G.7712/Y.1703 (2019), *Architecture and specification of data communication network.* -- [ITU-T G.8121] Recommendation ITU-T G.8121/Y.1381 (2018), *Characteristics of MPLS-TP equipment functional blocks.* -- [ITU-T M.20] Recommendation ITU-T M.20 (1992), *Maintenance philosophy for telecommunication networks.* -- [ITU-T M.60] Recommendation ITU-T M.60 (1993), *Maintenance terminology and definitions.* -- [ITU-T M.2120] Recommendation ITU-T M.2120 (2002), *International multi-operator paths, sections and transmission systems fault detection and localization procedures.* -- [ITU-T M.3010] Recommendation ITU-T M.3010 (2000), *Principles for a telecommunications management network.* -- [ITU-T M.3100] Recommendation ITU-T M.3100 (2005), *Generic network information model.* -- [ITU-T X.700] Recommendation ITU-T X.700 (1992), *Management framework for Open Systems Interconnection (OSI) for CCITT applications.* -- [ITU-T X.701] Recommendation ITU-T X.701 (1997) | ISO/IEC 10040:1998, *Information technology – Open Systems Interconnection – Systems management overview.* - -# **3 Definitions** - -## **3.1 Terms defined elsewhere** - -This Recommendation uses the following terms defined elsewhere: - -### **3.1.1 Terms defined in [ITU-T G.784]** - -#### **3.1.1.1 Data communication channel (DCC).** - -### **3.1.2 Terms defined in [ITU-T G.806]** - -#### **3.1.2.1 Atomic function.** - -#### **3.1.2.2 Management point (MP).** - -### **3.1.3 Terms defined in [ITU-T G.870]** - -#### **3.1.3.1 Intra-domain interface (IaDI).** - -#### **3.1.3.2 Inter-domain interface (IrDI).** - -### **3.1.4 Terms defined in [ITU-T G.7710]** - -#### **3.1.4.1 Local craft terminal (LCT).** - -#### **3.1.4.2 Management application function (MAF).** - -### **3.1.5 Terms defined in [ITU-T G.7712]** - -#### **3.1.5.1 Data communication network (DCN).** - -#### **3.1.5.2 Embedded communication channel (ECC).** - -### **3.1.6 Terms defined in [ITU-T M.60]** - -#### **3.1.6.1 Message communication function (MCF).** - -### **3.1.7 Terms defined in [ITU-T M.3010]** - -#### **3.1.7.1 Network element.** - -#### **3.1.7.2 Network element function.** - -#### **3.1.7.3 Operations system (OS).** - -#### **3.1.7.4 Q interface.** - -#### **3.1.7.5 Workstation function.** - -### **3.1.8 Terms defined in [ITU-T M.3100]** - -- 3.1.8.1** Aggregate audible/visual indicators. -- 3.1.8.2** Alarm reporting. -- 3.1.8.3** Alarm reporting control. -- 3.1.8.4** Inhibited. -- 3.1.8.5** Managed entity. -- 3.1.8.6** Managed resource. -- 3.1.8.7** Managed resource-specific/unit audible/visual indicator. -- 3.1.8.8** Management interface. -- 3.1.8.9** Persistence interval. -- 3.1.8.10** Qualified problem. -- 3.1.8.11** Timed interval. -- 3.1.9** Terms defined in [ITU-T X.700] - - 3.1.9.1** Managed object. -- 3.1.10** Terms defined in [ITU-T X.701] - - 3.1.10.1** Agent. - - 3.1.10.2** Managed object class. - - 3.1.10.3** Manager. - -## **3.2 Terms defined in this Recommendation** - -None. - -# **4 Abbreviations and acronyms** - -This Recommendation uses the following abbreviations and acronyms: - -| | | -|------------|-----------------------------------| -| AcPT | Accepted Payload Type | -| AcSTAT | Accepted Status | -| AcTI | Accepted Trace Identifier | -| AdminState | Administrative State | -| AIS | Alarm Indication Signal | -| ALM | Alarm | -| AP | Access Point | -| APR | Automatic Power Reduction | -| APRCntrl | Automatic Power Reduction Control | -| APS | Automatic Protection Switching | -| ARC | Alarm Reporting Control | -| AST | Alarm Status | -| ASY | Alarm Synchronization | - -| | | -|----------|-------------------------------------------------------------------------| -| AutoMS | Automatic configuration of the Multiplex Structure | -| BDI-O | Backward Defect Indicator Overhead | -| BDI-P | Backward Defect Indicator Payload | -| BIAE | Backward Incoming Alignment Error | -| BIP | Bit Interleaved Parity | -| CBRx | Constant Bit Rate signal of bit rate [range] x | -| CBRx-a | Constant Bit Rate signal of bit rate [range] x -Asynchronous mapping | -| CBRx-b | Constant Bit Rate signal of bit rate [range] x -Bit synchronous mapping | -| CLNE | Client Layer Network Entity | -| CM | Configuration Management | -| COMMS | Communications | -| COMMS OH | Communications Overhead | -| CP | Connection Point | -| CPL | Current Problem List | -| CSACM | Calendar Slot Availability Count Mismatch | -| CSF | Client Signal Failure | -| CTP | Connection Termination Point | -| CWDM | Coarse Wavelength Division Multiplexing | -| DCC | Data Communication Channel | -| DCN | Data Communication Network | -| DS | Defect Second | -| DS-O | Defect Second Overhead | -| DS-P | Defect Second Payload | -| DEG | Degraded | -| DEGM | DEG consecutive 1 s Monitoring intervals | -| DEGThr | DEG 1 s EBC Threshold | -| DTDL | Defect Type and Defect Location | -| DWDM | Dense Wavelength Division Multiplexing | -| EBC | Errored Block Count | -| ECC | Embedded Communication Channel | -| EMF | Equipment Management Function | -| EML | Element Management Layer | -| ETH | Ethernet | -| ETH-C | Ethernet connection | -| ExDAPI | Expected Destination Access Point Identifier | -| ExMSI | Expected Multiplex Structure Identifier | -| ExSAPI | Expected Source Access Point Identifier | - -| | | -|-----------|------------------------------------------------------------| -| ExtCMD | External Command | -| F | Far end | -| FCAPS | Fault, Configuration, Accounting, Performance and Security | -| FEC | Forward Error Correction | -| FECEn | Forward Error Correction Enabled | -| FFS | For Further Study | -| FlexO | Flexible Optical transport network | -| FOP-PM | Failure of Protocol; Provisioning Mismatch | -| FOP-NR | Failure of Protocol; No Response | -| GCC | General Communication Channel | -| GCCAccess | General Communication Channel Access | -| GCCCont | General Communication Channel Continue | -| GetAcTI | Get Accepted trail Trace Identifier | -| GFC | Generic Flow Control | -| GIDM | Group Identification Mismatch | -| HAO | Hitless Adjustment of ODUflex(GFP) | -| HEC | Header Error Control | -| HO | High Order | -| HoTime | Hold-off Time | -| IaDI | Intra-Domain Interface | -| IAE | Incoming Alignment Error | -| IrDI | Inter-Domain Interface | -| LAN | Local Area Network | -| LCK | Locked | -| LCS | Loss of Character Synchronization | -| LCT | Local Craft Terminal | -| LFD | Loss of Frame Delineation | -| LOA | Loss of Alignment | -| LOF | Loss of Frame | -| LOFLOM | Loss of Frame and Loss of Multiframe | -| LOG | Logging | -| LOL | Loss Of Lane | -| LOM | Loss Of Multiframe | -| LOOMFI | Loss of OPU Multiframe Indication | -| LOS | Loss Of Signal | -| LOS-O | Loss Of Signal Overhead | -| LOS-P | Loss Of Signal Payload | - -| | | -|---------|--------------------------------------------------------------------------------------| -| LSS | Loss of pseudo-random bit Sequence lock | -| LTC | Loss of Tandem Connection | -| MAF | Management Application Function | -| MCC | Maintenance Communication Channel | -| MCF | Message Communication Function | -| MCN | Management Communication Network | -| MI | Management Information | -| MIB | Management Information Base | -| MO | Managed Object | -| MP | Management Point | -| MPI-R | Main Path Interface-Reference point | -| MPI-S | Main Path Interface-S interface | -| MS | Multiplex Session | -| MSIM | Multiplex Structure Identifier Mismatch | -| NE | Network Element | -| NEA | Network Element Alarm | -| NEF | Network Element Function | -| NT | Network Termination | -| OCh | Optical Channel | -| OCI | Open Connection Indication | -| ODTUjk | Optical Data Tributary Unit j into k | -| ODU | Optical Data Unit | -| ODUCn | Optical Data Unit-Cn | -| ODUCnP | Optical Data Unit-Cn, Path | -| ODUi | Optical Data Unit of level i | -| ODU[i]j | Optical Data Unit of level j and i (i is optional; i < j) | -| ODUj | Optical Data Unit of level j | -| ODUk | Optical Data Unit of level k, k=0, 1, 2, 2e, 3, 4, flex | -| ODUkP | Optical Data Unit of level k, Path, k=0, 1, 2, 2e, 3, 4, flex | -| ODUkT | Optical Data Unit of level k, Tandem connection sub-layer, k=0, 1, 2, 2e, 3, 4, flex | -| ODUkTm | ODUkT non-intrusive monitoring function, k=0, 1, 2, 2e, 3, 4, flex | -| ODUT | Optical Data Unit, Tandem | -| OLNE | OTN Layer Network Entity | -| O.MN | OTN Management Network | -| OMS-O | Optical Multiplex Section – Overhead | -| O.MSN | OTN Management Subnetwork | - -| | | -|----------|-----------------------------------------------------------------------------| -| O.NE | OTN Network Element | -| OOS | Overhead Signal | -| OPS | Operational State | -| OS | Operations System | -| OSC | Optical Supervisory Channel | -| OSI | Open Systems Interconnection | -| OTH | Open Transport Hierarchy | -| OTM | Optical Transport Module | -| OTN | Optical Transport Network | -| OTS | Optical Transmission Section | -| OTSi | Optical Tributary Signal | -| OTSiG | Optical Tributary Signal Group | -| OTUCn | Optical Transport Unit-Cn | -| OTUk | Optical Transport Unit-k | -| OTU | Optical Transmission Unit | -| OTUk | Optical Transmission Unit of level k, k=1, 2, 3, 4 | -| OTUkV | Optical Transmission Unit of level k, functional standardized, k=1, 2, 3, 4 | -| PCS | Physical Coding Sublayer | -| PLM | Payload Mismatch | -| PM | Performance Management | -| PMC | Performance Monitoring Clock | -| PMM | Physical layer Map Mismatch | -| PPP | Point-to-Point Protocol | -| ProtType | Protection Type | -| PRBS | Pseudo-Random Bit Sequence | -| PRS | Persistency | -| PT | Payload Type | -| REP | Reportable failure | -| RSn | Regenerator Section of level n | -| RTC | Real-Time Clock | -| RTR | Reset Threshold Report | -| SCC | Signalling Communication Channel | -| SCN | Signalling Communication Network | -| SDH | Synchronous Digital Hierarchy | -| SEV | Severity assignment | -| Sk | Sink | -| So | Source | - -| | | -|-------------|-------------------------------------------------------| -| SSF-O | Server Signal Fail Overhead | -| SSF-P | Server Signal Fail Payload | -| STA | Station Alarm | -| STAT | Status | -| STM-N | Synchronous Transfer Mode-N | -| TAN | TMN Alarm event Notification | -| TCM | Tandem Connection Monitoring | -| TCMCP | TCM Control Point | -| TCP | Termination Connection Point | -| TEP | TMN Event Pre-processing alarm | -| TIM | Trail trace Identifier Mismatch | -| TIMActDis | Trace Identifier Mismatch consequent Actions Disabled | -| TIMDetMo | Trace Identifier Mismatch Detection Mode | -| TMN | Telecommunications Management Network | -| TP | Termination Point | -| TPusgActive | TP usage measurement Active | -| TR | Threshold Report | -| TSE | Test Sequence Error | -| TT | Trail Termination | -| TTI | Trail Trace Identifier | -| TTP | Trail Termination Point | -| TxMSI | Transmitted Multiplex Structure Identifier | -| TxTI | Transmitted trail Trace Identifier | -| UNA | Unit Alarm | -| VPI | Virtual Path Identifier | -| WDM | Wavelength Division Multiplexing | - -# 5 Conventions - -An O.MN is a subset of a telecommunications management network (TMN) that is responsible for managing those parts of an NE that contain OLNEs. An O.MN may be subdivided into a set of O.MSNs. - -An O.MSN consists of a set of separate OTN ECCs and associated intra-site data communication links that have been interconnected to form a DCN within any given OTN transport topology. - -An O.NE is that part of an NE that contains entities from one or more OTN layer networks. An O.NE may therefore be a standalone physical entity or a subset of an NE. It supports at least network element functions (NEFs) and may also support an OS function or a mediation function. It contains managed objects (MOs), an MCF and an MAF. The functions of an O.NE may be contained within an NE that also supports other layer networks. These layer network entities are considered to be managed separately from OTN entities. As such, they are not part of the O.MSN or O.MN. - -# 6 Optical transport network management architecture - -See clause 6 of [ITU-T G.7710] for the generic architecture for managing transport equipment. - -The transport layer networks of the OTN are described in [ITU-T G.872], [ITU-T G.798] and [ITU-T G.709]. The management of the OTN layer networks is separable from that of its client layer networks so that the same means of management can be used regardless of the client. - -## 6.1 OTN management network architecture - -### 6.1.1 Relationship between telecommunications management network, O.MN and O.MSN - -The inter-relationship between a management network, its subnetworks and a TMN as generically described in clause 6.1.1 of [ITU-T G.7710] is applicable to OTN. - -This Recommendation specifies the O.MN and O.MSNs. - -### 6.1.2 Access to the O.MSN - -See clause 6.1.2 of [ITU-T G.7710] for the generic requirements. - -### 6.1.3 O.MSN requirements - -See clause 6.1.3 of [ITU-T G.7710] for the generic requirements. - -The main ECC for OTN is considered to be the communications overhead (COMMS OH) in the optical supervisory channel (OSC), see clause 15.1.7 of [ITU-T G.709]. The COMMS OH is carried in the OSC in OTN optical networking interfaces, type I. This COMMS-based ECC is equivalent to the SDH synchronous transfer mode-N (STM-N) multiplex session-data communication channel (MS-DCC). A general communication channel (GCC) is typically used as an ECC when a remote CPE or a remote subnetwork has to be reached, and on OTN point-to-point interfaces of type I and type II only. - -In addition, the O.MSN allows for the support of the following: - -- 1) The OTN allows the ECC options of using the general management COMMS OH or the GCCs. - - All O.NEs, which are not connected through an Ethernet local area network (LAN) with a co-located NE, are required to terminate the COMMS OH. - - All O.NEs, which are not connected through an Ethernet LAN with a co-located NE, are required to terminate the optical transmission unit of level k (OTUk; k=1, 2, 3, 4) GCC0 to connect to O.NEs [e.g., open transport hierarchy (OTH) network terminations (NTs)] that are equipped with OTN point-to-point interfaces of type I and type II only. -- 2) OTN inter-site communications. The inter-site or inter-office communications link between O.NEs will normally be formed from the COMMS OH. -- 3) OTN intra-site communications. Within a particular site, O.NEs may communicate via an intra-site COMMS OH or via an LAN. - -The use of GCCs and COMMS OH for management communications is described in clauses 6.1.3.1 and 6.1.3.2. - -#### 6.1.3.1 General communication channels - -The OTN supports three GCCs: - -- 1) GCC0; -- 2) GCC1; -- 3) GCC2. - -Figure 6-1 illustrates a network scenario consisting of two operators. Operator B provides an optical data unit of level k (ODUk; k=0, 1, 2, 2e, 3, 4, flex) service to operator A (i.e., operator B transports the ODUk frame that begins and ends in operator A's domain). According to [ITU-T G.709], only a subset of the ODUk overhead (e.g., path monitoring) is guaranteed to be passed through operator B's network. Other overheads, such as tandem connection monitoring (TCM) overhead, as well as GCC1 and GCC2 are subject to the service level agreement made between operator A and operator B. - -![](c85ded401105f62f2d6ff26b3b5eb4af_img.jpg) - -| Operator A                      Operator B                      Operator A | | | -|-----------------------------------------------------------------------------------------------------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|----------------| -| | 3R    3R    3R | 3R    3R    3R | -| | OTU k [V]/
OTUC n OTU k /
OTUC n OTU k [V]/
OTUC n OTU k /
OTUC n OTU k [V]/
OTUC n | | -| | ODU k /ODUC n | | -| GCC0 Channel never crosses administrative domains since it operates between OTU k termination points | GCC0    GCC0    GCC0    GCC0    GCC0 | | -| Example a)
Contract allows GCC1 to pass-through Operator B but not GCC2 | GCC1 | or | -| | GCC2 | | -| Example b)
Contract allows GCC2 to pass-through Operator B but not GCC1 | GCC1 | | -| | GCC2 | or | -| Example c)
Contract allows GCC1 and GCC2 to pass-through Operator B | GCC1 | or | -| | GCC2 | or | -| Example d)
Neither GCC1 nor GCC2 are allowed to pass-through Operator B | GCC1 | | -| | GCC2 | | - -G.874(20)\_F6-1 - -**Figure 6-1 – GCC contract scenarios** -OTUk[V]: OTUk or OTUkV - -GCC0 is a channel between OTUk/OTUCn termination points (TPs) and therefore does not cross administrative domains, since an IrDI interface supports 3R points on either end of the interface. Example a) illustrates a scenario where the contract between operators A and B only allows GCC1 to pass through operator B's network. In such a scenario, operator B may use GCC2 within its own network. Example b) illustrates a scenario where the contract between operators A and B only allows GCC2 to pass through operator B's network. In this scenario, operator B may use GCC1 within its own network. Example c) illustrates a scenario where the contract between operators A and B allows both GCC1 and GCC2 to pass through operator B's network. In this scenario, operator B cannot use GCC1 or GCC2. Example d) illustrates a scenario where the contract between operators A and B does not allow GCC1 or GCC2 to pass through operator B's network. In this scenario, operator B can use both GCC1 and GCC2 within its own network. - -##### 6.1.3.1.1 General communication channel physical characteristics - -The OTUk GCC0 shall operate as a single message channel between OTUk TPs using the OTUk overhead bytes located in row 1, columns 11 and 12 of the OTUk overhead. The bit rate of the GCC0 depends on the rate of the OTUk. For an OTU1, the GCC0 channel shall operate at 326.723 kbit/s. For an OTU2, the GCC0 channel shall operate at 1 312.405 kbit/s. For an OTU3, the GCC0 channel shall operate at 5 271.864 kbit/s. For an OTU4, the GCC0 channel shall operate at 13 702.203 kbit/s. The OTUCn GCC0 shall operate as a single message channel between OTUCn TPs using the OTUC overhead bytes located in row 1, columns 11 and 12 of the OTUC overhead. The OTUCn contains n instances of the OTUC GCC0 overhead, numbered 1 to n (GCC0 #1 to GCC0 #n). The bit rate of the OTUCn GCC0 depends on the value of n. The GCC0 #1 to #n overhead instances are combined to provide one communication channel as illustrated in Figure 15-15 of [ITU-T G.709] with an approximated bandwidth of $n \times 13.762\ 8$ Mbit/s. According to [ITU-T G.709], vendor specific interfaces could use the first GCC0 only. - -The ODUk GCC1 shall operate as a single message channel between any two NEs with access to the ODUk frame structure using the optical data unit (ODU) overhead bytes located in row 4, columns 1 and 2 of the ODUk overhead. The bit rate of the GCC1 depends on the rate of the ODUk. For an ODU1, the GCC1 channel shall operate at 326.723 kbit/s. For an ODU2, the GCC1 channel shall operate at 1 312.405 kbit/s. For an ODU2e, the GCC1 channel shall operate at 1 359 kbit/s. For an ODU3, the GCC1 channel shall operate at 5 271.864 kbit/s. For an ODU4, the GCC1 channel shall operate at 13 702.203 kbit/s. For an ODU flex (packet) of n timeslots, the GCC1 channel shall operate at ODUflex rate/7 648 kbit/s. For an ODU flex (CBR), the GCC1 channel shall operate at $(239/238)/7\ 648 \times \text{client bit rate}$ kbit/s. The completely standardized optical data unit/Cn (ODUCn) GCC1 shall operate as a single message channel between any two NEs with access to the ODUCn frame structure using the ODUC overhead bytes located in row 4, columns 1 and 2 of the ODUC overhead. The bit rate of the GCC1 depends on the rate of the ODUCn. The OTUCn contains n instances of the ODUC GCC1 overhead, numbered 1 to n (GCC1 #1 to GCC1#n). The GCC1 #1 to #n overhead instances are combined to provide one communication channel as illustrated in Figure 15-25 of [ITU-T G.709] with an approximated bandwidth of $n \times 13.768$ Mbit/s. - -The ODUk GCC2 shall operate as a single message channel between any two NEs with access to the ODUk frame structure using the ODU overhead bytes located in row 4, columns 3 and 4 of the ODUk overhead. The bit rate of the GCC2 depends on the rate of the ODUk. For an ODU1, the GCC1 channel shall operate at 326.723 kbit/s. For an ODU2, the GCC2 channel shall operate at 1 312.405 kbit/s. For an ODU2e, the GCC2 channel shall operate at 1 359 kbit/s. For an ODU3, the GCC2 channel shall operate at 5 271.864 kbit/s. For an ODU4, the GCC2 channel shall operate at 13 702.203 kbit/s. For an ODU flex (packet) of n timeslots, the GCC2 channel shall operate at ODUflex rate/7 648 kbit/s. For an ODU flex (CBR), the GCC2 channel shall operate at $(239/238)/7\ 648 \times \text{client bit rate}$ kbit/s. The ODUCn GCC2 shall operate as a single message channel between any two NEs with access to the ODUCn frame structure using the ODUC overhead bytes located in row 4, columns 1 and 2 of the ODUC overhead. The bit rate of the GCC2 depends on the rate of the ODUCn. The OTUCn contains n instances of the ODUC GCC2 overhead, numbered 1 to n (GCC2 #1 to GCC2 #n). The GCC2 #1 to #n overhead instances are combined to provide one communication channel as illustrated in Figure 15-25 of [ITU-T G.709] with an approximated bandwidth of $n \times 13.768$ Mbit/s. - -The GCC1 #1 to #n plus GCC2 #1 to #n overhead may be combined to provide one communication channel as illustrated in Figure 15-25 of [ITU-T G.709] with an approximated bandwidth of $n \times 27.525$ Mbit/s. - -NOTE 1 – The GCC0/1/2 rates specified in this clause are nominal rates with $\pm 20$ ppm rate tolerance. - -NOTE 2 – The GCC0 rates is based on Table 13-10 of [ITU-T G.798], The GCC1 and GCC2 rates is based on Table 14-49 of [ITU-T G.798]. - -##### 6.1.3.1.2 GCC data link layer protocol - -When used for management applications, the data link point-to-point protocol (PPP) provides connections between nodes of the underlying transmission network. Mapping of an OTN data-link layer frame into the GCC is specified in [ITU-T G.7712]. - -##### 6.1.3.1.3 Support of the management communication network and signalling communication network separation - -In some network deployment scenarios, it might be desirable to have separation of the management communication network (MCN) and signalling communication network (SCN), such as separately enabling or disabling the MCN and SCN traffic on each DCN interface. This might include scenarios where the SCN spans multiple network domains. The following mechanisms can be used to meet such an application requirement. - -- GCC1 and GCC2 can be used simultaneously and separately via two parallel independent instances of the ODUP/COMMS\_A function or via two parallel independent instances of the ODUCnP/COMMS\_A function. For these two instances, one must be configured as GCC1 (MI\_GCCAccess = "GCC1") while the other instance must be configured as GCC2 (MI\_GCCAccess = "GCC2"). The two COMMS\_CPs can then be assigned to the MCN and SCN, respectively. See Figure 6-2. - -![Figure 6-2 shows two diagrams illustrating COMMS (GCC1 and GCC2) access at an access point. Diagram (a) shows access at an ODUP access point (AP), and Diagram (b) shows access at an ODUCnP access point (AP). Both diagrams show three client functions (COMMS_CP for GCC1, COMMS_CP for GCC2, and a client) connected to an access point (AP) which is connected to a transport layer (ODUP or ODUCnP) and a TCP layer.](898fb89a50d9ec1dfb4e425c816976a7_img.jpg) - -The diagram consists of two parts, (a) and (b), illustrating the architecture for COMMS (GCC1 and GCC2) access at an access point. - -**a) For ODUP access point (AP)** - -Three client functions are shown at the top: COMMS\_CP (for GCC1), COMMS\_CP (for GCC2), and a client. Each client function is connected to an ODUP/COMMS block. These blocks are connected to an ODUP\_AP block. The ODUP\_AP block is connected to an ODUP block, which is in turn connected to an ODUP\_TCP block. - -**b) For ODUCnP access point (AP)** - -Three client functions are shown at the top: COMMS\_CP (for GCC1), COMMS\_CP (for GCC2), and a client. Each client function is connected to an ODUCnP/COMMS block. These blocks are connected to an ODUCnP\_AP block. The ODUCnP\_AP block is connected to an ODUCnP block, which is in turn connected to an ODUCnP\_TCP block. A small note "G.874(20)\_F6-2" is present next to the ODUCnP\_TCP block. - -Figure 6-2 shows two diagrams illustrating COMMS (GCC1 and GCC2) access at an access point. Diagram (a) shows access at an ODUP access point (AP), and Diagram (b) shows access at an ODUCnP access point (AP). Both diagrams show three client functions (COMMS\_CP for GCC1, COMMS\_CP for GCC2, and a client) connected to an access point (AP) which is connected to a transport layer (ODUP or ODUCnP) and a TCP layer. - -**Figure 6-2 – COMMS (GCC1 and GCC2) access at ODUP access point** -(Updated from Figure 14-104 and Figure 14-106 of [ITU-T G.798]) -ODUP: optical data unit of level k, Path (k=0, 1, 2, 2e, 3, 4, flex) - -- GCC1 and GCC2 can be used simultaneously and separately via two cascaded independent instances of the ODUP/COMMS\_AC atomic function or via two parallel independent - -instances of the ODUCnP/COMMS\_AC function. For these two instances, one must be configured as GCC1 (MI\_GCCAccess = "GCC1") while the other instance must be configured as GCC2 (MI\_GCCAccess = "GCC2"). The two COMMS\_CPs can then be assigned to the MCN and SCN, respectively. See Figure 6-3. - -![Figure 6-3: ODUk_CP expansion for COMMS access for GCC1 and GCC2. The diagram consists of two parts, (a) and (b). Part (a) shows an ODUk_CP connected to two ODUk/COMMS blocks, which are then connected to COMMS_CPs for GCC1 and GCC2. Part (b) shows a more detailed expansion of the ODUk/COMMS blocks into ODUCnP/COMMS and ODUCnP/client blocks, which are connected to ODUCnP_AP blocks, which are then connected to an ODUCnP block, which is finally connected to an ODUCnP_TCP block.](83852ec55d4802521a727926336bedab_img.jpg) - -a) ODUk\_CP expansion for COMMS access - -b) ODUCn\_CP expansion for COMMS access - -G.874(20)\_F6-3 - -Figure 6-3: ODUk\_CP expansion for COMMS access for GCC1 and GCC2. The diagram consists of two parts, (a) and (b). Part (a) shows an ODUk\_CP connected to two ODUk/COMMS blocks, which are then connected to COMMS\_CPs for GCC1 and GCC2. Part (b) shows a more detailed expansion of the ODUk/COMMS blocks into ODUCnP/COMMS and ODUCnP/client blocks, which are connected to ODUCnP\_AP blocks, which are then connected to an ODUCnP block, which is finally connected to an ODUCnP\_TCP block. - -**Figure 6-3 – ODUk\_CP expansion for COMMS access for GCC1 and GCC2** -(Updated version of Figure 14-108 of [ITU-T G.798]) - -- If there is limitation in the ODUk layer network deployment, such that GCC1 and GCC2 cannot be used separately and simultaneously, it is necessary to have at least two ODUk connections between the two NEs (if possible) such that the GCC of one high-order (HO) ODUk connection can be used as the maintenance communication channel (MCC) and the GCC of the other ODUk connection can be used as the signalling communication channel (SCC). -- If there is limitation in the ODUCn layer network deployment, such that GCC1 and GCC2 cannot be used separately and simultaneously, it is necessary to have at least two other ODUCn connections between the two NEs (if possible) such that the GCC of one ODUCn connection can be used as the MCC and the GCC of the other ODUCn connection can be used as the SCC. - -- If there is limitation in the ODUk/ ODUCn layer network deployment, such that GCC1 and GCC2 cannot be used separately and simultaneously and it is also not possible to have two ODUk connections between the two NEs, mechanisms such as deep packet inspection would be needed if the MCC and the SCC share that single GCC. This would, however, mean that the MCC or SCC messages need to be analysed beyond open systems interconnection (OSI) layer 3. - -#### **6.1.3.2 General management communications overhead** - -The general management COMMS OH is specified in [ITU-T G.709]. - -##### **6.1.3.2.1 COMMS OH physical characteristics** - -The COMMS OH is a logical element within the optical transport module (OTM) overhead signal (OOS). It provides general management communications between two optical NEs with access to the OOS. As such, the COMMS OH supports the ECC of the OTN OSC. The OOS is transported via the OSC. - -The specific physical frame structure and coding for the COMMS OH lies outside the scope of [ITU-T G.709] and is therefore not standardized. - -##### **6.1.3.2.2 COMMS OH data link layer protocol** - -The adaptation of COMMS OH data link layer into the physical layer is FFS. - -### **6.1.4 O.MSN data communications network** - -See clause 6.1.4 of [ITU-T G.7710] for the generic requirements. - -### **6.1.5 Management of data communication network** - -See clause 6.1.5 of [ITU-T G.7710] for the generic requirements. - -### **6.1.6 Remote log-in** - -See clause 6.1.6 of [ITU-T G.7710] for the generic requirements. - -### **6.1.7 Relationship between technology domains** - -See clause 6.1.7 of [ITU-T G.7710] for the generic requirements. - -## **6.2 Optical transport network equipment management architecture** - -See clause 6.2 of [ITU-T G.7710] for a generic description of the equipment management architecture. - -Protocol-neutral specifications of the OTN MAFs, in terms of MO classes, attributes and message specification are provided in [ITU-T G.875]. - -The OTN EMF interacts with the other atomic functions specified in [ITU-T G.798]. See [ITU-T G.806] and [ITU-T G.798] for more information on atomic functions and on MP reference points. - -See Figure 6-4. - -![Figure 6-4 – Optical equipment management architecture. The diagram shows the internal structure of a Network Element Function (NEF). On the left, 'Transport plane atomic functions' are shown with a vertical stack of icons. An arrow labeled 'Management information' points from these functions to an 'MP reference point'. From the MP reference point, the architecture is divided into two main vertical sections. The left section is the 'Equipment management function (EMF)'. It contains a vertical stack of boxes: 'Date and time functions', 'Fault management', 'Configuration management', 'Account management', 'Performance management', 'Security management', and 'Control plane function'. The 'Control plane function' box contains three small icons and an arrow pointing to an 'Agent' box. Below the EMF stack is a 'Management application function (MAF)' box, which contains 'Date and time interface', 'Management plane interface', 'Control plane interface', and 'Local alarm interface'. At the bottom of the EMF section is a 'MIB' (Management information base) represented by a cylinder icon containing six 'MO' (Managed object) circles. The right section is the 'Message communication function (MCF)'. It contains a vertical stack of boxes: 'Date and time communication', 'Management plane communication', 'Control plane communication', a vertical ellipsis, and 'Local alarm communication'. Arrows show information flows between the EMF and MCF: 'Date and time information' between 'Date and time functions' and 'Date and time communication'; 'Management plane information' between 'Configuration management' and 'Management plane communication'; 'Control plane information' between 'Performance management' and 'Control plane communication'; and 'Local alarm information' between 'Local alarm interface' and 'Local alarm communication'. External connections are shown on the far right: 'from external time source' to 'Date and time communication'; 'to/from management plane (e.g., EMS, peer NE)' to 'Management plane communication'; 'to/from control plane (e.g., EMS, peer NE)' to 'Control plane communication'; 'to/from local craft terminal' to the ellipsis; and 'to local alarms' from 'Local alarm communication'. A legend at the bottom shows a blue cylinder for 'Management information base' and a circle with 'MO' for 'Managed object'. The text 'G.874(13)_F6-4' is in the bottom right corner.](e69b9188aa2c14ec6b21c83f711fef65_img.jpg) - -Figure 6-4 – Optical equipment management architecture. The diagram shows the internal structure of a Network Element Function (NEF). On the left, 'Transport plane atomic functions' are shown with a vertical stack of icons. An arrow labeled 'Management information' points from these functions to an 'MP reference point'. From the MP reference point, the architecture is divided into two main vertical sections. The left section is the 'Equipment management function (EMF)'. It contains a vertical stack of boxes: 'Date and time functions', 'Fault management', 'Configuration management', 'Account management', 'Performance management', 'Security management', and 'Control plane function'. The 'Control plane function' box contains three small icons and an arrow pointing to an 'Agent' box. Below the EMF stack is a 'Management application function (MAF)' box, which contains 'Date and time interface', 'Management plane interface', 'Control plane interface', and 'Local alarm interface'. At the bottom of the EMF section is a 'MIB' (Management information base) represented by a cylinder icon containing six 'MO' (Managed object) circles. The right section is the 'Message communication function (MCF)'. It contains a vertical stack of boxes: 'Date and time communication', 'Management plane communication', 'Control plane communication', a vertical ellipsis, and 'Local alarm communication'. Arrows show information flows between the EMF and MCF: 'Date and time information' between 'Date and time functions' and 'Date and time communication'; 'Management plane information' between 'Configuration management' and 'Management plane communication'; 'Control plane information' between 'Performance management' and 'Control plane communication'; and 'Local alarm information' between 'Local alarm interface' and 'Local alarm communication'. External connections are shown on the far right: 'from external time source' to 'Date and time communication'; 'to/from management plane (e.g., EMS, peer NE)' to 'Management plane communication'; 'to/from control plane (e.g., EMS, peer NE)' to 'Control plane communication'; 'to/from local craft terminal' to the ellipsis; and 'to local alarms' from 'Local alarm communication'. A legend at the bottom shows a blue cylinder for 'Management information base' and a circle with 'MO' for 'Managed object'. The text 'G.874(13)\_F6-4' is in the bottom right corner. - -**Figure 6-4 – Optical equipment management architecture (Figure 5 of [ITU-T G.7710])** - -## 6.3 Information flows over management points - -See clause 6.3 of [ITU-T G.7710] for a generic description of information flows over MPs. - -The information flow over the MP reference points is described in specific detail for each atomic function in [ITU-T G.798]. Note that these information flows and associated functions apply equally to both the client and supervisory channel due to the independent nature of these signals. This implies neither that the supervisory channel shall provide all the functions described, nor that [ITU-T G.798] will provide the details of which functions are available. - -# 7 Fault management - -See clause 7 of [ITU-T G.7710] for generic requirements for fault management. OTN-specific specifications, if needed, are explicitly described. - -## 7.1 Fault management applications - -See clause 7.1 of [ITU-T G.7710] for a description of basic fault management applications. - -### 7.1.1 Supervision - -See clause 7.1.1 of [ITU-T G.7710] for a generic description of supervision applications. - -The supervision philosophy for OTN is also based on the concepts underlying the OTN functional model of [ITU-T G.872]. - -#### **7.1.1.1 Transmission supervision** - -See clause 7.1.1.1 of [ITU-T G.7710] for a description of transmission supervision. - -#### **7.1.1.2 Quality of service supervision** - -See clause 7.1.1.2 of [ITU-T G.7710] for a description of quality of service supervision. - -#### **7.1.1.3 Processing supervision** - -See clause 7.1.1.3 of [ITU-T G.7710] for a description of processing supervision. - -#### **7.1.1.4 Hardware supervision** - -See clause 7.1.1.4 of [ITU-T G.7710] for a description of hardware supervision. - -#### **7.1.1.5 Environment supervision** - -See clause 7.1.1.5 of [ITU-T G.7710] for a description of environment supervision. - -### **7.1.2 Fault cause validation** - -See clause 7.1.2 of [ITU-T G.7710] for a description of fault cause validation. - -### **7.1.3 Alarm handling** - -#### **7.1.3.1 Severity assignment** - -See clause 7.1.3.1 of [ITU-T G.7710] for a description of severity categories. - -#### **7.1.3.2 Alarm reporting control** - -See clause 7.1.3.2 of [ITU-T G.7710] for a description of alarm reporting control (ARC). - -#### **7.1.3.3 Reportable failures** - -See clause 7.1.3.3 of [ITU-T G.7710] for a description of reportable failures. - -#### **7.1.3.4 Alarm surveillance** - -See clause 7.1.3.4 of [ITU-T G.7710] for a description of alarm surveillance. - -##### **7.1.3.4.1 Local reporting** - -See clause 7.1.3.4.1 of [ITU-T G.7710] for a description of local reporting. - -##### **7.1.3.4.2 Telecommunications management network reporting** - -See clause 7.1.3.4.2 of [ITU-T G.7710] for a description of TMN reporting. - -## **7.2 Fault management functions** - -See clause 7.2 of [ITU-T G.7710] for a description of fault management inside the EMF. - -Figure 7-1 shows the functional model of fault management inside the OTN EMF. - -![Figure 7-1: Fault management within the optical transport network network element function. This block diagram shows the flow of information between various atomic functions (PRS, SEV, ARC, REP, TEP, UNA, NEA, STA, ASY, LOG, TAN, CPL, AST, OPS) and management applications. Inputs include 'Fault cause' and 'Failure'. PRS outputs 'MI_cZZZ'. SEV outputs 'fZZZ-value'. ARC outputs 'fZZZ-value', 'fZZZ-severity', and 'fZZZ-arc'. REP outputs 'rZZZ-value' and 'rZZZ-severity'. TEP outputs 'rZZZ-value' and 'rZZZ-severity'. Management applications receive 'Unit alarms', 'Network element alarms', 'Station alarms', 'Alarm synchronization', 'Query', 'Report', 'TMN alarm event notifications', 'Current problem list', 'Alarm status', and 'Operational state'. External inputs include 'Alarm severity assignment profile', 'ARC information', and 'NE-RTC' (from Date and time functions).](c5452f95f3b28f1bfe29e84fbc2e1267_img.jpg) - -Figure 7-1: Fault management within the optical transport network network element function. This block diagram shows the flow of information between various atomic functions (PRS, SEV, ARC, REP, TEP, UNA, NEA, STA, ASY, LOG, TAN, CPL, AST, OPS) and management applications. Inputs include 'Fault cause' and 'Failure'. PRS outputs 'MI\_cZZZ'. SEV outputs 'fZZZ-value'. ARC outputs 'fZZZ-value', 'fZZZ-severity', and 'fZZZ-arc'. REP outputs 'rZZZ-value' and 'rZZZ-severity'. TEP outputs 'rZZZ-value' and 'rZZZ-severity'. Management applications receive 'Unit alarms', 'Network element alarms', 'Station alarms', 'Alarm synchronization', 'Query', 'Report', 'TMN alarm event notifications', 'Current problem list', 'Alarm status', and 'Operational state'. External inputs include 'Alarm severity assignment profile', 'ARC information', and 'NE-RTC' (from Date and time functions). - -G.874(20)\_F7-1 - -**Figure 7-1 – Fault management within the optical transport network network element function (Figure 7 of [ITU-T G.7710])** - -### **7.2.1 Fault cause persistency function** - -See clause 7.2.1 of [ITU-T G.7710] for a description of the fault cause persistency (PRS) function. - -For an O.NE that supports the atomic functions listed in Table 7-1, the EMF PRS process shall support the persistency check for the associated fault causes. - -**Table 7-1 – Inputs and outputs for the fault cause persistency function** - -| Atomic functions | Input (fault cause) | Output (failure) | -|--------------------|----------------------------------------------------|----------------------------------------------------| -| OSM256.4/CBRx_A_So | cLOF | fLOF | -| OTS-O_TT_Sk | cTIM
cBDI
cBDI-O
cBDI-P
cLOS-P
cLOS | fTIM
fBDI
fBDI-O
fBDI-P
fLOS-P
fLOS | -| OMS-O_TT_Sk | cBDI
cBDI-O
cBDI-P
cSSF
cSSF-O | fBDI
fBDI-O
fBDI-P
fSSF
fSSF-O | - -**Table 7-1 – Inputs and outputs for the fault cause persistency function** - -| Atomic functions | Input (fault cause) | Output (failure) | -|---------------------------------------------------------------------------|--------------------------------------------------------------------------------------------------------------------------------------|----------------------------------------------------------------------| -| | cSSF-P
cLOS-P | fSSF-P
fLOS-P | -| OMS-O/OTSiG OCh-O_A_Sk | cMSIM[1..(n+m)] | fMSIM[1..(n+m)] | -| OCh-O_TT_Sk | cLOS-P
cOCI
cSSF
cSSF-P
cSSF-O | fLOS-P
fOCI
fSSF
fSSF-P
fSSF-O | -| OTSiG-O_TT_Sk | cOCI
cSSF
cSSF-P
cSSF-O
cTIM
cBDI
cBDI-P
cBDI-O | fOCI
fSSF
fSSF-P
fSSF-O
fTIM
fBDI
fBDI-P
fBDI-O | -| OTSi/OTUkV_A_Sk | cLOS-P
cLOF
cLOM (if the optical transmission unit of level k, functional standardized (OTUkV; k=1, 2, 3, 4) has a multiframe) | fLOS-P
fLOF
fLOM | -| OTSi/OTUCn_A_Sk | cLOS-P
cLOL
cLOF
cLOM | fLOS-P
fLOL
fLOF
fLOM | -| OTSi/FlexO-1-SC_A_Sk | cLOS-P
cLOL
cLOM | fLOS-P
fLOL
fLOM | -| OTSi/OTUk_A_Sk
See Table 16-1 in [ITU-T G.798] for the function types | cLOS-P
cLOF
cLOM | fLOS-P
fLOF
fLOM | -| OTSiG/OTUkV_A_Sk | cLOS-P
cLOF
cLOM (if OTUkV has a multiframe) | fLOS-P
fLOF
fLOM | -| OTSiG/OTUk_A_Sk
See Table 16-6 of [ITU-T G.798] for the function types | cLOS-P
cLOL
cLOF
cLOM | fLOS-P
fLOL
fLOF
fLOM | -| OTSiG/OTUCn_A_Sk | cLOS-P
cLOL
cLOF
cLOM | fLOS-P
fLOL
fLOF
fLOM | -| OTSiG/FlexO_A_Sk | cLOS-P | fLOS-P | - -**Table 7-1 – Inputs and outputs for the fault cause persistency function** - -| Atomic functions | Input (fault cause) | Output (failure) | -|-------------------------------------------------------------------------------------------|-----------------------------------------------------------|-----------------------------------------------------------| -| | cLOL
cLOM | fLOL
fLOM | -| OTSi/OSC_A_Sk | cLOS-O | fLOS-O | -| OTU_TT_Sk | cTIM
cDEG
cBDI
cSSF | fTIM
fDEG
fBDI
fSSF | -| OTUkV_TT_Sk | cTIM
cDEG
cBDI
cSSF | fTIM
fDEG
fBDI
fSSF | -| OTUkV/ODU_A_Sk (if loss of alignment supervision is performed) | cLOA | fLOA | -| ODUk_C | cFOP-PM
cFOP-NR | fFOP-PM
fFOP-NR | -| ODUP_TT_Sk | cOCI
cTIM
cDEG
cBDI
cSSF
cLCK | fOCI
fTIM
fDEG
fBDI
fSSF
fLCK | -| ODUkP/CBRx_A_Sk | cPLM
cCSF | fPLM
fCSF | -| ODUP/NULL_A_Sk | cPLM | fPLM | -| ODUP/PRBS_A_Sk | cPLM
cLSS | fPLM
fLSS | -| ODUkP/RSn_A_Sk | cPLM
cLOF | fPLM
fLOF | -| ODUkP/CBRx-g_A_SkFor the value of k and x in ODUkP/CBRx, see Table 14-18 of [ITU-T G.798] | cPLM
cCSF
cLCS (Note) | fPLM
fCSF
fLCS (Note) | -| ODUkP/ODU[i]j_A_Sk | cPLM
cMSIM[ 1..n+m]
cLOFLOM[1..(n+m)] | fPLM
fMSIM[1..n+m]
fLOFLOM[1..(n+m)] | -| ODUkP/ODUj-21_A_Sk | cPLM
cLOOMFI
cMSIM[p]
cLOFLOM[1..n] | fPLM
fLOOMFI
fMSIM[p]
fLOFLOM[1..n] | -| ODUkP-h/ODUj-21_A_Sk | cPLM
cLOOMFI
cMSIM[1..n]
cLOFLOM[1..n]
cRCOHM | fPLM
fLOOMFI
fMSIM[1..n]
fLOFLOM[1..n]
fRCOHM | -| ODUkP/ETH_A_Sk | cPLM
cLFD | fPLM
fLFD | - -**Table 7-1 – Inputs and outputs for the fault cause persistency function** - -| Atomic functions | Input (fault cause) | Output (failure) | -|--------------------------------------------------------------------------------|------------------------------------------------------|------------------------------------------------------| -| | cUPM
cEXM
cCSF | fUPM
fEXM
fCSF | -| ODUkP-h/ETH_A_Sk | cPLM
cLFD
cUPM
cEXM
cCSF | fPLM
fLFD
fUPM
fEXM
fCSF | -| ODU2P/ERS10G_A_Sk | cPLM
cLFD
cUPM
cEXM
cCSF | fPLM
fLFD
fUPM
fEXM
fCSF | -| ODU2eP/FC-1200_A_Sk | cPLM
cCSF
cLFD | fPLM
fCSF
fLFD | -| ODUCnP/ODUk_A_Sk | cPLM
cLOOMFI
cMSIM[1..m]
cLOFLOM[1..m] | fPLM
fLOOMFI
fMSIM[1..m]
fLOFLOM[1..m] | -| ODUflexP/FlexEC_A_Sk | cPLM
cCSF
cLCS | fPLM
fCSF
fLCS | -| ODUflexP/FlexESG_A_So | cPMM
cGIDM
cLOL
cCSACM | fPMM
fGIDM
fLOL
fCSACM | -| ODUflexP/FlexESG_A_Sk | cPLM
cCSF
cCSACM
cLCS
cLOF
cLOM | fPLM
fCSF
fCSACM
fLCS
fLOF
fLOM | -| ODUflexP/ETCy_A_Sk
See Table 14-47.1 of [ITU-T G.798]
for the value of y | cPLM
cCSF
cLCS
cLRC | fPLM
fCSF
fLCS
fLRC | -| ODUT_TT_Sk | cOCI
cTIM
cDEG
cBDI
cSSF
cLCK
cLTC | fOCI
fTIM
fDEG
fBDI
fSSF
fLCK
fLTC | - -**Table 7-1 – Inputs and outputs for the fault cause persistency function** - -| Atomic functions | Input (fault cause) | Output (failure) | -|--------------------------------------------------------------------------|---------------------|------------------| -| ODUTm_TT_Sk | cOCI | fOCI | -| | cTIM | fTIM | -| | cDEG | fDEG | -| | cBDI | fBDI | -| | cSSF | fSSF | -| | cLCK | fLCK | -| | cLTC | fLTC | -| FlexO_TT_Sk | cRDI | fRDO | -| | cSSF | fSSF | -| FlexO-n/OTUCn_A_Sk | cLOFLOM[1..n] | fLOFLOM[1..n] | -| | cGIDM | fGIDM | -| | cPMM | fPMM | -| | cLOL | fLOL | -| ME_MI | cLOS[i] | fLOS | -| OSx_TT_Sk, x=2G5, 10G, 40G | cLOS | fLOS | -| OSx/CBRx-b_A_Sk | cLFA | fLFA | -| OSx/CBRx-c_A_Sk | cLFA | fLFA | -| NOTE – Applicable only when (k=3, CBRx=ETC40GR) or (k=4, CBRx=ETC100GR). | | | - -### 7.2.2 Severity assignment function - -See clause 7.2.2 of [ITU-T G.7710] for a description of the severity assignment (SEV) function. - -### 7.2.3 Alarm reporting control function - -See clause 7.2.3 of [ITU-T G.7710] for a description of the severity alarm reporting control (ARC) function. - -The alarms that can be controlled with this function are specified for each atomic function in [ITU-T G.798]. - -In Table 7-2, for each atomic function, a subset of the plausible failures (specified in Table 7-1) is selected, consisting of qualified problems. These qualified problems are recommended as they are deemed essential to the operability of the subject managed entity. Note that for each managed entity, one or more of the qualified problems could then be further selected by the management system to be included in the ARC list for controlling alarm reporting for the entity. - -The default ARC state is also specified for each managed entity. If the ARC function is supported by the O.NE and an ARC state is not explicitly provisioned from the management system for the managed entity, then the default ARC specified in Table 7-2 should be in effect. - -For an O.NE that supports the atomic functions listed in Table 7-2, the EMF ARC process shall support ARC for the associated fault causes. - -**Table 7-2 – Alarm reporting control specifications for the optical transport network** - -| Atomic function | Qualified problems | QoS reporting | Default ARC state value constraints | -|---------------------------------------------------------------------------|----------------------------------------------------------------------|---------------|-------------------------------------| -| OSM256.4/CBRx_A_So | fLOF | FFS | Alarm (ALM) | -| OTS-O_TT_Sk | fTIM
fBDI
fBDI-P
fLOS-P
fLOS | FFS | ALM | -| OMS-O_TT_Sk | fBDI
fBDI-O
fBDI-P
fSSF
fSSF-O
fSSF-P
fLOS-P | FFS | ALM | -| OMS-O/OTSiG OCh-O_A_Sk | fMSIM[1..(n+m)] | FFS | ALM | -| OCh-O_TT_Sk | fLOS-P
fOCI
fSSF
fSSF-O
fSSF-P | FFS | ALM | -| OTSiG-O_TT_Sk | fOCI
fSSF
fSSF-P
fSSF-O
fTIM
fBDI
fBDI-P
fBDI-O | FFS | ALM | -| OTSi/OTUk_A_Sk
See Table 16-1 of [ITU-T G.798] for the function types | fLOS-P
fLOF
fLOM | FFS | ALM | -| OTSiG/OTUk_A_Sk
See Table 16-6 of [ITU-T G.798] for the function types | fLOS-P
fLOL
fLOF
fLOM | FFS | ALM | -| OTSi/OTUkV_A_Sk | fLOS-P
fLOF
fLOM | FFS | ALM | -| OTSiG/OTUkV_A_Sk | fLOS-P
fLOF
fLOM | FFS | ALM | -| OTSi/OTUCn_A_Sk | fLOS-P
fLOL
fLOF
fLOM | FFS | ALM | -| OTSiG/OTUCn_A_Sk | fLOS-P | FFS | ALM | - -**Table 7-2 – Alarm reporting control specifications for the optical transport network** - -| Atomic function | Qualified problems | QoS reporting | Default ARC state value constraints | -|-----------------------------------------------------------------------------------------|----------------------------------------------|---------------|-------------------------------------| -| | fLOL
fLOF
fLOM | | | -| OTSiG/FlexO_A_Sk | fLOS-P
fLOL
fLOM | FFS | ALM | -| OTSi/FlexO-1-SC_A_Sk | fLOS-P
fLOL
fLOM | FFS | ALM | -| OTSi/OSC_A_Sk | fLOS-O | FFS | ALM | -| OTU_TT_Sk | fTIM
fDEG
fBDI
fSSF | FFS | ALM | -| OTUkV_TT_Sk | fTIM
fDEG
fBDI
fSSF | FFS | ALM | -| OTUkV/ODU_A_Sk | fLOA | FFS | ALM | -| ODUk_C | fFOP-PM
fFOP-NR | FFS | ALM | -| ODUP_TT_Sk | fOCI
fTIM
fDEG
fBDI
fSSF
fLCK | FFS | ALM | -| ODUkP/CBRx_A_Sk | fPLM
fCSF | FFS | ALM | -| ODUP/NULL_A_Sk | fPLM | FFS | ALM | -| ODUP/PRBS_A_Sk | fPLM
fLSS | FFS | ALM | -| ODUkP/RSn_A_Sk | fPLM
fLOF | FFS | ALM | -| ODUkP/CBRx-g_A_Sk
For the value of k and x in CBRx, see Table 14-18 of [ITU-T G.798] | fPLM
fCSF
fLCS (Note) | FFS | ALM | -| ODUkP/ODU[i]j_A_Sk | fPLM
fMSIM[1..(n+m)]
fLOFLOM[1..(n+m)] | FFS | ALM | -| ODUkP/ODUj-21_A_Sk | fPLM
fLOOMFI | FFS | ALM | - -**Table 7-2 – Alarm reporting control specifications for the optical transport network** - -| Atomic function | Qualified problems | QoS reporting | Default ARC state value constraints | -|--------------------------|-----------------------------------------------------------|---------------|-------------------------------------| -| | fMSIM[1..n]
fLOFLOM[1..n] | | | -| ODUkP-h/ODUj-21_A_Sk | fPLM
fLOOMFI
fMSIM[1..n]
fLOFLOM[1..n]
fRCOHM | FFS | ALM | -| ODUkP/ETH_A_Sk | fPLM
fLFD
fUPM
fEXM
fCSF | FFS | ALM | -| ODUkP-h/ETH_A_Sk(k=flex) | fPLM
fLFD
fUPM
fEXM
fCSF | FFS | ALM | -| ODU2P/ERS10G_A_Sk | fPLM
fLFD
fUPM
fEXM
fCSF | FFS | ALM | - -**Table 7-2 – Alarm reporting control specifications for the optical transport network** - -| Atomic function | Qualified problems | QoS reporting | Default ARC state value constraints | -|--------------------------------------------------------------------------------|------------------------------------------------------|---------------|-------------------------------------| -| ODU2eP/FC-1200_A_Sk | fPLM
fCSF
fLFD | FFS | ALM | -| ODUCnP/ODUk_A_Sk | fPLM
fLOOMFI
fMSIM[1..m]
fLOFLOM[1..m] | FFS | ALM | -| ODUflexP/FlexEC_A_Sk | fPLM
fCSF
fLCS | FFS | ALM | -| ODUflexP/FlexESG_A_So | fPMM
fGIDM
fLOL
fCSACM | FFS | ALM | -| ODUflexP/FlexESG_A_Sk | fPLM
fCSF
fCSACM
fLCS
fLOF
fLOM | FFS | ALM | -| ODUflexP/ETCy_A_Sk
See Table 14-47.1 of [ITU-T G.798]
for the value of y | fPLM
fCSF
fLCS
fLRC | FFS | ALM | -| ODUT_TT_Sk | fOCI
fTIM
fDEG
fBDI
fSSF
fLCK
fLTC | FFS | ALM | -| ODUTm_TT_Sk | fOCI
fTIM
fDEG
fBDI
fSSF
fLCK
fLTC | FFS | ALM | -| FlexO_TT_Sk | fRDI
fSSF | FFS | ALM | -| FlexO-n/OTUCn_A_Sk | fLOFLOM[1..n]
fGIDM
fPMM
fLOL | FFS | ALM | - -**Table 7-2 – Alarm reporting control specifications for the optical transport network** - -| Atomic function | Qualified problems | QoS reporting | Default ARC state value constraints | -|--------------------------------------------------------------------------|--------------------|---------------|-------------------------------------| -| ME_MI | fLOS[i] | FFS | ALM | -| OSx_TT_Sk | fLOS | FFS | ALM | -| OSx/CBRx-b_A_Sk | fLFA | FFS | ALM | -| OSx/CBRx-c_A_Sk | fLFA | FFS | ALM | -| NOTE – Applicable only when (k=3, CBRx=ETC40GR) or (k=4, CBRx=ETC100GR). | | | | - -### **7.2.4 Reportable failure function** - -See clause 7.2.4 of [ITU-T G.7710] for a description of the reportable failure (REP) function. - -### **7.2.5 Unit alarm function** - -See clause 7.2.5 of [ITU-T G.7710] for a description of the unit alarm (UNA) function. - -### **7.2.6 Network element alarm function** - -See clause 7.2.6 of [ITU-T G.7710] for a description of the network element alarm (NEA) function. - -### **7.2.7 Station alarm function** - -See clause 7.2.7 of [ITU-T G.7710] for a description of the station alarm (STA) function. - -### **7.2.8 Telecommunications management network event pre-processing function** - -See clause 7.2.8 of [ITU-T G.7710] for a description of the TMN event pre-processing alarm (TEP) function. - -### **7.2.9 Alarm synchronization function** - -See clause 7.2.9 of [ITU-T G.7710] for a description of the alarm synchronization (ASY) function. - -### **7.2.10 Logging function** - -See clause 7.2.10 of [ITU-T G.7710] for a description of the logging (LOG) function. - -### **7.2.11 Telecommunications management network alarm event notification function** - -See clause 7.2.11 of [ITU-T G.7710] for a description of the TMN alarm event notification (TAN) function. - -### **7.2.12 Current problem list function** - -See clause 7.2.12 of [ITU-T G.7710] for a description of the current problem list (CPL) function. - -### **7.2.13 Alarm status function** - -See clause 7.2.13 of [ITU-T G.7710] for a description of the alarm status (AST) function. - -### **7.2.14 Operational state function – OPS** - -See clause 7.2.14 of [ITU-T G.7710] for a description of the operational state function. - -Table 7-3 lists the failures that could influence the operational state of the related objects. - -For an O.NE that supports the atomic functions listed in Table 7-3, the EMF OPS process shall support the operational state for the associated fault causes. - -**Table 7-3 – Input and output signals of the operational state function -for the optical transport network** - -| Atomic function | Failure input
(fZZZ-value) | Operational state output
(enabled/disabled)
of the trail object class | -|------------------------------------------------------------------------------|----------------------------------------------------------------------|--------------------------------------------------------------------------------------| -| OSM256.4/CBRx_A_So | fLOF | Disabled | -| OTS-O_TT_Sk | fTIM
fBDI
fBDI-P
fBDI-O
fLOS-P
fLOS | Enabled
Enabled
Enabled
Enabled
Disabled
Disabled | -| OMS-O_TT_Sk | fBDI
fBDI-O
fBDI-P
fSSF
fSSF-O
fSSF-P
fLOS-P | Enabled
Enabled
Enabled
Enabled
Enabled
Enabled
Disabled | -| OMS-O/OTSiG OCh-O_A_Sk | fMSIM[1..(n+m)] | Enabled | -| OCh-O_TT_Sk | fLOS-P
fOCI
fSSF
fSSF-P
fSSF-O | Disabled
Enabled
Enabled
Enabled
Enabled | -| OTSiG-O_TT_Sk | fOCI
fSSF
fSSF-P
fSSF-O
fTIM
fBDI
fBDI-P
fBDI-O | Enabled
Enabled
Enabled
Enabled
Enabled
Enabled
Enabled
Enabled | -| OTSi/OTUkV_A_Sk | fLOS-P
fLOF
fLOM | Disabled
Disabled
Disabled | -| OTSiG/OTUkV_A_Sk | fLOS-P
fLOF
fLOM | Disabled
Disabled
Disabled | -| OTSi/OTUk_A_Sk
See Table 16-1 of [ITU-T G.798] for the
function types | fLOS-P
fLOF
fLOM | Disabled
Disabled
Disabled | -| OTSiG/OTUk_A_Sk
See Table 16-6 of [ITU-T G.798] for the
function types | fLOS
fLOL
fLOF
fLOM | Disabled
Disabled
Disabled
Disabled | -| OTSi/FlexO-1-SC_A_Sk | fLOS-P
fLOL | Disabled
Disabled | - -**Table 7-3 – Input and output signals of the operational state function -for the optical transport network** - -| Atomic function | Failure input
(fZZZ-value) | Operational state output
(enabled/disabled)
of the trail object class | -|------------------------------------------------------------------------------------------------|---------------------------------------|--------------------------------------------------------------------------------------| -| | fLOM | Disabled | -| OTSi/OTUCn_A_Sk | fLOS-P | Disabled | -| | fLOL | Disabled | -| | fLOF | Disabled | -| | fLOM | Disabled | -| OTSiG/OTUCn_A_Sk | fLOS-P | Disabled | -| | fLOL | Disabled | -| | fLOF | Disabled | -| | fLOM | Disabled | -| OTSiG/FlexO_A_Sk | fLOS-P | Disabled | -| | fLOL | Disabled | -| | fLOM | Disabled | -| OTSi/OSC_A_Sk | fLOS-O | Disabled | -| OTU_TT_Sk | fTIM | Enabled | -| | fDEG | Enabled | -| | fBDI | Enabled | -| | fSSF | Enabled | -| OTUkV_TT_Sk | fTIM | Enabled | -| | fDEG | Enabled | -| | fBDI | Enabled | -| | fSSF | Enabled | -| OTUkV/ODU_A_Sk | fLOA | Disabled | -| ODUk_C | fFOP-PM | Disabled | -| | fFOP-NR | Disabled | -| ODUP_TT_Sk | fOCI | Enabled | -| | fTIM | Enabled | -| | fDEG | Enabled | -| | fBDI | Enabled | -| | fSSF | Enabled | -| | fLOCK | Enabled | -| | | | -| ODUkP/CBRx_A_Sk | fPLM | Disabled | -| | fCSF | Enabled | -| ODUP/NULL_A_Sk | fPLM | Disabled | -| ODUkP/PRBS_A_Sk | fPLM | Disabled | -| | fLSS | Disabled | -| ODUkP/RSn_A_Sk | fPLM | Disabled | -| | fLOF | Disabled | -| ODUkP/CBRx-g_A_Sk
For the values of k
and x in CBRx, see Table 14-18 of
[ITU-T G.798] | fPLM | Disabled | -| | fCSF | Enabled | -| | fLCS (Note) | Disabled | -| ODUkP/ETH_A_Sk | fPLMfLFD | Disabled | -| | fUPM | | - -**Table 7-3 – Input and output signals of the operational state function -for the optical transport network** - -| Atomic function | Failure input
(fZZZ-value) | Operational state output
(enabled/disabled)
of the trail object class | -|------------------------|-----------------------------------------------------------|--------------------------------------------------------------------------------------| -| | fEXM
fCSF | Disabled
Disabled
Enabled | -| ODUkP/ODU[i]j_A_Sk | fPLM
fMSIM[1..(n+m)]
fLOFLOM[1..(n+m)] | Disabled
Disabled
Disabled | -| ODUkP/ODUj-21_A_Sk | fPLM
fLOOMFI
fMSIM[1..n]
fLOFLOM[1..n] | FFS
FFS
FFS
Disabled | -| ODUkP-h/ETH_A_Sk | fPLM
fLFD
fUPM
fEXM
fCSF | Disabled
Disabled
Disabled
Disabled
Enabled | -| ODUkP-h/ODUj-21_A_Sk | fPLM
fLOOMFI
fMSIM[1..n]
fLOFLOM[1..n]
fRCOHM | Disabled
Disabled
Disabled
Disabled
FFS | -| ODU2P/ERS10G_A_Sk | fPLM
fLFD
fUPM
fEXM
fCSF | Disabled
Disabled
Disabled
Disabled
Enabled | -| ODU2eP/FC-1200_A_Sk | fPLM
fCSF
fLFD | Disabled
Enabled
Disabled | -| ODUCnP/ODUk_A_Sk | cPLM
cLOOMFI
cMSIM[1..m]
cLOFLOM[1..m] | Disabled
Disabled
Disabled
Disabled | -| ODUflexP/FlexEC_A_Sk | fPLM
fCSF
fLCS | Disabled
Disabled
Disabled | -| ODUflexP/FlexESG_A_So | fPMM
fGIDM
fLOL
fCSACM | Disabled
Disabled
Disabled
Disabled | - -**Table 7-3 – Input and output signals of the operational state function -for the optical transport network** - -| Atomic function | Failure input
(fZZZ-value) | Operational state output
(enabled/disabled)
of the trail object class | -|--------------------------------------------------------------------------------|-------------------------------|-----------------------------------------------------------------------------| -| ODUflexP/FlexESG_A_Sk | fPLM | Disabled | -| | fCSF | Disabled | -| | fCSACM | Disabled | -| | fLCS | Disabled | -| | fLOF | Disabled | -| | fLOM | Disabled | -| ODUflexP/ETCy_A_Sk
See Table 14-47.1 of [ITU-T G.798] for the
value of y | fPLM | Disabled | -| | fCSF | Disabled | -| | fLCS | Disabled | -| | fLRC | Disabled | -| ODUT_TT_Sk | fOCI | Enabled | -| | fTIM | Enabled | -| | fDEG | Enabled | -| | fBDI | Enabled | -| | fSSF | Enabled | -| | fLCK | Enabled | -| | fLTC | FFS | -| | | | -| ODUTm_TT_Sk | fOCI | Enabled | -| | fTIM | Enabled | -| | fDEG | Enabled | -| | fBDI | Enabled | -| | fSSF | Enabled | -| | fLCK | Enabled | -| | fLTC | FFS | -| | | | -| FlexO_TT_Sk | fRDI | Enabled | -| | fSSF | Enabled | -| FlexO-n/OTUCn_A_Sk | fLOFLOM[1..n] | Disabled | -| | fGIDM | Disabled | -| | fPMM | Disabled | -| | fLOL | Disabled | -| ME_MI | fLOS[i] | Disabled | -| OSx_TT_Sk | fLOS | Disabled | -| OSx/CBRx-b_A_Sk | fPLM | Disabled | -| OSx/CBRx-c_A_Sk | fPLM | Disabled | - -NOTE – Applicable only when (k=3, CBRx=ETC40GR) or (k=4, CBRx=ETC100GR). - -# 8 Configuration management - -See clause 8 of [ITU-T G.7710] for the generic requirements for CM. OTN-specific specifications, if needed, are explicitly described. - -## 8.1 Hardware - -See clause 8.1 of [ITU-T G.7710] for a description of hardware management. - -## 8.2 Software - -See clause 8.2 of [ITU-T G.7710] for a description of software management. - -## 8.3 Protection switching - -See clause 8.3 of [ITU-T G.7710] for a description of protection switching management. - -This function allows a user to provision and monitor the operation of protection processes deployed in an Ethernet (ETH) connection (ETH-C) process. - -Management information (MI) signals concerning the protection processes are listed in Table 8-3 and communicated between the EMF and the protection process through the MP. According to these MI signals, the EMF generates a corresponding event notification and state report signals to the MAF. - -For the protection processes supported by an O.NE, the O.NE EMF shall support the following management functions: - -- provisioning the protection switching MI; -- retrieving the protection switching MI; -- notifying the changes of the protection switching MI; -- receiving the monitored protection switching MI. - -## 8.4 Trail termination - -See clause 8.4 of [ITU-T G.7710] for a description of TT management. - -This function allows a user to provision and monitor the operation of the OTN TT process. - -A trail trace identifier (TTI) at the optical transmission section (OTS) layer is useful to ensure proper fibre connection between NEs, in particular in meshed network topology with optical cross-connections that have several line input ports and several line output ports. - -TTIs are also a means for the OS to deduce the network topology at the OTS layer first, and then at the OMS and optical channel (OCh) level. Specifically, the OS gets the list of source and sink (Sk) TTIs of all NEs and can automatically deduce the trails at the OTS layer by a comparison of the expected TTIs of the Sk objects and the TTIs sent from the source objects. Then, as there is only one instance of an OMS connection point (CP) and one instance of an OMS trail termination point (TTP), the OS can deduce automatically the topology at the OMS layer. A similar method may be applied at the OCh level from the list of existing ochCTP (which are named by omsTTP). - -The TTIs received are used at the NE level to detect wrong fibre connection and generate an OTS trail trace identifier mismatch (TIM) alarm if the accepted value is different from the expected value. - -The TTI at the OCh layer is necessary to check that the signal received by an Sk originates from the intended source. To be able to localize the cross-connection responsible for a TIM, the expected and the received OCh TTIs are needed at the Sk. - -The received OCh TTI is used at the NE level to detect incorrect OCh connections and to generate an OCH TIM alarm. - -The MI signals listed in Table 8-1 are communicated between the EMF and the OTN TT process across the MP within the O.NE. - -For the TT functions supported by an O.NE, the O.NE EMF shall support the following management functions: - -- provisioning the TT MI; -- retrieving the TT MI; -- notifying the changes of the TT MI; - -– receiving the monitored TT MI. - -**Table 8-1 – Trail termination-related provisioning and reporting** - -| MI signal | Value range | Default value | -|---------------------------------------------------|-------------------------------------------------------|----------------| -| OTS-O_TT_So Provisioning | | | -| OTS-O_TT_So_MI_TxTI | According to [ITU-T G.709] | Not applicable | -| OTS-O_TT_Sk Provisioning | | | -| OTS-O_TT_Sk_MI_ExSAPI | According to [ITU-T G.709] | Not applicable | -| OTS-O_TT_Sk_MI_ExDAPI | According to [ITU-T G.709] | Not applicable | -| OTS-O_TT_Sk_MI_GetActTI | According to [ITU-T G.798] | Not applicable | -| OTS-O_TT_Sk_MI_TIMDetMo | According to [ITU-T G.798] | OFF | -| OTS-O_TT_Sk_MI_TIMActDis | True, false | True | -| OTS-O_TT_Sk_MI_1second | According to [ITU-T G.798] | Not applicable | -| OTS-O_TT_Sk Reporting | | | -| OTS-O_TT_Sk_MI_ActTI | According to [ITU-T G.709] | Not applicable | -| OTSiG-O_TT_So Provisioning | | | -| OTSiG-O_TT_So_MI_TxTI | According to [ITU-T G.709] | Not applicable | -| OTSiG-O_TT_Sk Provisioning | | | -| OTSiG-O_TT_Sk_MI_ExSAPI | According to [ITU-T G.709] | Not applicable | -| OTSiG-O_TT_Sk_MI_ExDAPI | According to [ITU-T G.709] | Not applicable | -| OTSiG-O_TT_Sk_MI_GetActTI | According to [ITU-T G.798] | Not applicable | -| OTSiG-O_TT_Sk_MI_TIMDetMo | According to [ITU-T G.798] | OFF | -| OTSiG-O_TT_Sk_MI_TIMActDis | True, false | True | -| OTSiG-O_TT_Sk_MI_1second | According to [ITU-T G.798] | Not applicable | -| OTSiG-O_TT_Sk Reporting | | | -| OTSiG-O_TT_Sk_MI_ActTI | According to [ITU-T G.709] | Not applicable | -| OMS-O_TT_Sk Provisioning | | | -| OMS-O_TT_Sk_MI_1second | According to [ITU-T G.798] | Not applicable | -| OCh_TT_So Provisioning (Note 1) | | | -| OCh_TT_So_MI_nominalCentralFrequencyOrWavelength | See [ITU-T G.875] for the object OCh_TerminationPoint | – | -| OCh_TT_So_MI_selectedApplicationIdentifier | See [ITU-T G.875] for the object OCh_TerminationPoint | – | -| OCh_TT_So Reporting (Note 1) | | | -| OCh_TT_So_MI_nominalCentralFrequencyOrWavelength | See [ITU-T G.875] for the object OCh_TerminationPoint | – | -| OCh_TT_So_MI_supportableApplicationIdentifierList | See [ITU-T G.875] for the object OCh_TerminationPoint | – | -| OCh_TT_Sk Reporting (Note 1) | | | -| OCh_TT_Sk_MI_supportableApplicationIdentifierList | See [ITU-T G.875] for the object OCh_TerminationPoint | – | -| OTU_TT_So Provisioning | | | -| OTU_TT_So_MI_TxTI | According to [ITU-T G.709] | Not applicable | - -**Table 8-1 – Trail termination-related provisioning and reporting** - -| MI signal | Value range | Default value | -|--------------------------|----------------------------------------------------------------------------------------------------|------------------------| -| OTU_TT_Sk Provisioning | | | -| OTU_TT_Sk_MI_ExSAPI | According to [ITU-T G.709] | Not applicable | -| OTU_TT_Sk_MI_ExDAPI | According to [ITU-T G.709] | Not applicable | -| OTU_TT_Sk_MI_GetAcTI | According to [ITU-T G.798] | Not applicable | -| OTU_TT_Sk_MI_TIMDetMo | According to [ITU-T G.798] | OFF | -| OTU_TT_Sk_MI_TIMActDis | True, false | True | -| OTU_TT_Sk_MI_DEGThr | In number of errored blocks or as a percentage between 0% and 100%; see Table 7-1 of [ITU-T G.806] | SES Threshold (Note 2) | -| OTU_TT_Sk_MI_DEGM | 2-10; see Table 7-1 of [ITU-T G.806] | (Note 2) | -| OTU_TT_Sk_MI_1second | According to [ITU-T G.798] | Not applicable | -| OTU_TT_Sk Reporting | | | -| OTU_TT_Sk_MI_AcTI | According to [ITU-T G.709] | Not applicable | -| OTUkV_TT_So Provisioning | | | -| OTUkV_TT_So_MI_TxTI | According to [ITU-T G.709] | Not applicable | -| OTUkV_TT_Sk Provisioning | | | -| OTUkV_TT_Sk_MI_ExSAPI | According to [ITU-T G.709] | Not applicable | -| OTUkV_TT_Sk_MI_ExDAPI | According to [ITU-T G.709] | Not applicable | -| OTUkV_TT_Sk_MI_GetAcTI | According to [ITU-T G.798] | Not applicable | -| OTUkV_TT_Sk_MI_TIMDetMo | According to [ITU-T G.798] | OFF | -| OTUkV_TT_Sk_MI_TIMActDis | Enabled, disabled | Disabled | -| OTUkV_TT_Sk_MI_DEGThr | In number of errored blocks or as a percentage between 0% and 100%; see Table 7-1 of [ITU-T G.806] | SES Threshold (Note 2) | -| OTUkV_TT_Sk_MI_DEGM | 2-10; see Table 7-1 of [ITU-T G.806] | (Note 2) | -| OTUkV_TT_Sk_MI_1second | According to [ITU-T G.798] | Not applicable | -| OTUkV_TT_Sk Reporting | | | -| OTUkV_TT_Sk_MI_AcTI | According to [ITU-T G.709] | Not applicable | -| ODUP_TT_So Provisioning | | | -| ODUP_TT_So_MI_TxTI | According to [ITU-T G.709] | Not applicable | -| ODUP_TT_So_MI_DM_Source | true, false | false | -| ODUP_TT_So_MI_DMValue | Not applicable.
See [ITU-T G.798] | Not applicable | -| ODUP_TT_Sk Provisioning | | | -| ODUP_TT_Sk_MI_ExSAPI | According to [ITU-T G.709] | Not applicable | -| ODUP_TT_Sk_MI_ExDAPI | According to [ITU-T G.709] | Not applicable | -| ODUP_TT_Sk_MI_GetAcTI | According to [ITU-T G.798] | Not applicable | - -**Table 8-1 – Trail termination-related provisioning and reporting** - -| MI signal | Value range | Default value | -|-----------------------------|----------------------------------------------------------------------------------------------------|------------------------| -| ODUP_TT_Sk_MI_TIMDetMo | According to [ITU-T G.798] | OFF | -| ODUP_TT_Sk_MI_TIMActDis | Enabled, disabled | Disabled | -| ODUP_TT_Sk_MI_DEGThr | In number of errored blocks or as a percentage between 0% and 100%; see Table 7-1 of [ITU-T G.806] | SES Threshold (Note 2) | -| ODUP_TT_Sk_MI_DEGM | 2-10; see Table 7-1 of [ITU-T G.806] | (Note 2) | -| ODUP_TT_Sk_MI_1second | According to [ITU-T G.798] | Not applicable | -| ODUP_TT_Sk_MI_DM_Source | true, false | false | -| ODUP_TT_Sk_MI_DMValue | Not applicable.
See [ITU-T G.798] | Not applicable. | -| ODUP_TT_Sk Reporting | | | -| ODUP_TT_Sk_MI_AcTI | According to [ITU-T G.709] | Not applicable | -| ODUT_TT_So Provisioning | | | -| ODUT_TT_So_MI_TxTI | According to [ITU-T G.709] | Not applicable | -| ODUT_TT_So_MI_DM_Source | true, false | false | -| ODUT_TT_So_MI_DMValue | Not applicable.
See [ITU-T G.798] | Not applicable. | -| ODUT_TT_Sk Provisioning | | | -| ODUT_TT_Sk_MI_ExSAPI | According to [ITU-T G.709] | Not applicable | -| ODUT_TT_Sk_MI_ExDAPI | According to [ITU-T G.709] | Not applicable | -| ODUT_TT_Sk_MI_GetAcTI | According to [ITU-T G.798] | Not applicable | -| ODUT_TT_Sk_MI_TIMDetMo | According to [ITU-T G.798] | FFS | -| ODUT_TT_Sk_MI_TIMActDis | Enabled, disabled | Disabled | -| ODUT_TT_Sk_MI_DEGThr | In number of errored blocks or as a percentage between 0% and 100%; See Table 7-1 of [ITU-T G.806] | SES Threshold (Note 2) | -| ODUT_TT_Sk_MI_DEGM | 2-10; see Table 7-1 of [ITU-T G.806] | (Note 2) | -| ODUT_TT_Sk_MI_1second | According to [ITU-T G.798] | Not applicable | -| ODUT_TT_Sk_MI_DM_Source | true, false | true | -| ODUT_TT_Sk_MI_DMValue | Not applicable.
See [ITU-T G.798] | Not applicable. | -| ODUT_TT_Sk_MI_LTCAct_Enable | true, false | false | -| ODUT_TT_Sk Reporting | | | -| ODUT_TT_Sk_MI_AcTI | According to [ITU-T G.709] | Not applicable | -| ODUTm_TT_Sk Provisioning | | | -| ODUTm_TT_Sk_MI_Level | 1..6 | Not applicable | -| ODUTm_TT_Sk_MI_ExSAPI | According to [ITU-T G.709] | Not applicable | - -**Table 8-1 – Trail termination-related provisioning and reporting** - -| MI signal | Value range | Default value | -|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|----------------------------------------------------------------------------------------------------|------------------------| -| ODUTm_TT_Sk_MI_ExDAPI | According to [ITU-T G.709] | Not applicable | -| ODUTm_TT_Sk_MI_GetAcTI | According to [ITU-T G.798] | Not applicable | -| ODUTm_TT_Sk_MI_TIMDectMo | According to [ITU-T G.798] | FFS | -| ODUTm_TT_Sk_MI_TIMActDis | Enabled, disabled | Disabled | -| ODUTm_TT_Sk_MI_DEGThr | In number of errored blocks or as a percentage between 0% and 100%; see Table 7-1 of [ITU-T G.806] | SES Threshold (Note 2) | -| ODUTm_TT_Sk_MI_DEGM | 2-10; see Table 7-1 of [ITU-T G.806] | (Note 2) | -| ODUTm_TT_Sk_MI_1second | According to [ITU-T G.798] | Not applicable | -| ODUTm_TT_Sk Reporting | | | -| ODUTm_TT_Sk_MI_AcTI | According to [ITU-T G.709] | Not applicable | -| OSx_TT_So Provisioning | | | -| OSx_TT_So_MI_APRCntrl (Notes 3 and 4) | Enable, disable | Enable | -| NOTE 1 – These MIs are specified in [ITU-T G.798].
NOTE 2 – Equipment designed prior to the 2017 edition of this Recommendation may use a default MI_DEGTHR value of 30% and of MI_DEGM of 10.
NOTE 3 – If automatic power reduction (APR) is required.
NOTE 4 – The automatic power reduction control (APRCntrl) commands depend on the specific APR process. | | | - -For the management of the connectivity at the OTS layer, the following TTI attributes are recommended: - -- 1) otsTTIsent attribute in every otsTTPsource (get – replace); -- 2) otsTTIexpected attribute in every otsTTPsink (get – replace); -- 3) otsTTIreceived attribute in every otsTTPsink (get – replace). - -For the management of the connectivity at the OCH layer, the following TTI attributes are recommended: - -- 1) ochTTIsent attribute in every ochTTPsource (get – replace); -- 2) ochTTIexpected attribute in every ochTTPsink and ochCTPsink (get – replace); -- 3) ochTTIreceived attribute in every ochTTPsink and ochCTPsink (get only). - -## 8.5 Adaptation - -See clause 8.5 of [ITU-T G.7710] for a description of adaptation management. - -An access point (AP) that has multiple adaptation functions connected to it, thereby allowing different clients to be transported via the server signal, requires a mechanism for the selection of the active client. - -The adaptation function allows a user to provision and monitor the operation of the OTN adaptation processes. - -Both OMS/OCh\_A and OCh/Application\_A will report on request from the OTN EMF the value of the received and accepted payload type (PT) indication signal via the MI\_AcPTI. - -The MI signals listed in Table 8-2 are communicated between the EMF and the adaptation processes across the MP within the OTN NE. - -NOTE – ODUkP/ETH\_A and ODU2P/ETHPP-OS\_A are specified in [ITU-T G.798]. - -For the adaptation functions supported by an O.NE, the O.NE EMF shall support the following management functions: - -- provisioning the adaptation MI; -- retrieving the adaptation MI; -- notifying the changes of the adaptation MI. - -**Table 8-2 – Provisioning and reporting for adaptation functions** - -| MI signal | Value range | Default value | -|---------------------------------------------------------------------------------|-------------------------------------------------------------------------------------|----------------| -| OMS-O/OTSiG OCh-O_A_So Provisioning | | | -| OMS-O/OTSiG OCh-O_A_So_MI_TxMSI | The value range is implementation specific.
See clause 8.7.2.3 of [ITU-T G.798]. | Not applicable | -| OMS-O/OTSiG OCh-O_A_Sk Provisioning | | | -| OMS-O/OTSiG OCh-O_A_Sk_MI_ExMSI[1..(n+m)] for the n OTSiG-O_CPs and m OCh-O_CPs | The value range is implementation specific.
See clause 8.7.2.3 of [ITU-T G.798]. | Not applicable | -| OMS-O/OTSiG OCh-O_A_Sk Reporting | | | -| OMS-O/OTSiG OCh-O_A_Sk_MI_AcMSI[1..(n+m)] for the n OTSiG-O_CPs and m OCh-O_CPs | The value range is implementation specific.
See clause 8.7.2.3 of [ITU-T G.798]. | Not applicable | -| OSC/COMMS_A_So Provisioning | | | -| None | | | -| OSC/COMMS_A_Sk Provisioning | | | -| None | | | -| OSM256.4/CBRx_So Provisioning | | | -| None | | | -| OTSi/OTUkV_A_So Provisioning | | | -| None | | | -| OTSi/OTUkV_A_Sk Provisioning | | | -| OTSi/OTUkV_A_Sk_MI_1second | According to [ITU-T G.798] | Not applicable | -| OTSi/OTUk_A_So Provisioning | | | -| None | | | -| OTSi/OTUk_A_Sk Provisioning | | | -| See Table 16-1 of [ITU-T G.798] for the function types | | | -| OTSi/OTUk_A_Sk_MI_FECEn | True, false | True | - -**Table 8-2 – Provisioning and reporting for adaptation functions** - -| MI signal | Value range | Default value | -|-----------------------------------------------------------------------------------------|----------------------------|----------------| -| OTSi/OTUk_A_Sk_MI_1second | According to [ITU-T G.798] | Not applicable | -| OTSiG/OTUk_A_So Provisioning
See Table 16-6 of [ITU-T G.798] for the function types | | | -| None | | | -| OTSiG/OTUk_A_Sk Provisioning
See Table 16-6 of [ITU-T G.798] for the function types | | | -| OTSiG/OTUk_A_Sk_MI_FECEn | True, false | True | -| OTSiG/OTUk_A_Sk_MI_1second | According to [ITU-T G.798] | Not applicable | -| OTSiG/OTUkV_A_So Provisioning | | | -| None | | | -| OTSiG/OTUkV_A_Sk Provisioning
See Table 16-6 of [ITU-T G.798] for the function types | | | -| OTSiG/OTUkV_A_Sk_MI_1second | According to [ITU-T G.798] | Not applicable | -| OTSi/FlexO-1-SC_A_So Provisioning | | | -| None | | | -| OTSi/FlexO-1-SC_A_Sk Provisioning | | | -| OTSi/FlexO-1-SC_A_Sk_MI_FECEn | True, false | True | -| OTSi/FlexO-1-SC_A_Sk_MI_1second | According to [ITU-T G.798] | Not applicable | -| OTSiG/OTUCn_A_So Provisioning | | | -| OTSiA/OTUCn_A_So_MI_Active | True, false | False | -| OTSiG/OTUCn_A_Sk Provisioning | | | -| OTSiG/OTUCn_A_Sk_MI_1second | According to [ITU-T G.798] | Not applicable | -| OTSiG/FlexO_A_So Provisioning | | | -| None | | | -| OTSiG/FlexO_A_Sk Provisioning | | | -| OTSiG/FlexO_A_Sk_MI_FECEn | | | -| OTSiG/FlexO_A_Sk_MI_1second | According to [ITU-T G.798] | Not applicable | -| OTSiG/OTUk-SC_A_Sk_MI_1second | | | -| OTSi/OSC_A_So Provisioning | | | -| None | | | -| OTSi/OSC_A_Sk Provisioning | | | -| OTSi/OSC_A_Sk_MI_1second | According to [ITU-T G.798] | Not applicable | -| OTU/ODU_A_So_Provisioning | | | - -**Table 8-2 – Provisioning and reporting for adaptation functions** - -| MI signal | Value range | Default value | -|--------------------------------|-----------------------------------------|---------------| -| OTU/ODU_A_So_MI_AdminState | LOCKED, Not LOCKED | Not LOCKED | -| OTU/ODU_A_So_MI_APS_EN | true, false | true | -| OTU/ODU_A_So_MI_APS_LVL | 0..6,
0 for path and 1..6
for TCM | – | -| OTU/ODU_A_Sk_Provisioning | | | -| OTU/ODU_A_Sk_MI_AdminState | LOCKED, Not LOCKED | Not LOCKED | -| OTU/ODU_A_Sk_MI_APS_EN | true, false | true | -| OTU/ODU_A_Sk_MI_APS_LVL | 0..6,
0 for path and 1..6
for TCM | – | -| OTUkV/ODU_A_So_Provisioning | | | -| OTUkV/ODU_A_So_MI_AdminState | LOCKED, Not LOCKED | Not LOCKED | -| OTUkV/ODU_A_So_MI_APS_EN | true, false | true | -| OTUkV/ODU_A_So_MI_APS_LVL | 0..6,
0 for path and 1..6
for TCM | – | -| OTUkV/ODU_A_Sk_Provisioning | | | -| OTUkV/ODU_A_Sk_MI_AdminState | LOCKED, Not LOCKED | Not LOCKED | -| OTUkV/ODU_A_Sk_MI_APS_EN | true, false | true | -| OTUkV/ODU_A_Sk_MI_APS_LVL | 0..6,
0 for path and 1..6
for TCM | – | -| OTU/COMMS_A_So_Provisioning | | | -| None | | | -| OTU/COMMS_A_Sk_Provisioning | | | -| None | | | -| OTUkV/COMMS_A_So_Provisioning | | | -| None | | | -| OTUkV/COMMS_A_Sk_Provisioning | | | -| None | | | -| ODUkP/CBRx-a_A_So_Provisioning | | | -| None | | | -| ODUkP/CBRx-b_A_So_Provisioning | | | -| None | | | -| ODUkP/CBRx_A_Sk_Provisioning | | | -| ODUkP/CBRx_A_Sk_MI_CSF_Enable | True, False | False | - -**Table 8-2 – Provisioning and reporting for adaptation functions** - -| MI signal | Value range | Default value | -|-------------------------------------------------------------------------------------------------|-------------------------------|----------------| -| ODUkP/CBRx_A_Sk Reporting | | | -| ODUkP/CBRx_A_Sk_MI_AcPT,
(Note 1) | According to
[ITU-T G.798] | Not applicable | -| ODUkP/CBRx-g_A_So Provisioning | | | -| None | | | -| ODUkP/CBRx-g_A_Sk Provisioning | | | -| None | | | -| ODUkP/ CBRx-g_A_Sk Reporting | | | -| ODUkP/CBRx_A_Sk_MI_AcPT
(For the values of k and x in CBRx, see Table 15-8 of [ITU-T G.709]) | 0 to 255 | Not applicable | -| ODUP/NULL_A_So Provisioning | | | -| ODUP/NULL_A_So_MI_Nominal_Bitrate_and_Tolerance | According to
[ITU-T G.798] | Not applicable | -| ODUP/NULL_A_Sk Provisioning | | | -| None | | | -| ODUP/NULL_A_Sk Reporting | | | -| ODUP/NULL_A_Sk_MI_AcPT, k=0, 1, 2, 2e, 3, 4, flex | According to
[ITU-T G.798] | Not applicable | -| ODUP/PRBS_A_So Provisioning | | | -| ODUP/PRBS_A_So_MI_Nominal_Bitrate_and_Tolerance | According to
[ITU-T G.798] | Not applicable | -| ODUP/PRBS_A_Sk Provisioning | | | -| ODUP/PRBS_A_Sk_MI_1second | According to
[ITU-T G.798] | Not applicable | -| ODUP/PRBS_A_Sk Reporting | | | -| ODUP/PRBS_A_Sk_MI_AcPT, k=0, 1, 2, 2e, 3, 4, flex | According to
[ITU-T G.798] | Not applicable | -| ODUkP/RSn_A_So Provisioning
See clause 14.3.6 of [ITU-T G.798] | | | -| None | | | -| ODUkP/RSn_A_Sk Provisioning
See clause 14.3.6 of [ITU-T G.798] | | | -| None | | | -| ODUkP/RSn_A_Sk Reporting
See clause 14.3.6 of [ITU-T G.798] | | | -| ODUkP/RSn_A_Sk_MI_AcPT | According to
[ITU-T G.709] | Not applicable | -| ODUkP/ODU[i]j_A_So Provisioning | | | -| ODUkP/ODU[i]j_A_So_MI_AdminState[1..(n+m)] | LOCKED, Not
LOCKED | Not LOCKED | -| ODUkP/ODU[i]j_A_So_MI_APS_EN[1..(n+m)] | true, false | true | - -**Table 8-2 – Provisioning and reporting for adaptation functions** - -| MI signal | Value range | Default value | -|--------------------------------------------------------------------------------|-------------------------------------------------|----------------| -| ODUkP/ODU[i]j_A_So_MI_APS_LVL[1..(n+m)] | 0..6,
0 for path and 1..6
for TCM | – | -| ODU3P/ODU12_A_So Provisioning | | | -| ODU3P/ODU12_A_So_MI_TxMSI | According to
Table 14-30 of
[ITU-T G.798] | Not applicable | -| ODUkP/ODU[i]j_A_Sk Provisioning | | | -| ODUkP/ODU[i]j_A_Sk_MI_AdminState[1..(n+m)] | LOCKED, Not
LOCKED | Not LOCKED | -| ODUkP/ODU[i]j_A_Sk_MI_APS_EN[1..(n+m)]
when doing m x ODUi_CP respectively. | true, false | true | -| ODUkP/ODU[i]j_A_Sk_MI_APS_LVL[1..(n+m)] | 0..6,
0 for path and 1..6
for TCM | – | -| ODU3P/ODU12_A_Sk Provisioning | | | -| ODU3P/ODU12_A_Sk_MI_ExMSI[1..(n+m)] | According to
Table 14-32 of
[ITU-T G.798] | Not applicable | -| ODUkP/ODU[i]j_A_Sk Reporting | | | -| ODUkP/ODU[i]j_A_Sk_MI_AcPT | According to
[ITU-T G.709] | Not applicable | -| ODUkP/ODU[i]j_A_Sk_MI_AcMSI[1..(n+m)] | According to
[ITU-T G.709] | Not applicable | -| ODUkP/ODUj-21_A_So Provisioning | | | -| ODUkP/ODUj-21_A_So_MI_TxMSI | According to
[ITU-T G.798] | Not applicable | -| ODUkP/ODUj-21_A_So_MI_AUTOpayloadtype | According to
[ITU-T G.798] | Not applicable | -| ODUkP/ODUj-21_A_So_MI_ODUType_Rate[1..n] | According to
clause 19.6 of
[ITU-T G.709] | Not applicable | -| ODUkP/ODUj_A_So_MI_AdminState[1..n] | LOCKED, Not
LOCKED | Not LOCKED | -| ODUkP/ODUj-21_A_So_MI_APS_EN[1..n] | true, false | true | -| ODUkP/ODUj-21_A_So_MI_APS_LVL[1..n] | 0..6,
0 for path and 1..6
for TCM | – | -| ODUkP/ODUj-21_A_So Reporting | | | -| ODUkP/ODUj-21_A_So_MI_TrPT | According to
[ITU-T G.709] | Not applicable | - -**Table 8-2 – Provisioning and reporting for adaptation functions** - -| MI signal | Value range | Default value | -|-----------------------------------------------------------|-----------------------------------------------|----------------| -| ODUkP/ODUj-21_A_Sk Provisioning | | | -| ODUkP/ODUj-21_A_Sk_MI_ExMSI[1..n] | According to [ITU-T G.798] | Not applicable | -| ODUkP/ODUj-21_A_Sk_MI_AdminState[1..n] | LOCKED, Not LOCKED | Not LOCKED | -| ODUkP/ODUj-21_A_Sk_MI_Nominal_Bitrate_and_Tolerance[1..n] | According to [ITU-T G.798] | Not applicable | -| ODUkP/ODUj-21_A_Sk_MI_ODUType[1..n] | According to clause 19.6 of [ITU-T G.709] | Not applicable | -| ODUkP/ODUj-21_A_Sk_MI_APS_EN[1..n] | true, false | true | -| ODUkP/ODUj-21_A_Sk_MI_APS_LVL[1..n] | 0..6,
0 for path and 1..6 for TCM | – | -| ODUkP/ODUj-21_A_Sk Reporting | | | -| ODUkP/ODUj-21_A_Sk_MI_AcPT | According to [ITU-T G.709] | Not applicable | -| ODUkP/ODUj-21_A_Sk_MI_AcMSI[1..n] | According to [ITU-T G.709] | Not applicable | -| ODU2P/ERS10G_A_So Provisioning | | | -| ODU2P/ERS10G_A_So_MI_CSFEnable | True, False | True | -| ODU2P/ERS10G_A_So Reporting | | | -| None | | | -| ODU2P/ERS10G_A_Sk Provisioning | | | -| ODU2P/ERS10G_A_Sk_MI_CSF_Reported | True, False | False | -| ODU2P/ERS10G_A_Sk Reporting | | | -| ODU2P/ERS10G_A_Sk_MI_AcPT | 0 to 255
(See Table 15-8 of [ITU-T G.709]) | Not applicable | -| ODU2P/ERS10G_A_Sk_MI_AcEXI | 0 to 255
(See Table 6-2 of [ITU-T G.7041]) | Not applicable | -| ODU2P/ERS10G_A_Sk_MI_AcUPI | 0 to 255
(See Table 6-3 of [ITU-T G.7041]) | Not applicable | -| ODUkP/ETH_A_So Provisioning, in G.798 | | | -| ODUkP/ETH_A_So_MI_CSFEnable | True, False | True | -| ODUkP/ETH_A_So_MI_CSFrdifdiEnable (Note 2) | True, False | True | -| ODUkP/ETH_A_Sk Provisioning, | | | -| ODUkP/ETH_A_Sk_MI_FilterConfig | (Note 3) | (Note 3) | -| ODUkP/ETH_A_Sk_MI_CSF_Reported | True, False | False | -| ODUkP/ETH_A_Sk_MI_CSFrdifdiEnable (Note 2) | True, False | True | - -**Table 8-2 – Provisioning and reporting for adaptation functions** - -| MI signal | Value range | Default value | -|---------------------------------------------|-----------------------------------------------|----------------| -| ODUkP/ETH_A_Sk_MI_MAC_Length | 1518, 1522, 2000 | 2000 | -| ODUkP/ETH_A_Sk Reporting | | | -| ODUkP/ETH_A_So_MI_MI_AcPT | 0 to 255
(See Table 15-8 of [ITU-T G.709]) | Not applicable | -| ODUkP/ETH_A_So_MI_MI_AcEXI | 0 to 255
(See Table 6-2 of [ITU-T G.7041]) | Not applicable | -| ODUkP/ETH_A_So_MI_MI_AcUPI | 0 to 255
(See Table 6-3 of [ITU-T G.7041]) | Not applicable | -| ODUkP-h/ETH_A_So Provisioning | | | -| ODUkP-h/ETH_A_So_MI_CSFEnable | True, False | True | -| ODUkP-h/ETH_A_So_MI_CSFrdfidEnable (Note 2) | True, False | True | -| ODUkP-h/ETH_A_So_MI_INCREASE | True, False | False | -| ODUkP-h/ETH_A_So_MI_DECREASE | True, False | False | -| ODUkP-h/ETH_A_So_MI_TSNUM | According to [ITU-T G.7044] | Not applicable | -| ODUkP-h/ETH_A_So_MI_ODUflexRate | FlexCBR, FlexGFP | Not applicable | -| ODUkP-h/ETH_A_So Reporting | | | -| ODUkP-h/ETH-m_A_So_MI_ADJSTATE | According to [ITU-T G.7044] | Not applicable | -| ODUkP-h/ETH_A_Sk Provisioning | | | -| ODUkP-h/ETH-h_A_Sk_MI_FilterConfig | (Note 3) | (Note 3) | -| ODUkP-h/ETH-h_A_Sk_MI_CSF_ Reported | True, False | False | -| ODUkP-h/ETH_A_Sk_MI_CSFrdfidEnable (Note 2) | True, False | True | -| ODUkP-h/ETH-h_A_Sk_MI_MAC_Length | 1518, 1522, 2000 | 2000 | -| ODUkP-h/ETH_A_Sk_MI_INCREASE | True, False | False | -| ODUkP-h/ETH_A_Sk_MI_DECREASE | True, False | False | -| ODUkP-h/ETH_A_Sk Reporting | | | -| ODUkP-h/ETH_A_Sk_MI_AcPT | 0 to 255
(See Table 15-8 of [ITU-T G.709]) | Not applicable | -| ODUkP-h/ETH_A_Sk_MI_AcEXI | 0 to 255
(See Table 6-2 of [ITU-T G.7041]) | Not applicable | -| ODUkP-h/ETH_A_Sk_MI_AcUPI | 0 to 255
(See Table 6-3 of [ITU-T G.7041]) | Not applicable | -| ODUkP-h/ODUj-21_A_So Provisioning; | | | -| ODUkP-h/ODUj-21_A_So_MI_TxMSI | According to [ITU-T G.798] | Not applicable | - -**Table 8-2 – Provisioning and reporting for adaptation functions** - -| MI signal | Value range | Default value | -|--------------------------------------------------------------|-------------------------------------------|----------------| -| ODUkP-h/ODUj-21_A_So_MI_Autopayloadtype mapping. | According to [ITU-T G.798] | Not applicable | -| ODUkP-h/ODUj-21_A_So_MI_ODUType_Rate[1..n] | According to clause 19.6 of [ITU-T G.709] | Not applicable | -| ODUkP-h/ODUj-21_A_So_MI_AdminState[1..n] | According to [ITU-T G.798] | Not applicable | -| ODUkP-h/ODUj-21_A_So_MI_APS_EN[1..n] | true, false | true | -| ODUkP-h/ODUj-21_A_So_MI_APS_LVL[1..n] | 0..6,
0 for path and 1..6 for TCM | – | -| ODUkP-h/ODUj-21_A_So_MI_INCREASE | True, false | False | -| ODUkP-h/ODUj-21_A_So_MI_DECREASE | True, false | False | -| ODUkP-h/ODUj-21_A_So_MI_TSMAP | According to [ITU-T G.7044] | Not applicable | -| ODUkP-h/ODUj-21_A_So_MI_TPID | According to [ITU-T G.7044] | Not applicable | -| ODUkP-h/ODUj-21_A_So Reporting | | | -| ODUkP-h/ODUj-21_A_So_MI_TRPT | According to [ITU-T G.7044] | Not applicable | -| ODUkP-h/ODUj-21_A_So_MI_ADJSTATE | According to [ITU-T G.7044] | Not applicable | -| ODUkP-h/ODUj-21_A_Sk Provisioning | | | -| ODU3P-h /ODUj21_A_Sk_MI_ExMSI[1..n] | According to [ITU-T G.798] | Not applicable | -| ODUkP-h /ODUj-21_A_Sk_MI_AdminState[1..n] | According to [ITU-T G.798] | Not applicable | -| ODUkP-h /ODUj-21_A_Sk_MI_Nominal_Bitrate_and_Tolerance[1..n] | According to [ITU-T G.709] | Not applicable | -| ODUkP-h/ODUj-21_A_Sk_MI_APS_EN[1..n] | true, false | true | -| ODUkP-h/ODUj-21_A_Sk_MI_APS_LVL[1..n] | 0..6,
0 for path and 1..6 for TCM | – | -| ODUkP-h/ODUj-21_A_Sk_MI_ODUType[1..n] | According to clause 19.6 of [ITU-T G.709] | Not applicable | -| ODUkP-h/ODUj-21_A_Sk_MI_INCREASE | True, false | False | -| ODUkP-h/ODUj-21_A_Sk_MI_DECREASE | True, false | False | -| ODUkP-h/ODUj-21_A_Sk_MI_TSMAP | According to [ITU-T G.7044] | Not applicable | -| ODUkP-h/ODUj-21_A_Sk_MI_TPID | According to [ITU-T G.7044] | Not applicable | - -**Table 8-2 – Provisioning and reporting for adaptation functions** - -| MI signal | Value range | Default value | -|---------------------------------------------------------|-----------------------------------------------|----------------| -| ODUkP-h/ODUj-21_A_Sk Reporting | | | -| ODUkP-h/ODUj-21_A_Sk_MI_AcPT | According to [ITU-T G.709] | Not applicable | -| ODUkP-h/ODUj-21_A_Sk_MI_AcMSI[1..n]. | According to [ITU-T G.709] | Not applicable | -| ODU2eP/FC-1200_A_So Provisioning | | | -| None | | | -| ODU2eP/FC-1200_A_Sk Provisioning | | | -| None | | | -| ODU2eP/FC-1200_A_Sk Reporting | | | -| ODU2eP/FC-1200_A_Sk_MI_AcPT | 0 to 255
(See Table 15-8 of [ITU-T G.709]) | Not applicable | -| ODUCnP/ODUk_A_So Provisioning | | | -| ODUCnP/ODUk_A_So_MI_TxMSI | According to [ITU-T G.798] | Not applicable | -| ODUCnP/ODUk_A_So_MI_Nominal_Bitrate_and_Tolerance[1..m] | According to [ITU-T G.709] | Not applicable | -| ODUCnP/ODUk_A_So_MI_AdminState[1..m] | LOCKED, Not LOCKED | Not LOCKED | -| ODUCnP/ODUk_A_So_MI_APS_EN[1..m] | true, false | true | -| ODUCnP/ODUk_A_SoMI_APS_LVL[1..m] | 0..6,
0 for path and 1..6 for TCM | – | -| ODUCnP/ODUk_A_Sk Provisioning | | | -| ODUCnP/ODUk_A_Sk_MI_ExMSI | According to [ITU-T G.798] | Not applicable | -| ODUCnP/ODUk_A_Sk_MI_Nominal_Bitrate_and_Tolerance[1..m] | According to [ITU-T G.709] | Not applicable | -| ODUCnP/ODUk_A_Sk_MI_AdminState[1..m] | LOCKED, Not LOCKED | Not LOCKED | -| ODUCnP/ODUk_A_Sk_MI_APS_EN[1..m] | true, false | true | -| ODUCnP/ODUk_A_SkMI_APS_LVL[1..m] | 0..6,
0 for path and 1..6 for TCM | – | -| ODUCnP/ODUk_A_Sk Reporting | | | -| ODUCnP/ODUk_A_Sk_MI_AcPT | According to [ITU-T G.709] | Not applicable | -| ODUCnP/ODUk_A_Sk_MI_AcMSI | According to [ITU-T G.709] | Not applicable | - -**Table 8-2 – Provisioning and reporting for adaptation functions** - -| MI signal | Value range | Default value | -|--------------------------------------------------------------------------------------------|---------------------------------------------------------------------------------------------------------------------------------------------|----------------| -| ODUflexP/FlexEC_A_So Provisioning | | | -| None | | | -| ODUflexP/FlexEC_A_Sk Provisioning | | | -| None | | | -| ODUflexP/FlexEC_A_Sk Reporting | | | -| ODUflexP/FlexEC_A_Sk_MI_AcPT | According to [ITU-T G.709] | Not applicable | -| ODUflexP/FlexESG_A_So Provisioning | | | -| ODUflexP/FlexESG_A_So_MI_ExGID | See clause 9.2.2 of [ITU-T G.709.1]. | Not applicable | -| ODUflexP/FlexESG_A_So_MI_ExPhyMAP | A 256 bit (8 byte) Bit Map. A bit is set to "1" indicating a member/PHY is part of the FlexO Group.
See clause 9.2.4 of [ITU-T G.709.1]. | Not applicable | -| ODUflexP/FlexESG_A_So_MI_CS_n[1..p] | Integer from 1 to 254.
See clause 9.2.2 of [ITU-T G.709.1]. | Not applicable | -| ODUflexP/FlexESG_A_So Reporting | | | -| ODUflexP/FlexESG_A_So_MI_AcCC[1..p] | According to [ITU-T G.709.1] | Not applicable | -| ODUflexP/FlexESG_A_So_MI_AcCCA[1..p] | According to [ITU-T G.709.1] | Not applicable | -| ODUflexP/FlexESG_A_So_MI_AcCCB[1..p] | According to [ITU-T G.709.1] | Not applicable | -| ODUflexP/FlexESG_A_Sk Provisioning | | | -| ODUflexP/FlexESG_A_Sk_MI_CS_n[1..p] | According to [ITU-T G.709.1] | Not applicable | -| ODUflexP/FlexESG_A_Sk Reporting | | | -| ODUflexP/FlexESG_A_Sk_MI_AcPT | According to [ITU-T G.709.1] | Not applicable | -| ODUflexP/ETCy_A_So Provisioning | | | -| None | | | -| ODUflexP/ETCy_A_So Reporting | | | -| None | | | -| ODUflexP/ETCy_A_Sk Provisioning
(See Table 14-47.1 of [ITU-T G.798] for the value of y) | | | -| ODUflexP/ETCy_A_Sk_MI_CSF_Enable | True, False | False | - -**Table 8-2 – Provisioning and reporting for adaptation functions** - -| MI signal | Value range | Default value | -|-----------------------------------------------------------------------------------------|---------------------------------------------------------------------------------------------------------------------------------------------|----------------| -| ODUflexP/ETCy_A_Sk Reporting
(See Table 14-47.1 of [ITU-T G.798] for the value of y) | | | -| ODUflexP/ETCy_A_Sk_MI_AcPT | According to [ITU-T G.709] | Not applicable | -| ODUP/COMMS_A_So Provisioning | | | -| ODUP/COMMS_A_So_MI_GCCAccess, k=0, 1, 2, 2e, 3, 4, flex | GCC1, GCC2, GCC1+GCC2 | Not applicable | -| ODUP/COMMS_A_Sk Provisioning | | | -| ODUP/COMMS_A_Sk_MI_GCCAccess, k=0, 1, 2, 2e, 3, 4, flex | GCC1, GCC2, GCC1+GCC2 | Not applicable | -| ODU/COMMS_AC_So Provisioning | | | -| ODU/COMMS_AC_So_MI_GCCAccess, k=0, 1, 2, 2e, 3, 4, flex | GCC1, GCC2, GCC1+GCC2 | Not applicable | -| ODU/COMMS_AC_Sk Provisioning | | | -| ODU/COMMS_AC_Sk_MI_GCCAccess, k=0, 1, 2, 2e, 3, 4, flex | GCC1, GCC2, GCC1+GCC2 | Not applicable | -| ODU/COMMS_AC_Sk_MI_GCCCont, k=0, 1, 2, 2e, 3, 4, flex | True, false | True | -| ODUT/ODU_A_So Provisioning | | | -| ODUT/ODU_A_So_MI_AdminState, k=0, 1, 2, 2e, 3, 4, flex | LOCKED, Not LOCKED | Not LOCKED | -| ODUT/ODU_A_Sk Provisioning | | | -| ODUT/ODU_A_Sk_MI_AdminState, k=0, 1, 2, 2e, 3, 4, flex | LOCKED, Not LOCKED | Not LOCKED | -| FlexO-n/OTUCn_A_So Provisioning | | | -| FlexO-n/OTUCn_A_So_MI_TxGID(Note 4) | Integer >=0
encoded in 20-bit.
See clause 9.2.2 of [ITU-T G.709.1]. | None | -| FlexO-n/OTUCn_A_So_MI_TxPID[1..n] (Note 5 and Note 6) | Integer from 1 to 254.
See clause 9.2.3 of [ITU-T G.709.1]. | None | -| FlexO-n/OTUCn_A_So_MI_TxPhyMAP (Note 5 and Note 8) | A 256 bit (8 byte) Bit Map. A bit is set to "1" indicating a member/PHY is part of the FlexO Group.
See clause 9.2.4 of [ITU-T G.709.1]. | None | -| FlexO-n/OTUCn_A_Sk Provisioning | | | -| FlexO/OTUCn_A_Sk_MI_ExGID (Note 4) | Integer >=0
encoded in 20-bit. | None | - -**Table 8-2 – Provisioning and reporting for adaptation functions** - -| MI signal | Value range | Default value | -|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|----------------------------------------------------------------------------------------------------------------------------------------------|---------------| -| | See clause 9.2.2 of [ITU-T G.709.1]. | | -| FlexO/OTUCn_A_Sk_MI_ExPhyMAP (Note 7 and Note 8) | A 256-bit (8 bytes) Bit Map. A bit is set to "1" indicating a member/PHY is part of the FlexO Group.
See clause 9.2.4 of [ITU-T G.709.1]. | None | -| FlexO/OTUCn_A_Sk_MI_ExPID[1..n] (Note 6 and Note 7) | Integer from 1 to 254.
See clause 9.2.2 of [ITU-T G.709.1]. | None | -| FlexO/FCC_A_So Provisioning | | | -| None defined in [ITU-T G.798] | | | -| FlexO/FCC_A_Sk Provisioning | | | -| None defined in [ITU-T G.798] | | | -| OSx/CBRx_A_So_Provisioning | | | -| None defined in [ITU-T G.798] | | | -| OSx/CBRx_A_Sk Provisioning | | | -| None defined in [ITU-T G.798] | | | -| OSx/CBRx-b_A_So_Provisioning | | | -| None defined in [ITU-T G.798] | | | -| OSx/CBRx-b_A_Sk Provisioning | | | -| OSx/CBRx-b_A_Sk_MI_FECEn | True, false | False | -| OSx/CBRx-b_A_Sk_MI_1second | True, false | False | -| OSx/CBRx-c_A_Sk Provisioning | | | -| OSx/CBRx-c_A_Sk_MI_1second | True, false | False | -| NOTE 1 – x = 2G5, 10G, 10G3, 40G. | | | -| NOTE 2 – The EMF shall configure the same value for the MI_CSFrdifdiEnable signals of the paired source and Sk functions. | | | -| NOTE 3 – According to clause 8.3 of [ITU-T G.8021]. | | | -| NOTE 4 – The EMF shall configure the same value for the MI_TxGID and MI_ExGID signals of the paired FlexO-n/OTUCn_A_So and FlexO-n/OTUCn_A_Sk functions. | | | -| NOTE 5 – The EMF shall configure consistent values between the MI_TxPID[1..n] and MI_TxPhyMAP of the same FlexO-n/OTUCn_A_So function, as described in clause 9.2.4 of [ITU-T G.709.1]. | | | -| NOTE 6 – The EMF shall configure the same values for the MI_TxPID[1..n] and MI_ExPID[1..n] signals of the paired FlexO-n/OTUCn_A_So and FlexO-n/OTUCn_A_Sk functions. | | | -| NOTE 7 – The EMF shall configure consistent values between the MI_ExPID[1..n] and MI_ExPhyMAP of the same FlexO-n/OTUCn_A_Sk function, as described in clause 9.2.4 of [ITU-T G.709.1]. | | | -| NOTE 8 – The EMF shall configure the same values for the MI_TxPhyMAP and MI_ExPhyMAP signals of the paired FlexO-n/OTUCn_A_So and FlexO-n/OTUCn_A_Sk functions. | | | - -## 8.6 Connection - -See clause 8.6 of [ITU-T G.7710] for a description of connection management. - -This function allows a user to provision the operation of an OTN connection process. - -The MI signals listed in Table 8-3 are communicated from the EMF to the connection process through the MP. - -For the connection functions supported by an O.NE, the O.NE EMF shall support the following management functions: - -- provisioning the connection MI; -- retrieving the connection MI; -- notifying the changes of the connection MI. - -**Table 8-3 – Provisioning and reporting for connection functions** - -| MI signal | Value range | Default value | -|----------------------------------------------------------------------------------|---------------------------------------------|----------------| -| OMSnP_C Provisioning | | | -| OMSnP_C_MI_OperType | Revertive, non-revertive | Revertive | -| OMSnP_C_MI_WTR | 5..12 min | FFS | -| OMSnP_C_MI_HoTime | 0..10 s in steps of 100 ms | FFS | -| OMSnP_C_MI_ExtCMD | – (Command) | Not applicable | -| OMSnP_C_MI_SSF-ODis | True, false | False | -| OTSiA OCh_C Provisioning | | | -| OTSiA OCh_C_MI_MatrixControl | Connect, disconnect | Not applicable | -| Per protection group: | Revertive, non-revertive | Revertive | -| OTSiA OCh_C_MI_OperType | 5..12 min | FFS | -| OTSiA OCh_C_MI_WTR | 0..10 s in steps of 100 ms | FFS | -| OTSiA OCh_C_MI_HoTime | – (Command) | Not applicable | -| OTSiA OCh_C_MI_ExtCMD | True, false | False | -| OTSiA OCh_C_MI_TSF-ODis | | | -| ODUk_C Provisioning | | | -| ODUk_C_MI_MatrixControl | Connect, disconnect | Not applicable | -| Per protection group: | According to clause 8.4 of [ITU-T G.873.1]. | 000x | -| ODUk_C_MI_ProtType | Revertive, non-revertive | | -| ODUk_C_MI_OperType | 5..12 min | Revertive | -| ODUk_C_MI_WTR | 0..10 s in steps of 100 ms | FFS | -| ODUk_C_MI_HoTime | – (Command) | FFS | -| ODUk_C_MI_ExtCMD | 0..7 (for Path, TCM1..6, Section) | Not applicable | -| ODUk_C_MI_APSChannel (Note) | True, false | Not applicable | -| ODUk_C_MI_SDEnable | | True | -| NOTE – According to 14.1.1 in G.798, ODUCn is excluded from ODU_C. | | | -| NOTE – For SNC protection with an automatic protection switching (APS) protocol. | | | - -Reconfigurable NEs provide connection capabilities at the OCh layer. Cross-connections can be configured between client add ports and line output ports or between line input ports and client drop ports or between line input ports and line output ports (straight through matrix connections). - -NOTE 1 – A matrix connection between a client add port and a client drop port is not useful from a network provisioning point of view, as it does not carry a signal through the optical core network, but it can be useful for loop back test purposes. - -The following management functions are identified. - -### 1) *Get connectivity capabilities* - -Because reconfigurable NEs may have static cross-connection restrictions, the OS should be aware of these restrictions. - -This function gives an overview of the fabric's static capability to connect TPs. This is done by identifying one or more sets of TPs that can be interconnected. - -Restrictions of connectivity may be caused by principal design of the switch matrix or by the fact that not all Sk TPs are fully reachable from all source TPs. One example for restricted connectivity capability is a missing frequency conversion function in an all-optical network. - -This function should not take limited processing capacity, usage or current problems into account. These additional restrictions have to be considered dynamically by the OS. - -### 2) *Report connectivity changes of an optical cross-connect* - -The availability of frequency converters in a cross-connect may change. As a consequence, the connectivity sets (sets of TPs that can be connected by the fabric) may change. The NE has to send a report when the connectivity of the fabric changes. - -NOTE 2 – After receiving a report about connectivity changes, the OS may again get all connectivity sets to update its connectivity topology. - -### 3) *Create a unidirectional point-to-point cross-connection* - -A unidirectional point-to-point cross-connection can be created between: - -- a) one ochCTPsink and one ochCTPsource (straight through); in case of connection monitoring via och adapter; -- b) one ochCTPsink and one ochTTPsink (drop); -- c) one ochTTPsource and one ochCTPsource (add); -- d) one ochTTPsource and one ochTTPsink (for loop back test purposes). - -A cross-connection object is created and a report on this creation has to be sent to the OS. - -### 4) *Remove a unidirectional point-to-point cross-connection* - -This action disconnects the ochXTPs connected together. The cross-connection object is deleted and a report on this deletion has to be sent to the OS. - -### 5) *Suspend/resume traffic on a point-to-point cross-connection* - -This function provides the possibility to suspend and resume traffic on a point-to-point cross-connection to put it out of service (suspend) or to put it in service (resume). This change has to be reported to the OS. - -### 6) *Get all point-to-point cross-connections* - -This action returns the list of all point-to-point cross-connections created. - -## 8.7 DEG thresholds - -See clause 8.7 of [ITU-T G.7710] for a description of degraded (DEG) thresholds configuration. - -## 8.8 **ZZZ\_ Reported** - -ZZZ\_ Reported is not applicable to O.NEs. - -## 8.9 Alarm severity - -See clause 8.9 of [ITU-T G.7710] for a description of alarm severity configuration functions. - -## **8.10 Alarm reporting control** - -See clause 8.10 of [ITU-T G.7710] for a description of ARC configuration functions. - -## **8.11 Performance management thresholds** - -See clause 8.11 of [ITU-T G.7710] for a description of PM threshold configuration functions. - -## **8.12 Tandem connection monitoring activations** - -See clause 8.12 of [ITU-T G.7710] for a description of TCM activation configuration functions. - -## **8.13 Date and time** - -The date and time functions within the OTN EMF comprise the local real-time clock (RTC) function and the performance monitoring clock (PMC) function. The MCF within the OTN NEF shall be capable of setting the local RTC function. - -The date and time values are incremented by a free-running local clock, or by an external timing source. The fault, configuration, accounting, performance and security (FCAPS) management functions need date and time information, e.g., to time stamp event reports. They obtain this information from the date and time function. - -### **8.13.1 Date and time applications** - -Clause 8.13.1 of [ITU-T G.7710] identifies three date and time applications. These are: - -- time-stamping; -- PMC signals; -- activity scheduling. - -The OTN NEF functional requirements for these applications are specified in clauses 8.13.1.1 to 8.13.1.3. - -#### **8.13.1.1 Time stamping** - -See clause 8.13.1.1 of [ITU-T G.7710] for a description of the time-stamping application. - -#### **8.13.1.2 Performance monitoring clock signals** - -See clause 8.13.1.2 of [ITU-T G.7710] for a description of the PMC signals. - -#### **8.13.1.3 Activity scheduling** - -See clause 8.13.1.3 of [ITU-T G.7710] for a description of the activity scheduling. - -### **8.13.2 Date and time functions** - -See clause 8.13.2 of [ITU-T G.7710] for a description of the date and time application. - -#### **8.13.2.1 Local real-time clock function** - -The local RTC function is specified in clause 8.13.2.1 of [ITU-T G.7710]. - -#### **8.13.2.2 Local real-time clock alignment function with external time reference** - -The local RTC alignment function with an external time reference is specified in clause 8.13.2.2 of [ITU-T G.7710]. - -#### **8.13.2.3 Performance monitoring clock function** - -The PMC function is specified in clause 8.13.2.3 of [ITU-T G.7710]. - -## 8.14 Control function - -The ODUT\_TCMC function (i.e., ODUKT\_TCMC or ODUCnT\_TCMC functions) are responsible for the activation or deactivation of a TCM trail. An ODUT\_TCMC function is connected to the ODUT\_TT and ODUT/ODUK\_A functions at the TCM control points (TCMCPs) as shown in Figure 14-93 of [ITU-T G.798]. - -Currently only an ODUT\_TCMC function for manual activation or deactivation via the management is defined. ODUT\_TCMC functions for automatic activation are FFS. - -The MI signals listed in Table 8-4 are communicated from the EMF to the connection process through the MP. - -For the control functions supported by an O.NE, the O.NE EMF shall support the following management functions: - -- provisioning the control MI; -- retrieving the control MI; -- notifying the changes of the control MI. - -**Table 8-4 – Provisioning and reporting for control functions** - -| MI signal | Value range | Default value | -|------------------------------|-------------------------------------------------|----------------| -| ODUT_TCMCm Provisioning | | | -| ODUT_TCMCm_MI_Level | 1..6 | Not applicable | -| ODUT_TCMCm_MI_ModeSo | OPERATIONAL, MONITOR, TRANSPARENT | FFS | -| ODUT_TCMCm_MI_ModeSk | OPERATIONAL, MONITOR, TRANSPARENT | FFS | -| ODUT_TCMCm_MI_TCM_Extension | Normal, Pass-through, Erase | Normal | -| ODUT_TCMCm Reporting | | | -| ODUT_TCMCm_MI_AcSTATSo[1..6] | According to clause 15.8.2.2.5 of [ITU-T G.709] | Not applicable | -| ODUT_TCMCm_MI_AcSTATSk[1..6] | According to clause 15.8.2.2.5 of [ITU-T G.709] | Not applicable | - -## 8.15 Application identifier management - -This clause specifies management requirements for the OTN NE having OChs that support optical system standard applications (specified in ITU-T Recommendations, e.g., [ITU-T G.695], [ITU-T G.698.2] and [ITU-T G.959.1]) and proprietary applications. - -[ITU-T G.695], [ITU-T G.698.2] and [ITU-T G.959.1] provide optical parameter values of physical layer interfaces for the coarse wavelength division multiplexing (CWDM) system, dense wavelength division multiplexing (DWDM) system, and non-wavelength division multiplexing (non-WDM) system, respectively. The applications specified in these Recommendations are determined using optical interface parameters at the main path interface S (or MPI-S) reference point, at the R (or MPI-R) reference point, as well as for the optical link between the reference points. - -The specifications of the optical interface parameters in [ITU-T G.695], [ITU-T G.698.2] and [ITU-T G.959.1] are organized according to sets of application codes. The current edition of [ITU-T G.872] has generalized the application code to application identifier so that proprietary (i.e., non-standard) applications can be handled. - -For the OTN NE having OChs that support standards or proprietary applications, there is a need to provision or report on the supported set of application identifiers and to select a specific one from the set to ensure application identifier compatibility among the transmitter, receiver and link. - -Note that an application identifier does not specify the actual nominal central frequency or actual nominal central wavelength, though it does specify the range of the nominal central frequency or wavelength. In the cases of DWDM and CWDM, in addition to the application identifier, the nominal central frequency or nominal central wavelength needs also to be specified. - -[ITU-T G.872] has introduced some new terms to better describe the media aspects of optical networking. In particular, the media path that interconnects an OCh source (So) with an OCh Sk is called a network media channel. A black link is an instance of a network media channel. - -For the OCh TT in an OTN-compliant NE supporting standard or proprietary application identifiers, the OTN NE EMF shall support the following management functions: - -- provisioning the supportable application identifiers for the OCh TT; -- retrieving the supportable application identifiers from the OCh TT; -- notifying the changes of the supportable application identifiers of the OCh TT; -- selecting the application identifier to be used for the OCh TT; -- retrieving the selected application identifier from the OCh TT; -- notifying the changes of the selected application identifier of the OCh TT; -- if the selected application identifier defines a tributary to a DWDM system, provisioning the nominal central frequency of the OCh\_TT; -- if the selected application identifier defines a tributary to a DWDM system, retrieving the nominal central frequency of the OCh\_TT; -- if the selected application identifier defines a tributary to a DWDM system, notifying the changes in the nominal central frequency of the OCh\_TT; -- if the selected application identifier defines a tributary to a CWDM system, provisioning the nominal central wavelength of the OCh\_TT; -- if the selected application identifier defines a tributary to a CWDM system, retrieving the nominal central wavelength of the OCh\_TT; -- if the selected application identifier defines a tributary to a CWDM system, notifying the changes in the nominal central wavelength of the OCh\_TT. - -Valid ITU-T standard application identifiers are specified in ITU-T Recommendations, e.g., [ITU-T G.695], [ITU-T G.698.2] and [ITU-T G.959.1]. In the management interface, when an ITU-T standard application code is referred to, the values and value ranges of the optical parameters as specified in the corresponding ITU-T Recommendation for that application code are assumed. - -Note that an operable OCh trail is formed from an OCh\_TT So, a network media channel and an OCh\_TT Sk, all of which share a common application identifier. - -Note that OCh\_TT had been specified in [ITU-T G.798]. The specification of OCh\_TT was integrated into the optical tributary signal (OTSi) modulation and demodulator processes in the 2017 edition of [ITU-T G.798]. - -## 8.16 Media element management - -This clause specifies the management requirements for the media element, in particular the input provisioning information to and the output information from the media element, of which the equipment functionality is specified in clause 16 of [ITU-T G.798]. See Table 8-5. - -**Table 8-5 – Media element-related provisioning and reporting** - -| MI signal | Value range | Default value | -|-----------------------------------------------------------------------|-------------|---------------| -| Media element provisioning | | | -| ME_MI_configureMediaChannel(port j, port k, freqSlot, signalTransfer) | FFS | FFS | -| ME_MI_configureNOM(port j, freqSlot, threshold) | FFS | FFS | -| Media element reporting | | | -| ME_MI_queryMediaChannel(port j, port k, freqSlot, signalTransfer) | FFS | FFS | -| ME_MI_NOM(port j, freqSlot, value) | FFS | FFS | - -# 9 Account management - -Account management is FFS. - -# 10 Performance management - -See clause 10 of [ITU-T G.7710] for the generic requirements for PM. OTN-specific management requirements are described as follows. - -Note that, due to the frame synchronous mapping between an optical data unit of level k, path (ODUkP, k=0, 1, 2, 2e, 3, 4, flex) and an optical data unit of level k, tandem connection sub-layer, (ODUkT; k=0, 1, 2, 2e, 3, 4, flex) and between an ODUk and an OTUk, a frame slip that already exists at the source of the ODUkT or the OTUk trail is also detected at the Sk of the ODUkT and the OTUk trail. This frame slip will result in bit error detection at the TT Sk, even if the trail contains no errors. In order to suppress these bit errors, incoming alignment error (IAE) and backward incoming alignment error (BIAE) signalling is supported in the OTN. IAE is generated at the trail source if a frame slip is detected. It is transmitted to the trail Sk to suppress the bit errors. BIAE is the signalling for the reverse direction and is used to suppress the backward error indication. Due to the detection, propagation and signalling delay, no fixed time relation between the occurrence of bit errors and the detection of the IAE exists. Therefore, bit errors detected in the current or previous second are wrong and must be suppressed if an IAE is detected. - -The following rules apply: - -- if pBIAE is active, the F\_DS and the F\_EBC values of the previous and the current second must be discarded; -- if pIAE is active, the N\_DS, the F\_DS, the N\_EBC and the F\_EBC values for the previous and the current second must be discarded. - -Note that the previous second must be discarded due to the delay of the IAE information coming from the remote source. - -## 10.1 Performance management applications - -See clause 10.1 of [ITU-T G.7710] for the generic description for PM applications. - -### 10.1.1 Concepts of near-end and far-end - -See clause 10.1.1 of [ITU-T G.7710] for a description of near-end and far-end concepts. - -### **10.1.2 Maintenance** - -See clause 10.1.2 of [ITU-T G.7710] for a description of PM for maintenance. - -### **10.1.3 Bringing-into-service** - -See clause 10.1.3 of [ITU-T G.7710] for a description of bringing-into-service. - -### **10.1.4 Quality of service** - -See clause 10.1.4 of [ITU-T G.7710] for a description of quality of service. - -### **10.1.5 Availability** - -See clause 10.1.5 of [ITU-T G.7710] for a description of availability. - -### **10.1.6 Reporting** - -See clause 10.1.6 of [ITU-T G.7710] for a description of reporting. - -As soon as a threshold is reached or crossed in a 15 min/24 h period for a given performance measurement, a threshold report (TR) is generated. - -As an option for 15 min periods, an alternative method of threshold reporting can be used. When, for the first time, a threshold is reached or crossed for a given performance measurement, a TR is generated. No TRs will be generated in subsequent 15 min periods until the value of the performance measurement falls below a specific threshold. Then, a reset threshold report (RTR) is generated. - -Performance data shall be reportable across the NE/OS interface automatically upon reaching or crossing a performance-monitoring threshold. - -#### **10.1.6.1 Performance data collection** - -See clause 10.1.6.1 of [ITU-T G.7710] for the generic description of performance data collection. - -Counter-based performance data collection refers to the measurement counting associated with each of the performance measurements and any additional performance parameter specified in this Recommendation. - -Two types of performance data collection are possible. - -- A collection as specified in [ITU-T M.2120], i.e., based on information of each direction of transport independently. This type is also referred to as performance data collection for maintenance purposes. -- The collection as specified in [ITU-T G.826], i.e., based on information of both directions of transport together. This type is also referred to as performance data collection for error performance assessment purposes. - -Counts are taken over fixed time periods of 15 min and 24 h. Counting is stopped during unavailable time. - -Gauge-based performance data collection refers to the measurement gauge crossings associated with each of the performance measurements and any additional performance parameter specified in this Recommendation. - -Performance history data is necessary to assess the recent performance of transmission systems. Such information can be used to sectionalize faults and to locate the source of intermittent errors. - -Historical data, in the form of performance measurement, may be stored in registers in the NE or in mediation devices associated with the NE. For specific applications, e.g., when only quality of service alarms are used, historical data may not be stored. - -All the history registers shall be time-stamped. - -The history registers operate as follows. - -##### – 15 min registers - -The history of the 15 min monitoring is contained in a stack of 16 registers per monitored measurement. These registers are called the recent registers. - -Every 15 min, the contents of the current registers are moved to the first of the recent registers. When all 15 min registers are used, the oldest information will be discarded. - -##### – 24 h registers - -The history of the 24 h monitoring is contained in a single register per monitored measurement. This register is called the recent register. - -Every 24 h, the contents of the current register are moved to the recent register. - -#### **10.1.6.2 History storage suppression** - -See clause 10.1.6.2 of [ITU-T G.7710] for a description of history storage suppression. - -### **10.1.7 Thresholding** - -A thresholding mechanism can be used to generate an autonomous measurement report when the performance of a transport entity falls below a predetermined level. The general strategy for the use of thresholds is described in [ITU-T M.20]. Specific information for optical networks is FFS. The thresholding mechanism is applicable only for the maintenance-based collection. - -See clause 10.1.7 of [ITU-T G.7710] for a description of thresholding. - -#### **10.1.7.1 Threshold setting** - -The thresholds may be set in the NE via the OS. The OS shall be able to retrieve and change the settings of the 15 min and 24 h thresholds. - -The threshold values for measurements evaluated over the 15 min period should be programmable within the specified range. - -#### **10.1.7.2 Threshold reporting** - -As soon as a threshold is reached or crossed in a 15 min/24 h period for a given performance measurement, a TR is generated. - -As an option for 15 min periods, an alternative method of threshold reporting can be used. When, for the first time, a threshold is reached or crossed for a given performance measurement, a TR is generated. No TRs will be generated in subsequent 15 min periods until the value of the performance measurement falls below a specific threshold. Then, an RTR is generated. - -The detailed functioning of the threshold mechanisms is FFS. - -Performance data shall be reportable across the NE/OS interface automatically upon reaching or crossing a performance-monitoring threshold. - -#### **10.1.7.3 Evaluation for counters** - -See clause 10.1.7.3 of [ITU-T G.7710] for a generic description. - -#### **10.1.7.4 Evaluation for gauges** - -See clause 10.1.7.4 of [ITU-T G.7710] for a generic description. - -### **10.1.8 Delay measurement requirements** - -- 1) OTN delay measurement is defined as a "round trip" measurement; i.e., it can only be used in bidirectional connections. - -- 2) The toggling of the DMValue has to be synchronized between the source and Sk atomic functions. -- 3) DM\_Source in the So and Sk atomic functions always has the same value. -- 4) DM\_Source should be set to false in all involved atomic functions when no delay measurement is required. -- 5) On-demand delay measurement must be supported. -- 6) Proactive delay measurement is FFS. - -## 10.2 Performance management functions - -See clause 10.2 of [ITU-T G.7710] for generic requirements of PM functions. - -OTN NE provides the PM MI in Table 10-1. - -**Table 10-1 – Performance management information** - -| Performance management information | OTN function | PM current data and history data collected in EMF | -|------------------------------------------------------------------------------------------------------|----------------------------------------------------------------------------|-------------------------------------------------------------------------------------------------------------------------------------------| -| OTS-O_TT_Sk_MI_pN_DS-P
OTS-O_TT_Sk_MI_pN_DS-O
OTS-O_TT_Sk_MI_pF_DS-P
OTS-O_TT_Sk_MI_pF_DS-O | OT-On_TT_Sk | OTS-O_TTP_Sk:
nSES, fSES,
{UAS nUAS,
fUAS}(Note 1) | -| OMS-O_TT_Sk_MI_pN_DS-P
OMS-O_TT_Sk_MI_pN_DS-O
OMS-O_TT_Sk_MI_pF_DS-P
OMS-O_TT_Sk_MI_pF_DS-O | OMS-O_TT_Sk | OMS-n_TTP_Sk:
nSES, fSES,
{UAS nUAS, fUAS} | -| OTSi/OTUk_A_Sk_MI_pFECcorrErr (Note 2) | OTSi/OTUk-a_A_Sk
See Table 16-1 of [ITU-T G.798] for the function types | OTU_CTP_Sk:
CD/HD: #FECcorrErr
OTSi_TTP_Sk:
CD/HD: #FECcorrErr
where #FECcorrErr =
count of FEC-corrected
Errors | -| OTSi/OTUkV_A_Sk_MI_pFECcorrErr (Note 2) | OTSi/OTUkV_A_Sk | | -| OTSiG/OTUkV_A_Sk_MI_pFECcorrErr (Note 2) | OTSiG/OTUkV_A_Sk | | -| OTSi/FlexO-1-SC_A_Sk_MI_pFECcorrErr | OTSi/FlexO-1-SC_A_Sk | | -| OTSiG/OTUk_A_Sk_MI_pFECcorrErr | OTSiG/OTUk_A_Sk
See Table 16-6 of [ITU-T G.798] for the function types | OTSiG_TTP_Sk:
CD/HD: #FECcorrErr
where #FECcorrErr =
count of FEC-corrected
Errors | -| OTSiG/OTUCn_A_Sk_MI_pFECcorrErr | OTSiG/OTUCn_A_Sk | | -| OTSiG/FlexO_A_Sk_MI_pFECcorrErr | OTSiG/FlexO_A_Sk | | -| OTSi/OSC_A_MI_pN_DS-O | OTSi/OSC_A_Sk | OTSi/OSC_A_Sk:
nSES, fSES,
{UAS nUAS, fUAS}
(Note 1)
pN_DS-O is missing this
primitive in Table 16-18 of
[ITU-T G.798]. | - -**Table 10-1 – Performance management information** - -| Performance management information | OTN function | PM current data and history data collected in EMF | -|-----------------------------------------------------------------------------------------------------------------------------------------------------------------|--------------------------------------------------------------------------------------------------------|---------------------------------------------------------------------------------------------------------------------------------------------------| -| OTU_TT_Sk_MI_pN_EBC
OTU_TT_Sk_MI_pN_DS
OTU_TT_Sk_MI_pF_EBC
OTU_TT_Sk_MI_pF_DS
OTU_TT_Sk_MI_pBIAE
OTU_TT_Sk_MI_pIAE | OTU_TT_Sk | OTU_TTP_Sk:
nSES, fSES,
{UAS nUAS, fUAS},
nBBE, fBBE,
(Note 4) | -| OTUkV_TT_Sk_MI_pN_EBC
OTUkV_TT_Sk_MI_pN_DS
OTUkV_TT_Sk_MI_pF_EBC
OTUkV_TT_Sk_MI_pF_DS
OTUkV_TT_Sk_MI_pBIAE (Note 3)
OTUkV_TT_Sk_MI_pIAE (Note 3) | OTUkV_TT_Sk | | -| OTSiG-O_TT_Sk_MI_pN_DS-P
OTSiG-O_TT_Sk_MI_pN_DS-O
OTSiG-O_TT_Sk_MI_pF_DS-P
OTSiG-O_TT_Sk_MI_pF_DS-O | OTSiG-O_TT_Sk | OTSiG-O_TTP_Sk:
nSES, fSES,
{UAS nUAS, fUAS},
nBBE, fBBE, | -| ODUP_TT_Sk_MI_pN_EBC
ODUP_TT_Sk_MI_pN_DS
ODUP_TT_Sk_MI_pF_EBC
ODUP_TT_Sk_MI_pF_DS
ODUP_TT_Sk_MI_pN_delay | ODUP_TT_Sk | ODUkP_TTP_Sk:
nSES, fSES,
{UAS nUAS, fUAS},
nBBE, fBBE,
Proactive DM is FFS.
See clause 14.2.1 of
[ITU-T G.798] for
pN_Delay | -| ODUkP/PRBS_A_Sk_MI_pN_TSE | ODUkP/PRBS_A_Sk | PRBS or generic client
layer CTP_Sk:
Sum of pN_TSE | -| ODUkP/CBRx-g_A_So_MI_pN_PCS_BIP
(Note 5) | ODUkP/CBRx-g_A_So
For the value of k and x
in ODUkP/CBRx, see
Table 14-18 of [ITU-T
G.798] | generic client layer
CTP_So:
Sum of pN_PCS_BIP | -| ODUkP/CBRx-g_A_Sk_MI_pN_PCS_BIP
(Note 5) | ODUkP/CBRx-g_A_Sk
For the value of k and x
in ODUkP/CBRx, see
Table 14-18 of [ITU-T
G.798] | generic client layer
CTP_Sk:
Sum of pN_PCS_BIP | -| ODUkP/ETH_A_Sk_MI_pFCSErrors | ODUkP/ETH_A_Sk | ETH or generic client
layer CTP_Sk:
Sum of pFCSErrors | -| ODUkP-h/ETH_A_Sk_MI_pFCSErrors | ODUkP-h/ETH_A_Sk | ETH or generic client
layer CTP_Sk:
Sum of pFCSErrors | - -**Table 10-1 – Performance management information** - -| Performance management information | OTN function | PM current data and history data collected in EMF | | -|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------|--| -| ODUT_TT_Sk_MI_pN_EBC
ODUT_TT_Sk_MI_pN_DS
ODUT_TT_Sk_MI_pF_EBC
ODUT_TT_Sk_MI_pF_DS
ODUT_TT_Sk_MI_pN_delay
ODUT_TT_Sk_MI_pBIAE
ODUT_TT_Sk_MI_pIAE | ODUT_TT_Sk
See clause 14.5.1.1.2 of [ITU-T G.798] | ODUK_TTP_Sk:
nSES, fSES,
{UAS nUAS, fUAS},
nBBE, fBBE,
Proactive DM is FFS.
See clause 14.2.1 of [ITU-T G.798] for
pN_Delay
(Note 4) | | -| ODUTm_TT_Sk_MI_pN_EBC
ODUTm_TT_Sk_MI_pN_DS
ODUTm_TT_Sk_MI_pF_EBC
ODUTm_TT_Sk_MI_pF_DS
ODUTm_TT_Sk_MI_pBIAE
ODUTm_TT_Sk_MI_pIAE | ODUTm_TT_Sk
See clause 14.5.1.1.3 of [ITU-T G.798] | ODUkTm_TTP_Sk:
nSES, fSES,
{UAS nUAS, fUAS},
nBBE, fBBE,
(Note 4) | | -| OSx_TT_Sk_MI_pN_DS | OSx_TT_Sk | OSx_TTP_Sk:
nSES, nUAS | | -| OSx/CBRx-b_A_Sk_MI_pFECcorrErr | OSx/CBRx-b_A_Sk | OSx/CBRx_Sk:
CD/HD: #FECcorrErr
where #FECcorrErr =
count of FEC-corrected
Errors | | -| OSx/CBRx-c_A_Sk_MI_FECcorrErr | OSx/CBRx-c_A_Sk | | | -| OSx/CBRx-b_A_Sk_MI_pFECuncorrErr | OSx/CBRx-b_A_Sk | OSx/CBRx_Sk:
CD/HD: #FECuncorrErr
where #FECuncorrErr =
FEC-uncorrected Errors | | -| OSx/CBRx-c_A_Sk_MI_pFECuncorrErr | OSx/CBRx-c_A_Sk | | | -| NOTE 1 – {UAS nUAS, fUAS} means bidirectional UAS or Unidirectional "nUAS and fUAS". | | | | -| NOTE 2 – If the function performs forward error correction (FEC). | | | | -| NOTE 3 – In case of frame-synchronous mapping of ODUk client signal. | | | | -| NOTE 4 – pIAE and pBIAE are used for the suppression of the PM data in the EMFs. If pBIAE is active, the F_DS and F_EBC values of the previous and current second have to be discarded (errored block count (EBC) = 0 and defect second (DS) = false). If pIAE is active, the N/F_DS and N/F_EBC and N_delay values of the previous and current second have to be discarded (EBC = 0 and DS = false). The previous second has to be included due to the delay of the IAE information coming from the remote source. | | | | -| NOTE 5 – Applicable only when (k=3, CBRx=ETC40GR) or (k=4, CBRx=ETC100GR). | | | | - -The EMF shall support the following functions: - -- collecting OTN layer-specific current PM data as specified in Table 10-1; -- collecting OTN layer-specific history PM data as specified in Table 10-1; -- resetting of the OTN layer-specific current PM data registers; -- reporting OTN layer-specific current PM data at the maturity of the monitoring time interval; -- on-demand retrieval of the collected OTN layer-specific PM data; -- setting of the threshold of the monitored OTN layer-specific PM data collection; - -- reporting of threshold crossing for the collected OTN layer-specific current PM data; -- notifying the change of the threshold of the monitored OTN layer-specific PM data collection. - -# **11 Security management** - -FFS. - -# Appendix I - -## Management information for configuration management - -(This appendix does not form an integral part of this Recommendation.) - -Regarding CM, the OTN NEs can be configured via the following MI signals that are specified per atomic function in [ITU-T G.798]: - -- \_MI\_AutoMS -- \_MI\_AdminState -- \_MI\_APRCtrl -- \_MI\_APSChannel -- \_MI\_CellDiscardActive -- \_MI\_DTDLuseEnabled -- \_MI\_ExtCMD -- \_MI\_ExDAPI -- \_MI\_ExMSI -- \_MI\_ExSAPI -- \_MI\_FECEn -- \_MI\_GCCAccess -- \_MI\_GCCCont -- \_MI\_GetAcTI -- \_MI\_GFCActive -- \_MI\_HECActive -- \_MI\_HoTime -- \_MI\_Level -- \_MI\_MatrixControl -- \_MI\_ModeSk -- \_MI\_ModeSo -- \_MI\_OperType -- \_MI\_ProtType -- \_MI\_SDEnable -- \_MI\_TIMActDis -- \_MI\_TIMDetMo -- \_MI\_TPusgActive -- \_MI\_TSF-ODis -- \_MI\_TxMSI -- \_MI\_TxTI -- \_MI\_VPIrange -- \_MI\_VPI-KActive -- \_MI\_VPIK\_SAISActive -- \_MI\_WTR - -Regarding CM, the OTN NEs can provide the configuration data via the following MI signals that are specified per atomic function in [ITU-T G.798]: - -- \_MI\_AcMSI -- \_MI\_AcPT -- \_MI\_AcPT[1..XMR] -- \_MI\_AcTI -- \_MI\_AcSTATSk[1..6] -- \_MI\_AcSTATSo[1..6] -- \_MI\_AcVcPT - -# Appendix II - -## Management information for performance management - -(This appendix does not form an integral part of this Recommendation.) - -Regarding PM, the OTN NEs can be configured via the following MI signals that are specified per atomic function in [ITU-T G.798]: - -- \_MI\_1second -- \_MI\_DEGM -- \_MI\_DEGThr - -Regarding PM, the OTN NEs can provide the performance data via the following MI signals that are specified per atomic function in [ITU-T G.798]: - -- \_MI\_pBIAE -- \_MI\_pF\_DS-O -- \_MI\_pF\_DS-P -- \_MI\_pFECcorrErr -- \_MI\_pF\_EBC -- \_MI\_pF\_DS -- \_MI\_pIAE -- \_MI\_pN\_DS-O -- \_MI\_pN\_DS-P -- \_MI\_pN\_EBC -- \_MI\_pN\_DS -- \_MI\_pN\_delay -- \_MI\_pN\_TSE -- \_MI\_pN\_PCS\_BIP - -# Appendix III - -## Mapping between OPuk payload type and adaptation atomic function - -(This appendix does not form an integral part of this Recommendation.) - -Table III.1 maps the OPuk PTs specified in Table 15-9 of [ITU-T G.709] to the corresponding adaptation atomic functions. - -**Table III.1 – Payload type and atomic functions** - -| Payload types
Table 15-9 of [ITU-T G.709]
(clause numbers in this column are those of [ITU-T G.709]) | | Atomic functions
[ITU-T G.798] | | | -|--------------------------------------------------------------------------------------------------------------------------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|----------------------------------------------------------------------------------------------------------------------------------------------------------------------|---------------------|--| -| PT in Hex code | Interpretation | Adaptation atomic function | | | -| 01 | Experimental mapping | – | | | -| 02 | Asynchronous CBR mapping, see clause 17.2 | ODUkP/
CBRx-a_A_so | ODUkP/
CBRx_A_Sk | | -| 03 | Bit synchronous CBR mapping, see clause 17.2 | ODUkP/
CBRx-b_A_So | | | -| 04 | Not available | None | | | -| 05 | GFP mapping, see clause 17.4 | ODUkP/ETH_A
ODUkP-X-L/ETH_A;
k = 1, 2, 3
NOTE – Since GFP is not an adaptation, i.e., only a mapping, the adaptation function depends on the client signal. | | | -| 06 | Not available | None | | | -| 07 | Physical coding sublayer (PCS) codeword transparent Ethernet mapping:
1000BASE-X into OPU0 mapping, see clauses 17.7.1 and 17.7.1.1
40GBASE-R into OPU3, see clauses 17.7.4 and 17.7.4.1
100GBASE-R into OPU4, see clauses 17.7.5 and 17.7.5.1 | ODU0P/CBRx_A
(0≤x≤1.25G) | | | -| 08 | FC-1200 into OPU2e mapping, see clause 17.8.2 | ODUkP/CBRx-g_A | | | -| 09 | GFP mapping into Extended OPU2 payload, see clause 17.4.1 | ODU2P/EthPP-OS_A | | | -| 0A | STM-1 mapping into ODU0, see clause 17.7.1 | ODUkP/RSn_A | | | -| 0B | STM-4 mapping into ODU0, see clause 17.7.1 | | | | -| 0C | FC-100 mapping into ODU0, see clause 17.7.1 | ODUkP/CBRx-g_A | | | -| 0D | FC-200 mapping into ODU1, see clause 17.7.2 | | | | -| 0E | FC-400 mapping into ODUFlex, see clause 17.9 | | | | -| 0F | FC-800 mapping into ODUFlex, see clause 17.9 | | | | -| 10 | Bit stream with octet timing mapping, see clause 17.6.1 | | | | - -| Payload types
Table 15-9 of [ITU-T G.709]
(clause numbers in this column are those of [ITU-T G.709]) | | Atomic functions
[ITU-T G.798] | -|--------------------------------------------------------------------------------------------------------------------------|-----------------------------------------------------------------------------------------------------------------|-------------------------------------------------| -| PT in Hex code | Interpretation | Adaptation atomic function | -| 11 | Bit stream without octet timing mapping, see clause 17.6.2 | | -| 12 | IB SDR mapping into OPUflex, see clause 17.9 | | -| 13 | IB DDR mapping into OPUflex, see clause 17.9 | | -| 14 | IB QDR mapping into OPUflex, see clause 17.9 | | -| 15 | SDI mapping into OPU0, see clause 17.7.1 | | -| 16 | (1.485/1.001) Gbit/s SDI mapping into OPU1, see clause 17.7.2 | | -| 17 | 1.485 Gbit/s SDI mapping into OPU1, see clause 17.7.2 | | -| 18 | (2.970/1.001) Gbit/s SDI mapping into OPUflex, see clause 17.9 | | -| 19 | 2.970 Gbit/s SDI mapping into OPUflex, see clause 17.9 | | -| 1A | SBCON/ESCON mapping into OPU0, see clause 17.7.1 | | -| 1B | DVB_ASI mapping into OPU0, see clause 17.7.1 | | -| 1C | FC-1600 mapping into OPUflex, see clause 17.9 | | -| 1D | FlexE Client mapping into OPUflex, see clause 17.11 | OPUflexP/FlexEC | -| 1E | FlexE aware (partial rate) mapping into OPUflex, see clause 17.12 | OPUflexP/FlexESG | -| 1F | FC-3200 mapping into OPUflex, see clause 17.9 | ODUkP/CBRx-g_A | -| 20 | ODU multiplex structure supporting optical data tributary unit j into k (ODTUjk) only, see clause 19 (AMP only) | ODUkP/ODU[i]j_A | -| 21 | ODU multiplex structure supporting ODTUk.ts or ODTUk.ts and ODTUjk, see clause 19 (GMP capable) | ODUkP/ODUj-21_A | -| 22 | ODU multiplex structure supporting ODTUCn.ts, see clause 20 (GMP capable) | ODUCnP/ODUk | -| 30 | 25GBASE-R mapping into OPUflex, see clause 17.13 | OPUflexP/xGBASE-R | -| 31 | 200GBASE-R mapping into OPUflex, see clause 17.13 | | -| 32 | 400GBASE-R mapping into OPUflex, see clause 17.13 | | -| 33 | 50GBASE-R mapping into OPUflex, see clause 17.13 | | -| 55 | Not available | None | -| 66 | Not available | None | -| 80-8F | Reserved codes for proprietary use | None | -| FD | NULL test signal mapping, see clause 17.5.1 | ODUkP/NULL_A | -| FE | PRBS test signal mapping, see clause 17.5.2 | ODkP/PRBS_A | -| FF | Not available | None | - -NOTE – The PT does not have a unique value for every adaptation function. Multiple adaptation functions share the same PT value. An overview is presented as follows. - -- 14.3.1/G.798 ODUkP/CBRx\_A, bit sync: = <1,2G5>, <2,10G>, <2e,10G3>, <3,40G>, , async: <1,2G5> (20 ppm), <1,2G5> (32 ppm), <2,10G>, <3,40G>; no need to manage 2G5 ppm differences -PT of these adaptation functions; -PT=0x02 for async mapping of CBR2G5, CBR10G, CBR40G -PT=0x03 for bitsync mapping of CBR2G5, CBR10G, CBR10G3, CBR40G -PT=0x0E for bitsync mapping of FC400 -PT=0x0F for bitsync mapping of FC800 -PT=0x12 for bitsync mapping of IB QDR -PT=0x13 for bitsync mapping of IB QDR -PT=0x14 for bitsync mapping of IB QDR -PT=0x18 for bitsync mapping of (2.970/1.001)G SDI -PT=0x19 for bitsync mapping of 2.970G SDI -PT=0x1C for bitsync mapping of FC1600 -- 14.3.3/G.798 ODU2P/EthPP\_OS\_A => 11.5.3/G.8021 ODU2P/EthOS\_A -PT=0x05 -- 14.3.4/G.798 ODUkP/NULL\_A -PT=0xFD. -Additional control here is for ODUk, k=flex the nominal bit rate. -- 14.3.5/G.798 ODUkP/PRBS\_A -PT=0xFE. -Additional control here is for ODUk, k=flex the nominal bit rate. -- 14.3.6/G.798 ODUkP/RSn\_A, = <1,16>, <2,64>, <3,256> -PT=0x02 for async mapping of RS16, RS64, RS256, -PT=0x03 for bitsync mapping of RS16, RS64, RS256.14.3.7 ODU0P/CBRx\_A, x = 155M, 622M, ETC3, FC100, SBCON, DVB\_ASI -PT=0x0A for STM-1 (155M) mapping into OPU0 -PT=0x0B for STM-4 (622M) mapping into OPU0 -PT=0x0C for FC100 -PT=0x07 for 1000BASE-X (ETC3) -PT=0x1A for SBCON/ESCON -PT=0x1B for DVB\_ASI -Table III.2 maps PT values of SDHs to ODUs. - -**Table III.2 – PT of SDH to ODU mapping** - -| ODUk | SDH | PT | | | -|------|-------------|------|------|------| -| | | BMP | AMP | GMP | -| ODU0 | STM-1(155M) | – | – | 0x0A | -| ODU0 | STM-4(622M) | – | – | 0x0B | -| ODU1 | STM – 4 | 0x03 | 0x02 | – | -| ODU2 | STM - 16 | 0x03 | 0x02 | – | -| ODU3 | STM – 64 | 0x03 | 0x02 | – | - -- 14.3.8/G.798 ODUkP/CBRx-g\_A, CBRx-g = ETC5, ETC6, FC200 - PT=0x07 for 40GBASE-R (ETC5) - PT=0x07 for 100GBASE-R (ETC6) - PT=0x0D for FC200 -- 14.3.9/G.798 ODUkP/ODU[i]j\_A - PT=0x20. - Additional control here is on a per LO optical data unit of level j (ODUj) basis, which can be performed as part of LO ODU connection management: - MI\_TxMSI, MI\_ExMSI[p], MI\_AdminState[p], MI\_APS\_EN[p], MI\_APS\_LVL [p] -- 14.3.10/G.798 ODUkP/ODUj-21\_A - PT=0x21 - Additional control here is MI\_AUTOpayloadtype. - Further additional control is on a per LO ODUj basis, which can be performed as part of LO ODU connection management: - MI\_TxMSI, MI\_ExMSI[p], MI\_ODUType\_Rate[i], MI\_AdminState[n], MI\_APS\_EN [n], MI\_APS\_LVL [n] -- 14.3.11/G.798 ODUkP/ETH\_A, see 11.5.1/G.8021 ODUkP/ETH\_A - PT=0x06. - vcPT=0x05. - Additional control here is MI\_CSFEnable and MI\_CSFrdifdiEnable, MI\_FilterConfig, MI\_CSF\_Reported, MI\_MAC\_Length. -- 14.3.12/G.798 ODUkP-h/ETH\_A, k=flex - PT=0x05. The same PT value is used for this hitless adjustment of ODUflex(GFP) (HAO) capable function as for the regular, non-HAO capable function. - Additional control here is MI\_ODUflexRate, MI\_CSFEnable, MI\_CSFrdifdiEnable, MI\_FilterConfig, MI\_CSF\_Reported, MI\_MAC\_Length. - Further additional control here is for HAO; i.e., MI\_INCREASE, MI\_DECREASE, MI\_TSNUM. -- 14.3.13/G.798 ODUkP-h/ODUj-21\_A - PT=0x21. The same PT value is used for this HAO capable function as for the regular, non-HAO capable function. - Additional control here is MI\_AUTOpayloadtype. - -Further additional control is on a per LO ODUj basis, which can be performed as part of LO ODU connection management: - -MI\_TxMSI[p], MI\_ExMSI[p], MI\_ODUType\_Rate[i], MI\_AdminState[n], MI\_APS\_EN[n], MI\_APS\_LVL[n] - -Further additional control here is for HAO of a LO ODUflex; i.e., MI\_INCREASE, MI\_DECREASE, MI\_TSMAP, MI\_TPID. - -- [14.3.v/G.798 ODU2eP/FC1200\_A] to be added - -PT=0x08. - -- [14.3.x/G.798 ODUkP/MT\_A] see 11.2.1/G.8121 ODUkP/MT\_A - -PT=0x05. This PT value is the same as for ODUkP/ETH\_A functions. - -Additional control here is MI\_SCCType. - -Further additional control is on a per PW/LSP basis, which can be performed as part of LO ODU connection management: - -MI\_Label[1...M], MI\_LSPTYPE[1...M], MI\_CoS[1...M], MI\_PHB2TCMapping[1...M], MI\_QoSEncodingMode[1...M], MI\_TC2PHBMapping[1...M], MI\_QoSDecodingMode[1...M], MI\_LCK\_Period[1...M], MI\_LCK\_CoS[1...M], MI\_Admin\_State, MI\_AIS\_Period[1...M], MI\_AIS\_CoS[1...M], MI\_GAL\_Enable[1...M] - -- [14.3.z/G.798 ODUkP-h/MT\_A] to be added to e.g., 11.2.3/G.8121 or 14.3.z/G.798 - -Not specified yet. - -- [17.13/G.709] Mapping a 64b/66b PCS coded signal into OPUflex using BMP and 2-bit alignment of 66b code words - -PT=0x30, 25GBASE-R mapping into OPUflex - -PT=0x31, 200GBASE-R mapping into OPUflex - -PT=0x32, 400GBASE-R mapping into OPUflex - -PT=0x33, 50GBASE-R mapping into OPUflex - -- [17.11/G.709] OPUflexP/FlexE - -*Mapping of FlexE Client signals into OPUflex using IMP* - -*FlexE Client signal bit rates are $s \times 5,156,250.000$ kbit/s $\pm 100$ ppm, with $s = 2, 8, n*5$ ( $n \geq 1$ ).* - -*Refer to [OIF FlexE IA].* - - - - - - - -# SERIES OF ITU-T RECOMMENDATIONS - -| | | -|-----------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------| -| Series A | Organization of the work of ITU-T | -| Series D | Tariff and accounting principles and international telecommunication/ICT economic and policy issues | -| Series E | Overall network operation, telephone service, service operation and human factors | -| Series F | Non-telephone telecommunication services | -| Series G | Transmission systems and media, digital systems and networks | -| Series H | Audiovisual and multimedia systems | -| Series I | Integrated services digital network | -| Series J | Cable networks and transmission of television, sound programme and other multimedia signals | -| Series K | Protection against interference | -| Series L | Environment and ICTs, climate change, e-waste, energy efficiency; construction, installation and protection of cables and other elements of outside plant | -| Series M | Telecommunication management, including TMN and network maintenance | -| Series N | Maintenance: international sound programme and television transmission circuits | -| Series O | Specifications of measuring equipment | -| Series P | Telephone transmission quality, telephone installations, local line networks | -| Series Q | Switching and signalling, and associated measurements and tests | -| Series R | Telegraph transmission | -| Series S | Telegraph services terminal equipment | -| Series T | Terminals for telematic services | -| Series U | Telegraph switching | -| Series V | Data communication over the telephone network | -| Series X | Data networks, open system communications and security | -| Series Y | Global information infrastructure, Internet protocol aspects, next-generation networks, Internet of Things and smart cities | -| Series Z | Languages and general software aspects for telecommunication systems | \ No newline at end of file diff --git a/marked/M/T-REC-M.3020-202304-I_PDF-E/0538daaa5583c23e17db3a12f2281a55_img.jpg b/marked/M/T-REC-M.3020-202304-I_PDF-E/0538daaa5583c23e17db3a12f2281a55_img.jpg deleted file mode 100644 index ac295b1b0c7f14b1c5a33ef6682b1b017c812477..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3020-202304-I_PDF-E/0538daaa5583c23e17db3a12f2281a55_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:37aed4fc114a39843438175326e0b7e1d09a9d6075723d82fea32040fd560ee4 -size 7192 diff --git a/marked/M/T-REC-M.3020-202304-I_PDF-E/0a06de972d61ab9bb901bd74dd4ff51f_img.jpg b/marked/M/T-REC-M.3020-202304-I_PDF-E/0a06de972d61ab9bb901bd74dd4ff51f_img.jpg deleted file mode 100644 index 45cb627fe8d1ebed57a6f0bc11b0f81c9a03cd42..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3020-202304-I_PDF-E/0a06de972d61ab9bb901bd74dd4ff51f_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:0c6c7b9773977e35d83484ec0f27d4555845263da03fcb66d28bbc6680e3c7e3 -size 8850 diff --git a/marked/M/T-REC-M.3020-202304-I_PDF-E/0a73b03fba21af142d619a9a662e6490_img.jpg b/marked/M/T-REC-M.3020-202304-I_PDF-E/0a73b03fba21af142d619a9a662e6490_img.jpg deleted file mode 100644 index 91e4549cd76a86249adcb59b12d5bc6439ce2884..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3020-202304-I_PDF-E/0a73b03fba21af142d619a9a662e6490_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:fb3b38143c19f659e9b0dd9eaa28274150551702bff6ef0cb2c4a3d131101c5a -size 27237 diff --git a/marked/M/T-REC-M.3020-202304-I_PDF-E/15de63f0b5df62e6ab9164f2a72e2e33_img.jpg b/marked/M/T-REC-M.3020-202304-I_PDF-E/15de63f0b5df62e6ab9164f2a72e2e33_img.jpg deleted file mode 100644 index f2efb984206e1606d708d36597bb38fec5a4e59c..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3020-202304-I_PDF-E/15de63f0b5df62e6ab9164f2a72e2e33_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:c699cd03ab5f723207cf09cfc71b1159f533e2b3f11dcb882542995508da987b -size 96182 diff --git a/marked/M/T-REC-M.3020-202304-I_PDF-E/1b23b78336d8bd286c653cbdb38428dd_img.jpg b/marked/M/T-REC-M.3020-202304-I_PDF-E/1b23b78336d8bd286c653cbdb38428dd_img.jpg deleted file mode 100644 index 5a1415f756aa6726694553527c878ae0ee24cc02..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3020-202304-I_PDF-E/1b23b78336d8bd286c653cbdb38428dd_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:872876d8970f3365964a313f1d371f9cd13d257a51f3e7b1c8ed8cfd2f94c12b -size 3897 diff --git a/marked/M/T-REC-M.3020-202304-I_PDF-E/2beb95006f1933bed737cfe1e6598db8_img.jpg b/marked/M/T-REC-M.3020-202304-I_PDF-E/2beb95006f1933bed737cfe1e6598db8_img.jpg deleted file mode 100644 index 161e4a3f498020f5544731cf8ea58dea5a4c10e6..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3020-202304-I_PDF-E/2beb95006f1933bed737cfe1e6598db8_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:742b3e99d4eb505917012420aab2956f22dc6d08b362d667c7f69afd3d4059d5 -size 13615 diff --git a/marked/M/T-REC-M.3020-202304-I_PDF-E/3493d7ba4c86f944e159de1bf45ff03d_img.jpg b/marked/M/T-REC-M.3020-202304-I_PDF-E/3493d7ba4c86f944e159de1bf45ff03d_img.jpg deleted file mode 100644 index f5c8a52a3737496668e437bf52696605ad7fd4c3..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3020-202304-I_PDF-E/3493d7ba4c86f944e159de1bf45ff03d_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:e7bcf0703919f6984f594c78539893473bae3d9f0540e8fc4b4f8d4c8b9a6c8d -size 10517 diff --git a/marked/M/T-REC-M.3020-202304-I_PDF-E/3e2dcee303cecdd31b7f9ec0d8942fed_img.jpg b/marked/M/T-REC-M.3020-202304-I_PDF-E/3e2dcee303cecdd31b7f9ec0d8942fed_img.jpg deleted file mode 100644 index bf0d7ca6189d205ca01daef8639140ef7b1c87cc..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3020-202304-I_PDF-E/3e2dcee303cecdd31b7f9ec0d8942fed_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:2e1eaf808c93b1496333badb7cc4138a80ee85418aa5811286c61ba39c5f94ef -size 20765 diff --git a/marked/M/T-REC-M.3020-202304-I_PDF-E/40a8c30f7ea5ecea4912e040c97c5b9c_img.jpg b/marked/M/T-REC-M.3020-202304-I_PDF-E/40a8c30f7ea5ecea4912e040c97c5b9c_img.jpg deleted file mode 100644 index 5f3459dc0fd3478ba65065138445f3f0e5fc8c5b..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3020-202304-I_PDF-E/40a8c30f7ea5ecea4912e040c97c5b9c_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:dcb6fcb881242585406bc66cd35c890bda3d379462e9208ed09bfddab96800b5 -size 11306 diff --git a/marked/M/T-REC-M.3020-202304-I_PDF-E/4162c218fc7881cd90fc9574e07d2327_img.jpg b/marked/M/T-REC-M.3020-202304-I_PDF-E/4162c218fc7881cd90fc9574e07d2327_img.jpg deleted file mode 100644 index 0555c9c808b716a4224b58ecc054176bdd60c26a..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3020-202304-I_PDF-E/4162c218fc7881cd90fc9574e07d2327_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:9abdb571b7b2b6250d7233cc01b675d81fb4a2839d7a714dadcd639fd852addb -size 10636 diff --git a/marked/M/T-REC-M.3020-202304-I_PDF-E/4bfb457b83429c217736e6d51b2f3945_img.jpg b/marked/M/T-REC-M.3020-202304-I_PDF-E/4bfb457b83429c217736e6d51b2f3945_img.jpg deleted file mode 100644 index cbe9febac4063db33a6ebc343cbb10e239321cc1..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3020-202304-I_PDF-E/4bfb457b83429c217736e6d51b2f3945_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:f7d44093af1ccbb94fff816d410d02fef4c6906e798360777e281ed8ba5885b6 -size 35419 diff --git a/marked/M/T-REC-M.3020-202304-I_PDF-E/4e85fe330de2c4f5eea6de4b2a53c77f_img.jpg b/marked/M/T-REC-M.3020-202304-I_PDF-E/4e85fe330de2c4f5eea6de4b2a53c77f_img.jpg deleted file mode 100644 index 88268eefc2ce9d28b16c74246d782a4d1337345d..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3020-202304-I_PDF-E/4e85fe330de2c4f5eea6de4b2a53c77f_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:1bffe53ab883006191cd60c6c5ce0f22c622854eb7200a434e47cbdb94acd793 -size 8028 diff --git a/marked/M/T-REC-M.3020-202304-I_PDF-E/4f6da7645cec40b72385c93b2f4dc4be_img.jpg b/marked/M/T-REC-M.3020-202304-I_PDF-E/4f6da7645cec40b72385c93b2f4dc4be_img.jpg deleted file mode 100644 index 0379237bbef9531a9543e5e10a8caddef6721b64..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3020-202304-I_PDF-E/4f6da7645cec40b72385c93b2f4dc4be_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:909c7949658d039b0b2af1d6601e97eb5121e58ba531d688c7690a012c5a8886 -size 8370 diff --git a/marked/M/T-REC-M.3020-202304-I_PDF-E/6584b95e34ea1f0b67144aa841db0863_img.jpg b/marked/M/T-REC-M.3020-202304-I_PDF-E/6584b95e34ea1f0b67144aa841db0863_img.jpg deleted file mode 100644 index da3c72635d4432c9cd9323bc657bd479fbfef991..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3020-202304-I_PDF-E/6584b95e34ea1f0b67144aa841db0863_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:fe251367a13502b684e3acba8ff0dd43a0d4af3d5834e2f3096ae8b1323fe150 -size 9863 diff --git a/marked/M/T-REC-M.3020-202304-I_PDF-E/6757222e979ee95c44354a897c5cc1c1_img.jpg b/marked/M/T-REC-M.3020-202304-I_PDF-E/6757222e979ee95c44354a897c5cc1c1_img.jpg deleted file mode 100644 index 249949ebb8cb393d66fc402e65275cade0532800..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3020-202304-I_PDF-E/6757222e979ee95c44354a897c5cc1c1_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:c2837f28df6a4e92a37934ef8428473ea00b244b1908cd61b8b3c2524ceb5d6c -size 4756 diff --git a/marked/M/T-REC-M.3020-202304-I_PDF-E/683f755e8456c884716de4fce48c7e63_img.jpg b/marked/M/T-REC-M.3020-202304-I_PDF-E/683f755e8456c884716de4fce48c7e63_img.jpg deleted file mode 100644 index 6517ba66761b0e8a70d3c2d4bdc9087568dd82a5..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3020-202304-I_PDF-E/683f755e8456c884716de4fce48c7e63_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:663bab4888978977dffe77fade4d4f303fcfeeb9d3ab48c3cfee590a91f705e1 -size 9974 diff --git a/marked/M/T-REC-M.3020-202304-I_PDF-E/70a863dc6cd47bac82c12162a9479aac_img.jpg b/marked/M/T-REC-M.3020-202304-I_PDF-E/70a863dc6cd47bac82c12162a9479aac_img.jpg deleted file mode 100644 index 16206fd05c640fa0f1e59d7bbc39211ce75b45d1..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3020-202304-I_PDF-E/70a863dc6cd47bac82c12162a9479aac_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:c8ea025daaaca04372d7070e956c908697f3b62a58f01f4ee0edf5f4d7a4d38c -size 6149 diff --git a/marked/M/T-REC-M.3020-202304-I_PDF-E/7722d62e33dcc894cc8555e9474c5606_img.jpg b/marked/M/T-REC-M.3020-202304-I_PDF-E/7722d62e33dcc894cc8555e9474c5606_img.jpg deleted file mode 100644 index d5a8f89058c523c0a12c600ee413614295ed90ea..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3020-202304-I_PDF-E/7722d62e33dcc894cc8555e9474c5606_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:e39448d29c54ac534e6b74cc374fe8985b576c7dc77e9df8a6d4c940f23ea1a6 -size 45483 diff --git a/marked/M/T-REC-M.3020-202304-I_PDF-E/772cc583a60eeb058cc19de48269ad22_img.jpg b/marked/M/T-REC-M.3020-202304-I_PDF-E/772cc583a60eeb058cc19de48269ad22_img.jpg deleted file mode 100644 index cd675c009fc09d946bdbe2238d55ff77f94fde35..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3020-202304-I_PDF-E/772cc583a60eeb058cc19de48269ad22_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:a480bd7cacf237295f346e72f3cba7aa93ec493af58349168aec7572ad9e44dc -size 26363 diff --git a/marked/M/T-REC-M.3020-202304-I_PDF-E/781be1b7270da21ee7b75b51db2ee1b3_img.jpg b/marked/M/T-REC-M.3020-202304-I_PDF-E/781be1b7270da21ee7b75b51db2ee1b3_img.jpg deleted file mode 100644 index d9ddfb92fad898fd961fe644648df3a104672c4f..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3020-202304-I_PDF-E/781be1b7270da21ee7b75b51db2ee1b3_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:92de009e1fca36df5e25ed6fe7d390d35267e11931a2856116675e176c36535d -size 4553 diff --git a/marked/M/T-REC-M.3020-202304-I_PDF-E/834fb96b114b8fdc001625e1ae28e8b1_img.jpg b/marked/M/T-REC-M.3020-202304-I_PDF-E/834fb96b114b8fdc001625e1ae28e8b1_img.jpg deleted file mode 100644 index 911b22c94f1a81beda4b5f1c98762cb5c433197f..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3020-202304-I_PDF-E/834fb96b114b8fdc001625e1ae28e8b1_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:5a431abdf4ee3a1abb9c7c126df1014312bae7e8228d346a5e547eff2810d3e4 -size 3976 diff --git a/marked/M/T-REC-M.3020-202304-I_PDF-E/921458d4fc1b778c2450592ac9745b48_img.jpg b/marked/M/T-REC-M.3020-202304-I_PDF-E/921458d4fc1b778c2450592ac9745b48_img.jpg deleted file mode 100644 index f7e7dc1bd192c3dc208da5627b57b8c23acc946c..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3020-202304-I_PDF-E/921458d4fc1b778c2450592ac9745b48_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:a98292b43f0d798622fdd69ce97fd7d140a9a8046173e891d9473bedb40c3284 -size 60957 diff --git a/marked/M/T-REC-M.3020-202304-I_PDF-E/935075de5250cfe8aa0fb9d65d63dde5_img.jpg b/marked/M/T-REC-M.3020-202304-I_PDF-E/935075de5250cfe8aa0fb9d65d63dde5_img.jpg deleted file mode 100644 index 005ee834a36edf6edbd771567aede81f86143fa2..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3020-202304-I_PDF-E/935075de5250cfe8aa0fb9d65d63dde5_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:bd42542a0e28e9565b40f6df34cf830f414537af2d7dfca584247661a3d424e2 -size 14981 diff --git a/marked/M/T-REC-M.3020-202304-I_PDF-E/9cbc1ebd80813fc36e499f7d70ed6881_img.jpg b/marked/M/T-REC-M.3020-202304-I_PDF-E/9cbc1ebd80813fc36e499f7d70ed6881_img.jpg deleted file mode 100644 index 2520d1377d51c4d9ec7f988028186530f245aa5a..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3020-202304-I_PDF-E/9cbc1ebd80813fc36e499f7d70ed6881_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:08aa9e0b267cd5b3499ba1c22efed188a975fa4d6e6be24560032c8226579777 -size 15174 diff --git a/marked/M/T-REC-M.3020-202304-I_PDF-E/9e26cd5584f423e1b2155fb341db579f_img.jpg b/marked/M/T-REC-M.3020-202304-I_PDF-E/9e26cd5584f423e1b2155fb341db579f_img.jpg deleted file mode 100644 index 48b4510762b4361698e86d99f8dff11d29b1ede1..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3020-202304-I_PDF-E/9e26cd5584f423e1b2155fb341db579f_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:40e763cf4252e61d40f13a555a715d49ea1d465b745d0811bd63f8c46253dbdc -size 45800 diff --git a/marked/M/T-REC-M.3020-202304-I_PDF-E/9edb407536d4d4d4a6ac391527af047c_img.jpg b/marked/M/T-REC-M.3020-202304-I_PDF-E/9edb407536d4d4d4a6ac391527af047c_img.jpg deleted file mode 100644 index 350ac4bde8d0a58c8f2a60c5888628588d27a6b3..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3020-202304-I_PDF-E/9edb407536d4d4d4a6ac391527af047c_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:e373b58be86a672f34df76caec820c97372531cee4c107a236053257913b8ad7 -size 11960 diff --git a/marked/M/T-REC-M.3020-202304-I_PDF-E/a634891d16b60b21df90a35c2af72c67_img.jpg b/marked/M/T-REC-M.3020-202304-I_PDF-E/a634891d16b60b21df90a35c2af72c67_img.jpg deleted file mode 100644 index 60a6ccb7b758047a7cdbf7c07aa54dce2561de01..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3020-202304-I_PDF-E/a634891d16b60b21df90a35c2af72c67_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:f83486c89db819d9bfc2dac92eea670c4bc22ce57801ae935869c69815a93a99 -size 80510 diff --git a/marked/M/T-REC-M.3020-202304-I_PDF-E/c8fcc1ae5d86caaae5607b58d16be8e4_img.jpg b/marked/M/T-REC-M.3020-202304-I_PDF-E/c8fcc1ae5d86caaae5607b58d16be8e4_img.jpg deleted file mode 100644 index a480629e43d0182593f98035bb2b9ba51063335c..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3020-202304-I_PDF-E/c8fcc1ae5d86caaae5607b58d16be8e4_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:b10e4bbff16e06087b671fbe8998145638f3f2258dac6d41ab9e8d940426b8ac -size 7436 diff --git a/marked/M/T-REC-M.3020-202304-I_PDF-E/cbb2d311b20781a595488445ded48d0a_img.jpg b/marked/M/T-REC-M.3020-202304-I_PDF-E/cbb2d311b20781a595488445ded48d0a_img.jpg deleted file mode 100644 index fbe00c827195d8a6a5a8977b88b7c992d1f1a5af..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3020-202304-I_PDF-E/cbb2d311b20781a595488445ded48d0a_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:f17d43757f71838be203e84efddc7dbd5e8687f983e36e9b0ebcae4f72ab7048 -size 26449 diff --git a/marked/M/T-REC-M.3020-202304-I_PDF-E/cf8bd014a50b7c69435e804f67f9617f_img.jpg b/marked/M/T-REC-M.3020-202304-I_PDF-E/cf8bd014a50b7c69435e804f67f9617f_img.jpg deleted file mode 100644 index 21f25da0ac291baaf4506e78c45a0dd4246d907d..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3020-202304-I_PDF-E/cf8bd014a50b7c69435e804f67f9617f_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:bbc617e27ac946f6505159ed699e55eeb0c3cef1bb53a5793abe2bff2b5a4347 -size 11503 diff --git a/marked/M/T-REC-M.3020-202304-I_PDF-E/f5a5f52bc25d95a7f616290c99e88ae6_img.jpg b/marked/M/T-REC-M.3020-202304-I_PDF-E/f5a5f52bc25d95a7f616290c99e88ae6_img.jpg deleted file mode 100644 index 042c2000cac69f77c7d2126998eda2a3d242f332..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3020-202304-I_PDF-E/f5a5f52bc25d95a7f616290c99e88ae6_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:9c104e523abae15f2f5d268259ec9be5349e57d40c774f64513b23541fec4211 -size 15278 diff --git a/marked/M/T-REC-M.3020-202304-I_PDF-E/f943b07ab747bfd85e302e5a31c20ba8_img.jpg b/marked/M/T-REC-M.3020-202304-I_PDF-E/f943b07ab747bfd85e302e5a31c20ba8_img.jpg deleted file mode 100644 index 87ff26fe6215321e85a6f812f2868b56da229cd5..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3020-202304-I_PDF-E/f943b07ab747bfd85e302e5a31c20ba8_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:5efcbdb2d654f01698e1ff948917420e2e67908f38c10955d46c38b784f2bdb4 -size 10950 diff --git a/marked/M/T-REC-M.3020-202304-I_PDF-E/f98674fcf898dbd5225f8f732a393e1c_img.jpg b/marked/M/T-REC-M.3020-202304-I_PDF-E/f98674fcf898dbd5225f8f732a393e1c_img.jpg deleted file mode 100644 index 680445701ae11dc32651d63cbc64f20ddb11fc74..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3020-202304-I_PDF-E/f98674fcf898dbd5225f8f732a393e1c_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:30335dd8c80d4cd09b019557090b4ea677a1588fce1f11cdbb22caf3bd86817d -size 5551 diff --git a/marked/M/T-REC-M.3020-202304-I_PDF-E/fb5442ad7130829bed9e3682ccb84c87_img.jpg b/marked/M/T-REC-M.3020-202304-I_PDF-E/fb5442ad7130829bed9e3682ccb84c87_img.jpg deleted file mode 100644 index 8c38c3954af7b1206fe694a11a41548fda65abfd..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3020-202304-I_PDF-E/fb5442ad7130829bed9e3682ccb84c87_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:8bcdd1f139504c17d535b64858e2ed9698e61cf048bae4f0c0b31055049e32b5 -size 3833 diff --git a/marked/M/T-REC-M.3020-202304-I_PDF-E/fc0cdcafc5389b99674ba116c9787ffd_img.jpg b/marked/M/T-REC-M.3020-202304-I_PDF-E/fc0cdcafc5389b99674ba116c9787ffd_img.jpg deleted file mode 100644 index 8e07e6f8f2eaa6a90cb415cd35d70e706c115e62..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3020-202304-I_PDF-E/fc0cdcafc5389b99674ba116c9787ffd_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:f30d239573cf1f3afa3afdc627c33db27eddd7f97a8a8aaf5bf5759fc4f7b8f0 -size 32104 diff --git a/marked/M/T-REC-M.3020-202304-I_PDF-E/fef7e3f08b408e4ab937a75f5c8b6bfc_img.jpg b/marked/M/T-REC-M.3020-202304-I_PDF-E/fef7e3f08b408e4ab937a75f5c8b6bfc_img.jpg deleted file mode 100644 index c59e86d64a318569e8790e5b8b3f38f21fb46d5e..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3020-202304-I_PDF-E/fef7e3f08b408e4ab937a75f5c8b6bfc_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:efa5d6241b34ef2d113f64a4b409e2c9a455c7f0b5d68370376bca0645a892e8 -size 84464 diff --git a/marked/M/T-REC-M.3020-202304-I_PDF-E/ff7977984f2552f326b2089d7595fff3_img.jpg b/marked/M/T-REC-M.3020-202304-I_PDF-E/ff7977984f2552f326b2089d7595fff3_img.jpg deleted file mode 100644 index 24aeec3018572b88a549b31cf63e45c8be51fdc5..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3020-202304-I_PDF-E/ff7977984f2552f326b2089d7595fff3_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:0b03da3f01aac4feb81050f5274e0a0d8ebdfcafec19734cf295bb0f3d36ae66 -size 19562 diff --git a/marked/M/T-REC-M.3020-202304-I_PDF-E/raw.md b/marked/M/T-REC-M.3020-202304-I_PDF-E/raw.md deleted file mode 100644 index 7e08bf0c10fc75a4c39e13d64cbb33630b62c983..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3020-202304-I_PDF-E/raw.md +++ /dev/null @@ -1,2883 +0,0 @@ - - -# Recommendation **ITU-T M.3020 (04/2023)** - -SERIES M: Telecommunication management, including -TMN and network maintenance - -Telecommunications management network - -## --- **Management interface specification methodology** - -![ITU logo](0538daaa5583c23e17db3a12f2281a55_img.jpg) - -The logo of the International Telecommunication Union (ITU) is located in the bottom right corner. It features a blue globe with white lines representing latitude and longitude, and the letters 'ITU' in a bold, blue, sans-serif font superimposed on the globe. - -ITU logo - -## ITU-T M-SERIES RECOMMENDATIONS - -## **Telecommunication management, including TMN and network maintenance** - -| | | -|---------------------------------------------------------------------------------|----------------------| -| Introduction and general principles of maintenance and maintenance organization | M.10-M.299 | -| International transmission systems | M.300-M.559 | -| International telephone circuits | M.560-M.759 | -| Common channel signalling systems | M.760-M.799 | -| International telegraph systems and phototelegraph transmission | M.800-M.899 | -| International leased group and supergroup links | M.900-M.999 | -| International leased circuits | M.1000-M.1099 | -| Mobile telecommunication systems and services | M.1100-M.1199 | -| International public telephone network | M.1200-M.1299 | -| International data transmission systems | M.1300-M.1399 | -| Designations and information exchange | M.1400-M.1999 | -| International transport network | M.2000-M.2999 | -| Telecommunications management network | M.3000-M.3599 | -| Integrated services digital networks | M.3600-M.3999 | -| Common channel signalling systems | M.4000-M.4999 | - -*For further details, please refer to the list of ITU-T Recommendations.* - -# Recommendation ITU-T M.3020 - -# Management interface specification methodology - -## Summary - -Recommendation ITU-T M.3020 describes the management interface specification methodology (MISM). It describes the process to derive interface specifications based on user requirements, analysis and design (RAD). Guidelines are given on RAD using unified modelling language (UML) notation; however, other interface specification techniques are not precluded. The guidelines for using UML are described at a high level in this ITU-T Recommendation. - -## History \* - -| Edition | Recommendation | Approval | Study Group | Unique ID | -|---------|----------------------------|------------|-------------|--------------------| -| 1.0 | ITU-T M.3020 | 1992-10-05 | | 11.1002/1000/1516 | -| 2.0 | ITU-T M.3020 | 1995-07-27 | 4 | 11.1002/1000/1517 | -| 3.0 | ITU-T M.3020 | 2000-02-04 | 4 | 11.1002/1000/4871 | -| 4.0 | ITU-T M.3020 | 2007-07-22 | 4 | 11.1002/1000/9097 | -| 5.0 | ITU-T M.3020 | 2008-07-29 | 4 | 11.1002/1000/9550 | -| 6.0 | ITU-T M.3020 | 2009-05-14 | 2 | 11.1002/1000/9736 | -| 7.0 | ITU-T M.3020 | 2010-09-06 | 2 | 11.1002/1000/10863 | -| 8.0 | ITU-T M.3020 | 2011-07-14 | 2 | 11.1002/1000/11368 | -| 8.1 | ITU-T M.3020 (2011) Amd. 1 | 2014-07-14 | 2 | 11.1002/1000/12202 | -| 9.0 | ITU-T M.3020 | 2017-07-22 | 2 | 11.1002/1000/13268 | -| 10.0 | ITU-T M.3020 | 2023-04-29 | 2 | 11.1002/1000/15514 | - -## Keywords - -Management interface, specification methodology. - ---- - -\* To access the Recommendation, type the URL in the address field of your web browser, followed by the Recommendation's unique ID. - -## FOREWORD - -The International Telecommunication Union (ITU) is the United Nations specialized agency in the field of telecommunications, information and communication technologies (ICTs). The ITU Telecommunication Standardization Sector (ITU-T) is a permanent organ of ITU. ITU-T is responsible for studying technical, operating and tariff questions and issuing Recommendations on them with a view to standardizing telecommunications on a worldwide basis. - -The World Telecommunication Standardization Assembly (WTSA), which meets every four years, establishes the topics for study by the ITU-T study groups which, in turn, produce Recommendations on these topics. - -The approval of ITU-T Recommendations is covered by the procedure laid down in WTSA Resolution 1. - -In some areas of information technology which fall within ITU-T's purview, the necessary standards are prepared on a collaborative basis with ISO and IEC. - -## NOTE - -In this Recommendation, the expression "Administration" is used for conciseness to indicate both a telecommunication administration and a recognized operating agency. - -Compliance with this Recommendation is voluntary. However, the Recommendation may contain certain mandatory provisions (to ensure, e.g., interoperability or applicability) and compliance with the Recommendation is achieved when all of these mandatory provisions are met. The words "shall" or some other obligatory language such as "must" and the negative equivalents are used to express requirements. The use of such words does not suggest that compliance with the Recommendation is required of any party. - -## INTELLECTUAL PROPERTY RIGHTS - -ITU draws attention to the possibility that the practice or implementation of this Recommendation may involve the use of a claimed Intellectual Property Right. ITU takes no position concerning the evidence, validity or applicability of claimed Intellectual Property Rights, whether asserted by ITU members or others outside of the Recommendation development process. - -As of the date of approval of this Recommendation, ITU had not received notice of intellectual property, protected by patents/software copyrights, which may be required to implement this Recommendation. However, implementers are cautioned that this may not represent the latest information and are therefore strongly urged to consult the appropriate ITU-T databases available via the ITU-T website at . - -© ITU 2023 - -All rights reserved. No part of this publication may be reproduced, by any means whatsoever, without the prior written permission of ITU. - -## Table of Contents - -###### Page - -| | | | -|-----|---------------------------------------------------------------|----| -| 1 | Scope ..... | 1 | -| 2 | References..... | 1 | -| 3 | Definitions ..... | 2 | -| 3.1 | Terms defined elsewhere ..... | 2 | -| 3.2 | Terms defined in this Recommendation ..... | 3 | -| 4 | Abbreviations and acronyms ..... | 4 | -| 5 | Conventions ..... | 5 | -| 6 | Requirements for methodology and notational support..... | 5 | -| 7 | Methodology..... | 5 | -| 7.1 | General considerations ..... | 5 | -| 7.2 | Application and structure of the methodology ..... | 6 | -| 7.3 | Detailed methodology ..... | 6 | -| 8 | Management interface specifications..... | 9 | -| 9 | Traceability in MISIM process ..... | 9 | -| 10 | Documentation structure ..... | 9 | -| | Annex A – Requirements ..... | 10 | -| A.1 | Conventions ..... | 10 | -| A.2 | Requirements template..... | 13 | -| A.3 | Simplified requirements template..... | 16 | -| | Annex B – Analysis ..... | 18 | -| B.1 | Conventions ..... | 19 | -| B.2 | Analysis template ..... | 21 | -| B.3 | IOC properties and inheritance..... | 32 | -| | Annex C – MISIM UML repertoire ..... | 34 | -| C.1 | Introduction..... | 34 | -| C.2 | Basic model elements..... | 34 | -| C.3 | Stereotypes..... | 43 | -| C.4 | Others ..... | 49 | -| C.5 | Qualifiers..... | 51 | -| C.6 | UML diagram requirements..... | 52 | -| | Annex D – Design..... | 53 | -| | Annex E – Information type definitions – type repertoire..... | 54 | -| E.1 | Basic types ..... | 54 | -| E.2 | Enumerated type ..... | 54 | -| E.3 | Complex types ..... | 54 | -| E.4 | Useful types ..... | 54 | -| E.5 | Keywords ..... | 55 | - -| | Page | -|----------------------------------------------------------------------------|-------------| -| Annex F – Guidelines on IOC properties, inheritance and entity import..... | 56 | -| F.1     IOC property ..... | 56 | -| F.2     Inheritance..... | 57 | -| F.3     Entity (interface, IOC and attribute) import ..... | 57 | -| Annex G – Attribute Properties..... | 58 | -| Annex H – Design patterns..... | 59 | -| H.1     Intervening class and association class ..... | 59 | -| H.2     Use of "ExternalXyz" class..... | 63 | -| Appendix I – Comparison with Recommendation ITU-T Z.601 ..... | 64 | -| Appendix II – Additional UML usage examples ..... | 65 | -| II.1     Proxy class ..... | 65 | -| Appendix III – Guidelines on requirements numbering ..... | 67 | -| Appendix IV – Stereotypes for naming purposes ..... | 68 | -| Bibliography ..... | 69 | - -# Recommendation ITU-T M.3020 - -## Management interface specification methodology - -# 1 Scope - -This Recommendation describes the management interface specification methodology (MISM). It describes the process to derive machine-machine interface specifications based on user requirements, analysis and design (RAD). Guidelines are given on RAD using unified modelling language (UML) notation; however, other interface specification techniques are not precluded. The guidelines for using UML are described in this Recommendation. An interface specification addresses management service(s) defined in [ITU-T M.3200] and/or supporting the management processes defined in [ITU-T M.3050.x] series. Such a specification may support part of or one or more management services. The management services comprise of management functions. These functions may reference those defined in [ITU-T M.3400] or the processes defined in [ITU-T M.3050.x] series, specialized to suit a specific managed area, or new functions may be identified as appropriate. - -The methodology is applicable to both the traditional manager/agent style of management interfaces [ITU-T M.3010] and the service oriented architecture (SOA) principles adopted for the management architecture of next generation networks [ITU-T M.3060]. - -# 2 References - -The following ITU-T Recommendations and other references contain provisions which, through reference in this text, constitute provisions of this Recommendation. At the time of publication, the editions indicated were valid. All Recommendations and other references are subject to revision; users of this Recommendation are therefore encouraged to investigate the possibility of applying the most recent edition of the Recommendations and other references listed below. A list of the currently valid ITU-T Recommendations is regularly published. The reference to a document within this Recommendation does not give it, as a stand-alone document, the status of a Recommendation. - -- [ITU-T M.3010] Recommendation ITU-T M.3010 (2000), *Principles for a telecommunications management network*. -- [ITU-T M.3050.0] Recommendation ITU-T M.3050.0 (2007), *Enhanced Telecom Operations Map (eTOM) – Introduction*. -- [ITU-T M.3050.x] ITU-T M.3050.x (2007) series of Recommendations, *Enhanced Telecom Operations Map (eTOM)*. -- [ITU-T M.3060] Recommendation ITU-T M.3060/Y.2401 (2006), *Principles for the Management of Next Generation Networks*. -- [ITU-T M.3200] Recommendation ITU-T M.3200 (1997), *TMN management services and telecommunications managed areas: Overview*. -- [ITU-T M.3400] Recommendation ITU-T M.3400 (2000), *TMN management functions*. -- [ITU-T Q.812] Recommendation ITU-T Q.812 (2004), *Upper layer protocol profiles for the Q and X interfaces*. -- [ITU-T X.501] Recommendation ITU-T X.501 (2019) | ISO/IEC 9594-2:2019, *Information Technology – Open Systems Interconnection – The Directory: Models*. -- [ITU-T X.680] Recommendation ITU-T X.680 (2021) | ISO/IEC 8824-1:2021, *Information Technology – Abstract Syntax Notation One (ASN.1): Specification of Basic Notation*. - -- [ITU-T X.681] Recommendation ITU-T X.681 (2021) | ISO/IEC 8824-2:2021, *Information technology – Abstract Syntax Notation One (ASN.1): Information Object Specification*. -- [ITU-T X.722] Recommendation ITU-T X.722 (1992) | ISO/IEC 10165-4:1992, *Information technology – Open Systems Interconnection – Structure of management information: Guidelines for the definition of managed objects*. -- [ITU-T Z.100] Recommendation ITU-T Z.100 (2016), *Specification and Description Language (SDL) – Overview of SDL-2010*. -- [OMG UML1] Object Management Group (2011), *Unified Modeling Language (OMG UML), Infrastructure, Version 2.4.1*. -- [OMG UML2] Object Management Group (2011), *Unified Modeling Language (OMG UML), Superstructure, Version 2.4.1*. - -A list of non-normative references can be found in the Bibliography. - -# 3 Definitions - -## 3.1 Terms defined elsewhere - -This Recommendation uses the following terms defined elsewhere: - -**3.1.1 actor** [OMG UML2]: An actor specifies a role played by a user or any other system that interacts with the subject. - -**3.1.2 association** [OMG UML1]: An association describes a set of tuples whose values refer to typed instances. An instance of an association is called a link. A link is a tuple with one value for each end of the association, where each value is an instance of the type of the end. - -**3.1.3 class** [OMG UML1]: A class describes a set of objects that share the same specifications of features, constraints, and semantics. - -**3.1.4 distinguished name** [ITU-T X.501]: The name of an entry which is formed from the sequence of the relative distinguished names (RDNs) of the entry and each of its superior entries. Every object entry, alias entry and subentry has precisely one distinguished name. - -**3.1.5 management function set** [ITU-T M.3010]: TMN management function set is a grouping of TMN management functions that contextually belong together, i.e., they are related to a specific management capability (e.g., alarm reporting functions, traffic management control). The TMN management function set is the smallest reusable item of functional specification. The TMN management function set must be considered as a whole. It is similar to the requirements part of the OSI SMF (system management function). - -**3.1.6 management service** [ITU-T M.3010]: A management service is an offering fulfilling specific telecommunications management needs. - -**3.1.7 reference point** [ITU-T M.3010]: An architectural concept used to delineate management function blocks and which defines a service boundary between two management function blocks. - -**3.1.8 stereotype** [OMG UML1]: A stereotype defines how an existing metaclass may be extended, and enables the use of platform or domain specific terminology or notation in place of, or in addition to, the ones used for the extended metaclass. - -**3.1.9 user** [ITU-T M.3010]: A person or process applying management services for the purpose of fulfilling management operations. - -## 3.2 Terms defined in this Recommendation - -This Recommendation defines the following terms: - -**3.2.1 agent:** Encapsulates a well-defined subset of management functionality. It interacts with managers using a management interface. From the manager's perspective, the agent behaviour is only visible via the management interface. - -NOTE – Considered equivalent to IRPAgent [b-3GPP TS 32.150]. - -**3.2.2 information object class:** Describes the information that can be passed/used in management interfaces and is modelled using the stereotype "Class" in the UML meta-model. For a formal definition of information object class and its structure of specification, see Annex B. - -**3.2.3 information service:** Describes the information related to the entities (either network resources or support objects) to be managed and the way that the information may be managed for a certain functional area. Information services are defined for all IRPs. - -NOTE – Considered identical to the definition of information service found in [b-3GPP TS 32.150]. - -**3.2.4 information type:** Specification of the type of input parameters of operations. - -**3.2.5 integration reference point:** An architectural concept that is described by a set of specifications for the definition of a certain aspect of the management interface, comprising a requirements specification, an information service specification, and one or more solution set specifications. - -NOTE – Considered identical to the definition of IRP found in [b-3GPP TS 32.150]. - -**3.2.6 lower camel case:** The practice of writing compound words in which the words are joined without spaces. Initial letter of all except the first word shall be capitalized. Examples: 'managedNodeIdentity' and 'minorDetails' are the lower camel case (LCC) for "managed node identity" and "minor details" respectively. - -**3.2.7 management goals:** High-level objectives of a user in performing management activities. - -**3.2.8 management interface:** The realization of management capabilities between a manager and an agent, allowing a single manager to use multiple agents and a single agent to support multiple managers. - -NOTE – Q, C2B/B2B and Itf-N (3GPP) are examples of management interfaces. - -**3.2.9 management role:** Defines the activities that are expected of the operational staff or systems that perform telecommunications management. Management roles are defined independent of other components, i.e., telecommunications resources and management functions. - -**3.2.10 management scenario:** An example of management interactions from a management service. - -**3.2.11 manager:** Models a user of agent(s) and it interacts directly with the agent(s) using management interfaces. - -Since the manager represents an agent user, it gives a clear picture of what the agent is supposed to do. From the agent perspective, the manager behaviour is only visible via the management interface. - -NOTE – Considered equivalent to IRPManager [b-3GPP TS 32.150]. - -**3.2.12 matching information:** Specification of the type of a parameter (possibly reference to IOC or attribute of IOC). - -**3.2.13 naming attribute:** A class attribute that holds the class instance identifier. - -NOTE – See examples of naming attribute in [b-3GPP TS 32.300]. - -**3.2.14 protocol-neutral specification:** Defines the management interfaces in support of management capabilities without concern for the protocol and information representation implied or required by, e.g., CORBA and XML. - -**3.2.15 protocol-specific specification:** Defines the management interfaces in support of management capabilities for one specific choice of management technology (e.g., CORBA). - -NOTE – Considered equivalent to solution set [b-3GPP TS 32.150]. - -**3.2.16 telecommunication resources:** Physical or logical entities requiring management, using management services. - -**3.2.17 upper camel case:** It is the lower camel case except that the first letter is capitalized. Examples: 'ManagedNodeIdentity' and 'MinorDetails' are the upper camel case (UCC) for "managed node identity" and "minor details" respectively. - -**3.2.18 well known abbreviation:** An abbreviation can be used as the modelled element name or as a component of a modelled element name. The abbreviation, when used in such manner, must be documented in the same document where the modelled element is defined. - -# 4 Abbreviations and acronyms - -This Recommendation uses the following abbreviations and acronyms: - -| | | -|-------|--------------------------------------------------| -| ADM | Administrative (usage: requirements category) | -| ASN.1 | Abstract Syntax Notation One | -| CM | Conditional-Mandatory | -| CO | Conditional-Optional | -| CON | Conceptual (usage: requirements category) | -| CORBA | Common Object Request Broker Architecture | -| DN | Distinguished Name | -| FUN | Functional (usage: requirements category) | -| GDMO | Guidelines for the Definition of Managed Objects | -| IDL | Interface Definition Language | -| IOC | Information Object Class | -| IRP | Integration Reference Point | -| IS | Information Service | -| JSON | JavaScript Object Notation | -| LCC | Lower Camel Case | -| MCC | Mobile Country Code | -| MISM | Management Interface Specification Methodology | -| MNC | Mobile Network Code | -| N/A | Not Applicable | -| NE | Network Element | -| NON | Non-functional (usage: requirements category) | -| OO | Object Oriented | -| OSI | Open Systems Interconnection | - -| | | -|------|----------------------------------------| -| RAD | Requirements, Analysis and Design | -| RDN | Relative Distinguished Name | -| SDL | Specification and Description Language | -| SOA | Service Oriented Architecture | -| SS | Solution Set | -| SNC | Sub Network Connection | -| TP | Termination Point | -| TS | Technical Specification | -| UCC | Upper Camel Case | -| UML | Unified Modelling Language | -| WKA | Well Known Abbreviation | -| WSDL | Web Services Description Language | -| XML | extensible Markup Language | -| XSD | XML Schema Definition | -| YAML | YAML Ain't Markup Language | - -# 5 Conventions - -Clause A.1 contains conventions applicable to the requirements phase. - -Clause B.1 contains conventions applicable to the analysis phase. - -# 6 Requirements for methodology and notational support - -In developing the methodology and choosing a notation, the following requirements apply: - -- 1) The methodology, including the choice of notation, shall support the capture of all the relevant requirements of the problem space, namely telecommunications management. -- 2) The methodology facilitates the production of requirements, its corresponding Analysis|Information Services and their corresponding Design Specifications|Solution Sets. -- 3) The notation shall facilitate unambiguous generation of the specification in the target management protocol profile. The methodology does not address possible choices of protocol services (e.g., CORBA Security Service). - -NOTE – Management protocols applicable for ITU-T use are specified in [ITU-T Q.812]. - -- 4) The methodology shall allow specification of mandatory and optional items in all three phases. It also specifies the relation of mandatory|optional items between the three phases. -- 5) It should be possible to generate, from the protocol-neutral specification (Analysis|IS), interoperable language specific definitions, i.e., Design|SS (for example UML to interface definition language (IDL), UML to GDMO/ASN.1). - -# 7 Methodology - -## 7.1 General considerations - -The purpose of this methodology is to provide a description of the processes leading towards the definition of machine-machine management interfaces. - -## 7.2 Application and structure of the methodology - -The management interface specification methodology (MISM) specifies a three-phase process with features that allow traceability across the three phases. The three phases apply industry-accepted techniques using object oriented analysis and design principles. The three phases are requirements, analysis and design. The techniques should allow the use or development of commercially available support tools. Different techniques may be used for the phases depending on the nature of the problem. - -## 7.3 Detailed methodology - -### 7.3.1 General - -The requirements and analysis phases produce UML specifications. The design phase uses network management paradigm specific notation. The outputs of the 3 phases are: - -- Requirements phase – Requirements. -- Analysis phase – Implementation independent specification. -- Design phase – Technology specific specification. - -Initially, the design phase will be developed using a manual or customized approach. When interoperable protocol specific definition can be generated by tools, then UML notation can be applied to the design phase. - -The clauses below describe the three phases. - -### 7.3.2 Requirements - -The requirements for the problem being solved fall into two classes. The first class of requirements is referenced here as business requirements. A subject matter expert on the topic shall be able to determine that the requirements adequately represent the needs of the management problem being solved. The second class is referred to as specification requirements. These requirements shall provide sufficient details so that the interface definition in the analysis and design phases can be developed. As final interface definitions must be traceable to the requirements, it may be necessary to have interaction between the three phases. Any ambiguity in the requirements will have to be resolved by this interaction to assure that an implementable specification can be developed. - -Human-computer interface data may be specified in the second class of requirements. These requirements may have great impact on concepts and data designed in the subsequent phases. For more details, see Appendix I. - -Different techniques may be used to specify the two classes of requirement. Irrespective of the technique, the readability of the requirements is critical. The requirements themselves are not required to be in a machine-readable notation as long as readability and traceability are possible. Enumerating requirements is the recommended solution to delineate the different requirements for traceability. - -The requirements phase includes identifying aspects such as security policy, scope of the problem domain in terms of the applications, resources, and roles assumed by the resources. The requirements specify roles, responsibilities, and the relationships between the constituent entities for the problem space. Different techniques, including textual representation, may be used to specify the business level requirements. In order to facilitate traceability of these requirements to the design and implementation phases, enumerating requirements is recommended. - -The problem must be bounded with a specific scope. One way to determine the scope is by using the management services identified in [ITU-T M.3200] and function sets identified in [ITU-T M.3400]. Requirements are specified using the resources being managed and management functions. An alternative to the management services approach is described in [ITU-T M.3050.x] "enhanced Telecom Operations Map (eTOM)" which provides a business process based approach. - -The relationship between the [ITU-T M.3200] and [ITU-T M.3050.x] approaches is described in [ITU-T M.3050.0]. - -Management functions must be grouped and supported within applications that address specific business needs, so the linkage between the eTOM processes, the [ITU-T M.3200] management services, the [ITU-T M.3400] management function sets and management functions is important to assist in making this grouping clear and effective. Augmenting [ITU-T M.3400] may be required in order to meet the business requirements of the problem. - -UML use cases and scenarios should be used to interact with subject matter experts in capturing the business level requirements. The requirements should also identify the failure conditions visible to the business process. - -NOTE – It is not required that every requirement be expressed as a use case. - -The requirements produced must be complete and detailed. The recursive nature of the methodology is used to achieve this completeness. The completeness of the requirements (clear and well-documented) drives the analysis and design phases. - -Guidelines and template for requirement structure and identification are described in clause A.1.2. - -Use cases are goals that are fulfilled through a sequence of steps. Each step can be considered as a sub-goal of the use case. As such each step represents either another use case (subordinate use case) or an autonomous action that is at the lowest level of the case decomposition. - -Guidelines and template for use cases are described in clause A.1.2. - -### 7.3.3 Analysis - -In the analysis phase, the requirements are used to identify the interacting entities, their properties and the relationships among them. This allows the interfaces offered by the entities to be defined. In the UML notation, these entities become classes. The class descriptions along with the interfaces exposed should be traceable to the requirements. The relationship among the classes, defined in the analysis specification, and the classes in the design specification is not necessarily one to one. - -This phase should take into account the needs of human-computer interface data (i.e., the information model must contain sufficient information so that designs can be developed based on the analysis results). - -This Recommendation gives high-level guidance on the use of UML notation to support management interface specification; however, Specification and Description Language (SDL) [ITU-T Z.100] might be used to augment the UML definitions. - -The analysis phase should be independent of design constraints. For example, the analysis may be documented using object oriented (OO) principles even though the design may use a non-object-oriented technology. The information specified in the analysis phase includes class descriptions, data definitions, class relationships, interaction diagrams (the most common variant is the sequence diagrams, see 14.4 of [OMG UML2]), state machine diagrams (see 15.4 of [OMG UML2]) and activity diagrams (see 12.4 of [OMG UML2]). The class definitions include specification of operations, notifications, attributes and behaviour captured as notes or textual description. - -Protocol-neutral common management services (if available) – or other existing services – should be reused during the analysis phase in order to support management interface harmonization. - -Guidelines and template for use cases are described in Annex A. - -The analysis template uses information type as one characteristic to describe information object class (IOC) attributes and operation/notification parameters. The valid information type(s) that can be used and their semantics are defined in Annex E. - -### **7.3.4 Design** - -#### **7.3.4.1 General** - -In the design phase, an implementable interoperable interface specification is produced. This will involve the selection of a target specification language. The design phase specifications are dependent on the specific management paradigm (e.g., IDL for CORBA interfaces). - -This phase distinguishes three kinds of specifications of data: management paradigm (e.g., extensible markup language (XML)) dependent design of data to be communicated across multiple interfaces (e.g., fault and performance), messages (e.g., alarm report) to be communicated over each individual interface, and encoding method of the data (e.g., compressed XML) consistent with a particular paradigm. - -The selection of a specific management paradigm is addressed in other ITU-T Recommendations. An overview is provided in the following clauses. - -In the design phase, it is recommended that the UML descriptions from the requirements and analysis phases be referenced to augment behavioural specification. For example, the behaviour definition of guidelines for the definition of managed objects (GDMO) can reference state charts, sequence diagrams and class definition in the analysis phase. If required, additional UML diagrams describing interactions between entities, corresponding to specific protocol paradigms, may be included. - -As additional paradigms are adopted for use by management, the notations/languages defined by these paradigms will be used. - -#### **7.3.4.2 CORBA** - -In the context of common object request broker architecture (CORBA) based management, the information model is defined using IDL. - -#### **7.3.4.3 GDMO** - -In the context of the paradigm based on open systems interconnection (OSI) systems management [ITU-T X.722], the design specification is the information model specification using GDMO templates for managed object classes, attributes, behaviour, notifications, actions, naming instances of the class, and error/exception specifications. The syntax of the information is specified using Abstract Syntax Notation One (ASN.1) notation [ITU-T X.680]. - -In GDMO, the object class hierarchy specifies the properties of the object classes that are needed for management. Extensive use of inheritance (super and subclasses) is needed to benefit the most from the reuse of specifications. The object classes are specified using the templates from [ITU-T X.722]. The templates defining the information model should be registered (according to the rules of [ITU-T X.722]) with a value for the ASN.1 object identifier. For those object classes that are already specified in other ITU-T Recommendations and ISO standards, only a reference to the particular Recommendation and object class is needed. Naming is not a part, nor the purpose, of the object class hierarchy. - -#### **7.3.4.4 XML** - -In the context of extensible markup language (XML) based management, the information model is defined using XML Schema Definition (XSD). - -#### **7.3.4.5 Web services** - -In the context of web services based management, the information model is defined using Web Service Description Language (WSDL) and XSD. - -#### 7.3.4.6 REST - -In the context of REST-based management, the information model is defined using JSON Schema or YAML Schema. - -# 8 Management interface specifications - -A management interface specification includes the requirements, analysis and design specifications discussed in clause 7. A structure for specifying these specifications is provided in Annexes A, B and C. - -These techniques and supporting notations are also applicable when designing a system to the management interface specifications, even though system design is not considered as part of the ITU-T management Recommendations. They assist in describing how the interface specifications are applied in managing the resources within a system such as a network element (NE). - -# 9 Traceability in MISIM process - -In order to achieve traceability between requirements, analysis and design, it is necessary that appropriate identification be assigned. Traceability is supported through references between entities specified within each phase and between phases. Traceability is from design|solution set to analysis|information services and from analysis|information services to requirements. Traceability is further applicable between artifacts of the requirements specification and between artifacts of the analysis|information service, e.g., between use cases and textual requirements. Requirements should be identified as described in clause 7.3.2. The analysis phase output specifies for the various use cases further detailed information requirements. The design phase should point to the various diagrams and text in the analysis phase output. The pointer may be in terms of a reference to the appropriate clauses. - -Traceability from the design phase to subject matter level requirements is usually indirect. This is required because the output of the phases is defined to different level of details. - -Guidelines for traceability between the requirements phase and the analysis phase are described in Annex B. - -The following mechanism for traceability with requirements, etc., specified in other documents (possibly not following the advocated identification schema) is recommended: - -forum/body "::" document ID "::" id - -where "id" could be one of: - -- 1) requirement ID; -- 2) use case ID; -- 3) requirement title/text; -- 4) use case title; -- 5) subclause of the document which uniquely identifies a requirement or use case. - -Examples: - -3GPP::32.111-1::getAlarmList - -ITU-T::M.3016::1.5.1.2 - -# 10 Documentation structure - -Even though there are three phases, the documentation of the interface may combine their outputs into one or more documents. It is recommended that the requirements and analysis be combined and separate design documents are developed for each specific network management protocol paradigm. - -# Annex A - -## Requirements - -(This annex forms an integral part of this Recommendation.) - -## *A.1 Conventions* - -#### *A.1.1 Use of UML notation for requirements* - -#### *A.1.2 Use case template* - -#### *A.1.3 Requirements categories* - -### *A.2 Requirements template* - -### *1 Concepts and background* - -### *2 Business level requirements* - -#### *2.1 Requirements* - -#### *2.2 Actor roles* - -#### *2.3 Telecommunication resources* - -#### *2.4 High-level use cases* - -### *3 Specification level requirements* - -#### *3.1 Requirements* - -#### *3.2 Actor roles* - -#### *3.3 Telecommunication resources* - -#### *3.4 Use cases* - -### *A.3 Simplified requirements template* - -### *1 Concepts and background* - -### *2 Requirements* - -The following are guidelines for specification of requirements. - -The normal (or full format) requirements template is found in clause A.2. In addition, a simplified requirements template is defined and found in clause A.3. - -## **A.1 Conventions** - -#### **A.1.1 Use of UML notation for requirements** - -Table A.1 identifies the correspondence between management concepts and UML notation. This Recommendation specifies the high-level concepts and notations to be used in the different phases. Stereotypes are used to extend UML notation. The approved stereotypes for use within the management environment are included in this Recommendation (see Annex C). - -**Table A.1 – Requirements concepts** - -| Management concept | UML notation | Comment | -|---------------------------------|---------------------|----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| user | Actor | A user is modelled as an actor. | -| management role | Actor | An actor plays a role. It is normally advisable to only model a single role for each actor. | -| management function | use case | A management function is modelled by one or more use cases. | -| management function set | use case | A management function set is a composite use case with each management function (potentially) modelled as a separate use case. | -| management service | use case | A management service is modelled as a high-level use case. | -| management scenario | sequence diagram | Sequence diagrams are preferred over collaboration diagrams. | -| telecommunication resource type | Class | The classes diagrams (see 10.2 of [OMG UML1]) depict the property details of the telecommunications resource type, at the level of detail appropriate to the phase of the methodology. | -| management goals | – | Management goals are captured as textual descriptions as there is no applicable UML notation. | - -#### A.1.2 Use case template - -When use cases are provided, the conventions and templates in Table A.2 should be followed unless the use case can be sufficiently described without the table format. - -**Table A.2 – Use case template** - -| Use case stage | Evolution/Specification | <<Uses>>
Related use | -|---------------------------------|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|---------------------------------------------| -| Goal (*) | This is the objective/end result the use case strives to achieve and should be a concise statement of what the use case should achieve in a successful scenario.
There may be a statement about priority relative to other use cases and required performance of the use case, e.g.:
  • • Real Time.
  • • Near real time.
  • • Not real time.
| | -| Actors and roles (*) | The names of actors/roles involved in the use case including role characteristic for each actor. | | -| Telecom resources | The names of the telecommunication resources involved in the use case. | | -| Assumptions | A description of the environment providing a context for the use case.
Assumptions are mutually exclusive to pre-conditions.
Assumptions are concerned with static properties. | | - -**Table A.2 – Use case template** - -| Use case stage | Evolution/Specification | <>
Related use | -|-----------------------------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------| -| Pre-conditions | A list of all system and environment conditions that must be true before the use case can be triggered.
Pre-conditions are mutually exclusive to assumptions.
Pre-conditions are related to dynamic properties and can result in an exception. This is never the case with assumptions. | | -| Begins when | The name of the single event that triggers the start of the use case.
Optional and normally not used to specify triggers such as "when the manager must retrieve information". | | -| Step 1 (*) (M O) | A use case describes a list of steps (manual and automated) that are necessary to accomplish the goal of the use case.
Steps may invoke other use cases.
Steps are numbered for traceability.
Each step is identified as being mandatory (M) or optional (O).
Sub-steps are identified relative to the containing step, e.g.:
Step n
Step n.1
Step n.2
where n.1 and n.2 are sub-steps of step n. | Reference to a used use case. | -| Step n (M O) | Steps added as necessary and in a logical sequence. | | -| Ends when (*) | The list of event(s) that indicates the use case completion.
NOTE – In this context, "event" should be considered in the most general sense and not limited to, e.g., notifications exchanged across a management interface. As an example, the completion of processing can be considered an event that indicates completion of a use case. | | -| Exceptions | A summary list of exception conditions and faults detected by the use case during its operation. | | -| Post-conditions | A list of all system and environmental conditions that must be true when the use case has completed. The statement of post-conditions determines if the use case is expected to be fully successful, partially successful or even to have failed in order to be completed. | | -| Traceability (*) | Requirements or use case exposed by the use case. | | - -NOTE – Fields marked with "\*" are mandatory for all use case specifications. Other fields are only mandatory when relevant for the specific use case. - -#### A.1.3 Requirements categories - -It is useful to classify requirements in different categories. The following categories are considered relevant for MISM: - -- Conceptual (CON) – Identifies a concept, data type, relationship, format, or structure. -- Functional (FUN) – Identifies a functional capability, dynamic situation, a sequence, timing parameters, or an interaction. -- Non-functional (NON) – Non-functional requirements, including abnormal conditions, error conditions and bounds of performance. -- Administrative (ADM) – System administration and operational requirements not related to the use cases normal operations. - -Requirements should be written based on the following template: - -REQ-Label-Category-Number {Category, number} Details {Source Citation} - -where "Label" is an abbreviation for the Recommendation (or part thereof). The set of labels is not finite and not subject for standardization. - -Guidelines on requirements numbering can be found in Appendix III. - -### A.2 Requirements template - -| 1 Concepts and background | | | | | | | -|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|----------------------------------------------------------------------------------------------------------------------------------------------------|----------------------------------|----------------------------------|---------------|----------------------------------------------------------------------------------------------------------------------------------------------------|--| -| Define major goals and objectives and the applicable management interfaces (and reference points) for this specification. Use [ITU-T M.3200] categorization as a source for identifying the management service(s) supported by this interface. | | | | | | | -| This subclause should give a clear description of the users' benefit, i.e., the reason for performing this management service. Background and context should be added as necessary, but the explanatory and descriptive parts should be separated. Supporting background information, where required, should be placed in an appendix. | | | | | | | -| 1.a SubClauseTitle | | | | | | | -| SubClauseTitle is the name of the subclause. | | | | | | | -| "a" represents a number, starting at 1 and increasing by 1 with each new subclause. | | | | | | | -| The use of subclauses is optional. | | | | | | | -| 2 Business level requirements | | | | | | | -| 2.1 Requirements | | | | | | | -| 2.1.a SubSetTitle | | | | | | | -| SubSetTitle is the name of a sub-set of the business level requirements. | | | | | | | -| "a" represents a number, starting at 1 and increasing by 1 with each new sub-set. | | | | | | | -| The use of sub-sets is optional and all business level requirements can be stated in subclause 2.1 (requirements). | | | | | | | -| List major requirements in text, and identify use cases with actor/role and resources. The high-level use cases (subclause 2.4 below) should bring out the business level requirements and are distinguished from the specification requirements by not refining to lower levels. Clause 2.4 contains many examples of what makes up the high-level use cases. Policy-related information (e.g., security, persistence) are candidates for inclusion at this level. Numbering the requirements is required for traceability. | | | | | | | -| Requirements should be specified as described in clause A.1.3. Within a requirements specification, it is suggested that requirements be written in the sequence of clause A.1.3 (either for the entire specification or for each sub-set). | | | | | | | -| Use of requirements categories is optional, and – when used – a subset of the categories can be applied. As an example, conceptual requirement number 23 in Recommendation tagged 'SM' would be specified as follows: | | | | | | | -|
Identifier1Definition2Related use case(s) / Motivation
REQ-SM-CON-23A Service Order consists of a name, address, phone number, service description and an optional FAX number for contacts {T1M1.5 Document 246 11/96}
| Identifier 1 | Definition 2 | Related use case(s) / Motivation | REQ-SM-CON-23 | A Service Order consists of a name, address, phone number, service description and an optional FAX number for contacts {T1M1.5 Document 246 11/96} | | -| Identifier 1 | Definition 2 | Related use case(s) / Motivation | | | | | -| REQ-SM-CON-23 | A Service Order consists of a name, address, phone number, service description and an optional FAX number for contacts {T1M1.5 Document 246 11/96} | | | | | | - -1 "Identifier" in this table is equivalent to "Requirement label" in the table of X.a.3 in [b-3GPP TS 32.160]. - -2 "Definition" in this table is equivalent to "Description" in the table of X.a.3 in [b-3GPP TS 32.160]. - -*One or more tables can be used with supportive text between tables as necessary.* - -*In some cases, supplementary text can be added to the requirements as an alternative to very rudimentary use case statements. This can either be done within the table structure itself or following the table (typically relevant when there are only a few requirements in the table).* - -*As an example, supplementary text can be added to the requirement statement as follows:* - -| Identifier | Definition | Related use case(s)
/ Motivation | -|-------------------|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|---------------------------------------------| -| REQ-SM-CON-24 | A Service Order consists of a name, address, phone number, service description and an optional FAX number for contacts {TIM1.5 Document 246 11/96}.
Additional information:
One or more paragraphs of additional information can be added to the formal requirement statement. The additional information is intended to provide guidance to the understanding of the requirement and is not formally part of the requirement. The information can be provided within the table (like this example) or below the table. | REQ-SM-CON-21 | - -#### **2.2 Actor roles** - -*A textual description of the actor (see clause 3) is included here.* - -#### **2.3 Telecommunication resources** - -*Textual description of the relevant resources (see clause 3) required to support the use cases are presented here.* - -#### **2.4 High-level use cases** - -*A high-level use case diagram may be presented. In order to understand the use case by subject matter experts, they should be augmented with a textual description for each use case. The description should serve two purposes: to capture the domain experts' knowledge and to validate the models in analysis and design phases with respect to the requirements. An example of a high-level use case diagram is given in Appendix I.* - -*Use cases can be described using the full use case format as described in 2.4.a or more simply as natural text depending on the nature of the use case.* - -*In some cases, the text of a use case can be seen as a detailing of requirements. In these cases, it can be more practical to handle this text as a supplement to the relevant requirement. See clause 3.1.a for more details on this.* - -#### **2.4.a UseCaseName** - -*UseCaseName is the name of the use-case.* - -*"a" represents a number, starting at 1 and increasing by 1 with each new definition of a use case.* - -*This subclause is repeated for each high-level use case defined for the interface specification requirements.* - -*The high-level use cases may identify the various function sets defined in [ITU-T M.3400] or the management processes defined in [ITU-T M.3050.x]. These use cases may be further refined as described in the specification level requirement subclause below by using stereotypes such as "include" and "extend".* - -*If appropriate, sequence diagrams may be used. However, at the high-level requirements these diagrams are not expected to be used. When the use cases at this level are further decomposed in the next level of requirements, these diagrams may be more suitable.* - -*The traceability of the next level of requirements from this level may be identified by how each function set is further refined with new use cases.* - -*A set of use case tables, using the template defined in Table A.2, may be used to represent the significant capabilities studied at a level of abstraction appropriate to the problem being analysed.* - -*The level of detail, and extent of coverage provided in the use cases is dependent upon the authoring team's familiarity with the subject matter and is therefore subjective. The lower levels of details are most likely an indication of analysis rather than requirements capture.* - -*It is permitted to develop successively more detailed analysis of each step of a higher abstraction level use case by referring to the more detailed use case in the table cell reserved for this purpose. It is emphasized this does not have to be done, and is subjective depending upon the need of the author/group.* - -*The following list is provided to aid the initial identification of suitable use cases:* - -- What is the main purpose of the system?* -- What types of people/system need to interact with the system?* -- How can these people/systems be grouped or abstracted to roles?* -- What are the start up, normal running, failure and recovery aspects of the system?* -- What types of reports or data may be needed from the system?* -- Which special activities are required (e.g., based on times of day and network loads)?* - -*It is useful to document use cases in a common manner. The following structure is suggested:* - -- (see Table A.2)* -- * -- * - -A simplified use case documentation approach can also be used. In that case, the use case is described without a pre-defined format or template, e.g., one or more text paragraphs. - -### **3 Specification level requirements** - -#### **3.1 Requirements** - -*The business level requirements are further refined here using management functions from [ITU-T M.3400]. Since [ITU-T M.3400] is not exhaustive enough to address all management services for all managed areas, it is expected that new functions will be required. The new functions should be included in the requirements as described below.* - -##### **3.1.a SubSetTitle** - -*SubSetTitle represents the name of a subset of specification level requirements.* - -*"a" represents a number, starting at 1 and increasing by 1 with each new sub-set.* - -*The use of sub-sets is optional and all specification level requirements can be stated in subclause 3.1 (requirements).* - -*List major detailed and concrete requirements in text, and identify use cases with actor/role and resources. The use cases in subclause 3.4 should bring out specification level requirements with lower level details and be more implementation-oriented compared to the business level use case requirements. Numbering the requirements is required for traceability.* - -*Requirements should be specified as described in clause A.1.3. Within a requirements specification, it is suggested that requirements be written in the sequence of clause A.1.3 (either for the entire specification or for each sub-set).* - -*Use of requirements categories is optional, and – when used – a subset of the categories can be applied. As an example, functional requirement number 33 in a Recommendation tagged 'OM' would be specified as follows:* - -| Identifier | Definition | -|-------------------|--------------------------------------------------------| -| REQ-OM-FUN-33 | A pending operation can be cancelled by the initiator. | - -*One or more tables can be used with supportive text between tables as necessary.* - -*Specification level requirements should follow the conventions and templates defined in clause A.1.* - -*In some cases, supplementary text can be added to the requirements as described in clause 2.1.a.* - -#### **3.2 Actor roles** - -*A list of all actors and textual description of actors not already defined in the business level requirements is included here.* - -#### **3.3 Telecommunication resources** - -*A list of all passive resources and textual description of resources not already defined in the business level requirements is presented here.* - -#### **3.4 Use cases** - -*The high-level use cases are further refined here using several specification level use cases, each of which will be further explained in detail in a subclause as described below.* - -*See also clause 2.4 for additional guidelines on use case format alternatives.* - -#### **3.4.a UseCaseName** - -*UseCaseName is the name of the use-case.* - -*"a" represents a number, starting at 1 and increasing by 1 with each new definition of a use case.* - -*If appropriate, sequence and state chart diagrams may be used.* - -*NOTE – Guidelines and criteria for use of sequence diagrams and state chart diagrams are for further study.* - -*Use case specifications should follow the conventions and templates defined in clause A.1.* - -*See also clause 2.4.a for additional guidelines on simplified use case formats.* - -### **A.3 Simplified requirements template** - -The simplified requirements template is an alternative template for use in cases when only the textual requirements are required. A separate template is defined to avoid ambiguity that would result by adding options in the full-form template described in clause A.2. - -### 1 Concepts and background - -*Define major goals and objectives and the applicable management interfaces (and reference points) for this specification. Use [ITU-T M.3200] categorization as a source for identifying the management service(s) supported by this interface.* - -*This clause should give a clear description of the users' benefit, i.e., the reason for performing this management service. Background and context should be added as necessary, but the explanatory and descriptive parts should be separated. Supporting background information, where required, should be placed in an appendix.* - -#### 1.a SubClauseTitle - -*SubClauseTitle is the name of the subclause.* - -*"a" represents a number, starting at 1 and increasing by 1 with each new subclause.* - -*The use of subclauses is optional.* - -### 2 Requirements - -#### 2.a SubSetTitle - -*SubSetTitle is the name of a sub-set of the business level requirements.* - -*"a" represents a number, starting at 1 and increasing by 1 with each new sub-set.* - -*The use of sub-sets is optional and all business level requirements can be stated in clause 2 (requirements).* - -*List major requirements in text, and identify use cases with actor/role and resources. The use cases should bring out high-level requirements and are distinguished from the specification requirements by not refining to lower levels. Policy-related information (e.g., security, persistence) are candidates for inclusion at this level. Numbering the requirements is required for traceability.* - -*Requirements should be specified as described in clause A.1.3. Within a requirements specification, it is suggested that requirements are written in the sequence of clause A.1.3 (either for the entire specification or for each sub-set).* - -*Use of requirements categories is optional, and – when used – a subset of the categories can be applied.* - -*As an example, conceptual requirement number 23 in a Recommendation tagged 'SM' would be specified as follows:* - -| Identifier | Definition | -|---------------|----------------------------------------------------------------------------------------------------------------------------------------------------| -| REQ-SM-CON-23 | A Service Order consists of a name, address, phone number, service description and an optional FAX number for contacts {T1M1.5 Document 246 11/96} | - -*One or more tables can be used with supportive text between tables as necessary.* - -*See also A.2/2.1.a for additional guidelines.* - -# Annex B - -## Analysis - -(This annex forms an integral part of this Recommendation.) - -## *B.1 Conventions* - -#### *B.1.1 Mandatory, optional and conditional qualifiers* - -## *B.2 Analysis template* - -### *1 Concepts and background* - -#### *1.a SubClauseTitle* - -### *2 Model* - -#### *2.1 Imported and associated information entities* - -#### *2.1.1 Imported information entities and local labels* - -#### *2.1.2 Associated information entities and local labels* - -#### *2.2 Class diagram* - -#### *2.2.1 Relationships* - -#### *2.2.2 Inheritance* - -#### *2.3 Class definitions* - -#### *2.3.a InformationObjectClassName* - -##### *2.3.a.1 Definition* - -##### *2.3.a.2 Attributes* - -##### *2.3.a.3 Attribute constraints* - -##### *2.3.a.4 Notifications* - -##### *2.3.a.5 State diagram* - -#### *2.4 Attribute definitions* - -#### *2.4.1 Attribute properties* - -#### *2.4.2 Constraints* - -#### *2.5 Common notifications* - -#### *2.5.1 Alarm notifications* - -#### *2.5.2 Configuration notifications* - -#### *2.6 System state model* - -### *3 Interface definition* - -#### *3.1 Class diagram representing interfaces* - -#### *3.2 Generic rules* - -#### *3.b Interface InterfaceName (supportQualifier)* - -#### *3.b.a Operation OperationName (supportQualifier)* - -##### *3.b.a.1 Definition* - -##### *3.b.a.2 Input parameters* - -##### *3.b.a.3 Output parameters* - -##### *3.b.a.4 Pre-condition* - -- 3.b.a.5 *Post-condition* -- 3.b.a.6 *Exceptions* -- 3.b.a.6.c *exceptionName* -- 3.b.a.7 *Constraints* -- 3.b.b *Notification NotificationName (supportQualifier)* -- 3.b.b.1 *Definition* -- 3.b.b.2 *Input parameters* -- 3.b.b.3 *Triggering event* -- 3.b.b.3.1 *From state* -- 3.b.b.3.2 *To state* -- 3.b.b.4 *Constraints* -- 3.c *Scenario* -- B.3 *IOC properties, inheritance and import* -- B.3.1 *Property* -- B.3.2 *Inheritance* -- B.3.3 *Import* - -The following are guidelines for specification of the results of the analysis phase. - -The analysis template is based on the 3rd Generation Partnership Project (3GPP) information service [b-3GPP TS 32.157] and augmented to meet additional requirements on the methodology (e.g., traceability). - -For a management interface specification, both subclauses 2.2 and 2.3 of "Analysis" template indicated in clause B.2 shall be used. For an information model (e.g., a network resource model), only subclause 2.2 shall be used. - -The analysis template uses Information Type as one characteristic to describe IOC attributes and operation/notification parameters. The valid Information Type(s) that can be used and their semantics are defined in Annex E. - -An example of the use of this template can be found in Appendix II. - -The constructs "Analysis|Information Service" and "Design|Solution" sets are used to denote the equivalent, but differently named, specifications developed by ITU-T and 3GPP. - -## **B.1 Conventions** - -#### **B.1.1 Mandatory, optional and conditional qualifiers** - -This clause defines a number of terms used to qualify the relationship between the Analysis|Information service, the Design|Solution sets and their impact on the interface implementations. The qualifiers defined in this clause are used to qualify agent behaviour only. This is considered sufficient for the specification of the management interfaces. - -Analysis specification|IS specifications define IOC attributes, interfaces, operations, notifications, operation parameters and notification parameters. They can have the following support/read/write qualifiers: M, O, CM, CO, C. - -Definition of qualifier M (Mandatory): - -- Used for items that shall be supported. - -Definition of qualifier O (Optional): - -- Used for items which may or may not be supported. - -Definition of qualifier CM (Conditional-Mandatory): - -- Used for items that are mandatory under certain conditions, specifically: - - All items having the support qualifier CM shall have a corresponding constraint defined in the Recommendation|IS specification. If the specified constraint is met, then the items shall be supported. - -Definition of qualifier CO (Conditional-Optional): - -- Used for items that are optional under certain conditions, specifically: - - All items having the support qualifier CO shall have a corresponding constraint defined in the Recommendation|IS specification. If the specified constraint is met, then the items may be supported. - -Definition of qualifier C (SS-Conditional): - -- Used for items that are only applicable for certain but not all Designs|Solutions sets (SSs). - -Design|SS specifications define the SS-equivalents of the IOC attributes, operations, notifications, operation parameters and notification parameters. These SS-equivalents can have the following support/read/write qualifiers: M, O, CM and CO. - -The mapping of the qualifiers of Analysis|IS-defined constructs to the qualifiers of the corresponding SS-constructs is defined as follows: - -- For qualifier M, O, CM and CO, each IS-defined item (operation and notification, input and output parameter of operations, input parameter of notifications, information relationship and information attribute) shall be mapped to its equivalent(s) in all SSs. Mapped equivalent(s) shall have the same qualifier as the IS-defined qualifier. -- For qualifier C, each IS-defined item shall be mapped to its equivalent(s) in at least one SS. Mapped equivalent(s) can have support qualifier M or O. - -Table B.1 defines the semantics of qualifiers of the equivalents, in terms of support from the agent perspective. - -**Table B.1 – Semantics for qualifiers used in Design|Solution sets** - -| Mapped SS equivalent | Mandatory | Optional | Conditional-Mandatory (CM) | Conditional-Optional (CO) | -|--------------------------------|--------------------------------------------|----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|------------------------------------------------------------------------------------------|--------------------------------------------------------------------------------------------------------------------------------------------------| -| Mapped notification equivalent | The agent shall generate the notification. | The agent may or may not generate it. | The agent shall generate this notification if the constraint for this item is satisfied. | The agent may choose whether or not to generate it. If the agent chooses to generate it, the constraint for this notification must be satisfied. | -| Mapped operation equivalent | The agent shall support it. | The agent may or may not support this operation. If the agent does not support this operation, the agent shall reject the operation invocation with a reason indicating that the agent does not support this operation. The rejection, | The agent shall support this operation if the constraint for this item is satisfied. | The agent may support this operation if the constraint for this item is satisfied. | - -**Table B.1 – Semantics for qualifiers used in Design|Solution sets** - -| Mapped SS equivalent | Mandatory | Optional | Conditional-Mandatory (CM) | Conditional-Optional (CO) | -|-------------------------------------------------------------------------------------------------------------|-----------------------------------------------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|--------------------------------------------------------------------------------------------------------|------------------------------------------------------------------------------------------------------| -| | | together with a reason, shall be returned to the manager. | | | -| Input parameter of the mapped operation equivalent | The agent shall accept and behave according to its value. | The agent may or may not support this input parameter. If the agent does not support this input parameter and if it carries meaning (i.e., it does not carry no-information semantics), the agent shall reject the invocation with a reason (that it does not support the parameter). The rejection, together with the reason, shall be returned to the manager. | The agent shall accept and behave according to its value if the constraint for this item is satisfied. | The agent may accept and behave according to its value if the constraint for this item is satisfied. | -| Input parameter of mapped notification equivalent
AND
output parameter of mapped operation equivalent | The agent shall supply this parameter. | The agent may supply this parameter. | The agent shall supply this parameter if the constraint for this item is satisfied. | The agent may supply this parameter if the constraint for this item is satisfied. | -| Mapped IOC attribute equivalent | The agent shall support it. | The agent may support it. | The agent shall support this attribute if the constraint for this item is satisfied. | The agent may support this attribute if the constraint for this item is satisfied. | - -### B.2 Analysis template - -| | -|--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -|

1 Concepts and background
This clause should provide an introduction to the management interface specification analysis.

1.a SubClauseTitle
SubClauseTitle is the name of a subclause.
"a" represents a number, starting at 1 and increasing by 1 with each new subclause.
The use of subclauses is optional.

2 Model
This clause shall be used for all specifications (both management interface specifications and information model only specifications).

2.1 Imported and associated information entities

2.1.1 Imported information entities and local labels
This subclause identifies a list of information entities (e.g., information object class, interface, attribute) that have been defined in other specifications and that are imported in the present (target) specification. All

| -|--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| - -*imported entities shall be treated as defined locally in the target specification. One usage for import is for inheritance purpose.* - -*Each element of this list is a pair (label reference, local label). The local label contains the name of the information entity that appears in the target specification, and the entity name in the local label shall be kept identical to the name defined in the original specification. The local label of imported information entities can then be used throughout the specification instead of the label reference.* - -*This information is provided in a table as shown below.* - -| Label reference | Local label | -|------------------------|--------------------| -| | | - -*Guidelines on entity import as well as IOC properties and inheritance can be found in Annex F.* - -#### **2.1.2 Associated information entities and local labels** - -*This clause identifies a list of information entities (e.g., information object class, interface, attribute) that have been defined in other specifications and that are associated with the information entities defined in the present (target) specification. For the associated information entity, only its properties, attribute of an instance of the associated information entity) used as associated information needs to be supported locally in the target specification.* - -*Each element of this list is a pair (label reference, local label). The label reference contains the name of the original specification where the information entity is defined, the information entity type and its name. The local label contains the name of the information entity that appears in the target specification. The local label can then be used throughout the target specification instead of that which appears in the label reference.* - -*This information is provided in a table as shown below.* - -| Label reference | Local label | -|------------------------|--------------------| -| | | - -#### **2.2 Class diagram** - -#### **2.2.1 Relationships** - -*This first set of diagrams represents all classes defined in this specification with all their relationships and all their attributes, including relationships with imported and associated information entities (if any). These diagrams shall contain information object class cardinalities (for associations as well as containment relationships) and may also contain role names. These shall be UML compliant classes diagrams (see also Annex C).* - -*Characteristics (relationships) of imported and associated information object classes need not be repeated in the diagram.* - -*Allowable classes are specified in Annex C.* - -*Use this as the first paragraph: "This clause depicts the set of classes (e.g., IOCs) that encapsulates the information relevant for this management specification. This clause provides an overview of the relationships between relevant classes in UML. Subsequent clauses provide more detailed specification of various aspects of these classes."* - -#### **2.2.2 Inheritance** - -*This second set of diagrams represents the inheritance hierarchy of all information object classes defined in this specification. These diagrams do not need to contain the complete inheritance hierarchy but shall at least contain the parent classes of all classes defined in the present document. By default, a class inherits from the class "top".* - -*Characteristics (attributes, relationships) of imported classes need not be repeated in the diagram.* - -*NOTE 1 – Some inheritance relationships presented in subclause 2.2.2 can be repeated in subclause 2.2.1 to enhance readability.* - -*Use "This subclause depicts the inheritance relationships." as the first paragraph.* - -#### 2.3 Class definitions - -Each class is defined using the following structure. - -Inherited items (attributes, etc.) shall not be shown, as they are defined in the parent classes(es) and thus valid for the subclass. - -#### 2.3.a InformationObjectClassName - -InformationObjectClassName is the name of the information object class. - -"a" represents a number, starting at 1 and increasing by 1 with each new definition of a class. - -##### 2.3.a.1 Definition - -This subclause is written in natural language. This subclause refers to the class itself. - -Optionally, information on traceability back to one or more requirements supported by this class can be defined here, in the following form: - -| Referenced specification | Requirement label | Comment | -|--------------------------|-------------------|---------| -| | | | - -##### 2.3.a.2 Attributes - -This clause presents the list of attributes, which are the manageable properties of the class. - -Each attribute is characterised by some of the attribute properties (see Table C.1), i.e., supportQualifier, isReadable, isWriteable, isInvariant and isNotifyable. - -The legal values and their semantics for attribute properties are defined in Annex C. - -This information is provided in a table as shown below. - -| Attribute name | Support qualifier | isReadable | isWriteable | isInvariant | isNotifyable | -|----------------|-------------------|------------|-------------|-------------|--------------| -| | | | | | | - -The attributeName indicates the name of the attribute. An attributeName with an "\*" sign indicates that this attribute is a naming attribute that will be used in the DN/RDN naming tree. The value of the naming attribute in each object instance shall be unique under its parent object instance. - -In case there is one or more attributes related to role (see clause 2.10 of Annex C), the attributes related to role shall be specified at the bottom of the table with a divider "Attribute related to role", as shown in the following example: - -| Attribute name | Support qualifier | isReadable | isWriteable | isInvariant | isNotifyable | -|----------------------------------|-------------------|------------|-------------|-------------|--------------| -| ... | | | | | | -| ... | | | | | | -| Attribute related to role | | | | | | -| ... | | | | | | -| ... | | | | | | - -##### 2.3.a.3 Attribute constraints - -This clause presents constraints for the attributes, and one usage is to present the predicates for conditional qualifiers (CM/CO). - -This information is provided in a table as shown below. - -| Name | Definition | -|------|------------| -| | | - -This subclause shall state "None." when there is no attribute constraint to define. - -##### 2.3.a.4 Notifications - -The subclause, for this class, presents one of the following options: - -- a) The class defines (and independent from those inherited) the support of a set of notifications that is identical to that defined in clause 2.5. In such case, use "The common notifications defined in clause 2.5 are valid for this class, without exceptions or additions." as the lone sentence of this clause. -- b) The class defines (and independent from those inherited) the support of a set of notifications that is a superset of that defined in clause 2.5. In such case, use "The common notifications defined in clause 2.5 are valid for this class. In addition, the following set of notification is also valid." as the lone paragraph of this clause. Then, define the 'additional' notifications in a table. See clause 2.5 for the notification table format. -- c) The class defines (and independent from those inherited) the support of a set of notifications that is not identical to, nor a superset of, that defined in clause 2.5. In such case, use "The common notifications defined in clause 2.5 are not valid for this class. The set of notifications defined in the following table is valid." as the lone paragraph of this clause. Specify the set of notifications in a table. See clause 2.5 for the notification table format. -- d) The class does not define (and independent from those inherited) the support of any notification. In such case, use "There is no notification defined." as the lone sentence of this clause. - -The notifications identified (options a-c above) in this subclause are notifications that can be emitted across the management interface, where the "object class" and "object instance" parameters of the notification header (see Note 2) of these notifications identify an instance of the IOC defined by the encapsulating subclause (i.e., subclause 2.3.a). - -The notifications identified (options a-c above) in this subclause may originate from implementation object(s) whose identifier is mapped in the implementation, to the object instance identifier used over the management interface may or may not be the same as that carried in the notification parameters "object class" and "object instance". Hence, the identification of notifications in this subclause does not imply nor identify those notifications as being originated from an instance of the class (or its direct or indirect derived class) defined by the encapsulating subclause (i.e., subclause 2.3.a). - -**NOTE 1** – This clause shall state "This class does not support any notification." (see option-c) when there is no notification defined for this class. (Note that if its parent class has defined some notifications, the implementation of this class is capable of emitting those inherited defined notifications.). - -**NOTE 2** – The notification header is defined in the notification integration reference point (IRP) information service [b-3GPP TS 32.302]. - -**NOTE 3** – The qualifier of a notification, specified in Notification Table, indicates if an implementation can generate a notification carrying the DN of the subject class. The qualifier of a notification, specified in a management specification, indicates if an implementation of the management specification can generate such notification in general. - -A Manager can receive notification-XYZ that carries DN (the "object class" and "object instance") of class-ABC instance if and only if: - -- 1) The class-ABC Notification Table defines the notification-XYZ and -- 2) The class-ABC instance implementation supports this notification-XYZ and -- 3) A management interface defines the notification-XYZ and -- 4) The management interface implementation supports this notification-XYZ. - -##### 2.3.a.5 State diagram - -This subclause contains state diagrams. A state diagram of an information object class defines permitted states of this information object class and the transitions between those states. A state is expressed in terms of individual attribute values or a combination of attribute values or involvement in relationships of the information object class being defined. This shall be a UML compliant state machine diagram (see 15.4 of [UML2]). - -This subclause shall state "None." when there is no State diagram defined. - -#### 2.4 Attribute definitions - -#### 2.4.1 Attribute properties - -It has a lone paragraph "The following table defines the properties of attributes that are specified in the present document." - -Each information attribute is defined using the following structure. - -Inherited attributes shall not be shown, as they are defined in the parent class(es) and thus valid for this class. - -An attribute has properties (Table C.1). Some properties of an attribute are defined in 2.3.a.2 (e.g., Support Qualifier). The remaining properties of an attribute (e.g., documentation, default value) are defined here. - -The information is provided in a table. In case a) attributes of the same name are specified in more than one class and b) the attributes have different properties, then the attribute names (first column) should be prefixed with the class name followed by a period. - -An example is given below: - -| Attribute Name | Documentation and Allowed Values | Properties | -|----------------|----------------------------------------|-----------------------------------------------------------------------------------------------------------------| -| xyzId | It identifies ...
allowedValues ... | type: Integer
multiplicity: ...
isOrdered: ...
isUnique: ...
defaultValue: ...
isNullable: False | -| | | | -| | | | - -In case there is one or more attributes related to role (see clause 2.10 of Annex C), the attributes related to role shall be specified at the bottom of the table with a divider "Attribute related to role". See example below. - -| Attribute Name | Documentation and Allowed Values | Properties | -|----------------------------------|----------------------------------------|-----------------------------------------------------------------------------------------------------------------| -| abc | It identifies ...
allowedValues ... | type: Integer
multiplicity: ...
isOrdered: ...
isUnique: ...
defaultValue: ...
isNullable: False | -| Attribute Related to Role | | | -| aEnd | It identifies ...
allowedValues ... | type: DN
multiplicity: ...
isOrdered: ...
isUnique: ...
defaultValue: ...
isNullable: False | - -This clause shall state "None." if there is no attribute to define. - -#### 2.4.2 Constraints - -This clause indicates whether there are any constraints affecting attributes. Each constraint is defined by a tuple (propertyName, affected attributes, propertyDefinition). PropertyDefinitions are expressed in natural language. - -This information is provided in a table as shown below. - -| Name | Affected attribute(s) | Definition | -|------|-----------------------|------------| -| | | | - -This subclause shall state "None." if there is no constraint. - -#### 2.5 Common notifications - -This clause presents a list of notifications that can be referred to by any class defined in the specification. This information is provided in a table as shown below. - -| Name | Qualifier | Notes | -|------|-----------|-------| -| | | | - -*This subclause shall state "None." if there are no common notifications.* - -#### 2.5.1 Alarm notifications - -*The following quoted text shall be copied as the only paragraph of this clause.* - -"This clause presents a list of notifications, defined in [x], that a manager can receive. The notification header attribute objectClass/objectInstance, defined in [y], shall capture the DN of an instance of a class defined in this specification." - -*The information is provided in a table as shown below.* - -| Name | Qualifier | Notes | -|------|-----------|-------| -| | | | - -#### 2.5.2 Configuration notifications - -*The following quoted text shall be copied as the only paragraph of this clause.* - -"This clause presents a list of notifications, defined in [x], that IRPManager can receive. The notification header attribute objectClass/objectInstance, defined in [z], shall capture the DN of an instance of a class defined in this specification." - -*The information is provided in a table as shown below.* - -| Name | Qualifier | Notes | -|------|-----------|-------| -| | | | - -#### 2.6 System state model - -*Some configurations of information are special or complex enough to justify the usage of a state diagram to clarify them. A state diagram in this subclause defines permitted states of the system and the transitions between those states. A state is expressed in terms of a combination of attribute values constraints or involvement in relationships of one or more information object classes.* - -### 3 Interface definition - -*This clause shall be used for all management interface specifications and optional for information model only specifications.* - -#### 3.1 Class diagram representing interfaces - -*Each interface is defined in one or more UML-compliant classes diagrams (see also Annex C, and 10.2 of [OMG UML1]).* - -#### 3.2 Generic rules - -*The following rules are relevant to all specifications. They shall simply be copied as part of the specification.* - -*Rule 1: Each operation with at least one input parameter supports a pre-condition `valid_input_parameter` which indicates that all input parameters shall be valid with regard to their information type. Additionally, each such operation supports an exception `operation_failed_invalid_input_parameter` which is raised when pre-condition `valid_input_parameter` is false. The exception has the same entry and exit state.* - -*Rule 2: Each operation with at least one optional input parameter supports a set of pre-conditions `supported_optional_input_parameter_xxx` where "xxx" is the name of the optional input parameter and the pre-condition indicates that the operation supports the named optional input parameter. Additionally, each such operation supports an exception `operation_failed_unsupported_optional_input_parameter_xxx` which is raised when (a) the pre-condition `supported_optional_input_parameter_xxx` is false and (b) the named optional input parameter is carrying information. The exception has the same entry and exit state.* - -*Rule 3: Each operation shall support a generic exception `operation_failed_internal_problem` which is raised when an internal problem occurs and that the operation cannot be completed. The exception has the same entry and exit state.* - -*NOTE – Security considerations and resulting generic rules are for further study.* - -#### 3.b Interface `InterfaceName` (`supportQualifier`) - -*`InterfaceName` is the name of the interface followed by a qualifier indicating whether the interface is Mandatory (M), Optional (O), Conditional-Mandatory (CM), Conditional-Optional (CO), or SS-Conditional (C) (see also clause B.1).* - -*"b" represents a number, starting at 3 and increasing by 1 with each new definition of an interface.* - -*Each interface is defined by its name and by a sequence of operations or notifications.* - -*If the interface is related to operation(s), the following subclause 3.b.a "`Operation OperationName` (`supportQualifier`)" shall be applied.* - -*If the interface is related to notification(s), subclause 3.b.b "`Notification NotificationName` (`supportQualifier`)" below shall be applied.* - -#### 3.b.a Operation `OperationName` (`supportQualifier`) - -*`OperationName` is the name of the operation followed by a qualifier indicating whether the operation is Mandatory (M), Optional (O), Conditional-Mandatory (CM), Conditional-Optional (CO), or SS-Conditional (C) (see clause B.1).* - -*"a" represents a number, starting at 1 and increasing by 1 with each new definition of an operation.* - -##### 3.b.a.1 Definition - -*This subclause is written in natural language.* - -*Information on traceability back to one or more requirements supported by this operation should also be defined here, in the following form:* - -| Reference | Requirements label | Comment | -|-----------|--------------------|---------| -| | | | - -##### 3.b.a.2 Input parameters - -*List of input parameters of the operation. Each element is a tuple (Parameter Name, Support Qualifier, Information Type (see Annex E and Note in clause E.2) and an optional list of Legal Values supported by the parameter, Comment). Legal values for the Support Qualifier are: Legal Values for the Support Qualifier are: Mandatory (M), Optional (O), Conditional-Mandatory (CM), Conditional-Optional (CO), or SS-Conditional (C) (see also in clause B.1).* - -*This information is provided in a table as shown below.* - -| Parameter Name | Support Qualifier | Information Type/
Legal Values | Comment | -|----------------|-------------------|-----------------------------------|---------| -| | | | | - -*NOTE – Information Type qualifies the parameter of Parameter Name. In the case where the Legal Values can be enumerated, each element is a pair (Legal Value Name, Legal Value Semantics), unless a Legal Value Semantics applies to several values in which case the definition is provided only once. When the Legal Values cannot be enumerated, the list of Legal Values is defined by a single definition.* - -##### 3.b.a.3 Output parameters - -*List of output parameters of the operation. Each element is a tuple (Parameter Name, Support Qualifier, Matching Information / Information Type (see Annex E and Note in clause E.2) and an optional list of Legal Values supported by the parameter, Comment). Legal values for the Support Qualifier are: Mandatory (M), Optional (O), Conditional-Mandatory (CM), Conditional-Optional (CO), or SS-Conditional (C) (see also clause B.1).* - -*This information is provided in a table as shown below.* - -| Parameter name | Support qualifier | Matching information/
Information type/
Legal values | Comment | -|----------------|-------------------|------------------------------------------------------------|---------| -| | | | | - -*NOTE – Information Type qualifies the parameter of Parameter Name. In the case where the Legal Values can be enumerated, each element is a pair (Legal Value Name, Legal Value Semantics), unless a Legal Value Semantics applies to several values, in which case the definition is provided only once. When the Legal Values cannot be enumerated, the list of Legal Values is defined by a single definition.* - -*This table shall also include a special 'parameter status' to indicate the completion status of the operation (success, partial success, failure reason, etc.).* - -##### 3.b.a.4 Pre-condition - -*A pre-condition is a collection of assertions joined by AND, OR, and NOT logical operators. The pre-condition must be held to be true before the operation is invoked. An example is given here below:* - -``` -notificationCategoriesNotAllSubscribed OR -notificationCategoriesParameterAbsentAndNotAllSubscribed -``` - -Each assertion is defined by a pair (name, definition). All assertions constituting the pre-condition are provided in a table as shown below. - -| Assertion name | Definition | -|----------------------------------------------------------|----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| notificationCategoriesNotAllSubscribed | At least one notificationCategory identified in the notificationCategories input parameter is supported by IRP Agent and is not a member of the ntfNotificationCategorySet attribute of an NtfSubscription which is involved in a subscription relationship with the NtfSubscriber identified by the managerReference input parameter. | -| notificationCategoriesParameterAbsentAndNotAllSubscribed | The notificationCategories input parameter is absent and at least one notificationCategory supported by IRP Agent is not a member of the ntfNotificationCategorySet attribute of an ntfSubscription which is involved in a subscription relationship with the NtfSubscriber identified by the managerReference input parameter. | - -##### 3.b.a.5 Post-condition - -A post-condition is a collection of assertions joined by AND, OR, and NOT logical operators. The post-condition must be held to be true after the completion of the operation. When nothing is said in a post-condition regarding an information entity, the assumption is that this information entity has not changed compared to what is stated in the pre-condition. An example is given here below: - -``` -subscriptionDeleted OR allSubscriptionDeleted -``` - -Each assertion is defined by a pair (name, definition). All assertions constituting the post-condition are provided in a table as shown below. - -| Assertion name | Definition | -|------------------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| subscriptionDeleted | The ntfSubscription identified by subscriptionId input parameter is no more involved in a subscription relationship with the ntfSubscriber identified by the managerReference input parameter and has been deleted. If this ntfSubscriber has no more ntfSubscription, it is deleted as well. | -| allSubscriptionDeleted | In the case subscriptionId input parameter was absent, the ntfSubscriber identified by the managerReference input parameter is no longer involved in any subscription relationship and is deleted, the corresponding ntfSubscription have been deleted as well. | - -##### 3.b.a.6 Exceptions - -List of exceptions that can be raised by the operation. Each element is a tuple (exceptionName, condition, ReturnedInformation, exitState). - -###### 3.b.a.6.c exceptionName - -ExceptionName is the name of an exception. - -"c" represents a number, starting at 1 and increasing by 1 with each new definition of an exception. - -*This information is provided in a table as shown below.* - -| Exception name | Definition | | -|----------------|-------------|--| -| | Condition | | -| | Return info | | -| | Exit state | | -| | Condition | | -| | Return info | | -| | Exit state | | - -##### 3.b.a.7 Constraints - -*This subclause presents constraints for the operation or its parameters.* - -*NOTE – This subclause does not need to be present when there are no constraints to be defined.* - -#### 3.b.b Notification NotificationName (supportQualifier) - -*NotificationName is the name of the notification followed by a qualifier indicating whether the notification is Mandatory (M), Optional (O), Conditional-Mandatory (CM), Conditional-Optional (CO) or SS-Conditional (C) (see clause B.1).* - -*"b" represents a number, starting at 1 and increasing by 1 with each new definition of a notification.* - -##### 3.b.b.1 Definition - -*This subclause is written in natural language.* - -*Information on traceability back to one or more requirements supported by this notification should also be defined here, in the following form:* - -| Reference | Requirement label | Comment | -|-----------|-------------------|---------| -| | | | - -##### 3.b.b.2 Input parameters - -*List of input parameters of the notification. Each element is a tuple (Parameter Name, Qualifiers, Matching Information/Information Type (see Annex E and Note in clause E.2) and an optional list of Legal Values supported by the parameter, Comment).* - -*The column "Qualifiers" contains the two qualifiers, Support Qualifier (see clause B.1) and Filtering Qualifier, separated by a comma. The Filtering Qualifier indicates whether the parameter of the notification can be filtered or not. Values are Yes (Y) or No (N).* - -*This information is provided in a table as shown below.* - -| Parameter name | Qualifiers | Matching information/
Information type/
Legal values | Comment | -|----------------|------------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|---------| -| alarmType | M,Y | AlarmInformation.eventType /
ENUMERATED /
"Communications Alarm": a
communication error alarm.
"Processing Error Alarm": a
processing error alarm.
"Environmental Alarm": an
environmental violation
alarm.
"Quality Of Service Alarm": a
quality of service violation
alarm.
"Equipment Alarm": an alarm
related to equipment
malfunction. | | - -*NOTE – Information Type qualifies the parameter of Parameter Name. In the case where the Legal Values can be enumerated, each element is a pair (Legal Value Name, Legal Value Semantics), unless a Legal Value Semantics applies to several values, in which case the definition is provided only once. When the Legal Values cannot be enumerated, the list of Legal Values is defined by a single definition.* - -##### 3.b.b.3 Triggering event - -*The triggering event for the notification to be sent is the transition from the information state defined by the "from state" subclause to the information state defined by the "to state" subclause.* - -###### 3.b.b.3.1 From state - -*This subclause is a collection of assertions joined by AND, OR, and NOT logical operators. An example is given here below:* - -`alarmMatched AND alarmInformationNotCleared` - -*Each assertion is defined by a pair (name, definition). All assertions constituting the state "from state" are provided in a table as shown below.* - -| Assertion name | Definition | -|----------------|------------| -| | | - -###### 3.b.b.3.2 To state - -*This subclause is a collection of assertions joined by AND, OR and NOT logical operators. When nothing is said in a to-state regarding an information entity, the assumption is that this information entity has not changed compared to what is stated in the from state.* - -*Each assertion is defined by a pair (name, definition). All assertions constituting the state "to state" are provided in a table as shown below.* - -| Assertion name | Definition | -|----------------|------------| -| | | - -##### 3.b.b.4 Constraints - -*This subclause presents constraints for the notification or its parameters.* - -*NOTE – This subclause does not need to be present when there are no constraints to be defined.* - -#### 3.c Scenario - -*This subclause contains one or more sequence diagrams, each describing a possible scenario. These shall be UML-compliant sequence diagrams. This is an optional subclause.* - -### B.3 IOC properties and inheritance - -#### B.3.1 Property - -The following guidelines are based on Annex G of [b-3GPP TS 32.150]. - -The properties of an IOC (excluding Support IOC) are specified in terms of the following: - -- a) An IOC attribute(s) including its semantics and syntax, its legal value ranges and support qualifications. The IOC attributes are not restricted to Configuration Management but also include those related to, for example, 1) Performance Management (i.e., measurement types), 2) Trace Management and 3) Accounting Management. -- b) The non-attribute-specific behaviour associated with an IOC (see Note 1). - -NOTE 1 – As an example, the Link between A and B is optional. It is mandatory if the A instance belongs to one ManagedElement instance while the B instance belongs to another ManagedElement instance. This Link behaviour is a non-attribute-specific behaviour. It is expected that this behaviour, like others, will be inherited. - -- c) An IOC relationship(s) with another IOC(s). -- d) An IOC notification type(s) and their qualifications. -- e) An IOC's relation with its parents (see Note 2). There are three mutually exclusive cases: - - 1) The IOC is abstract and no parents have yet been designated. - - 2) The IOC is abstract and all of the possible parent(s) have been designated and whether subclass IOCs can be designated as a root IOC. - - 3) The IOC is not abstract and all of the possible parent(s) have been designated and whether the IOC can be designated as a root IOC. - -An IOC instance is either a root IOC or it has one and only one parent. - -NOTE 2 – The parent and child relation in this subclause is the parent name-containing the child relation. - -- f) An IOC's relation with its children. There are three mutually exclusive cases: - - 1) An IOC shall not have any children (name-containment relation) IOCs. - - 2) An IOC can have children IOC(s). The maximum number of instances per children IOC can be specified. An IOC may designate that vendor-specific objects are not allowed as children IOCs. - - 3) An IOC can only have the specific children IOC(s) (or their subclasses). The maximum number of instances per children IOC can be specified. An IOC may designate that vendor-specific objects are not allowed as children IOCs. -- g) Whether An IOC can be instantiated or not (i.e., whether an IOC is an abstract IOC). -- h) An attribute for naming purpose. - -#### B.3.2 Inheritance - -The following guidelines are based on Annex G of [b-3GPP TS 32.150]. - -An IOC (the subclass) inherits from another IOC (the superclass) in that the subclass shall have all the properties of the superclass. - -The subclass can change the inherited support-qualification(s) from optional to mandatory but not vice versa. The subclass can change the inherited support-qualification from conditional-optional to conditional-mandatory but not vice versa. - -An IOC can be a superclass of many IOC(s). A subclass cannot have more than one superclass. - -The subclass can: - -- a) Add (compared to those of its superclass) unique attributes including their behaviour, legal value ranges and support-qualifications. Each additional attribute shall have its own unique attribute name (among all added and inherited attributes). -- b) Add non-attribute behaviour on an IOC basis. This behaviour may not contradict inherited superclass behaviour. -- c) Add relationship(s) with IOC(s). Each additional relationship shall have its own unique name (among all added and inherited relations). -- d) Add additional notification types and their qualifications. -- e) Designate all of the possible parent(s) (and their subclasses) if the superclass has Property-e-1 such that an IOC will have Property-e-2 or Property-e-3. Restrict possible parent(s) (and their subclasses) and/or remove the capability of the subclass from being a root IOC, if the superclass has Property-e-2 or Property-e-3. -- f) Add children IOC(s) if the superclass has Property-f-2 such that an IOC will have Property-f-3. Restrict the allowed children IOC(s) (or their subclasses) if the superclass has Property-f-3. -- g) Specify whether an IOC can be instantiated or not (i.e., the IOC is an abstract IOC). -- h) Restrict the legal value range of a superclass attribute that has a legal value range. - -#### **B.3.3 Import** - -The following guidelines are based on Annex I of [b-3GPP TS 32.150]. - -To facilitate re-use of entity definitions among IRP specifications, an import mechanism is used. When an IRP specification (the subject IRP specification) imports an entity defined in another IRP specification, the subject IRP specification is considered to have defined the imported entity in its specification. Furthermore, the subject IRP specification cannot change the properties of this imported entity. If it requires an entity that is not identical but similar to the imported entity, it should define a new entity that inherits the imported entity and introduce changes in the new entity definition. - -# Annex C - -## MIISM UML repertoire - -(This annex forms an integral part of this Recommendation.) - -The following are guidelines for specification of the results of the analysis phase as based on 3GPP unified modelling language (UML) repertoire [b-3GPP TS 32.156]. - -### C.1 Introduction - -UML provides a rich set of concepts, notations and model elements to model distributed systems. Usage of all UML notations and model elements is not necessary for the purpose of analysis specifications. This annex documents the necessary and sufficient set of UML notations and model elements, including the ones built by the UML extension mechanism <>, for use by development of protocol-neutral specifications. Collectively, this set of notations and model elements is called the UML modelling repertoire. - -Recommendations following the methodology shall employ the UML notation and model elements of this repertoire and may also employ other UML notation and model elements considered necessary. - -### C.2 Basic model elements - -#### C.2.1 General - -UML has defined a number of basic model elements. This clause lists the selected subset for use in specifications based on the repertoire. The semantics of these selected basic model elements are defined in [OMG UML1]. - -For each basic model element listed, there are three parts. The first part contains its description. The second part contains its graphical notation examples and the third part contains the rule, if any, recommended for labelling or naming it. - -The graphical notation has the following characteristics: - -- a) Subclause 7.2.7 of [OMG UML2] specifies "A class is often shown with three compartments. The middle compartment holds a list of attributes while the bottom compartment holds a list of operations" and "Additional compartments may be supplied to show other details". This repertoire only allows the use of the name (top) compartment and attribute (middle) compartment. The operation (bottom) compartment may be present but is always empty, as shown in the figure below. - -![UML class diagram with three compartments: top compartment contains '', middle compartment contains 'Attribute', and bottom compartment is empty.](6757222e979ee95c44354a897c5cc1c1_img.jpg) - -A UML class diagram consisting of a rectangle divided into three horizontal compartments. The top compartment contains the text "". The middle compartment contains the text "Attribute". The bottom compartment is empty. - -UML class diagram with three compartments: top compartment contains '', middle compartment contains 'Attribute', and bottom compartment is empty. - -- b) Classes may or may not have attributes. The graphical notation of a class may show an empty attribute (middle) compartment even if the class has attributes, as shown in figure below. - -![UML class diagram with three compartments: top compartment contains '', middle compartment is empty, and bottom compartment is empty.](fb5442ad7130829bed9e3682ccb84c87_img.jpg) - -A UML class diagram consisting of a rectangle divided into three horizontal compartments. The top compartment contains the text "". The middle compartment is empty. The bottom compartment is empty. - -UML class diagram with three compartments: top compartment contains '', middle compartment is empty, and bottom compartment is empty. - -- c) The visibility symbol shall not appear along with the class attribute, as shown below. - -![UML class diagram showing a class named 'Xvz' with the stereotype '«InformationObjectClass»'. The class has three compartments: the top compartment contains the stereotype and name, the middle compartment contains attributes 'a', 'b', and 'c', and the bottom compartment is empty.](70a863dc6cd47bac82c12162a9479aac_img.jpg) - -UML class diagram showing a class named 'Xvz' with the stereotype '«InformationObjectClass»'. The class has three compartments: the top compartment contains the stereotype and name, the middle compartment contains attributes 'a', 'b', and 'c', and the bottom compartment is empty. - -- d) The use of the decoration, i.e., the symbol in the name (top) compartment, is optional. - -#### C.2.2 Attribute - -##### C.2.2.1 Description - -It is a typed element representing a property of a class. See 10.2.5 Property of [OMG UML1]. - -An element that is typed implies that the element can only refer to a constrained set of values. - -See 10.1.4 Type of [OMG UML1] for more information on type. - -See clauses C.3.5 and C.4.3 for predefined data types and user-defined data types that can apply type information to an element. - -Table C.1 captures the properties of this modelled element. - -**Table C.1 – Attribute properties** - -| Property name | Description | Legal values | -|---------------|----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|------------------------------------------------------------------| -| type | Refers to a predefined (see clause C.4.3) or user defined data type (see clause C.3.5. See also clause 7.3.44 of [OMG-UML2]; inherited from StructuralFeature. | N/A | -| allowedValues | Specifies restrictions to the data type defined by type. This property is useful when no dedicated data type, that includes the restriction, shall be defined. The property may be absent when no restrictions are defined.

(When specific values or restrictions are listed, it means that other values are not allowed) | Dependent on type | -| defaultValue | Identifies a value at specification time that is used at object creation time under conditions defined in Annex G.
If there is no defined default value, the property shall be omitted from the attribute description or specified as 'defaultValue: None.' | No value (default) or a value that is dependent on allowedValues | -| multiplicity | Defines the number of values the attribute can simultaneously have. See clause 7.3.44 of [OMG UML2]; inherited from StructuralFeature. | See clause C.2.9
Default is 1 | -| isOrdered | For a multi-valued multiplicity; this specifies if the values of this attribute instance are sequentially ordered. See clause 7.3.44 and its Table 7.1 of [OMG UML2].
If the property is present for attributes with a multiplicity of greater than "1", it shall be set to either "True" or "False". It shall not be set to "N/A". | True, False (default) | - -**Table C.1 – Attribute properties** - -| Property name | Description | Legal values | -|------------------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|---------------------------| -| isUnique |

For a multi-valued multiplicity, this specifies if the values of this attribute instance are unique (i.e., no duplicate attribute values). See clause 7.3.44 and its Table 7.1 of [OMG UML2].

If the property is present for attributes with a multiplicity of greater than "1", it shall be set to either "True" or "False". It shall not be set to "N/A".

| True (default), False | -| isNullable |

Identifies if an attribute can carry no information. The implied meaning of carrying "no information" is context sensitive and is not defined in this Recommendation.

Note, the property "isNullable: True" is semantically identical to adding the value "0" to the "multiplicity" specified. Usage of the "multiplicity" property is preferred to express an attribute can have no value or carry no information.

| True, False (default) | -| passedById | See Table C.4: passedById property | True, False (default) | -| isInvariant |

If an attribute has an "isInvariant: True" property, its value can be set only upon object creation. After object creation, the initial value cannot be modified.

If an attribute has an "isInvariant: False" property, its value can be set at object creation time. After object creation, the initial value can be modified.

Details on how initial values are provided upon object creation are specified in Annex G.

| True, False (default) | -| isWritable |

If an attribute has an "isWritable: True" property, a manager can set its value upon object creation. After object creation, a manager can modify the initial value if "isInvariant: False". If "isInvariant: True", a manager cannot modify the initial value. The "isInvariant" property supersedes hence the "isWritable" property.

If an attribute has an "isWritable: False" property, a manager cannot set the value upon object creation nor modify it later. A "isWritable: True" property might be restricted by access control.

| True, False (default) | -| isReadable |

Specifies if the attribute can be read by the manager.

A "isReadable: True" property might be restricted by access control.

| True (default), False | -| isNotifiable | Identifies if a notification shall be sent in case of a value change. | True (default), False | -| documentation |

Contains a textual description of the attribute.

Should refer (to enable traceability) to the specific requirement.

| Any | -| supportQualifier | Identifies the required support of the attribute. See also clause 7. | M, O (default), CM, CO, C | - -##### C.2.2.2 Example - -This example shows three attributes, i.e., a, b and c, listed in the attribute (the second) compartment of the class Xyz. - -![UML class diagram showing a class named Xyz with three attributes: a, b, and c.](834fb96b114b8fdc001625e1ae28e8b1_img.jpg) - -The diagram shows a class box for 'Xyz'. The top compartment contains the stereotype «InformationObjectClass» and the class name 'Xyz'. The second compartment contains the attributes 'a', 'b', and 'c' listed vertically. The third compartment is empty. - -UML class diagram showing a class named Xyz with three attributes: a, b, and c. - -**Figure C.1 – Attribute notation** - -##### C.2.2.3 Name style - -An attribute name shall use the LCC style. - -Well known abbreviation (WKA) is treated as a word if used in a name. However, WKA shall be used as is (its letter case cannot be changed) except when it is the first word of a name; and if so, its first letter must be in lower case. - -#### C.2.3 Association relationship - -##### C.2.3.1 Description - -It shows a relationship between two classes and describes the reasons for the relationship and the rules that might govern that relationship. - -It has ends. Its end, the association end(s), specifies the role that the object at one end of a relationship performs. Each end of a relationship has properties that specify the role (see clause C.2.10), multiplicity (see clause C.2.9), visibility and navigability (see the arrow symbol used in Figure C.3 – Unidirectional association relationship notation) and may have constraints. Note that visibility shall not be used in models based on this Repertoire (see paragraph 3 of clause C.2.1). - -See 7.3.3 Association of [OMG UML2]. - -The three examples given in Figures C.2 to C.4 show a binary association between two model elements. The association can include the possibility of relating a model element to itself. - -The first example (Figure C.2) shows a bidirectional navigable association in that each model element has a pointer to the other. The second example (Figure C.3) shows a unidirectional association (shown with an open arrow at the target model element end) in that only the source model element has a pointer to the target model element and not vice-versa. The third example (Figure C.4) shows a bidirectional non-navigable association in that each model element does not have a pointer to the other; i.e., such associations are just for illustration purposes. - -##### C.2.3.2 Example - -An association shall have an indication of cardinality (see clause C.2.9). - -It shall, except the case of non-navigable association, have an indication of the role name (see clause C.2.10). The model element involved in an association is said to be "playing a role" in that association. The role has a name such as +class3 in the first example below. Note that the "+" character in front of the role name, indicating the visibility, is ignored. - -![Figure C.2: Bidirectional association relationship notation. Two identical diagrams showing Class3 and Class4 connected by a bidirectional association line. In both, Class3 is on the left and Class4 is on the right. The association has role names '+ class3' and '+ class4'. The multiplicity at the Class3 end is 0..1, and at the Class4 end is *.](cbb2d311b20781a595488445ded48d0a_img.jpg) - -``` - -classDiagram - Class3 "0..1" <--> "*" Class4 : + class3 / + class4 - Class3 "0..1" <--> "*" Class4 : + class3 / + class4 - -``` - -Figure C.2: Bidirectional association relationship notation. Two identical diagrams showing Class3 and Class4 connected by a bidirectional association line. In both, Class3 is on the left and Class4 is on the right. The association has role names '+ class3' and '+ class4'. The multiplicity at the Class3 end is 0..1, and at the Class4 end is \*. - -Figure C.2 – Bidirectional association relationship notation - -![Figure C.3: Unidirectional association relationship notation. Class3 is on the left and Class4 is on the right. A unidirectional association line points from Class3 to Class4. The association is named 'Class3IsRelatedToClass4'. The multiplicity at the Class3 end is *, and at the Class4 end is 0..1. A role name '+ class4' is present at the Class4 end.](f5a5f52bc25d95a7f616290c99e88ae6_img.jpg) - -``` - -classDiagram - Class3 "*" --> "0..1" Class4 : Class3IsRelatedToClass4 / + class4 - -``` - -Figure C.3: Unidirectional association relationship notation. Class3 is on the left and Class4 is on the right. A unidirectional association line points from Class3 to Class4. The association is named 'Class3IsRelatedToClass4'. The multiplicity at the Class3 end is \*, and at the Class4 end is 0..1. A role name '+ class4' is present at the Class4 end. - -Figure C.3 – Unidirectional association relationship notation - -![Figure C.4: Non-navigable association relationship notation. Class3 is on the left and Class4 is on the right. A non-navigable association line connects them. The multiplicity at the Class3 end is 1, and at the Class4 end is *.](cf8bd014a50b7c69435e804f67f9617f_img.jpg) - -``` - -classDiagram - Class3 "1" -- "*" Class4 - -``` - -Figure C.4: Non-navigable association relationship notation. Class3 is on the left and Class4 is on the right. A non-navigable association line connects them. The multiplicity at the Class3 end is 1, and at the Class4 end is \*. - -Figure C.4 – Non-navigable association relationship notation - -Note that some tools do not use arrows in the UML graphical representation for bidirectional associations. Therefore, absence of arrows is not, but absence of role names is, an indication of a non-navigable association. - -##### C.2.3.3 Name style - -An Association can have a name. The use of Association name is optional. Its name style is UCC style. - -A role name shall use the LCC style. - -#### C.2.4 Aggregation association relationship - -##### C.2.4.1 Description - -It shows a class as a part of or subordinate to another class. - -An aggregation is a special type of association in which objects are assembled or configured together to create a more complex object. Aggregation protects the integrity of an assembly of objects by defining a single point of control called aggregate, in the object that represents the assembly. - -See 7.3.2 AggregationKind (from Kernel) of [OMG UML2]. - -##### C.2.4.2 Example - -Figure C.5 shows that a hollow diamond attached to the end of a relationship is used to indicate an aggregation. The diamond is attached to the class that is the aggregate. The aggregation association shall have an indication of cardinality at each end of the relationship (see clause C.2.9). - -![Figure C.5: Aggregation association relationship notation. Class12 is on the left and Class13 is on the right. A hollow diamond is attached to the Class12 end, indicating aggregation. The multiplicity at the Class12 end is 1, and at the Class13 end is *. A role name '+ class13' is present at the Class13 end.](c8fcc1ae5d86caaae5607b58d16be8e4_img.jpg) - -``` - -classDiagram - Class12 "1" o-- "*" Class13 : + class13 - -``` - -Figure C.5: Aggregation association relationship notation. Class12 is on the left and Class13 is on the right. A hollow diamond is attached to the Class12 end, indicating aggregation. The multiplicity at the Class12 end is 1, and at the Class13 end is \*. A role name '+ class13' is present at the Class13 end. - -Figure C.5 – Aggregation association relationship notation - -##### C.2.4.3 Name style - -An Association can have a name. Use of Association name is optional. Its name style is UCC. - -#### C.2.5 Composite aggregation association relationship - -##### C.2.5.1 Description - -A composite aggregation association is a strong form of aggregation that requires a part instance be included in at most one composite at a time. If a composite is deleted, all of its parts are deleted as well. - -A composite aggregation shall contain a description of its use. - -See 7.3.3 Association (from Kernel) of [OMG UML2]. - -##### C.2.5.2 Example - -A filled diamond attached to the end of a relationship (see Figure C.6) is used to indicate a composite aggregation. The diamond is attached to the class that is the composite. The composition association shall have an indication of cardinality at each end of the relationship (see clause C.2.9). - -![UML Class Diagram showing a composite aggregation association between ManagedElement and ManagedElementPropertySet.](9edb407536d4d4d4a6ac391527af047c_img.jpg) - -The diagram shows two classes: «InformationObjectClass» **ManagedElement** and «InformationObjectClass» **ManagedElementPropertySet**. A relationship line connects them. On the **ManagedElement** side, there is a filled diamond, indicating it is the composite. The cardinality at this end is '1'. The relationship is named '+ managedElementPropertySet' near the **ManagedElementPropertySet** end. The cardinality at the **ManagedElementPropertySet** end is '0..1'. - -UML Class Diagram showing a composite aggregation association between ManagedElement and ManagedElementPropertySet. - -Figure C.6 – Composite aggregation association relationship notation - -##### C.2.5.3 Name style - -An Association can have a name. The use of Association name is optional. Its name style is UCC. - -#### C.2.6 Generalization relationship - -##### C.2.6.1 Description - -Generalization indicates a relationship in which one class (the child) inherits from another class (the parent). - -See 7.3.20 Generalization of [OMG UML2]. - -##### C.2.6.2 Example - -The example in Figure C.7 shows a generalization relationship between a more general model element (the **IRPAgent**) and a more specific model element (the **IRPAgentVendorA**) that is fully consistent with the first element and that adds additional information. - -![UML Class Diagram showing a generalization relationship between IRPAgent and IRPAgentVendorA.](4f6da7645cec40b72385c93b2f4dc4be_img.jpg) - -The diagram shows two classes: «InformationObjectClass» **IRPAgent** and «InformationObjectClass» **IRPAgentVendorA**. A relationship line connects them with an open triangle arrowhead pointing towards **IRPAgent**, indicating that **IRPAgentVendorA** inherits from **IRPAgent**. - -UML Class Diagram showing a generalization relationship between IRPAgent and IRPAgentVendorA. - -Figure C.7 – Generalization relationship notation - -##### C.2.6.3 Name style - -Generalization has no name, so there is no name style. - -#### C.2.7 Dependency relationship - -##### C.2.7.1 Description - -A dependency is a relationship that signifies that a single or a set of model elements requires other model elements for their specification or implementation. This means that the complete semantics of - -the depending elements is either semantically or structurally dependent on the definition of the supplier element(s)...", an extract from 7.3.12 Dependency of [OMG UML2]. - -##### C.2.7.2 Example - -The example in Figure C.8 shows that the BClass instances have a semantic relationship with the AClass instances. It indicates a situation in which a change to the target element (the AClass in the example) will require a change to the source element (the BClass in the example) in the dependency. - -![UML diagram showing a dependency relationship between two classes. A dashed arrow points from a class labeled '«InformationObjectClass» BClass' to a class labeled '«InformationObjectClass» AClass'.](4e85fe330de2c4f5eea6de4b2a53c77f_img.jpg) - -``` -classDiagram - class AClass["«InformationObjectClass» AClass"] - class BClass["«InformationObjectClass» BClass"] - BClass --> AClass : dependency -``` - -UML diagram showing a dependency relationship between two classes. A dashed arrow points from a class labeled '«InformationObjectClass» BClass' to a class labeled '«InformationObjectClass» AClass'. - -Figure C.8 – Dependency relationship notation - -##### C.2.7.3 Name style - -A Dependency can have a name. Use of Dependency name is optional. Its name style is UCC. - -#### C.2.8 Comment - -##### C.2.8.1 Description - -A comment is a textual annotation that can be attached to a set of elements. - -See 7.3.9 Comment (from Kernel) from [OMG UML2]. - -##### C.2.8.2 Example - -The example in Figure C.9 shows a comment as a rectangle with a "bent corner" in the upper right corner. It contains text. It appears on a particular diagram and may be attached to zero or more modelling elements by dashed lines. - -![UML diagram showing a comment attached to a class. A class labeled '«InformationObjectClass» Function' is connected by a solid line to a yellow comment box with a bent corner. The comment box contains the text: 'This Function class is conceptually the same as ManagedFunction class (in the context of 3GPP NRM IRP).'](2beb95006f1933bed737cfe1e6598db8_img.jpg) - -``` -classDiagram - class Function["«InformationObjectClass» Function"] - note for Function "This Function class is conceptually the same as ManagedFunction class (in the context of 3GPP NRM IRP)." -``` - -UML diagram showing a comment attached to a class. A class labeled '«InformationObjectClass» Function' is connected by a solid line to a yellow comment box with a bent corner. The comment box contains the text: 'This Function class is conceptually the same as ManagedFunction class (in the context of 3GPP NRM IRP).' - -Figure C.9 – Comment notation - -##### C.2.8.3 Name style - -Comment notations have no name so there is no name style. - -#### C.2.9 Multiplicity (also known as cardinality in relationships) - -##### C.2.9.1 Description - -"A multiplicity is a definition of an inclusive interval of non-negative integers beginning with a lower bound and ending with a (possibly infinite) upper bound. A multiplicity element embeds this information to specify the allowable cardinalities for an instantiation of this element...", an extract from 7.3.32 MultiplicityElement of [OMG UML2]. - -**Table C.2 – Multiplicity-string definitions** - -| Multiplicity | Explanation | -|--------------|----------------------------------------------------------------------------| -| 1 | Attribute has one attribute value | -| m | Attribute has m attribute values | -| 0..1 | Attribute has zero or one attribute value | -| 0..* | Attribute has zero or more attribute values | -| * | Attribute has zero or more attribute values | -| 1..* | Attribute has at least one attribute value | -| m..n | Attribute has at least m but no more than n attribute values | - -The use of "0..n" and "0..\*" is not recommended although it has the same meaning as "\*". - -The use of a standalone symbol zero (0) is not allowed. - -##### **C.2.9.2 Example** - -Figure C.10 shows a multiplicity attached to the end of an association path. The meaning of this multiplicity is one to many. One Network instance is associated with zero, one or more SubNetwork instances. Other valid examples can show the "many to many" relationship. - -![UML Class diagram showing an association between Class1 and Class2. Class1 is on the left with multiplicity '1'. Class2 is on the right with multiplicity '*'. The association is labeled '+ class2' above the Class2 box.](683f755e8456c884716de4fce48c7e63_img.jpg) - -``` - -classDiagram - Class1 "1" --> "*" Class2 : + class2 - class Class1 { - <> - } - class Class2 { - <> - } - -``` - -UML Class diagram showing an association between Class1 and Class2. Class1 is on the left with multiplicity '1'. Class2 is on the right with multiplicity '\*'. The association is labeled '+ class2' above the Class2 box. - -**Figure C.10 – Cardinality notation** - -The cardinality zero is not used to indicate the IOC's so-called "transient state" characteristic. For example, it is not used to indicate that the instance is not yet created but it is in the process of being created. The cardinality zero will not be used to indicate this characteristic since such characteristic is considered inherent in all IOCs. All IOCs defined are considered to have such inherent "transient state" characteristics. - -Note that the use of "0..\*", "0..n" or "\*" means "zero to many". The use of "0..\*" is recommended. The following table shows some valid examples of multiplicity. - -**Table C.3 – Multiplicity-string examples** - -| Multiplicity | Explanation | -|--------------|---------------------------------------------------------------| -| 1 | Attribute has exactly one attribute value | -| 5 | Attribute has exactly 5 attribute values | -| 0..1 | Attribute has zero or one attribute value | -| 0..* | Attribute has zero or more attribute values | -| 1..* | Attribute has at least one attribute value | -| 4..12 | Attribute has at least 4 but no more than 12 attribute values | - -##### **C.2.9.3 Name style** - -Cardinality has no name so there is no name style. - -#### C.2.10 Role - -##### C.2.10.1 Description - -A role indicates navigation, from one class to another class, involved in an association relationship. A role is named. The direction of navigation is to the class attached to the end of the association relationship with (or near) the role name. - -The use of role name in the graphical representation is mandatory for bidirectional and unidirectional association relationship notations (see Figure C.2 – Bidirectional association relationship notation and Figure C.3 – Unidirectional association relationship notation). Role name shall not be used in non-navigable association relationship notation (see Figure C.4 – Non-navigable association relationship notation). - -A role at the navigable end of a relationship becomes (or is mapped into) an attribute (called role-attribute) in the source class of the relationship. Therefore roles have the same behaviour (or properties) as attributes. - -The role-attribute shall have all properties defined for attributes in clause C.2.2 and in addition the following property: - -**Table C.4 – passedById property** - -| Property name | Description | Legal values | -|---------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-----------------------| -| passedById |

If True, the role-attribute (navigable association source end) contains a DN of the navigable association target end instance.

If False, the role-attribute contains (a copy of) the whole target end instance (e.g., X). If X has a role-attribute whose "passedById==False", then the subject role-attribute contains (a copy of) X's target end instance as well.

The above rule is applied repeatedly for all occurrences of "passedById==False". This application can result in a collection of instances where no ordering can be implied and no instances are duplicated.

Use of "passedById==False" supports the efficient access of target end instances from a source end instance. The mechanism by which such access is achieved is operation model design specific (e.g., not related to resource model design).

| True (default), False | - -##### C.2.10.2 Example - -The example in Figure C.11 shows that a Person (say instance John) is associated with a Company (say whose DN is "Company=XYZ"). We navigate the association by using the opposite association-end such that John's `Person.theCompany` would hold the DN, i.e., "Company=XYZ". - -![UML Class Diagram showing a bidirectional association between Company and Person. The Company class is on the left and the Person class is on the right. An association line connects them. At the Company end, there is a multiplicity of '1' and a role name '+ theCompany'. At the Person end, there is a multiplicity of '1'. Both classes are labeled with the stereotype <>.](f943b07ab747bfd85e302e5a31c20ba8_img.jpg) - -``` - -classDiagram - class Company { - <> - } - class Person { - <> - } - Company "1" -- "1" Person : + theCompany - -``` - -UML Class Diagram showing a bidirectional association between Company and Person. The Company class is on the left and the Person class is on the right. An association line connects them. At the Company end, there is a multiplicity of '1' and a role name '+ theCompany'. At the Person end, there is a multiplicity of '1'. Both classes are labeled with the stereotype <>. - -**Figure C.11 – Role notation** - -##### C.2.10.3 Name style - -A role has a name. Use noun for the name. The name style follows the attribute name style; see clause C.2.2.3. - -#### C.2.11 Xor constraint - -##### C.2.11.1 Description - -"A Constraint represents additional semantic information attached to the constrained elements. A constraint is an assertion that indicates a restriction that must be satisfied by a correct design of the system. The constrained elements are those elements required to evaluate the constraint specification...", an extract from 7.3.10 Constraint (from Kernel) of [OMG UML2]. - -For a constraint that applies to two elements such as two associations, the constraint shall be shown as a dashed line between the elements labelled by the constraint string (in braces). The constraint string, in this case, is xor. - -##### C.2.11.2 Example - -Figure C.12 shows a `ServerObjectClass` instance that has relation(s) to multiple instances of a class from the choice of `ClientObjectClass_Alternative1`, `ClientObjectClass_Alternative2` or `ClientObjectClass_Alternative3`. - -![UML Class Diagram illustrating the {xor} constraint notation. A base class 'ServerObjectClass' (stereotyped as <>) is shown at the top. It has three associations leading to three alternative classes: 'ClientObjectClass_Alternative1', 'ClientObjectClass_Alternative2', and 'ClientObjectClass_Alternative3' (all stereotyped as <>). Each association from 'ServerObjectClass' has a multiplicity of '1' at the top and '*' at the bottom, with the role name '+ clientObjectClass'. A dashed line connects the three associations, and a red box labeled '{xor}' is placed on this dashed line, indicating that the associations are mutually exclusive.](772cc583a60eeb058cc19de48269ad22_img.jpg) - -UML Class Diagram illustrating the {xor} constraint notation. A base class 'ServerObjectClass' (stereotyped as <>) is shown at the top. It has three associations leading to three alternative classes: 'ClientObjectClass\_Alternative1', 'ClientObjectClass\_Alternative2', and 'ClientObjectClass\_Alternative3' (all stereotyped as <>). Each association from 'ServerObjectClass' has a multiplicity of '1' at the top and '\*' at the bottom, with the role name '+ clientObjectClass'. A dashed line connects the three associations, and a red box labeled '{xor}' is placed on this dashed line, indicating that the associations are mutually exclusive. - -Figure C.12 – {xor} notation - -##### C.2.11.3 Name style - -The Xor constraint has no name so there is no name style. - -### C.3 Stereotypes - -#### C.3.1 General - -Clause C.2 lists the UML defined basic model elements. UML defined a stereotype concept allowing the specification of simple or complex user-defined model elements. - -This clause lists all allowable stereotypes for this repertoire. - -For each stereotype model element listed, there are three parts. The first part contains its description. The second part contains its graphical notation examples and the third part contains the rule, if any, recommended for labelling or naming it. - -#### C.3.2 <> - -##### C.3.2.1 Description - -This represents a number of <>. It encapsulates attributes, links, methods (or operations), and interactions that are present in the represented <>. - -The semantics of a <> is that all behaviour of the <> are present in the represented <>. Since this class is simply a representation of other classes, - -this class cannot define its own behaviour other than those already defined by the represented `<>`. - -A particular `<>` can be represented by zero, one or more `<>`. For example, the `ManagedElement` `<>` can have `MonitoredEntity` `<>` and `ManagedEntity` `<>`. - -The attributes of the `<>` are accessible by the source entity that has an association with the `<>`. - -##### C.3.2.2 Example - -Figure C.13 shows a `<>` named `MonitoredEntity`. It represents (or its constraints is that it represents) all NRM `<>` (e.g., `GgsnFunction` `<>`) whose instances are being monitored for alarm conditions. It is mandatory to use a Note to capture the constraint. - -![UML diagram showing a ProxyClass named MonitoredEntity with a note explaining its constraint.](9cbc1ebd80813fc36e499f7d70ed6881_img.jpg) - -The diagram shows a class box for `<> MonitoredEntity`. A note box containing the text "It represents all NRM IOCs that can have alarms." is connected to the class box by a line. - -UML diagram showing a ProxyClass named MonitoredEntity with a note explaining its constraint. - -**Figure C.13 – `<>` Notation** - -See Appendix II for more examples that use `<>`. - -##### C.3.2.3 Name style - -For `<>` name, use the same style as `<>` (see clause C.3.3). - -#### C.3.3 `<>` - -##### C.3.3.1 Description - -The `<>` is identical to UML *class* except that it does not include/define methods or operations. - -A UML *class* represents a capability or concept within the system being modelled. Classes have data structure and behaviour and relationships to other elements. - -This class can inherit from zero, one or multiple classes (multiple inheritances). - -See more on UML *class* in 10.2.1 of [OMG UML1]. - -##### C.3.3.2 Example - -The example in Figure C.14 shows an `AbcFunction` `<>`. - -![UML diagram showing an InformationObjectClass named AbcFunction.](781be1b7270da21ee7b75b51db2ee1b3_img.jpg) - -The diagram shows a class box for `<> AbcFunction`. The box is light blue with a small icon representing a class. - -UML diagram showing an InformationObjectClass named AbcFunction. - -**Figure C.14 – `<>` Notation** - -Table C.5 captures the properties of this modelled element. - -**Table C.5 – <> properties** - -| Property name | Description | Legal values | -|------------------|---------------------------------------------------------------------------------------------------------------------------|-------------------------------| -| documentation | Contains a textual description of this modelled element. Should refer (to enable traceability) to a specific requirement. | Any | -| isAbstract | Indicates if the class can be instantiated or is just used for inheritance. | True, False (default) | -| isNotifyable | Identifies the list of the supported notifications. | List of names of notification | -| supportQualifier | Identifies the required support of the class. See also clause 7. | M, O (default), CM, CO, C | - -#### C.3.4 <> - -##### C.3.4.1 Description - -The <> is modelled by a composition association where both ends are non-navigable. The source class is the composition and the target class is the component. The target instance is uniquely identifiable, within the namespace of the source entity, among all other targeted instances of the same target class and among other targeted instances of other classes that have the same <> composition with the source. - -The source class and target class shall each have its own naming attribute. - -The composition aggregation association relationship is used as the act of name containment providing a semantic of a whole-part relationship between the domain and the named elements that are contained, even if only by name. From the management perspective access to the part is through the whole. Multiplicity shall be indicated at both ends of the relationship. - -A target instance cannot have multiple <> with multiple sources, i.e., a target instance cannot participate in or belong to multiple namespaces. - -##### C.3.4.2 Example - -Figure C.15 shows that all instances of Class4 are uniquely identifiable within a Class3 instance's namespace. - -![UML Class diagram showing a composition association between Class3 and Class4. Class3 is the composition (source) and Class4 is the component (target). The association is labeled '«names»'. Multiplicity '1' is at the Class3 end and '*' is at the Class4 end. Class3 and Class4 are both stereotyped as «InformationObjectClass».](6584b95e34ea1f0b67144aa841db0863_img.jpg) - -``` - -classDiagram - class3["«InformationObjectClass»\nClass3"] "1" *-- "*" "«InformationObjectClass»\nClass4" : «names» - -``` - -UML Class diagram showing a composition association between Class3 and Class4. Class3 is the composition (source) and Class4 is the component (target). The association is labeled '«names»'. Multiplicity '1' is at the Class3 end and '\*' is at the Class4 end. Class3 and Class4 are both stereotyped as «InformationObjectClass». - -**Figure C.15 – <> notation** - -##### C.3.4.3 Name style - -<> has no name so there is no name style. - -#### C.3.5 <> - -##### C.3.5.1 Description - -<> represents the general notion of being a data type (i.e., a type whose instances are identified only by their values) whose definition is defined by user (e.g., specification authors). - -This repertoire uses two kinds of data types: predefined data types and user-defined data types. The former is defined in clause C.4.3. The latter is defined by the specifications authors using this <> model element. - -The user-defined data types support the modelling of structured data types (see <> notations in clause C.3.5.3). When user-defined or predefined data type is used to apply type information to a class attribute (see clause C.2.2), the data type name is shown along with the class attribute. See user example of <> in clause C.3.5.3. - -##### C.3.5.2 Example - -The following examples are two user-defined data types. The left-most is named `PlmnId` that consists of mobile country code (MCC) and mobile network code (MNC), whose types are the predefined data types in clause C.4.3. The right-most is named `Xyz` that consists of two predefined data types (i.e., `String`, `Integer`) and one user-defined data type `PlmnId`. - -![Figure C.16: Two <> notations. The first is 'PlmnId' with attributes 'mCC : String' and 'mNC : String'. The second is 'Xyz' with attributes 'attribute1 : String', 'attribute2 : Integer', and 'attribute3 : PlmnId'.](40a8c30f7ea5ecea4912e040c97c5b9c_img.jpg) - -| | | | | | | -|----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------|------------------------------|----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|----------------------------|--------------------------------------------------------------------| -|
<<dataType>>
PlmnId
mCC : String
mNC : String
| <>
PlmnId | mCC : String
mNC : String |
<<dataType>>
Xyz
attribute1 : String
attribute2 : Integer
attribute3 : PlmnId
| <>
Xyz | attribute1 : String
attribute2 : Integer
attribute3 : PlmnId | -| <>
PlmnId | | | | | | -| mCC : String
mNC : String | | | | | | -| <>
Xyz | | | | | | -| attribute1 : String
attribute2 : Integer
attribute3 : PlmnId | | | | | | - -Figure C.16: Two <> notations. The first is 'PlmnId' with attributes 'mCC : String' and 'mNC : String'. The second is 'Xyz' with attributes 'attribute1 : String', 'attribute2 : Integer', and 'attribute3 : PlmnId'. - -**Figure C.16 – <> notations** - -Figure C.17 shows an example of a `ZClass` using two user-defined data types and two predefined data types. - -![Figure C.17: Usage example of <>. A ZClass with attributes attribute1 : PlmnId, attribute2 : Integer [1..*], attribute3 : String, and attribute4 : Xyz.](3493d7ba4c86f944e159de1bf45ff03d_img.jpg) - -| | -|-----------------------------------------------------------------------------------------------| -| <>
ZClass | -| attribute1 : PlmnId
attribute2 : Integer [1..*]
attribute3 : String
attribute4 : Xyz | - -Figure C.17: Usage example of <>. A ZClass with attributes attribute1 : PlmnId, attribute2 : Integer [1..\*], attribute3 : String, and attribute4 : Xyz. - -**Figure C.17 – Usage example of <>** - -##### C.3.5.3 Name style - -For <> name, use the same style as <> (see clause C.3.3). - -For <> attribute, use the same style as Attribute (see clause C.2.2). - -#### C.3.6 <> - -##### C.3.6.1 Description - -An enumeration is a data type. It contains sets of named literals that represent the values of the enumeration. An enumeration has a name. - -See 10.3.2 Enumeration of [OMG UML1]. - -##### C.3.6.2 Example - -The example in Figure C.18 shows an enumeration model element whose name is `Account` and it has four enumeration literals. The upper compartment contains the keyword <> and the name of the enumeration. The lower compartment contains a list of enumeration literals. - -Note that the symbol to the right of <> `Account` in the figure below is a feature specific to a particular modelling tool. It is recommended that modelling tool features should be used when appropriate. - -![UML diagram of an enumeration class named Account. It contains four literals: CASH_ACCOUNT, STUDENT_ACCOUNT, SENIOR_ACCOUNT, and PREMIUM_ACCOUNT.](4162c218fc7881cd90fc9574e07d2327_img.jpg) - -``` - -classDiagram - class Account { - <> - CASH_ACCOUNT - STUDENT_ACCOUNT - SENIOR_ACCOUNT - PREMIUM_ACCOUNT - } - -``` - -UML diagram of an enumeration class named Account. It contains four literals: CASH\_ACCOUNT, STUDENT\_ACCOUNT, SENIOR\_ACCOUNT, and PREMIUM\_ACCOUNT. - -**Figure C.18 – <> notation** - -##### **C.3.6.3 Name style** - -For <> name, use the same style as <> (see clause C.3.3). - -For <> attribute (the enumeration literal), use the following rules: - -- Enumeration literal is composed of one or more words of upper case characters. Words are separated by the underscore character. - -#### **C.3.7 <>** - -##### **C.3.7.1 Description** - -The «choice» stereotype represents one of a set of classes (when used as an information model element) or one of a set of data types (when used as an operations model element). - -This stereotype property, e.g., one out of a set of possible alternatives, is identical to the {xor} constraint (see clause C.2.11). - -##### **C.3.7.2 Example** - -Sometimes the specific kind of class cannot be determined at model specification time. In order to support such scenario, the specification is done by listing all possible classes. - -Figure C.19 lists 3 possible classes. It also shows a «choice, InformationObjectClass» named SubstituteObjectClass. This scenario indicates that only one of the three «InformationObjectClass» named Alternative1ObjectClass, Alternative2ObjectClass, Alternative3ObjectClass shall be realised. - -The «choice» stereotype represents one of a set of classes when used as an information model element. - -![UML diagram showing a choice class SubstituteObjectClass with three possible alternatives: Alternative1ObjectClass, Alternative2ObjectClass, and Alternative3ObjectClass. The alternatives are connected to the choice class via association lines with multiplicity 1 at both ends.](fc0cdcafc5389b99674ba116c9787ffd_img.jpg) - -``` - -classDiagram - class SubstituteObjectClass { - <> - } - class Alternative1ObjectClass { - <> - } - class Alternative2ObjectClass { - <> - } - class Alternative3ObjectClass { - <> - } - SubstituteObjectClass "1" -- "1" Alternative1ObjectClass : + alternative1 - SubstituteObjectClass "1" -- "1" Alternative2ObjectClass : + alternative2 - SubstituteObjectClass "1" -- "1" Alternative3ObjectClass : + alternative3 - -``` - -UML diagram showing a choice class SubstituteObjectClass with three possible alternatives: Alternative1ObjectClass, Alternative2ObjectClass, and Alternative3ObjectClass. The alternatives are connected to the choice class via association lines with multiplicity 1 at both ends. - -**Figure C.19 – Information model element example using <> notation** - -Sometimes the specific kind of data type cannot be determined at model specification time. In order to support such scenario, the specification is done by listing all possible data types. - -Figure C.20 lists 2 possible data types. It also shows a «choice» named ProbableCause. This scenario indicates that only one of the two «dataType» named IntegerProbableCause, StringProbableCause shall be realised. - -The «choice» stereotype represents one of a set of data types when used as an operations model element. - -![UML diagram showing a choice stereotype ProbableCause associated with two possible data types: IntegerProbableCause and StringProbableCause.](0a73b03fba21af142d619a9a662e6490_img.jpg) - -``` - -classDiagram - class ProbableCause { - <> - } - class IntegerProbableCause { - <> - probableCause : Integer - } - class StringProbableCause { - <> - probableCause : String - } - ProbableCause "1" *--> "1" IntegerProbableCause : + probableCause - ProbableCause "1" *--> "1" StringProbableCause : + probableCause - -``` - -The diagram illustrates a «choice» stereotype named **ProbableCause**. It has two associations, each with a multiplicity of 1 at the **ProbableCause** end and 1 at the target end. The first association points to a «dataType» named **IntegerProbableCause**, which contains an attribute `probableCause : Integer`. The second association points to a «dataType» named **StringProbableCause**, which contains an attribute `probableCause : String`. Both associations are labeled with `+ probableCause` near the target class. - -UML diagram showing a choice stereotype ProbableCause associated with two possible data types: IntegerProbableCause and StringProbableCause. - -Figure C.20 – Operations model element example using «choice» notation - -Sometimes models distinguish between sink/source/bidirectional termination points. A generic class which comprises these three specific classes can be modelled using the «choice» stereotype (see Figure C.21). - -![UML diagram showing a choice stereotype GenericTerminationPoint associated with three specific information object classes: TerminationPointSource, TerminationPointSink, and TerminationPointBidirectional.](7722d62e33dcc894cc8555e9474c5606_img.jpg) - -``` - -classDiagram - class GenericTerminationPoint { - <> - } - class TerminationPointSource { - <> - } - class TerminationPointSink { - <> - } - class TerminationPointBidirectional { - <> - } - GenericTerminationPoint "1" *--> "0..1" TerminationPointSource : + terminationPointSource - GenericTerminationPoint "1" *--> "0..1" TerminationPointSink : + terminationPointSink - GenericTerminationPoint "1" *--> "0..1" TerminationPointBidirectional : + terminationPointBidirectional - TerminationPointSource <|-- TerminationPointBidirectional - TerminationPointSink <|-- TerminationPointBidirectional - -``` - -The diagram shows a «choice, InformationObjectClass» stereotype named **GenericTerminationPoint**. It has three associations, each with a multiplicity of 1 at the **GenericTerminationPoint** end and 0..1 at the target end. The first association points to an «InformationObjectClass» named **TerminationPointSource** and is labeled `+ terminationPointSource`. The second association points to an «InformationObjectClass» named **TerminationPointSink** and is labeled `+ terminationPointSink`. The third association points to an «InformationObjectClass» named **TerminationPointBidirectional** and is labeled `+ terminationPointBidirectional`. Below the associations, **TerminationPointBidirectional** is shown with inheritance arrows pointing to it from both **TerminationPointSource** and **TerminationPointSink**. - -UML diagram showing a choice stereotype GenericTerminationPoint associated with three specific information object classes: TerminationPointSource, TerminationPointSink, and TerminationPointBidirectional. - -Figure C.21 – Sink/source/bidirectional termination points example using «choice» notation - -##### C.3.7.3 Name style - -For «choice» name, use the same style as «InformationObjectClass» (see clause C.3.3). - -### C.4 Others - -#### C.4.1 Association class - -##### C.4.1.1 Description - -An association class is an association that also has class properties (or a class that has association properties). Even though it is drawn as an association and a class, it is really just a single model element. - -See 7.3.4 AssociationClass of [OMG UML2]. - -Association classes are appropriate for use when an «InformationObjectClass» needs to maintain associations to several other instances of «InformationObjectClass» and there are relationships between the members of the associations within the scope of the "containing" «InformationObjectClass». For example, a namespace maintains a set of bindings, a binding ties a name to an identifier. A NameBinding «InformationObjectClass» can be modelled as an Association Class that provides the binding semantics to the relationship between an identifier and some other «InformationObjectClass» such as Object in the figure. This is depicted in Figure C.22. - -##### C.4.1.2 Example - -![UML diagram showing an association class. A class named 'Name' (stereotyped as «InformationObjectClass») is associated with a class named 'Object' (stereotyped as «InformationObjectClass»). The association is named 'names' and has a multiplicity of 1 at the 'Name' end and * at the 'Object' end. An association class named 'NameBinding' (stereotyped as «InformationObjectClass») is attached to the association line via a dashed line. A class named 'Identifier' (stereotyped as «InformationObjectClass») is also associated with 'Object' with a multiplicity of 1 at both ends.](3e2dcee303cecdd31b7f9ec0d8942fed_img.jpg) - -``` -classDiagram - class Name["«InformationObjectClass»\nName"] - class NameBinding["«InformationObjectClass»\nNameBinding"] - class Identifier["«InformationObjectClass»\nIdentifier"] - class Object["«InformationObjectClass»\nObject"] - - Name "1" -- "*" Object : «names» - (Name, Object) .. NameBinding - Identifier "1" -- "1" Object -``` - -UML diagram showing an association class. A class named 'Name' (stereotyped as «InformationObjectClass») is associated with a class named 'Object' (stereotyped as «InformationObjectClass»). The association is named 'names' and has a multiplicity of 1 at the 'Name' end and \* at the 'Object' end. An association class named 'NameBinding' (stereotyped as «InformationObjectClass») is attached to the association line via a dashed line. A class named 'Identifier' (stereotyped as «InformationObjectClass») is also associated with 'Object' with a multiplicity of 1 at both ends. - -Figure C.22 – Association class notation - -##### C.4.1.3 Name style - -The name shall use the same style as in «InformationObjectClass» (see clause C.3.3). - -#### C.4.2 Abstract class - -##### C.4.2.1 Description - -Abstract class specifies a special kind of «InformationObjectClass» as the general model element involved in a generalization relationship (see clause C.2.6). An abstract class cannot be instantiated. - -This modelled element has the same properties as class. See clause C.3.3. - -##### C.4.2.2 Example - -Figure C.23 shows that *Class5\_* is an abstract class. It is the base class for *SpecialisedClass5*. - -![UML diagram showing an abstract class. A class named 'Class5_' is shown as the base class for a class named 'SpecialisedClass5'. The relationship is a generalization, indicated by a solid line with an open triangle arrowhead pointing from 'SpecialisedClass5' to 'Class5_'.](f98674fcf898dbd5225f8f732a393e1c_img.jpg) - -``` -classDiagram - Class5_ <|-- SpecialisedClass5 -``` - -UML diagram showing an abstract class. A class named 'Class5\_' is shown as the base class for a class named 'SpecialisedClass5'. The relationship is a generalization, indicated by a solid line with an open triangle arrowhead pointing from 'SpecialisedClass5' to 'Class5\_'. - -Figure C.23 – Abstract class notation - -##### C.4.2.3 Name style - -For abstract class name, use the same style as <> (see clause C.3.3). The name shall be in italics. - -#### C.4.3 Predefined data types - -##### C.4.3.1 Description - -It represents the general notion of being a data type (i.e., a type whose instances are identified only by their values) whose definition is defined by this specification and not by the user (e.g., specification authors). - -This repertoire uses two kinds of data types: predefined data types and user-defined data types. The latter are defined in clauses C.3.5 and C.3.6. - -Table C.6 lists the UML data types selected for use as predefined data type. - -**Table C.6 – UML defined data types** - -| Name | Description and reference | -|---------|--------------------------------------------| -| Boolean | See Boolean type of [ITU-T X.680]. | -| Integer | See Integer type of [ITU-T X.680]. | -| String | See PrintableString type of [ITU-T X.680]. | - -Table C.7 lists data types that are defined by this repertoire. - -**Table C.7 – Non-UML defined data types** - -| Name | Description and reference | -|-----------------------|--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| AttributeValuePair | This data type defines an attribute name and the attribute's value. | -| BitString | This data type is defined by Bit string of clause 3 and clause G.2.5 of [ITU-T X.680]. | -| DateTime | This data type is defined by GeneralizedTime of [ITU-T X.680]. | -| DN | This data type defines the distinguished name (DN) (see Distinguished Name of [ITU-T X.501]) of an object. It contains a sequence of one or more name components. Each initial sub-sequence (Note 1) of the object name is also the name of an object. The sequence of objects so identified, starting with the one identified by only the first name component and ending with the object being named, is such that each is the immediate superior (Note 2) of that which follows it in the sequence.
NOTE 1 – Suppose an object's DN is composed of a sequence of 4 name components, i.e., 1st, 2nd, 3rd and 4th components. The "initial sub-sequence" is composed of the 1st, 2nd and 3rd components.
NOTE 2 – Suppose object A is name-contained (see clause C.3.4) by object B, object B is said to be the immediate superior of object A. | -| External | This data type is defined by another organization. | -| OperationStatusAtomic | This enumeration defines the status values of an atomic operation.
  • • SUCCESSFUL: The operation has been successfully completed as a whole;
  • • NOT_SUCCESSFUL: The operation has not been successfully completed as a whole; i.e., the states of the involved object instances are the same as before the operation (roll back is necessary).
| - -**Table C.7 – Non-UML defined data types** - -| Name | Description and reference | -|---------------------------|--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| OperationStatusBestEffort | This enumeration defines the status values of a best effort operation.
  • • SUCCESSFUL: The operation has been completed successfully as a whole;
  • • PARTIALLY_SUCCESSFUL: The operation has been completed partially successfully. Further definition what this means for a specific operation is to be specified by the interface specification author;
  • • NOT_SUCCESSFUL The operation has not been completed at all, i.e., the state of the involved object instances is unchanged.
| -| Real | This data type is defined by Real type of [ITU-T X.680]. | - -##### **C.4.3.2 Example** - -Figure C.24 shows an example of predefined data types usage. - -![UML class diagram for Class1 with attributes: identifier : DN, sourceTime : DateTime, measurementValue : Real, suspectFlag : Boolean.](0a06de972d61ab9bb901bd74dd4ff51f_img.jpg) - -``` - -classDiagram - class Class1 { - identifier : DN - sourceTime : DateTime - measurementValue : Real - suspectFlag : Boolean - } - -``` - -UML class diagram for Class1 with attributes: identifier : DN, sourceTime : DateTime, measurementValue : Real, suspectFlag : Boolean. - -**Figure C.24 – Predefined data types usage** - -NOTE – Use of this is optional. Uses of other means, to specify Predefined data types, are allowed. - -##### **C.4.3.3 Name style** - -It shall use the UCC style. - -### **C.5 Qualifiers** - -This clause defines the qualifiers applicable for model elements specified in this document, e.g., the IOC (see clause C.3.3), the Attribute (see clause C.2.2). The qualifications are M, O, CM, CO, C and 'SS'. Their meanings are specified in this section. This type of qualifier is called Support Qualifier (see supportQualifier of IOC in Table C.3 and supportQualifier of attribute in Table C.1). - -This clause also defines the qualifiers applicable to various properties of a model element, e.g., see the IOC properties excepting 'supportQualifier' in Table C.3 and attributes properties excepting supportQualifier in Table C.1. The qualifications are M, O, CM, CO, C and '-'. Their meanings are specified in this section. This type of qualifier is simply called Qualifier. - -Definition of M (Mandatory) qualification: - -- The capability (e.g., the Attribute named `abc` of an IOC named `Xyz`; the write property of Attribute named `abc` of an IOC named `Xyz`; the IOC named `Xyz`) shall be supported. - -Definition of O (Optional) qualification: - -- The capability may or may not be supported. - -Definition of CM (Conditional-Mandatory) qualification: - -- The capability shall be supported under certain conditions, specifically: - - When qualified as CM, the capability shall have a corresponding constraint defined in the specification. If the specified constraint is met then the capability shall be supported. - -Definition of CO (Conditional-Optional) qualification: - -- The capability may be supported under certain conditions, specifically: - - When qualified as CO, the capability shall have a corresponding constraint defined in the specification. If the specified constraint is met then the capability may be supported. - -Definition of C (Conditional) qualification: - -- Used for items that have multiple constraints. Each constraint is worded as a condition for one kind of support such as mandatory support, optional support or "no support". All constraints must be related to the same kind of support. Specifically: - - Each item with C qualification shall have the corresponding multiple constraints defined in the specification. If all specified constraints are met and are related to mandatory, then the item shall be supported. If all the specified constraints are met and are related to optional, then the item may be supported. If all the specified constraints are met and are related to "no support", then the item shall not be supported. -- NOTE – This qualifier should only be used when absolutely necessary, as it is more complex to implement. - -Definition of SS (SS Conditional) qualification: - -- The capability shall be supported by at least one but not all solutions. - -Definition of '-' (no support) qualification: - -- The capability shall not be supported. - -### C.6 UML diagram requirements - -Classes and their relationships shall be presented in classes diagrams. - -It is recommended to create: - -- An overview classes diagram containing all classes related to a specific management area (Class Diagram). - - The class name compartment should contain the location of the class definition (e.g., "Qualified Name") - - The class attributes should show the "Signature" (see clause 7.3.45 of [OMG UML2] for the signature definition); -- A separate inheritance classes diagram in case the overview diagram would be overloaded when showing the inheritance structure (Inheritance Class Diagram); -- A classes diagram containing the user defined data types (Type Definitions Diagram); -- Additional classes diagrams to show specific parts of the specification in detail; -- State diagrams for complex state attributes. - -# **Annex D** - -## **Design** - -(This annex forms an integral part of this Recommendation.) - -This annex provides guidelines for the specification of protocol-specific designs. It is for further study. - -# Annex E - -## Information type definitions – type repertoire - -(This annex forms an integral part of this Recommendation.) - -This annex defines a repertoire of types that shall be used to specify type information in the conceptual model (analysis model/information service). - -The repertoire is defined as a subset of types defined by ASN.1 [ITU-T X.680] combined with types derived from the types defined by ASN.1 (clause E.4). - -The keywords to be used for each type are summarized in Table E.1. - -## E.1 Basic types - -Basic types are types that can be used directly to define attributes and parameters. Basic types can also be used to construct complex types. Basic types include the following ASN.1 types: - -- E.1.1 **integer type** clause 19 of [ITU-T X.680] -- E.1.2 **real type** clause 21 of [ITU-T X.680] -- E.1.3 **boolean type** clause 18 of [ITU-T X.680] -- E.1.4 **bitstring type** clause 22 of [ITU-T X.680] -- E.1.5 **null type** clause 24 of [ITU-T X.680] -- E.1.6 **generalized time type** clause 38 of [ITU-T X.680] - -### E.2 Enumerated type - -Enumerated type clause 20 of [ITU-T X.680] represents enumerated values. All values that may be used by a specific attribute or parameter shall be listed in the legal value columns. Only the listed names style is applicable for the conceptual model, i.e., the identification of concrete values (numbers or strings) are left for the concrete design models. - -NOTE – If the number of these values is more than 50, it is recommended to define them in an appendix or an independent document. - -## E.3 Complex types - -Complex types can be defined using the following concepts: - -- E.3.1 **sequence types** clause 25 of [ITU-T X.680] -- E.3.2 **choice types** clause 29 of [ITU-T X.680] -- E.3.3 **set types** clause 27 of [ITU-T X.680] - -In addition, lists and sets of complex types are supported using: - -- E.3.4 **sequence-of types** clause 26 of [ITU-T X.680] -- E.3.5 **set-of types** clause 28 of [ITU-T X.680] - -### E.4 Useful types - -#### E.4.1 String type - -String represents a string of characters, the character set is not restricted, i.e.: - -String ::= UnrestrictedCharacterStringType clause 44 of [ITU-T X.680] - -#### E.4.2 Name type - -Name represents an exclusive name of an object instance in name space. It might include object containment tree hierarchy information, but it is implementation dependent and is out of the scope of this Recommendation. Formally, the name type is defined as: - -Name ::= TYPE-IDENTIFIER Annex A of [ITU-T X.681] - -### E.5 Keywords - -Table E.1 defines the list of keywords to be used in the analysis template (see Annex B) for definition of information type, e.g.: - -| Parameter Name | Support Qualifier | Information Type/Legal Values | Comment | -|----------------|-------------------|-------------------------------|----------------------------------------| -| ... | | | | -| eventIdList | M | SET OF INTEGER/- | The list of alarms to be acknowledged. | - -**Table E.1 – Keywords** - -| Type | Keyword | -|-----------------------|-----------------| -| integer type | INTEGER | -| real type | REAL | -| boolean type | BOOLEAN | -| bitstring type | BIT STRING | -| null type | NULL | -| generalized time type | GeneralizedTime | -| enumerated type | ENUMERATED | -| sequence type | SEQUENCE | -| choice type | CHOICE | -| set type | SET | -| sequence-of type | SEQUENCE OF | -| set-of type | SET OF | -| string type | String | -| name type | Name | - -# Annex F - -## Guidelines on IOC properties, inheritance and entity import - -(This annex forms an integral part of this Recommendation.) - -The following guidelines are based on [b-3GPP TS 32.150]. - -## F.1 IOC property - -The properties of an IOC (including Support IOC) are specified in terms of the following: - -- a) An IOC attribute(s) including its semantics and syntax, its legal value ranges and support qualifications. The IOC attributes are not restricted to Configuration Management but also include those related to, for example, 1) Performance Management (i.e., measurement types), 2) Trace Management and 3) Accounting Management. -- b) The non-attribute-specific behaviour associated with an IOC. - -NOTE 1 – As an example, the Link between MscServerFunction and CsMgwFunction is optional. It is mandatory if the MscServerFunction instance belongs to one ManagedElement instance while the CsMgwFunction instance belongs to another ManagedElement instance. This Link behaviour is a non-attribute-specific behaviour. It is expected that this behaviour, like others, will be inherited. - -- c) An IOC relationship(s) with another IOC(s). -- d) An IOC notification type(s) and their qualifications. -- e) An IOC's relation with its parents (see Note 2). There are three mutually exclusive cases: - - 1) The IOC can have any parent. In UML diagram, the class has a parent Any. - - 2) The IOC is abstract and all of the possible parent(s) have been designated and whether subclass IOCs can be designated as a root IOC. In UML diagram, the class has zero or more possible parents of specific classes (except Any). - - 3) The IOC is concrete and all of the possible parent(s) have been designated and whether the IOC can be designated as a root IOC. In UML diagram, the class has one or more possible parents of specific classes (except Any). - -An IOC instance is either a root IOC or it has one and only one parent. Only 3GPP SA5 may designate an IOC class as a potential root IOC. Currently, only SubNetwork, ManagedElement or MeContext IOCs can be root IOCs. - -NOTE 2 – The parent and child relation in this subclause is the parent name-containing the child relation. - -- f) An IOC's relation with its children. There are three mutually exclusive cases: - - 1) An IOC shall not have any children (name-containment relation) IOCs. In UML diagram, the class has no child. - - 2) An IOC can have children IOC(s). The maximum number of instances per children IOC can be specified. An IOC may designate that vendor-specific objects are not allowed as children IOCs. In UML diagram, the class has a child Any. - - 3) An IOC can only have the specific children IOC(s) (or their subclasses). The maximum number of instances per children IOC can be specified. An IOC may designate that vendor-specific objects are not allowed as children IOCs. In UML diagram, the class has one or more children of specific classes (except Any). -- g) Whether an IOC can be instantiated or not (i.e., whether an IOC is an abstract IOC). -- h) An attribute for naming purpose. - -## F.2 Inheritance - -An IOC (the subclass) inherits from another IOC (the superclass) in that the subclass shall have all the properties of the superclass. - -The subclass can change the inherited support-qualification(s) from optional to mandatory but not vice versa. The subclass can change the inherited support-qualification from conditional-optional to conditional-mandatory but not vice versa. - -An IOC can be a superclass of many IOC(s). A subclass cannot have more than one superclass. - -The subclass can: - -- a) Add (compared to those of its superclass) unique attributes including their behaviour, legal value ranges and support-qualifications. Each additional attribute shall have its own unique attribute name (among all added and inherited attributes). -- b) Add non-attribute behaviour on an IOC basis. This behaviour may not contradict inherited superclass behaviour. -- c) Add relationship(s) with IOC(s). Each additional relationship shall have its own unique name (among all added and inherited relations). -- d) Add additional notification types and their qualifications. -- e) Designate all of the possible parent(s) (and their subclasses) if the superclass has Property-e-1 such that an IOC will have Property-e-2 or Property-e-3. Restrict possible parent(s) (and their subclasses) and/or remove the capability of the subclass from being a root IOC, if the superclass has Property-e-2 or Property-e-3. -- f) Add children IOC(s) if the superclass has Property-f-2 such that an IOC will have Property-f-3. Restrict the allowed children IOC(s) (or their subclasses) if the superclass has Property-f-3. -- g) Specify whether an IOC can be instantiated or not (i.e., the IOC is an abstract IOC). -- h) Restrict the legal value range of a superclass attribute that has a legal value range. - -## F.3 Entity (interface, IOC and attribute) import - -Management interface specifications define entities (e.g., IOCs, interfaces and attribute). To facilitate the reuse of entity definitions among interface specifications, an import mechanism is used. When a management interface specification (the subject specification) imports an entity defined in another management interface specification, the subject specification is considered to have defined the imported entity in its specification. Furthermore, the subject specification cannot change the properties of this imported entity. If it requires an entity that is not identical but similar to the imported entity, it should define a new entity that inherits the imported entity and introduce changes in the new entity definition. - -# Annex G - -## Attribute Properties - -(This annex forms an integral part of this Recommendation.) - -The following guidelines are based on Annex B of [b-3GPP TS 32.156]. - -| isInvariant | write | defaultValue | manager must provide a value when manager requests object creation | Meaning | -|-------------------------------------|-------------------------------------|-------------------------------------|--------------------------------------------------------------------|-------------------------------------------------------------------------------------------------------------------------------------| -| | | | | Not valid. | -| | | | | May be set by the manager only during object creation time; if no value is provided by the manager, the default value is used. | -| | | | | Must be set by the manager during object creation time. | -| | | | | May be set by the manager only during object creation time; if no value is provided by the manager, the agent must provide a value. | -| | | | | Not valid. | -| | | | | Valid but not useful. | -| | | | | Not valid. | -| | | | | Must be set by the agent during object creation time. | -| | | | | Not valid. | -| | | | | May be set by the manager anytime; if no value is provided by the manager at object creation time, it is set to the default value. | -| | | | | Must be set by the manager at object creation time and may be changed anytime. | -| | | | | May be set by the manager at object creation time and may be changed anytime. | -| | | | | Not valid. | -| | | | | Must be set by the agent to the default value at object creation time; may be changed by the agent anytime. | -| | | | | Not valid. | -| | | | | May be set by the agent at object creation time and may be changed by the agent anytime. | - -# Annex H - -## Design patterns - -(This annex forms an integral part of this Recommendation.) - -The following guidelines are based on Annex C of [b-3GPP TS 32.156]. - -### H.1 Intervening class and association class - -#### H.1.1 Concept and definition - -Classes may be related via simple direct associations or via associations with related association classes. - -However, in situations where the relationships between a number of classes is complex and especially where the relationships between instances of those classes are themselves interrelated there may be a need to encapsulate the complexity of the relationships within a class that sits between the classes that are to be related. The term "intervening class" is used here to name the pattern that describes this approach. The name "intervening class" is used as the additional class "intervenes" in the relationships between other classes. - -The "intervening class" differs from the association class as the intervening class does break the association between the classes whereas the association class does not but instead sits to one side. This can be seen in the Figure H.1. A direct association between class A and C appears the same at A and C regardless of the presence or absence of an association class where as in the case of the "intervening class" there are associations between A and the "intervening class" B and C and the "intervening class" B. - -![Figure H.1 – Various association forms. The diagram shows four UML class diagrams illustrating different association patterns: 1. Basic association: ClassA (0..1) is associated with ClassC (0..1). 2. Association Class: ClassA (*) is associated with ClassC (*), with ClassB acting as the association class. 3. Intervening class: ClassA (*) is associated with ClassB (0..1), which is associated with ClassC (*). 4. Another intervening class pattern: ClassA (0..1) is associated with ClassB (*), which is associated with ClassC (0..1). Each diagram includes a descriptive note on the right.](921458d4fc1b778c2450592ac9745b48_img.jpg) - -**Basic association** -Note class A points a C and C at A - -**Association Class** -Association where there is a need to represent: the associations own features (i.e. that do not belong to any of the connected classes): -• Some behavior and state -• Some additional data related to the association -Note that class A points a C and C at A - -**"Intervening" class** -Where there is a complex assembly of state/data bound to a number of associations. -Note that Class A and C point to B and potentially B points to C and A. - -Figure H.1 – Various association forms. The diagram shows four UML class diagrams illustrating different association patterns: 1. Basic association: ClassA (0..1) is associated with ClassC (0..1). 2. Association Class: ClassA (\*) is associated with ClassC (\*), with ClassB acting as the association class. 3. Intervening class: ClassA (\*) is associated with ClassB (0..1), which is associated with ClassC (\*). 4. Another intervening class pattern: ClassA (0..1) is associated with ClassB (\*), which is associated with ClassC (0..1). Each diagram includes a descriptive note on the right. - -Figure H.1 – Various association forms - -The "intervening class" is essentially no different to any other class in that it may encapsulate attributes, complex behaviour, etc. - -Figure H.2 shows an instance view of both an association class form and an "intervening class" form for a complex interrelationship. - -![UML class diagram illustrating two forms of complex interrelationships: Association Class and Intervening Class.](fef7e3f08b408e4ab937a75f5c8b6bfc_img.jpg) - -The diagram illustrates two forms of complex interrelationships between Class A, Class B, and Class C. - -**Association Class Form:** - -- Class A Instance 1 (ClassA)** (classC = Entries[2]) is associated with **Class B Instance 1 (ClassB)** (classA = Entries[1], classC = Entries[1]) via an association labeled "classA". -- Class A Instance 2 (ClassA)** (classC = Entries[2]) is associated with **Class C Instance 1 (ClassC)** (classA = Entries[2]) via an association labeled "classC". -- Class B Instance 3 (ClassB)** (classC = Entries[1], classA = Entries[1]) is associated with **Class C Instance 2 (ClassC)** (classA = Entries[2]) via an association labeled "classC". -- Class B Instance 2 (ClassB)** (classA = Entries[1], classC = Entries[1]) is associated with **Class C Instance 2 (ClassC)** (classA = Entries[2]) via an association labeled "classC". -- Class B Instance 4 (ClassB)** (classC = Entries[1], classA = Entries[1]) is associated with **Class C Instance 2 (ClassC)** (classA = Entries[2]) via an association labeled "classC". - -**Association Class** -Many instances of association class, one per association instance. - -**Intervening Class Form:** - -- Class A Instance 1 (ClassA)** (classB = ClassBInstance) is associated with **Class B Instance (ClassB)** (classA = Entries[2], classC = Entries[2]) via an association labeled "classA". -- Class A Instance 2 (ClassA)** (classB = ClassBInstance) is associated with **Class B Instance (ClassB)** (classA = Entries[2], classC = Entries[2]) via an association labeled "classA". -- Class C Instance 1 (ClassC)** (classB = ClassBInstance) is associated with **Class B Instance (ClassB)** (classA = Entries[2], classC = Entries[2]) via an association labeled "classC". -- Class C Instance 2 (ClassC)** (classB = ClassBInstance) is associated with **Class B Instance (ClassB)** (classA = Entries[2], classC = Entries[2]) via an association labeled "classC". - -**"Intervening" class** -One instance of intervening class that captures complex association and intertwining between Classes. -Also captures behaviour interaction such as protection switching and state (e.g where class A and C are TPs and class B is an SNC). - -UML class diagram illustrating two forms of complex interrelationships: Association Class and Intervening Class. - -Figure H.2 – Instance view of "intervening class" - -The case depicted above does not show interrelationships between the relationships. A practical case from modelling of the relationships between termination points in a fixed network does show this relationship interrelationship challenge. In this case the complexity of relationship is between instances of the same class, the termination point (TP). The complexity is encapsulated in a SubNetworkConnection (SNC) class. - -For an example of an SNC intervening in TP-TP relationship see Figure H.3. - -![UML Class diagram showing a relationship between TP and SNC classes. TP has a multiplicity of '*' and a role name '- tP'. SNC has a multiplicity of '0..2' and a role name '- sNC'. A line connects them.](1b23b78336d8bd286c653cbdb38428dd_img.jpg) - -UML Class diagram showing a relationship between TP and SNC classes. TP has a multiplicity of '\*' and a role name '- tP'. SNC has a multiplicity of '0..2' and a role name '- sNC'. A line connects them. - -**Simplified SNC and TP case** - An SNC can not exist without at least 2 TPs being related. - Some simplifications: In this case the TP and SNC model is assumed to be bidirectional only. The TPs have roles with respect to the SNC but these are ignored here. There are many other attributes and properties related to protection that are ignored here. - -![UML Class diagram showing an intervening class (SNC) in a TP-TP relationship. Four TP instances (TPInstance1, TPInstance2, TPInstance3, TPInstance4) are connected to a central SNC instance (SNCInstance : SNC). The SNC instance has an attribute 'tp = Entries[4]'. The connections are labeled with '- tP'.](935075de5250cfe8aa0fb9d65d63dde5_img.jpg) - -UML Class diagram showing an intervening class (SNC) in a TP-TP relationship. Four TP instances (TPInstance1, TPInstance2, TPInstance3, TPInstance4) are connected to a central SNC instance (SNCInstance : SNC). The SNC instance has an attribute 'tp = Entries[4]'. The connections are labeled with '- tP'. - -**"Intervening class" instance view** - One instance of intervening class that captures complex association and intertwining between Classes. Also captures behaviour interaction such as protection switching and state. - -**Figure H.3 – SNC intervening in TP-TP relationship** - -The SNC also encapsulates the complex behaviour of switching and path selection as depicted in Figure H.4. - -![UML Class diagram showing complex relationship interrelationships. It includes TP instances (TPInstance1, TPInstance2, TPInstance3, TPInstance4) with attributes like 'tp = Entries[2]'. These are connected to SncAssociation instances (SncAssociationInstance1, SncAssociationInstance2, SncAssociationInstance3, SncAssociationInstance4) which in turn connect to a ProtectionInstance. Associations are labeled with '- tp' and '- protection'. Text annotations on the right mention 'Association Class' and 'protection switching rule and state'.](9e26cd5584f423e1b2155fb341db579f_img.jpg) - -UML Class diagram showing complex relationship interrelationships. It includes TP instances (TPInstance1, TPInstance2, TPInstance3, TPInstance4) with attributes like 'tp = Entries[2]'. These are connected to SncAssociation instances (SncAssociationInstance1, SncAssociationInstance2, SncAssociationInstance3, SncAssociationInstance4) which in turn connect to a ProtectionInstance. Associations are labeled with '- tp' and '- protection'. Text annotations on the right mention 'Association Class' and 'protection switching rule and state'. - -**Association Class** - With protection switching rule and state. - There is complex creation transaction interrelationship - -**Figure H.4 – Complex relationship interrelationships** - -#### **H.1.2 Usage in the non-transport domain** - -The choice of association class pattern or intervening class pattern is on a case-by-case basis. The transport domain boundary is highlighted in the Figure H.5. - -![Diagram illustrating the boundary between transport and non-transport domains in a network architecture. The diagram shows a 'Management environment' box at the top left. Below it, a 'Function e.g., eNodeB function' is shown within an 'NE with wireless access' box. A dashed red line separates the 'non-transport domain' (above) from the 'transport domain' (below). In the non-transport domain, a blue 'Link entity (connectivity e.g., X2)' connects the 'Function e.g., eNodeB function' to a 'Network element' (orange box) on the right. In the transport domain, an orange 'Topological link' connects the 'Function e.g., eNodeB function' to a 'Wire-line NE' box. The 'Wire-line NE' box contains a 'Connection termination point' (green box) and a 'Physical termination point' (purple box). A dashed green line connects the 'Function e.g., eNodeB function' to the 'Connection termination point'. A dashed purple line connects the 'Function e.g., eNodeB function' to the 'Physical termination point'. A solid blue line connects the 'Function e.g., eNodeB function' to the 'Wire-line NE'. The 'Wire-line NE' is connected to another 'NE with wireless access' box on the right. A legend on the right side defines the symbols: orange box for 'Network element', blue box for 'Link entity (connectivity e.g., X2)', orange line for 'Topological link', dashed green line for 'Based on connection termination point concept', dashed purple line for 'Based on physical termination point concept', blue box for '3GPP managed function', green box for 'Connection termination point', purple box for 'Physical termination point', dashed blue line for 'Association/relationship', and solid blue line for 'Optical fibre'. The text 'M.3020(17)_FH.5' is at the bottom right.](15de63f0b5df62e6ab9164f2a72e2e33_img.jpg) - -Diagram illustrating the boundary between transport and non-transport domains in a network architecture. The diagram shows a 'Management environment' box at the top left. Below it, a 'Function e.g., eNodeB function' is shown within an 'NE with wireless access' box. A dashed red line separates the 'non-transport domain' (above) from the 'transport domain' (below). In the non-transport domain, a blue 'Link entity (connectivity e.g., X2)' connects the 'Function e.g., eNodeB function' to a 'Network element' (orange box) on the right. In the transport domain, an orange 'Topological link' connects the 'Function e.g., eNodeB function' to a 'Wire-line NE' box. The 'Wire-line NE' box contains a 'Connection termination point' (green box) and a 'Physical termination point' (purple box). A dashed green line connects the 'Function e.g., eNodeB function' to the 'Connection termination point'. A dashed purple line connects the 'Function e.g., eNodeB function' to the 'Physical termination point'. A solid blue line connects the 'Function e.g., eNodeB function' to the 'Wire-line NE'. The 'Wire-line NE' is connected to another 'NE with wireless access' box on the right. A legend on the right side defines the symbols: orange box for 'Network element', blue box for 'Link entity (connectivity e.g., X2)', orange line for 'Topological link', dashed green line for 'Based on connection termination point concept', dashed purple line for 'Based on physical termination point concept', blue box for '3GPP managed function', green box for 'Connection termination point', purple box for 'Physical termination point', dashed blue line for 'Association/relationship', and solid blue line for 'Optical fibre'. The text 'M.3020(17)\_FH.5' is at the bottom right. - -**Figure H.5 – Highlighting the boundary between transport and non-transport domains** - -### H.1.3 Usage in the transport domain - -The following guidelines must be applied to the models of the "transport domain". - -When considering interrelationships between classes the following guidelines should be applied: - -- If considering all current and recognised potential future cases it is expected that the relationship between two specific classes will be 0..1:0..1 then a simple association should be used - - This may benefit from an association class to convey rules and parameters about the association behaviour in complex cases. -- If there is recognised potential for cases currently or in future where there is a 0..\*:0..\* between two specific classes then intervening classes should be used to encapsulate the groupings, etc. so as to convert it to 0..1:n..\* - - Note that the 0..1:n..\* association may benefit from an association class to convey rules and parameters about the association behaviour in complex cases but in the instance form this can probably be ignored or folded into the intervening class -- In general it seems appropriate to use an association class when the properties on the relationship instance cannot be obviously or reasonably folded into one of the classes at either end of the association and when there is no interdependency between association instances between a set of instances of the classes. - -An example of usage of intervening class is the case of the TP-TP (TerminationPoint) relationship (0..\*:0..\*) where the SNC (SubNetworkConnection) is added as the intervening class between - -multiple TPs, i.e., TP-SNC. Note that TP-SNC actually becomes 0..2:n..\* due to directionality encapsulation. - -Considering the case of the adjacency relationship between PTPs it is known that although the current common cases are 1:1 there are some current and many potential future case of 0..\*:0..\* and hence a model that has an intervening class, i.e., the TopologicalLink, should be used. - -For a degenerate instance cases of 0..\*:0..\* that happens to be 0..1:0..1 the intervening class pattern should still be used: - -- Using the 0..1:0..1 direct association in this degenerate case brings unnecessary variety to the model and hence to the behaviour of the application (the 0..1:n..\* model covers the 0..1:0..1 case with one single code form clearly) -- An instance of the 0..1:0..1 model may need to be migrated to 0..1:n..\* as a result of some change in the network forcing an unnecessary administrative action to transition the model form where as in the 0..1:n..\* form requires no essential change. - -## H.2 Use of "ExternalXyz" class - -For further study. - -# Appendix I - -## Comparison with Recommendation ITU-T Z.601 - -(This appendix does not form an integral part of this Recommendation.) - -This appendix provides information on the relationship between this Recommendation and [b-ITU-T Z.601] that is used for the development of ITU-T M.1400.x series of Recommendations (see Bibliography). - -While this Recommendation provides a methodology for specifying management interfaces between two physical systems, [b-ITU-T Z.601] provides a framework for the development of one system. This data architecture identifies candidate interfaces within one system as well as the interfaces on the boundary of this system. These interfaces at the boundary will be between systems. - -The methodology specified by this Recommendation is primarily aimed at the development of a set of management interface Recommendations rather than of individual systems. The data architecture prescribes no requirements capture similar to the requirements phase, as it prescribes the specification of individual systems only, not their purpose relative to an organization. - -[b-ITU-T Z.601] focuses on specification of the external terminology and grammar as perceived by the end users. This Recommendation focuses on specification of management interfaces, which may not be perceived by the end users. - -In this Recommendation, the requirements for the problem being solved fall into two classes. The first class of requirements is referred to as business requirements; the second class is referred to as specification requirements. The specification requirements may include requirements to support end-user interaction at their human-computer interfaces. Some of these requirements may specify syntactical requirements to be supported over any management interface. Syntactical requirements correspond to external terminology schemata of the data architecture as described in [b-ITU-T Z.601]. - -The output of the analysis phase will be an information model. This corresponds to a concept schema of the data architecture as described in [b-ITU-T Z.601]. If the information models from the analysis phase do not convey all the necessary information from the syntactical requirements, the implementation design may need to include a mapping from the syntactical requirements. - -The documentation from the implementation design phase will consist of two parts: - -- 1) A technology-dependent data specification common for several interfaces, e.g., using GDMO or CORBA IDL, corresponding to an internal terminology schema according to the data architecture in [b-ITU-T Z.601]. -- 2) A technology-dependent specification of each interface, e.g., using CMIP or CORBA IDL, corresponding to a distribution schema according to the data architecture in [b-ITU-T Z.601]. - -# Appendix II - -## Additional UML usage examples - -(This appendix does not form an integral part of this Recommendation.) - -This appendix contains additional examples on the use of the UML described in Annex C. - -## II.1 Proxy class - -#### II.1.1 First example - -This shows a <> named YyyFunction. It represents all IOCs listed in the Note under the UML diagram. All the listed IOCs, in the context of this example, inherit from ManagedFunction IOC (see Figure II.1). - -The use of <> eliminates the need to draw multiple UML <> boxes, i.e., those whose names are listed in the Note, in the UML diagram. - -![UML diagram showing a ProxyClass (YyyFunction) inheriting from an InformationObjectClass (ManagedFunction).](ff7977984f2552f326b2089d7595fff3_img.jpg) - -The diagram shows two classes. The top class is a yellow box labeled <> ManagedFunction (from TS 32.622). The bottom class is a yellow box labeled <> YyyFunction. A red inheritance arrow points from the bottom class to the top class. - -UML diagram showing a ProxyClass (YyyFunction) inheriting from an InformationObjectClass (ManagedFunction). - -NOTE – The YyyFunction <> represents AsFunction, AucFunction, BgFunction, etc. - -Figure II.1 – <> Notation example II.1 - -#### II.1.2 Second sample - -Figure II.2 shows a <> named YyyFunction. It represents all IOCs listed in the Note right under the UML diagram. All the listed IOCs, in the context of this sample, have link (internal and external) relations. - -The actual names of the IOC represented by InternalYyyFunction <> and by the ExternalYyyFunction <> are listed under the subclause of X.Y of the associated YyyFunction. For example, under X.Y.1 for AsFunction, two paragraphs are added to list all peer internal entities and external entities that are linked with AsFunction. See sample in quotation below that is using AsFunction as a sample for YyyFunction. - -The actual names of the IOC represented by Link\_a\_z <> and by ExternalLink\_a\_z <> are listed under the subclause of X.Y of the associated YyyFunction. For example, under X.Y.1 for AsFunction, two paragraphs are added to list the names of the IOCs represented by Link\_a\_z and by ExternalLink\_a\_z. See the quoted text below that is using AsFunction as a sample for YyyFunction. - -" - -### X.Y.1 AsFunction - -#### X.Y.1.1 Definition - -This IOC represents As functionality. For more information about the As, see [b-3GPP TS 23.002]. - -The linked InternalYyyFunction <> represents SlsFunction, CscfFunction, HlrFunction ... - -The linked ExternalYyyFunction <> represents ... - -The Link\_a\_z <> represents Link\_As\_Scscf, Link\_Bgcf\_Scscf ... - -The ExternalLink\_a\_z <> represents ... - -" - -![UML class diagram showing relationships between proxy classes.](4bfb457b83429c217736e6d51b2f3945_img.jpg) - -``` -classDiagram - class Link_a_z["<> Link_a_z"] - class ExternalLink_a_z["<> ExternalLink_a_z"] - class InternalYyyFunction["<> InternalYyyFunction"] - class YyyFunction["<> YyyFunction"] - class ExternalYyyFunction["<> ExternalYyyFunction"] - - Link_a_z --- YyyFunction - ExternalLink_a_z --- YyyFunction - InternalYyyFunction --- YyyFunction - YyyFunction --- ExternalYyyFunction -``` - -The diagram illustrates a network of proxy classes. At the center is a class box labeled '<> YyyFunction'. To its left is '<> InternalYyyFunction', connected by a horizontal line. To its right is '<> ExternalYyyFunction', also connected by a horizontal line. Above the central class is '<> Link\_a\_z', connected by a vertical line that meets a horizontal line extending from the left class. Similarly, above the central class is '<> ExternalLink\_a\_z', connected by a vertical line that meets a horizontal line extending from the right class. - -UML class diagram showing relationships between proxy classes. - -NOTE – The 'Yyy' of YyyFunction <> represents AsFunction, AucFunction, etc. - -**Figure II.2 – <> Notation sample II.2** - -# Appendix III - -## Guidelines on requirements numbering - -(This appendix does not form an integral part of this Recommendation.) - -The format for requirements numbering is the following: - -REQ-Label-Category-Number - -where "Label" is an abbreviation for the Recommendation (or part thereof). The set of labels is not finite and not subject for standardization. The set of categories is defined in this Recommendation. - -Some issues: - -- How to structure the label in a large requirements specification? -- How to handle deletion and addition of requirements? - -The following guidelines are found to be useful: - -- Requirements should never be renumbered. The only exception to this case is the first publication of a specification, but even in this case it may be better to avoid renumbering as the specification may have been used also in its draft form. -- Given that requirements are not to be renumbered, it cannot be expected that the requirements are numbered sequentially throughout the specification. -- The label can be used to divide the numbering into logical partitions. As an example, the style of "A\_B" is recommended to identify "B" as a logical partition of "A". However, other styles can be used as long as the structure with "-" separating the fields of the requirements number is maintained. -- Use of postfix or prefix notations, i.e., adding something in front of "Number" or following "Number", are not recommended since the "Number" part is not intended to convey semantic information. -- As an alternative to the "A\_B" style, the authors of a specification may choose to assign a number range to a group of requirements. This approach should be allowed. - -# Appendix IV - -## Stereotypes for naming purposes - -(This appendix does not form an integral part of this Recommendation.) - -Figure IV.1 illustrates the various stereotypes for naming purposes. - -- a) The `<>` with solid-diamond (see clause C.3.3) identifies: - - The naming class (close to the solid diamond) and a named class; - - The naming scheme is DN; - - The container (close to the solid diamond) and the content. -- b) The `<>` with other types of associations (and excluding those labelled "Not Allowed") identifies: - - The naming class (close to the hollow diamond or the source with regard to arrow direction) and a named class (the target); - - The naming scheme is DN. -- c) The `<>` with dependency (dotted arrowed line) identifies: - - The naming class (target with regard to arrow direction) and a named class (the source); - - The naming scheme is DN. - -![Figure IV.1 – Various forms of naming stereotypes. The diagram shows 18 classes (Class1 to Class18) grouped into four colored boxes with annotations. A legend at the bottom identifies 'naming classes' (green) and 'named classes' (blue).](a634891d16b60b21df90a35c2af72c67_img.jpg) - -The diagram illustrates various forms of naming stereotypes using UML class diagrams. It is divided into four colored boxes, each containing a different association type between a 'naming class' (green) and a 'named class' (blue). Annotations on the right indicate the status of these stereotypes. - -- Top Box (Blue):** Contains Class1, Class2, Class3, Class4, Class5, and Class6. Class1 has a `<>` dependency on Class2. Class3 has a `<>` association with Class4 (multiplicity 0..1). Class5 has a `<>` association with Class6 (multiplicity \*). A note indicates this group is "under investigation in RMA Phase 2". -- Second Box (Green):** Contains Class7 and Class8. Class7 has a `<>` association with Class8 (multiplicity \*). A note indicates this is "allowed in RMA Phase1". -- Third Box (Red):** Contains Class9, Class10, Class11, Class12, Class17, and Class18. Class9 has a `<>` association with Class10 (multiplicity \*). Class11 has a `<>` association with Class12 (multiplicity 1). Class17 has a `<>` association with Class18 (multiplicity 0..1). A note indicates this group is "not allowed". -- Bottom Box (Blue):** Contains Class13, Class14, Class15, and Class16. Class13 has a `<>` dependency on Class14. Class15 has a `<>` dependency on Class16. A note indicates this group is "under investigation in RMA Phase 2". - -Legend: **naming classes** (green), **named classes** (blue). - -Figure IV.1 – Various forms of naming stereotypes. The diagram shows 18 classes (Class1 to Class18) grouped into four colored boxes with annotations. A legend at the bottom identifies 'naming classes' (green) and 'named classes' (blue). - -Figure IV.1 – Various forms of naming stereotypes - -# Bibliography - -- [b-ITU-T M.1401] Recommendation ITU-T M.1401 (2006), *Formalization of interconnection designations among operators' telecommunication networks.* -- [b-ITU-T M.1402] Recommendation ITU-T M.1402 (2012), *Formalization of data for service management.* -- [b-ITU-T M.1403] Recommendation ITU-T M.1403 (2007), *Formalization of generic orders.* -- [b-ITU-T M.1404] Recommendation ITU-T M.1404 (2007), *Formalization of orders for interconnections among operators' networks.* -- [b-ITU-T M.1405] Recommendation ITU-T M.1405 (2007), *Formalization of orders for service management among operators.* -- [b-ITU-T Z.601] Recommendation ITU-T Z.601 (2007), *Data architecture of one software system.* -- [b-3GPP TS 23.002] 3GPP TS 23.002 V17.0.0 (2021-03), *Network architecture.* -- [b-3GPP TS 32.101] 3GPP TS 32.101 V17.0.0 (2022-03), *Telecommunication management; Principles and high level requirements.* -- [b-3GPP TS 32.150] 3GPP TS 32.150 V17.0.0 (2022-03), *Telecommunication management; Integration Reference Point (IRP) Concept and definitions.* -- [b-3GPP TS 32.156] 3GPP TS 32.156 V17.2.0 (2022-12), *Telecommunication management; Fixed Mobile Convergence (FMC) model repertoire.* -- [b-3GPP TS 32.157] 3GPP TS 32.157 V17.0.0 (2022-03), *Telecommunication management; Integration Reference Point (IRP) Information Service (IS) template.* -- [b-3GPP TS 32.160] 3GPP TS 32.160 V17.6.0 (2022-12), *Management and orchestration; Management service template.* -- [b-3GPP TS 32.300] 3GPP TS 32.300 V17.0.0 (2022-03), *Telecommunication management; Configuration Management (CM); Name convention for Managed Objects.* -- [b-3GPP TS 32.302] 3GPP TS 32.302 V17.0.0 (2022-03), *Telecommunication management; Configuration Management (CM); Notification Integration Reference Point (IRP); Information Service (IS).* - - - - - -# SERIES OF ITU-T RECOMMENDATIONS - -| | | -|-----------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------| -| Series A | Organization of the work of ITU-T | -| Series D | Tariff and accounting principles and international telecommunication/ICT economic and policy issues | -| Series E | Overall network operation, telephone service, service operation and human factors | -| Series F | Non-telephone telecommunication services | -| Series G | Transmission systems and media, digital systems and networks | -| Series H | Audiovisual and multimedia systems | -| Series I | Integrated services digital network | -| Series J | Cable networks and transmission of television, sound programme and other multimedia signals | -| Series K | Protection against interference | -| Series L | Environment and ICTs, climate change, e-waste, energy efficiency; construction, installation and protection of cables and other elements of outside plant | -| Series M | Telecommunication management, including TMN and network maintenance | -| Series N | Maintenance: international sound programme and television transmission circuits | -| Series O | Specifications of measuring equipment | -| Series P | Telephone transmission quality, telephone installations, local line networks | -| Series Q | Switching and signalling, and associated measurements and tests | -| Series R | Telegraph transmission | -| Series S | Telegraph services terminal equipment | -| Series T | Terminals for telematic services | -| Series U | Telegraph switching | -| Series V | Data communication over the telephone network | -| Series X | Data networks, open system communications and security | -| Series Y | Global information infrastructure, Internet protocol aspects, next-generation networks, Internet of Things and smart cities | -| Series Z | Languages and general software aspects for telecommunication systems | \ No newline at end of file diff --git a/marked/M/T-REC-M.3080-202102-I_PDF-E/08a978a124d3ed6cf1a3d0cfd89418d0_img.jpg b/marked/M/T-REC-M.3080-202102-I_PDF-E/08a978a124d3ed6cf1a3d0cfd89418d0_img.jpg deleted file mode 100644 index db3a38c033347284e438d3c46e2d6076a9731f6e..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3080-202102-I_PDF-E/08a978a124d3ed6cf1a3d0cfd89418d0_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:b99872ab48d68a8ad37d9d342b3b1a072c965da954770493c2ff5545913f5f75 -size 165640 diff --git a/marked/M/T-REC-M.3080-202102-I_PDF-E/0f2a1e4a7b12fe5b8749882ecd636f5c_img.jpg b/marked/M/T-REC-M.3080-202102-I_PDF-E/0f2a1e4a7b12fe5b8749882ecd636f5c_img.jpg deleted file mode 100644 index bc0b7d230aa814ba7ff9ac76ad42df85d1a5e392..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3080-202102-I_PDF-E/0f2a1e4a7b12fe5b8749882ecd636f5c_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:b0c7abe2c31f090e1c85560f9d1d8a3f7be583ad8383d32f010ee596b2f00001 -size 5264 diff --git a/marked/M/T-REC-M.3080-202102-I_PDF-E/14a22f23ced8ba1d63ece69861dbaacc_img.jpg b/marked/M/T-REC-M.3080-202102-I_PDF-E/14a22f23ced8ba1d63ece69861dbaacc_img.jpg deleted file mode 100644 index ed476c5649e9eff05f321dedca1c27fd9d06292e..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3080-202102-I_PDF-E/14a22f23ced8ba1d63ece69861dbaacc_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:c5d6ca7c564f9ab460a2e13cdcf1238a34c895bc9de4cd17bdb8b7379ec4b288 -size 5530 diff --git a/marked/M/T-REC-M.3080-202102-I_PDF-E/5445597cceefaca1ac89e710fe339325_img.jpg b/marked/M/T-REC-M.3080-202102-I_PDF-E/5445597cceefaca1ac89e710fe339325_img.jpg deleted file mode 100644 index 51e404213a852c62852a622b8323af431aa89060..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3080-202102-I_PDF-E/5445597cceefaca1ac89e710fe339325_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:da3a8eb5a8ecdc6aad8366379c639207b2a0ff533e31cdd358a81eecac82f8f0 -size 166423 diff --git a/marked/M/T-REC-M.3080-202102-I_PDF-E/8fa679f79a1bb1f527cba9f29e784e89_img.jpg b/marked/M/T-REC-M.3080-202102-I_PDF-E/8fa679f79a1bb1f527cba9f29e784e89_img.jpg deleted file mode 100644 index ab436a3a95630a6d01951b6ad4a063fe884b7874..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3080-202102-I_PDF-E/8fa679f79a1bb1f527cba9f29e784e89_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:e32c36d24563c259c2bc035cdf58d261c73e6f36ea9e000162c56375c0b4df8c -size 3110 diff --git a/marked/M/T-REC-M.3080-202102-I_PDF-E/9c6461e1e94afae4dec455e69a2ce152_img.jpg b/marked/M/T-REC-M.3080-202102-I_PDF-E/9c6461e1e94afae4dec455e69a2ce152_img.jpg deleted file mode 100644 index d10e210fc9681951b00a7be5d996ed8b71ff48ab..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3080-202102-I_PDF-E/9c6461e1e94afae4dec455e69a2ce152_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:6ea1eff168abaa18ee3e807d158ec9f3e65fe7aec8baddea323140a33197802b -size 165051 diff --git a/marked/M/T-REC-M.3080-202102-I_PDF-E/b0d4609bc46c2d88a8318706bb5321f7_img.jpg b/marked/M/T-REC-M.3080-202102-I_PDF-E/b0d4609bc46c2d88a8318706bb5321f7_img.jpg deleted file mode 100644 index 6e8963c5aa28ec3ba478d5cbad525ffe2b820c31..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3080-202102-I_PDF-E/b0d4609bc46c2d88a8318706bb5321f7_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:7930c93851400e06322e92a6cbb3cfeabf048c7f4689df22eb0e5f8aeabe9d88 -size 20426 diff --git a/marked/M/T-REC-M.3080-202102-I_PDF-E/cab0834804fb031b43865554cc8d06ab_img.jpg b/marked/M/T-REC-M.3080-202102-I_PDF-E/cab0834804fb031b43865554cc8d06ab_img.jpg deleted file mode 100644 index 456a7824257a4f4bb120213fd94030a74b10afe7..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3080-202102-I_PDF-E/cab0834804fb031b43865554cc8d06ab_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:aa343546063e2cb39bdc4ce620e72a0246d28b0cc597ffcbcc28ec6a3f43ae02 -size 161088 diff --git a/marked/M/T-REC-M.3080-202102-I_PDF-E/d26959f4514c26ca19c3d6f00da85956_img.jpg b/marked/M/T-REC-M.3080-202102-I_PDF-E/d26959f4514c26ca19c3d6f00da85956_img.jpg deleted file mode 100644 index b0b1e6b203489d5805750da6f0697b7fecf0dc0c..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3080-202102-I_PDF-E/d26959f4514c26ca19c3d6f00da85956_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:8dc554f50d327f5fbdb235dde887700d91aae7663aa5fd3e8a3c502d3a09ed20 -size 49469 diff --git a/marked/M/T-REC-M.3080-202102-I_PDF-E/d4af765160d04ecef538e5066006dc77_img.jpg b/marked/M/T-REC-M.3080-202102-I_PDF-E/d4af765160d04ecef538e5066006dc77_img.jpg deleted file mode 100644 index 32ffd4d8d8033ee7dab5adfc41585e7c0997a259..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3080-202102-I_PDF-E/d4af765160d04ecef538e5066006dc77_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:45e1a68822ed0fa0c28a8a33951f67f7e04444a3a494786a86a113252b52ce9c -size 201254 diff --git a/marked/M/T-REC-M.3080-202102-I_PDF-E/ff7ce44f3fdd51bae7b231f34df07c6a_img.jpg b/marked/M/T-REC-M.3080-202102-I_PDF-E/ff7ce44f3fdd51bae7b231f34df07c6a_img.jpg deleted file mode 100644 index ed21fe65ace00bbe913373659ca833f5d5766b43..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3080-202102-I_PDF-E/ff7ce44f3fdd51bae7b231f34df07c6a_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:02bf87cc334cc0ebe54f371c4ecf5955b05b9b2394b7ba684c201abcb9be6d0a -size 100816 diff --git a/marked/M/T-REC-M.3080-202102-I_PDF-E/raw.md b/marked/M/T-REC-M.3080-202102-I_PDF-E/raw.md deleted file mode 100644 index adb7823fa8eca87db89082b67ccfd15746f2cab8..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3080-202102-I_PDF-E/raw.md +++ /dev/null @@ -1,747 +0,0 @@ - - -International Telecommunication Union - -**ITU-T** - -TELECOMMUNICATION -STANDARDIZATION SECTOR -OF ITU - -**M.3080** - -(02/2021) - -SERIES M: TELECOMMUNICATION MANAGEMENT, -INCLUDING TMN AND NETWORK MAINTENANCE - -Telecommunications management network - ---- - -**Framework of artificial intelligence enhanced -telecom operation and management (AITOM)** - -Recommendation ITU-T M.3080 - -# ITU-T M-SERIES RECOMMENDATIONS **TELECOMMUNICATION MANAGEMENT, INCLUDING TMN AND NETWORK MAINTENANCE** - -| | | -|---------------------------------------------------------------------------------|----------------------| -| Introduction and general principles of maintenance and maintenance organization | M.10–M.299 | -| International transmission systems | M.300–M.559 | -| International telephone circuits | M.560–M.759 | -| Common channel signalling systems | M.760–M.799 | -| International telegraph systems and phototelegraph transmission | M.800–M.899 | -| International leased group and supergroup links | M.900–M.999 | -| International leased circuits | M.1000–M.1099 | -| Mobile telecommunication systems and services | M.1100–M.1199 | -| International public telephone network | M.1200–M.1299 | -| International data transmission systems | M.1300–M.1399 | -| Designations and information exchange | M.1400–M.1999 | -| International transport network | M.2000–M.2999 | -| Telecommunications management network | M.3000–M.3599 | -| Integrated services digital networks | M.3600–M.3999 | -| Common channel signalling systems | M.4000–M.4999 | - -*For further details, please refer to the list of ITU-T Recommendations.* - -# Recommendation ITU-T M.3080 - -## Framework of artificial intelligence enhanced telecom operation and management (AITOM) - -## Summary - -Recommendation ITU-T M.3080 provides a framework of artificial intelligence enhanced telecom operation and management (AITOM). It describes the functional framework of AITOM to support telecom operation management for efficiency improvement, quality assurance, cost management, and security assurance. It also describes artificial intelligence (AI) pipelines that combine some components to enable AI based applications. - -This Recommendation also describes the relationship of the functional framework of AITOM with smart operations, management and maintenance (SOMM) presented in Recommendation ITU-T M.3041. General requirements of security are also described. - -## History - -| Edition | Recommendation | Approval | Study Group | Unique ID* | -|---------|----------------|------------|-------------|---------------------------------------------------------------------------| -| 1.0 | ITU-T M.3080 | 2021-02-13 | 2 | 11.1002/1000/14590 | - -## Keywords - -AITOM, framework. - ---- - -\* To access the Recommendation, type the URL in the address field of your web browser, followed by the Recommendation's unique ID. For example, . - -## FOREWORD - -The International Telecommunication Union (ITU) is the United Nations specialized agency in the field of telecommunications, information and communication technologies (ICTs). The ITU Telecommunication Standardization Sector (ITU-T) is a permanent organ of ITU. ITU-T is responsible for studying technical, operating and tariff questions and issuing Recommendations on them with a view to standardizing telecommunications on a worldwide basis. - -The World Telecommunication Standardization Assembly (WTSA), which meets every four years, establishes the topics for study by the ITU-T study groups which, in turn, produce Recommendations on these topics. - -The approval of ITU-T Recommendations is covered by the procedure laid down in WTSA Resolution 1. - -In some areas of information technology which fall within ITU-T's purview, the necessary standards are prepared on a collaborative basis with ISO and IEC. - -## NOTE - -In this Recommendation, the expression "Administration" is used for conciseness to indicate both a telecommunication administration and a recognized operating agency. - -Compliance with this Recommendation is voluntary. However, the Recommendation may contain certain mandatory provisions (to ensure, e.g., interoperability or applicability) and compliance with the Recommendation is achieved when all of these mandatory provisions are met. The words "shall" or some other obligatory language such as "must" and the negative equivalents are used to express requirements. The use of such words does not suggest that compliance with the Recommendation is required of any party. - -## INTELLECTUAL PROPERTY RIGHTS - -ITU draws attention to the possibility that the practice or implementation of this Recommendation may involve the use of a claimed Intellectual Property Right. ITU takes no position concerning the evidence, validity or applicability of claimed Intellectual Property Rights, whether asserted by ITU members or others outside of the Recommendation development process. - -As of the date of approval of this Recommendation, ITU had not received notice of intellectual property, protected by patents, which may be required to implement this Recommendation. However, implementers are cautioned that this may not represent the latest information and are therefore strongly urged to consult the TSB patent database at . - -© ITU 2021 - -All rights reserved. No part of this publication may be reproduced, by any means whatsoever, without the prior written permission of ITU. - -## Table of Contents - -| | Page | -|--------------------------------------------------------------------------------|------| -| 1 Scope ..... | 1 | -| 2 References..... | 1 | -| 3 Definitions ..... | 2 | -| 3.1 Terms defined elsewhere ..... | 2 | -| 3.2 Terms defined in this Recommendation..... | 3 | -| 4 Abbreviations and acronyms ..... | 3 | -| 5 Conventions ..... | 4 | -| 6 Introduction ..... | 4 | -| 7 General requirements of AITOM ..... | 4 | -| 8 Functional framework of AITOM ..... | 5 | -| 8.1 Top views of AITOM..... | 5 | -| 8.2 AI engine ..... | 7 | -| 8.3 Customer-oriented marketplace layer..... | 10 | -| 8.4 Sub-functions in SOMM ..... | 10 | -| 9 AI pipeline within AITOM..... | 11 | -| 9.1 Introduction of AI pipeline within AITOM..... | 11 | -| 9.2 AI pipeline in the development state ..... | 11 | -| 9.3 AI pipeline in the operation state..... | 16 | -| 10 Security requirements for AITOM ..... | 17 | -| Annex A – The background and main characteristics of the AITOM framework ..... | 18 | - - - -# Recommendation ITU-T M.3080 - -## Framework of artificial intelligence enhanced telecom operation and management (AITOM) - -## 1 Scope - -This Recommendation provides a framework for artificial intelligence (AI) enhanced telecom operation and management (AITOM). It describes the functional framework of AITOM to support telecom operation management for efficiency improvement, quality assurance, cost management, and security assurance. It also describes the artificial intelligence (AI) pipeline which combines some components to enable AI based applications. - -This Recommendation also describes the relationship of the functional framework of AITOM with smart operations, management and maintenance (SOMM). General requirements of security are also described. - -## 2 References - -The following ITU-T Recommendations and other references contain provisions which, through reference in this text, constitute provisions of this Recommendation. At the time of publication, the editions indicated were valid. All Recommendations and other references are subject to revision; users of this Recommendation are therefore encouraged to investigate the possibility of applying the most recent edition of the Recommendations and other references listed below. A list of the currently valid ITU-T Recommendations is regularly published. The reference to a document within this Recommendation does not give it, as a stand-alone document, the status of a Recommendation. - -- [ITU-T M.3010] Recommendation ITU-T M.3010 (2000), *Principles for a telecommunications management network*. -- [ITU-T M.3016.2] Recommendation ITU-T M.3016.2 (2005), *Security for the management plane: Security services*. -- [ITU-T M.3041] Recommendation ITU-T M.3041 (2020), *Framework of smart operation, management and maintenance*. -- [ITU-T X.805] Recommendation ITU-T X.805 (2003), *Security architecture for systems providing end-to-end communications*. -- [ITU-T X.1111] Recommendation ITU-T X.1111 (2007), *Framework of security technologies for home network*. -- [ITU-T Y.3100] Recommendation ITU-T Y.3100 (2017), *Terms and definitions for IMT-2020 network*. -- [ITU-T Y.3172] Recommendation ITU-T Y.3172 (2019), *Architectural framework for machine learning in future networks including IMT-2020*. -- [ETSI GR ENI 004] European Telecommunication Standards Institute (2019), *Experiential Networked Intelligence (ENI); Terminology for Main Concepts in ENI*. - -## 3 Definitions - -### 3.1 Terms defined elsewhere - -This Recommendation uses the following terms defined elsewhere: - -**3.1.1 artificial intelligence (AI)** [ETSI GR ENI 004]: Computerized system that uses cognition to understand information and solve problems. - -NOTE 1 – ISO/IEC 2382-28 defines AI as "an interdisciplinary field, usually regarded as a branch of computer science, dealing with models and systems for the performance of functions generally associated with human intelligence, such as reasoning and learning". - -NOTE 2 – In computer science AI research is defined as the study of "intelligent agents": any device that perceives its environment and takes actions to achieve its goals. - -NOTE 3 – This includes pattern recognition, the application of machine learning and related techniques. - -NOTE 4 – Artificial-intelligence is the whole idea and concept of machines being able to carry out tasks in a way that mimics human intelligence and would be considered "smart". - -**3.1.2 management function** [ITU-T M.3010]: The smallest part of a business process (or management service) as perceived by the user of the process (or service). - -**3.1.3 management function set** [ITU-T M.3010]: A grouping of management functions that contextually belong together. - -**3.1.4 machine learning (ML)** [ITU-T Y.3172]: Processes that enable computational systems to understand data and gain knowledge from it without necessarily being explicitly programmed. - -NOTE 1 – This definition is from [ETSI GR ENI 004]. - -NOTE 2 – Supervised machine learning and unsupervised machine learning are two examples of machine learning types. - -**3.1.5 machine learning model** [ITU-T Y.3172]: Model created by applying machine learning techniques to data to learn from. - -NOTE 1 – A machine learning model is used to generate predictions (e.g., regression, classification, clustering) on new (untrained) data. - -NOTE 2 – A machine learning model may be encapsulated in a deployable fashion in the form of a software (e.g., virtual machine, container) or hardware component (e.g., IoT device). - -NOTE 3 – Machine learning techniques include learning algorithms (e.g., learning the function that maps input data attributes to output data). - -**3.1.6 machine learning pipeline** [ITU-T Y.3172]: A set of logical nodes, each with specific functionalities, that can be combined to form a machine learning application in a telecommunication network. - -**3.1.7 management service** [ITU-T M.3010]: A management service is an offering fulfilling specific telecommunications management needs. - -**3.1.8 orchestration** [ITU-T Y.3100]: In the context of IMT-2020, the processes aiming at the automated arrangement, coordination, instantiation and use of network functions and resources for both physical and virtual infrastructures by optimization criteria. - -**3.1.9 orchestrator** [ITU-T Y.3100]: In the context of IMT-2020, an entity that fulfils orchestration functions. - -### 3.2 Terms defined in this Recommendation - -This Recommendation defines the following terms: - -**3.2.1 artificial intelligence capability set:** A set of functions that are provided based on orchestrated artificial intelligence (AI) models to meet the requirement of some specific application scenarios. - -NOTE 1 – Specific application scenarios are to realize quality assurance, efficiency improvement, cost management, security assurance and industry applications, which are used for telecom operation and management. - -NOTE 2 – An AI capability can be generated through AI models orchestration based on the requirement of a specific application scenario. - -NOTE 3 – These functions may, but do not have to, be used based on the requirements of specific application scenarios. - -**3.2.2 artificial intelligence engine:** The realization and mechanization, in software or hardware, of one or more functions dedicated to performing a specific artificial intelligence (AI) task. - -**3.2.3 artificial intelligence model:** The model created by applying artificial intelligence (AI) technology to data to learn from. - -**3.2.4 artificial intelligence pipeline:** A set of logical nodes, each with specific functionalities, that can be combined to form an artificial intelligence (AI) application in systems of telecom operation and management. - -**3.2.5 artificial intelligence sandbox:** An environment in which artificial intelligence (AI) models can be trained and tested, and their effects on the network are evaluated. - -**3.2.6 capability customization:** Personalized capability, which does not exist in the capability directory, customized for external customers to meet their requirements. - -**3.2.7 common artificial intelligence model repository:** The part of the archive that contains and manages the artificial intelligence (AI) models, constructed by general algorithms, such as classification algorithms, and is thus responsible for the storage and preservation of the AI models. - -**3.2.8 computing engine framework:** A framework which provides an operation environment or coding resources in the context of artificial intelligence (AI)-based applications or developments. - -**3.2.9 customer-oriented marketplace:** A collection of functional sets that exposes capability to external telecom customers, especially enterprises and industries. The exposed capability includes applications, service, data and artificial intelligence (AI) capability. - -## 4 Abbreviations and acronyms - -This Recommendation uses the following abbreviations and acronyms: - -| | | -|-------|---------------------------------------------------------| -| AI | Artificial Intelligence | -| AITOM | AI enhanced Telecom Operation and Management | -| APP | Application | -| B-OSF | Business management layer – Operations Systems Function | -| EMS | Element Management System | -| E-OSF | Element management layer – Operations Systems Function | -| MFS | Management Function Set | -| NFV | Network Function Virtualization | - -| | | -|-------|--------------------------------------------------------| -| NMS | Network Management System | -| N-OSF | Network management layer – Operations Systems Function | -| OAM | Operations, Administration and Maintenance | -| OS | Operations System | -| OSF | Operations Systems Function | -| PaaS | Platform as a Service | -| SMF | System Management Function | -| SOMM | Smart Operation Maintenance and Management | -| S-OSF | Service management layer – Operations Systems Function | -| TMN | Telecommunications Management Network | -| VIM | Virtual Infrastructure Management | - -## 5 Conventions - -In this Recommendation, the keyword "should" indicates a requirement that is recommended but not absolutely required. - -# 6 Introduction - -This Recommendation presents the functional framework of AI enhanced telecom operation and management (AITOM), which is used for supporting efficiency improvement, quality assurance, cost management, security assurance and industry application. - -The objective of the AITOM framework is to introduce the AI engine and customer-oriented marketplace layer to enhance the intelligence of the telecom operation management system based on smart operation maintenance and management (SOMM). In addition, based on the definition of the AITOM framework, AI pipeline is also described. - -More background about why artificial intelligence (AI) technology is introduced for telecom operation management systems and the characteristics of AITOM are described in Annex A. - -## 7 General requirements of AITOM - -To support telecom operation management for efficiency improvement, quality assurance, cost management, security assurance and industry application, AITOM may satisfy the following requirements: - -- AITOM is compatible with SOMM standard. -- AITOM has stronger artificial intelligence (AI) capabilities to support intelligent telecom operation management. -- AITOM supports a data driven based framework, for example data sharing, data mining, data correlation, machine learning and other usage intents. -- AITOM supports an integrated framework, which can be applied for current and future networks. It can also support cross-domain management activities to fulfil end-to-end services for customers. -- AITOM supports agile telecom management where a new operation system can be deployed quickly with the open services and convergent data, along with the common infrastructure platform for OSs. - -- AITOM supports the exposure of AI capabilities which can easily be exposed to any system within or out of AITOM. The systems out of AITOM refer to other industry systems, such as the financial industry, manufacturing industry, energy industry, etc. -- AITOM supports sandbox which supports the evaluation of AI pipeline. -- AITOM supports a security mechanism which guarantees AITOM operated in a safe way or environment. -- AITOM supports a closed-loop procedure of telecom operation management. - -## 8 Functional framework of AITOM - -### 8.1 Top views of AITOM - -The framework of AITOM adds a new area (AI engine) and a new layer (customer-oriented marketplace layer) based on a top layered functional framework of SOMM. Figure 8-1 shows the relationship between the top layered functional frameworks of AITOM and SOMM. - -![Diagram showing the relationship between the top layered functional frameworks of SOMM and AITOM. The SOMM framework consists of four stacked layers: Scenario application layer, Management service layer, Data convergence and management layer, and Infrastructure management layer. An arrow points to the AITOM framework, which adds a 'Customer-oriented marketplace layer' on top and an 'AI engine' block to the right of the original SOMM layers.](d26959f4514c26ca19c3d6f00da85956_img.jpg) - -The diagram illustrates the evolution of the top layered functional framework from SOMM to AITOM. On the left, the 'Top layered functional framework of SOMM' is shown as a vertical stack of four grey rounded rectangles: 'Scenario application layer', 'Management service layer', 'Data convergence and management layer', and 'Infrastructure management layer'. A yellow arrow points to the right, where the 'Top layered functional framework of AITOM' is shown. This framework consists of a blue rounded rectangle at the top labeled 'Customer-oriented marketplace layer'. Below it, a large grey rounded rectangle contains the text 'Top layered functional framework of SOMM'. To the right of this grey rectangle is a blue rounded rectangle labeled 'AI engine'. A small label 'M.3080(21)\_F8-1' is located at the bottom right of the AITOM framework diagram. - -Diagram showing the relationship between the top layered functional frameworks of SOMM and AITOM. The SOMM framework consists of four stacked layers: Scenario application layer, Management service layer, Data convergence and management layer, and Infrastructure management layer. An arrow points to the AITOM framework, which adds a 'Customer-oriented marketplace layer' on top and an 'AI engine' block to the right of the original SOMM layers. - -**Figure 8-1 – Relationship between top layered functional frameworks of AITOM and SOMM** - -The framework of AITOM is compliant with the top layered functional framework of SOMM but enhances it. To make the layer structure, functionality, security and extendibility of SOMM clearer or more reasonable, an independent area which is called AI engine is added to the right side of SOMM framework to provide AI capabilities to internal layers. A new layer called the customer-oriented marketplace layer is added to the top of the SOMM framework to provide open capabilities for external customers. - -The functional blocks contained in the AI engine and customer-oriented marketplace layer are defined respectively. A functional block chain called the AI pipeline is available based on the whole functional framework of AITOM, as shown in Figure 8-2. - -![Functional framework of AITOM diagram showing layers: Customer-oriented marketplace layer, SOMM (Scenario application, Management service, Data convergence and management, Infrastructure management), AI engine, and Network.](d4af765160d04ecef538e5066006dc77_img.jpg) - -The diagram illustrates the functional framework of AITOM, structured into several layers and components: - -- AITOM** (Overall Framework) - - Customer-oriented marketplace layer** - - Standardized capability directory - - Capability customization - - SOMM** (Service Oriented Management Framework) - - Scenario application layer** - - Smart operation - - Smart management - - Smart maintenance - - Smart comprehensive analysis - - Traditional B-OSFs - - Management service layer** - - Service opening sub-layer**: Service directory, Service management - - Service providing sub-layer**: SDN/NFV aware orchestration, Traditional S-OSFs, N-OSFs and E-OSFs - - Data convergence and management layer** - - Data management sub-layer**: Data lifecycle management, Data security management - - Data convergence sub-layer**: Data acquisition, Data processing, Data storage, Traditional N-OSFs and E-OSFs - - Infrastructure management layer** - - Infrastructure maintenance - - Infrastructure monitoring - - AI engine** - - AI capabilities management - - AI capability orchestration - - AI sandbox training - - Common AI model repository management - - Computing engine framework management - -**AI pipeline** (indicated by red arrows): A functional block chain connecting nodes across layers, specifically: Traditional B-OSFs → AI capabilities management → AI capability orchestration → Service management → Data security management → Common AI model repository management → Data storage → Traditional N-OSFs and E-OSFs. - -**Network** (underlay network, shown as a dashed oval at the bottom) - -M.3080(21)\_F8-2 - -Functional framework of AITOM diagram showing layers: Customer-oriented marketplace layer, SOMM (Scenario application, Management service, Data convergence and management, Infrastructure management), AI engine, and Network. - -**Figure 8-2 – Functional framework of AITOM** - -The customer-oriented marketplace layer aims for exposing the application, service, data and AI capability set of AITOM to external customers of telecom operators, especially for enterprise and industry customers. It has two functions, one of which is as a standardized capability directory and another is capability customization. The AI engine mainly provides AI capabilities to each layer of the SOMM functional framework, and has five functional blocks, which are AI capabilities management, AI capability orchestration, AI sandbox training, common AI model repository management and computing engine framework management. Each layer of the SOMM is the same as in [ITU-T M.3041]. The AI pipeline is a functional block chain, which is formed by some functional nodes of AITOM, including data collection, pre-processing, training or orchestration of the AI model, formulation or application of policy, and delivery of results. The underlay network provides data to data convergence and the management layer of SOMM in AITOM, but it is not included in the functional framework of AITOM. - -The symbol of the AI pipeline in Figure 8-3, and also in Figure 8-2, refers to the symbol of the machine learning (ML) pipeline in [ITU-T Y.3172], which denotes a subset (including proper subset) of nodes in an AI pipeline. - -![Symbol of AI pipeline: A red curved arrow pointing downwards, with the text 'AI pipeline' and 'M.3080(21)_F8-3' below it.](0f2a1e4a7b12fe5b8749882ecd636f5c_img.jpg) - -Symbol of AI pipeline: A red curved arrow pointing downwards, with the text 'AI pipeline' and 'M.3080(21)\_F8-3' below it. - -**Figure 8-3 – Symbol of AI pipeline** - -### 8.2 AI engine - -#### 8.2.1 Introduction of the architecture of the AI engine within AITOM - -![Architecture of the AI engine within AITOM diagram. The diagram shows a hierarchical structure of the AI engine. At the top is the 'AI Engine' box. Below it are five stacked boxes representing different management layers: 'AI capabilities management', 'AI capability orchestration', 'AI sandbox training', 'Common AI model repository management', and 'Computing engine framework management'. Each layer contains several sub-functions in boxes.](cab0834804fb031b43865554cc8d06ab_img.jpg) - -| AI Engine | | | | | -|-----------------------------------------------------|-----------------------------------------------|----------------------------------------------|-------------------------------------------|---------------------------------------------| -| AI capabilities management | | | | | -| AI capability requirement parsing | AI capability distribution | AI capability registration | AI capability cancellation | AI capability activation | -| AI capability orchestration | | | | | -| Quality assurance capability maintenance | Efficiency improvement capability maintenance | Cost management capability maintenance | Security assurance capability maintenance | Industry application capability maintenance | -| AI capability orchestrator | | | | | -| AI sandbox training | | | | | -| Feature data selection | Common AI model selection | Feature data pre-processing | Offline training | Model decision | -| Common AI model repository management | | | | | -| Data analysis model management | Machine learning model management | Deep learning model management | | | -| Computing engine framework management | | | | | -| Provision of open-source framework tools management | Provision of partner tools management | Provision of self-developed tools management | | | - -Architecture of the AI engine within AITOM diagram. The diagram shows a hierarchical structure of the AI engine. At the top is the 'AI Engine' box. Below it are five stacked boxes representing different management layers: 'AI capabilities management', 'AI capability orchestration', 'AI sandbox training', 'Common AI model repository management', and 'Computing engine framework management'. Each layer contains several sub-functions in boxes. - -M.3080(21)\_F8-4 - -**Figure 8-4 – Architecture of the AI engine within AITOM** - -Figure 8-4 shows more detailed functions of the AI engine. The computing engine framework provides a model framework and operation environment. The common AI model repository provides common AI models which are trained in an AI sandbox and orchestrated in AI capability orchestration. The trained AI models are transmitted from the AI sandbox to AI capability orchestration, and orchestrated AI capabilities are managed in AI capabilities management. - -#### 8.2.2 AI capabilities management - -AI capabilities management includes the following function set: - -- 1) *AI capability requirements parsing* – A parsing function that parses the AI capability requirements from customer-oriented marketplace layer and other layers of AITOM, maps the requirements into an AI sandbox and AI capability orchestration, or transfers them to AI capability registration. - -- 2) *AI capability distribution* – A distribution function that releases and distributes all AI capabilities from AI capability registration. The AI capabilities are open to the AITOM customer-oriented marketplace layer and other layer's OSs. -- 3) *AI capability registration* – A registration function that receives and registers the AI capabilities from AI capability orchestration, and establishes and maintains a directory for all the AI capabilities of AITOM. -- 4) *AI capability cancellation* – A cancellation function that cancels and updates AI capabilities from AI capability registration. -- 5) *AI capability activation* – A activation function that activates orchestrated AI capability and makes it in operated state after receiving requests from AI capabilities management. - -#### 8.2.3 AI capability orchestration - -There are five classifications of AI capabilities included in AI capability orchestration: quality assurance capability, efficiency improvement capability, cost management capability, security assurance capability and industry application capability, which constitute the AI capability set. All of them need to be orchestrated by AI capability orchestrator and maintained in AI capability orchestration. The functions of maintenance include update and revision for AI capabilities. AI capability orchestration includes the following management function set: - -- 1) *Quality assurance capability maintenance* – A management function that maintains the AI capability set of the telecom network based on quality assurance, provides accurate service quality experience, supports user experience optimization and improves the quality assurance efficiency of the telecom network fully. - -NOTE 1 – A typical AI capability set of quality assurance includes fault prediction, anomaly detection, and so on. - -- 2) *Efficiency improvement capability maintenance* – A management function that maintains the AI capability set of efficiency improvement of the telecom network. This AI capability set provides continuous and high-quality efficiency operations via deep insight capability. - -NOTE 2 – This kind of AI capability set includes intelligent work-order processing, intelligent strategy, and so on. - -- 3) *Cost management capability maintenance* – A management function that maintains the AI capability set of cost management. This kind of AI capability set is able to realize perceiving cost trend variation of the telecom network, support cost plan and optimization and improve cost management efficiency by intelligent resource optimization of the telecom network, capability management and performance optimization. - -NOTE 3 – This kind of AI capability includes cost analysis, cost decision, cost control, and so on. - -- 4) *Security assurance capability maintenance* – A management function that maintains the AI capability set of security assurance. This kind of AI capability set is used for security assurance of AITOM. - -- 5) *Industry application capability maintenance* – A management function that maintains the AI capability set of industry application for the telecom network and service. This kind of AI capability set is exposed to the capability marketplace and scenario application layer of AITOM. - -NOTE 4 – AITOM provides the capability to different industries like unmanned driving, intelligent city, and so on, via the telecom network and service, which is especially important in the 5G/IMT-2020 era. - -- 6) *AI capability orchestrator* – A management function that manages the orchestration of AI pipeline. One or multiple AI models which are trained by AI sandbox are orchestrated here to satisfy the requirements of specific application scenarios. The orchestrated AI capability is registered to AI capabilities management. - -#### 8.2.4 AI sandbox training - -AI sandbox training receives the requirements from AI capability requirement parsing. Based on the requirements, AI sandbox training selects the appropriate feature data and common AI model. After that, the model will be trained and tested by utilizing the AI pipeline so that the best model is selected and sent to the AI capability orchestrator for AI capability orchestration. These functions include: - -- 1) *Feature data selection* – A selection function that selects relevant feature data based on the requirement of AI capability requirement parsing. - -NOTE 1 – The feature data is selected from work-order data, network service, and so on, if the requirement is intelligent fault-removing. - -- 2) *Common AI model selection* – A selection function that selects an appropriate common data analysis or machine learning model for following analysis and training based on the requirement of AI capability requirement parsing and characteristics of feature data. - -NOTE 2 – Different common models are selected based on the data of different characteristics, for example, trajectory data and relevant model are used for network quality detection. - -- 3) *Feature data pre-processing* – A data processing function that processes the historic feature data from data convergence and management layer, extracts and processes the features according to selected models by data analysis tools, based on AI capability requirements. - -NOTE 3 – Feature data pre-processing is different from data processing in the data convergence and management layer which handles raw data from networks, terminals and infrastructure, including raw data cleaning and tagging. It processes the feature data from data storage of the data convergence and management layer, including extracting feature vectors, converting type of feature vectors and standardizing feature vectors according to selected common AI models and business requirements of AI capability. - -- 4) *Offline training* – A data training function that trains a model by utilizing fully historic data based on this function, and it does not affect, in real-time, the service rendered. - -- 5) *Model decision* – A decision or choice function that selects the optimal trained model based on a judging rule of service requirements and accuracy. The selected model is provided to AI capability orchestration. - -#### 8.2.5 Common AI model repository management - -This function defines different AI models which are service agnostic and includes three functions: - -- 1) *Data analysis model management* – A management function that provides maintenance and operation of a common data analysis model. In order to abstract useful information and form a conclusion, the data is studied in detail and summarized. The general method is like a Pareto chart. - -- 2) *Machine learning model management* – A management function that provides maintenance and operation of a machine learning algorithm. A typical machine learning model is like a decision tree or a support vector machine. From a learning method point of view, a machine learning algorithm consists of supervised learning, unsupervised learning, semi-supervised learning, ensemble learning, deep learning and reinforcement learning. - -- 3) *Deep learning model management* – A management function that provides maintenance and operation of a deep learning algorithm. Deep learning is a kind of machine learning based on neural networks, which could be convolutional neural networks, recurrent neural networks and recursive neural networks. - -NOTE 1 – The difference among AI, machine learning and deep learning is that the scope of AI is wider and could include machine learning, which is one of the AI methods. Deep learning is not an independent learning method here, and it would be seen as one specific technology to achieve machine learning. - -NOTE 2 – The relationships between AI capability orchestration, AI sandbox training and common AI model repository management are that a trained AI model is set specific parameters in AI sandbox training based on common AI model in common AI model repository and selected feature data in it, and a specific AI capability is a set of orchestrated AI models in AI capability orchestration that can perform a specific AI application, such as intelligent fault location. - -#### 8.2.6 Computing engine framework management - -All the AI models need to be operated with a computing engine framework. The functions of the computing engine framework include: - -- 1) *Provision of open-source framework tools management* – A management function that provides the computing engine framework tools of open-source and supports the operation of data analysis, machine learning and deep learning algorithms. - -NOTE – Some open-source frameworks are TensorFlow, PyTorch and Scikit-learn. - -- 2) *Provision of partner tools management* – A management function that provides computing engine framework tools from partners and support the operation of data analysis, machine learning and deep learning algorithms. - -- 3) *Provision of self-developed tools management* – A management function that provides computing engine framework tools based on a self-developed framework and supports the operation of data analysis, machine learning and deep learning algorithms. - -### 8.3 Customer-oriented marketplace layer - -The customer-oriented marketplace layer has two functions, including: - -- 1) *Standardized capability directory* – A storage function that builds and maintains a directory for standardized capability of AITOM to external customer. -- 2) *Capability customization* – A storage function that customizes and maintains the personalized capability in case standardized capability cannot satisfy the requirement of external customers. - -NOTE – The management service layer in SOMM architecture, which is proposed in [ITU-T M.3041], includes service exposure of every layer of AITOM. It is not recommended to do an additional definition for this aspect. - -### 8.4 Sub-functions in SOMM - -#### 8.4.1 Scenario application layer - -Reusing [ITU-T M.3041]. This layer includes the typical and emerging operation maintenance scenarios which includes smart operation, smart management, smart maintenance, smart comprehensive analysis and traditional business-level operations, administration and maintenance (OAM). - -#### 8.4.2 Management service layer - -Reusing [ITU-T M.3041]. This layer incorporates the capability of fundamental functions of OSs which can be packaged as different services to be opened to the scenario application layer. - -#### 8.4.3 Data convergence and management layer - -Reusing [ITU-T M.3041], this layer provides the capability of data-driven ability and converges the mass of data from different OSs to a unified data model, supporting data sharing, data mining, data correlation, machine learning and other usage intents. - -#### 8.4.4 Infrastructure management layer - -Reusing [ITU-T M.3041], this layer is the operational foundations. The infrastructure could possibly be based on physical servers or the cloud, and platform as a service (PaaS) components providing IT services. - -## 9 AI pipeline within AITOM - -### 9.1 Introduction of AI pipeline within AITOM - -[ITU-T Y.3172] describes ML pipeline, which is referred to by the AI pipeline. The steps of AI sandbox training and AI capability orchestration refer to the ML pipeline operation and training of ML models after orchestration. But the AI pipeline differs from the ML pipeline. The ML pipeline is used for the network layer, while the AI pipeline is used for the management layer, which has a higher position as shown in Figure 8-2. In addition, ML related models are only part of the AI models. - -The AI pipeline has two states, one is a development state and the other is an operation state. It could be used for AI sandbox training and AI capability orchestration of a specific application for offline data in the development state, then used for AI capability operation for online data in the operation state. - -In the development state, the AI model is trained in an AI sandbox and provided to an AI capability orchestrator based on the AI capability requirements from AI capability requirement parsing, and the orchestrated AI capability will be activated and operated in the operation state. - -In the operation state, the AI capability orchestrated by the development state is activated and operated based on the AI capability requirements from AI capability requirement parsing. The capability quality could be improved by new data based on online retraining or incremental retraining. - -NOTE – Regarding contents of development state and operation state refer to the clause 9 of [ITU-T M.3041]. - -### 9.2 AI pipeline in the development state - -The AI pipeline has three parts in the development state: the process of AI capability requirement parsing, the process of AI sandbox training and the process of AI capability orchestration. The overall process of the AI pipeline in the development state is as shown in Figure 9-1. - -![Flowchart showing the three steps of the AI pipeline in the development state: 1. The process of AI capability requirement parsing (blue box), 2. The process of AI sandbox training (red box), 3. The process of AI capability orchestration (green box). Arrows indicate a sequential flow from top to bottom.](b0d4609bc46c2d88a8318706bb5321f7_img.jpg) - -``` -graph TD; A[The process of AI capability requirement parsing] --> B[The process of AI sandbox training]; B --> C[The process of AI capability orchestration]; -``` - -M.3080(21)\_F9-1 - -Flowchart showing the three steps of the AI pipeline in the development state: 1. The process of AI capability requirement parsing (blue box), 2. The process of AI sandbox training (red box), 3. The process of AI capability orchestration (green box). Arrows indicate a sequential flow from top to bottom. - -Figure 9-1 – Process of AI pipeline in the development state - -- 1) In the process of AI capability requirement parsing, the AI sandbox training and AI capability orchestrator receives the requests from AI capability requirement parsing at the same time and does the relevant processing, as shown in Figure 9-2. - -![Figure 9-2: AI capability requirement parsing within AITOM in development state. The diagram shows the flow of AI capability requirement parsing within the AITOM framework. At the top, the 'Customer-oriented marketplace' includes 'Capability customization'. Below it, the 'SOMM' (Service Oriented Management) layer includes 'Scenario application', 'Service management', 'Data convergence and management', and 'Infrastructure management'. The 'AI engine' layer includes 'AI capability requirement parsing', 'AI sandbox training', and 'AI capability orchestration'. The flow is: 1) External AI capability requirements from 'Capability customization' and Internal AI capability requirements from 'Scenario application' and 'Service management' enter 'AI capability requirement parsing'. 2) The parsing output goes to 'AI sandbox training' and 'AI capability orchestration'. 3) 'AI sandbox training' uses 'Feature data selection' (from 'Data convergence and management') and 'Common AI model selection' (from 'Common AI model repository') to process the requirements. A legend at the bottom shows three numbered circles (1, 2, 3) with arrows indicating the flow of AI capability requirement parse.](ff7ce44f3fdd51bae7b231f34df07c6a_img.jpg) - -① → ② → ③ The flow of AI capability requirement parse - -M.3080(21)\_F9-2 - -Figure 9-2: AI capability requirement parsing within AITOM in development state. The diagram shows the flow of AI capability requirement parsing within the AITOM framework. At the top, the 'Customer-oriented marketplace' includes 'Capability customization'. Below it, the 'SOMM' (Service Oriented Management) layer includes 'Scenario application', 'Service management', 'Data convergence and management', and 'Infrastructure management'. The 'AI engine' layer includes 'AI capability requirement parsing', 'AI sandbox training', and 'AI capability orchestration'. The flow is: 1) External AI capability requirements from 'Capability customization' and Internal AI capability requirements from 'Scenario application' and 'Service management' enter 'AI capability requirement parsing'. 2) The parsing output goes to 'AI sandbox training' and 'AI capability orchestration'. 3) 'AI sandbox training' uses 'Feature data selection' (from 'Data convergence and management') and 'Common AI model selection' (from 'Common AI model repository') to process the requirements. A legend at the bottom shows three numbered circles (1, 2, 3) with arrows indicating the flow of AI capability requirement parse. - -**Figure 9-2 – AI capability requirement parsing within AITOM in development state** - -The detailed interaction procedures shown in Figure 9-2 are described below: - -- As the requestors of AI capability, one or multiple layers for customer-oriented capability marketplace, scenario application, service management, data convergence and management, and infrastructure management provide the requirements. -- AI capability requirement parsing analyses the requirements of AI capability and decomposes the requirements of data and model respectively. These requirements are transmitted to AI sandbox training and AI capability orchestration. -- The AI sandbox training selects feature data from the data convergence and management layer and a model from the common AI model repository management based on the AI capability requirements parsed by AI capability requirement parsing. - -![Figure 9-3: AI capability requirement parsing and AI sandbox training within AITOM in the development state. The diagram shows the flow of AI capability requirements from the Customer-oriented marketplace through various layers including SOMM, AI engine, and AI sandbox training. It includes functional nodes like SRC, C, PP, M, P, D, and SINK, and their interactions.](9c6461e1e94afae4dec455e69a2ce152_img.jpg) - -The diagram illustrates the architecture of AITOM, divided into three main layers: Customer-oriented marketplace, SOMM, and AI engine. The flow of AI capability requirements is shown by blue arrows, while the flow of the AI pipeline used by AI sandbox training is shown by red arrows. Functional nodes of the AI pipeline are represented by blue rounded rectangles with red (ingress) and green (egress) squares. The AI sandbox training includes feature data selection, common AI model selection, model decision, feature data pre-processing, offline training, and AI capability orchestration. The offline training layer includes nodes PP (Pre-processor), M (Model), and P (Policy). The AI capability orchestration layer includes the AI capability orchestrator and SINK (Target of AI engine output). The SOMM layer includes scenario application, service management, data convergence and management (with SRC and C nodes), and infrastructure management. The AI engine layer includes the common AI model repository and computing engine framework. - -Legend: - -- Flow of AI capability requirement (Blue arrow) -- Flow of AI pipeline used by AI sandbox training (Red arrow) -- Functional node of AI pipeline (Blue rounded rectangle) -- Ingress point of AI pipeline node (Red square) -- Egress point of AI pipeline node (Green square) - -Node symbols: - -- C: Collector -- PP: Pre-processor -- M: Model -- P: Policy -- D: Distributor -- SRC: Source of data -- SINK: Target of AI engine output - -M.3080(21)\_F9-3 - -Figure 9-3: AI capability requirement parsing and AI sandbox training within AITOM in the development state. The diagram shows the flow of AI capability requirements from the Customer-oriented marketplace through various layers including SOMM, AI engine, and AI sandbox training. It includes functional nodes like SRC, C, PP, M, P, D, and SINK, and their interactions. - -**Figure 9-3 – AI capability requirement parsing and AI sandbox training within AITOM in the development state** - -- 2) In the process of AI sandbox training, the AI sandbox training generates a single model with specific parameters after training when the AI pipeline is available in the development state. The symbols used for the AI pipeline in Figure 9-3 include the functional block of the AI pipeline, and the ingress point and egress point of the AI pipeline node, whose whole shape is shown in Figure 9-4, which refers to [ITU-T Y.3172]. - -![Figure 9-4: Symbol used to denote a node with its service egress and ingress points for AI pipeline. It shows a blue rounded rectangle with a red square on the left (ingress) and a green square on the right (egress).](8fa679f79a1bb1f527cba9f29e784e89_img.jpg) - -M.3080(21)\_F9-4 - -Figure 9-4: Symbol used to denote a node with its service egress and ingress points for AI pipeline. It shows a blue rounded rectangle with a red square on the left (ingress) and a green square on the right (egress). - -**Figure 9-4 – Symbol used to denote a node with its service egress and ingress points for AI pipeline** - -Within the AI sandbox training, the detailed procedure and functional nodes which is also called the AI pipeline for AI sandbox training are described below. The flow of the AI pipeline used by AI sandbox training is as shown in Figure 9-3. - -- *SRC (source of data)* – This node is the source of data provided by data convergence and management layer from the underlay network or service system used by AITOM, which acts as a data source of AITOM. -- *C (collection)* – This node collects the data in the data convergence and management layer and provides the data to the AI sandbox according to selected feature data. - -- *PP (pre-processor)* – This node pre-processes the feature data in AI sandbox training according to data analysis model and features are extracted. In this way, the training data and test data sets are formed. -- *M (machine learning model)* – This node trains AI models in AI sandbox training by utilizing feature data. A new model is formed with specific parameters by adopting offline data. -- *P (Policy)* – This node generates the policy based on policy rules defined by humans or by self-learning. -- *D (Distributor)* – This node identifies application objects and distributes a trained AI model to the AI capability orchestrator of AI capability orchestration. -- *SINK (applied object)* – This node is the object served by the trained AI model. It is served as the input module of AI capability orchestrator. - -NOTE – The AI sandbox training provides a single AI model, which is different to the common AI model, and the parameters of the provided model are clearly set after training. - -![Figure 9-5 – Overall AI pipeline within AITOM in development state. The diagram illustrates the flow of AI capability requirements and pipelines within the AITOM framework. It is divided into three main horizontal layers: Customer-oriented marketplace (top), SOMM (bottom), and AI engine (middle). The AI engine contains AI capability requirement parsing, AI sandbox training, and AI capability orchestration. The flow starts from the marketplace through parsing to the sandbox training (which includes nodes PP, M, P, D, and SINK) and then to the orchestration (which includes nodes PP, M, P, and SINK). The orchestration outputs to various capability maintenance modules. A legend at the bottom left defines the flow types and node types.](5445597cceefaca1ac89e710fe339325_img.jpg) - -The diagram shows the overall AI pipeline within AITOM in development state. It is structured into three main horizontal layers: - - -- Customer-oriented marketplace (top):** Contains 'Capability customization' and 'Standardized capability directory' (with a SINK node). It provides 'AI capability requirements' to the parsing layer. -- AI engine (middle):** The central part of the diagram, containing: - - AI capability requirement parsing:** Receives requirements and feeds into the sandbox training. - - AI sandbox training:** A stack of training instances. Each instance includes nodes: 'Feature data selection', 'Common AI model selection', 'Feature data pre-processing' (PP), 'Offline training' (M), 'Model decision' (D), and 'SINK'. It also connects to 'Common AI model repository' and 'Computing engine framework'. - - AI capability orchestration:** Receives trained models from the sandbox training. It includes nodes: 'SINK', 'PP', 'M', and 'P'. It outputs to five capability maintenance modules: 'Quality assurance capability maintenance', 'Efficiency improvement capability maintenance', 'Cost management capability maintenance', 'Security assurance capability maintenance', and 'Industry application capability maintenance'. -- SOMM (bottom):** Contains 'Scenario application', 'Service management' (with SINK), 'Data convergence and management' (with SRC, C, and Offline data), and 'Infrastructure management'. - - Flows are indicated by arrows: - - -- Blue arrows: Flow of AI capability requirement. -- Red arrows: Flow of AI pipeline used by AI sandbox training. -- Green arrows: Flow of AI pipeline used by AI capability orchestrator. - - Nodes are represented by blue rectangles with red (ingress) and green (egress) squares. - - -- C: Collector -- PP: Pre-processor -- M: Model -- P: Policy -- D: Distributor -- SRC: Source of data -- SINK: Target of AI engine output - -Figure 9-5 – Overall AI pipeline within AITOM in development state. The diagram illustrates the flow of AI capability requirements and pipelines within the AITOM framework. It is divided into three main horizontal layers: Customer-oriented marketplace (top), SOMM (bottom), and AI engine (middle). The AI engine contains AI capability requirement parsing, AI sandbox training, and AI capability orchestration. The flow starts from the marketplace through parsing to the sandbox training (which includes nodes PP, M, P, D, and SINK) and then to the orchestration (which includes nodes PP, M, P, and SINK). The orchestration outputs to various capability maintenance modules. A legend at the bottom left defines the flow types and node types. - -**Figure 9-5 – Overall AI pipeline within AITOM in development state** - -- 3) In the process of AI capability orchestration, AI sandbox training provides a trained model to the AI capability orchestrator, which integrates multiple AI pipelines based on requirements of specific applications and forms a specific AI capability. - -Within the AI capability orchestrator, the detailed procedure and functional nodes also called AI pipeline for AI capability orchestration are described below. The flow of AI pipeline used by the AI capability orchestrator is shown in Figure 9-5. - -- *SRC (source of data)* – This node is the source of data provided by the data convergence and management layer from the underlay network or service system used by AITOM, which acts as the data source of AITOM. - - *C (collection)* – This node collects the data in the data convergence and management layer and provides the data to the AI capability orchestrator according to the selected feature data. - - *PP (pre-processor)* – This node pre-processes the feature data by data analysis model and features are extracted in the AI capability orchestrator. In this way, the training data and test data sets are formed. - - *M (machine learning model)* – This node combines the multiple AI models provided by the AI sandbox training according to the AI capability requirements and the test data is used for updating parameters of the model to improve quality. - - *P (Policy)* – This node combines multiple policies provided by the AI sandbox training and the test data is used for updating parameters of the model to improve quality. - - *D (Distributor)* – This node identifies the application object and distributes the orchestrated AI capability to the modules of the specific AI application capability maintenance. In addition, a specific AI capability is published to the application object by AI capability registration and distribution. - - *SINK (applied object)* – This node is the applied object for AI capability, which includes the standardized capability directory of the customer-oriented marketplace and service directory of the service management layer. -- 4) The AI capability orchestrator continues to train and optimize the models based on the trained AI model and stops such procedures until the model can satisfy the requirement of the AI capability. - -Then the development state of the AI pipeline is stopped, and it then enters into the operation state. - -### 9.3 AI pipeline in the operation state - -![Figure 9-6: AI pipeline within AITOM in the operation state. The diagram shows the flow of AI capability requests and the AI pipeline in operation state across various layers of AITOM. It includes components like Customer-oriented marketplace, Service management, Data convergence and management, Infrastructure management, SOMM, AI capability requirement parsing, AI capability registration, AI capability activation, AI capability orchestration, Common AI model repository, Computing engine framework, and AI engine. A legend at the bottom explains the flow types and functional nodes.](08a978a124d3ed6cf1a3d0cfd89418d0_img.jpg) - -The diagram illustrates the AI pipeline within AITOM in the operation state. It is structured into several layers and components: - -- AITOM (Top Level):** Contains the **Customer-oriented marketplace** and **Standardized capability directory**. A **SINK** node is shown in the directory. -- External AI capability requirements:** Flow from the **Standardized capability directory** to the **AI capability requirement parsing** node. -- Internal AI capability requirements:** Flow from the **Service management** layer to the **AI capability requirement parsing** node. -- Service management:** Includes **Scenario application**, **Service management**, and a **SINK** node connected to the **Service directory**. -- Data convergence and management:** Includes **Data storage** with **SRC** (Source of data) and **C** (Collector) nodes, and **Offline data**. -- Infrastructure management:** Part of the **SOMM** layer. -- AI capability requirement parsing:** Receives external and internal requirements and sends them to **AI capability registration**. -- AI capability registration:** Sends data to **AI capability activation**. -- AI capability activation:** Sends data to the **AI capability orchestration** layer. -- AI capability orchestration:** Contains multiple instances of **AI capability orchestrator**, each with **PP** (Pre-processor), **M** (Model), and **P** (Policy) nodes. It also includes **Online retraining/incremental-retraining**. -- Common AI model repository** and **Computing engine framework:** Support the **AI engine**. -- AI engine:** The final processing stage, connected to the **AI capability orchestration** and **AI capability distribution** (with **D** node). - -**Legend:** - -- Flow of AI capability request (blue arrow) -- Flow of AI pipeline in operation state (light blue arrow) -- Functional node of AI pipeline (blue rectangle) -- Ingress point (red square) -- Egress point (green square) - -**Node Definitions:** - -- C: Collector -- PP: Pre-processor -- M: Model -- P: Policy -- D: Distributor -- SRC: Source of data -- SINK: Target of AI engine output - -M.3080(21)\_F9-6 - -Figure 9-6: AI pipeline within AITOM in the operation state. The diagram shows the flow of AI capability requests and the AI pipeline in operation state across various layers of AITOM. It includes components like Customer-oriented marketplace, Service management, Data convergence and management, Infrastructure management, SOMM, AI capability requirement parsing, AI capability registration, AI capability activation, AI capability orchestration, Common AI model repository, Computing engine framework, and AI engine. A legend at the bottom explains the flow types and functional nodes. - -Figure 9-6 – AI pipeline within AITOM in the operation state - -When the AI pipeline within the AITOM is in the operation state, the external customers and the different layers of the AITOM send the requirements of the AI capability by the customer-oriented marketplace or service management layer. Then the module of the AI capability requirement parsing analyses the requirements, maps it into the AI capability and transfers the mapped AI capability to the AI capability register. The AI capability registration module searches the mapped AI capability and activates the AI capability for AI capability orchestration. The functional nodes and the flow of AI pipeline in development state, as shown in Figure 9-6, are described below: - -- *SRC (source of data)* – This node is the source of data out of AITOM provided by data convergence and management from the underlay network or service system used by AITOM. Differing from the development state, the data here is from the real-time online system. -- *C (collection)* – This node collects data from the SRC nodes in the data convergence and management layer and provides the data to the specific AI application. -- *PP (pre-processor)* – This node pre-processes the feature data and uses them for the learning and decision of the model. - -- *M (model)* – This node orchestrates the model with the AI capability orchestrator of AI capability orchestration, including multiple AI models provided by the AI sandbox to satisfy the requirements of the specific application. The online retraining or incremental retraining are used for improving the model quality. -- *P (Policy)* – This node orchestrates the policy with the AI capability orchestrator of AI capability orchestration, including multiple AI policies provided by the AI sandbox training to satisfy the requirements of the specific application. The online data or incremental data are used for improving the model quality. -- *D (Distributor)* – This node identifies the application object and distributes operated results from AI capability requestors to the standardized capability directory via AI capability distribution. -- *SINK (applied object)* – This node is the AI capability requestors which receives the output from the AI capability distribution module. - -NOTE 1 – Online retraining is a kind of training where real-time data is used to retrain the existing model to improve the model quality. Initially, offline data is used for initializing model parameters which are updated based on real-time data later. - -NOTE 2 – Incremental retraining is the same as online retraining, and the existing model is retrained, and the parameters are updated to improve the model quality by periodically updating the training data. The difference with online retraining is that its new training data is not updated in real time but in a periodic way. - -## 10 Security requirements for AITOM - -AITOM should be operated in a safe way or environment, which is a general requirement. In this sense, the following aspects should be supported: - -**Data integrity:** Data integrity ensures the correctness or accuracy of data. The data is protected against unauthorized modification, deletion, creation, and replication and provides an indication of these unauthorized activities. See clause 8.1.2 of [ITU-T X.1111]. - -**Communication flow security:** Communication flow security ensures that information flows only between the authorized end points (the information is not diverted or intercepted as it flows between these end points). See clause 8.1.6 of [ITU-T X.1111]. - -**Availability:** The availability ensures that there is no denial of authorized access to network elements, stored information, information flows, services and applications due to events impacting the network. Disaster recovery solutions are included in this category. See clause 6.7 of [ITU-T X.805]. - -**Security protection of AI system and network:** It includes data security management, access security control and user security isolation. - -More security requirements can be found in [ITU-T M.3016.2], including authentication, access control, non-repudiation, audit trail, alarm reporting and packet inspection. - -## Annex A - -### The background and main characteristics of the AITOM framework - -(This annex forms an integral part of this Recommendation.) - -With the continuous evolution of the network and the arrival of the 5G/IMT-2020 era, the network of the operators is more complex, the business demands are more diversified, and the management of the telecommunication operation is more complex. It is necessary to introduce artificial intelligence (AI) technology to strengthen the intelligence and automation of the telecom operation management system. - -Introducing AI technology would have a big impact to the existing framework of the operation and management system. It needs to introduce some new functionalities related to AI, such as for example AI model management, data collection, data management, policy, and so on. It is necessary to design a closed-loop procedure on how to do operation and management based on an enhanced framework, in order to obtain full guidance on how to use AI for telecom operation and management. - -The main characteristics of the AITOM framework can be described as follows: - -- Intelligent: Compared with SOMM, AITOM is more intelligent due to strong AI capability. -- Automaticity: By utilizing AI pipeline orchestration, AITOM is able to realize automatic network management or service provision. Many closed-loop control procedures, service provisions or openings are supported. -- Data driven: As for SOMM, the AITOM framework converges masses of data from different OSs to a unified data model, supporting data sharing, data mining, data correlation, machine learning and other usage intents. More detailed data processing functions related to AI, such as feature engineering are supported. -- Integrated: As for SOMM, the AITOM framework can be applied for current and future networks. It can also support cross-domain management activities to fulfil end-to-end services for customers. -- Agile: As for SOMM, the AITOM framework is a service-oriented framework in which each operations systems function (OSF) is packaged as a service to be opened. A new OS can be deployed quickly with these open services and convergent data, along with the common infrastructure platform for OSs. -- Capability-exposed: With the customer-oriented marketplace layer, the application, service, data and AI capability set of AITOM are easily exposed to any system outside of AITOM. - - - -## SERIES OF ITU-T RECOMMENDATIONS - -| | | -|-----------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------| -| Series A | Organization of the work of ITU-T | -| Series D | Tariff and accounting principles and international telecommunication/ICT economic and policy issues | -| Series E | Overall network operation, telephone service, service operation and human factors | -| Series F | Non-telephone telecommunication services | -| Series G | Transmission systems and media, digital systems and networks | -| Series H | Audiovisual and multimedia systems | -| Series I | Integrated services digital network | -| Series J | Cable networks and transmission of television, sound programme and other multimedia signals | -| Series K | Protection against interference | -| Series L | Environment and ICTs, climate change, e-waste, energy efficiency; construction, installation and protection of cables and other elements of outside plant | -| Series M | Telecommunication management, including TMN and network maintenance | -| Series N | Maintenance: international sound programme and television transmission circuits | -| Series O | Specifications of measuring equipment | -| Series P | Telephone transmission quality, telephone installations, local line networks | -| Series Q | Switching and signalling, and associated measurements and tests | -| Series R | Telegraph transmission | -| Series S | Telegraph services terminal equipment | -| Series T | Terminals for telematic services | -| Series U | Telegraph switching | -| Series V | Data communication over the telephone network | -| Series X | Data networks, open system communications and security | -| Series Y | Global information infrastructure, Internet protocol aspects, next-generation networks, Internet of Things and smart cities | -| Series Z | Languages and general software aspects for telecommunication systems | \ No newline at end of file diff --git a/marked/M/T-REC-M.3383-202304-I_PDF-E/0538daaa5583c23e17db3a12f2281a55_img.jpg b/marked/M/T-REC-M.3383-202304-I_PDF-E/0538daaa5583c23e17db3a12f2281a55_img.jpg deleted file mode 100644 index c1629394c02f697f60ae954ad36bf274fa8082cb..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3383-202304-I_PDF-E/0538daaa5583c23e17db3a12f2281a55_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:3763acd7a0ed56aa30f3f90468c1fb0cb54573eb9045bca3eddf8976b4f0f41d -size 7219 diff --git a/marked/M/T-REC-M.3383-202304-I_PDF-E/7f25db95ce3916c0e09803b861a2f7bc_img.jpg b/marked/M/T-REC-M.3383-202304-I_PDF-E/7f25db95ce3916c0e09803b861a2f7bc_img.jpg deleted file mode 100644 index 379ab7033755e8441a8ee5cab62a46e8d9d155a8..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3383-202304-I_PDF-E/7f25db95ce3916c0e09803b861a2f7bc_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:683ff16b4e56b962ceebb821b07ea88ecd18dea7c858998dd4b0b913252b2fbf -size 86412 diff --git a/marked/M/T-REC-M.3383-202304-I_PDF-E/83852ec55d4802521a727926336bedab_img.jpg b/marked/M/T-REC-M.3383-202304-I_PDF-E/83852ec55d4802521a727926336bedab_img.jpg deleted file mode 100644 index 3bb82e277cb08cd4537cfacbd4e0cca9a4c3d70b..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3383-202304-I_PDF-E/83852ec55d4802521a727926336bedab_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:67e6abc97d62f908d587a4a4ee4c0dba13b62287f1dbec439b538c664dbeaf70 -size 86317 diff --git a/marked/M/T-REC-M.3383-202304-I_PDF-E/a5ee5c23b6dc52ec1d724b76d5a5f58f_img.jpg b/marked/M/T-REC-M.3383-202304-I_PDF-E/a5ee5c23b6dc52ec1d724b76d5a5f58f_img.jpg deleted file mode 100644 index a6bda814b6821e9ca4a1a9a31e652acadc17750c..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3383-202304-I_PDF-E/a5ee5c23b6dc52ec1d724b76d5a5f58f_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:7e98f4382d0654cf6fe118587f8890db234d6e79bcbb2ba056474754bc667ab7 -size 61981 diff --git a/marked/M/T-REC-M.3383-202304-I_PDF-E/d4af765160d04ecef538e5066006dc77_img.jpg b/marked/M/T-REC-M.3383-202304-I_PDF-E/d4af765160d04ecef538e5066006dc77_img.jpg deleted file mode 100644 index ae5feedba144dea73486d095400b656da17cc8cc..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3383-202304-I_PDF-E/d4af765160d04ecef538e5066006dc77_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:2bd6b9e347a9223bad5a863683e94874fd903236eabf0cc09f3e702b036890ce -size 130008 diff --git a/marked/M/T-REC-M.3383-202304-I_PDF-E/ff7ce44f3fdd51bae7b231f34df07c6a_img.jpg b/marked/M/T-REC-M.3383-202304-I_PDF-E/ff7ce44f3fdd51bae7b231f34df07c6a_img.jpg deleted file mode 100644 index fb04e812471c9d98cd11520a186b8610764461cc..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3383-202304-I_PDF-E/ff7ce44f3fdd51bae7b231f34df07c6a_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:e6dd4eaf76ef050611443ed2022217568bb0e0e63ca0de3490176a1f009cb3d8 -size 104912 diff --git a/marked/M/T-REC-M.3383-202304-I_PDF-E/raw.md b/marked/M/T-REC-M.3383-202304-I_PDF-E/raw.md deleted file mode 100644 index 44b28f5148b5b5a82ad41997da64e5922b5792e4..0000000000000000000000000000000000000000 --- a/marked/M/T-REC-M.3383-202304-I_PDF-E/raw.md +++ /dev/null @@ -1,557 +0,0 @@ - - -# Recommendation **ITU-T M.3383 (04/2023)** - -SERIES M: Telecommunication management, including TMN -and network maintenance - -Telecommunications management network - ---- - -# **Requirements for log analysis in telecom management with artificial intelligence** - -![ITU logo](0538daaa5583c23e17db3a12f2281a55_img.jpg) - -The logo of the International Telecommunication Union (ITU) is located in the bottom right corner. It features a blue circular emblem with a stylized globe and the letters 'ITU' in white. - -ITU logo - -## ITU-T M-SERIES RECOMMENDATIONS - -### **Telecommunication management, including TMN and network maintenance** - -| | | -|---------------------------------------------------------------------------------|----------------------| -| Introduction and general principles of maintenance and maintenance organization | M.10-M.299 | -| International transmission systems | M.300-M.559 | -| International telephone circuits | M.560-M.759 | -| Common channel signalling systems | M.760-M.799 | -| International telegraph systems and phototelegraph transmission | M.800-M.899 | -| International leased group and supergroup links | M.900-M.999 | -| International leased circuits | M.1000-M.1099 | -| Mobile telecommunication systems and services | M.1100-M.1199 | -| International public telephone network | M.1200-M.1299 | -| International data transmission systems | M.1300-M.1399 | -| Designations and information exchange | M.1400-M.1999 | -| International transport network | M.2000-M.2999 | -| Telecommunications management network | M.3000-M.3599 | -| Integrated services digital networks | M.3600-M.3999 | -| Common channel signalling systems | M.4000-M.4999 | - -*For further details, please refer to the list of ITU-T Recommendations.* - -# Recommendation ITU-T M.3383 - -# Requirements for log analysis in telecom management with artificial intelligence - -## Summary - -Recommendation ITU-T M.3383 introduces the requirements for log analysis in telecom management with artificial intelligence (AI) and includes a functional framework, functional requirements, and typical scenarios of log analysis in telecom management with AI. This Recommendation gives examples of some log types and characteristics. This Recommendation also describes use cases of log analysis in telecom management with AI. - -## History \* - -| Edition | Recommendation | Approval | Study Group | Unique ID | -|---------|----------------|------------|-------------|--------------------| -| 1.0 | ITU-T M.3383 | 2023-04-29 | 2 | 11.1002/1000/15516 | - -## Keywords - -AI log data, AI log acquisition, data processing, log analysis, telecom management with AI. - ---- - -\* To access the Recommendation, type the URL in the address field of your web browser, followed by the Recommendation's unique ID. - -## FOREWORD - -The International Telecommunication Union (ITU) is the United Nations specialized agency in the field of telecommunications, information and communication technologies (ICTs). The ITU Telecommunication Standardization Sector (ITU-T) is a permanent organ of ITU. ITU-T is responsible for studying technical, operating and tariff questions and issuing Recommendations on them with a view to standardizing telecommunications on a worldwide basis. - -The World Telecommunication Standardization Assembly (WTSA), which meets every four years, establishes the topics for study by the ITU-T study groups which, in turn, produce Recommendations on these topics. - -The approval of ITU-T Recommendations is covered by the procedure laid down in WTSA Resolution 1. - -In some areas of information technology which fall within ITU-T's purview, the necessary standards are prepared on a collaborative basis with ISO and IEC. - -## NOTE - -In this Recommendation, the expression "Administration" is used for conciseness to indicate both a telecommunication administration and a recognized operating agency. - -Compliance with this Recommendation is voluntary. However, the Recommendation may contain certain mandatory provisions (to ensure, e.g., interoperability or applicability) and compliance with the Recommendation is achieved when all of these mandatory provisions are met. The words "shall" or some other obligatory language such as "must" and the negative equivalents are used to express requirements. The use of such words does not suggest that compliance with the Recommendation is required of any party. - -## INTELLECTUAL PROPERTY RIGHTS - -ITU draws attention to the possibility that the practice or implementation of this Recommendation may involve the use of a claimed Intellectual Property Right. ITU takes no position concerning the evidence, validity or applicability of claimed Intellectual Property Rights, whether asserted by ITU members or others outside of the Recommendation development process. - -As of the date of approval of this Recommendation, ITU had not received notice of intellectual property, protected by patents/software copyrights, which may be required to implement this Recommendation. However, implementers are cautioned that this may not represent the latest information and are therefore strongly urged to consult the appropriate ITU-T databases available via the ITU-T website at . - -© ITU 2023 - -All rights reserved. No part of this publication may be reproduced, by any means whatsoever, without the prior written permission of ITU. - -## Table of Contents - -| | Page | -|----------------------------------------------------------------------------------------------------------------|------| -| 1 Scope ..... | 1 | -| 2 References..... | 1 | -| 3 Definitions ..... | 1 | -| 3.1 Terms defined elsewhere ..... | 1 | -| 3.2 Terms defined in this Recommendation ..... | 2 | -| 4 Abbreviations and acronyms ..... | 2 | -| 5 Convention..... | 2 | -| 6 Overview..... | 3 | -| 7 Function framework for log analysis in telecom management with AI..... | 3 | -| 7.1 AI log acquisition module..... | 4 | -| 7.2 AI log data processing module ..... | 4 | -| 7.3 AI log storage module..... | 4 | -| 7.4 AI log analysis module..... | 4 | -| 8 The relationship between functional framework for log analysis in telecom management with AI and AITOM ..... | 5 | -| 9 Requirements for log analysis in telecom management with AI..... | 6 | -| 9.1 Requirements for AI log acquisition module..... | 6 | -| 9.2 Requirements for AI log data processing module ..... | 6 | -| 9.3 Requirements for the AI log storage module..... | 7 | -| 9.4 Requirements for the AI log analysis module ..... | 7 | -| Appendix I – Examples of several log types and characteristics ..... | 9 | -| Appendix II – Use cases of log analysis in telecom management with AI ..... | 11 | -| Bibliography ..... | 17 | - - - -# Recommendation ITU-T M.3383 - -# Requirements for log analysis in telecom management with artificial intelligence - -## 1 Scope - -This Recommendation specifies, for log analysis in telecom management with artificial intelligence (AI), including functional framework, functional requirements, and typical scenarios of log analysis in telecom management with AI. This Recommendation is applicable to the design, development, and application of log analysis in telecom management with AI. - -# 2 References - -The following ITU-T Recommendations and other references contain provisions which, through reference in this text, constitute provisions of this Recommendation. At the time of publication, the editions indicated were valid. All Recommendations and other references are subject to revision; users of this Recommendation are therefore encouraged to investigate the possibility of applying the most recent edition of the Recommendations and other references listed below. A list of the currently valid ITU-T Recommendations is regularly published. The reference to a document within this Recommendation does not give it, as a stand-alone document, the status of a Recommendation. - -[ITU-T M.3080] Recommendation ITU-T M.3080 (2021), *Framework of artificial intelligence enhanced telecom operation and management (AITOM)*. - -# 3 Definitions - -## 3.1 Terms defined elsewhere - -This Recommendation uses the following terms defined elsewhere: - -**3.1.1 artificial intelligence capability set** [ITU-T M.3080]: A set of functions that are provided based on orchestrated artificial intelligence (AI) models to meet the requirement of some specific application scenarios. - -NOTE 1 – Specific application scenarios are to realize quality assurance, efficiency improvement, cost management, security assurance and industry applications, which are used for telecom operation and management. - -NOTE 2 – An AI capability can be generated through AI model orchestration based on the requirement of a specific application scenario. - -NOTE 3 – These functions may, but do not have to, be used based on the requirements of specific application scenarios. - -**3.1.2 artificial intelligence engine** [ITU-T M.3080]: The realization and mechanization, in software or hardware, of one or more functions dedicated to performing a specific artificial intelligence (AI) task. - -**3.1.3 artificial intelligence model** [ITU-T M.3080]: The model created by applying artificial intelligence (AI) technology to data to learn from. - -**3.1.4 artificial intelligence pipeline** [ITU-T M.3080]: A set of logical nodes, each with specific functionalities, that can be combined to form an artificial intelligence (AI) application in systems of telecom operation and management. - -**3.1.5 artificial intelligence sandbox** [ITU-T M.3080]: An environment in which artificial intelligence (AI) models can be trained and tested, and their effects on the network are evaluated. - -**3.1.6 customer-oriented marketplace** [ITU-T M.3080]: A collection of functional sets that exposes capability to external telecom customers, especially enterprises and industries. The exposed capability includes applications, services, data, and artificial intelligence (AI) capability. - -**3.1.7 management** [b-ITU-T Y.3100]: In the context of IMT-2020, the processes aiming at fulfilment, assurance, and billing of services, network functions, and resources in both physical and virtual infrastructure including compute, storage, and network resources. - -### **3.2 Terms defined in this Recommendation** - -None. - -# **4 Abbreviations and acronyms** - -This Recommendation uses the following abbreviations and acronyms: - -| | | -|---------|-----------------------------------------------| -| 5GC | 5G Core network | -| AI | Artificial Intelligence | -| AITOM | AI enhanced Telecom Operation and Management | -| BSS | Business Support System | -| EPC | Evolved Packet Core | -| ETH | Ethernet | -| E-UTRAN | Evolved UMTS Terrestrial Radio Access Network | -| HDFS | Hadoop Distributed File System | -| LTE | Long-Term Evolution | -| NG-RAN | Next Generation Radio Access Network | -| NMS | Network Management System | -| NoSQL | Not Only SQL | -| OS | Operations System | -| OSS | Operation Support Systems | -| OTN | Optical Transmission Network | -| RAB | Radio Access Bearer | -| RAN | Radio Access Network | -| RDBMS | Relational Database Management System | -| RRC | Radio Resource Control | -| SQL | Structured Query Language | -| SVM | Support vector machine | -| UMTS | Universal Mobile Telecommunications System | - -# **5 Convention** - -In this Recommendation: - -The keywords "is required to" indicate a requirement which must be strictly followed and from which no deviation is permitted if conformance to this Recommendation is to be claimed. - -The keywords "is recommended" indicate a requirement which is recommended but which is not absolutely required. Thus, this requirement need not be present to claim conformance. - -The keywords "can optionally" indicate an optional requirement which is permissible, without implying any sense of being recommended. This term is not intended to imply that the vendor's implementation must provide the option and the feature can be optionally enabled by the network operator or service provider. Rather, it means the vendor may optionally provide the feature and still claim conformance with this Recommendation. - -# 6 Overview - -With the rapid development of network scale, operation and maintenance management have become more complicated. During the operation of the network and management information system such as network management system (NMS), operation support systems (OSS), etc., a large amount of log data will be generated, including network connection status, system database operating status, service process operating status and so on. - -There are many sources to collect logs, such as operations system (OS) server logs, network element logs, etc. Each type of log records different behaviours in the network elements or management systems. For example, network element logs focus on recording network behaviours at the network layer, while OS server logs record the running status and operation records of OS applications. - -Traditional operation and maintenance management does not make full use of log data and is mostly based on relatively simple processing algorithms such as statistical analysis and association rules. It relies more on the experience of maintenance personnel and experts, and the value of log data is not yet fully explored. With the development of artificial intelligence technology, it is necessary to use AI technology to realize the intelligent processing of log analysis, realize more efficient abnormal monitoring and early warning based on log analysis, and improve the level of operation and maintenance management. So, with the development of network scale, it is urgent to use artificial intelligence technology to realize the intelligent processing of log analysis, realize more efficient abnormal monitoring and early warning based on log analysis, and improve the level of operation and maintenance management. - -Appendix I gives some examples of different log types and characteristics which also contains some possible abnormal behaviours. Appendix II gives some use cases and scenarios of log analysis in telecom management with AI. - -# 7 Function framework for log analysis in telecom management with AI - -The function framework of log analysis in telecom management with AI is shown in Figure 1. - -The input data for log analysis in telecom management with AI include log records collected from network elements such as optical transmission network (OTN) terminal multiplexing device, etc. and OS servers that run management systems such as NMS, OSS, etc. - -After log analysis with AI, the analysis results such as anomaly monitoring information, fault classification information, and fault prediction information are formed to provide a decision-making basis for operation and maintenance personnel. It can improve the efficiency and quality of operation and maintenance work. - -![Figure 1: Function framework for log analysis in telecom management with AI. The diagram shows a four-tier architecture. At the base is the 'AI log acquisition module' containing 'Log for management system (Such as NMS, OSS, etc.)' and 'Log for network element (Such as OTN terminal multiplexing device)'. Above it is the 'AI log data processing module'. Above that is the 'AI log storage module'. At the top is the 'AI log analysis module' containing 'Pattern recognition', 'Model training', 'abnormal alarm', and 'Fault prediction'. Arrows indicate a bottom-up flow of data between adjacent modules, and a long arrow on the left side points from the processing module back to the analysis module. The label 'M.3383(23)' is at the bottom right.](a5ee5c23b6dc52ec1d724b76d5a5f58f_img.jpg) - -``` - -graph TD - subgraph AIA [AI log analysis module] - PR[Pattern recognition] - MT[Model training] - AA[abnormal alarm] - FP[Fault prediction] - end - ALSM[AI log storage module] - ALDM[AI log data processing module] - ALQM[AI log acquisition module] - subgraph ALQM - LMS[Log for management system (Such as NMS, OSS, etc.)] - LNE[Log for network element (Such as OTN terminal multiplexing device)] - end - LNE --> LMS - LMS --> ALDM - ALDM --> ALSM - ALSM --> AIA - ALDM --> AIA - M338323[M.3383(23)] - -``` - -Figure 1: Function framework for log analysis in telecom management with AI. The diagram shows a four-tier architecture. At the base is the 'AI log acquisition module' containing 'Log for management system (Such as NMS, OSS, etc.)' and 'Log for network element (Such as OTN terminal multiplexing device)'. Above it is the 'AI log data processing module'. Above that is the 'AI log storage module'. At the top is the 'AI log analysis module' containing 'Pattern recognition', 'Model training', 'abnormal alarm', and 'Fault prediction'. Arrows indicate a bottom-up flow of data between adjacent modules, and a long arrow on the left side points from the processing module back to the analysis module. The label 'M.3383(23)' is at the bottom right. - -**Figure 1 – Function framework for log analysis in telecom management with AI** - -## 7.1 AI log acquisition module - -This module is used to collect various types of logs. In order to distinguish the types of logs and understand the contents of logs, the module should have the ability to collect and use various types of logs to train AI models, such as OS server logs and network element logs. The collected information includes alarm ID/name, alarm type, alarm severity, alarm source, occurrence time, etc. For a specific alarm, the detailed illustration (definition, type, impact) is reported as context. Dealing with alarm data is important for failure management, including alarm compression, alarm correlation analysis, and alarm root cause identification. - -## 7.2 AI log data processing module - -This module is used to extract valid information in a log. Based on the characteristics of different types of log information, it converts unstructured or semi-structured multi-source heterogeneous log files into structured files and stores parameter values in the AI log storage module, so as to facilitate data mining and learning in the AI log analysis module. This module has the ability to identify and match the data according to the format and structure of data characteristics, and quickly extract the effective information in the data by referring to the extraction method of historical data. - -## 7.3 AI log storage module - -This module is used for storage data. The AI log storage module will record the knowledge information processed by the AI log data processing module to assist knowledge reasoning and data analysis in AI log analysis module. - -## 7.4 AI log analysis module - -This function module includes the basic AI functions that must be possessed for log analysis with AI. AI log analysis module models and trains log data, deeply excavates the hidden information and potential of the log and generates analysis results to guide the operation and maintenance of the network. AI log analysis module supports the choosing of different built-in function modules in different scenarios. This module collects the pre-processed log information in certain scenarios from the AI log storage module and the use in order to train the model and realize the pattern recognition and adjust and improve the parameter and performance of the models after making clear the usage scenario. - -- Model training: Train and test the model based on pre-processed log data and common AI models according to the requirements from the customer-oriented marketplace layer and other layers. Adjust and improve the parameter and performance of the models. - -NOTE – The functions of the customer-oriented marketplace layer are a reference to [ITU-T M.3080] which include a standardized capability directory and capability customization. The customer-oriented marketplace layer can build and maintain the AI capability requirements of external customers and expose applications, services, data and AI capability set to external customers. - -- Pattern recognition: Realize pattern recognition to mine the pre-processed data, find the hidden patterns and extract abnormal information from the log based on trained models. The abnormal information involves abnormal log number, abnormal log total number, abnormal log keyword, and so on. This process involves algorithms such as statistical analysis, clustering, classification, association rules, and sequential pattern recognition. -- Fault prediction: Predict potential faults and performance failures ahead of time based on the trained models and excavated information. -- Abnormal alarm: Alarm and report anomaly detection and prediction results based on the trained models and excavated information. The analysis results (such as log anomaly detection and log prediction results) and management and maintenance of log analysis strategy can be visualized. The abnormal alarm has the capabilities to create, configure, deliver, customize and manage the visual presentation of analysis results and analysis strategy. - -# 8 The relationship between functional framework for log analysis in telecom management with AI and AITOM - -Log analysis in telecom management with AI is a typical application scenario based on the AI enhanced telecom operation and management (AITOM) framework. - -The functional framework for log analysis in telecom management with AI references and AITOM framework. The relationship between the framework for log analysis in telecom management with AI and AITOM framework in Figure 2 can be described as follows: - -- The block name and functions of the "AI log acquisition module", "AI log data processing module" and "AI log storage module" correspond to "data acquisition", "data processing" and "data storage" respectively of the AITOM framework. But these three modules in this Recommendation are based on log analysis scenarios and they are extended to support AI methods. - -NOTE 1 – These three blocks correspond to red circle 1, red circle 2, and red circle 3 respectively in Figure 2. - -- The block name and functions of the "AI log analysis module" corresponds to the "AI engine" of the AITOM framework. The functions of "model training" are mainly guided by that of the "AI sandbox training" of AI engine, and the orchestration of "pattern recognition", "fault prediction" and "abnormal alarm" is mainly guided by "AI capability orchestration" of the AI engine. - -NOTE 2 – This block corresponds to red circle 4 in Figure 2. - -![Figure 2: Mapping relationship between functional framework for log analysis in telecom management with AI and AITOM [ITU-T M.3080].](d4af765160d04ecef538e5066006dc77_img.jpg) - -The diagram illustrates the mapping between the functional framework for log analysis and the AITOM framework. On the left, the 'Function framework for log analysis with AI-enhanced management system' consists of four modules: AI log acquisition module (1), AI log data processing module (2), AI log storage module (3), and AI log analysis module (4). The AI log acquisition module (1) includes 'Log from management system (Such as NMS, OSS, etc.)' and 'Log from network element (Such as OTN terminal multiplexing device, optical amplifier, etc.)'. The AI log analysis module (4) includes 'Pattern recognition', 'Model training', 'abnormal alarm', and 'Fault prediction'. Arrows indicate a sequential flow from module 1 to 4, with a bidirectional arrow between modules 3 and 4. On the right, the 'Functional framework of AITOM' is shown as a layered structure: Customer-oriented marketplace layer, SOMM (Scenario application layer, Management service layer, Data convergence and management layer, Infrastructure management layer), and Network. Red circles with numbers 1, 2, 3, and 4 map the log analysis modules to specific layers in AITOM: Module 1 maps to the Data convergence sub-layer (Data acquisition), Module 2 maps to the Data convergence sub-layer (Data processing), Module 3 maps to the Data convergence sub-layer (Data storage), and Module 4 maps to the SOMM (Scenario application layer). A vertical 'AI pipeline' on the right side of AITOM includes 'AI engine', 'AI capabilities management', 'AI capability orchestration', 'AI sandbox training', 'Common AI model repository management', and 'Computing engine framework management'. - -Figure 2: Mapping relationship between functional framework for log analysis in telecom management with AI and AITOM [ITU-T M.3080]. - -**Figure 2 – Mapping relationship between functional framework for log analysis in telecom management with AI and AITOM [ITU-T M.3080]** - -NOTE 3 – The symbols of the red circle with a number represent the mapping relationship between the "function framework for log analysis in telecom management with AI" and the AITOM framework. - -# 9 Requirements for log analysis in telecom management with AI - -## 9.1 Requirements for AI log acquisition module - -The requirements of the AI log acquisition module include: - -- 1) It is required that the AI log acquisition module supports collecting multi-source heterogeneous log, such as data from network management system (NMS), element management system, and network equipment. -- 2) It is recommended that log data be collected in time, which can timely obtain the operation status of the managed network and provide timely data support for the decision-making of the management system. -- 3) It is recommended that the AI log acquisition module supports conducting preliminary analysis, including the format, storage mode and generation speed of different logs. -- 4) It is recommended that operation-related anomalies log be collected and pre-processed. -- 5) It is required that the AI log acquisition module supports the accuracy and completeness of data collection. Data loss and corruption should be prevented during acquisition. -- 6) It is recommended that a proper collection period should be supported in the AI log acquisition module based on the different types of logs. -- 7) It is recommended that the interface of AI log acquisition is open to ensure real-time and is stable for log collection. -- 8) It can optionally support the parallel collection of log data, and collect multi-source data simultaneously in a multi-channel parallel mode. - -## 9.2 Requirements for AI log data processing module - -The requirements of the AI log data processing module include: - -- 1) It is recommended that the AI log acquisition module supports pre-processing function, including log cleaning and missing value handling. Log cleaning is to filter the unnecessary log information, remove noise data and correct the inconsistency of the data. Missing value handling can be filled by AI algorithms to ensure data integrity. -- 2) It is required that the AI log data processing module supports the normalization and unification of log data format, including multi-source heterogeneous log data, for further storage and analysis. -- 3) It is recommended that the AI log data processing module supports analysing the user-defined analysis strategy and feature data pre-processing for the log data, so that the heterogeneous data can be converted into a standard format, including feature data selection, normalization or standardization, and feature data enhancement and enrichment, etc. - -## **9.3 Requirements for the AI log storage module** - -The requirements of the AI log storage module include: - -- 1) It is required that the AI log storage module supports the classification storage of different log types and log formats. -- 2) It is recommended that the AI log storage module supports the storage of intermediate output data and final analysis results. -- 3) It is recommended that the AI log storage module supports multiple file systems for storing logs, such as traditional relational database management system (RDBMS) or distributed cluster system not only structured query language (NoSQL), and Hadoop distributed file system (HDFS). -- 4) It is recommended that the AI log storage module supports full-text retrieval, phrase query, field filtering and other functions to achieve fast log search. -- 5) It is recommended that the AI log storage module needs a reasonable storage period based on the data collection period and data storage space to prevent storage space overflow. - -## **9.4 Requirements for the AI log analysis module** - -The requirements of the AI log analysis module include: - -- 1) It is required that the AI log analysis module supports various types and formats of logs. -- 2) It is recommended that the AI log analysis module supports a variety of log analysis algorithms. The AI models are stored in the common artificial intelligence model library. The log analysis algorithms include statistical analysis, association rules, clustering, classification, sequence pattern, transaction recognition, etc. -- 3) It is recommended that the AI log analysis module supports user-defined algorithms. The AI models are stored in the telecom specific artificial intelligence model library. The common AI models in management systems can be added for fault monitoring, root cause analysis, etc. -- 4) It is recommended that the AI log analysis module supports the training of log data in a sandbox. The training object is a pre-defined AI model suitable for specific situations. In the training process, it is necessary to estimate and analyse the model and predict the accuracy of the model. Through the test and evaluation of the model, constantly adjust the parameters, optimize the model, and improve the accuracy and practicability of the model. -- 5) It is recommended that the AI log analysis module supports fault detection. - -NOTE 1 – Log analysis based on fault detection can comprehensively manage and analyse system faults. AI log analysis module can monitor the running state of the system in real time through a log analysis service. The log analysis module can automatically classify the fault logs and analyse the correlation of the system faults. - -- 6) It is recommended that the AI log analysis module supports a variety of predictions, such as fault prediction, error prediction, user access prediction, regulatory prediction, etc. -- 7) It is recommended that the AI log analysis module supports pattern recognition. - -NOTE 2 – Pattern recognition is a technology that uses various algorithms, rules and models to mine the pre-processed data and find the hidden patterns from the log. The algorithm includes statistical analysis, clustering, classification, association rules, sequential pattern recognition, etc. -- 8) It is recommended that the AI log analysis module supports anomaly assessment with logs. - -NOTE 3 – Three steps need to be done to assess a log anomaly. Firstly, construct a structured log by extracting keywords and matching it to a log template that is learned from existing log files. Secondly, carry out pattern mining to extract features from structured logs. Finally, judge the log's anomaly from the quantitative perspective as well as the perceived perspective. -- 9) It is recommended that the AI log analysis module supports abnormal alarms based on the result of fault prediction and reports anomaly detection and prediction results in real time or regularly. -- 10) It is recommended that the AI log analysis module supports fast log information search and log query, including fuzzy query, range query, combined query, etc. -- 11) It is recommended that the AI log analysis module supports the determination of log training time, scope, process, and method according to the requirements from the customer-oriented marketplace layer and other layers. -- 12) It is recommended that the AI log analysis module supports the reporting of analysis results to the customer-oriented marketplace layer for customized analysis strategy. -- 13) It is recommended that the AI log analysis module supports the visualization of log anomaly detection and log prediction results. -- 14) It is recommended that the AI log analysis module supports the visualization of multiple data sources fusion. -- 15) It is recommended that the AI log analysis module supports real-time data display and interaction. - -## Appendix I - -### Examples of several log types and characteristics - -(This appendix does not form an integral part of this Recommendation.) - -AI log acquisition module can collect OS server logs, network element logs, etc. Each kind of log has its characteristics. The log records different types of behaviours in the network. Network element logs record network behaviours in the network layer, while OS server logs record the running status of system application processes and the operator's behaviours. Table I.1 shows examples of the different types of logs and the corresponding behaviours that may be detected. Table I.2 lists the characteristics of several typical logs and the possible abnormal behaviours. - -Some fault logs can be compared to determine the current system anomalies, realizing real-time alarm and fault processing. Combining log information of different times and different types and mining the internal association of logs with AI technology, the management system can have a comprehensive understanding of the current status, potential risk, and so on. - -**Table I.1 – Examples of different log types and corresponding behaviours** - -| Log types | Behaviours may be detected | -|-----------------------------------------------------------------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| OS server log | OS server log is classified into information, warning, and error levels. Most event records generated by the OS server are related to the following aspects: running status and operation records of OS applications, modifications of executable files, unsafe system reconfiguration or damage, authentication or authorization failure, etc. | -| OTN equipment log | OTN equipment log can record the operating status of equipment in the optical transmission network. The equipment includes OTN terminal multiplexing devices, OTN optical cross-connected devices (such as OTN electrical crossover devices, OTN optical crossover devices and devices having both OTN electrical and optical crossover functions), etc. OTN equipment log records a large number of forward events, configuration changes, outbound and inbound transfer bytes, the connection status of different devices, etc. | -| Optical transmission link log | Identify the transmission link information, for example, the ETH (Ethernet) end port information, automatic protection switching information, input optical power information of the link, etc. | -| Database log | Database log can record the operating status of the database, including error log, query log, slow query log, event log, binary log, relay log and so on. For example, the database log can record the customer interface status of the database, the execution status of the program statement (e.g., SQL) and error information. | -| Operation support systems (OSS) and business support system (BSS) log | The OSS and BSS log includes the module log, application log, and security log. The OSS and BSS log can record the information of the hardware, software, and system problems in the OSS and the BSS. Moreover, the OSS and BSS log can also monitor the events that occur in the OSS and BSS. The OSS and BSS log can be used to check the cause of the error and to find the traces left by the attacker when it was attacked. | - -**Table I.1 – Examples of different log types and corresponding behaviours** - -| Log types | Behaviours may be detected | -|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| 5G core network (5GC) and evolved packet core (EPC) network function log | 5GC and EPC network functions include the network elements and virtual network elements in the 5GC and EPC.
The network function log includes the system log, operation log, and security log. The system log can record the running information of (virtual) network elements of 5GC and EPC. The operation log can record the operation log of (virtual) network elements of 5GC and EPC. The security log can record the security events and security audits that occur in the (virtual) network elements of 5GC and EPC. | -| Long-term evolution (LTE) evolved universal mobile telecommunications system (UMTS) terrestrial radio access network (E-UTRAN) and 5G next generation radio access network (NG-RAN) performance measurement log | Record the RAN performance measurement information, which includes radio resource control (RRC) connection related measurements, radio access bearer (RAB) related measurements, handover related measurements, radio source utilization related measurements, paging related measurements, equipment resource related measurements, etc. | - -**Table I.2 – The characteristics of several typical logs and the possible abnormal behaviours** - -| Log characteristics | Possible abnormal behaviours | -|-------------------------------------------------------------------------------------|----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| OS server log generates alarm information | Identify events that may have problems in the future. For example, critical system files have been deleted and disk space is running out, abnormal program results in a device restart, a memory usage error occurs, and device memory utilization reaches the limit. | -| OS server log generates failure auditing information. | Identify the audited security events that did not complete successfully. For example, users cannot access network drives. | -| OTN transmission interrupt information | Identify events that caused the interruption, for example, an abnormal clock signal (SerDes), E1/T1 port error, etc. | -| OTN status abnormal information | The abnormal information collected by the OTN equipment contains a variety of fault information, including loss of continuity, path trace mismatch, payload type mismatch, forward / backward indication missing, etc. | -| Database abnormal information | The abnormal information collected by the database contains the abnormal frequency of keyword occurrences (e.g., error, failure), and log volume changes (e.g., sudden rise or drop). | -| OSS and BSS abnormal information | The abnormal information collected by the OSS and BSS contains the abnormal frequency of keyword occurrences (e.g., alarm, error), and log volume changes (e.g., sudden rise or drop). | -| 5GC and EPC network function abnormal information | The abnormal information collected by the (virtual) network elements of 5GC and EPC contains the abnormal frequency of keyword occurrences (e.g., error, warning), and log volume changes (e.g., sudden rise or drop). | -| LTE E-UTRAN and 5G NG-RAN base station generates frequently performance false alarm | Usually, LTE E-UTRAN and 5G NG-RAN base station performance measurements are below the threshold predefined by the operator, an alarm will be generated, but sometimes performance fault recovery occurs by the equipment itself and the corresponding alarms are closed, the reasons may be due to transmission flash break and wind (antenna of a base station could be affected), etc. Thus, it is necessary to distinguish the true performance alarm from all of the alarms. The method of threshold adjusted, and delay set is not valid in most of the cases. | - -## Appendix II - -### Use cases of log analysis in telecom management with AI - -(This appendix does not form an integral part of this Recommendation.) - -After log analysis with AI, the analysis results such as anomaly monitoring information, fault classification information, and fault prediction information are formed, as shown in the following tables. - -**Table II.1 – An intelligent system of real-time monitoring and anomaly warning** - -| Title | An intelligent system of real-time monitoring and anomaly warning | -|-------------|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| Description |

This case is an intelligent system with real-time monitoring and anomaly warning function. Each log has its unique characteristics. For example, when automatic protection warning occurs, the OTN transmission link log information will be created. With these feature behaviours of the managed elements, whether there is real automatic protection anomaly, can be determined.

  1. 1) Collect log data including possible fault information from OS servers and network elements through the AI log acquisition module.
  2. 2) Analyse the log analysis strategy and pre-process log data to convert it into a standard format in the AI log data processing module.

NOTE 1 – The information can be extracted directly from some log data which has a fixed format (e.g., IP address, etc.).

  1. 3) Store the pre-processed data in the AI log storage module.
  2. 4) Acquire the pre-processed data from the database, knowledge base and diagnosis database of the expert system in the AI log storage module and form the training data and test data sets.
  3. 5) Train the model in AI log analysis module according to the train data sets and update the parameter of the model by test data sets.
  4. 6) Acquire online log data which has been collected, pre-processed and stored, then match the pre-processed log to a log template based on the trained models.
  5. 7) Carry out pattern mining on unmatched log data to extract log features from pre-processed logs.
  6. 8) Extract anomaly detection to carry out real-time monitoring.
  7. 9) Visualize the anomaly results and anomaly warning.
  8. 10) The online data is used to retrain existing models to improve model quality.

NOTE 2 – Existing models also can be incrementally retrained, and parameters are updated to improve model quality by periodically updating the training data.

| - -**Table II.1 – An intelligent system of real-time monitoring and anomaly warning** - -![Diagram of an intelligent system of real-time monitoring and anomaly warning. The system consists of three main modules: AI log acquisition module (1), AI log data processing module (2), and AI log storage module (3). The AI log storage module feeds into the AI log analysis module. The AI log analysis module contains three sub-modules: Model training (4, 5), Pattern recognition (6, 7, 10), and Extract anomaly results and real-time monitoring (8, 9). The flow is: 1) Log from OS servers and network elements are collected by the AI log acquisition module. 2) The data is processed by the AI log data processing module. 3) The processed data is stored in the AI log storage module. 4) The AI log storage module feeds into the Model training sub-module, where a data set is formed (4) and the model is trained (5). 5) The trained model is used in the Pattern recognition sub-module, where data is matched to a template (6) and patterns are mined (7). 6) The mined patterns are used in the Extract anomaly results and real-time monitoring sub-module (8). 7) The results are visualized (9). 10) A feedback loop exists from the Pattern recognition sub-module back to the Model training sub-module. Red arrows indicate development state using offline data, and blue arrows indicate operation state using online data.](ff7ce44f3fdd51bae7b231f34df07c6a_img.jpg) - -| Title | An intelligent system of real-time monitoring and anomaly warning | -|-------------|-------------------------------------------------------------------| -| Figure II.1 |

M.3383(23)

| - -Diagram of an intelligent system of real-time monitoring and anomaly warning. The system consists of three main modules: AI log acquisition module (1), AI log data processing module (2), and AI log storage module (3). The AI log storage module feeds into the AI log analysis module. The AI log analysis module contains three sub-modules: Model training (4, 5), Pattern recognition (6, 7, 10), and Extract anomaly results and real-time monitoring (8, 9). The flow is: 1) Log from OS servers and network elements are collected by the AI log acquisition module. 2) The data is processed by the AI log data processing module. 3) The processed data is stored in the AI log storage module. 4) The AI log storage module feeds into the Model training sub-module, where a data set is formed (4) and the model is trained (5). 5) The trained model is used in the Pattern recognition sub-module, where data is matched to a template (6) and patterns are mined (7). 6) The mined patterns are used in the Extract anomaly results and real-time monitoring sub-module (8). 7) The results are visualized (9). 10) A feedback loop exists from the Pattern recognition sub-module back to the Model training sub-module. Red arrows indicate development state using offline data, and blue arrows indicate operation state using online data. - -**Table II.2 – An intelligent system of fault prediction** - -| Title | An intelligent system of fault prediction | -|-------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| Description |

This case is an intelligent system with a fault prediction function. AI log collection module will collect information (including possible fault information) from the OS server log and network element log in the AI log storage module after being structured and normalized by the AI log data processing module. AI log analysis module will use the AI model stored in a common artificial intelligence model library or telecom specific artificial intelligence model library for fault prediction according to the requirements.

  1. 1) Collect the current log with potential faults from the OS servers and network elements through the AI log acquisition module.
  2. 2) Analyse the log analysis strategy and pre-process log data to convert it into a standard format in the AI log data processing module.

NOTE 1 – The information can be extracted directly from some log data which has a fixed format (e.g., IP address, etc.).

  1. 3) Store the pre-processed data in the AI log storage module.
  2. 4) Acquire the pre-processed data from the database, knowledge base and diagnosis database of the expert system in the AI log storage module, which includes the normal log with the label "1" and fault log with the label "0", to form the training data and test data sets.
  3. 5) Train the model in AI log analysis module according to the train data sets and update the parameter of the model by test data sets.
  4. 6) Generate the predicted value based on the trained model.
  5. 7) Compare the predicted value with the threshold.
  6. 8) If the value is larger than the threshold, which means a potential fault is identified.

NOTE 2 – Existing models also can be incrementally retrained, and parameters are updated to improve model quality by periodically updating the training data.

| - -**Table II.2 – An intelligent system of fault prediction** - -![Diagram of an intelligent system of fault prediction. It shows three main modules: 1. AI log acquisition module (collecting logs from OS servers and network elements), 2. AI log data processing module, and 3. AI log storage module. These modules feed into the AI log analysis module. The analysis module contains a 'Model training' sub-module (4. Form data set, 5. Train model) and a 'Potential failure assessment' sub-module (6. Compare predicted value with the threshold, 7. Potential failure assessment). Arrows indicate the flow of data, with red arrows for development state (offline data) and blue arrows for operation state (online data).](7f25db95ce3916c0e09803b861a2f7bc_img.jpg) - -| Title | An intelligent system of fault prediction | -|-------------|----------------------------------------------| -| Figure II.2 |

M.3383(23)

| - -Diagram of an intelligent system of fault prediction. It shows three main modules: 1. AI log acquisition module (collecting logs from OS servers and network elements), 2. AI log data processing module, and 3. AI log storage module. These modules feed into the AI log analysis module. The analysis module contains a 'Model training' sub-module (4. Form data set, 5. Train model) and a 'Potential failure assessment' sub-module (6. Compare predicted value with the threshold, 7. Potential failure assessment). Arrows indicate the flow of data, with red arrows for development state (offline data) and blue arrows for operation state (online data). - -**Table II.3 – An intelligent system of fault classification** - -| Title | An intelligent system of fault classification | -|-------------|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| Description |

This case is an intelligent system with a fault classification function. The AI log acquisition module collects real-time log data, inputs the processed data into the AI log analysis module, and finally outputs the fault classification results to realize the classification of the fault.

  1. 1) Collect all the abnormal events and attack events on the current network, including fault information from the OS servers and network elements through the AI log acquisition module.
  2. 2) Analyse the log analysis strategy and pre-process log data to convert it into a standard format in the AI log data processing module.

NOTE 1 – The information can be extracted directly from some log data which has a fixed format (e.g., IP address, etc.).

  1. 3) Store the pre-processed data in the AI log storage module.
  2. 4) Acquire the pre-processed data from the diagnosis database of the expert system in the AI log storage module and form the training data and test data sets to train the model. Apply the model to classify the current log.
  3. 5) Compare the value of the maximum matching probability with the specified threshold.
  4. 6) If the value is larger than the threshold, the current fault is identified as the maximum matching fault; while the value is smaller than the threshold, the current is identified as a new fault, which will be deeply analysed.
  5. 7) Confirm new fault types with expert experience and cluster analysis.
  6. 8) The online data is used to retrain the existing model to improve model quality with a new fault type label.

NOTE 2 – Existing models also can be incrementally retrained, and parameters are updated to improve model quality by periodically updating the training data.

| - -**Table II.3 – An intelligent system of fault classification** - -![Diagram of an intelligent system of fault classification. The system consists of three main modules: 1. AI log acquisition module (Log from OS servers, Log from network elements), 2. AI log data processing module, and 3. AI log storage module. The AI log storage module feeds into the AI log analysis module. The AI log analysis module contains: 4. Model training (Form data set, Train model), 5. Compare the maximum predicted probability with the threshold, 6. Confirm fault, 7. Analyse new fault, and 8. Feedback loop. Red arrows indicate development state using offline data, and blue arrows indicate operation state using online data.](83852ec55d4802521a727926336bedab_img.jpg) - -| Title | An intelligent system of fault classification | -|-------------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| Figure II.3 |

The diagram illustrates an intelligent system of fault classification. It is divided into two main parts: the AI log storage and processing part, and the AI log analysis module.

  • AI log storage and processing part:
    • 1 AI log acquisition module: Contains 'Log from OS servers' and 'Log from network elements'.
    • 2 AI log data processing module: Receives data from the acquisition module.
    • 3 AI log storage module: Receives data from the processing module and sends it to the analysis module.
  • AI log analysis module:
    • 4 Model training: Consists of 'Form data set' and 'Train model'. A red arrow (development state) goes from 'Form data set' to 'Train model'.
    • 5 Compare the maximum predicted probability with the threshold: A blue arrow (operation state) goes from 'Train model' to this step.
    • 6 Confirm fault / Analyse new fault: Two blue arrows (operation state) go from step 5 to these steps.
    • 7 Analyse new fault: A blue arrow goes from 'Confirm fault' to 'Analyse new fault'.
    • 8 Feedback loop: A blue arrow goes from 'Analyse new fault' back to 'Train model'.

Legend:

  • Red arrow: In development state using offline data
  • Blue arrow: In operation state using online data

M.3383(23)

| - -Diagram of an intelligent system of fault classification. The system consists of three main modules: 1. AI log acquisition module (Log from OS servers, Log from network elements), 2. AI log data processing module, and 3. AI log storage module. The AI log storage module feeds into the AI log analysis module. The AI log analysis module contains: 4. Model training (Form data set, Train model), 5. Compare the maximum predicted probability with the threshold, 6. Confirm fault, 7. Analyse new fault, and 8. Feedback loop. Red arrows indicate development state using offline data, and blue arrows indicate operation state using online data. - -Here we provide several scenarios of log analysis with AI that could help network operators manage and maintain the network better. - -#### Scenario 1: managed element alarm optimization - -**Data type:** Bit error rate data of communication transmission network and optical power monitoring log data of transmission equipment. - -**Apply scenario:** Communication transmission network. - -**Requirement description:** Due to the problems of real-time measurement error, network error code and packet loss in the communication transmission network, the bad data will affect the real-time status evaluation results of the transmission network, and then lead to wrong operation and maintenance decisions. - -**Processing method:** By using the bad data evaluation algorithm, the mining algorithm based on the relative density is used to mine the measured data, the historical log data, and the corresponding network alarm information. Based on the results of the bad data mining, the running state of the transmission network is evaluated and comprehensively analysed. - -**Contribution:** The influence of real-time measurement error, network error code, and packet loss on the bit error rate of communication network and optical power of transmission equipment is solved, and the occurrence of error alarm is reduced. - -#### Scenario 2: operation and maintenance of optical cable - -**Data type:** Operation and maintenance log data of optical cable of the communication network. - -**Apply scenario:** Optical transmission network. - -**Requirement description:** Due to the lack of real-time data analysis of resource performance, equipment aging, and fault information are difficult to timely monitor. The lack of external weather data makes it difficult to prevent cable failure in extreme weather. - -**Processing method:** Based on the analysis of fibre optic cable performance log data, fibre optic cable operation and maintenance log data, and fibre optic cable environment meteorological log data, the relevant performance data and environmental data were extracted to model the operation of a fibre optic cable, and classification algorithms such as decision tree and support vector machine (SVM) - -combined algorithms such as bagging and boosting were used to carry out fault warning for fibre optic cable. - -**Contribution:** Real-time monitoring and early warning of optical cable deterioration can be realized to reduce the risk of optical cable failure caused by meteorological disasters. - -#### **Scenario 3: managed element temperature monitoring** - -**Data type:** Temperature monitoring log data of communication network elements. - -**Apply scenario:** All kinds of communication network elements. - -**Requirement description:** The original alarm method by setting the temperature detection threshold of the power environment in the communication room is sensitive to the distance between the monitoring point and the communication equipment, which is easy to lead to a large temperature measurement deviation. At the same time, the accuracy of the temperature alarm is difficult to control because of the different equipment specifications and sensitivity of each network element manufacturer. - -**Processing method:** The temperature parameters are extracted from the massive log data generated by the integrated temperature measurement module, and the analysis and early warning of historical data are realized through temperature data collection, model normalization, data analysis, and function presentation by using the processing technology and idea of big data processing methods (such as the ARMA model). - -**Contribution:** Compared with the traditional monitoring and processing methods, the temperature monitoring system based on the log file historical record of the communication network is more sensitive to temperature changes, can detect temperature anomalies in advance, can reduce the accident level of substation and communication room, and improve the system security. - -#### **Scenario 4: OTN fault diagnosis** - -**Data type:** OTN alarm log data. - -**Apply scenario:** OTN. - -**Requirement description:** Traditional alarm methods get a lot of interference, redundancy, and incomplete information in OTN alarm information, and cost a long time to locate the problem. In practical application, it is necessary to properly determine the location, type, and cause of the fault within the shortest time, to repair or isolate the fault in time. - -**Processing method:** Through analysing OTN alarm log files, the algorithm adopts alarm time synchronization processing, alarm information sorting and field extraction, alarm compression, and other methods to realize the standardized processing of alarm information, and finally transforms the alarm transaction database. By using neural network and data characteristics of association rule alarm transaction database, alarm events are modelled, and fault diagnosis of alarm events is realized. - -**Contribution:** With the help of real-time data and historical data in OTN alarm logs, the standardized management of alarms for optical transmission network equipment of different manufacturers is realized, and the correlation of log data is analysed by using data mining technology, and the intelligent alarm cause diagnosis is realized. - -#### **Scenario 5: LTE E-UTRAN and 5G NG-RAN base station false alarm distinguished** - -**Data type:** Base station false alarm log data. - -**Apply scenario:** LTE E-UTRAN and 5G NG-RAN base station. - -**Requirement description:** Traditional LTE E-UTRAN and 5G NG-RAN base station false alarm distinguished methods that performance threshold adjusted, and time windows set are not valid to most of the cases, it leads to a lot of effort for the operator to distinguish them by hand, and the - -accuracy is low. Since the number of base stations is large for operators, it is necessary to find a new way to distinguish fault alarms quickly and accurately. - -**Processing method:** LTE E-UTRAN and 5G NG-RAN base station performance measurement log files are analysed by an AI-enhanced management system, the process includes performance indicators data extraction, standard format transformation, loaded to the database and the AI method applied. In the data pre-processing phase, data features are calculated from the statistical characteristics, fitting features and radio service features, and combined by serial or parallel concatenation. In the AI processing phase, the decision tree and LightGBM method are used, and the parameters are optimised according to experience. - -**Contribution:** With the help of real-time data and historical data in LTE E-UTRAN and 5G NG-RAN base station performance logs, the standardized management of performance false alarms for LTE E-UTRAN and 5G NG-RAN base station equipment of different manufacturers is realized, and the false alarm is analysed by using data mining technology quickly and accurately. - -## Bibliography - -- [b-ITU-T Y.3100] Recommendation ITU-T Y.3100 (2017), *Terms and definitions for IMT-2020 network*. - - - - - -## SERIES OF ITU-T RECOMMENDATIONS - -| | | -|-----------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------| -| Series A | Organization of the work of ITU-T | -| Series D | Tariff and accounting principles and international telecommunication/ICT economic and policy issues | -| Series E | Overall network operation, telephone service, service operation and human factors | -| Series F | Non-telephone telecommunication services | -| Series G | Transmission systems and media, digital systems and networks | -| Series H | Audiovisual and multimedia systems | -| Series I | Integrated services digital network | -| Series J | Cable networks and transmission of television, sound programme and other multimedia signals | -| Series K | Protection against interference | -| Series L | Environment and ICTs, climate change, e-waste, energy efficiency; construction, installation and protection of cables and other elements of outside plant | -| Series M | Telecommunication management, including TMN and network maintenance | -| Series N | Maintenance: international sound programme and television transmission circuits | -| Series O | Specifications of measuring equipment | -| Series P | Telephone transmission quality, telephone installations, local line networks | -| Series Q | Switching and signalling, and associated measurements and tests | -| Series R | Telegraph transmission | -| Series S | Telegraph services terminal equipment | -| Series T | Terminals for telematic services | -| Series U | Telegraph switching | -| Series V | Data communication over the telephone network | -| Series X | Data networks, open system communications and security | -| Series Y | Global information infrastructure, Internet protocol aspects, next-generation networks, Internet of Things and smart cities | -| Series Z | Languages and general software aspects for telecommunication systems | \ No newline at end of file diff --git a/marked/X/T-REC-X.1058-201703-I_PDF-E/14a22f23ced8ba1d63ece69861dbaacc_img.jpg b/marked/X/T-REC-X.1058-201703-I_PDF-E/14a22f23ced8ba1d63ece69861dbaacc_img.jpg deleted file mode 100644 index fa7df8eb59f52ab578c33e951db1af00ee0782cf..0000000000000000000000000000000000000000 --- a/marked/X/T-REC-X.1058-201703-I_PDF-E/14a22f23ced8ba1d63ece69861dbaacc_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:11ab535f3d5b4bb86530ae9a42435596a9352bb94e35bfbd599894a53122ac54 -size 4145 diff --git a/marked/X/T-REC-X.1058-201703-I_PDF-E/3121ebddccf183ca63bb9781be440a7e_img.jpg b/marked/X/T-REC-X.1058-201703-I_PDF-E/3121ebddccf183ca63bb9781be440a7e_img.jpg deleted file mode 100644 index abb5eb2cca5d9604d4ec85f5d2521c9bc0fff5ea..0000000000000000000000000000000000000000 --- a/marked/X/T-REC-X.1058-201703-I_PDF-E/3121ebddccf183ca63bb9781be440a7e_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:f8f51327eb55bdbb60c86258867b83e29bf89b907c027d709bfd80af53d1a961 -size 59281 diff --git a/marked/X/T-REC-X.1058-201703-I_PDF-E/raw.md b/marked/X/T-REC-X.1058-201703-I_PDF-E/raw.md deleted file mode 100644 index df128e856f2be8166b4f92c75d4ae90b7e431c27..0000000000000000000000000000000000000000 --- a/marked/X/T-REC-X.1058-201703-I_PDF-E/raw.md +++ /dev/null @@ -1,2139 +0,0 @@ - - -# ITU-T - -TELECOMMUNICATION -STANDARDIZATION SECTOR -OF ITU - -## X.1058 - -(03/2017) - -SERIES X: DATA NETWORKS, OPEN SYSTEM -COMMUNICATIONS AND SECURITY - -Information and network security – Security management - -# --- **Information technology – Security techniques – Code of practice for personally identifiable information protection** - -Recommendation ITU-T X.1058 - -## ITU-T X-SERIES RECOMMENDATIONS DATA NETWORKS, OPEN SYSTEM COMMUNICATIONS AND SECURITY - -| | | -|--------------------------------------------------------|----------------------| -| PUBLIC DATA NETWORKS | X.1–X.199 | -| OPEN SYSTEMS INTERCONNECTION | X.200–X.299 | -| INTERWORKING BETWEEN NETWORKS | X.300–X.399 | -| MESSAGE HANDLING SYSTEMS | X.400–X.499 | -| DIRECTORY | X.500–X.599 | -| OSI NETWORKING AND SYSTEM ASPECTS | X.600–X.699 | -| OSI MANAGEMENT | X.700–X.799 | -| SECURITY | X.800–X.849 | -| OSI APPLICATIONS | X.850–X.899 | -| OPEN DISTRIBUTED PROCESSING | X.900–X.999 | -| INFORMATION AND NETWORK SECURITY | | -| General security aspects | X.1000–X.1029 | -| Network security | X.1030–X.1049 | -| Security management | X.1050–X.1069 | -| Telebiometrics | X.1080–X.1099 | -| SECURE APPLICATIONS AND SERVICES | | -| Multicast security | X.1100–X.1109 | -| Home network security | X.1110–X.1119 | -| Mobile security | X.1120–X.1139 | -| Web security | X.1140–X.1149 | -| Security protocols | X.1150–X.1159 | -| Peer-to-peer security | X.1160–X.1169 | -| Networked ID security | X.1170–X.1179 | -| IPTV security | X.1180–X.1199 | -| CYBERSPACE SECURITY | | -| Cybersecurity | X.1200–X.1229 | -| Countering spam | X.1230–X.1249 | -| Identity management | X.1250–X.1279 | -| SECURE APPLICATIONS AND SERVICES | | -| Emergency communications | X.1300–X.1309 | -| Ubiquitous sensor network security | X.1310–X.1339 | -| PKI related Recommendations | X.1340–X.1349 | -| Internet of things (IoT) security | X.1360–X.1369 | -| Intelligent transportation system (ITS) security | X.1370–X.1379 | -| CYBERSECURITY INFORMATION EXCHANGE | | -| Overview of cybersecurity | X.1500–X.1519 | -| Vulnerability/state exchange | X.1520–X.1539 | -| Event/incident/heuristics exchange | X.1540–X.1549 | -| Exchange of policies | X.1550–X.1559 | -| Heuristics and information request | X.1560–X.1569 | -| Identification and discovery | X.1570–X.1579 | -| Assured exchange | X.1580–X.1589 | -| CLOUD COMPUTING SECURITY | | -| Overview of cloud computing security | X.1600–X.1601 | -| Cloud computing security design | X.1602–X.1639 | -| Cloud computing security best practices and guidelines | X.1640–X.1659 | -| Cloud computing security implementation | X.1660–X.1679 | -| Other cloud computing security | X.1680–X.1699 | - -*For further details, please refer to the list of ITU-T Recommendations.* - -# **Information technology – Security techniques – Code of practice for personally identifiable information protection** - -## **Summary** - -The number of organizations processing personally identifiable information (PII) is increasing, as is the amount of PII that these organizations deal with. At the same time, societal expectations for the protection of PII and the security of data relating to individuals are also increasing. A number of countries are augmenting their laws to address the increased number of high profile data breaches. - -This Specification establishes control objectives, controls and guidelines for implementing controls, to meet the requirements identified by a risk and impact assessment related to the protection of PII. In particular, this Specification specifies guidelines based on ISO/IEC 27002, taking into consideration the requirements for processing PII that may be applicable within the context of an organization's information security risk environment(s). - -## **History** - -| Edition | Recommendation | Approval | Study Group | Unique ID* | -|---------|----------------|------------|-------------|---------------------------------------------------------------------------| -| 1.0 | ITU-T X.1058 | 2017-03-30 | 17 | 11.1002/1000/13182 | - -## **Keywords** - -Code of practice, control, implementation guidance, PII. - ---- - -\* To access the Recommendation, type the URL in the address field of your web browser, followed by the Recommendation's unique ID. For example, . - -## FOREWORD - -The International Telecommunication Union (ITU) is the United Nations specialized agency in the field of telecommunications, information and communication technologies (ICTs). The ITU Telecommunication Standardization Sector (ITU-T) is a permanent organ of ITU. ITU-T is responsible for studying technical, operating and tariff questions and issuing Recommendations on them with a view to standardizing telecommunications on a worldwide basis. - -The World Telecommunication Standardization Assembly (WTSA), which meets every four years, establishes the topics for study by the ITU-T study groups which, in turn, produce Recommendations on these topics. - -The approval of ITU-T Recommendations is covered by the procedure laid down in WTSA Resolution 1. - -In some areas of information technology which fall within ITU-T's purview, the necessary standards are prepared on a collaborative basis with ISO and IEC. - -## NOTE - -In this Recommendation, the expression "Administration" is used for conciseness to indicate both a telecommunication administration and a recognized operating agency. - -Compliance with this Recommendation is voluntary. However, the Recommendation may contain certain mandatory provisions (to ensure, e.g., interoperability or applicability) and compliance with the Recommendation is achieved when all of these mandatory provisions are met. The words "shall" or some other obligatory language such as "must" and the negative equivalents are used to express requirements. The use of such words does not suggest that compliance with the Recommendation is required of any party. - -## INTELLECTUAL PROPERTY RIGHTS - -ITU draws attention to the possibility that the practice or implementation of this Recommendation may involve the use of a claimed Intellectual Property Right. ITU takes no position concerning the evidence, validity or applicability of claimed Intellectual Property Rights, whether asserted by ITU members or others outside of the Recommendation development process. - -As of the date of approval of this Recommendation, ITU had not received notice of intellectual property, protected by patents, which may be required to implement this Recommendation. However, implementers are cautioned that this may not represent the latest information and are therefore strongly urged to consult the TSB patent database at . - -© ITU 2017 - -All rights reserved. No part of this publication may be reproduced, by any means whatsoever, without the prior written permission of ITU. - -## CONTENTS - -| | Page | -|----------------------------------------------------------|-------------| -| 1 Scope ..... | 1 | -| 2 Normative references..... | 1 | -| 3 Definitions and abbreviated terms ..... | 1 | -| 3.1 Definitions..... | 1 | -| 3.2 Abbreviated terms ..... | 1 | -| 4 Overview ..... | 2 | -| 4.1 Objective for the protection of PII ..... | 2 | -| 4.2 Requirement for the protection of PII ..... | 2 | -| 4.3 Controls ..... | 2 | -| 4.4 Selecting controls ..... | 2 | -| 4.5 Developing organization specific guidelines..... | 3 | -| 4.6 Life cycle considerations..... | 3 | -| 4.7 Structure of this Specification ..... | 3 | -| 5 Information security policies ..... | 4 | -| 5.1 Management directions for information security ..... | 4 | -| 6 Organization of information security..... | 4 | -| 6.1 Internal organization ..... | 4 | -| 6.2 Mobile devices and teleworking..... | 5 | -| 7 Human resource security ..... | 6 | -| 7.1 Prior to employment..... | 6 | -| 7.2 During employment ..... | 6 | -| 7.3 Termination and change of employment..... | 6 | -| 8 Asset management..... | 7 | -| 8.1 Responsibility for assets..... | 7 | -| 8.2 Information classification..... | 7 | -| 8.3 Media handling..... | 8 | -| 9 Access control ..... | 9 | -| 9.1 Business requirement of access control..... | 9 | -| 9.2 User access management..... | 9 | -| 9.3 User responsibilities ..... | 10 | -| 9.4 System and application access control ..... | 10 | -| 10 Cryptography..... | 11 | -| 10.1 Cryptographic controls..... | 11 | -| 11 Physical and environmental security ..... | 11 | -| 11.1 Secure areas..... | 11 | -| 11.2 Equipment ..... | 12 | -| 12 Operations security ..... | 12 | -| 12.1 Operational procedures and responsibilities..... | 12 | -| 12.2 Protection from malware..... | 13 | -| 12.3 Backup ..... | 13 | -| 12.4 Logging and monitoring..... | 13 | -| 12.5 Control of operational software..... | 14 | -| 12.6 Technical vulnerability management ..... | 14 | -| 12.7 Information systems audit considerations ..... | 14 | -| 13 Communications security ..... | 15 | -| 13.1 Network security management..... | 15 | -| 13.2 Information transfer..... | 15 | -| 14 System acquisition, development and maintenance ..... | 15 | -| 14.1 Security requirements of information systems ..... | 15 | -| 14.2 Security in development and support processes ..... | 16 | - -| | Page | -|-------------------------------------------------------------------------------------------------------------------------------------------------|-------------| -| 14.3 Test data ..... | 16 | -| 15 Supplier relationships ..... | 17 | -| 15.1 Information security in supplier relationships ..... | 17 | -| 15.2 Supplier service delivery management ..... | 18 | -| 16 Information security incident management ..... | 18 | -| 16.1 Management of information security incidents and improvements ..... | 18 | -| 17 Information security aspects of business continuity management ..... | 19 | -| 17.1 Information security continuity ..... | 19 | -| 17.2 Redundancies ..... | 19 | -| 18 Compliance ..... | 20 | -| 18.1 Compliance with legal and contractual requirements ..... | 20 | -| 18.2 Information security reviews ..... | 21 | -| Annex A – Extended control set for PII protection (This annex forms an integral part of this
Recommendation International Standard.) ..... | 22 | -| A.1 General ..... | 22 | -| A.2 General policies for the use and protection of PII ..... | 22 | -| A.3 Consent and choice ..... | 22 | -| A.4 Purpose legitimacy and specification ..... | 24 | -| A.5 Collection limitation ..... | 26 | -| A.6 Data minimization ..... | 26 | -| A.7 Use, retention and disclosure limitation ..... | 27 | -| A.8 Accuracy and quality ..... | 30 | -| A.9 Openness, transparency and notice ..... | 31 | -| A.10 PII principal participation and access ..... | 32 | -| A.11 Accountability ..... | 34 | -| A.12 Information security ..... | 37 | -| A.13 Privacy compliance ..... | 37 | -| Bibliography ..... | 39 | - -# Introduction - -The number of organizations processing personally identifiable information (PII) is increasing, as is the amount of PII that these organizations deal with. At the same time, societal expectations for the protection of PII and the security of data relating to individuals are also increasing. A number of countries are augmenting their laws to address the increased number of high profile data breaches. - -As the number of PII breaches increases, organizations collecting or processing PII will increasingly need guidance on how they should protect PII in order to reduce the risk of privacy breaches occurring, and to reduce the impact of breaches on the organization and on the individuals concerned. This Specification provides such guidance. - -This Specification offers guidance for PII controllers on a broad range of information security and PII protection controls that are commonly applied in many different organizations that deal with protection of PII. The remaining parts of the family of ISO/IEC standards, listed here, provide guidance or requirements on other aspects of the overall process of protecting PII: - -- ISO/IEC 27001 specifies an information security management process and associated requirements, which could be used as a basis for the protection of PII. -- ISO/IEC 27002 gives guidelines for organizational information security standards and information security management practices including the selection, implementation and management of controls, taking into consideration the organization's information security risk environment(s). -- ISO/IEC 27009 specifies the requirements for the use of ISO/IEC 27001 in any specific sector (field, application area or market sector). It explains how to include requirements additional to those in ISO/IEC 27001, how to refine any of the ISO/IEC 27001 requirements, and how to include controls or control sets in addition to Annex A of ISO/IEC 27001. -- ISO/IEC 27018 offers guidance to organizations acting as PII processors when offering processing capabilities as cloud services. -- ISO/IEC 29134 provides guidelines for identifying, analysing, and assessing privacy risks, while ISO/IEC 27001 together with ISO/IEC 27005 provides a methodology for identifying, analysing, and assessing security risks. - -Controls should be chosen based on the risks identified as a result of a risk analysis to develop a comprehensive, consistent system of controls. Controls should be adapted to the context of the particular processing of PII. - -This Specification contains two parts: 1) the main body consisting of clauses 1 to 18, and 2) a normative annex. This structure reflects normal practice for the development of sector-specific extensions to ISO/IEC 27002. - -The structure of the main body of this Specification, including the clause titles, reflects the main body of ISO/IEC 27002. The introduction and clauses 1 to 4 provide background on the use of this Specification. Headings for clauses 5 to 18 mirror those of ISO/IEC 27002, reflecting the fact that this Specification builds on the guidance in ISO/IEC 27002, adding new controls specific to the protection of PII. Many of the controls in ISO/IEC 27002 need no amplification in the context of PII controllers. However, in some cases, additional implementation guidance is needed, and this is given under the appropriate heading (and clause number) from ISO/IEC 27002. - -The normative annex contains an extended set of PII protection-specific controls that supplement those given in ISO/IEC 27002. These new PII protection controls, with their associated guidance, are divided into 12 categories, corresponding to the privacy policy and the 11 privacy principles of ISO/IEC 29100: - -- consent and choice; -- purpose, legitimacy and specification; -- collection limitation; -- data minimization; -- use, retention and disclosure limitation; -- accuracy and quality; -- openness, transparency and notice; -- individual participation and access; -- accountability; -- information security; and -- privacy compliance. - -Figure 1 describes the relationship between this Specification and the family of ISO/IEC standards. - -![A hierarchical diagram showing the relationship between various ISO/IEC standards. At the top is a box labeled 'Management system/framework'. Below it is a large box containing 'ISO/IEC 27001 : Information security management' and 'ISO/IEC 29100 : Privacy framework'. This large box branches into two smaller boxes: 'Risk management' on the left and 'Controls' on the right. Under 'Risk management' are two boxes: 'ISO/IEC 27005 : Information security risk management' and 'ISO/IEC 29134 : Privacy impact assessment'. Under 'Controls' are two boxes: 'ISO/IEC 27002 : Code of practice for information security controls' and 'ITU-T X.1058 | ISO/IEC 29151 : Code of practice for personally identifiable information protection'. The text 'X.1058(17)_F01' is located at the bottom right of the diagram.](3121ebddccf183ca63bb9781be440a7e_img.jpg) - -``` - -graph TD - MSF[Management system/framework] - subgraph MainBox [ ] - ISO27001[ISO/IEC 27001 : Information security management] - ISO29100[ISO/IEC 29100 : Privacy framework] - end - subgraph RiskManagement [Risk management] - ISO27005[ISO/IEC 27005 : Information security risk management] - ISO29134[ISO/IEC 29134 : Privacy impact assessment] - end - subgraph Controls [Controls] - ISO27002[ISO/IEC 27002 : Code of practice for information security controls] - ITUTX1058[ITU-T X.1058 | ISO/IEC 29151 : Code of practice for personally identifiable information protection] - end - MSF --- MainBox - MainBox --- RiskManagement - MainBox --- Controls - RiskManagement --- ISO27005 - RiskManagement --- ISO29134 - Controls --- ISO27002 - Controls --- ITUTX1058 - -``` - -X.1058(17)\_F01 - -A hierarchical diagram showing the relationship between various ISO/IEC standards. At the top is a box labeled 'Management system/framework'. Below it is a large box containing 'ISO/IEC 27001 : Information security management' and 'ISO/IEC 29100 : Privacy framework'. This large box branches into two smaller boxes: 'Risk management' on the left and 'Controls' on the right. Under 'Risk management' are two boxes: 'ISO/IEC 27005 : Information security risk management' and 'ISO/IEC 29134 : Privacy impact assessment'. Under 'Controls' are two boxes: 'ISO/IEC 27002 : Code of practice for information security controls' and 'ITU-T X.1058 | ISO/IEC 29151 : Code of practice for personally identifiable information protection'. The text 'X.1058(17)\_F01' is located at the bottom right of the diagram. - -**Figure 1 – The relationship of this Specification and the family of ISO/IEC standards** - -This Specification includes guidelines based on ISO/IEC 27002, and adapts these as necessary to address the privacy safeguarding requirements that arise from the processing of PII: - -- a) In different processing domains such as: - - public cloud services, - - social networking applications, - - internet-connected devices in the home, - - search, analysis, - - targeting of PII for advertising and similar purposes, - - big data analytics programmes, - - employment processing, - - business management in sales and service (enterprise resource planning, customer relationship management); -- b) In different locations such as: - - on a personal processing platform provided to an individual (e.g., smart cards, smart phones and their apps, smart meters, wearable devices), - - within data transportation and collection networks (e.g., where mobile phone location data is created operationally by network processing, which may be considered PII in some jurisdictions), - - within an organization's own processing infrastructure, - - on a third party's processing platform; -- c) For the collection characteristic such as: - - one-time data collection (e.g., on registering for a service), - - ongoing data collection (e.g., frequent health parameter monitoring by sensors on or in an individual's body, multiple data collections using contactless payment cards for payment, smart meter data collection systems, and so on). - -NOTE – Ongoing data collection can contain or yield behavioural, locational and other types of PII. In such cases, the use of PII protection controls that allow access and collection to be managed based on consent and that allow the PII principal to exercise appropriate control over such access and collection, need to be considered. - -## **INTERNATIONAL STANDARD ITU-T RECOMMENDATION** - -# **Information technology – Security techniques – Code of practice for personally identifiable information protection** - -# **1 Scope** - -This Recommendation | International Standard establishes control objectives, controls and guidelines for implementing controls, to meet the requirements identified by a risk and impact assessment related to the protection of personally identifiable information (PII). - -In particular, this Recommendation | International Standard specifies guidelines based on ISO/IEC 27002, taking into consideration the requirements for processing PII that may be applicable within the context of an organization's information security risk environment(s). - -This Recommendation | International Standard is applicable to all types and sizes of organizations acting as PII controllers (as defined in ISO/IEC 29100), including public and private companies, government entities and not-for-profit organizations that process PII. - -# **2 Normative references** - -The following Recommendations and International Standards contain provisions which, through reference in this text, constitute provisions of this Recommendation | International Standard. At the time of publication, the editions indicated were valid. All Recommendations and Standards are subject to revision, and parties to agreements based on this Recommendation | International Standard are encouraged to investigate the possibility of applying the most recent edition of the Recommendations and Standards listed below. Members of IEC and ISO maintain registers of currently valid International Standards. The Telecommunication Standardization Bureau of the ITU maintains a list of currently valid ITU-T Recommendations. - -- ISO/IEC 27002:2013, *Information technology – Security techniques – Code of practice for information security controls*. -- ISO/IEC 29100:2011, *Information technology – Security techniques – Privacy framework*. - -# **3 Definitions and abbreviated terms** - -## **3.1 Definitions** - -For the purposes of this Recommendation | International Standard, the terms and definitions that are given in ISO/IEC 27000:2016, ISO/IEC 29100 and the following apply. - -The [ISO Online browsing platform](#), [IEC Electropedia](#) and [ITU Terms and definitions](#) are terminological databases for use in standardization. - -**3.1.1 chief privacy officer (CPO):** Senior management individual who is accountable for the protection of personally identifiable information (PII) in an organization. - -**3.1.2 de-identification process:** Process of removing the association between a set of identifying data and the data principal, using de-identification techniques. - -## **3.2 Abbreviated terms** - -For the purposes of this Specification, the following abbreviations apply. - -| | | -|------|------------------------------| -| BCR | Binding Corporate Rule | -| CCTV | Closed-Circuit Television | -| CPO | Chief Privacy Officer | -| PBD | Privacy By Design | -| PDA | Personal Digital Assistant | -| PET | Privacy Enhancing Technology | - -| | | -|------|-------------------------------------| -| PIA | Privacy Impact Assessment | -| PII | Personally Identifiable Information | -| RFID | Radio Frequency Identification | -| USB | Universal Serial Bus | - -# **4 Overview** - -## **4.1 Objective for the protection of PII** - -This Specification provides a set of controls for PII protection. The objective of the protection of PII is to enable organizations to put in place a set of controls as part of their overall PII protection programme. They can be used in a framework for maintaining and improving compliance with privacy-related laws and regulations, managing privacy risks and meeting the expectations of PII principals, regulators or clients, in accordance with the privacy principles described in ISO/IEC 29100. - -## **4.2 Requirement for the protection of PII** - -An organization should identify its PII protection requirements. The privacy principles in ISO/IEC 29100 apply to the identification of requirements. There are three main sources of PII protection requirements: - -- legal, statutory, regulatory and contractual requirements related to protection of PII including, for example, PII requirements that an organization, its trading partners, contractors and service providers have to comply with; -- assessment of risks (i.e., security risks and privacy risks) to the organization and the PII principal, taking into account the organization's overall business strategy and objectives, through a risk assessment; -- corporate policies: an organization may also choose voluntarily to go beyond the criteria that are derived from previous requirements. - -Organizations should also consider the principles (i.e., privacy principles defined in ISO/IEC 29100), objectives and business requirements for processing PII that have been developed to support their operations. - -PII protection controls (including security controls) should be selected on the basis of a risk assessment. The results of a privacy impact assessment (PIA), e.g., as specified in ISO/IEC 29134, will help to guide and determine the appropriate treatment action and priorities for managing risks to the protection of PII and for implementing controls selected to protect against these risks. - -A PIA specification such as that in ISO/IEC 29134 may provide PIA guidance, including advice on risk assessment, risk treatment plan, risk acceptance and risk review. - -## **4.3 Controls** - -A privacy risk assessment can assist organizations in identifying the specific risks of privacy breaches resulting from unlawful processing or of cutting the rights of the PII principal involved in an envisaged operation. Organizations should identify and implement controls to treat the risks identified by the risk impact process. The controls and treatments should then be documented, ideally separately in a separate risk register. Certain types of PII processing can warrant specific controls for which the need only becomes apparent once an envisaged operation has been carefully analysed. - -## **4.4 Selecting controls** - -Controls can be selected from this Specification (which includes by reference the controls from ISO/IEC 27002, creating a combined reference control set). If required, controls can also be selected from other control sets or new controls can be designed to meet specific needs, as appropriate. - -The selection of controls is dependent upon organizational decisions based on the criteria for risk treatment options and the general risk management approach, applied to the organization and, through contractual agreements, to its customers and suppliers, and should also be subject to all applicable national and international legislation and regulations. - -The selection and implementation of controls is also dependent upon the organization's role in the provision of infrastructure or services. Many different organizations may be involved in providing infrastructure or services. In some circumstances, selected controls may be unique to a particular organization. In other instances, there may be shared roles in implementing controls. Contractual agreements should clearly specify the PII protection responsibilities of all organizations involved in providing or using the services. - -The controls in this Specification can be used as reference for organizations that process PII, and are intended to be applicable for all organizations acting as PII controllers. Organizations acting as PII processors should do so, in accordance with the instructions of the PII controller. PII controllers should ensure that their PII processors are able to implement all the necessary controls included in their PII processing agreement, in accordance with the purpose of PII processing. PII controllers using cloud services as PII processors may review ISO/IEC 27018 to identify relevant controls to implement. - -The controls in this Specification are explained in more detail in clauses 5 to 18, along with implementation guidance. Implementation may be made simpler if requirements for the protection of PII have been considered in the design of the organization's information system, services and operations. Such consideration is an element of the concept that is often called privacy by design (PBD). More information about selecting controls and other risk treatment options can be found in ISO/IEC 29134. Other relevant references are listed in the bibliography. - -## **4.5 Developing organization specific guidelines** - -This Specification can be regarded as a starting point for developing organization specific guidelines. Not all of the controls and guidance in this Specification are applicable to all organizations. - -Furthermore, additional controls and guidelines not included in this Specification may be required. When documents are developed containing additional guidelines or controls, it may be useful to include cross-references to clauses in this Specification, where applicable, to facilitate compliance checking by auditors and business partners. - -## **4.6 Life cycle considerations** - -PII has a natural life cycle, from creation or origination, collection, through storage, use and transfer to its eventual disposal (e.g., secure destruction). The value of, and risks to, PII may vary during its life cycle, but protection of PII remains important to some extent at all stages and in all contexts of its life cycle. - -Information systems also have life cycles within which they are conceived, specified, designed, developed, tested, implemented, used, maintained, and eventually retired from service and disposed of. PII protection should also be taken into account at each of these stages. New system developments and changes to existing systems present opportunities for organizations to update and improve security controls as well as controls for the protection of PII, taking actual incidents, and current and projected information security and privacy risks into account. - -## **4.7 Structure of this Specification** - -The remainder of this Specification contains two main normative parts. - -The first part of this Specification, made up of clauses 5 to 18, contains additional implementation guidance and other information for certain relevant existing controls described in ISO/IEC 27002. The format for this part uses the relevant clause headings and numbering from ISO/IEC 27002 to allow cross-reference to that International Standard. - -The second part contains a specific control set for PII protection specified in Annex A. It uses the same format as ISO/IEC 27002, which specifies control objectives (text within a box) followed by one or more controls that can be applied. Control descriptions are structured as follows. - -### **Control** - -Text under this heading defines the specific control statement to fulfil the control objective. - -### **Implementation guidance for the protection of PII** - -Text under this heading provides more detailed information to support the implementation of the control and meeting the control objectives. The guidance provided in this Specification may not be entirely suitable or sufficient in all situations and may not fulfil the organization's specific control requirements. Alternative or additional controls, or other forms of risk treatment (avoiding or transferring risks), may therefore be appropriate. - -### **Other information for the protection of PII** - -Text under this heading provides further information that may need to be considered, such as legal considerations and references to other standards. - -# **5 Information security policies** - -## **5.1 Management directions for information security** - -### **5.1.1 Introduction** - -The objective specified in 5.1 of ISO/IEC 27002:2013 applies. - -### **5.1.2 Policies for information security** - -Control 5.1.1 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. The following additional guidance also applies. - -#### **Implementation guidance for the protection of PII** - -The information security policies should include appropriate statements of security measures for the protection of PII. The details about the protection of PII are available in 18.1.4 of ISO/IEC 27002:2013. - -When designing, implementing and reviewing information security policy, organizations should consider privacy safeguarding requirements described in ISO/IEC 29100. - -Organizations should specify the elements of PII protection not related to security as a separate privacy policy. See the guidance in clause A.2. - -### **5.1.3 Review of the policies for information security** - -Control 5.1.2 and the associated implementation guidance specified in ISO/IEC 27002 apply. - -# **6 Organization of information security** - -## **6.1 Internal organization** - -### **6.1.1 Introduction** - -The objective specified in 6.1 of ISO/IEC 27002 applies. - -### **6.1.2 Information security roles and responsibilities** - -Control 6.1.1 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. The following additional guidance also applies. - -#### **Implementation guidance for the protection of PII** - -Roles and responsibilities for the protection of PII need to be clearly defined, properly documented and appropriately communicated. Specifically: - -- a) a clearly identified senior individual [sometimes referred to as the chief privacy officer (CPO)] within the organization should be allocated the accountability for PII protection; -- b) a clearly identified individual or individuals (i.e., PII protection function) should be assigned responsibility for coordinating with the information security functions within the organization; and -- c) all individuals that are involved with the processing of PII (including users and support staff) should have appropriate PII protection requirements included in their job specifications. - -The established PII protection function should work closely with other functions processing PII, the information security function, which implements security requirements that include ones arising from PII protection laws, as well as the legal function, which assists in interpreting laws, regulations and contract terms, and in handling data breaches. - -The organization should examine the need for and establish, as appropriate, a cross-functional council or committee comprising senior members from functions that process PII. Protection of PII being a multi-disciplinary function, such a group can help proactively identify opportunities for improvements, identifying new risks and areas for conducting PIAs, planning preventive actions, detection and reaction measures for any breaches, etc. It is recommended that such a group should meet periodically and be chaired by the person responsible for PII protection as identified in a). - -The PII controller should require its PII processor(s) to designate a point of contact to address questions regarding the processing of PII under the PII processing contract. - -Individuals responsible for PII protection functions should report to a CPO in order to ensure they have sufficient authority to fulfil their responsibilities. - -### 6.1.3 Segregation of duties - -Control 6.1.2 and the associated implementation guidance specified in ISO/IEC 27002 apply. The following additional guidance also applies. - -#### Implementation guidance for the protection of PII - -Duties and area of responsibilities for PII protection should be independent of those for information security. While recognizing the importance of information security for the protection of PII, it is important that duties and area of responsibilities of the security and PII protection be as independent of each other as possible. If necessary or helpful, in the interest of PII protection, coordination and cooperation of those responsible for information security and for PII protection should be facilitated. - -Organizations should adopt the principle of segregation of duties when assigning access rights for PII processing, especially any processing identified as high risk. - -Access to PII being processed and access to log files concerning that processing should be separate duties. - -Access to information concerning the collection of PII in order to respond to requests from PII principals should be segregated from all other forms of access to PII. Access should be limited to those whose duties include responding to PII principal requests. - -### 6.1.4 Contact with authorities - -Control 6.1.3 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. The following additional guidance also applies. - -#### Implementation guidance for the protection of PII - -Where applicable, organizations should have procedures in place that specify when and by whom authorities (including data protection authorities) should be contacted, e.g., to report privacy breaches or to report processing details. - -### 6.1.5 Contact with special interest groups - -Control 6.1.4 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### 6.1.6 Information security in project management - -Control 6.1.5 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. The following additional guidance also applies. - -#### Implementation guidance for the protection of PII - -Any new project initiation should trigger at least a threshold analysis to determine whether a PIA needs to be conducted. Note that the term project covers all incidents where an organization implements or modifies new or existing technology, product, service, programme, information system, process or project. - -Further guidance can be found in the PIA specified in ISO/IEC 29134. - -## 6.2 Mobile devices and teleworking - -### 6.2.1 Introduction - -The objective specified in 6.2 of ISO/IEC 27002:2013 applies. - -### 6.2.2 Mobile device policy - -Control 6.2.1 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. The following additional guidance also applies. - -#### Implementation guidance for the protection of PII - -Organizations should strictly limit access to PII from portable and mobile devices, such as laptops, mobile phones, universal serial bus (USB) devices, and personal digital assistants (PDAs) that may generally be exposed to higher risk than non-portable devices (e.g., desktop computers at the organization's facilities), depending on the risk assessment. - -Organizations should strictly limit remote access to PII and in cases where remote access is unavoidable, ensure that the communications for remote access are encrypted, message authenticated and integrity protected. - -### **6.2.3 Teleworking** - -Control 6.2.2 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -# **7 Human resource security** - -## **7.1 Prior to employment** - -### **7.1.1 Introduction** - -The objective specified in 7.1 of ISO/IEC 27002:2013 applies. - -### **7.1.2 Screening** - -Control 7.1.1 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **7.1.3 Terms and conditions of employment** - -Control 7.1.2 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -## **7.2 During employment** - -### **7.2.1 Introduction** - -The objective specified in 7.2 of ISO/IEC 27002:2013 applies. - -### **7.2.2 Management responsibilities** - -Control 7.2.1 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **7.2.3 Information security awareness, education and training** - -Control 7.2.2 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. The following additional guidance also applies. - -#### **Implementation guidance for the protection of PII** - -Measures should be put in place to make relevant staff aware of the possible consequences for the PII controller (e.g., legal consequences, loss of business, or brand or reputational damage), for the staff member (e.g., disciplinary consequences) and for the PII principal (e.g., physical, material and emotional consequences) of breaching privacy or security rules and procedures, especially those addressing the processing of PII. - -Just as with information security awareness, education and training, organizations should provide for the appropriate training, education and awareness regarding the protection and the processing of PII. - -### **7.2.4 Disciplinary process** - -Control 7.2.3 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. The following additional guidance also applies. - -#### **Implementation guidance for the protection of PII** - -Organizations should establish a formal disciplinary policy. This policy in case of privacy breaches should be clearly communicated to affected individuals. Organizations should enforce this policy in all cases of privacy breaches. - -## **7.3 Termination and change of employment** - -### **7.3.1 Introduction** - -The objective specified in 7.3 of ISO/IEC 27002:2013 applies. - -### **7.3.2 Termination or change of employment responsibilities** - -Control 7.3.1 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -# 8 Asset management - -## 8.1 Responsibility for assets - -### 8.1.1 Introduction - -The objective specified in 8.1 of ISO/IEC 27002:2013 applies. - -### 8.1.2 Inventory of assets - -Control 8.1.1 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. The following additional guidance also applies. - -#### Implementation guidance for the protection of PII - -Organizations should establish, maintain, and update an inventory of assets using, for example, the information given from the PIA report, if any, as specified in ISO/IEC 29134. This should include the PII assets and all systems that process PII. - -When developing and maintaining the inventory, organizations should extract the following information elements from PIAs concerning information systems processing PII. The following list is given as an example – there might be additions or subtractions to the final implemented lists: - -- a) name of and acronym for each identified system; -- b) types of PII processed by those systems; -- c) classification (see 8.2.2) of all types of PII, both as individual information elements and as combined in those information systems; -- d) level of potential impact, to the PII principal and the organization, of any breach of PII; -- e) purpose(s) for collecting the PII; -- f) whether PII processing will be outsourced to a PII processor; -- g) whether PII is transmitted to other PII controllers, and if so, to whom (or to which group of recipients); -- h) retention period of PII; -- i) geographical area where the PII was collected or processed; and -- j) whether trans-border data transfer is involved. - -Organizations should provide regular updates of the PII inventory to the person accountable for protection of PII to support the establishment of appropriate security controls for all new or updated information systems processing PII. - -### 8.1.3 Ownership of assets - -Control 8.1.2 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### 8.1.4 Acceptable use of assets - -Control 8.1.3 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. The following additional guidance also applies. - -#### Implementation guidance for the protection of PII - -Organizations should protect assets supporting PII against unauthorized access, unauthorized modification, unauthorized removal, loss or destruction, or wrong and unlawful processing and so on. - -### 8.1.5 Return of assets - -Control 8.1.4 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -## 8.2 Information classification - -### 8.2.1 Introduction - -The objective specified in 8.2 of ISO/IEC 27002:2013 applies. - -### **8.2.2 Classification of information** - -Control 8.2.1 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. The following additional guidance also applies. - -#### **Implementation guidance for the protection of PII** - -Organizations should classify all information containing PII, using an existing classification category (called an information group in ISO/IEC 27002) or newly created classification categories. New classification categories should include, but are not limited to, general ones such as sensitive and non-sensitive PII. A classification scheme may also include more specific categories such as personal health information (PHI), personal financial information (PFI). If organizations create new classification categories, then levels of protection for those should also be defined. The actual categories used should also depend upon, for example, the requirements defined in relevant data protection legislation and regulations, other legal (e.g., contractual) obligations, the nature and sensitivity of the information, and the risk of harm that might arise in the event of a breach. - -Some PII that may be classified non-sensitive in one country may be treated as sensitive elsewhere, depending on the applicable data protection laws. - -The classification for an element of PII could need re-evaluation and modification when associated with one or more additional attributes. Appropriate guidelines and procedures should be put in place. - -### **8.2.3 Labelling of Information** - -Control 8.2.2 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. The following additional guidance also applies. - -#### **Implementation guidance for the protection of PII** - -Where an organization does not classify PII to a classification category, the organization should ensure that people under its control are made aware of the definition of PII and how to recognize whether information is PII. - -### **8.2.4 Handling of assets** - -Control 8.2.3 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. The following additional guidance also applies. - -#### **Implementation guidance for the protection of PII** - -If organizations allow people under their control to be able to omit the information labelling for the classification category related to PII, organizations should make people under their control handle all information containing PII as the information of the assigned classification category. - -## **8.3 Media handling** - -### **8.3.1 Introduction** - -The objective specified in 8.3 of ISO/IEC 27002:2013 applies. - -### **8.3.2 Management of removable media** - -Control 8.3.1 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. The following additional guidance also applies. - -#### **Implementation guidance for the protection of PII** - -Some jurisdictions may require removable media containing PII to be encrypted. Whether or not it is required by law, encryption is recommended to reduce the risk of PII leakage. - -If data confidentiality or integrity are important considerations, cryptographic techniques should be used to protect PII on removable media. A risk assessment should be performed to identify the required level of protection, which in turn will help determine the necessary type, strength and quality of cryptographic algorithm to be used. - -Additional guidance regarding the use of cryptographic controls is provided in 10.1. - -### **8.3.3 Disposal of media** - -Control 8.3.2 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. The following additional guidance also applies. - -#### **Implementation guidance for the protection of PII** - -The procedures for secure disposal of media containing PII should be proportional to the sensitivity of the information, as well as the level of impact from inappropriate processing of that information. Some jurisdictions may impose criteria on procedures used to dispose of media containing PII or specific types of PII (e.g., health data, financial data). - -### **8.3.4 Physical media transfer** - -Control 8.3.3 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. The following additional guidance also applies. - -#### **Implementation guidance for the protection of PII** - -Whenever physical media are used for information transfer, a measure should be put in place to record incoming and outgoing physical media containing PII, including the type of physical media, any identifying numbers (e.g., serial numbers or inventory tag numbers), the authorized sender/recipients, the date and time, the number of physical media, and the types of PII they contain and to detect loss of physical media. The purpose and extent of the transfer, the person responsible for its authorization and the legal/contractual basis for the transfer should also be documented. Explicit reference to the data minimization principle should additionally be considered. - -# **9 Access control** - -## **9.1 Business requirement of access control** - -### **9.1.1 Introduction** - -The objective specified in 9.1 of ISO/IEC 27002:2013 applies. - -### **9.1.2 Access control policy** - -Control 9.1.1 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **9.1.3 Access to networks and network services** - -Control 9.1.2 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -## **9.2 User access management** - -### **9.2.1 Introduction** - -The objective specified in 9.2 of ISO/IEC 27002:2013 applies. - -### **9.2.2 User registration and de-registration** - -Control 9.2.1 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. The following additional guidance also applies. - -#### **Implementation guidance for the protection of PII** - -Procedures for user registration and de-registration as well as user life cycle management should provide measures to address a compromise of user access control, such as the corruption or compromise of passwords or other user registration data (e.g., as a result of inadvertent disclosure). - -### **9.2.3 User access provisioning** - -Control 9.2.2 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. The following additional guidance also applies. - -#### **Implementation guidance for the protection of PII** - -Organizations should provide users with an appropriate right of access to the information systems processing PII, in accordance with the data minimization principle described in ISO/IEC 29100. - -Organizations should restrict access to information systems processing PII to the minimum number of individuals needed to carry out the specified purposes for that processing, in accordance with the data minimization principle described in ISO/IEC 29100. - -Organizations should adopt strong authentication methods for particular PII and PII processing (i.e., health data). - -### **9.2.4 Management of privileged access rights** - -Control 9.2.3 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. The following additional guidance also applies. - -#### **Implementation guidance for the protection of PII** - -Large scale processing of PII (e.g., batch queries, batch modification, batch export, batch deletion) increases the risk of a large scale breach. Organizations should take special care when assigning access rights for such privileged operations. In order to prevent the abuse of PII, privileged access rights for PII processing (especially high risk PII processing) should be assigned on a strictly limited basis. They should also be assigned in a way that helps reduce the risk of collusion between two or more individuals. The granting and use of such rights should be recorded in relevant log files. All access approvals should be for a specified period. Organizations should review all such approvals on a regular basis and as appropriate, renew, revoke or expire approvals as appropriate. - -### **9.2.5 Management of secret authentication information of users** - -Control 9.2.4 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **9.2.6 Review of user access rights** - -Control 9.2.5 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **9.2.7 Removal or adjustment of access rights** - -Control 9.2.6 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -## **9.3 User responsibilities** - -### **9.3.1 Introduction** - -The objective specified in 9.3 of ISO/IEC 27002:2013 applies. - -### **9.3.2 Use of secret authentication information** - -Control 9.3.1 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -## **9.4 System and application access control** - -### **9.4.1 Introduction** - -The objective specified in 9.4 of ISO/IEC 27002:2013 applies. - -### **9.4.2 Information access restriction** - -Control 9.4.1 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. The following additional guidance also applies. - -#### **Implementation guidance for the protection of PII** - -Before allowing individuals such as operators and administrators to use query languages that enable automated massive retrieval of PII from databases that contain PII, organizations should review the necessity to use such languages when processing PII. - -Where the use of query languages is consistent with the protection requirement, organizations should provide technical measures to limit the use of such languages to the minimum necessary to fulfil the specified purpose(s). - -This can, for example, mean that access restrictions limit the use of query language to a few predefined sensitive fields of the records. - -Where individuals require access to areas for which they normally are not authorized (e.g., the operational area), robust approval mechanisms should be implemented. Organizations should maintain a record of all such approvals. - -### **9.4.3 Secure log-on procedures** - -Control 9.4.2 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. The following additional guidance also applies. - -#### **Implementation guidance for the protection of PII** - -Where PII principals can request accounts from a PII controller, the PII controller should provide secure log-on procedures for those accounts, depending on the results of a risk analysis. - -### **9.4.4 Password management system** - -Control 9.4.3 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **9.4.5 Use of privileged utility programs** - -Control 9.4.4 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **9.4.6 Access control to program source code** - -Control 9.4.5 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -# **10 Cryptography** - -## **10.1 Cryptographic controls** - -### **10.1.1 Introduction** - -The objective specified in 10.1 of ISO/IEC 27002:2013 applies. - -### **10.1.2 Policy on the use of cryptographic controls** - -Control 10.1.1 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **10.1.3 Key management** - -Control 10.1.2 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -# **11 Physical and environmental security** - -## **11.1 Secure areas** - -### **11.1.1 Introduction** - -The objective specified in 11.1 of ISO/IEC 27002:2013 applies. - -### **11.1.2 Physical security perimeter** - -Control 11.1.1 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **11.1.3 Physical entry controls** - -Control 11.1.2 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **11.1.4 Securing offices, rooms and facilities** - -Control 11.1.3 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **11.1.5 Protecting against external and environmental threats** - -Control 11.1.4 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **11.1.6 Working in secure areas** - -Control 11.1.5 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **11.1.7 Delivery and loading areas** - -Control 11.1.6 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -## **11.2 Equipment** - -### **11.2.1 Introduction** - -The objective specified in 11.2 of ISO/IEC 27002:2013 applies. - -### **11.2.2 Equipment siting and protection** - -Control 11.2.1 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **11.2.3 Supporting utilities** - -Control 11.2.2 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **11.2.4 Cabling security** - -Control 11.2.3 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **11.2.5 Equipment maintenance** - -Control 11.2.4 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **11.2.6 Removal of assets** - -Control 11.2.5 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **11.2.7 Security of equipment and assets off-premises** - -Control 11.2.6 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **11.2.8 Secure disposal or re-use of equipment** - -Control 11.2.7 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. The following additional guidance also applies. - -#### **Implementation guidance for the protection of PII** - -For the purposes of secure disposal or re-use, equipment containing storage media that may possibly contain PII should be physically destroyed or the PII should either be destroyed, deleted or overwritten using approved techniques, in accordance with well-defined and documented procedures, to render the original PII unrecoverable rather than simply using the standard delete or format function. For equipment containing storage media that may possibly contain encrypted PII, the controlled destruction of decryption keys or key holders (such as smart cards), may be sufficient. - -### **11.2.9 Unattended user equipment** - -Control 11.2.8 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **11.2.10 Clear desk and clear screen policy** - -Control 11.2.9 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -# **12 Operations security** - -## **12.1 Operational procedures and responsibilities** - -### **12.1.1 Introduction** - -The objective specified in 12.1 of ISO/IEC 27002:2013 applies. - -### **12.1.2 Documented operating procedures** - -Control 12.1.1 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **12.1.3 Change management** - -Control 12.1.2 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **12.1.4 Capacity management** - -Control 12.1.3 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### 12.1.5 Separation of development, testing and operational environments - -Control 12.1.4 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. The following additional guidance also applies. - -#### Implementation guidance for the protection of PII - -Development, testing and operational environments should be logically and, where possible, physically separate environments. Appropriate access controls should be implemented to ensure access is limited to properly authorized individuals. If test or development networks or devices require access to the operational network, strong access controls should be implemented. - -Organization should assess the risk of using removable media and devices containing PII with wireless capabilities, regardless of the environment in which they will be used. - -Where not permitted by law or by explicit consent of the PII principal, PII should not be used for purposes of development and testing without prior anonymization. - -## 12.2 Protection from malware - -### 12.2.1 Introduction - -The objective specified in 12.2 of ISO/IEC 27002:2013 applies. - -### 12.2.2 Controls against malware - -Control 12.2.1 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -## 12.3 Backup - -### 12.3.1 Introduction - -The objective specified in 12.3 of ISO/IEC 27002:2013 applies. - -### 12.3.2 Information backup - -Control 12.3.1 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. The following additional guidance also applies. - -#### Implementation guidance for the protection of PII - -Information systems processing PII should introduce additional or alternative mechanisms, such as off-site backups for protection against loss of PII, ensuring continuity of PII processing operations, and providing the ability to restore PII processing operations after a disruptive event, if only strictly necessary. - -NOTE – Some time passes between backup and recovery operations. PII stored in a backup may no longer be up to date when it is accessed in order to be restored. Any operations based on out-of-date PII may lead to incorrect results and pose a privacy risk. - -## 12.4 Logging and monitoring - -### 12.4.1 Introduction - -The objective specified in 12.4 of ISO/IEC 27002:2013 applies. - -### 12.4.2 Event logging - -Control 12.4.1 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. The following additional guidance also applies. - -#### Implementation guidance for the protection of PII - -Where possible, the event log should record which PII was accessed, what was done to the PII (e.g., read, print, add, modify, delete), when and by whom, especially for certain types of PII (e.g., health data). Where multiple service providers are involved in providing a service, there may be varied or shared roles in implementing this guidance. - -A process should be put in place to review the event log with a specified, documented periodicity to identify irregularities and propose remediation efforts. - -The PII controller should define procedures regarding whether, when and how log information can be made available to or usable by the administrator for purposes such as security monitoring and operational diagnostics. - -### **12.4.3 Protection of log information** - -Control 12.4.2 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. The following additional guidance also applies. - -#### **Implementation guidance for the protection of PII** - -Log information recorded for purposes such as security monitoring and operational diagnostics may contain PII. Measures, such as access control (see 9.2.3), should be put in place to ensure that logged information is only used for its intended purposes. Measures should be put in place to ensure log file integrity. - -### **12.4.4 Administrator and operator logs** - -Control 12.4.3 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. The following additional guidance also applies. - -#### **Implementation guidance for the protection of PII** - -Organizations should monitor privileged access (e.g., by system administrators and operators) to PII and any subsequent processing by those individuals. Such monitoring should form part of the overall monitoring of information systems processing PII. - -Organizations should define what they consider to be anomalous activity and should implement automated procedures to report such activity to relevant individuals within the organization. - -### **12.4.5 Clock synchronization** - -Control 12.4.4 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -## **12.5 Control of operational software** - -### **12.5.1 Introduction** - -The objective specified in 12.5 of ISO/IEC 27002:2013 applies. - -### **12.5.2 Installation of software on operational systems** - -Control 12.5.1 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -## **12.6 Technical vulnerability management** - -### **12.6.1 Introduction** - -The objective specified in 12.6 of ISO/IEC 27002:2013 applies. - -### **12.6.2 Management of technical vulnerabilities** - -Control 12.6.1 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **12.6.3 Restrictions on software installation** - -Control 12.6.2 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -## **12.7 Information systems audit considerations** - -### **12.7.1 Introduction** - -The objective specified in 12.7 of ISO/IEC 27002:2013 applies. - -### **12.7.2 Information systems audit controls** - -Control 12.7.1 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -# **13 Communications security** - -## **13.1 Network security management** - -### **13.1.1 Introduction** - -The objective specified in 13.1 of ISO/IEC 27002:2013 applies. - -### **13.1.2 Network controls** - -Control 13.1.1 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **13.1.3 Security of network services** - -Control 13.1.2 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **13.1.4 Segregation in networks** - -Control 13.1.3 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -## **13.2 Information transfer** - -### **13.2.1 Introduction** - -The objective specified in 13.2 of ISO/IEC 27002:2013 applies. - -### **13.2.2 Information transfer policies and procedures** - -Control 13.2.1 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. The following additional guidance also applies. - -#### **Implementation guidance for the protection of PII** - -Appropriate measures should be put in place to reduce the risk of PII leakage during information transfer. This is generally solved by implementing encryption and other preliminary measures could include de-identification, masking or obfuscation. - -### **13.2.3 Agreements on information transfer** - -Control 13.2.2 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **13.2.4 Electronic messaging** - -Control 13.2.3 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **13.2.5 Confidentiality or non-disclosure agreements** - -Control 13.2.4 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. The following additional guidance also applies. - -#### **Implementation guidance for the protection of PII** - -Organizations should specify the conditions under which external processing of PII may take place. These conditions should be part of an appropriate agreement (e.g., contract, confidentiality or non-disclosure agreement). - -# **14 System acquisition, development and maintenance** - -## **14.1 Security requirements of information systems** - -### **14.1.1 Introduction** - -The objective specified in 14.1 of ISO/IEC 27002:2013 applies. - -### **14.1.2 Information security requirements analysis and specification** - -Control 14.1.1 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. The following additional guidance also applies. - -#### **Implementation guidance for the protection of PII** - -When developing or making significant changes to information systems that process PII, a PIA should be conducted. Guidance on the conduct of PIAs can be found in ISO/IEC 29134. The results of the PIA should be used to determine the controls to treat the risks identified during the PIA process. - -### **14.1.3 Securing application services on public networks** - -Control 14.1.2 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **14.1.4 Protecting application services transactions** - -Control 14.1.3 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -## **14.2 Security in development and support processes** - -### **14.2.1 Introduction** - -The objective specified in 14.2 of ISO/IEC 27002:2013 applies. - -### **14.2.2 Secure development policy** - -Control 14.2.1 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **14.2.3 System change control procedures** - -Control 14.2.2 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **14.2.4 Technical review of applications after operating platform changes** - -Control 14.2.3 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **14.2.5 Restrictions on changes to software packages** - -Control 14.2.4 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **14.2.6 Secure system engineering principles** - -Control 14.2.5 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **14.2.7 Secure development environment** - -Control 14.2.6 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **14.2.8 Outsourced development** - -Control 14.2.7 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **14.2.9 System security testing** - -Control 14.2.8 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **14.2.10 System acceptance testing** - -Control 14.2.9 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. The following additional guidance also applies. - -#### **Implementation guidance for the protection of PII** - -System acceptance testing should also include testing of privacy safeguarding requirements. - -## **14.3 Test data** - -### **14.3.1 Introduction** - -The objective specified in 14.3 of ISO/IEC 27002:2013 applies. - -### **14.3.2 Protection of test data** - -Control 14.3.1 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. The following additional guidance also applies. - -#### **Implementation guidance for the protection of PII** - -Operational data containing PII should not normally be used for development and testing. The use of real PII in these environments increases the risk of information compromise. Instead, organizations should either use synthetic data or should take steps to "hide" (e.g., mask, obfuscate, de-identify) any real PII in use. - -# **15 Supplier relationships** - -## **15.1 Information security in supplier relationships** - -### **15.1.1 Introduction** - -The objective specified in 15.1 of ISO/IEC 27002:2013 applies. - -### **15.1.2 Information security policy for supplier relationships** - -Control 15.1.1 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. The following additional guidance also applies. - -#### **Implementation guidance for the protection of PII** - -In the event that an organization needs to make use of the services of a PII processor, PII processors should be evaluated on the basis of experience, trustworthiness and their ability to meet PII protection requirements as stipulated by applicable legislation, regulation, or in contracts or other legal agreements. - -The organization acting as a PII controller should have a written contract with any supplier acting as a PII processor. The contract should clearly allocate roles and responsibilities between the PII controller and the PII processor and should contain appropriate clauses relating to PII protection in order to hold the PII processor accountable for the processing performed. - -The PII controller contract should provide at least: - -- an appropriate declaration on the scale, nature and purpose of the processing under contract; -- support duties of the PII processor on giving PII principals the ability to access and review their PII and handling any complaints raised by PII principals (see clause A.10); -- other organizational measures to be taken in order to fulfil legal or regulatory requirements; -- authorization of the PII controller to conduct audits on the premises of the PII processor; -- reporting obligations in cases of data breaches, unauthorized processing or other non-performance of contractual terms and condition, including identification of the points of contact in both parties; -- method of instruction from the PII controller to the PII processor; -- measures applying on termination of the contract, especially with regard to the secure deletion of PII on premise or returning of PII and physical media. - -The PII controller should ensure that their PII processors do not undertake any further subcontracting of processing (i.e., make use of sub-processors) without prior approval of the PII controller. The PII controller should abide by all relevant legislation and regulations in this regard. - -The PII controller should ensure that their PII processors do not process the PII for any purposes other than those specified in the contract or other legal agreement. - -The PII controller should ensure that their PII processors securely dispose of PII, in accordance with the PII controller's policies or other direction (e.g., specific agency requirements). - -### **15.1.3 Addressing security within supplier agreements** - -Control 15.1.2 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **15.1.4 Information and communication technology supply chain** - -Control 15.1.3 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -## **15.2 Supplier service delivery management** - -### **15.2.1 Introduction** - -The objective specified in 15.2 of ISO/IEC 27002:2013 applies. - -### **15.2.2 Monitoring and review of supplier services** - -Control 15.2.1 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **15.2.3 Managing changes to supplier services** - -Control 15.2.2 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -# **16 Information security incident management** - -## **16.1 Management of information security incidents and improvements** - -### **16.1.1 Introduction** - -The objective specified in 16.1 of ISO/IEC 27002:2013 applies. - -### **16.1.2 Responsibilities and procedures** - -Control 16.1.1 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. The following additional guidance also applies. - -#### **Implementation guidance for the protection of PII** - -Organizations should be capable of providing (and be prepared to provide) an organized and effective response to a privacy incident. Organizations should therefore develop and implement a privacy incident response plan. - -An organizational privacy incident response plan should include: - -- a) the definition of privacy incident and the scope of privacy incident response; -- b) the establishment of a cross-functional privacy incident response team that develops, implements, tests, executes and reviews the privacy incident response plan (approval of the plan should rest with senior management within the organization); -- c) clearly defined roles, responsibilities and authorities for all members of the privacy incident response team; -- d) procedures for clarifying the legal grounds for cooperation with external organizations (national and international) in the event of a cross-border incident; -- e) procedures to ensure prompt reporting by all individuals subject to the internal privacy policy (e.g., employees, contractors) of any privacy incident to information security officials and the individual accountable for PII protection (sometimes referred to as the CPO), in accordance with organizational incident management direction; -- f) an incident impact assessment (tasks) to determine the nature and extent of any potential or actual harms to affected individuals (e.g., embarrassment, inconvenience or unfairness) or to the organization; -- g) a process to identify measures that need to be taken to mitigate the harms identified above and to reduce the likelihood of their recurrence; and -- h) procedures to determine whether notice to affected individuals and other designated entities (e.g., regulators) is required, the timing for such notice and the form of that notice and, where appropriate, to provide that notice. - -Organizations may choose to integrate their privacy incident response plans with their security incident response plans or keep them separate. An information security incident should trigger a review by the PII controller, as part of its information security incident management process, to determine if a data breach involving PII has taken place. - -An information security event may not trigger such a review. An information security event may include, without limitation, pings and other broadcast attacks on firewalls or edge servers, port scans, unsuccessful log-on attempts, denial of service attacks and packet sniffing. An information security event will not necessarily result in probable or actual compromise of PII or equipment or facilities processing PII. - -### **16.1.3 Reporting information security events** - -Control 16.1.2 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. The following additional guidance also applies. - -#### **Implementation guidance for the protection of PII** - -When PII is compromised, the rights and interests of the PII principal cannot be protected without immediate measures. - -Jurisdictions may impose specific requirements (e.g., in legislation or regulations) related to the reporting or notification of security incidents involving PII (e.g., unauthorized processing, breach). When a security incident related to PII occurs, the details of the incident, including the organizations' proposed response (the disclosure of which may be subject to certain limitations), should be notified as soon as possible to relevant authorities. These may include data protection authorities, law enforcement agencies and individuals affected by the incident. - -Organizations should provide affected PII principals access to appropriate and effective remedies, such as correction or deletion of incorrect information, if a privacy breach has occurred. - -### **16.1.4 Reporting security weaknesses** - -Control 16.1.3 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **16.1.5 Assessment of and decision on information security events** - -Control 16.1.4 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **16.1.6 Response to information security incidents** - -Control 16.1.5 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **16.1.7 Learning from information security incidents** - -Control 16.1.6 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **16.1.8 Collection of evidence** - -Control 16.1.7 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -# **17 Information security aspects of business continuity management** - -## **17.1 Information security continuity** - -### **17.1.1 Introduction** - -The objective specified in 17.1 of ISO/IEC 27002:2013 applies. - -### **17.1.2 Planning information security continuity** - -Control 17.1.1 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **17.1.3 Implementing information security continuity** - -Control 17.1.2 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **17.1.4 Verify, review and evaluate information security continuity** - -Control 17.1.3 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -## **17.2 Redundancies** - -### **17.2.1 Introduction** - -The objective specified in 17.2 of ISO/IEC 27002:2013 applies. - -### **17.2.2 Availability of information processing facilities** - -Control 17.2.1 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -# **18 Compliance** - -## **18.1 Compliance with legal and contractual requirements** - -### **18.1.1 Introduction** - -The objective specified in 18.1 of ISO/IEC 27002:2013 applies. - -### **18.1.2 Identification of applicable legislation and contractual requirements** - -Control 18.1.1 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. The following additional guidance also applies. - -#### **Implementation guidance for the protection of PII** - -Organizations should identify the laws and regulations related to PII protection to which they are subject. If these are identified, then organizations should take necessary measures for those requirements. The following cases are examples of such requirements. - -- a) Where additional protection for certain categories of PII (e.g., national identifier, passport number or credit card numbers) is required, cryptographic techniques such as encryption should be used. The type, strength and quality of the cryptographic algorithm required should be taken. Cryptographic algorithms should only be selected from lists of approved algorithms. - -The security control related to this requirement is specified in 10.1.2. - -- b) Jurisdictions can impose a minimum frequency of data backup for information including PII as well as a minimum frequency of reviews of backup and recovery procedures. - -The security control related to this requirement is specified in 12.3.2. - -Organizations should develop PIAs and implement the resulting privacy treatment plans in order to help ensure that programmes and services related to PII processing comply with privacy safeguarding requirements. Further guidance can be found in ISO/IEC 29134. - -Organizations should establish an audit programme to help verify that PII processing complies with relevant privacy safeguarding requirements. The programme should specify the frequency with which audits are to be conducted. - -Audits may be conducted by the organization (e.g., through an internal audit component) or they may be conducted by a qualified independent third party. - -#### **Other information for the protection of PII** - -While in many jurisdictions it will be the PII controller who is ultimately responsible for ensuring compliance, all actors involved in the processing of PII should take a proactive approach in identifying relevant privacy safeguarding requirements arising from legal or other factors. - -A mechanism to ensure the PII processor supports and manages compliance is provided by the contract between the PII controller and the PII processor. The contract should call for independently audited compliance, acceptable to the PII processor, e.g., via the implementation of the relevant controls in this Specification, ISO/IEC 27002, and ISO/IEC 27018. - -### **18.1.3 Intellectual property rights** - -Control 18.1.2 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **18.1.4 Protection of records** - -Control 18.1.3 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **18.1.5 Privacy and protection of personally identifiable information** - -Control 18.1.4 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **18.1.6 Regulation of cryptographic controls** - -Control 18.1.5 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -## **18.2 Information security reviews** - -### **18.2.1 Introduction** - -The objective specified in 18.2 of ISO/IEC 27002:2013 applies. - -### **18.2.2 Independent review of information security** - -Control 18.2.1 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. The following additional guidance also applies. - -#### **Implementation guidance for the protection of PII** - -If audits by individual interested parties are impractical or may increase risks to security, organizations should make available to prospective interested parties, prior to entering into a contract, independent evidence that information security is implemented and operated in accordance with the PII controller's policies and procedures. A relevant independent audit selected by the PII controller should normally be an acceptable method for fulfilling the interested parties' interest in reviewing the PII controller's processing operations, as long as sufficient transparency is provided. - -### **18.2.3 Compliance with security policies and standards** - -Control 18.2.2 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -### **18.2.4 Technical compliance review** - -Control 18.2.3 and the associated implementation guidance and other information specified in ISO/IEC 27002 apply. - -# Annex A - -## Extended control set for PII protection - -(This annex forms an integral part of this Recommendation | International Standard.) - -## A.1 General - -This annex provides definitions for new objectives, new controls and new implementation guidance making up an extended control set to meet the specific requirements for the protection of PII. - -The guidance in this Specification builds on that provided in ISO 29100:2011 and assumes that the guidance in ISO 29100:2011 has been implemented. - -Clause A.2 describes general policies for the protection of PII while the subsequent clauses reflect the privacy principles described in ISO/IEC 29100. - -## A.2 General policies for the use and protection of PII - -Objective: To provide management direction and support for PII protection in accordance with business requirements and relevant laws and regulations. - -#### Control - -Organizations involved in the processing of PII should establish a policy for the use and protection of PII. - -### Implementation guidance for the protection of PII - -The privacy policy should include appropriate statements (in separate privacy policies or as additions to existing policies) concerning support for and commitment to managing compliance with applicable PII protection legislation, contractual requirements and other internal policies. - -Privacy and security policies may not cover the same topics, although they are closely related. Both information security policies and privacy policies should address the confidentiality, integrity and availability of information, and in addition privacy policies should address topics such as consent and individual access. - -ISO/IEC 29100 provides guidance on implementing a privacy framework. The PII protection policy should: - -- be appropriate to the purpose(s) of the organization; -- be transparent about the organization's collection and processing of PII; -- provide the framework for setting objectives for the protection of PII; -- define rules for making decisions in questions of protection of PII; -- define criteria on privacy risk acceptance (see also 6.3.1 of ISO/IEC 29134); -- include a commitment to satisfy applicable privacy safeguarding requirements; -- include a commitment to continual improvement; -- be communicated within the organization; and -- be available to interested parties, as appropriate. - -## A.3 Consent and choice - -### A.3.1 Consent - -Objective: To make PII principals active participants in the decision-making process regarding the processing of their PII, except as otherwise limited by legislation and regulations, through the exercise of meaningful, informed and freely given consent. - -#### Control - -Organizations should provide the means necessary for PII principals to exercise meaningful, informed, unambiguous and freely given consent except where the PII principal cannot freely refuse consent or where applicable law specifically allows the processing of PII without the principal's consent. - -#### Implementation guidance for the protection of PII - -Organizations should: - -- a) determine the practical means to be implemented to obtain the consent of the PII principals and analyse the cases where the practical means chosen are no longer operational and determine alternate solutions if necessary, in order to ensure that consent is obtained before any processing begins; -- b) provide means, where feasible and appropriate or where legally required, for PII principals to provide consent, in order to ensure that consent is obtained before any processing begins – the processing includes collection, storage, alteration, retrieval, consultation, disclosure, de-identification, anonymization, dissemination or otherwise making available, deletion or destruction of PII; -- c) where consent is being provided by a legal agent (e.g., on behalf of child or legally incapacitated persons), store the record of consent; -- d) where necessary, inform PII principals of all instances of PII transfer to third parties and provide appropriate means for PII principals to provide their consent to such transfers; -- e) obtain consent, where feasible and appropriate or where legally required, from PII principals prior to any new uses or disclosure of previously collected PII, and ensure that consent is obtained before any further processing begins; -- f) ensure that the consent is obtained in an informed, transparent manner in terms of the purposes of the processing and ensure that consent is obtained for a specific purpose; -- g) achieve awareness and consent, e.g., through updated public notices; -- h) provide a mechanism for PII principals to modify the scope of their consent – any modification of consent should be acted upon in a timely manner and processing should be modified or cease, in accordance with the revised consent; -- i) ensure that consent adheres to all applicable legal requirements, including where appropriate the requirement for explicit consent for sensitive PII; -- j) where appropriate, allow for implied consent, where PII principals have been made clearly aware of the processing and have not objected, as this behaviour may indicate agreement; -- k) give prior notification for all processing operations prior to their implementation; and -- l) confirm, where needed, the identity of the PII principal or that of a PII principal's authorized agent, submitting consent to processing – the information requested for verification should be kept to the minimum essential for that purpose, should only be retained for as long as necessary for that purpose and should be securely disposed of when no longer required. - -#### Other information for the protection of PII - -Subject to applicable law, organizations should obtain consent through opt-in or implied consent. Opt-in consent is the preferred method, but it is not always feasible. Opt-in requires that PII principals take affirmative action to allow organizations to collect or use PII. If the consent is collected using electronic media, the organization should determine whether simple opt-in is appropriate or double opt-in is needed. - -With opt-out mechanisms, organizations can assume that the PII principal has implicitly consented to the processing of their PII, unless the PII principal takes affirmative action to signal otherwise. - -Implied consent is usually inferred by an individual's actions or lack thereof, or their particular circumstances. Example of implied consent: the customer provides the shipping address to the online retailer, and the retailer uses the information strictly for the purpose of delivery of the goods the customer purchased. - -Organizations should provide practical means to be implemented to obtain the separate consent of the PII principals when national identification numbers (e.g., social security number, resident registration number, passport number) are collected. - -Organizations may provide, for example, PII principals' itemized choices as to whether they wish to be contacted for any of a variety of purposes. In this situation, organizations construct consent mechanisms to ensure that the organizational operations comply with the PII principal's choices as far as possible. - -Consent may be electronic or in hard copy depending on applicable regulatory requirements and practical considerations. - -If the PII was transferred to or from another organization, organizations should establish a process to update their records to mirror content updates and consent changes (e.g., modification, revocation) made by PII principals and to ensure that these updates/changes are passed on to the organizations with whom the PII was shared. Only the minimum amount of information necessary to ensure that the correct records are updated should be collected from the PII principal and shared with other organizations. Organizations should periodically review their processes to ensure that no unnecessary PII is being processed. - -### A.3.2 Choice - -Objective: To present to PII principals, where appropriate and feasible, the choice not to allow the processing of their PII, to refuse or withdraw consent or to oppose a specific type of processing, and to explain to PII principals the implications of granting or refusing consent. - -#### Control - -Organizations should provide PII principals with clear, prominent, easily understandable, accessible and affordable mechanisms to exercise choice with respect to the processing of their PII except where the PII principal cannot freely withhold consent or where applicable law specifically allows the processing of PII without the PII principal's consent. - -#### Implementation guidance for the protection of PII - -Organizations should: - -- a) ensure that PII principals exercising a choice regarding the processing of their PII can do so before any processing takes place; -- b) not withhold service from a PII principal who declines to provide PII that is not relevant to that service. -- c) where provided for by relevant legislation or regulations, determine the practical means that will be implemented to enable PII principals to exercise their right to object to processing of their PII – PII principals should be given multiple means by which to exercise this right (e.g., by postal mail, e-mail, phone); -- d) acknowledge the statement of objection within the time frames specified in applicable law or as defined in organizational policy; -- e) analyse the cases where the practical means chosen are no longer operational and identify back-up solutions, if necessary, to allow PII principals to continue to exercise their right to object in a timely manner; -- f) ensure that PII is classified, labelled and stored in a manner that facilitates the exercising of the right to object and ensure that PII principals can exercise their right to object in a timely manner and at no cost; -- g) confirm the identity of the PII principal, or that of a PII principal's authorized agent, submitting an objection to processing – the information requested for verification should be kept to the minimum essential for that purpose, should only be retained for as long as necessary for that purpose and should be securely disposed of when no longer required; -- h) ensure, if legal grounds are required to exercise the right to object, that PII principals exercising their right to object provide reasonable grounds for the objection – any refusal to comply with the objection should detail the reasons why the PII controller does not consider those grounds as legitimate; -- i) ensure that all organizations with whom the PII has been shared are made aware of any objections submitted by the PII principal, and that they abide by any valid objections; and -- j) where possible, provide PII principals with the ability to object to selected aspects of the PII processing, rather than having to accept or object to the processing in its entirety. - -Other information for the protection of PII - -In many situations, depending on applicable laws, it may not be necessary or practicable to provide a mechanism to exercise choice when collecting publicly available information. For example, it would not be necessary to provide a mechanism to offer a choice to PII principals when collecting their name and address from a public record or a newspaper. - -## A.4 Purpose legitimacy and specification - -### A.4.1 Purpose legitimacy - -Objective: To ensure that the purpose(s) for processing of PII complies with applicable laws and relies on a permissible legal ground. - -#### Control - -Organizations should implement appropriate measures to ensure that PII processing complies with applicable law and relies on a permissible legal ground. - -#### Implementation guidance for the protection of PII - -Organizations should: - -- a) determine whether the proposed processing can be undertaken on the basis of a legal ground other than consent (e.g., law enforcement, public safety, legal obligation or a legitimate interest of the PII controller); -- b) determine whether the proposed processing is governed by a legal ground (e.g., law enforcement, public safety or legal obligation) that prohibits PII principals from exercising their choice regarding the processing of their PII; - -NOTE – If collection or processing of PII is executed internationally, the need for consent and the proper way to process it can differ over the different legal frameworks that apply. - -- c) determine the legal authority (ground) that permits the processing of PII, either generally or in support of a specific programme or information system; and -- d) incorporate procedures that ensure the processing is in accordance with all applicable regulation and its interpretation by competent authorities. The general context of the processing should be considered when determining the legitimacy of its purpose. This will include the nature of the underlying relationship between the PII controller and the PII principals, scientific and technological developments, and changes in societal and cultural attitudes. - -Organizations should develop procedures which ensure that processing of PII is not carried out in a way which breaches or potentially breaches any legal obligations, including statutory provisions, common law or contractual terms. - -If the organization has a works council or trade union, applicable laws may require consultation with such bodies when establishing the legitimacy of a purpose in case of employees. - -Programme officials should consult with the individual accountable for PII protection (sometimes referred to as the CPO) or equivalent and legal counsel regarding the authority of any programme or activity to collect PII. The authority to collect PII should be documented. - -### A.4.2 Purpose specification - -Objective: To specify the purposes for which PII are collected not later than at the time of PII collection and limit the subsequent use to the fulfilment of original purposes. - -#### Control - -Organizations should communicate to the PII principal from whom they are going to collect PII, the purpose(s) for which that PII is being collected and the purpose(s) for which the PII will be processed. Such communication should take place at or before the PII is collected and before the PII is processed for any purpose(s) not previously communicated to the PII principal. - -#### Implementation guidance for the protection of PII - -Organizations should communicate the purpose(s) to the PII principal before the information is collected or used for the first time for a new purpose, use language for this specification that is both clear and appropriately adapted to the circumstances, and give sufficient explanations for the need to process sensitive PII. - -Often, statutory language expressly authorizes specific collections and uses of PII. When statutory language is written broadly and thus subject to interpretation, organizations should ensure, in consultation with the CPO and legal counsel, that there is a clear connection between the general authorization and any specific collection of PII. - -Once the specific purposes have been identified, the purposes should be clearly described in the related privacy compliance documentation or forms organizations use to collect PII. Further, in order to avoid unauthorized collections or uses of PII, personnel who handle PII should receive training on the organizational authorities for collecting. - -Organizations should: - -- a) identify the PII useful only to each business process; -- b) separate the PII useful to each process in logical fashion; -- c) manage the different access rights according to the business processes (including payroll management, vacation request management and career advancement) and establish a dedicated IT environment for systems that process the most sensitive PII; and -- d) regularly confirm that PII are separated effectively and that recipients and interconnections have not been added. - -## A.5 Collection limitation - -Objective: To limit the collection of PII to that which is within the boundaries of applicable law and strictly necessary for the specified purpose(s). - -#### Control - -Organizations should implement appropriate measures to limit the collection of the type and amount of PII to the minimum elements for the purposes described in the notice (See A.9.1) and to that which is within the bounds of applicable laws and regulations. - -#### Implementation guidance for the protection of PII - -Organizations should: - -- a) limit the collection of PII to the minimum elements identified for the purposes described in the notice (See A.9.1) and for which the PII principal has provided consent; -- b) not collect sensitive PII unless collection of sensitive PII is legally authorized or consent is obtained; and -- c) limit the amount of information that they collect from or about a PII principal indirectly (e.g., through web logs, system logs). - -Organizations should define the purpose(s) for processing PII, identify the PII necessary to achieve that purpose, identify information that does not need to be collected and confirm that only essential information is being collected. - -Organizations should carefully consider which PII needs to be collected to realize a particular purpose before proceeding with collection. Organizations should not collect PII indiscriminately. - -Organizations should regularly review the purpose(s) for which they are collecting PII to ensure that they are still valid. They should also regularly review the PII they are collecting to ensure that it is still only the minimum essential for the purpose(s). - -Organizations should not collect sensitive PII, e.g., national identification number, unless collection of such information is legally authorized or explicit consent is obtained. - -#### Other information for the protection of PII - -Some jurisdictions may define certain categories of PII (e.g., racial origin, political opinions or religious or other beliefs, personal data on health, sex life or criminal convictions, and so on) as sensitive. These jurisdictions may impose restrictions or conditions on the collection of this kind of PII and organizations should take these restrictions and conditions into account when deciding which PII to collect. - -## A.6 Data minimization - -Objective: To minimize the PII which is processed to what is strictly necessary for the legitimate interests pursued by the PII controller and to limit the disclosure of PII to a minimum number of privacy stakeholders. - -#### Control - -Organizations should implement appropriate measures to minimize the amount of PII being processed to that which is strictly necessary for the legitimate interests of the PII controller (e.g., an organization may seek to increase or extend its business operations in a manner which legitimately increases the amount of PII it processes and stores). - -### Implementation guidance for the protection of PII - -Organizations should: - -- a) ensure adoption of a 'need-to-know' principle, i.e., one should be given access only to the PII which is necessary for the conduct of his/her official duties in the framework of the legitimate purpose of the PII processing; -- b) use or offer as default options, wherever possible, interactions and transactions which do not involve the identification of PII principals; -- c) limit the linkability of the PII collected; - -- d) conduct an initial evaluation of PII retained by the organization and establish and follow a schedule for regularly reviewing those to ensure that only PII identified in the notice is collected, and that the PII continues to be necessary to accomplish the current business purposes; -- e) restrict the transmission of electronic documents containing PII to a minimum of stakeholders who need them in connection with their work; -- f) determine which PII should be anonymized or de-identified based on the context, the form in which the PII is stored (e.g., database fields or excerpts from texts) and the risks identified; -- g) de-identify the data that require such de-identification based on the form of the data to be de-identified (e.g., databases and textual records) and the risks identified; -- h) delete and dispose of PII whenever the purpose for PII processing has expired, when there are no legal requirements to keep the PII or whenever it is practical to do so; and -- i) consider whether, and which, privacy enhancing technologies (PETs) may be used. - -The minimum set of PII elements required to support a specific organization business process may be a subset of the PII the organization is authorized to collect. - -The PII should be classified into mandatory PII and optional PII for collection. Organizations should collect only the mandatory PII required for providing service and obtain appropriate opt-in consent from PII principals when collecting optional PII. Organizations should not decline to provide service when PII principals decline to give optional PII. - -The CPO and legal counsel should challenge programme officials to justify the proposed processing of PII to ensure that it is the minimum necessary for the information system or activity to accomplish the legally authorized purpose. - -NOTE 1 – Anonymization, as defined in ISO/IEC 29100, is a process by which PII is irreversibly altered in such a way that a PII principal can no longer be identified directly or indirectly, either by the PII controller alone or in collaboration with any other party. Such a process necessarily involves an (irreversible) loss of information. In some cases, simply deleting part of the data can achieve the desired objective. - -NOTE 2 – A description of privacy-enhancing data de-identification techniques, to be used to describe and design de-identification measures, in accordance with the privacy principles in ISO/IEC 29100 is planned to form the subject of a future International Standard. As a general rule, in order to conclude that a de-identification process complies with the law, de-identification is carried out by, e.g., deleting or generalizing attributes, together with strong organizational and technical measures. - -NOTE 3 – When a PII is processed for a purpose, the extent of the PII processed is minimized so as to only serve the intended purpose, without revealing excessive information about the principal e.g., if the geographical area of a respondent to a traffic-related survey is required, consider collecting only nearby landmarks rather than a precise address. - -NOTE 4 – Often during analysis of anonymized data when the output is a small data set, the identity of PII principals can be revealed. Therefore, it is good practice to prevent output when the number of records is less than a threshold number – say 10 records. The threshold needs to be carefully arrived at, based on a data distribution pattern. - -Organizations should reduce their privacy and security risks by also reducing their inventory of PII, where appropriate. Organizations should conduct both an initial review and subsequent reviews of their PII holdings to ensure, to the maximum extent practicable, that such data stacks are accurate, relevant, timely, and complete. - -Organizations should also be directed to reduce their PII holdings to the minimum necessary for the proper performance of a documented organizational business purpose. Organizations should develop and publicize a schedule for periodic reviews of their data stack to supplement the initial review. - -By performing periodic evaluations, organizations reduce risk, ensure that they are collecting only the data specified in the notice, and ensure that the data collected is still relevant and necessary. - -## **A.7 Use, retention and disclosure limitation** - -### **A.7.1 Use, retention and disclosure limitation** - -Objective: To limit the use and disclosure of PII for specific, explicit and legitimate purposes and to retain PII no longer than necessary to fulfil the stated purposes or to abide by applicable laws. - -#### **Control** - -Organizations should implement appropriate measures to limit the processing of PII for legitimate and intended purposes and to retain PII only as long as necessary to fulfil the stated purposes or to abide by applicable laws. - -#### **Implementation guidance for the protection of PII** - -Organizations should: - -- a) limit the use, retention, and disclosure (including transfer) of PII to that which is necessary in order to fulfil specific, explicit and legitimate purposes; and -- b) configure their information systems to record the date when PII is collected, created or updated and when PII is to be deleted or archived under an approved record retention schedule. - -#### **Implementation guidance on use for the protection of PII** - -Organizations should: - -- a) lock (i.e., archive, secure and exempt from further processing) any PII when the stated purposes have expired but retention is required by applicable laws; -- b) use appropriate techniques or methods to ensure secure deletion or destruction of PII (including originals, copies and archived records); -- c) use PII only for the purposes agreed with or disclosed to the PII principal before or at the time of collection, and obtain consent when necessary prior to any processing for any new purpose; -- d) limit external party access to organizational systems and PII to that which is strictly necessary and which has been formally authorized – if access is really necessary for the business, appropriate approval procedures should be followed; -- e) confirm the external party systems that are permitted to connect to organizational systems have implemented appropriate safeguards prior to being allowed to connect; -- f) periodically review the safeguards implemented by third parties to ensure that they continue to meet the organization's security requirements – if, as a result of such a review, the safeguards are found to be inadequate, third parties should be disconnected until such time as they demonstrate that adequate safeguards have been restored; -- g) implement appropriate access authentication mechanism when PII is accessed through remote interfaces – logs of PII access need to be recorded; and -- h) provide notice to inform the public of any changes in PII holdings collected during the security monitoring process. - -#### **Implementation guidance on retention for the protection of PII** - -There may be circumstances in which a legal requirement to retain PII results in the retention of PII beyond that required for specified business purposes. - -Organizations should: - -- a) only retain PII for authorized time period to fulfil the purpose(s) identified in the notice or as required by law and organizations and delete the PII promptly when the retention period expires; -- b) where required to retain PII for longer than required for specified business purposes, implement measures such as de-identification to protect the PII; -- c) define PII retention periods that are time limited and appropriate to the purpose of the processing; -- d) confirm that the information system can detect the expiration of the retention period; -- e) ensure that agreed retention periods are implemented and PII disposed of in accordance with the retention periods; -- f) develop an automated functionality that deletes PII when its retention period expires – this deletion should occur immediately or as soon as it is practical to do; -- g) determine what should be de-identified based on the context, the form in which the PII is stored (including database fields or excerpts from texts) and the risks identified; -- h) de-identify the data that require such de-identification based on the form of the data to be de-identified (including databases and textual records) and the risks identified; and -- i) choose tools (including partial deletion, hashing, key hashing and index) for the protection of PII if that data cannot be de-identified. - -#### **Implementation guidance on disclosure for the protection of PII** - -Organizations should: - -- a) not disclose PII to external parties without the prior knowledge and consent of the PII principal, unless such disclosure is otherwise permitted by relevant legislation – knowledge and consent of the PII principal may not be required where disclosure is to internal parties (e.g., employees) who have a need to know; and - -- b) provide strong protection mechanisms when PII is transferred, including data encryption and integrity protection. - -Employee PII should be disposed of (i.e., securely deleted or archived) in accordance with applicable legislation and regulations, as well as in accordance with organizational disposal policies and where appropriate, employee consent. - -### A.7.2 Secure erasure of temporary files - -Objective: To provide technical measures for temporary files to be deleted within the specific period. - -#### Control - -Temporary files and documents that may contain PII should be disposed of within a specified, documented period. - -#### Implementation guidance for the protection of PII - -Information systems may create temporary files that contain PII in the normal course of their operation. Such files are system- and application-specific, but may include a file system with roll-back capability and temporary files associated with the updating of databases and the operation of other application software. Temporary files are not typically needed after the related information processing task has completed, but there are circumstances in which they may not be deleted automatically. The length of time for which these files remain in use is not always deterministic but a 'garbage collection' procedure should identify the relevant temporary files and determine how long since they were last used. - -PII processing information systems should implement a periodic check to ensure that unused temporary files above a specified age are deleted. - -### A.7.3 PII disclosure notification - -Objective: To ensure the PII processor notifies the PII controller of any legally binding request for disclosure of PII. - -#### Control - -The contract between the PII controller and the PII processor should require the PII processor to notify the PII controller, in accordance with any procedure and time periods agreed in the contract, of any legally binding request for disclosure of PII by law enforcement or other authority, unless such disclosure is otherwise prohibited by law. - -#### Implementation guidance for the protection of PII - -Organizations should implement measures (e.g., contractual obligations) to ensure that: - -- a) PII processors consult the relevant PII controller prior to accepting any legally binding requests for disclosure of PII, unless otherwise prohibited by law; and -- b) PII processors accept any contractually agreed requests for PII disclosures, as authorized by the relevant PII controller, unless otherwise prohibited by law. - -### A.7.4 Recording of PII disclosures - -Objective: To ensure that disclosures of PII to third parties are recorded. - -#### Control - -Disclosures of PII to third parties should be recorded, including which PII has been disclosed, to whom, at what time and for which purpose. - -#### Implementation guidance for the protection of PII - -PII may be disclosed during the course of normal operations. These disclosures should be recorded. Any additional disclosures to third parties, such as those arising from lawful investigations or external audits, should also be recorded. The records should include the source of the disclosure and the source of the authority to make the disclosure. - -### A.7.5 Disclosure of subcontracted PII processing - -Objective: To ensure that PII processors disclose any use of subcontractors to the PII controller. - -#### Control - -The use of subcontractors by the PII processor to process PII should be disclosed to the PII controller prior to any such use. - -#### Implementation guidance for the protection of PII - -Provisions for the use of subcontractors to process PII should be specified in the contract between the PII processor and the PII controller. The contract should specify that subcontractors may only be commissioned with the prior authorization of the PII controller. The PII processor should inform the PII controller in a timely fashion of any intended changes in this regard, so that the PII controller has the ability to object to such changes or to terminate the consent. - -Information disclosed should cover the fact that subcontracting is used and the names of relevant subcontractors, but not any business-specific details. The information disclosed should also include the countries in which subcontractors may process data and the means by which subcontractors are obliged to meet or exceed the obligations of the PII processor. - -Where public disclosure of subcontractor information is assessed to increase security risk beyond acceptable limits, disclosure should be made under a non-disclosure agreement or on the request of the PII controller. The PII controller should be made aware that information about subcontractors being used is available. - -## A.8 Accuracy and quality - -Objective: To ensure that the PII processed is accurate, complete, up-to-date, adequate and relevant for the purpose of use. - -#### Control - -Organizations should implement appropriate measures to ensure that PII collected from a PII principal, either directly or indirectly, is of appropriate quality. - -#### Implementation guidance for the protection of PII - -Achieving data quality means that the PII being processed is accurate, of adequate precision, complete, up-to-date, adequate and relevant for the purpose of use. - -Organizations should: - -- a) establish PII collection procedures to help ensure accuracy and quality; -- b) collect PII in a manner that any modifications are detectable after it has left the authoritative source; -- c) confirm to the greatest extent practicable upon collection or creation of PII, the accuracy, relevance, timeliness, and completeness of the PII; -- d) ensure the reliability of PII collected from a source other than from the PII principal before it is processed; -- e) verify, through appropriate means, the validity and correctness of the requests for correction made by the PII principal prior to making any changes to the PII, where it is appropriate to do so; -- f) periodically check for, and correct as necessary, any inaccurate or outdated PII used by its programmes or systems; and -- g) issue guidelines ensuring and maximizing the accuracy, completeness, adequacy and relevance of disseminated information. Organizations should take reasonable steps to confirm the accuracy of PII. Such steps may include, for example, editing and validating addresses as they are collected or entered into information systems using automated address verification look-up application programming interfaces (APIs). - -When the PII is of a sufficiently sensitive nature (e.g., when it is used for annual reconfirmation of a taxpayer's income for a recurring benefit), organizations should incorporate mechanisms into information systems and develop corresponding procedures for how frequently, and by what method, the information is to be updated. - -To minimize the scope for data inaccuracy, to the extent possible, PII should be entered into information systems directly by the PII principal without the need for another person to transcribe the data. However, in the event that transcription of - -the PII is unavoidable, organizations should consider enabling the PII principal to validate the transcribed PII. This helps in correcting errors before any consequential damage results from the processing of inaccurate PII. - -#### Other information for the protection of PII - -The types of measures taken to protect data quality may be based on the nature and context of the PII, how it is to be used, and how it was obtained. Measures taken to validate the accuracy of any sensitive PII should be more comprehensive than those used to validate less sensitive PII. Additional steps may be necessary to validate PII that is obtained from sources other than PII principals or the authorized representatives of PII principals. - -## A.9 Openness, transparency and notice - -### A.9.1 Privacy notice - -Objective: To ensure that privacy notices contain the appropriate level of details, are written in plain language, and are easily accessible. - -#### Control - -Organizations should implement appropriate measures to provide PII principals with appropriate notice of the purposes of PII processing. - -#### Implementation guidance for the protection of PII - -Organizations should: - -- a) provide effective notice to PII principals regarding: - - 1) their activities that impact privacy, including, but not limited to, their collection, use, sharing, safeguarding and secure disposal of PII, - - 2) authority for collecting PII, - - 3) the choices, if any, PII principals may have regarding how the organization uses PII and the consequences of exercising or not those choices, and - - 4) the ability to object to the processing; -- b) provide notice and consent mechanisms tailored to meet operational needs; -- c) revise their notices to reflect changes in practice or policy that affect PII or changes in their activities that impact privacy, before or as soon as practicable after the change; -- d) ensure that the notification is complete and appropriate to the target audience based on the nature of the PII, the practical means chosen for providing the notice, and the nature of the relationship between the PII controller and PII principal; -- e) present the information in clear manner that can be understood by a person who is not familiar with information technologies, the Internet or legal jargon; -- f) ensure that the notification is provided before or at the time of PII collection; -- g) ensure that the PII cannot be collected without notice being provided; -- h) determine alternative solutions in the event that the practical means are no longer operational; -- i) provide a means by which to show that notification was provided, if possible; -- j) where a privacy notice is provided by physical means, post this information on a sign that PII principals should see or require that a notice or document be signed or initialled; and -- k) provide a policy for the provision of labels and signs needed to inform PII principals about relevant technology use [i.e., Closed-Circuit Television (CCTV) systems, WiFi, and radio frequency identification (RFID)]. - -To the extent possible, the notice should be prominently displayed at the point of collection (e.g., on the organization's website or in a physical location), without the need for the PII principal to specifically request it. - -### A.9.2 Openness and transparency - -Objective: To provide PII principals with clear and easily accessible information about the PII controller's policies, procedures and practices with respect to the handling of PII. - -#### Control - -Organizations should implement appropriate measures to provide PII principals with appropriate information about their PII processing policies, procedures and practices with respect to the handling of PII. - -#### Implementation guidance for the protection of PII - -Organizations should: - -- a) provide PII principals with clear and easily accessible information about the PII controller's policies, procedures and practices with respect to the processing of PII; -- b) disclose the choices and means offered by the PII controller to PII principals for the purposes of limiting the processing of, and for accessing, correcting and removing their information. - -In addition, organizations should describe: - -- a) the PII the organization collects and the purpose(s) for which it collects that information; -- b) how the organization uses PII internally; -- c) whether the organization shares PII with external entities, the categories of those entities, and the purposes for such sharing; -- d) whether PII principals have the ability to consent to specific uses or sharing of PII and how to exercise any such consent; -- e) how long the PII will be retained; -- f) whether the organization on-sells or forwards data for processing by data analytics organizations and the details applicable to PII risks; -- g) how PII principals may obtain access to PII for the purpose of having it amended or corrected, where appropriate; -- h) appropriate information about how PII will be protected; -- i) ensure that PII principal has access to information about its privacy activities and is able to communicate with its CPO; -- j) provide, where requested, information relating to privacy breaches that has or may have resulted in a breach of privacy of the requestors PII along with any associated actions that the requestor could take to mitigate the additional risks arising from the breach. - -Organizations should also employ different mechanisms for informing the public about their privacy practices including, but not limited to, PIA reports, privacy reports, publicly available web pages, email distributions, blogs and periodic publications (e.g., quarterly newsletters). Organizations should also employ publicly facing email addresses or phone lines that enable the public to provide feedback or to direct questions to privacy offices regarding privacy practices. - -## A.10 PII principal participation and access - -### A.10.1 PII principal access - -Objective: To give PII principals the ability to access and review their PII and to challenge its accuracy and completeness. - -#### Control - -Appropriate measures should be implemented by organizations to provide PII principals with the ability to have access to their PII, and to obtain rectification of the PII or deletion of the PII. - -#### Implementation guidance for the protection of PII - -Organizations should: - -- a) determine the practical means that will be implemented to allow PII principals to exercise their right of access (where allowed by applicable legislation). Individuals should be able to exercise this right in a timely manner, in a form understandable and accessible to the PII principal and similar to the means used to collect the PII originally (e.g., by regular mail or by email); -- b) analyse the cases in which the practical means chosen are no longer operational and identify back-up solutions, if necessary; -- c) provide PII principals the ability to access to their PII as held by the organization, in order to assess its accuracy and to request corrections as necessary; -- d) to the extent possible, responses should be provided in a form equivalent to that in which the request was made (e.g., if the request is made by regular mail, the response should be provided by regular mail); -- e) publish rules and regulations governing how PII principals may request access to records maintained in its system; -- f) allow PII principals to challenge the accuracy and completeness of the PII directly or indirectly and have it amended, corrected or removed as appropriate and possible in the specific context; -- g) establish procedures to enable PII principals to exercise these rights in a simple, fast and efficient way, which does not entail undue delay (e.g., responses should be provided in accordance with applicable legislation or regulation or as specified in organizational policy) or cost; -- h) establish a process to inform PII principals submitting requests about the status of their request and the necessary processing (e.g., by postal mail or email, noting that the request has been received and the date by which they can expect to receive a response) – in the case of stored archives, there may be some leeway regarding the response date if the PII controller informs the PII principal submitting the request of the timescale for request processing and has provided a reasonable response time; -- i) to the extent permitted by law, ensure that the right of access can always be exercised; -- j) ensure that PII is only accessed by the individual to whom that information relates or an authorized agent of that individual – this may require that individuals requesting access identify and authenticate themselves in a satisfactory manner – requirements for such identification and authentication may be defined in applicable legislation or regulation; -- k) where identification and authentication of requestors is required, and unless otherwise prescribed by legislation or regulation, determine the appropriate form of identification and authentication – organizations should request only the minimum information necessary to ensure correct identification – this information should be properly secured and should only be retained as long as necessary; -- l) ensure that PII is only sent to the relevant PII principal and that it is sent in a secure manner; -- m) ensure that all information that PII principals may request can be provided, while still protecting the PII of other PII principals; -- n) communicate in privacy notices if they intend to levy any fees for access, as may be permitted by law in some jurisdictions; and -- o) require any PII processor to support the PII controller in facilitating the exercise of PII principal's rights to access, correct or delete their data. - -Access affords PII principals the ability to review PII about them held within organizational systems of records. Access includes timely, simplified and inexpensive access to data. Organizational processes for allowing access to records may differ based on resources, legal requirements or other factors. - -### **A.10.2 Redress and participation** - -Objective: To provide any amendment, correction or removal to PII processors and third parties to whom personal data had been disclosed. - -#### **Control** - -Unless prohibited by relevant legislation or regulation, organizations should implement appropriate measures to provide PII principals with the ability to correct, amend or delete PII maintained by organizations. Organization should also establish a mechanism by which any corrections, amendments or deletions are notified to PII processors and, as far as possible, to third parties to whom PII had been disclosed. - -#### **Implementation guidance for the protection of PII** - -Organizations should: - -- a) ensure that the principal can always exercise the right to correct; -- b) analyse the cases in which the practical means chosen are no longer operational and identify back-up solutions, if necessary; -- c) to the extent permissible by relevant legislation or regulation, ensure that PII principals can exercise their right to correction; -- d) ensure the accuracy of the corrections requested; -- e) ensure that the PII principals submitting requests receive confirmation; -- f) ensure that the third parties to whom the PII may have been sent are informed of the corrections made; and -- g) provide PII principals with access only to the PII they need to correct, amend and delete. - -### A.10.3 Complaint management - -Objective: To set up efficient internal complaint handling and redress procedures for use by PII principals. - -#### Control - -Organizations should implement appropriate measures to efficiently handle complaints received from PII principals. - -#### Implementation guidance for the protection of PII - -Organizations should implement a complaint management process and maintain a point of contact for receiving and responding to complaints, concerns, or questions from PII principals about organizational privacy practices. - -Organizations should provide complaint mechanisms that: are readily accessible by the PII principals, include all information necessary for successfully filing complaints (including contact information for the CPO or other official designated to receive complaints) and are easy to use. - -Organizational complaint management processes should include tracking mechanisms to ensure that all complaints received are reviewed and appropriately addressed in a timely manner. Complaint management should also include corrective action triggered from the complaint. - -#### Other information for the protection of PII - -Complaints, concerns, and questions from PII principals can serve as a valuable source of external input that ultimately improves operational models, uses of technology, data processing practices, and privacy and security safeguards. - -## A.11 Accountability - -### A.11.1 Governance - -Objective: To establish efficient governance for PII processing. - -#### Control - -Organizations should implement appropriate measures to establish efficient governance related to PII processing. - -#### Implementation guidance for the protection of PII - -Organizations should: - -- a) appoint a person accountable for developing, implementing and maintaining an organization-wide governance and privacy programme to ensure compliance with all applicable laws and regulations regarding PII processing by programmes and information systems – the appointed person could be designated as a CPO – as another option, a dedicated member of the board of directors may assume accountability, with the support of a dedicated member of staff that may be subcontracted; -- b) ensure that the appointed person has the necessary expertise to oversee PII processing; -- c) ensure that the appointed individual is involved in all issues that relate to the protection of PII and can directly report to senior management in a timely manner; -- d) provide the appointed individual with staff, premises, equipment and other resources necessary to carry out his tasks; - -- e) provide a process to monitor privacy laws and policy for changes that affect the PII protection programme; -- f) develop, disseminate and implement operational PII protection policies and procedures that govern PII protection and security controls for programs, information systems, or technologies involving PII; -- g) update PII protection plans, policies, and procedures periodically; and -- h) monitor periodically the performance of the organization on PII protection – a senior management representative or member of the board should govern it with visibility into aspects such as quantitative metrics, risks and breaches – while such review may be need based, it should also be periodic without the need for any triggers. - -### A.11.2 Privacy impact assessment - -Objective: To establish a privacy impact assessment process and to perform a privacy impact assessment as necessary. - -#### Control - -If an organization is processing PII, then the organization should establish the procedures necessary to conduct a PIA. - -#### Implementation guidance for the protection of PII - -A privacy risk assessment is typically conducted by an organization that takes its responsibility seriously and treats PII principals adequately. In some jurisdictions, a PIA may be necessary to meet legal and regulatory requirements. ISO/IEC 29134 may be used as guidance for PIA. - -Organizations should consider assets, threats, vulnerabilities and safeguards (existing and proposed) when performing privacy risk assessment. Organizations should document: - -- a) the results of a PIA including, but not limited to, the PII being processed; -- b) the identified privacy risks; and -- c) the proposed mitigation measures. - -### A.11.3 Privacy requirement for contractors and PII processors - -Objective: To ensure, through contractual or other means such as mandatory internal policies, that third party recipients provide at least equivalent levels of PII protection. - -#### Control - -Organizations should implement appropriate measures to ensure contractors and PII processors have implemented adequate levels of PII protection. - -#### Implementation guidance for the protection of PII - -Organizations should: - -- a) document in the service level agreement the PII protection requirements that PII processors are required to meet; -- b) monitor and audit the implementation of those requirements by contractors; -- c) establish PII protection roles and responsibilities for contractors and PII processors; -- d) determine by contract the subject and time frame of the service to be provided, the extent, manner and purpose of the processing of PII by the PII processor as well as the types of PII processed; -- e) specify the conditions under which a PII processor should return or securely dispose of PII upon completion of service, termination of any governing agreement or otherwise upon the request of the PII controller; -- f) include a confidentiality clause, binding both upon the provider and any of its employees who may be able to access the PII; -- g) ensure that the service provider does not communicate the PII to third parties, even for preservation purposes, unless specifically permitted in the contract; -- h) clarify the responsibilities of the service provider to notify the PII controller in the event of any data breach that affects the PII; - -- i) fix by contract that the service provider should notify the PII controller of any relevant changes concerning the service such as the implementation of additional functions; and -- j) document and communicate as appropriate all PII protection-related policies, procedures and practices. - -Organizations should consult with legal counsel, the CPO, and contracting officers about applicable laws, directives, policies or regulations that may impact implementation of this control. - -NOTE – Additional implementation guidance of 15.1.2 is also implemented. - -#### **Other information for the protection of PII** - -Contractors and PII processors may include, but are not limited to, service bureaus, information providers, information processors, and other organizations providing information system development, information technology services and other outsourced applications. - -### **A.11.4 Privacy monitoring and auditing** - -| | -|------------------------------------------------------------------------------------------------------------------| -| Objective: To monitor and audit PII protection controls and the effectiveness of internal PII protection policy. | -|------------------------------------------------------------------------------------------------------------------| - -#### **Control** - -Organizations should implement appropriate measures to periodically monitor and audit privacy controls and the effectiveness of internal privacy policy. - -#### **Implementation guidance for the protection of PII** - -Organizations should: - -- a) regularly monitor and audit PII processing operations, especially those involving sensitive PII, to ensure that they conform to applicable laws, regulations and contractual terms; -- b) regularly monitor and audit PII protection controls and policies to ensure that they conform to applicable laws, regulations and contractual terms; -- c) ensure that audits are conducted by qualified, independent parties (either internal or external to the organization); and -- d) if conducting audits using internal resources, periodically have an external party conduct the audit for an independent assessment. - -### **A.11.5 PII protection awareness and training** - -| | -|------------------------------------------------------------------------------------------------------------------------------------------------------| -| Objective: To provide suitable training and awareness concerning PII protection for the personnel of the PII controller who will have access to PII. | -|------------------------------------------------------------------------------------------------------------------------------------------------------| - -#### **Control** - -Organizations should implement appropriate measures to provide suitable training for the personnel of the PII controller. - -#### **Implementation guidance for the protection of PII** - -Organizations should: - -- a) implement and maintain a comprehensive training and awareness strategy aimed at ensuring that personnel understand their PII protection responsibilities and procedures; -- b) create mechanisms to keep the personnel with PII protection responsibilities updated on developments in the regulatory, contractual and technological environment that could impact privacy compliance by the organization; -- c) administer basic and targeted role-based PII protection training on a regular (e.g., annual) or as required (e.g., after an incident) basis – this is particularly important for activities that only process PII on an infrequent basis; and -- d) ensure that personnel certify (manually or electronically) acceptance of responsibilities for PII protection requirements periodically. - -### **A.11.6 PII protection reporting** - -Objective: To develop, disseminate and update PII protection reports. - -#### **Control** - -Organizations should develop, disseminate as appropriate and update reports (e.g., reporting on breaches, investigations, audits) to senior management and other personnel with responsibility for monitoring PII protection in order to demonstrate accountability with specific statutory and regulatory PII protection programme mandates. - -#### **Implementation guidance for the protection of PII** - -Through external and internal PII protection reporting, organizations should promote accountability and transparency in organizational PII protection operations. Reporting also helps organizations determine progress in meeting PII protection compliance requirements and PII protection controls, compare performance across the organization, identify vulnerabilities and gaps in policy and implementation, and identify success models. - -## **A.12 Information security** - -Objective: To ensure that PII is appropriately safeguarded in accordance with the results of a risk assessment. - -#### **Control** - -PII in the care and custody of the organization should be protected by appropriate controls, in accordance with the results of a threat risk assessment or PIA. - -#### **Implementation guidance for the protection of PII** - -Organizations should: - -- a) protect PII with appropriate controls at the operational, functional and strategic level to ensure the integrity, confidentiality and availability of the PII, and protect it against risks such as unauthorized access, destruction, use, modification, disclosure or loss throughout the whole of its life cycle; -- b) choose PII processors and appropriate contracts that provide sufficient guarantees with regard to organizational, physical and technical controls for the processing of PII, and ensuring compliance with these controls; -- c) base security controls on applicable legal requirements, security standards, the results of systematic security risk assessments as described in ISO 31000 and the results of a cost–benefit analysis; -- d) limit access to PII to those individuals who require such access to perform their duties and limit the access those individuals have to only the PII that they require access to in order to perform their duties; -- e) resolve risks and vulnerabilities that are discovered through privacy risk assessments and audit processes; and -- f) subject the controls to periodic review and reassessment in an ongoing security risk management process. - -Security requirements are sometimes prescribed by certain data privacy laws in which case these should be communicated to the data security function for implementation. - -Due diligence should be taken when designing and implementing security controls. - -## **A.13 Privacy compliance** - -### **A.13.1 Compliance** - -Objective: To avoid breaches of legal, statutory, regulatory, privacy policy or contractual obligations related to privacy and to any privacy requirements. - -#### **Control** - -Organizations should implement appropriate measures to ensure PII processing meets compliance requirements. - -#### **Implementation guidance for the protection of PII** - -Organizations should: - -- a) produce an annual report detailing existing risks, stating the compliance position and including a summary of outstanding actions; and -- b) follow well-defined breach response processes that could, in some jurisdictions, include the requirement to notify PII principals and other authorities (e.g., data protection authorities). - -### **A.13.2 Cross border data transfer restrictions in certain jurisdictions** - -| | -|------------------------------------------------------------------------| -| Objective: To protect PII when it is being transferred across borders. | -|------------------------------------------------------------------------| - -#### **Control** - -Organization should implement appropriate measures to ensure that any transfers of PII across borders meets relevant compliance requirements. - -#### **Implementation guidance for the protection of PII** - -When PII needs to be transferred to a country other than the territory where the PII currently resides, data privacy regulations of certain jurisdictions may impose restrictions, which could be typically one or more of the following: - -- a) notification to the data protection authority; -- b) approval from the data protection authority, particularly if data is sensitive; -- c) conducting appropriate due diligence to ensure that PII transferred across a border is afforded protection equivalent to that required in the originating country; and -- d) implementation of specific data transfer instruments such as standard contractual clauses, or binding corporate rules (BCRs). - -Organizations should implement measures to check whether specific restrictions apply to any planned transfer and comply before carrying it on. - -# Bibliography - -- BSI 10012, *Specification for a personal information management system*. -- European Commission, *Evaluation report on the data retention directive (Directive 2006/24/EC)*, 2011. -- ISO/IEC 27000:2016, *Information technology – Security techniques – Information security management systems – Overview and vocabulary*. -- ISO/IEC 27001, *Information technology – Security techniques – Information security management systems – Requirements*. -- ISO/IEC 27005, *Information technology – Security techniques – Information security risk management*. -- ISO/IEC 27009, *Information technology – Security techniques – Sector-specific application of ISO/IEC 27001 – Requirements*. -- ISO/IEC 27018, *Information technology – Security techniques – Code of practice for protection of personally identifiable information (PII) in public clouds acting as PII processors*. -- ISO/IEC 29134, *Information technology – Security techniques – Guidelines for privacy impact assessment*. -- IEC *Electropedia*. Available (viewed 2017-07-06) at: . -- ISO *Online browsing platform*. Available (viewed 2017-07-06) at: . -- ITU *Terms and definitions*. Available (viewed 2017-07-07) at: . -- KCS, *Personal information management system*, December, 2011. -- NIST Special Publication 800-53 Appendix J, *Security and privacy controls for federal information systems and organizations*, July, 2011. -- NIST Special Publication 800-122, *Guide to protecting the confidentiality of personally identifiable information (PII)*, April 2010. - - - - - -# SERIES OF ITU-T RECOMMENDATIONS - -| | | -|-----------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------| -| Series A | Organization of the work of ITU-T | -| Series D | Tariff and accounting principles and international telecommunication/ICT economic and policy issues | -| Series E | Overall network operation, telephone service, service operation and human factors | -| Series F | Non-telephone telecommunication services | -| Series G | Transmission systems and media, digital systems and networks | -| Series H | Audiovisual and multimedia systems | -| Series I | Integrated services digital network | -| Series J | Cable networks and transmission of television, sound programme and other multimedia signals | -| Series K | Protection against interference | -| Series L | Environment and ICTs, climate change, e-waste, energy efficiency; construction, installation and protection of cables and other elements of outside plant | -| Series M | Telecommunication management, including TMN and network maintenance | -| Series N | Maintenance: international sound programme and television transmission circuits | -| Series O | Specifications of measuring equipment | -| Series P | Telephone transmission quality, telephone installations, local line networks | -| Series Q | Switching and signalling, and associated measurements and tests | -| Series R | Telegraph transmission | -| Series S | Telegraph services terminal equipment | -| Series T | Terminals for telematic services | -| Series U | Telegraph switching | -| Series V | Data communication over the telephone network | -| Series X | Data networks, open system communications and security | -| Series Y | Global information infrastructure, Internet protocol aspects, next-generation networks, Internet of Things and smart cities | -| Series Z | Languages and general software aspects for telecommunication systems | \ No newline at end of file diff --git a/marked/X/T-REC-X.1060-202106-I_PDF-E/07b17a620c75522d53916a11e12d1bff_img.jpg b/marked/X/T-REC-X.1060-202106-I_PDF-E/07b17a620c75522d53916a11e12d1bff_img.jpg deleted file mode 100644 index 504c8941294e0e79dd7e1462bcf5cd5bedf91f75..0000000000000000000000000000000000000000 --- a/marked/X/T-REC-X.1060-202106-I_PDF-E/07b17a620c75522d53916a11e12d1bff_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:cef3eae651dbd5b36de27778902f8ad9bf8b7d72a8248b9ec7c1a64a878d6a05 -size 45663 diff --git a/marked/X/T-REC-X.1060-202106-I_PDF-E/14a22f23ced8ba1d63ece69861dbaacc_img.jpg b/marked/X/T-REC-X.1060-202106-I_PDF-E/14a22f23ced8ba1d63ece69861dbaacc_img.jpg deleted file mode 100644 index 94d45ee0d7450a0c276bffad33306ce1ec96de62..0000000000000000000000000000000000000000 --- a/marked/X/T-REC-X.1060-202106-I_PDF-E/14a22f23ced8ba1d63ece69861dbaacc_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:c981deef08fa0ff69264e0a06c61f5dd291a362fb37303b3216e33a0ba5040e9 -size 5841 diff --git a/marked/X/T-REC-X.1060-202106-I_PDF-E/367926125450c2bc3f4bdca9d59a62ba_img.jpg b/marked/X/T-REC-X.1060-202106-I_PDF-E/367926125450c2bc3f4bdca9d59a62ba_img.jpg deleted file mode 100644 index 9fa573e0127c212d934be6f11ce182791551e50f..0000000000000000000000000000000000000000 --- a/marked/X/T-REC-X.1060-202106-I_PDF-E/367926125450c2bc3f4bdca9d59a62ba_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:72dac8e1779c12e0fdbebcb7d4720d36a4239afd60ffde5eb845b159d5b4626e -size 50524 diff --git a/marked/X/T-REC-X.1060-202106-I_PDF-E/8fbdfc3d17fb1dae7b2d8f5a287fa9fc_img.jpg b/marked/X/T-REC-X.1060-202106-I_PDF-E/8fbdfc3d17fb1dae7b2d8f5a287fa9fc_img.jpg deleted file mode 100644 index 58f21451ef8f74cd876a7fa1819ad868a073829b..0000000000000000000000000000000000000000 --- a/marked/X/T-REC-X.1060-202106-I_PDF-E/8fbdfc3d17fb1dae7b2d8f5a287fa9fc_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:0cf9e5c973b2d2f6886d461623281bfc68090f83038561bbcdb87027a4c01317 -size 276654 diff --git a/marked/X/T-REC-X.1060-202106-I_PDF-E/a5ee5c23b6dc52ec1d724b76d5a5f58f_img.jpg b/marked/X/T-REC-X.1060-202106-I_PDF-E/a5ee5c23b6dc52ec1d724b76d5a5f58f_img.jpg deleted file mode 100644 index 13246c7a8ed76548c385642e2e3021d00888f184..0000000000000000000000000000000000000000 --- a/marked/X/T-REC-X.1060-202106-I_PDF-E/a5ee5c23b6dc52ec1d724b76d5a5f58f_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:0879bb73d84f80721a4c0bc0e8d48f26c3114c512caafbe7841663caaecb8597 -size 37168 diff --git a/marked/X/T-REC-X.1060-202106-I_PDF-E/d4af765160d04ecef538e5066006dc77_img.jpg b/marked/X/T-REC-X.1060-202106-I_PDF-E/d4af765160d04ecef538e5066006dc77_img.jpg deleted file mode 100644 index d6e606df2c59751de6c6457f026e2b8b99c1142e..0000000000000000000000000000000000000000 --- a/marked/X/T-REC-X.1060-202106-I_PDF-E/d4af765160d04ecef538e5066006dc77_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:6bd304aa5d7c36c85f27535f333c9e26aaf48ea07a814d2353e8409dcf4f742c -size 31595 diff --git a/marked/X/T-REC-X.1060-202106-I_PDF-E/f6e8acf9f931452d01688d311b5c0364_img.jpg b/marked/X/T-REC-X.1060-202106-I_PDF-E/f6e8acf9f931452d01688d311b5c0364_img.jpg deleted file mode 100644 index 08b9ec4130d838d1771ce74b6ede0104748765f5..0000000000000000000000000000000000000000 --- a/marked/X/T-REC-X.1060-202106-I_PDF-E/f6e8acf9f931452d01688d311b5c0364_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:7f79dfddb5fbc805cbf53cf7a2c88cb4ec9259a00c82e4b70b3923670394c83c -size 46134 diff --git a/marked/X/T-REC-X.1060-202106-I_PDF-E/fc69ceb1dee1da7e33bd6c38fc4ceab9_img.jpg b/marked/X/T-REC-X.1060-202106-I_PDF-E/fc69ceb1dee1da7e33bd6c38fc4ceab9_img.jpg deleted file mode 100644 index 5e1e247f9cda8eaeec570b2207c56134a381058a..0000000000000000000000000000000000000000 --- a/marked/X/T-REC-X.1060-202106-I_PDF-E/fc69ceb1dee1da7e33bd6c38fc4ceab9_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:76bc3b7ad67c1883d29b45ea3c61101d4a1ec2bd7c75a2a8327e3a15c9007808 -size 53051 diff --git a/marked/X/T-REC-X.1060-202106-I_PDF-E/ff0952ef692c9d960ce5f6708bcc9711_img.jpg b/marked/X/T-REC-X.1060-202106-I_PDF-E/ff0952ef692c9d960ce5f6708bcc9711_img.jpg deleted file mode 100644 index 8b6e78404c2d370a9ddfdb7885483cc85636a9e5..0000000000000000000000000000000000000000 --- a/marked/X/T-REC-X.1060-202106-I_PDF-E/ff0952ef692c9d960ce5f6708bcc9711_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:b5bb3ef56753fc819a806138cc13ccd2bdc6cc98ee558f0fbd66cab9c240a8b0 -size 25985 diff --git a/marked/X/T-REC-X.1060-202106-I_PDF-E/raw.md b/marked/X/T-REC-X.1060-202106-I_PDF-E/raw.md deleted file mode 100644 index b742c396f9431322652dfe3dc4ecd0943e8ee17e..0000000000000000000000000000000000000000 --- a/marked/X/T-REC-X.1060-202106-I_PDF-E/raw.md +++ /dev/null @@ -1,1055 +0,0 @@ - - -I n t e r n a t i o n a l   T e l e c o m m u n i c a t i o n   U n i o n - -**ITU-T** - -TELECOMMUNICATION -STANDARDIZATION SECTOR -OF ITU - -**X.1060** - -(06/2021) - -SERIES X: DATA NETWORKS, OPEN SYSTEM -COMMUNICATIONS AND SECURITY - -Information and network security – Security management - -# --- **Framework for the creation and operation of a cyber defence centre** - -Recommendation ITU-T X.1060 - -## ITU-T X-SERIES RECOMMENDATIONS DATA NETWORKS, OPEN SYSTEM COMMUNICATIONS AND SECURITY - -| | | -|--------------------------------------------------------|----------------------| -| PUBLIC DATA NETWORKS | X.1–X.199 | -| OPEN SYSTEMS INTERCONNECTION | X.200–X.299 | -| INTERWORKING BETWEEN NETWORKS | X.300–X.399 | -| MESSAGE HANDLING SYSTEMS | X.400–X.499 | -| DIRECTORY | X.500–X.599 | -| OSI NETWORKING AND SYSTEM ASPECTS | X.600–X.699 | -| OSI MANAGEMENT | X.700–X.799 | -| SECURITY | X.800–X.849 | -| OSI APPLICATIONS | X.850–X.899 | -| OPEN DISTRIBUTED PROCESSING | X.900–X.999 | -| INFORMATION AND NETWORK SECURITY | | -| General security aspects | X.1000–X.1029 | -| Network security | X.1030–X.1049 | -| Security management | X.1050–X.1069 | -| Telebiometrics | X.1080–X.1099 | -| SECURE APPLICATIONS AND SERVICES (1) | | -| Multicast security | X.1100–X.1109 | -| Home network security | X.1110–X.1119 | -| Mobile security | X.1120–X.1139 | -| Web security | X.1140–X.1149 | -| Security protocols (1) | X.1150–X.1159 | -| Peer-to-peer security | X.1160–X.1169 | -| Networked ID security | X.1170–X.1179 | -| IPTV security | X.1180–X.1199 | -| CYBERSPACE SECURITY | | -| Cybersecurity | X.1200–X.1229 | -| Countering spam | X.1230–X.1249 | -| Identity management | X.1250–X.1279 | -| SECURE APPLICATIONS AND SERVICES (2) | | -| Emergency communications | X.1300–X.1309 | -| Ubiquitous sensor network security | X.1310–X.1319 | -| Smart grid security | X.1330–X.1339 | -| Certified mail | X.1340–X.1349 | -| Internet of things (IoT) security | X.1360–X.1369 | -| Intelligent transportation system (ITS) security | X.1370–X.1389 | -| Distributed ledger technology security | X.1400–X.1429 | -| Distributed ledger technology security | X.1430–X.1449 | -| Security protocols (2) | X.1450–X.1459 | -| CYBERSECURITY INFORMATION EXCHANGE | | -| Overview of cybersecurity | X.1500–X.1519 | -| Vulnerability/state exchange | X.1520–X.1539 | -| Event/incident/heuristics exchange | X.1540–X.1549 | -| Exchange of policies | X.1550–X.1559 | -| Heuristics and information request | X.1560–X.1569 | -| Identification and discovery | X.1570–X.1579 | -| Assured exchange | X.1580–X.1589 | -| CLOUD COMPUTING SECURITY | | -| Overview of cloud computing security | X.1600–X.1601 | -| Cloud computing security design | X.1602–X.1639 | -| Cloud computing security best practices and guidelines | X.1640–X.1659 | -| Cloud computing security implementation | X.1660–X.1679 | -| Other cloud computing security | X.1680–X.1699 | -| QUANTUM COMMUNICATION | | -| Terminologies | X.1700–X.1701 | -| Quantum random number generator | X.1702–X.1709 | -| Framework of QKDN security | X.1710–X.1711 | -| Security design for QKDN | X.1712–X.1719 | -| Security techniques for QKDN | X.1720–X.1729 | -| DATA SECURITY | | -| Big Data Security | X.1750–X.1759 | -| IMT-T SECURITY | X.1800–X.1819 | - -*For further details, please refer to the list of ITU-T Recommendations.* - -# Recommendation ITU-T X.1060 - -# Framework for the creation and operation of a cyber defence centre - -## Summary - -Recommendation ITU-T X.1060 defines cyber defence centre (CDC) as an entity that plays a central role in an organization to address cybersecurity risks. The three processes of build, management and evaluation that a CDC should practically implement are described as a framework. The services that the organization should have in order to implement more specific cybersecurity measures are also provided. - -## History - -| Edition | Recommendation | Approval | Study Group | Unique ID* | -|---------|----------------|------------|-------------|---------------------------------------------------------------------------| -| 1.0 | ITU-T X.1060 | 2021-06-29 | 17 | 11.1002/1000/14721 | - -## Keywords - -Cyber defence centre, CIRT, security operation centre (SOC). - ---- - -\* To access the Recommendation, type the URL in the address field of your web browser, followed by the Recommendation's unique ID. For example, . - -## FOREWORD - -The International Telecommunication Union (ITU) is the United Nations specialized agency in the field of telecommunications, information and communication technologies (ICTs). The ITU Telecommunication Standardization Sector (ITU-T) is a permanent organ of ITU. ITU-T is responsible for studying technical, operating and tariff questions and issuing Recommendations on them with a view to standardizing telecommunications on a worldwide basis. - -The World Telecommunication Standardization Assembly (WTSA), which meets every four years, establishes the topics for study by the ITU-T study groups which, in turn, produce Recommendations on these topics. - -The approval of ITU-T Recommendations is covered by the procedure laid down in WTSA Resolution 1. - -In some areas of information technology which fall within ITU-T's purview, the necessary standards are prepared on a collaborative basis with ISO and IEC. - -## NOTE - -In this Recommendation, the expression "Administration" is used for conciseness to indicate both a telecommunication administration and a recognized operating agency. - -Compliance with this Recommendation is voluntary. However, the Recommendation may contain certain mandatory provisions (to ensure, e.g., interoperability or applicability) and compliance with the Recommendation is achieved when all of these mandatory provisions are met. The words "shall" or some other obligatory language such as "must" and the negative equivalents are used to express requirements. The use of such words does not suggest that compliance with the Recommendation is required of any party. - -## INTELLECTUAL PROPERTY RIGHTS - -ITU draws attention to the possibility that the practice or implementation of this Recommendation may involve the use of a claimed Intellectual Property Right. ITU takes no position concerning the evidence, validity or applicability of claimed Intellectual Property Rights, whether asserted by ITU members or others outside of the Recommendation development process. - -As of the date of approval of this Recommendation, ITU had not received notice of intellectual property, protected by patents/software copyrights, which may be required to implement this Recommendation. However, implementers are cautioned that this may not represent the latest information and are therefore strongly urged to consult the appropriate ITU-T databases available via the ITU-T website at . - -© ITU 2021 - -All rights reserved. No part of this publication may be reproduced, by any means whatsoever, without the prior written permission of ITU. - -## Table of Contents - -| | | Page | -|----|-------------------------------------------------------------------------------|------| -| 1 | Scope ..... | 1 | -| 2 | References..... | 1 | -| 3 | Definitions ..... | 1 | -| | 3.1 Terms defined elsewhere..... | 1 | -| | 3.2 Terms defined in this Recommendation..... | 1 | -| 4 | Abbreviations and acronyms ..... | 1 | -| 5 | Conventions ..... | 2 | -| 6 | Structure of this Recommendation ..... | 2 | -| 7 | Overview of a cyber defence centre ..... | 2 | -| 8 | Framework for the creation and operation of a CDC ..... | 2 | -| 9 | Build process ..... | 3 | -| | 9.1 Overview ..... | 3 | -| | 9.2 CDC service recommendation level..... | 4 | -| | 9.3 CDC service assignment..... | 5 | -| | 9.4 CDC service assessment..... | 6 | -| 10 | Management process ..... | 7 | -| 11 | Evaluation process ..... | 8 | -| | 11.1 Overview ..... | 8 | -| | 11.2 CDC service catalogue evaluation..... | 8 | -| | 11.3 CDC service profile evaluation ..... | 8 | -| | 11.4 CDC service portfolio evaluation..... | 8 | -| 12 | CDC service categories and service list..... | 9 | -| | Annex A – CDC service list with descriptions ..... | 13 | -| | A.1 Category A: Strategic management of CDC ..... | 13 | -| | A.2 Category B: Real-time analysis ..... | 14 | -| | A.3 Category C: Deep analysis ..... | 14 | -| | A.4 Category D: Incident response ..... | 15 | -| | A.5 Category E: Checking and evaluation ..... | 15 | -| | A.6 Category F: Collection, analysis and evaluation threat intelligence ..... | 16 | -| | A.7 Category G: Development and maintenance of CDC platforms ..... | 17 | -| | A.8 Category H: Support of internal fraud response..... | 18 | -| | A.9 Category I: Active relationship with external parties..... | 18 | -| | Bibliography..... | 20 | - -## **Introduction** - -Cybersecurity risks in an organization have significant impacts on its overall activities. The risks that organizations face are environmental changes, from both the social and business perspectives, and external pressures by regulations and increased threats. Top management, as the C-suite (CxO), is therefore responsible for managing controls for the entire organization to respond to these risks and changes. As one important aspect of implementing controls in cybersecurity, leadership in development and control security policies in alignment with business objectives is expected and is often provided by the chief security officer (CSO) or chief information security officer (CISO). In order practically to implement security measures, an entity that supports the activities of the CSO or CISO with strategic management at the organizational level is essentially required. This entity is described as a cyber defence centre (CDC) in this Recommendation. - -This Recommendation provides a framework for the build and management of a CDC, and evaluation of its effectiveness. The framework indicates how a CDC should determine and implement security services to enable the security of an organization. This framework helps an organization to address its cybersecurity risks. - -# Recommendation ITU-T 1060 - -# Framework for the creation and operation of a cyber defence centre - -# 1 Scope - -This Recommendation establishes a framework for organizations to build and manage a cyber defence centre (CDC), and to evaluate its effectiveness. The framework indicates how a CDC should determine and implement security services to enable the security of an organization. - -This Recommendation is intended for those responsible for security at the top management level of an organization, such as the chief security officer (CSO) or chief information security officer (CISO) and security supervisors who assist them. - -# 2 References - -The following ITU-T Recommendations and other references contain provisions which, through reference in this text, constitute provisions of this Recommendation. At the time of publication, the editions indicated were valid. All Recommendations and other references are subject to revision; users of this Recommendation are therefore encouraged to investigate the possibility of applying the most recent edition of the Recommendations and other references listed below. A list of the currently valid ITU-T Recommendations is regularly published. The reference to a document within this Recommendation does not give it, as a stand-alone document, the status of a Recommendation. - -None. - -# 3 Definitions - -## 3.1 Terms defined elsewhere - -This Recommendation uses the following term defined elsewhere: - -**3.1.1 outsourcing** [b-ITU-T X.1053]: When an enterprise contracts out one or more of its internal processes and/or functions to an outside company. Outsourcing moves enterprise resources to an outside enterprise and keeps a retained capability to manage the relationship with the outsourced processes. - -## 3.2 Terms defined in this Recommendation - -This Recommendation defines the following term: - -**3.2.1 cyber defence centre (CDC)**: An entity within an organization that offers security services to manage the cybersecurity risks of its business activities. - -# 4 Abbreviations and acronyms - -This Recommendation uses the following abbreviations and acronyms: - -| | | -|-------|------------------------------------------| -| APT | Advanced Persistent Threat | -| CDC | Cyber Defence Centre | -| CISO | Chief Information Security Officer | -| CSIRT | Computer Security Incident Response Team | -| CSO | Chief Security Officer | -| CxO | C-suite | - -| | | -|------|-------------------------------------------| -| IDS | Intrusion Detection System | -| IPS | Intrusion Prevention System | -| IT | Information Technology | -| SIEM | Security Information and Event Management | -| SLA | Service Level Agreement | -| WAF | Web Application Firewall | - -# 5 Conventions - -None. - -# 6 Structure of this Recommendation - -In this Recommendation, a concept of a CDC is explained in clause 7. Clause 8 provides an overview of the framework for creating and operating a CDC. The framework is described in detail in subsequent clauses: CDC build process (clause 9); CDC management process (clause 10); and CDC evaluation process (clause 11). In clause 12, an overall description of security services provided by a CDC is presented as best practice, and each service is described in further detail in Annex A. - -# 7 Overview of a cyber defence centre - -Organizations act to make their businesses successful. In order to manage risks to business activities, the CISO formulates security policies, especially from a cybersecurity perspective. A CDC is an entity that implements security policies specifically as CDC services, which consist of security activities that are performed by teams responsible for security. CDC services may specify security functions as capabilities of a system to perform security-related processing. Figure 1 shows stakeholders and their roles for CDC operation. - -![Figure 1: Stakeholders and their roles for CDC operation. The diagram shows a flow from CxOs and CISO to CDC, and then to Teams for security, which leads to Security functions. Business objectives and Security policies are also shown as inputs to CDC services.](07b17a620c75522d53916a11e12d1bff_img.jpg) - -``` - -graph TD - subgraph TopRow [Stakeholders] - CxOs((CxOs)) - CISO((CISO)) - CDC((CDC)) - Teams[Teams for security] - end - subgraph BottomRow [Outputs/Processes] - BO[Business objectives] - SP[Security policies] - CDCS[CDC services] - SF[Security functions] - end - CxOs -.->|Commit| BO - CISO -.->|Define and control| SP - CDC -.->|Define and implement| CDCS - Teams -.->|Install and maintain| SF - CDCS -.->|Specify| SF - CDCS -.->|Enable| SP - CISO -- Empower --> CDC - CDC -- Support --> CISO - CDC -- Assign --> Teams - Teams -- Support --> CDC - -``` - -X.1060(21) - -Figure 1: Stakeholders and their roles for CDC operation. The diagram shows a flow from CxOs and CISO to CDC, and then to Teams for security, which leads to Security functions. Business objectives and Security policies are also shown as inputs to CDC services. - -**Figure 1 – Stakeholders and their roles for CDC operation** - -Depending on the size and type of the organization, a CDC may be an independent unit, a committee or a small team. Regardless of its format, it should exist as an entity in the organization, and have the authority and resources to implement security services to enable the organization to be secured. Such security services should be aligned with security policies and ensure the qualities of security activities; the level of each service should be explicitly agreed by a documented arrangement, such as a service level agreement (SLA). The overall quality of a CDC security service is assessed by measures specified in clause 9.4. - -# 8 Framework for the creation and operation of a CDC - -Figure 2 shows a framework for creating and operating a CDC. The framework includes three processes: build, management, and evaluation. To ensure the organization is secured, a CDC should - -be established and appropriately managed. It should be also assessed in a timely and regular manner and continuously improve. This framework enables the organization to maintain security activities. - -In the build process, security activities in the organization should be considered. Best practice for CDC security services are listed in Annex A. An organization can establish its own service catalogue by selecting services from the list and adding services specific to the organization. Each service in the catalogue should also establish a profile that includes: owner(s), roles and responsibilities, and type of service assignments (insource, outsource or combinations). Once the service profile is established, the current and target score of each CDC service should be determined for the evaluation process. - -The management process has three phases and two cycles. The strategic management phase manages the overall activities of a CDC, the operation phase manages routine work for monitoring and analysis, and the response phase manages emergency responses. Those phases are managed in both short and long cycles; operation and response require timely resolutions in short cycles. Meanwhile, strategic management should consider long-term improvement together with output from short cycles in a long cycle. The long-term improvement typically requires decisions for new business investment and drastic modifications of system architectures. - -The evaluation process assesses the catalogue, profile and portfolio of a CDC service (see Figure 4), which should be objectively assessed at each appropriate time. - -The evaluation results should be reviewed and reflected in all three CDC processes. A recurring cycle of the build, management and evaluation processes to improve security activities should be established and maintained in the organization. - -![](367926125450c2bc3f4bdca9d59a62ba_img.jpg) - -| | | | | -|---------------------------|-------------------|---------------------------|-------------------| -| Service list | Service catalogue | Service profile | Service portfolio | -| Build process | | | | -| Evaluation process | | Management process | | -| Gap analysis | | Phases | Cycles | -| Assessment | | Strategic management | Long cycle | -| Assignment | | Operation | Short cycle | -| Recommendation level | | Response | | - -X.1060(21) - -**Figure 2 – Framework for the creation and operation of a CDC** - -# 9 Build process - -## 9.1 Overview - -The CDC has a build process to determine which security services should be implemented in the organization. The candidate services for implementation are selected from the CDC service list, which is based on best practice in the organization. For the CDC service list, see clause 12. - -Figure 3 shows the three phases to build services for a CDC. - -![Figure 3: Phases to build services for CDC. The diagram shows a sequential process starting from 'CDC service list' and moving through three phases to 'Organization specific CDC service portfolio'. Phase 1 leads to 'Organization specific CDC service catalogue', Phase 2 leads to 'Organization specific CDC service profile', and Phase 3 leads to 'Organization specific CDC service portfolio'. Below the phases are labels: 'Recommendation level' under Phase 1, 'Service assignment' under Phase 2, and 'Service assessment' under Phase 3. The reference 'X.1060(21)' is at the bottom right.](a5ee5c23b6dc52ec1d724b76d5a5f58f_img.jpg) - -``` - -graph LR - A[CDC service list] -- Phase 1 --> B[Organization specific CDC service catalogue] - B -- Phase 2 --> C[Organization specific CDC service profile] - C -- Phase 3 --> D[Organization specific CDC service portfolio] - E([Recommendation level]) --> Phase 1 - F([Service assignment]) --> Phase 2 - G([Service assessment]) --> Phase 3 - -``` - -Figure 3: Phases to build services for CDC. The diagram shows a sequential process starting from 'CDC service list' and moving through three phases to 'Organization specific CDC service portfolio'. Phase 1 leads to 'Organization specific CDC service catalogue', Phase 2 leads to 'Organization specific CDC service profile', and Phase 3 leads to 'Organization specific CDC service portfolio'. Below the phases are labels: 'Recommendation level' under Phase 1, 'Service assignment' under Phase 2, and 'Service assessment' under Phase 3. The reference 'X.1060(21)' is at the bottom right. - -**Figure 3 – Phases to build services for CDC** - -#### 1) Phase 1: Creation of a CDC service catalogue - -The organization should firstly create a CDC service catalogue. - -In this phase, the candidate services for implementation are extracted from the general service list. Details of the general list are described in clause 12. If there are missing services, such services should be newly defined and added to the CDC service catalogue. - -#### 2) Phase 2: Creation of a CDC service profile - -For the services listed in the CDC service catalogue, the organization should determine the roles and responsibilities of teams who provide the services. In this phase, the CDC service assignment described in clause 9.3 should be considered. - -The organization should thus produce the CDC service profile. - -#### 3) Phase 3: Creation of a CDC service portfolio - -After deciding the CDC service profile, the organization should measure the current service score (As-is) of each service and set a medium- or long-term target service score (To-be). - -Once the levels of As-is and To-be are set, the organization should produce the CDC service portfolio. - -Figure 4 shows an example matrix of CDC services. This matrix will be filled after phases 1 to 3. - -![Figure 4: Services matrix for a CDC. Below the table, four horizontal arrows indicate the scope of each phase: 'Service list' (shortest), 'Service catalogue' (medium), 'Service profile' (longer), and 'Service portfolio' (longest, covering the entire matrix). The reference 'X.1060(21)' is at the bottom right.](fc69ceb1dee1da7e33bd6c38fc4ceab9_img.jpg) - -| Service | Recommendation level | Service assignment | Service score | | -|--------------|----------------------|-----------------------|---------------|-------| -| | | | As-is | To-be | -| Service ex.1 | Basic | Insourcing (AB Dept.) | 3 | 5 | -| Service ex.2 | Standard | Outsourcing (Z-MSSP) | 2 | 4 | -| Service ex.3 | Advanced | Unassignable | 1 | 2 | - -Figure 4: Services matrix for a CDC. Below the table, four horizontal arrows indicate the scope of each phase: 'Service list' (shortest), 'Service catalogue' (medium), 'Service profile' (longer), and 'Service portfolio' (longest, covering the entire matrix). The reference 'X.1060(21)' is at the bottom right. - -**Figure 4 – Services matrix for a CDC** - -## 9.2 CDC service recommendation level - -To implement the most appropriate CDC services for an organization, the necessity of each service can be considered at the five levels listed in Table 1. The priority of service implementation can be clarified by measuring the levels. - -**Table 1 – CDC service recommendation level** - -| Weight | Description | -|---------------|---------------------------------------------------------------------| -| Unnecessary | Services deemed unnecessary | -| Basic | Minimum services to be implemented | -| Standard | Services that are generally recommended for implementation | -| Advanced | Services required to achieve a higher-level CDC cycle | -| Optional | Services arbitrarily selected according to the expected form of CDC | - -## 9.3 CDC service assignment - -The organization should clarify specifically which team should implement the CDC service. Depending on the capabilities to implement the services in the organization, the organization should determine CDC service assignment, which might include outsourcing. See Table 2. - -**Table 2 – CDC service assignment** - -| Type | Description | -|-------------|-----------------------------------------------------------------------------------------------------------------------------------------| -| Insourcing | Services are provided by a team within the organization. The organization should specify the team in charge. | -| Outsourcing | Services are provided by a team outside of the organization. The organization should specify the outsourcer. | -| Combination | The organization uses insourcing and outsourcing together. A responsible team and a contractor should be specified by the organization. | -| Unassigned | Although the organization recognises a service, but there is no assignee in the organization. | - -When using outsourcing, the points A) and B) should be clarified. - -#### A) Nature of information handled - -The organization should classify the nature of the information handled, including definitions or distinctions of “internal” and “external” to the organization. For example, in the case of incidents, information including the damage or impact by an attack should be considered internal, while information on the attack itself is considered to be external. - -#### B) Need for specialized security skills - -The organization should consider whether specialized skills in the security field are required to provide the service. - -CDC services can be classified into quadrants I) to IV) based on these two indicator points. See Figure 5. - -![Figure 5 – Sourcing quadrants. A 2x2 matrix with 'Necessity of security skills' on the vertical axis (Low at top, High at bottom) and information type on the horizontal axis (External (Attack) information on left, Internal (Defence) information on right). The quadrants are: Top-Left: Insourcing >= Outsourcing; Top-Right: Insourcing >> Outsourcing; Bottom-Left: Insourcing << Outsourcing; Bottom-Right: Insourcing <= Outsourcing.](d4af765160d04ecef538e5066006dc77_img.jpg) - -Figure 5 – Sourcing quadrants. A 2x2 matrix with 'Necessity of security skills' on the vertical axis (Low at top, High at bottom) and information type on the horizontal axis (External (Attack) information on left, Internal (Defence) information on right). The quadrants are: Top-Left: Insourcing >= Outsourcing; Top-Right: Insourcing >> Outsourcing; Bottom-Left: Insourcing << Outsourcing; Bottom-Right: Insourcing <= Outsourcing. - -**Figure 5 – Sourcing quadrants** - -#### **I) Insourcing >> Outsourcing** - -When security expertise is not required to handle confidential information within the organization, insourcing is optimal, and outsourcing is not preferred. - -#### **II) Insourcing >= Outsourcing** - -If the required expertise is not so high, although it is information external to the organization, activity and management should be performed mainly by the organization and with support provided by outsourcing. - -#### **III) Insourcing << Outsourcing** - -In order to deal with information, mainly on attacks, that is external to the organization, the service should be implemented by an organization with specialized skills (e.g., outsourcing). Unless experts with specialized skills are available internally, it is hard for an organization to implement the service by itself. - -#### **IV) Insourcing <= Outsourcing** - -When specialized skills are required to handle internal information within an organization, activity should be performed mainly by a specialized organization (e.g., outsourcing), which the organization should manage and support. - -## 9.4 CDC service assessment - -When the CDC service portfolio is created, the implementation status in As-is and To-be of each service should be assessed using the service scores listed in Table 3. It should be noted that different service types, e.g., insource and outsource, should be assessed by the criteria assigned for service scores. - -**Table 3 – CDC service scores** - -| For insource | | -|------------------------------------------------------------------------------------------------------------------|-----------| -| Documented operation is authorized by CISO or other organizational director who has appropriate responsibilities | +5 points | -| Operation is documented and others can play the role of existing operator | +4 points | -| Operation is not documented, and others can play the partial role of existing operator temporarily | +3 points | -| Operation is not documented, and the existing operator can play role | +2 points | -| Operation is not working | +1 point | -| Decided not to implement by insourcing | N/A | - -| For outsource | | -|---------------------------------------------------------------------------------------------|-----------| -| Content of service and expected output are understood and their outputs are as expected | +5 points | -| Content of service and expected output are understood but their outputs are not as expected | +4 points | -| Either content of service or expected output is not understood | +3 points | -| Both content of service and expected output are not understood | +2 points | -| Nether output nor report is not reviewed | +1 point | -| Decided not to implement by outsourcing | N/A | - -# 10 Management process - -CDC enables security activities throughout the organization by implementing the CDC management process including three phases and two cycles shown in Figure 6. - -![Figure 6 – CDC management process diagram showing three phases: Strategic management, Operation, and Response. A solid line labeled 'Long cycle' connects Strategic management to Operation and back. A dashed line labeled 'Short cycle' connects Operation to Response and back.](ff0952ef692c9d960ce5f6708bcc9711_img.jpg) - -``` - -graph LR - SM((Strategic management)) - OP((Operation)) - RS((Response)) - SM -- "Long cycle" --> OP - OP -- "Long cycle" --> SM - OP -. "Short cycle" .-> RS - RS -. "Short cycle" .-> OP - -``` - -X.1060(21) - -Figure 6 – CDC management process diagram showing three phases: Strategic management, Operation, and Response. A solid line labeled 'Long cycle' connects Strategic management to Operation and back. A dashed line labeled 'Short cycle' connects Operation to Response and back. - -**Figure 6 – CDC management process** - -### (1) Strategic management phase - -Strategic management has responsibility and accountability for all strategic services relevant to definitions, design, planning, management, certification, etc. that ensure the long-term development of CDC. - -### (2) Operation phase - -The maintenance of the introduced framework should be performed in the operation phase. This is the work at the ordinary or usual time and it typically includes routine activities, e.g., analysis of incident detection, and monitoring and maintenance of security response systems. The team that performs such operations is often called a security operations centre (SOC). - -### (3) Response phase - -An incident response should be executed when an event is detected by the analysis in the operation phase. This phase is always an emergency. Those responding to the incident are often called the computer security incident response team (CSIRT). - -The input to the response phase is not limited to that from the operation phase, but the team should also cover responses to reports or notifications from third parties. - -#### A) Short cycle - -Operation and response are performed daily. In those processes, problems in the business process and issues in the security response system always appear. Therefore, continuous improvement to resolve those issues, e.g., simple automation of simple tasks, improvement of tools to analyse accuracy and review of report items, are necessary within the resources (people, budget, system) allocated in a short cycle. - -#### B) Long cycle - -A review that requires the allocation of new resources should be applied to a long cycle. - -If any issues that cannot be solved by the current system are found when reviewing the short cycle, the response should be a long-term perspective and plan, e.g., the introduction of a new security product, a drastic review of security policies and a large-scale configuration change in the security systems. - -# 11 Evaluation process - -## 11.1 Overview - -The catalogue, profile and portfolio of the CDC service that are formulated in the build process should be evaluated in a timely and regular manner. Figure 7 depicts a process for evaluating CDC services. - -![Figure 7 – CDC evaluation process flowchart](f6e8acf9f931452d01688d311b5c0364_img.jpg) - -``` -graph LR; A[CDC service list] -- Phase 1 --> B[Organization specific CDC service catalogue]; B -- Phase 2 --> C[Organization specific CDC service profile]; C -- Phase 3 --> D[Organization specific CDC service portfolio]; B --> E((Gap analysis on Recommendation level)); C --> F((Gap analysis on service assignment)); D --> G((Gap analysis on service assessment)); -``` - -The diagram illustrates the CDC evaluation process. It begins with a 'CDC service list' box, which leads to an 'Organization specific CDC service catalogue' box via 'Phase 1'. This catalogue box is linked to a 'Gap analysis on Recommendation level' oval. The catalogue then leads to an 'Organization specific CDC service profile' box via 'Phase 2', which is linked to a 'Gap analysis on service assignment' oval. The profile leads to an 'Organization specific CDC service portfolio' box via 'Phase 3', which is linked to a 'Gap analysis on service assessment' oval. The identifier 'X.1060(21)' is located at the bottom right of the diagram. - -Figure 7 – CDC evaluation process flowchart - -**Figure 7 – CDC evaluation process** - -## 11.2 CDC service catalogue evaluation - -A gap analysis on the CDC service recommendation level should be performed. A review is required due to changes in the environment and threats, particularly, "unnecessary" services should be re-examined and reviewed to ensure no omissions. The CDC service catalogue should be evaluated when the business introduces changes, such as starting new business activities, and response to new risks and threats. - -## 11.3 CDC service profile evaluation - -A gap analysis on CDC service assignments should be performed. By deciding service assignments, "unassignable" can be eliminated, and the organization can expect to improve maturity level by reviewing them. The CDC service profile should be evaluated when organizational changes, such as internal organization changes for insource type and outsourcer changes for outsource type, occur. - -## 11.4 CDC service portfolio evaluation - -A gap analysis on the CDC service score of individual services should be performed. The difference between the target score in To-be and the score in As-is should be clarified so that the organization can focus on what needs to be improved, confirm the CDC service score again and extract issues. The CDC service portfolio should be evaluated on a regular basis. - -# 12 CDC service categories and service list - -The CDC service categories and list are required in the build and management processes (see clauses 9 and 10). - -CDC service has nine service categories: - -- A) strategic management of CDC; -- B) real-time analysis; -- C) deep analysis; -- D) incident response; -- E) checking and evaluation; -- F) collection, analysis and evaluation of threat intelligence; -- G) development and maintenance of CDC platforms; -- H) support of internal fraud response; -- I) active relationship with external parties. - -### A. Strategic management of CDC - -This category includes policies and resource planning for all security activities mentioned in categories A) to I) in the organization including a CDC in order to ensure its stable operation. - -### B. Real-time analysis - -This category constantly monitors and analyses logs and data from various systems, such as network devices, servers and security products. The goal is to discover threats in real time, which can lead to a rapid and appropriate incident response. - -### C. Deep analysis - -This is a category related to the incident, such as investigating the affected systems, reviewing the compromised data, and analysing the tools and methods used in the attack. - -The aim is to elucidate the full scope of the incident and identify the impact. - -### D. Incident response - -This category takes specific actions based on the results of real-time analysis and threat information to deter and eliminate threats. - -It aims to minimize the impact on the system and the business, including coordination and reporting with stakeholders. - -### E. Checking and evaluation - -This category is for vulnerability assessment of systems to be protected, and incident response training and its evaluation. The purpose of this category is to improve the level of security. - -### F. Collection, analysis and evaluation of threat intelligence - -This category collects threat information on vulnerabilities and attacks (external intelligence) that is available on the Internet and handles information on real-time analysis and incident response (internal intelligence). - -The objective is to improve the accuracy of real-time analysis and incident response, and to improve security assets. - -### G. Development and maintenance of CDC platforms - -This category manages, improves or develops new systems (e.g., security products, log collection databases and operational systems) that are necessary for security response. - -The aim is to achieve a smooth and sustainable security activities in other categories. - -### H. Support of internal fraud response - -This category collects audit data to support responses to internal fraud. - -The purpose of this category is to support response and resolution of internal fraud by providing logs and analysis. - -### I. Active relationship with external parties - -This category includes coordination and collaboration with internal stakeholders and external organizations. - -The objective is to improve the security level of the organization, increase the value of the security to the organization, thus further developing and strengthening the organization. - -Figure 8 shows service categories mapping with the management processes, and Table 4 lists the services. - -Detailed descriptions of each service in a CDC service list are provided in Annex A. - -![A hierarchical diagram of CDC service categories. It shows a cycle between Strategic management, Operation, and Response, with a long cycle and a short cycle. The diagram is divided into several main sections: A. Strategic management of CDC, B. Real-time analysis, C. Deep analysis, D. Incident response, E. Checking and evaluation, F. Collection, analysis and evaluation threat intelligence, G. Development and maintenance of CDC platforms, and H. Support of internal fraud response. Each section contains specific sub-categories and tasks.](8fbdfc3d17fb1dae7b2d8f5a287fa9fc_img.jpg) - -**I. Active relationship with external parties** - -- I-1 Awareness -- I-2 Education and training -- I-3 Security consulting -- I-4 Security vendor collaboration -- I-5 Collaboration service with external security communities -- I-6 Technical reporting -- I-7 Executive security reporting - -**Long cycle** - -**Short cycle** - -**A. Strategic management of CDC** - -| | | -|------------------------------|----------------------------------| -| A-1 Risk management | A-8 Security architecture design | -| A-2 Risk assessment | A-9 Triage criteria management | -| A-3 Policy planning | A-10 Counter measures selection | -| A-4 Policy management | A-11 Quality management | -| A-5 Business continuity | A-12 Security audit | -| A-6 Business impact analysis | A-13 Certification | -| A-7 Resource management | | - -**B. Real-time analysis** - -| | | -|--------------------------------|--------------------------------| -| B-1 Real time asset monitoring | B-3 Altering and warning | -| B-2 Event data retention | B-4 Handling enquiry on report | - -**C. Deep analysis** - -| | | -|-----------------------------|----------------------------------| -| C-1 Forensic analysis | C-3 Tracking and tracing | -| C-2 Malware sample analysis | C-4 Forensic evidence collection | - -**D. Incident response** - -| | | -|---------------------------------------|------------------------------| -| D-1 Incident report acceptance | D-5 Incident recovery | -| D-2 Incident handling | D-6 Incident notification | -| D-3 Incident classification | D-7 Incident response report | -| D-4 Incident response and containment | | - -**H. Support of internal fraud response** - -| | | -|--------------------------------------------------|----------------------------------------------------------------| -| H-1 Internal fraud response and analysis support | H-2 Internal fraud detection and recurrence prevention support | -|--------------------------------------------------|----------------------------------------------------------------| - -**F. Collection, analysis and evaluation threat intelligence** - -| | | | | | -|--------------------------|--------------------------------|----------------------------------------------------------|--------------------------------------------------------|-------------------------------------| -| F-1 Post mortem analysis | F-4 Threat intelligence report | F-2 Internal threat intelligence collection and analysis | F-3 External threat intelligence collection evaluation | F-5 Threat intelligence utilization | -|--------------------------|--------------------------------|----------------------------------------------------------|--------------------------------------------------------|-------------------------------------| - -**E. Checking and evaluation** - -| | | | | | -|------------------------------------|------------------------------|------------------------------------------------------|-----------------------|----------------------------------------------------| -| E-1 Network information collection | E-3 Vulnerability assessment | E-4 Patch management | E-8 Policy compliance | E-7 Handling capability on cyber attack evaluation | -| E-2 Asset inventory | | E-5 Penetration test | E-9 Hardening | | -| | | E-6 Defence capability against APT attack evaluation | | | - -**G. Development and maintenance of CDC platforms** - -| | | | -|------------------------------------------|-------------------------------------------------|----------------------------------------------------| -| G-1 Security architecture implementation | G-2 Basic operation for network security asset | G-3 Advanced operation for network security asset | -| | G-4 Basic operation for endpoint security asset | G-5 Advanced operation for endpoint security asset | -| G-12 Existing security tools evaluation | G-6 Basic operation for cloud security products | G-7 Advanced operation for cloud security products | -| G-13 New security tools evaluation | G-9 Basic operation for analysis platform | G-10 Advanced operation for analysis platform | -| | G-8 Deep analysis tool operation | | -| | G-11 Operates CDC systems | | - -A hierarchical diagram of CDC service categories. It shows a cycle between Strategic management, Operation, and Response, with a long cycle and a short cycle. The diagram is divided into several main sections: A. Strategic management of CDC, B. Real-time analysis, C. Deep analysis, D. Incident response, E. Checking and evaluation, F. Collection, analysis and evaluation threat intelligence, G. Development and maintenance of CDC platforms, and H. Support of internal fraud response. Each section contains specific sub-categories and tasks. - -X.1060(21) - -**Figure 8 – CDC service categories** - -**Table 4 – CDC service list** - -| A | Strategic management of CDC | F | Collection, analysis and evaluation threat intelligence | -|----------|--------------------------------------------------|----------|----------------------------------------------------------------| -| A-1 | Risk management | F-1 | Post-mortem analysis | -| A-2 | Risk assessment | F-2 | Internal threat intelligence collection and analysis | -| A-3 | Policy planning | F-3 | External threat intelligence collection and evaluation | -| A-4 | Policy management | F-4 | Threat intelligence report | -| A-5 | Business continuity | F-5 | Threat intelligence utilization | -| A-6 | Business impact analysis | G | Development and maintenance of CDC platforms | -| A-7 | Resource management | G-1 | Security architecture implementation | -| A-8 | Security architecture design | G-2 | Basic operation for network security asset | -| A-9 | Triage criteria management | G-3 | Advanced operation for network security asset | -| A-10 | Counter measures selection | G-4 | Basic operation for endpoint security asset | -| A-11 | Quality management | G-5 | Advanced operation for endpoint security asset | -| A-12 | Security audit | G-6 | Basic operation for cloud security products | -| A-13 | Certification | G-7 | Advanced operation for cloud security products | -| B | Real-time analysis | G-8 | Deep analysis tool operation | -| B-1 | Real-time asset monitoring | G-9 | Basic operation for analysis platform | -| B-2 | Event data retention | G-10 | Advanced operation for analysis platform | -| B-3 | Alerting and warning | G-11 | Operates CDC systems | -| B-4 | Handling enquiry on report | G-12 | Existing security tools evaluation | -| C | Deep analysis | G-13 | New security tools evaluation | -| C-1 | Forensic analysis | H | Support of internal fraud response | -| C-2 | Malware sample analysis | H-1 | Internal fraud response and analysis support | -| C-3 | Tracking and tracing | H-2 | Internal fraud detection and reoccurrence prevention support | -| C-4 | Forensic evidence collection | I | Active relationship with external parties | -| D | Incident response | I-1 | Awareness | -| D-1 | Incident report acceptance | I-2 | Education and training | -| D-2 | Incident handling | I-3 | Security consulting | -| D-3 | Incident classification | I-4 | Security vendor collaboration | -| D-4 | Incident response and containment | I-5 | Collaboration service with external security communities | -| D-5 | Incident recovery | I-6 | Technical reporting | -| D-6 | Incident notification | I-7 | Executive security reporting | -| D-7 | Incident response report | | | -| E | Checking and evaluation | | | -| E-1 | Network information collection | | | -| E-2 | Asset inventory | | | -| E-3 | Vulnerability assessment | | | -| E-4 | Patch management | | | -| E-5 | Penetration test | | | -| E-6 | Defence capability against APT attack evaluation | | | -| E-7 | Handling capability on cyberattack evaluation | | | -| E-8 | Policy compliance | | | -| E-9 | Hardening | | | - -# **Annex A** - -## **CDC service list with descriptions** - -(This annex forms an integral part of this Recommendation.) - -### **A.1 Category A: Strategic management of CDC** - -#### **A.1.1 A-1. Risk management** - -The risk management service is to achieve coordinated activities including A-2 to A-13 to direct and control an organization with regard to risk. - -#### **A.1.2 A-2. Risk assessment** - -The risk assessment service provides a snapshot of the risk level of an organization in terms of assets, threats and security measures. - -#### **A.1.3 A-3. Policy planning** - -The policy planning service is supporting all the activities of defining specific security policies, compiling the guidelines. - -#### **A.1.4 A-4. Policy management** - -The policy management service is to achieve periodic reviews for evaluation of policy and organization rules, to comply with new or external requirements (e.g., regulations and guidelines). - -#### **A.1.5 A-5. Business continuity** - -The business continuity service supports the operational functions necessary to ensure correct implementation and execution of the business continuity plan of an organization. - -#### **A.1.6 A-6. Business impact analysis** - -The business impact analysis service is to achieve a systematic assessment of the possible impacts resulting from various events or scenarios. This service helps organizations understand the scale of loss that could occur. It may cover not only direct financial loss, but also other impacts, such as loss of stakeholder confidence and reputational damage. - -#### **A.1.7 A-7. Resource management** - -The resource management service plans resources (personnel, budget, systems, etc.) to support security activities and allocates them appropriately to each service. - -#### **A.1.8 A-8. Security architecture design** - -The security architecture design service is to establish an architecture to secure the business. Development and maintenance of CDC platforms (category G) can be achieved by compiling various security measurements that consider system design and constraints of business processes (e.g., supply chain). - -#### **A.1.9 A-9. Triage criteria management** - -The triage criteria management service is to set specific triage (response priority) criteria for events (e.g., incidents, vulnerabilities found, threat information discovered) under the agreed scope in the overall policy. - -#### **A.1.10 A-10. Counter measures selection** - -The counter measures selection service is to support all activities of countermeasure selection for triage criteria (A-9) and of the best technologies with respect to all dispositions of security. - -#### **A.1.11 A-11. Quality management** - -The quality management service is to check problems in the quality of security activities, whether or not they have a negative impact for business (e.g., usability, productivity) over a period of time (e.g., one week or one month). - -#### **A.1.12 A-12. Security audit** - -The security audit service systematically and measurably audits how an organization implements security policies and controls at a specific site or time. CDC staff are indirectly involved in audit activities in order to provide necessary information and evidence of implemented state of controls. - -#### **A.1.13 A-13. Certification** - -The certification service supports activities necessary for an organization to conform to various standards and certification schemes. - -### **A.2 Category B: Real-time analysis** - -#### **A.2.1 B-1. Real time asset monitoring** - -The real-time asset monitoring service is to supervise and analyse systems status or suspicious activities from logs and network flows, and supporting triage as incident or event for gathering information needed. - -#### **A.2.2 B-2. Event data retention** - -The event data retention service collects and centrally stores events gathered in the process of security monitoring and analysis. - -#### **A.2.3 B-3. Alerting and warning** - -The alerting and warning service notifies the internal function involved of events that highlight potential risks to information assets (e.g., security devices alert, security bulletins, vulnerabilities and spreading threats). - -#### **A.2.4 B-4. Handling enquiry on report** - -The handling enquiry on report service is to respond to enquiries about data and reports regarding analysis. - -### **A.3 Category C: Deep analysis** - -#### **A.3.1 C-1. Forensic analysis** - -The forensic analysis service analyses digital evidence that is gathered from security assets and relates to an event to assist in determining what happened. - -#### **A.3.2 C-2. Malware sample analysis** - -The malware sample analysis service is to analyse malware, programs or scripts deployed by attackers that are found during each forensic process. - -#### **A.3.3 C-3. Tracking and tracing** - -The service is the capability of an organization to track and trace the source of any attacks on its infrastructures, which is a critical success factor to reduce further occurrences and prevent security incidents. An acknowledged ability to track and trace both internal and external attackers (e.g., cyber attribution) can pre-empt future attacks. - -#### **A.3.4 C-4. Forensic evidence collection** - -The forensic evidence collection service collects and conserves digital electronic evidence related to an assessed incident, and develops and maintains validity of evidence ("evidence chain of custody"). - -### **A.4 Category D: Incident response** - -#### **A.4.1 D-1. Incident report acceptance** - -The incident report acceptance service is to receive analytical reports of operations. However, it may receive reports from another organization within the company or from an outside organization. - -#### **A.4.2 D-2. Incident handling** - -The incident handling service is to deal with accepted incidents and coordinates activities including D-3 to D-7. - -#### **A.4.3 D-3. Incident classification** - -The incident classification service is to classify an incident to contribute to a common understanding of the types of incident that occur and what causes them. - -#### **A.4.4 D-4. Incident response and containment** - -The incident response and containment service is to contain an incident before it spreads through all resources and increases the damage to or impact on them. - -#### **A.4.5 D-5. Incident recovery** - -The incident recovery service is to support the restoration of the functionality of a target to its normal system operability. - -#### **A.4.6 D-6. Incident notification** - -The incident notification service is to communicate the occurrence of an incident to incident response teams and other concerned groups. - -#### **A.4.7 D-7. Incident response report** - -The incident response report service is to achieve the completion and distribution of the report of a closed incident response (if countermeasure efforts are protracted, it will be handed over to the strategic management of CDC (category A)). If CDC staff need a report of current status during handling of an incident, this service distributes an interim report. - -### **A.5 Category E: Checking and evaluation** - -#### **A.5.1 E-1. Network information collection** - -The network information collection service is to receive an overview of the network configuration that is to be protected. - -#### **A.5.2 E-2. Asset inventory** - -The asset inventory service is to achieve information management relevant to the census of systems, assets and applications that constitute the overall business infrastructure within the scope of CDC support. - -#### **A.5.3 E-3. Vulnerability assessment** - -The vulnerability assessment service is to examine networks, systems and applications to identify vulnerabilities, determines how they can be exploited and recommends how the risks can be mitigated. - -#### **A.5.4 E-4. Patch management** - -The patch management service is to support the installation of any security patches required, while the availability of information technology (IT) service is maintained. - -#### **A.5.5 E-5. Penetration test** - -The penetration test service is to reveal security vulnerabilities that could be exploited by attackers and highlights possible methods of compromise (e.g., threat-led penetration test). - -#### **A.5.6 E-6. Defence capability against ATP attack evaluation** - -The defence capability against advanced persistent threat (ATP) attack evaluation service is to measure the resistance of an organization to targeted attacks while conducting targeted email training and social engineering tests. - -#### **A.5.7 E-7. Handling capability on cyberattack evaluation** - -The handling capability on cyber-attack evaluation service is to confirm whether actual security response activities based on a scenario that assumes an attack has occurred can be activated and whether the incident can be brought to an end without delay (called a cyber-attack response exercise). - -#### **A.5.8 E-8. Policy compliance** - -The policy compliance service is to support the verification of conformity to and compliance with predefined security policies. - -#### **A.5.9 E-9. Hardening** - -The hardening service is to optimize IT component configuration to identify, evaluate and apply systems security configurations, and to mitigate or eliminate the risk of attacks. - -### **A.6 Category F: Collection, analysis and evaluation threat intelligence** - -#### **A.6.1 F-1. Post-mortem analysis** - -The post-mortem analysis service describes resolution of an incident to ensure review and improvement of the processes and tools for CDC staff. - -#### **A.6.2 F-2. Internal threat intelligence collection and analysis** - -The internal threat intelligence collection and analysis service is to gather information (internal intelligence) on real-time analysis and incident response. - -#### **A.6.3 F-3. External threat intelligence collection and evaluation** - -The external threat intelligence collection and evaluation service is to gather information (external intelligence), such as new vulnerabilities, attack trends, malware behaviour and malignant Internet protocol addresses or domain information. - -#### **A.6.4 F-4. Threat intelligence report** - -The threat intelligence report service is to compile internal and external threat information and document it, including all details. - -#### **A.6.5 F-5. Threat intelligence utilization** - -The threat intelligence utilization service is to achieve compilation and dissemination of threat information for all categories of security response. - -### **A.7 Category G: Development and maintenance of CDC platforms** - -#### **A.7.1 G-1. Security architecture implementation** - -The security architecture implementation service is to implement the security architecture designed by strategic management of CDC (category A) by using assets. - -#### **A.7.2 G-2. Basic operation for network security asset** - -The basic operation for network security asset service is to operate network devices, such as firewalls, intrusion detection system/intrusion prevention system (IDS/IPS), web application firewall (WAF) and proxies. - -#### **A.7.3 G-3. Advanced operation for network security asset** - -The advanced operation for network security asset service is to create custom signatures of an organization for products with attack detection capabilities, such as IDS/IPS and WAF, and applies them if the signature provided by the vendor is insufficient. - -#### **A.7.4 G-4. Basic operation for endpoint security asset** - -The basic operation for endpoint security asset service is to operate countermeasure products, such as anti-virus software, at endpoints. - -#### **A.7.5 G-5. Advanced operation for endpoint security asset** - -The advanced operation for endpoint security asset service is to detect suspicious program activity within the endpoint using its protection product, and collects and analyses registry status, process execution, etc. If needed, the service establishes customised indicators of compromise to enable endpoint detection. - -#### **A.7.6 G-6. Basic operation for cloud security products** - -The basic operation for cloud security products service is to operate security services in a cloud. - -#### **A.7.7 G-7. Advanced operation for cloud security products** - -The advanced operation for cloud security products service is to create custom signatures of an organization for security services in a cloud with attack detection capabilities. If the signature provided by a vendor is insufficient, the service applies custom signatures. - -#### **A.7.8 G-8. Deep analysis tool operation** - -The deep analysis tool operation service is to operate tools used in deep analysis, such as digital forensics and malware analysis. - -#### **A.7.9 G-9. Basic operation for analysis platform** - -The basic operation for analysis platform service is to operate analytical infrastructure that stores the log data required and enables the analysis to be performed routinely, mainly in real-time analysis, such as security information and event management (SIEM). - -#### **A.7.10 G-10. Advanced operation for analysis platform** - -The advanced operation for analysis platform service is to achieve more detailed and accurate analysis using the organization's own systems to retain system logs and packet capture data that commercial SIEMs cannot capture, and develops customized analysis algorithms and logic for these data, as well as the system. - -#### **A.7.11 G-11. Operates CDC systems** - -The operates CDC systems service is to operate systems that perform the tasks required for security response operations, such as the various security response tools previously described, the production of various reports, the response to enquiries, and the vulnerability management system. - -#### **A.7.12 G-12. Existing security tools evaluation** - -The existing security tools evaluation service is to verify the impact on other systems and operations, mainly in terms of availability, when upgrading or changing the settings of existing security-enabled tools. - -#### **A.7.13 G-13. New security tools evaluation** - -The new security tools evaluation service is to design and install new security assets, if new measures are needed in security activities. - -### **A.8 Category H: Support of internal fraud response** - -#### **A.8.1 H-1. Internal fraud response and analysis support** - -The internal fraud response and analysis support service is to support the organization responding to internal fraud when it is discovered, by organizing its activities from the logs collected by the security activities. - -#### **A.8.2 H-2. Internal fraud detection and reoccurrence prevention support** - -The internal fraud detection and reoccurrence prevention support service is to analyse the details of internal fraudulent activities that have been discovered, and considers whether it is possible to detect them from the logs, and if so, implements the detection logic. - -### **A.9 Category I: Active relationship with external parties** - -#### **A.9.1 I-1. Awareness** - -The awareness service is to precisely create awareness for the relevant staff across and in relation to the CDC, promotes the utilization of the correct tools, best practice, policies and resources to ensure protection of the business assets. - -#### **A.9.2 I-2. Education and training** - -The education and training service is to support specialized training activities in the areas of security for staff in the organizations that the CDC supports. - -#### **A.9.3 I-3. Security consulting** - -The security consulting service provides consultancy services to the various business functions with regards to security. - -#### **A.9.4 I-4. Security vendor collaboration** - -The security vendor collaboration service is to build a direct line of communication with the provider of a security product or service purchased, requests a response to any deficiencies found in the security response and exchanges positive feedback on areas for improvement. - -#### **A.9.5 I-5. Collaboration service with external security communities** - -The collaboration service with external security communities is to exchange information proactively by participating in external communities. Such information can reflect on the security activities. - -#### **A.9.6 I-6. Technical reporting** - -The technical reporting service is to provide reports of the results of monitoring and management activities. These activities help to show the security level of systems and IT infrastructure. - -#### **A.9.7 I-7. Executive security reporting** - -The executive security reporting service is to produce periodic reports and statistical analysis to top management to highlight the security level and indicators of operational performance of an organization. - -# **Bibliography** - -- [b-ITU-T X.1053] Recommendation ITU-T X.1053 (2017), *Code of practice for information security controls based on ITU-T X.1051 for small and medium-sized telecommunication organizations.* - - - -## SERIES OF ITU-T RECOMMENDATIONS - -| | | -|-----------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------| -| Series A | Organization of the work of ITU-T | -| Series D | Tariff and accounting principles and international telecommunication/ICT economic and policy issues | -| Series E | Overall network operation, telephone service, service operation and human factors | -| Series F | Non-telephone telecommunication services | -| Series G | Transmission systems and media, digital systems and networks | -| Series H | Audiovisual and multimedia systems | -| Series I | Integrated services digital network | -| Series J | Cable networks and transmission of television, sound programme and other multimedia signals | -| Series K | Protection against interference | -| Series L | Environment and ICTs, climate change, e-waste, energy efficiency; construction, installation and protection of cables and other elements of outside plant | -| Series M | Telecommunication management, including TMN and network maintenance | -| Series N | Maintenance: international sound programme and television transmission circuits | -| Series O | Specifications of measuring equipment | -| Series P | Telephone transmission quality, telephone installations, local line networks | -| Series Q | Switching and signalling, and associated measurements and tests | -| Series R | Telegraph transmission | -| Series S | Telegraph services terminal equipment | -| Series T | Terminals for telematic services | -| Series U | Telegraph switching | -| Series V | Data communication over the telephone network | -| Series X | Data networks, open system communications and security | -| Series Y | Global information infrastructure, Internet protocol aspects, next-generation networks, Internet of Things and smart cities | -| Series Z | Languages and general software aspects for telecommunication systems | \ No newline at end of file diff --git a/marked/X/T-REC-X.1400-202010-I_PDF-E/14a22f23ced8ba1d63ece69861dbaacc_img.jpg b/marked/X/T-REC-X.1400-202010-I_PDF-E/14a22f23ced8ba1d63ece69861dbaacc_img.jpg deleted file mode 100644 index b251589cf40ace6dacc78699abda475ccc29cb4a..0000000000000000000000000000000000000000 --- a/marked/X/T-REC-X.1400-202010-I_PDF-E/14a22f23ced8ba1d63ece69861dbaacc_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:f5a5181407216d035f79590e56aec9a16d90fff38afd14731b2addf225d041a7 -size 4098 diff --git a/marked/X/T-REC-X.1400-202010-I_PDF-E/367926125450c2bc3f4bdca9d59a62ba_img.jpg b/marked/X/T-REC-X.1400-202010-I_PDF-E/367926125450c2bc3f4bdca9d59a62ba_img.jpg deleted file mode 100644 index 33f13a4d06d0d13aadfd6aa90d78e62d262c568a..0000000000000000000000000000000000000000 --- a/marked/X/T-REC-X.1400-202010-I_PDF-E/367926125450c2bc3f4bdca9d59a62ba_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:ff9b6afeb131e1fed8c980bc89ef59c8786886c76668f263580a5c42d670749d -size 39813 diff --git a/marked/X/T-REC-X.1400-202010-I_PDF-E/8e14350b4b669119a3bdfca7869110ca_img.jpg b/marked/X/T-REC-X.1400-202010-I_PDF-E/8e14350b4b669119a3bdfca7869110ca_img.jpg deleted file mode 100644 index d3700119e69964afc823622cf0627b88eb44f0c7..0000000000000000000000000000000000000000 --- a/marked/X/T-REC-X.1400-202010-I_PDF-E/8e14350b4b669119a3bdfca7869110ca_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:0ba00ee365eedfe5b4940a2047a2384a886b534965bad255e298d4844483b07f -size 34533 diff --git a/marked/X/T-REC-X.1400-202010-I_PDF-E/a5ee5c23b6dc52ec1d724b76d5a5f58f_img.jpg b/marked/X/T-REC-X.1400-202010-I_PDF-E/a5ee5c23b6dc52ec1d724b76d5a5f58f_img.jpg deleted file mode 100644 index c803401513cff71c33628fb0d90171330b0af451..0000000000000000000000000000000000000000 --- a/marked/X/T-REC-X.1400-202010-I_PDF-E/a5ee5c23b6dc52ec1d724b76d5a5f58f_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:45c0467ff6f44bb1eeb73e8febfd094fa6b0667164a09c969caa253885142088 -size 39240 diff --git a/marked/X/T-REC-X.1400-202010-I_PDF-E/e9d825d87c5f85c8dba0664eace96ef4_img.jpg b/marked/X/T-REC-X.1400-202010-I_PDF-E/e9d825d87c5f85c8dba0664eace96ef4_img.jpg deleted file mode 100644 index 418bada46f551db2f7e13338527e942f9f10e4d8..0000000000000000000000000000000000000000 --- a/marked/X/T-REC-X.1400-202010-I_PDF-E/e9d825d87c5f85c8dba0664eace96ef4_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:1b150d42786ab8bac831232ed7a8de2112d133f895b0660eedadf1a49e350ffb -size 45055 diff --git a/marked/X/T-REC-X.1400-202010-I_PDF-E/raw.md b/marked/X/T-REC-X.1400-202010-I_PDF-E/raw.md deleted file mode 100644 index 76820cb5f767485009e8c686213417eec9a7ab0b..0000000000000000000000000000000000000000 --- a/marked/X/T-REC-X.1400-202010-I_PDF-E/raw.md +++ /dev/null @@ -1,546 +0,0 @@ - - -# ITU-T - -TELECOMMUNICATION -STANDARDIZATION SECTOR -OF ITU - -## X.1400 - -(10/2020) - -SERIES X: DATA NETWORKS, OPEN SYSTEM -COMMUNICATIONS AND SECURITY - -Secure applications and services (2) – Distributed ledger -technology security - -# --- **Terms and definitions for distributed ledger technology** - -Recommendation ITU-T X.1400 - -## ITU-T X-SERIES RECOMMENDATIONS DATA NETWORKS, OPEN SYSTEM COMMUNICATIONS AND SECURITY - -| | | -|--------------------------------------------------------|----------------------| -| PUBLIC DATA NETWORKS | X.1–X.199 | -| OPEN SYSTEMS INTERCONNECTION | X.200–X.299 | -| INTERWORKING BETWEEN NETWORKS | X.300–X.399 | -| MESSAGE HANDLING SYSTEMS | X.400–X.499 | -| DIRECTORY | X.500–X.599 | -| OSI NETWORKING AND SYSTEM ASPECTS | X.600–X.699 | -| OSI MANAGEMENT | X.700–X.799 | -| SECURITY | X.800–X.849 | -| OSI APPLICATIONS | X.850–X.899 | -| OPEN DISTRIBUTED PROCESSING | X.900–X.999 | -| INFORMATION AND NETWORK SECURITY | | -| General security aspects | X.1000–X.1029 | -| Network security | X.1030–X.1049 | -| Security management | X.1050–X.1069 | -| Telebiometrics | X.1080–X.1099 | -| SECURE APPLICATIONS AND SERVICES (1) | | -| Multicast security | X.1100–X.1109 | -| Home network security | X.1110–X.1119 | -| Mobile security | X.1120–X.1139 | -| Web security | X.1140–X.1149 | -| Security protocols (1) | X.1150–X.1159 | -| Peer-to-peer security | X.1160–X.1169 | -| Networked ID security | X.1170–X.1179 | -| IPTV security | X.1180–X.1199 | -| CYBERSPACE SECURITY | | -| Cybersecurity | X.1200–X.1229 | -| Countering spam | X.1230–X.1249 | -| Identity management | X.1250–X.1279 | -| SECURE APPLICATIONS AND SERVICES (2) | | -| Emergency communications | X.1300–X.1309 | -| Ubiquitous sensor network security | X.1310–X.1319 | -| Smart grid security | X.1330–X.1339 | -| Certified mail | X.1340–X.1349 | -| Internet of things (IoT) security | X.1360–X.1369 | -| Intelligent transportation system (ITS) security | X.1370–X.1389 | -| Distributed ledger technology security | X.1400–X.1429 | -| Distributed ledger technology security | X.1430–X.1449 | -| Security protocols (2) | X.1450–X.1459 | -| CYBERSECURITY INFORMATION EXCHANGE | | -| Overview of cybersecurity | X.1500–X.1519 | -| Vulnerability/state exchange | X.1520–X.1539 | -| Event/incident/heuristics exchange | X.1540–X.1549 | -| Exchange of policies | X.1550–X.1559 | -| Heuristics and information request | X.1560–X.1569 | -| Identification and discovery | X.1570–X.1579 | -| Assured exchange | X.1580–X.1589 | -| CLOUD COMPUTING SECURITY | | -| Overview of cloud computing security | X.1600–X.1601 | -| Cloud computing security design | X.1602–X.1639 | -| Cloud computing security best practices and guidelines | X.1640–X.1659 | -| Cloud computing security implementation | X.1660–X.1679 | -| Other cloud computing security | X.1680–X.1699 | -| QUANTUM COMMUNICATION | | -| Terminologies | X.1700–X.1701 | -| Quantum random number generator | X.1702–X.1709 | -| Framework of QKDN security | X.1710–X.1711 | -| Security design for QKDN | X.1712–X.1719 | -| Security techniques for QKDN | X.1720–X.1729 | -| DATA SECURITY | | -| Big Data Security | X.1750–X.1759 | -| 5G SECURITY | X.1800–X.1819 | - -*For further details, please refer to the list of ITU-T Recommendations.* - -## Recommendation ITU-T X.1400 - -# Terms and definitions for distributed ledger technology - -## Summary - -Recommendation ITU-T X.1400 contains a baseline set of terms and definitions for distributed ledger technology (DLT). The definitions provide a basic characterization of the term, and where appropriate, a note is included to provide additional clarity. - -It is based on Focus Group Technical Report ITU-T FG DLT D1.1:2019, *FG DLT D1.1 Distributed ledger technology terms and definitions*. - -## History - -| Edition | Recommendation | Approval | Study Group | Unique ID* | -|---------|----------------|------------|-------------|---------------------------------------------------------------------------| -| 1.0 | ITU-T X.1400 | 2020-10-29 | 17 | 11.1002/1000/14449 | - -## Keywords - -Distributed ledger technology, terms and definitions. - ---- - -\* To access the Recommendation, type the URL in the address field of your web browser, followed by the Recommendation's unique ID. For example, . - -## FOREWORD - -The International Telecommunication Union (ITU) is the United Nations specialized agency in the field of telecommunications, information and communication technologies (ICTs). The ITU Telecommunication Standardization Sector (ITU-T) is a permanent organ of ITU. ITU-T is responsible for studying technical, operating and tariff questions and issuing Recommendations on them with a view to standardizing telecommunications on a worldwide basis. - -The World Telecommunication Standardization Assembly (WTSA), which meets every four years, establishes the topics for study by the ITU-T study groups which, in turn, produce Recommendations on these topics. - -The approval of ITU-T Recommendations is covered by the procedure laid down in WTSA Resolution 1. - -In some areas of information technology which fall within ITU-T's purview, the necessary standards are prepared on a collaborative basis with ISO and IEC. - -## NOTE - -In this Recommendation, the expression "Administration" is used for conciseness to indicate both a telecommunication administration and a recognized operating agency. - -Compliance with this Recommendation is voluntary. However, the Recommendation may contain certain mandatory provisions (to ensure, e.g., interoperability or applicability) and compliance with the Recommendation is achieved when all of these mandatory provisions are met. The words "shall" or some other obligatory language such as "must" and the negative equivalents are used to express requirements. The use of such words does not suggest that compliance with the Recommendation is required of any party. - -## INTELLECTUAL PROPERTY RIGHTS - -ITU draws attention to the possibility that the practice or implementation of this Recommendation may involve the use of a claimed Intellectual Property Right. ITU takes no position concerning the evidence, validity or applicability of claimed Intellectual Property Rights, whether asserted by ITU members or others outside of the Recommendation development process. - -As of the date of approval of this Recommendation, ITU had not received notice of intellectual property, protected by patents, which may be required to implement this Recommendation. However, implementers are cautioned that this may not represent the latest information and are therefore strongly urged to consult the TSB patent database at . - -© ITU 2021 - -All rights reserved. No part of this publication may be reproduced, by any means whatsoever, without the prior written permission of ITU. - -## Table of Contents - -| | Page | -|------------------------------------------------------------------------|------| -| 1 Scope ..... | 1 | -| 2 References..... | 1 | -| 3 Definitions ..... | 1 | -| 4 Abbreviations and acronyms ..... | 1 | -| 5 Conventions ..... | 1 | -| 6 Terms and definitions related to distributed ledger technology ..... | 1 | -| Appendix I – Key points and rationale for DLT basic terminology ..... | 7 | -| I.1 Defining distributed ledger technology ..... | 7 | -| I.2 How does DLT operate? ..... | 7 | -| I.3 DLT actors and components..... | 7 | -| I.4 Types of DLT ..... | 8 | -| I.5 Potential use cases for DLT ..... | 8 | -| I.6 Consensus mechanisms ..... | 8 | -| I.7 Smart contracts ..... | 8 | -| Bibliography..... | 9 | - - - -## Recommendation ITU-T X.1400 - -# Terms and definitions for distributed ledger technology - -## 1 Scope - -This Recommendation contains a baseline set of terms and definitions for distributed ledger technology (DLT). The definition of each term provides a basic characterization of the term, and where appropriate, a note is included to provide additional clarity. - -## 2 References - -The following ITU-T Recommendations and other references contain provisions which, through reference in this text, constitute provisions of this Recommendation. At the time of publication, the editions indicated were valid. All Recommendations and other references are subject to revision; users of this Recommendation are therefore encouraged to investigate the possibility of applying the most recent edition of the Recommendations and other references listed below. A list of the currently valid ITU-T Recommendations is regularly published. The reference to a document within this Recommendation does not give it, as a stand-alone document, the status of a Recommendation. - -None. - -## 3 Definitions - -This clause is intentionally left blank as terms and definitions are presented in clause 6. - -## 4 Abbreviations and acronyms - -This Recommendation uses the following abbreviations and acronyms: - -| | | -|------|---------------------------------------| -| BaaS | Blockchain as a Service | -| DAO | Decentralized Autonomous Organization | -| DLT | Distributed Ledger Technology | -| DPoS | Delegated Proof of Stake | -| NFT | Nonfungible Token | - -## 5 Conventions - -None. - -## 6 Terms and definitions related to distributed ledger technology - -This Recommendation lists and defines terms related to distributed ledger technology (DLT). The rationale for defining some of the key terms and definitions is presented in Appendix I. - -**6.1 account:** Representation of an entity whose data is recorded on a distributed ledger. - -**6.2 address:** Identifier for entity(s) performing transactions or other actions in a blockchain or distributed ledger network. - -**6.3 application** [b-ITU-T Y.2091]: A structured set of capabilities, which provide value-added functionality supported by one or more services. - -**6.4 asset:** Representation of value. - -- 6.5 bitcoin:** An example of a blockchain using proof of work (see clause 6.49). -- 6.6 block:** Individual data unit of a blockchain (see clause 6.8), composed of a collection of transactions (see clause 6.65) and a block header. -- NOTE – A block may be immutable and considered as the digital entity described in clause 3.2.2 of [b-ITU-T X.1255], however, it can be applied to other networks or other computational facilities. -- 6.7 block header** [b-ISO/TC 307]: Structured data that includes a cryptographic link to the previous block unless there is no previous block. -- NOTE – A block header can also contain a timestamp, a nonce, and other distributed ledger technology (DLT) platform specific data, including a hash value of corresponding transaction records. -- 6.8 blockchain:** A type of distributed ledger (see clause 6.21) which is composed of digitally recorded data arranged as a successively growing chain of blocks with each block cryptographically linked and hardened against tampering and revision. -- 6.9 blockchain system** [b-ISO/TC 307]: A system that implements a blockchain. -- 6.10 blockchain as a service (BaaS):** A cloud service category in which the capabilities provided to the cloud service customer are to deploy and manage a blockchain network in order to enable the abilities of consensus, smart contract, transaction, crypto engine, block record storage, peer-to-peer connectivity and management using blockchain. -- 6.11 Byzantine fault tolerance:** Property that enables a system to continue operate properly even if some of its components fail or if there are intentional bad actors. -- 6.12 compliance:** Adherence to specified requirements. -- 6.13 consensus:** Agreement that a set of transactions is valid. -- 6.14 consensus mechanism:** Rules and procedures by which consensus is reached. -- 6.15 crash fault tolerance:** Property that enables a system to continue operating properly even if some of its components fail. -- 6.16 decentralized application:** Application that runs in a distributed and decentralized computing environment. -- 6.17 decentralized autonomous organization (DAO):** A digital entity that manages assets and operates autonomously in a decentralized system, but that also relies on individuals tasked to perform certain functions that the automaton itself cannot perform. -- 6.18 decentralized system** [b-ISO/TC 307]: Distributed system wherein control is distributed among the persons or organizations participating in the operation of system. -- 6.19 delegated proof of stake (DPoS):** Another approach to proof of stake (see 6.50) where a number of nodes are elected or selected to function as the block-producing full validating nodes for the network. -- 6.20 digital signature** [b-ITU-T X.800]: Data appended to, or a cryptographic transformation (see cryptography) of a data unit that allows a recipient of the data unit to prove the source and integrity of the data unit and protect against forgery, e.g., by the recipient. -- 6.21 distributed ledger:** A type of ledger (see clause 6.36) that is shared, replicated, and synchronized in a distributed and decentralized manner. -- 6.22 distributed ledger technology (DLT)** [b-ISO/TC 307]: Technology that enables the operation and use of distributed ledgers. -- 6.23 DLT system** [b-ISO/TC 307]: A system that implements a distributed ledger. -- 6.24 DLT oracle:** A service that supplies information to a distributed ledger using data from outside of the distributed ledger system. - -**6.25 fork:** Creation of two or more different versions of a distributed ledger. - -NOTE – There are two types of forks: hard fork (see clause 6.28 and Figure 1) and soft fork (see clause 6.56 and Figure 3). - -**6.26 genesis block:** The first block in a blockchain that serves to initialize the blockchain. - -**6.27 governance** [b-ITU-T Y.3514]: System of directing and controlling. - -**6.28 hard fork:** Change to the protocol or rules that result in a fork that is not backward compatible. - -![Diagram illustrating a hard fork in a blockchain. A single block 'Blocks containing transactions' (red box) branches into two paths. The top path, labeled 'BLOCKS FROM NON-UPGRADE NODES', shows three blocks 'Follows old rules' (red boxes). The bottom path, labeled 'BLOCKS FROM UPGRADE NODES', shows three blocks 'Follows new rules' (green boxes). Arrows indicate the sequence of blocks in each path.](367926125450c2bc3f4bdca9d59a62ba_img.jpg) - -BLOCKS FROM NON-UPGRADE NODES - -BLOCKS FROM UPGRADE NODES - -X.1400(20)\_F01 - -Diagram illustrating a hard fork in a blockchain. A single block 'Blocks containing transactions' (red box) branches into two paths. The top path, labeled 'BLOCKS FROM NON-UPGRADE NODES', shows three blocks 'Follows old rules' (red boxes). The bottom path, labeled 'BLOCKS FROM UPGRADE NODES', shows three blocks 'Follows new rules' (green boxes). Arrows indicate the sequence of blocks in each path. - -**Figure 1 – Hard fork** - -**6.29 hash function** [b-NIST]: A function that maps a bit string of arbitrary length to a fixed-length bit string. Approved hash functions satisfy the following properties: - -1. One-way: It is computationally infeasible to find any input that maps to any pre-specified output, and -2. Collision resistant: It is computationally infeasible to find any two distinct inputs that map to the same output - -**6.30 hashing** [b-NIST]: A method of calculating a relatively unique output (called a hash digest) for an input of nearly any size (a file, text, image, etc.). The smallest change of input, even a single bit, will result in a completely different output digest. - -**6.31 hybrid permission:** A combination of permissionless and permissioned accessibility to a distributed ledger system. - -**6.32 immutability** [b-ISO/TC 307]: Property of a distributed ledger wherein ledger records cannot be modified or removed once added to a distributed ledger. - -NOTE – Where appropriate, immutability also presumes keeping intact the order of ledger records and the links between the ledger records. - -**6.33 incentive mechanism** [b-ISO/TC 307]: Method of offering reward for some activities concerned with the operation of a distributed ledger system. - -NOTE – An example of a reward is a block reward. - -**6.34 inter ledger interoperability:** Ability of two or more distributed ledger protocols to exchange information and to use information that has been exchanged with one another. - -**6.35 intra ledger interoperability:** Ability of two or more tokens within distributed ledger platform to operate with one another. - -**6.36 ledger:** Information store that keeps final and definitive (immutable) records of transactions. - -**6.37 Merkle tree** [b-NIST]: A data structure where the data is hashed and combined until there is a singular root hash that represents the entire data structure. - -![Diagram of a Merkle tree structure. At the bottom are four data blocks: Data0, Data1, Data2, and Data3. Data0 and Data1 are hashed together to form H0 = hash(Data0, Data1). Data2 and Data3 are hashed together to form H2 = hash(Data2, Data3). H0 and H1 are hashed together to form H4 = hash(H0, H1). H2 and H3 are hashed together to form H5 = hash(H2, H3). Finally, H4 and H5 are hashed together to form the Root = hash(H4, H5). Arrows indicate the flow from data to hashes and up to the root.](a5ee5c23b6dc52ec1d724b76d5a5f58f_img.jpg) - -``` - -graph BT - Data0[Data0] --> H0[H0 = hash(Data0, Data1)] - Data1[Data1] --> H1[H1 = hash(Data2, Data3)] - Data2[Data2] --> H2[H2 = hash(Data2, Data3)] - Data3[Data3] --> H3[H3 = hash(Data0, Data1)] - H0 --> H4[H4 = hash(H0, H1)] - H1 --> H4 - H2 --> H5[H5 = hash(H2, H3)] - H3 --> H5 - H4 --> Root[Root = hash(H4, H5)] - H5 --> Root - -``` - -X.1400(20)\_F02 - -Diagram of a Merkle tree structure. At the bottom are four data blocks: Data0, Data1, Data2, and Data3. Data0 and Data1 are hashed together to form H0 = hash(Data0, Data1). Data2 and Data3 are hashed together to form H2 = hash(Data2, Data3). H0 and H1 are hashed together to form H4 = hash(H0, H1). H2 and H3 are hashed together to form H5 = hash(H2, H3). Finally, H4 and H5 are hashed together to form the Root = hash(H4, H5). Arrows indicate the flow from data to hashes and up to the root. - -**Figure 2 – Example of a Merkle tree** - -**6.38 node:** Device or process that participates in a distributed ledger network. - -NOTE – A node can store a complete or partial replica of the distributed ledger. - -**6.39 nonfungible token (NFT):** An entirely unique digital representation of an asset. - -**6.40 off-chain** [b-ISO/TC 307]: Related to a blockchain system, but located, performed or run outside that blockchain system. - -**6.41 on-chain** [b-ISO/TC 307]: Located, performed or run inside a blockchain system. - -**6.42 participant:** An actor that can access the ledger, read records or add records. - -**6.43 peer-to-peer** [b-ISO/TC 307]: Relating to, using, or being a network of equal peers that share information and resources with each other directly without relying on a central entity. - -**6.44 permission** [b-NIST]: Intended allowable user actions (e.g., participate, read, write, execute). - -**6.45 permissioned** [b-ISO/TC 307]: Requiring authorization to perform a particular activity or activities. - -**6.46 permissionless** [b-ISO/TC 307]: Not requiring authorization to perform any particular activity. - -**6.47 permissioned distributed ledger system:** Distributed ledger system in which permissions are required to maintain and operate a node. - -**6.48 permissionless distributed ledger system:** Distributed ledger system where permissions are not required to maintain and operate a node. - -NOTE – Examples of permissionless ledgers are the Bitcoin and Ethereum blockchains, where any user can join the network and start mining. - -**6.49 proof of work:** Consensus process to solve a difficult (costly, time-consuming) problem that produces a result that is easy for others to verify. - -NOTE – Producing a proof of work can be a random process with low probability so that a lot of trial and error is required on average before a valid proof of work is generated. Bitcoin uses the Hash cash proof of work system. - -**6.50 proof of stake:** Consensus process, where an existing stake in the distributed ledger system (e.g., the amount of that currency that you hold) is used to reach consensus. - -**6.51 public key cryptography** [b-ISO/IEC 2382]: Cryptography in which a public key and a corresponding private key are used for encryption and decryption, where the public key is disseminated, and the private key is known only to the key owner. - -NOTE – Users can digitally sign data with their private key, and the resulting signature can be verified by anyone using the corresponding public key. - -**6.52 public DLT system** [b-ISO/TC 307]: A distributed ledger technology (DLT) system which is accessible to the public for use. - -**6.53 private DLT system** [b-ISO/TC 307]: A distributed ledger technology (DLT) system which is accessible for use only to a limited group of DLT users. - -**6.54 sidechain** [b-ISO/TC 307]: A blockchain system that interoperates with a separate associated blockchain system to perform a specific function in relation to the associated blockchain system. - -NOTE – By convention, the original chain is normally referred to as the "main chain", while any additional blockchains which allow DLT users to transact on the main chain are referred to as "sidechains". - -**6.55 smart contract:** A program written on a distributed ledger system which encodes the rules for specific types of distributed ledger system transactions in a way that can be validated, and triggered by specific conditions. - -**6.56 soft fork:** Change to the protocol or rules that result in a fork that is backward compatible. - -![Diagram illustrating a soft fork in a blockchain system. The diagram shows two parallel chains of blocks. The top chain, labeled 'Blocks from Non-upgrade nodes', consists of four blocks: 'Follows old rules', 'Follows old rules', 'Follows old rules but violates new rules' (shaded grey), and 'Follows old rules'. The bottom chain, labeled 'Blocks from upgrade nodes', consists of three blocks: 'Follows old and new rules', 'Follows old and new rules', and 'Follows old rules'. Arrows indicate the flow of blocks. A fork occurs after the second 'Follows old rules' block in the top chain. The third block in the top chain is a forked block that follows old rules but violates new rules. The third block in the bottom chain is a block that follows both old and new rules. The diagram shows that the upgraded mining majority (bottom chain) eventually creates a block that follows old rules, which is then followed by the top chain, making the forked block stale.](8e14350b4b669119a3bdfca7869110ca_img.jpg) - -``` -graph LR - subgraph Top_Chain [Blocks from Non-upgrade nodes] - T1[Follows old rules] --> T2[Follows old rules] - T2 --> T3[Follows old rules but violates new rules] - T3 --> T4[Follows old rules] - end - subgraph Bottom_Chain [Blocks from upgrade nodes] - B1[Follows old and new rules] --> B2[Follows old and new rules] - B2 --> B3[Follows old rules] - end - T2 --> B1 - B3 --> T4 -``` - -Diagram illustrating a soft fork in a blockchain system. The diagram shows two parallel chains of blocks. The top chain, labeled 'Blocks from Non-upgrade nodes', consists of four blocks: 'Follows old rules', 'Follows old rules', 'Follows old rules but violates new rules' (shaded grey), and 'Follows old rules'. The bottom chain, labeled 'Blocks from upgrade nodes', consists of three blocks: 'Follows old and new rules', 'Follows old and new rules', and 'Follows old rules'. Arrows indicate the flow of blocks. A fork occurs after the second 'Follows old rules' block in the top chain. The third block in the top chain is a forked block that follows old rules but violates new rules. The third block in the bottom chain is a block that follows both old and new rules. The diagram shows that the upgraded mining majority (bottom chain) eventually creates a block that follows old rules, which is then followed by the top chain, making the forked block stale. - -A soft fork: Blocks violating new rules are made stale by the upgraded mining majority - -X.1400(20)\_F03 - -**Figure 3 – Soft fork (adapted from [b-BA])** - -**6.57 subchain** [b-ISO/TC 307]: Logically separate chain that can form part of a blockchain system. - -NOTE – A subchain allows for data isolation and confidentiality. - -**6.58 stateful contract:** A contract with specified states. - -**6.59 stateless contract:** A contract lacking specified states. - -**6.60 stateful execution of contract:** Execution of a program that occurs on all nodes that changes a set of bits representing value information stored on-chain within the contract itself. All nodes that contain the contract must execute the program in order to change a set of bits representing value information. - -**6.61 stateless execution of contract:** Execution of a program that occurs on an individual node (or subset of nodes) that changes a set of bits representing value information stored on-chain but apart from the contract. - -**6.62 token:** A digital representation of value on a shared distributed ledger that is owned and secured using cryptography to ensure its authenticity and prevent modification or tampering without the owner's consent. - -**6.63 token ecosystem:** A digital system or digital space where participants and users interact and coordinate with each other using tokens. - -**6.64 tokenomics (token economics):** Economics of a distributed ledger technology (DLT) based token. - -**6.65 transaction:** Whole of the exchange of information between nodes. A transaction is uniquely identified by a transaction identifier. - -**6.66 wallet:** Software and/or hardware used to generate, manage and store both private and public keys and addresses, which enable distributed ledger technology (DLT) users to transact. Some wallets may interact with smart contracts and allow single and/or multi-signature. - -## Appendix I - -### Key points and rationale for DLT basic terminology - -(This appendix does not form an integral part of this Recommendation.) - -### **I.1 Defining distributed ledger technology** - -Distributed ledger technologies (DLTs), the most prominent implementation of which is blockchain, enable large groups of nodes in distributed ledger networks to reach agreement and record information without the need for a central authority. - -### **I.2 How does DLT operate?** - -A distributed ledger is a type of ledger that is shared, replicated, and synchronized in a distributed manner. While there are currently several different types of distributed ledgers in existence, they share certain functional characteristics: a capability of ledger network's nodes to communicate directly with each other; a mechanism for nodes on the network to propose the addition of transactions to the block and for computer programs to manage processes; and a consensus mechanism by which the distributed ledger network can validate what is the agreed-upon newly added block. - -Transaction is a record of exchange status, and addresses are used in transactions to indicate nodes without revealing node itself. Wallet derives addresses from accounts and keep balance of a node's asset, such as cryptocurrencies. - -A specific feature of blockchain-based solutions, distinguishing them from other DLT solutions, is the storage of data in groups known as blocks, containing a hash of the previous block, a timestamp and transactions [b-wiki], and that each validated block is cryptographically linked to the previous block, forming an ever-growing chain of data. Instead of being stored in a central location, the ledger is distributed across the nodes which keep their own copy of it. The nodes in the network strive to agree on the same chain of blocks as new valid blocks are being added. - -Some implementations adopt an incentive mechanism to make nodes engage in publishing a block. The incentive given to a winner which succeed to publish a block is called a block reward. - -### **I.3 DLT actors and components** - -The components involved in DLT include users, DLT nodes, DLT service providers and user groups. These components may belong to a single organization or separate organizations. Figure A.1 illustrates a typical example of components of the distributed ledger technology. - -![Diagram of DLT actors and components. A central rounded rectangle labeled 'DLT' contains six nodes arranged in two columns of three. The nodes are interconnected with dashed lines representing a peer-to-peer network. On the left, four ovals labeled 'User' are connected via solid lines to the nodes in the left column. On the right, a rectangle labeled 'Service provider' is connected to the nodes in the right column. This service provider is further connected to a larger rectangle labeled 'User groups'. Below the service provider, two more ovals labeled 'User' are connected to the service provider. The diagram is indexed as X.1400(20)_FI.1.](e9d825d87c5f85c8dba0664eace96ef4_img.jpg) - -``` - -graph LR - subgraph DLT_Network [DLT] - N1[Node] - N2[Node] - N3[Node] - N4[Node] - N5[Node] - N6[Node] - N1 --- N2 --- N3 - N4 --- N5 --- N6 - N1 -.- N4 - N1 -.- N5 - N1 -.- N6 - N2 -.- N4 - N2 -.- N5 - N2 -.- N6 - N3 -.- N4 - N3 -.- N5 - N3 -.- N6 - end - U1(User) --- N1 - U2(User) --- N2 - U3(User) --- N2 - U4(User) --- N3 - SP[Service provider] --- N4 - SP --- N5 - SP --- N6 - UG[User groups] --- SP - U5(User) --- SP - U6(User) --- SP - -``` - -Diagram of DLT actors and components. A central rounded rectangle labeled 'DLT' contains six nodes arranged in two columns of three. The nodes are interconnected with dashed lines representing a peer-to-peer network. On the left, four ovals labeled 'User' are connected via solid lines to the nodes in the left column. On the right, a rectangle labeled 'Service provider' is connected to the nodes in the right column. This service provider is further connected to a larger rectangle labeled 'User groups'. Below the service provider, two more ovals labeled 'User' are connected to the service provider. The diagram is indexed as X.1400(20)\_FI.1. - -**Figure I.1 – A typical example of DLT actors and components** - -A node is an individual system within the distributed ledger. Some of the nodes known as "full nodes" store the ledger data, pass along the data to other nodes, read/write transactions and blocks, and ensure that newly added blocks are valid. A service provider is a component that offers a DLT based service to other parties by means of the service interfaces it provides. A user is a component that uses a service or consumes the output of the service provided by another component. A component may be a provider of some services and a consumer of others. A user group (e.g., groups of people and organizations) is a set of DLT system users. A distributed ledger is information in digital form that has been validated by consensus, replicated and stored in different nodes. - -### **I.4 Types of DLT** - -Permissionless distributed ledger systems are decentralized ledger platforms open to anyone validating blocks, without needing permission from any authority. Permissioned distributed ledger systems are decentralized ledger platforms where users validating blocks must be authorized. The permission can be granted depending on how a system deployed, e.g., authenticated with the accredited certificate, accepted by users, etc. - -### **I.5 Potential use cases for DLT** - -A distributed ledger technology can be used to decentralize and automate processes in a large number of sectors. The attributes of a distributed ledger technology allow for large numbers of entities or nodes, whether collaborators or competitors, to come to consensus on information and immutably store it. - -The potential use cases for a distributed ledger technology are vast. People are looking at distributed ledger technology to innovate most industries, from automotive, banking, education, energy and e-government to healthcare, insurance, law, music, art, real estate and travel. - -### **I.6 Consensus mechanisms** - -Consensus mechanisms ensure convergence towards a single, immutable version of the ledger. They allow actors on the network to agree on the information recorded on the blockchain, taking into consideration the fact that some actors can be untrustworthy or malicious. The most widespread consensus algorithms are proof-of-work, proof-of-stake and proof-of-authority. - -Distributed ledger is often referred to as decentralized because some of the consensus mechanisms work without a central authority to make decisions. All nodes in the network make decisions individually, and the decisions of each node lead to consensus for its network. - -In permissionless distributed ledger networks, usually there are numerous validating nodes competing at the same time to validate the next block. They usually do this to obtain newly generated cryptocurrency and/or network transaction fees. They are generally comprised of mutually distrusting users that may only know each other by their public addresses. - -### **I.7 Smart contracts** - -A smart contract is a computer program that is deployed using cryptographically signed transactions on the distributed ledger network (e.g., Ethereum's smart contracts, Hyperledger Fabric's chaincode). The smart contract is executed by nodes within the distributed ledger system. The results of the execution are validated by consensus and recorded on the distributed ledger. - -Smart contract automation reduces costs, lowers risks of errors, mitigates risks of fraud and potentially streamlines many business processes. - -# Bibliography - -- [b-ITU-T X.800] Recommendation ITU-T X.800 (1991) | ISO 7498-2:1991, *Security architecture for Open Systems Interconnection for CCITT applications*. -- [b-ITU-T X.1255] Recommendation ITU-T X.1255 (2013), *Framework for discovery of identity management information*. -- [b-ITU-T X.1401] Recommendation ITU-T X.1401 (2019), *Security threats to distributed ledger technology*. -- [b-ITU-T X.1402] Recommendation ITU-T X.1402 (2020), *Security framework for distributed ledger technology*. -- [b-ITU-T Y.2091] Recommendation ITU-T Y.2091 (2011), *Terms and definitions for next generation networks*. -- [b-ITU-T Y.3514] Recommendation ITU-T Y.3514 (2017), *Cloud computing - Trusted inter-cloud computing framework and requirements*. -- [b-BBG] IBM Developer, *Blockchain basics: Glossary and use cases*. - -- [b-BBT] Dinbits, *Bitcoin & blockchain terminology*. - -- [b-BA] Bisade A. (2018), *Blockchain Soft Fork & Hard Fork Explained*. -- [b-BHG] Blockchain Hub, *Glossary* - -- [b-BTG] Blockchain, *Bitcoin glossary* - -- [b-DFS] Focus Group Technical Report ITU-T FG DFS: 2017, *Digital Financial Services (DFS) Glossary*. -- [b-DIN 16597] German National Standard DIN SPEC 16597:2018, *Terminology for blockchain*. -- [b-DLT 2.1] Focus Group Technical Report ITU-T FG DLT D2.1:2019, *Distributed ledger technology use cases*. -- [b-DLT 1.1] Focus Group Technical Report ITU-T FG DLT D1.1:2019, *FG DLT D1.1 Distributed ledger technology terms and definitions*. -- [b-ISO/IEC 38500] ISO/IEC 38500:2015, *Information Technology – Governance of IT for the Organization*. -- [b-ISO/IEC 2382] ISO/IEC 2382:2015, *Information technology – Vocabulary*. -- [b-ISO/TC 307] ISO DIS 22739, *Blockchain and distributed ledger technologies – Terminology*. -- [b-NIST] NISTIR 8202:2018/10, *Blockchain Technology Overview*. -- [b-wiki] Blockchain at Wikipedia: . - - - - - -## SERIES OF ITU-T RECOMMENDATIONS - -| | | -|-----------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------| -| Series A | Organization of the work of ITU-T | -| Series D | Tariff and accounting principles and international telecommunication/ICT economic and policy issues | -| Series E | Overall network operation, telephone service, service operation and human factors | -| Series F | Non-telephone telecommunication services | -| Series G | Transmission systems and media, digital systems and networks | -| Series H | Audiovisual and multimedia systems | -| Series I | Integrated services digital network | -| Series J | Cable networks and transmission of television, sound programme and other multimedia signals | -| Series K | Protection against interference | -| Series L | Environment and ICTs, climate change, e-waste, energy efficiency; construction, installation and protection of cables and other elements of outside plant | -| Series M | Telecommunication management, including TMN and network maintenance | -| Series N | Maintenance: international sound programme and television transmission circuits | -| Series O | Specifications of measuring equipment | -| Series P | Telephone transmission quality, telephone installations, local line networks | -| Series Q | Switching and signalling, and associated measurements and tests | -| Series R | Telegraph transmission | -| Series S | Telegraph services terminal equipment | -| Series T | Terminals for telematic services | -| Series U | Telegraph switching | -| Series V | Data communication over the telephone network | -| Series X | Data networks, open system communications and security | -| Series Y | Global information infrastructure, Internet protocol aspects, next-generation networks, Internet of Things and smart cities | -| Series Z | Languages and general software aspects for telecommunication systems | \ No newline at end of file diff --git a/marked/Y/T-REC-Y.3510-201602-I_PDF-E/9c6461e1e94afae4dec455e69a2ce152_img.jpg b/marked/Y/T-REC-Y.3510-201602-I_PDF-E/9c6461e1e94afae4dec455e69a2ce152_img.jpg deleted file mode 100644 index f7cc9defa45a7390ab22e134e5c24f2dd6caef4b..0000000000000000000000000000000000000000 --- a/marked/Y/T-REC-Y.3510-201602-I_PDF-E/9c6461e1e94afae4dec455e69a2ce152_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:455fee0f9542e082979dc746ddb5d98bef23bdddbf9316a85d4be3fcc8207018 -size 183646 diff --git a/marked/Y/T-REC-Y.3510-201602-I_PDF-E/a3dc41dc3df86ea68d266af2bf95cf5b_img.jpg b/marked/Y/T-REC-Y.3510-201602-I_PDF-E/a3dc41dc3df86ea68d266af2bf95cf5b_img.jpg deleted file mode 100644 index 8423857338c7943fb53f6d62820e1de9b67a04e1..0000000000000000000000000000000000000000 --- a/marked/Y/T-REC-Y.3510-201602-I_PDF-E/a3dc41dc3df86ea68d266af2bf95cf5b_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:da9f8de1f3eacbe3b5a5a51aa159e69515d35956d070ed38c2839f2d3b43bc36 -size 4216 diff --git a/marked/Y/T-REC-Y.3510-201602-I_PDF-E/af7916c89a458fdab6c3f443217388ae_img.jpg b/marked/Y/T-REC-Y.3510-201602-I_PDF-E/af7916c89a458fdab6c3f443217388ae_img.jpg deleted file mode 100644 index f16f7f61e62503b93f6d07cbda109556aca2dc83..0000000000000000000000000000000000000000 --- a/marked/Y/T-REC-Y.3510-201602-I_PDF-E/af7916c89a458fdab6c3f443217388ae_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:5bbfe5ba39eb8969e6238f16e2d8da04b80de0fa05d0698d171c06dff7be7aea -size 155190 diff --git a/marked/Y/T-REC-Y.3510-201602-I_PDF-E/raw.md b/marked/Y/T-REC-Y.3510-201602-I_PDF-E/raw.md deleted file mode 100644 index 9a6086df2450791b0d97953dc99efcd5e565ccec..0000000000000000000000000000000000000000 --- a/marked/Y/T-REC-Y.3510-201602-I_PDF-E/raw.md +++ /dev/null @@ -1,774 +0,0 @@ - - -I n t e r n a t i o n a l   T e l e c o m m u n i c a t i o n   U n i o n - -# ITU-T - -TELECOMMUNICATION -STANDARDIZATION SECTOR -OF ITU - -# Y.3510 - -(02/2016) - -SERIES Y: GLOBAL INFORMATION -INFRASTRUCTURE, INTERNET PROTOCOL ASPECTS -AND NEXT-GENERATION NETWORKS, INTERNET OF -THINGS AND SMART CITIES - -Cloud Computing - -# --- Cloud computing infrastructure requirements - -Recommendation ITU-T Y.3510 - -## ITU-T Y-SERIES RECOMMENDATIONS - -# GLOBAL INFORMATION INFRASTRUCTURE, INTERNET PROTOCOL ASPECTS AND NEXT-GENERATION NETWORKS, INTERNET OF THINGS AND SMART CITIES - -| | | -|--------------------------------------------------------------------|----------------------| -| GLOBAL INFORMATION INFRASTRUCTURE | | -| General | Y.100–Y.199 | -| Services, applications and middleware | Y.200–Y.299 | -| Network aspects | Y.300–Y.399 | -| Interfaces and protocols | Y.400–Y.499 | -| Numbering, addressing and naming | Y.500–Y.599 | -| Operation, administration and maintenance | Y.600–Y.699 | -| Security | Y.700–Y.799 | -| Performances | Y.800–Y.899 | -| INTERNET PROTOCOL ASPECTS | | -| General | Y.1000–Y.1099 | -| Services and applications | Y.1100–Y.1199 | -| Architecture, access, network capabilities and resource management | Y.1200–Y.1299 | -| Transport | Y.1300–Y.1399 | -| Interworking | Y.1400–Y.1499 | -| Quality of service and network performance | Y.1500–Y.1599 | -| Signalling | Y.1600–Y.1699 | -| Operation, administration and maintenance | Y.1700–Y.1799 | -| Charging | Y.1800–Y.1899 | -| IPTV over NGN | Y.1900–Y.1999 | -| NEXT GENERATION NETWORKS | | -| Frameworks and functional architecture models | Y.2000–Y.2099 | -| Quality of Service and performance | Y.2100–Y.2199 | -| Service aspects: Service capabilities and service architecture | Y.2200–Y.2249 | -| Service aspects: Interoperability of services and networks in NGN | Y.2250–Y.2299 | -| Enhancements to NGN | Y.2300–Y.2399 | -| Network management | Y.2400–Y.2499 | -| Network control architectures and protocols | Y.2500–Y.2599 | -| Packet-based Networks | Y.2600–Y.2699 | -| Security | Y.2700–Y.2799 | -| Generalized mobility | Y.2800–Y.2899 | -| Carrier grade open environment | Y.2900–Y.2999 | -| FUTURE NETWORKS | Y.3000–Y.3499 | -| CLOUD COMPUTING | Y.3500–Y.3999 | -| INTERNET OF THINGS AND SMART CITIES AND COMMUNITIES | | -| General | Y.4000–Y.4049 | -| Definitions and terminologies | Y.4050–Y.4099 | -| Requirements and use cases | Y.4100–Y.4249 | -| Infrastructure, connectivity and networks | Y.4250–Y.4399 | -| Frameworks, architectures and protocols | Y.4400–Y.4549 | -| Services, applications, computation and data processing | Y.4550–Y.4699 | -| Management, control and performance | Y.4700–Y.4799 | -| Identification and security | Y.4800–Y.4899 | - -*For further details, please refer to the list of ITU-T Recommendations.* - -# Recommendation ITU-T Y.3510 - -# Cloud computing infrastructure requirements - -## Summary - -Recommendation ITU-T Y.3510 provides requirements for cloud computing infrastructure; these include the essential capabilities for processing, storage and networking resources, as well as the capabilities of resource abstraction and control. - -## History - -| Edition | Recommendation | Approval | Study Group | Unique ID* | -|---------|----------------|------------|-------------|---------------------------------------------------------------------------| -| 1.0 | ITU-T Y.3510 | 2013-05-22 | 13 | 11.1002/1000/11918 | -| 2.0 | ITU-T Y.3510 | 2016-02-13 | 13 | 11.1002/1000/12713 | - -## Keywords - -Capability, cloud computing, control, infrastructure, networking, processing, resource abstraction, storage. - ---- - -\* To access the Recommendation, type the URL in the address field of your web browser, followed by the Recommendation's unique ID. For example, . - -## FOREWORD - -The International Telecommunication Union (ITU) is the United Nations specialized agency in the field of telecommunications, information and communication technologies (ICTs). The ITU Telecommunication Standardization Sector (ITU-T) is a permanent organ of ITU. ITU-T is responsible for studying technical, operating and tariff questions and issuing Recommendations on them with a view to standardizing telecommunications on a worldwide basis. - -The World Telecommunication Standardization Assembly (WTSA), which meets every four years, establishes the topics for study by the ITU-T study groups which, in turn, produce Recommendations on these topics. - -The approval of ITU-T Recommendations is covered by the procedure laid down in WTSA Resolution 1. - -In some areas of information technology which fall within ITU-T's purview, the necessary standards are prepared on a collaborative basis with ISO and IEC. - -## NOTE - -In this Recommendation, the expression "Administration" is used for conciseness to indicate both a telecommunication administration and a recognized operating agency. - -Compliance with this Recommendation is voluntary. However, the Recommendation may contain certain mandatory provisions (to ensure, e.g., interoperability or applicability) and compliance with the Recommendation is achieved when all of these mandatory provisions are met. The words "shall" or some other obligatory language such as "must" and the negative equivalents are used to express requirements. The use of such words does not suggest that compliance with the Recommendation is required of any party. - -## INTELLECTUAL PROPERTY RIGHTS - -ITU draws attention to the possibility that the practice or implementation of this Recommendation may involve the use of a claimed Intellectual Property Right. ITU takes no position concerning the evidence, validity or applicability of claimed Intellectual Property Rights, whether asserted by ITU members or others outside of the Recommendation development process. - -As of the date of approval of this Recommendation, ITU had not received notice of intellectual property, protected by patents, which may be required to implement this Recommendation. However, implementers are cautioned that this may not represent the latest information and are therefore strongly urged to consult the TSB patent database at . - -© ITU 2016 - -All rights reserved. No part of this publication may be reproduced, by any means whatsoever, without the prior written permission of ITU. - -## Table of Contents - -| | | Page | -|----|-----------------------------------------------------------------------------------|------| -| 1 | Scope..... | 1 | -| 2 | References..... | 1 | -| 3 | Definitions ..... | 1 | -| | 3.1 Terms defined elsewhere..... | 1 | -| | 3.2 Terms defined in this Recommendation..... | 2 | -| 4 | Abbreviations and acronyms ..... | 2 | -| 5 | Conventions ..... | 3 | -| 6 | Overview of cloud infrastructure..... | 3 | -| 7 | Requirements for processing resources ..... | 4 | -| | 7.1 Physical machine requirements ..... | 4 | -| | 7.2 Virtual machine requirements ..... | 4 | -| | 7.3 Software resources provisioning requirements ..... | 5 | -| | 7.4 Time-sensitive services requirements..... | 6 | -| 8 | Requirements for networking resources ..... | 6 | -| | 8.1 General requirements for networking resources..... | 8 | -| | 8.2 Access and core transport network..... | 8 | -| | 8.3 Intra-datacentre network..... | 8 | -| | 8.4 Inter-datacentre network..... | 9 | -| 9 | Requirements for storage resources..... | 9 | -| | 9.1 Storage space ..... | 9 | -| | 9.2 Storage interface ..... | 9 | -| | 9.3 Storage management ..... | 10 | -| | 9.4 Storage availability ..... | 10 | -| | 9.5 Data de-duplication ..... | 10 | -| 10 | Requirements for resources abstraction and control..... | 10 | -| 11 | Support of emergency telecommunications..... | 11 | -| 12 | Security considerations ..... | 11 | -| | Appendix I – Overview and reference model for storage in a cloud environment..... | 12 | -| | I.1 Reference model for cloud storage..... | 12 | -| | Appendix II – Considerations on resource monitoring..... | 15 | -| | II.1 Health monitoring..... | 15 | -| | II.2 Performance monitoring..... | 15 | -| | II.3 Capacity monitoring ..... | 15 | -| | II.4 Security and compliance monitoring..... | 16 | -| | II.5 Monitoring and metering for charging and billing ..... | 16 | -| | II.6 Monitoring in support of cloud services..... | 16 | -| | Appendix III – Power management in cloud infrastructure..... | 18 | - -| | Page | -|---------------------------------------------------------|-------------| -| Appendix IV – Considerations on supporting of ETS ..... | 19 | -| Bibliography..... | 20 | - -# Recommendation ITU-T Y.3510 - -# Cloud computing infrastructure requirements - -# 1 Scope - -This Recommendation identifies requirements for cloud infrastructure to support cloud services. - -The scope of this Recommendation includes: - -- an overview of cloud computing infrastructure; -- requirements for processing resources; -- requirements for networking resources; -- requirements for storage resources; -- requirements for resource abstraction and control. - -# 2 References - -The following ITU-T Recommendations and other references contain provisions which, through reference in this text, constitute provisions of this Recommendation. At the time of publication, the editions indicated were valid. All Recommendations and other references are subject to revision; users of this Recommendation are therefore encouraged to investigate the possibility of applying the most recent edition of the Recommendations and other references listed below. A list of the currently valid ITU-T Recommendations is regularly published. The reference to a document within this Recommendation does not give it, as a stand-alone document, the status of a Recommendation. - -- | | | -|----------------|--------------------------------------------------------------------------------------------------------------------------------------| -| [ITU-T X.1601] | Recommendation ITU-T X.1601 (2015), Security framework for cloud computing . | -| [ITU-T Y.3500] | Recommendation ITU-T Y.3500 (2014) ISO/IEC 17788:2014, Information technology – Cloud computing – Overview and vocabulary . | -| [ITU-T Y.3501] | Recommendation ITU-T Y.3501 (2013), Cloud computing framework and high-level requirements . | -| [ITU-T Y.3502] | Recommendation ITU-T Y.3502 (2014) ISO/IEC 17789:2014, Information technology – Cloud computing – Reference architecture . | - -# 3 Definitions - -### 3.1 Terms defined elsewhere - -This Recommendation uses the following terms defined elsewhere: - -**3.1.1 cloud computing** [ITU-T Y.3500]: Paradigm for enabling network access to a scalable and elastic pool of shareable physical or virtual resources with self-service provisioning and administration on-demand. - -NOTE – Examples of resources include servers, operating systems, networks, software, applications, and storage equipment. - -**3.1.2 cloud service** [ITU-T Y.3500]: One or more capabilities offered via cloud computing invoked using a defined interface - -**3.1.3 cloud service customer** [ITU-T Y.3500]: Party which is in a business relationship for the purpose of using cloud services. - -NOTE – A business relationship does not necessarily imply financial agreements. - -**3.1.4 cloud service provider** [ITU-T Y.3500]: Party which makes cloud services available. - -**3.1.5 emergency telecommunications (ET)** [b-ITU-T Y.2205]: ET means any emergency related service that requires special handling from the NGN relative to other services. This includes government authorized emergency services and public safety services. - -**3.1.6 emergency telecommunications service (ETS)** [b-ITU-T E.107]: A national service providing priority telecommunications to ETS authorized users in times of disaster and emergencies. - -**3.1.7 logical resource** [b-ITU-T Y.3011]: An independently manageable partition of a physical resource, which inherits the same characteristics as the physical resource and whose capability is bound to the capability of the physical resource. - -NOTE – "independently" means mutual exclusiveness among multiple partitions at the same level. - -**3.1.8 management system** [b-ITU-T M.60]: A system with the capability and authority to exercise control over and/or collect management information from another system. - -**3.1.9 virtual resource** [b-ITU-T Y.3011]: An abstraction of physical or logical resource, which may have different characteristics from the physical or logical resource and whose capability may not be bound to the capability of the physical or logical resource. - -NOTE – "different characteristics" means simplification or extension of the resource characteristics. "different characteristics" allows the virtual resource to expose access or control methods different from the original physical or logical resource. - -### **3.2 Terms defined in this Recommendation** - -This Recommendation defines the following term: - -**3.2.1 hypervisor:** A type of system software that allows multiple operating systems to share a single hardware host. - -NOTE – Each operating system appears to have the host's processor, memory and other resources, all to itself. - -# **4 Abbreviations and acronyms** - -This Recommendation uses the following abbreviations and acronyms: - -| | | -|-------|------------------------------------------| -| CPU | Central Processing Unit | -| CSC | Cloud Service Customer | -| CSP | Cloud Service Provider | -| DFS | Distributed File System | -| DHT | Distributed Hash Table | -| DNS | Domain Name System | -| ET | Emergency Telecommunications | -| ETS | Emergency Telecommunications Service | -| I/O | Input/Output | -| iSCSI | Internet Small Computer System Interface | -| LAN | Local Area Network | -| NAS | Network Attached Storage | -| NFS | Network File System | - -| | | -|------|-------------------------| -| NTP | Network Time Protocol | -| OS | Operating System | -| QoS | Quality of Service | -| SAN | Storage Area Network | -| SLA | Service Level Agreement | -| vCPU | virtual CPU | -| VI | Virtual Infrastructure | -| VM | Virtual Machine | -| VPN | Virtual Private Network | - -# 5 Conventions - -In this Recommendation: - -The keywords "is required" indicate a requirement which must be strictly followed and from which no deviation is permitted if conformance to this document is to be claimed. - -The keywords "is prohibited" indicate a requirement which must be strictly followed and from which no deviation is permitted if conformance to this document is to be claimed. - -The keywords "is recommended" indicate a requirement which is recommended but which is not absolutely required. Thus this requirement need not be present to claim conformance. - -The keywords "can optionally" indicate an optional requirement which is permissible, without implying any sense of being recommended. This term is not intended to imply that the vendor's implementation must provide the option and the feature can be optionally enabled by the network operator/service provider. Rather, it means the vendor may optionally provide the feature and still claim conformance with the specification. - -# 6 Overview of cloud infrastructure - -In this Recommendation, cloud infrastructure includes processing, storage, networking and other hardware resources as well as software assets. - -Abstraction and control of physical resources are essential means to achieve the on-demand and elastic characteristics of cloud infrastructure. In this way, physical resources can be abstracted into virtual machines (VMs), virtual storages and virtual networks. The abstracted resources are controlled to meet cloud service customers' (CSCs) needs. - -The main characteristics of cloud infrastructure are: - -- Network centric: The cloud infrastructure consists of distributed resources including processing, storage and other hardware resources that are connected through the networks; -- On-demand resource provisioning: The cloud infrastructure dynamically provides resources according to CSCs' needs; -- Elasticity: The cloud infrastructure is capable of expanding or reducing its resources to accommodate the current workloads; -- High availability: The cloud infrastructure is capable of providing required resources under the conditions stated in the service level agreement (SLA); -- Resources abstraction: The underlying resources of cloud infrastructure (processing, storage, networking, etc.) are invisible to the CSCs. - -NOTE – For high level cloud computing requirements, please refer to [ITU-T Y.3501]. - -# **7 Requirements for processing resources** - -Processing resources are used to provide essential capabilities for cloud services and to support other system capabilities, such as resource abstraction and control, management, security and monitoring. - -The basic unit of allocation and scheduling of processing resources is a computing machine. A computing machine can be physical or virtual. The capability of a computing machine is typically expressed in terms of configuration, availability, scalability, manageability and energy consumption. - -### **7.1 Physical machine requirements** - -The physical machine requirements include: - -- It is recommended to support hardware resource virtualization. -- It is recommended to support horizontal scalability (e.g., adding more computing machines) and vertical scalability (e.g., adding more resources with a computing machine). -- It is recommended to use power optimization solutions to reduce energy consumption. - -### **7.2 Virtual machine requirements** - -The virtual machine provides a virtualized and isolated computing environment for each guest operating system (OS). - -The virtual machine requirement includes: - -- It is required to support migration of virtual machines between different physical computing machines. - -#### **7.2.1 CPU virtualization** - -The central processing unit (CPU) virtualization allows running multiple virtual CPUs (vCPU) on a single physical CPU. - -The CPU virtualization requirement includes: - -- The virtual machine's vCPUs' computing capability can optionally be specified as a fraction of a physical CPU. - -#### **7.2.2 Memory virtualization** - -The memory virtualization includes memory allocation at the start of a virtual machine, memory utilization monitoring during virtual machine operation and memory release at the shutdown of a virtual machine. - -The memory virtualization requirement includes: - -- It is recommended that while a virtual machine is active, the hypervisor monitors memory usage and reallocates unused memory to other virtual machines dynamically. - -#### **7.2.3 Input/Output device virtualization** - -The Input/Output (I/O) virtualization allows division of the physical I/O device into several logical instances for use by different virtual machines. - -The I/O device virtualization requirements include: - -- It is required for the hypervisor to support I/O virtualization capabilities. -- It is required that a virtual machine is capable of using virtual I/O devices abstracted from the physical I/O devices. -- The number of virtual I/O devices is prohibited from being constrained by the number of physical I/O devices. - -- The data of one virtual machine transferred through a shared physical I/O device is prohibited from being exposed to other virtual machines. -- Physical I/O devices can optionally be shared by multiple virtual machines. - -#### **7.2.4 Network interface virtualization** - -Network interface virtualization allows creating and deleting a virtual network interface for a guest virtual machine OS regardless of the number of physical network interfaces. - -The network interface virtualization requirements include: - -- It is recommended that a physical network interface can be virtualized into multiple virtual network interfaces. -- It is recommended that the virtual network interfaces from different virtual machines can be grouped into one virtual local network. - -#### **7.2.5 Duplication of virtual machine** - -The duplication of a virtual machine allows creating new virtual machines and virtual machine backup in the execution environment. - -The duplication of a virtual machine requirement includes: - -- A virtual machine can optionally be duplicated to create a new virtual machine with the same configuration. - -#### **7.2.6 Dynamic migration of virtual machine** - -The dynamic migration of a virtual machine is designed to provide service continuity and reliability dynamically. - -The dynamic migration of virtual machine requirements include: - -- It is required that the network configuration of migrated virtual machines remain unchanged after migration. -- It is recommended that cloud service providers (CSPs) support the dynamic migration of a virtual machine. - -#### **7.2.7 Static migration of virtual machine** - -The static migration of a virtual machine means moving the virtual machine between different physical machines which results in the operating system rebooting. - -The static migration of a virtual machine requirement includes: - -- It is required that CSPs support static migration. - -#### **7.2.8 Management automation** - -The management system may perform operations such as starting or stopping a virtual machine, rebooting a server and applying software updates automatically. - -The management automation requirement with regard to virtual machines includes: - -- It is recommended that CSPs automate provision, activation, deactivation and other operations over the lifetime of virtual machines. - -### **7.3 Software resources provisioning requirements** - -The software resources include the software for building cloud infrastructure resource pools and the software in support of service implementation. - -#### **7.3.1 Automated provisioning and deployment** - -The automated provisioning and deployment of software resources can reduce provisioning time and the workload for deployment. - -The automated provisioning and deployment requirements include: - -- It is recommended that software resources (e.g., executable files, drivers, libraries, documents, icons, etc.) are packaged into encapsulated files, which can be provisioned and deployed automatically. -- It is recommended that software resources be automatically provisioned and deployed to target devices or platforms without operator intervention. - -#### **7.3.2 Unified software resource management** - -Unified software resource management includes capabilities for licence information registration, allocation, recovery, expiration notification and metering. - -The unified software resource management requirement includes: - -- It is recommended that CSPs manage software licences in a unified manner. - -### **7.4 Time-sensitive services requirements** - -Time-sensitive services (e.g., real-time communications using voice and video media) requirements include: - -- It is required to prioritize resource allocation to time-sensitive processing. -- It is required to apply clock settings best practices (e.g., based on the network time protocol (NTP) [b-IETF RFC 5905]). - -# **8 Requirements for networking resources** - -Typically, there are several types of networks involved in cloud computing services delivery and composition, such as the intra-datacentre network and inter-datacentre network, as well as the access and core transport network, etc. - -To illustrate the cloud computing network concepts described in this Recommendation, a generic network model, which supports cloud computing infrastructure, is shown in Figure 8-1. - -![Figure 8-1: Generic network model for cloud infrastructure. The diagram illustrates a multi-tier network architecture. At the top, a 'Service access interface' connects to a 'Resource abstractor and controller'. This controller manages two 'Cloud infrastructure' blocks (Cloud infrastructure 1 and Cloud infrastructure 2). Each cloud infrastructure contains an 'Intra-datacentre network' with 'Virtual datacentre' components and a 'Network management system'. These are interconnected via an 'Inter-datacentre network'. A central 'Access and core transport network' (orange cloud) connects various users: a 'Remote user' via 'VPN', a 'Mobile user' via 'Wireless', a 'Branch office' via 'Leased line', a 'Customer's datacentre' via 'Leased line', and a 'Home user' via 'xDSL'. A 'Virtual machine cluster' is shown at the bottom, connected to the transport network. A reference 'Y.3510(13)_F8-1' is noted at the bottom right of the cloud infrastructure blocks.](af7916c89a458fdab6c3f443217388ae_img.jpg) - -Figure 8-1: Generic network model for cloud infrastructure. The diagram illustrates a multi-tier network architecture. At the top, a 'Service access interface' connects to a 'Resource abstractor and controller'. This controller manages two 'Cloud infrastructure' blocks (Cloud infrastructure 1 and Cloud infrastructure 2). Each cloud infrastructure contains an 'Intra-datacentre network' with 'Virtual datacentre' components and a 'Network management system'. These are interconnected via an 'Inter-datacentre network'. A central 'Access and core transport network' (orange cloud) connects various users: a 'Remote user' via 'VPN', a 'Mobile user' via 'Wireless', a 'Branch office' via 'Leased line', a 'Customer's datacentre' via 'Leased line', and a 'Home user' via 'xDSL'. A 'Virtual machine cluster' is shown at the bottom, connected to the transport network. A reference 'Y.3510(13)\_F8-1' is noted at the bottom right of the cloud infrastructure blocks. - -**Figure 8-1 – Generic network model for cloud infrastructure** - -The generic network model shown in Figure 8-1 consists of the following blocks: - -- 1) **Intra-datacentre network:** The network connecting local cloud infrastructures, such as the datacentre local area network used to connect servers, storage arrays and L4-L7 devices (e.g., firewalls, load balancers, application acceleration devices). -- 2) **Access and core transport network:** The network used by CSCs to access and consume cloud services deployed by the CSP. -- 3) **Inter-datacentre network:** The network interconnecting remote cloud infrastructures. These infrastructures may be owned by the same or different CSPs; an inter-datacentre network primarily supports the following two scenarios: - - **Workload migration**, which means moving workloads from an enterprise datacentre to a CSP datacentre, or moving workloads from CSP to CSP (for resilience and maintenance). - - **Server clustering** which allows transactions and storage replication for the business continuity. - -Examples of inter-datacentre network models include: - -- 1) private cloud datacentre to private cloud datacentre -- 2) private cloud datacentre to CSP datacentre - -3) CSP datacentre to CSP datacentre. - -NOTE 1 – For a description of a private cloud, please refer to [ITU-T Y.3500]. - -A centralized resource abstraction and control ensures the overall management of the cloud environment with: - -- a) Network management systems that are dedicated to network service providers. The processes supported by network management systems include management and maintenance of the network inventory and the configuration of network components, as well as fault management. -- b) Cloud management systems are dedicated to CSPs. Cloud management systems support processes for maintenance, monitoring and configuration of cloud infrastructure resources. - -NOTE 2 – Requirements for resource abstraction and control are provided in clause 10. - -### **8.1 General requirements for networking resources** - -General requirements provided in this clause apply to networking resources of the access and core transport networks, intra-datacentre networks as well as inter-datacentre networks. - -The general requirements for networking resources include: - -- Networking resources (e.g., bandwidth, number of ports, network addresses) are required to be scalable; -- Networking resources are required to ensure services' performance and availability in order to meet SLA objectives; -- Networking resources are required to be able to adapt dynamically to the traffic generated by cloud services; -- Networking resources are required to support IPv4 and IPv6; -- Networking resources are recommended to support policy based control on flow by flow basis in a fine-grained manner. - -### **8.2 Access and core transport network** - -The access and core transport network is used to connect the CSC to the CSP for the use of cloud services. - -The access and core transport network requirement includes: - -- It is recommended that the access and core transport network supports the delivery of cloud services in an optimal way in terms of performance, scalability and agility (e.g., through network programmability). - -### **8.3 Intra-datacentre network** - -The intra-datacentre network is used to connect local datacentre cloud infrastructures, such as servers, storage arrays and L4-L7 devices (e.g., firewalls, load balancers, application acceleration devices). - -The intra-datacentre network requirements include: - -- The intra-datacentre network is recommended to provide appropriate means to cope with flexible network address space demands. -- The intra-datacentre network is recommended to provide elastic addressing for multi-tenant users. -- The intra-datacentre network is recommended to support different security policies for particular virtual machines. - -- The intra-datacentre network is recommended to support different QoS policies for particular virtual machines. -- The intra-datacentre network is recommended to support the dynamic migration of virtual machines. -- The intra-datacentre network is recommended to support the traffic monitoring among virtual machines and network ports if needed. -- The intra-datacentre network is recommended to be able to provide multi-paths for particular multi-tenant users. -- The intra-datacentre network is recommended to support the establishment of a logical network among virtual machines. -- The intra-datacentre network is recommended to support public IP address and private IP address mapping. -- The intra-datacentre network is recommended to support dynamic DNS and static DNS for multi-tenant users. -- The intra-datacentre network is recommended to support network services (e.g., firewall, load balancer, virtual private network (VPN) services) for multi-tenant users. - -### **8.4 Inter-datacentre network** - -The inter-datacentre network is used to interconnect different cloud infrastructures. These infrastructures may be owned by the same or different CSPs. - -The inter-datacenter network requirements include: - -- The inter-datacentre network is recommended to support the scalability to match the demand level of public and private clouds. -- The inter-datacentre network is recommended to be resilient; -- The inter-datacentre network is recommended to deal with virtual machine network addresses overlapping; -- The inter-datacentre network is recommended to support different logical networks. - -## **9 Requirements for storage resources** - -This clause provides requirements for storage resources. - -NOTE – An example of a reference model for storage resources is provided in Appendix I. - -### **9.1 Storage space** - -The storage space requirement includes: - -- It is required to support dynamic storage space expansion. - -### **9.2 Storage interface** - -The storage interface requirements include: - -- The storage resources are required to support either block storage interfaces or file system interfaces. -- The storage resources are recommended to support object storage accessed via web service data path interfaces. -- The storage resources are recommended to support structured data-sharing access interfaces. -- The storage resources can optionally support multiple types of interfaces. - -### **9.3 Storage management** - -The storage management requirements include: - -- It is required to provide the capabilities for user authentication and authorization. -- It is required to provide management capabilities for storage resources. -- It is required to provide basic configuration capabilities, including storage domain configuration, file system namespace configuration, storage resources configuration and local file system configuration. -- It is recommended to provide performance monitoring and statistics (e.g., disk I/O speed, disk space usage, CPU utilization, memory utilization, job completion). -- It is recommended to support alert capabilities, e.g., for event and trouble reporting. -- It is recommended to provide replication, archive and retention capabilities. - -### **9.4 Storage availability** - -The storage availability requirements include: - -- It is required to monitor data loss or failure. -- It is recommended to provide data backup and data recovery. -- It is recommended to provide data verification capabilities. -- It is recommended to support access through legitimate channels without time constraints, as well as the geographical constraints. -- It is recommended to support data synchronization to keep data consistency. - -### **9.5 Data de-duplication** - -The data de-duplication is a method of reducing storage usage by eliminating redundant data. The data de-duplication can save resources of storage space and network bandwidth to transfer data. - -The data de-duplication requirement includes: - -- It is recommended for storage resources to support the data de-duplication capability. - -# **10 Requirements for resources abstraction and control** - -Resources abstraction and control allows a CSP to access physical resources through software abstraction. It also provides composition, coordination, monitoring and scheduling of processing, storage and networking resources. - -Resources abstraction and control directs the creation, modification, customization and release of abstracted resources. Resource abstraction and control is also responsible for controlling the interactions between resource pools and cloud services. A resource template refers to a set of standardized formatted hardware and software configuration settings for processing, storage and networking resources. - -The resources abstraction and control requirements include: - -- It is recommended that abstracted resources can be accessed and provisioned in a unified manner. -- It is recommended that abstracted resources are discovered, used and released through unified interfaces. -- It is recommended that abstracted resources are deployed and provisioned based on pre-defined policies. -- It is required to provide life-cycle management of resource templates (e.g., resource template creation, publication, activation, revocation and deletion). - -- A resource template can optionally be applied to a group of resources at the same time. -- It is required to support monitoring of all physical and virtual resources. -- It is recommended that resource monitoring is capable of detecting the failures of resources. - -# **11 Support of emergency telecommunications** - -Under emergency telecommunications (ET) [b-ITU-T Y.2205], any emergency-related service is understood as requiring special handling relative to other services. - -If any component in the cloud infrastructure is used to support an emergency telecommunications service (ETS), the requirements in [b-ITU-T Y.1271] are relevant. - -## **12 Security considerations** - -It is recommended that the security requirements of [b-ITU-T Y.2201], [b-ITU-T Y.2701] and the applicable X, Y and M series of ITU-T security Recommendations be taken into consideration; this includes access control, authentication, data confidentiality, communications security, data integrity, availability and privacy. - -Security aspects for consideration within cloud computing environment are addressed by security challenges for CSPs, as described in [ITU-T X.1601]. In particular, [ITU-T X.1601] analyses security threats and challenges and describes security capabilities that could mitigate these threats and meet security challenges. - -# **Appendix I** - -## **Overview and reference model for storage in a cloud environment** - -(This appendix does not form an integral part of this Recommendation.) - -Storage resources are used to store a huge amount of data. The traditional storage system utilizes a tightly-coupled symmetry reference model which aims to work out high performance computing problems and may fulfil cloud computing scalability requirements. The next generation system adopts a loosely-coupled asymmetry reference model which centralizes metadata and controls manipulation. This reference model is not suitable for high performance computing; however, this design is to solve large capacity storage needs based on cloud computing deployment. - -The applications and data in cloud environments need be delivered and maintained reliably using a tightly-coupled architecture. Other applications (e.g., search engines, media streaming) may rely on loosely-coupled architecture. - -### **I.1 Reference model for cloud storage** - -Cloud storage delivers virtualized storage on demand over a network based on cluster, grid and distributed file systems. When the key issue of operation and processing in cloud computing is the storage and management of large-scale data, a large number of storage equipment need to be deployed. Hence, cloud storage is a cloud computing system for data storage and management. - -Figure I.1 depicts the cloud storage reference model. - -![Figure I.1 – Cloud storage reference model diagram. The diagram is divided into three horizontal sub-layers: The access sub-layer, The presenting sub-layer, and The infrastructure sub-layer. The access sub-layer shows five client types at the top: Block storage client, Filesystem client, Database/Table client, Object storage client, and Other client (e.g., XAM client). Below them are protocols: FC, iSCSI, FCOE, LUNs; CIFS, NFS, WebDAV; JDBC, ODBC, XML; CRUD operations via HTTP; and Other (e.g., XAM, VIM). These connect to 'User identification and access', 'Application interfaces', and 'Network access equipment'. The presenting sub-layer contains three clouds: SAN service cloud, NAS service cloud, and Backup disaster recovery service cloud. The infrastructure sub-layer features an 'Infrastructure monitor cluster' of four servers. Below it are two detailed infrastructure blocks. The left block, for file access, includes 'Virtual volume management', 'File access interfaces: CIFS, NFS, WebDAV', and components like NAS, DFS, and Backup, categorized into 'Storage infrastructure' and 'Backup infrastructure'. The right block, for block services, includes 'Virtual volume management', 'Block service interfaces such as FC, iSCSI, FCOE, LUNs', and components like SAN, BC, and Backup, also categorized into 'Storage infrastructure' and 'Backup infrastructure'.](9c6461e1e94afae4dec455e69a2ce152_img.jpg) - -Figure I.1 – Cloud storage reference model diagram. The diagram is divided into three horizontal sub-layers: The access sub-layer, The presenting sub-layer, and The infrastructure sub-layer. The access sub-layer shows five client types at the top: Block storage client, Filesystem client, Database/Table client, Object storage client, and Other client (e.g., XAM client). Below them are protocols: FC, iSCSI, FCOE, LUNs; CIFS, NFS, WebDAV; JDBC, ODBC, XML; CRUD operations via HTTP; and Other (e.g., XAM, VIM). These connect to 'User identification and access', 'Application interfaces', and 'Network access equipment'. The presenting sub-layer contains three clouds: SAN service cloud, NAS service cloud, and Backup disaster recovery service cloud. The infrastructure sub-layer features an 'Infrastructure monitor cluster' of four servers. Below it are two detailed infrastructure blocks. The left block, for file access, includes 'Virtual volume management', 'File access interfaces: CIFS, NFS, WebDAV', and components like NAS, DFS, and Backup, categorized into 'Storage infrastructure' and 'Backup infrastructure'. The right block, for block services, includes 'Virtual volume management', 'Block service interfaces such as FC, iSCSI, FCOE, LUNs', and components like SAN, BC, and Backup, also categorized into 'Storage infrastructure' and 'Backup infrastructure'. - -**Figure I.1 – Cloud storage reference model** - -NOTE – The interfaces and protocols shown in Figure I.1 are examples used for illustrative purposes. - -Cloud storage is the cooperating operation of multiple storage devices, multi-applications and multi-services. Not every storage system can be called cloud storage. A cloud storage system can provide functionalities such as a storage area network (SAN), network attached storage (NAS), data backup and disaster recovery. - -As shown in Figure I.1, the cloud storage reference model is composed of three sub-layers which are described in the following clauses. - -#### I.1.1 Infrastructure sub-layer - -This sub-layer consists of the following 3 parts: - -- The storage infrastructure is composed of common used storage devices such as fibre channel storage devices, NAS and Internet small computer system interface (iSCSI) [b-IETF RFC 3720] storage devices, as well as some related supporting appliances, such as switches for storage. Storage infrastructure will typically consist of several distributed working nodes to support high availability and reliability. A working node can include a virtual volume management element, an NAS and a distributed file system (DFS) device. - -Another type of working node can include a virtual volume management element, a SAN and a block control device. - -- The backup infrastructure is composed of a physical type library, a virtual type library, a database and related software. -- The infrastructure monitor cluster is composed of many servers which manage and monitor all kinds of storage and backup devices, repair related links and check the redundancy and carry out centralized management. It can include a global schedule function to provide the resources location in the storage infrastructure depending on the received accessing requests and associated requested resources. The servers typically support distributed hash table (DHT) networking to provide a general accessing interface for name space management, load balance, metadata management, routing management and duplication management. The infrastructure monitor cluster can access virtual volume management elements of the storage infrastructure to realize unified volume management and policy management. - -#### **I.1.2 Presenting sub-layer** - -This sub-layer is the core of the service logic of the cloud storage system. It provides several storage services, such as services based on SAN or NAS, as well as backup disaster recovery services. - -SAN and NAS-based services provide key storage services for the management of cloud storage, detection and repair of the faulty links, status monitoring and QoS. - -Backup disaster recovery services supply high-level data protection making unnecessary the use of a specialized disaster recovery network. - -#### **I.1.3 Access sub-layer** - -This sub-layer consists of storage-based application interfaces, network access equipment, user identification functions and other relevant access functions. Once authenticated and authorized, users make use of the cloud storage services, such as those based on the network file system (NFS) [b-IETF RFC 3530] or iSCSI [b-IETF RFC 3720]. - -The access sub-layer connects users to the presenting sub-layer through the use of private or public networks. - -# Appendix II - -## Considerations on resource monitoring - -(This appendix does not form an integral part of this Recommendation.) - -This appendix provides considerations on resource monitoring. - -### II.1 Health monitoring - -Health monitoring of the cloud infrastructure includes monitoring the status of resources such as the physical server hardware, hypervisor, virtual machine, physical and virtual network switches and routers and storage systems. - -A resource map displays all of the technology components, including transactions, applications, web servers, network switches, virtualized components and third-party cloud services. Having such a map can play an important role in effective business service management because when there is an application or transaction problem, it can help pinpoint the infrastructure components that may be playing a role in service disruptions. - -In addition, the resource map is important to provide run-time monitoring, because cloud infrastructure is constantly changing. It is necessary to ensure the management of this resource map on a continuous basis. Non-intrusive probes can be used to automatically detect infrastructure, application and transaction changes in near real-time. - -### II.2 Performance monitoring - -Basic performance monitoring looks at the CPU, memory, storage and network performance metrics from the VM guest OS, as well as from the hypervisor. These metrics typically get monitored even in non-virtualized environments. The virtualization-specific metrics could be for specific entities that are introduced by various virtualization technologies. The behaviour of other virtualization features can also be measured as metrics, such as how frequently VM migrations are occurring or when other availability features are engaged. Then there are specialized applications built by virtualization, for example, desktop virtualization. Monitoring for such solutions needs more parameters to be collected from the VM, as well as the hypervisor, for example, how quickly VMs are provisioned to a requesting end user. - -### II.3 Capacity monitoring - -Resource utilization is continuously evolving. Therefore, the continuous planning of various resources such as servers, desktops, networks, storage and also many kinds of software is needed. This demands periodic audits of physical and virtual resources. Capacity monitoring needs end-to-end continuous capacity monitoring of the following key metrics: - -- **Server utilization:** Peak and average server resource utilization, memory, CPU, resource, server bottlenecks and correlation with a number of VMs. -- **Memory usage:** Memory utilization on each server, capacity bottlenecks and relationship with a number of VMs and with different cloud services. -- **Network usage:** Peak and average network utilization, capacity/bandwidth bottlenecks and relationship with a number of VMs and with different cloud services. -- **Storage utilization:** Overall storage capacity metrics, VM and virtual disk utilization, I/O performance metrics, snapshot monitoring and correlation with a number of VMs and with different cloud services. - -### II.4 Security and compliance monitoring - -Virtualization introduces a new set of security risks due to VM sprawl and the introduction of new threat targets such as the hypervisor layer, virtual infrastructure (VI) configurations and potential conflicts in the way access control is managed and policies are applied. Security and compliance monitoring becomes critical for securing the virtualized environment. Security and compliance monitoring needs end-to-end VI activity monitoring for: - -- **VM sprawl:** Metrics to monitor VM activities as they get cloned, copied and, due to network migration, transfers to different storage media. -- **Configuration metrics:** Virtual server configuration monitoring to ensure that they are compliant with standards and hardening guidelines, VM configuration monitoring for software licensing policy enforcement and VI events that help enforce and detect violations of policy. This includes individual security and organization security policy monitoring. -- **Access control:** Access control monitoring and reports for role-based access control enforcement. -- **Compliance monitoring:** Metrics to validate audit and certification. - -### II.5 Monitoring and metering for charging and billing - -In a virtualized environment the infrastructure is centralized and it is important to measure resource usage by different CSCs. This information can be used to distribute, amortize and in some cases, recover the cost correctly across the organization through a proper chargeback mechanism. Chargeback could be based on dynamic parameters such as resource usage and/or fixed parameters. To compute the correct chargeback information in a dynamic virtualized environment, it is important to monitor virtual and physical resource usage and allocations, as well as to be able to normalize the measurement across the cloud infrastructure. The monitoring and metering data for service charging should be collected and kept according to SLA objectives. - -Chargeback monitoring needs end-to-end VI activity monitoring and service usage metering for: - -- **Standard metrics:** All chargeable resource metrics like CPU usage, memory usage, storage usage and network usage metrics. -- **Key VI events:** VI events for virtual resource life-cycle events like start date and end date of VM creation and allocation. -- **Configuration monitoring:** VM configuration in terms of assigned resources and reservations and also applications installed to account for software licensing costs. -- **VM usage metrics:** VM uptime, number of VMs can vary depending on how the charging model is employed in the organization. - -### II.6 Monitoring in support of cloud services - -The need for application and service monitoring is important in the cloud computing environment, especially for SLA/QoS evaluation because the application or service may have problems even if the VM or the physical server on which it is running looks normal. Application and service needs to monitor the basic health of application servers with the help of application-specific response time and throughput metrics. The analytics on this data could be used to correlate the application-observed and service-observed metrics to all layers of the infrastructure to perform a root-cause analysis in the event something going wrong. Application and service performance monitoring using the capture of network traffic is used more and more commonly in this area. - -There are a few other aspects to virtual infrastructure monitoring that add to the complexity of building a comprehensive monitoring solution. All kinds of virtualization software allow the API to be able to collect metrics. However, each kind of virtualization software has its own object models. There are wide differences in features and even the behaviour of the common features. Therefore, the analytics that are to be built on the collected metrics must be developed for each kind of virtualization software. - -# **Appendix III** - -## **Power management in cloud infrastructure** - -(This appendix does not form an integral part of this Recommendation.) - -Datacentres are amongst the highest consumers of electricity all over the world. One distinct advantage of cloud computing is it is also able to power-manage hardware and devices. Therefore, the resources in a cloud infrastructure are recommended to be dynamically power-managed. The resources in cloud infrastructure are often arranged in trees. As some resources of a cloud infrastructure become idle, it can decrease power twigs or branches on trees. As the resource usage trends of cloud infrastructure are measured and controlled, it would be possible for these networks to put energy back into the grid by providing the grid with accurate time-based predictions of energy use. The grid can use this information to redirect energy to other destinations, or make other intelligent decisions. - -Power management in cloud infrastructure represents a collection of processes and supporting technologies geared towards optimizing datacentre performance against cost and structural constraints. This includes increasing the deployable number of servers per rack when racks are subject to power or thermal limitations and making power consumption more predictable and easier to plan for. - -Power management in cloud infrastructure comes in two categories: static and dynamic. Static power management deals with fixed power caps to manage aggregate power, while policies under dynamic power management take advantage of additional degrees of freedom inherent in virtualized cloud datacentres, as well as the dynamic behaviours supported by advanced platform power management technologies. - -# Appendix IV - -## Considerations on supporting of ETS - -(This appendix does not form an integral part of this Recommendation.) - -[b-ITU-T Y.1271] specifies the network requirements and capabilities to support ETS over both circuit-switched and packet-switched networks. Annex A of [b-ITU-T Y.1271] contains the list of functional requirements and categorizes them as essential and optional. Support for these requirements is needed for the scenario of when an ETS is offered by the CSP. - -The requirements in [b-ITU-T Y.1271] can be separated into those relevant to the networking resources and those relevant to core transport network(s). Some requirements are applicable both for resources and for transport network(s). This clause considers the requirements for the networking resources category using the general requirements in clauses 8.1 and 8.2. The requirements relevant for networking resources from [b-ITU-T Y.1271] include: enhanced priority treatment, location confidentiality, restorability, interoperability, survivability/endurability, scalable bandwidth, reliability/availability and preferential treatment in congestion control measurement. - -A cloud supporting ETS needs to be robust and able to support customers despite widespread damage. Another requirement is the restoration of access to cloud infrastructure resources including links connecting to the cloud. The processing nodes (virtual or physical) are to be restored quickly if damage to infrastructure resources occurs. - -Cloud infrastructure resources need to adapt quickly for emergency applications, an adaptation that equates to application acceleration as noted in clause 8.1. Because ETS have requirements for different policies (QoS, security, traffic), the migration requirements in clause 8.1.5 are necessary to guarantee the SLAs among ETS customers and their CSPs. - -The requirements, from [b-ITU-T Y.1271], specifically relevant to the support of ETS in core networks include: secure networks, restorability, network connectivity, mobility, coverage, survivability (connections), voice and data transmission, scalable bandwidth and reliability. Some of these requirements are applicable to both networking resources and the core transport network. - -The requirements of clause 8.1, in relation to ETS, apply to ubiquitous coverage and therefore have the potential to preclude the need to establish special facilities after the occurrence of an emergency or disaster. - -Reliability considerations of clause 8.1, in relation to ETS, are necessary for the network infrastructure to support survivability and endurability. - -In support of ETS, the network should be smart enough for high priority applications. Some aspects of cloud services may be applicable to the offerings of priority services to facilitate disaster recovery functions, such as locating survivors and providing vital situational awareness information to government first responders and relatives of survivors affected by a disaster. Cloud computing can support complex modelling, analysis and rendering images to the first responders of disasters. [b-Tohoku] - -Rapid authentication of authorized users for ETS implies awareness of the user/terminal attributes (subscriber profile data) and at the same time prevents unauthorized access, denial of service attacks and protection from intrusion. - -# Bibliography - -- [b-ITU-T E.107] Recommendation ITU-T E.107 (2007), *Emergency Telecommunications Service (ETS) and interconnection framework for national implementations of ETS*. -- [b-ITU-T M.60] Recommendation ITU-T M.60 (1993), *Maintenance terminology and definitions*. -- [b-ITU-T Q.1741.7] Recommendation ITU-T Q.1741.7 (2011), *IMT-2000 references to Release 9 of GSM-evolved UMTS core network*. -- [b-ITU-T Y.1271] Recommendation ITU-T Y.1271 (2014), *Framework(s) on network requirements and capabilities to support emergency telecommunications over evolving circuit-switched and packet-switched networks*. -- [b-ITU-T Y.2201] Recommendation ITU-T Y.2201 (2009), *Requirements and capabilities for ITU-T NGN*. -- [b-ITU-T Y.2205] Recommendation ITU-T Y.2205 (2011), *Next Generation Networks – Emergency telecommunications – Technical considerations*. -- [b-ITU-T Y.2701] Recommendation ITU-T Y.2701 (2007), *Security requirements for NGN release 1*. -- [b-ITU-T Y.3011] Recommendation ITU-T Y.3011 (2012), *Framework of network virtualization for future networks*. -- [b-IETF RFC 3530] IETF RFC 3530 (2003), *Network File System (NFS) version 4 Protocol*. -- [b-IETF RFC 3720] IETF RFC 3270 (2004), *Internet Small Computer Systems Interface (iSCSI)*. -- [b-IETF RFC 5905] IETF RFC 5905 (2010), *Network Time Protocol Version 4: Protocol and Algorithms Specification*. -- [b-Tohoku] ACCJ (2011), *Responding to the Greater Tohoku Disaster: The Role of the Internet and Cloud Computing in Economic Recovery and Renewal*. ACCJ Internet Economy Task Force. - - - -## SERIES OF ITU-T RECOMMENDATIONS - -| | | -|-----------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------| -| Series A | Organization of the work of ITU-T | -| Series D | General tariff principles | -| Series E | Overall network operation, telephone service, service operation and human factors | -| Series F | Non-telephone telecommunication services | -| Series G | Transmission systems and media, digital systems and networks | -| Series H | Audiovisual and multimedia systems | -| Series I | Integrated services digital network | -| Series J | Cable networks and transmission of television, sound programme and other multimedia signals | -| Series K | Protection against interference | -| Series L | Environment and ICTs, climate change, e-waste, energy efficiency; construction, installation and protection of cables and other elements of outside plant | -| Series M | Telecommunication management, including TMN and network maintenance | -| Series N | Maintenance: international sound programme and television transmission circuits | -| Series O | Specifications of measuring equipment | -| Series P | Terminals and subjective and objective assessment methods | -| Series Q | Switching and signalling | -| Series R | Telegraph transmission | -| Series S | Telegraph services terminal equipment | -| Series T | Terminals for telematic services | -| Series U | Telegraph switching | -| Series V | Data communication over the telephone network | -| Series X | Data networks, open system communications and security | -| Series Y | Global information infrastructure, Internet protocol aspects, next-generation networks, Internet of Things and smart cities | -| Series Z | Languages and general software aspects for telecommunication systems | \ No newline at end of file diff --git a/marked/Y/T-REC-Y.4420-202107-I_PDF-E/14a22f23ced8ba1d63ece69861dbaacc_img.jpg b/marked/Y/T-REC-Y.4420-202107-I_PDF-E/14a22f23ced8ba1d63ece69861dbaacc_img.jpg deleted file mode 100644 index 94d45ee0d7450a0c276bffad33306ce1ec96de62..0000000000000000000000000000000000000000 --- a/marked/Y/T-REC-Y.4420-202107-I_PDF-E/14a22f23ced8ba1d63ece69861dbaacc_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:c981deef08fa0ff69264e0a06c61f5dd291a362fb37303b3216e33a0ba5040e9 -size 5841 diff --git a/marked/Y/T-REC-Y.4420-202107-I_PDF-E/4801720824e4b5e2361a5564f91cfb70_img.jpg b/marked/Y/T-REC-Y.4420-202107-I_PDF-E/4801720824e4b5e2361a5564f91cfb70_img.jpg deleted file mode 100644 index 07543620fff01aca41d32059125456d2d622f4c4..0000000000000000000000000000000000000000 --- a/marked/Y/T-REC-Y.4420-202107-I_PDF-E/4801720824e4b5e2361a5564f91cfb70_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:9b16afa6e68571b56be01e3f48350495dec8a47e158c3de164866440bd99f6c3 -size 65781 diff --git a/marked/Y/T-REC-Y.4420-202107-I_PDF-E/898fb89a50d9ec1dfb4e425c816976a7_img.jpg b/marked/Y/T-REC-Y.4420-202107-I_PDF-E/898fb89a50d9ec1dfb4e425c816976a7_img.jpg deleted file mode 100644 index a943f14f5bac668867f7ef339ca7d72709092fa2..0000000000000000000000000000000000000000 --- a/marked/Y/T-REC-Y.4420-202107-I_PDF-E/898fb89a50d9ec1dfb4e425c816976a7_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:8392d7667f60aa6264b47a65bc0f25d56c83f47c7d6684e53432eaa4cc16c624 -size 24590 diff --git a/marked/Y/T-REC-Y.4420-202107-I_PDF-E/a33da0f14e456f92539ce3e9b7d81f9a_img.jpg b/marked/Y/T-REC-Y.4420-202107-I_PDF-E/a33da0f14e456f92539ce3e9b7d81f9a_img.jpg deleted file mode 100644 index 810690e3b709ee63a7a95047a7b0440fdacdbf6f..0000000000000000000000000000000000000000 --- a/marked/Y/T-REC-Y.4420-202107-I_PDF-E/a33da0f14e456f92539ce3e9b7d81f9a_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:3fd2bd83c4198b389eecaa9704664ce120101671784e5ffb9c9dc721a1ce5d9e -size 42582 diff --git a/marked/Y/T-REC-Y.4420-202107-I_PDF-E/af7916c89a458fdab6c3f443217388ae_img.jpg b/marked/Y/T-REC-Y.4420-202107-I_PDF-E/af7916c89a458fdab6c3f443217388ae_img.jpg deleted file mode 100644 index a49e04002b642ad1b22d7d9ec57b4cca9c8d4334..0000000000000000000000000000000000000000 --- a/marked/Y/T-REC-Y.4420-202107-I_PDF-E/af7916c89a458fdab6c3f443217388ae_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:033403b22e4c6707214182735225847b79fe47d01c97e8212e1644d9efb62b68 -size 94006 diff --git a/marked/Y/T-REC-Y.4420-202107-I_PDF-E/b6671cfafda3820aafe9a24fa7a4d8c7_img.jpg b/marked/Y/T-REC-Y.4420-202107-I_PDF-E/b6671cfafda3820aafe9a24fa7a4d8c7_img.jpg deleted file mode 100644 index 88745844a3862eadabb8d27cd849751bec728d70..0000000000000000000000000000000000000000 --- a/marked/Y/T-REC-Y.4420-202107-I_PDF-E/b6671cfafda3820aafe9a24fa7a4d8c7_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:de8e0e99c6650eccb50ee256826c365cce036e6d1a86492d4ba0221d8b34c3bc -size 68429 diff --git a/marked/Y/T-REC-Y.4420-202107-I_PDF-E/d4af765160d04ecef538e5066006dc77_img.jpg b/marked/Y/T-REC-Y.4420-202107-I_PDF-E/d4af765160d04ecef538e5066006dc77_img.jpg deleted file mode 100644 index caf04cbf2bdf29e0942ccd371f6a2cf704a1a1c5..0000000000000000000000000000000000000000 --- a/marked/Y/T-REC-Y.4420-202107-I_PDF-E/d4af765160d04ecef538e5066006dc77_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:061582b6be0a2fd1ced988e13b1bf4d8ff20dc80f228659a04568144f00a89be -size 91274 diff --git a/marked/Y/T-REC-Y.4420-202107-I_PDF-E/e6df2733626a85205c1db682e6259c46_img.jpg b/marked/Y/T-REC-Y.4420-202107-I_PDF-E/e6df2733626a85205c1db682e6259c46_img.jpg deleted file mode 100644 index 6510f7b8d4f566f9f1b963adfbf41d4e31b5e0da..0000000000000000000000000000000000000000 --- a/marked/Y/T-REC-Y.4420-202107-I_PDF-E/e6df2733626a85205c1db682e6259c46_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:aeb94e93f86c703e390e94be3b18455383ca444ce2e3e3f42b575abb13d5ae02 -size 102227 diff --git a/marked/Y/T-REC-Y.4420-202107-I_PDF-E/ebff22fb5dd6f50a90e44dca0f82f285_img.jpg b/marked/Y/T-REC-Y.4420-202107-I_PDF-E/ebff22fb5dd6f50a90e44dca0f82f285_img.jpg deleted file mode 100644 index 22700ed8ed0d8bc9256bb7338520c7690c3c2962..0000000000000000000000000000000000000000 --- a/marked/Y/T-REC-Y.4420-202107-I_PDF-E/ebff22fb5dd6f50a90e44dca0f82f285_img.jpg +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:8f6c6198c096090d81dd00b23b88833d07455b99f06c1a95d92a89ec30769f80 -size 131389 diff --git a/marked/Y/T-REC-Y.4420-202107-I_PDF-E/raw.md b/marked/Y/T-REC-Y.4420-202107-I_PDF-E/raw.md deleted file mode 100644 index 06fac168ce1145b990bd881cda0998e242508632..0000000000000000000000000000000000000000 --- a/marked/Y/T-REC-Y.4420-202107-I_PDF-E/raw.md +++ /dev/null @@ -1,606 +0,0 @@ - - -# ITU-T - -TELECOMMUNICATION -STANDARDIZATION SECTOR -OF ITU - -## Y.4420 - -(07/2021) - -SERIES Y: GLOBAL INFORMATION -INFRASTRUCTURE, INTERNET PROTOCOL ASPECTS, -NEXT-GENERATION NETWORKS, INTERNET OF -THINGS AND SMART CITIES - -Internet of things and smart cities and communities – -Frameworks, architectures and protocols - -# --- **Framework of Internet of things based monitoring and management for lifts** - -Recommendation ITU-T Y.4420 - -## ITU-T Y-SERIES RECOMMENDATIONS - -## GLOBAL INFORMATION INFRASTRUCTURE, INTERNET PROTOCOL ASPECTS, NEXT-GENERATION NETWORKS, INTERNET OF THINGS AND SMART CITIES - -## GLOBAL INFORMATION INFRASTRUCTURE - -| | | -|-------------------------------------------|-------------| -| General | Y.100–Y.199 | -| Services, applications and middleware | Y.200–Y.299 | -| Network aspects | Y.300–Y.399 | -| Interfaces and protocols | Y.400–Y.499 | -| Numbering, addressing and naming | Y.500–Y.599 | -| Operation, administration and maintenance | Y.600–Y.699 | -| Security | Y.700–Y.799 | -| Performances | Y.800–Y.899 | - -## INTERNET PROTOCOL ASPECTS - -| | | -|--------------------------------------------------------------------|---------------| -| General | Y.1000–Y.1099 | -| Services and applications | Y.1100–Y.1199 | -| Architecture, access, network capabilities and resource management | Y.1200–Y.1299 | -| Transport | Y.1300–Y.1399 | -| Interworking | Y.1400–Y.1499 | -| Quality of service and network performance | Y.1500–Y.1599 | -| Signalling | Y.1600–Y.1699 | -| Operation, administration and maintenance | Y.1700–Y.1799 | -| Charging | Y.1800–Y.1899 | -| IPTV over NGN | Y.1900–Y.1999 | - -## NEXT GENERATION NETWORKS - -| | | -|-------------------------------------------------------------------|---------------| -| Frameworks and functional architecture models | Y.2000–Y.2099 | -| Quality of Service and performance | Y.2100–Y.2199 | -| Service aspects: Service capabilities and service architecture | Y.2200–Y.2249 | -| Service aspects: Interoperability of services and networks in NGN | Y.2250–Y.2299 | -| Enhancements to NGN | Y.2300–Y.2399 | -| Network management | Y.2400–Y.2499 | -| Computing power networks | Y.2500–Y.2599 | -| Packet-based Networks | Y.2600–Y.2699 | -| Security | Y.2700–Y.2799 | -| Generalized mobility | Y.2800–Y.2899 | -| Carrier grade open environment | Y.2900–Y.2999 | - -## FUTURE NETWORKS - -### CLOUD COMPUTING - -### BIG DATA - -### QUANTUM KEY DISTRIBUTION NETWORKS - -### INTERNET OF THINGS AND SMART CITIES AND COMMUNITIES - -| | | -|---------------------------------------------------------|----------------------| -| General | Y.4000–Y.4049 | -| Definitions and terminologies | Y.4050–Y.4099 | -| Requirements and use cases | Y.4100–Y.4249 | -| Infrastructure, connectivity and networks | Y.4250–Y.4399 | -| Frameworks, architectures and protocols | Y.4400–Y.4549 | -| Services, applications, computation and data processing | Y.4550–Y.4699 | -| Management, control and performance | Y.4700–Y.4799 | -| Identification and security | Y.4800–Y.4899 | -| Evaluation and assessment | Y.4900–Y.4999 | - -For further details, please refer to the list of ITU-T Recommendations. - -## Recommendation ITU-T Y.4420 - -# Framework of Internet of things based monitoring and management for lifts - -## Summary - -Recommendation ITU-T Y.4420 describes a framework of Internet of things (IoT) based monitoring and management for lifts, including a protocol and a data model. Lifts need to interact with applications through communication networks to provide different kinds of services to end users. In many cases, lifts cannot connect to communication networks directly. Therefore, gateways support the interconnection of such lifts with communication networks. Correspondingly, various lift companies also apply their own data models and protocols. For this reason, interoperability problems have occurred, and therefore this framework will facilitate IoT based monitoring and management for lifts to operate in conjunction with each other. - -## History - -| Edition | Recommendation | Approval | Study Group | Unique ID* | -|---------|----------------|------------|-------------|---------------------------------------------------------------------------| -| 1.0 | ITU-T Y.4420 | 2021-07-14 | 20 | 11.1002/1000/14737 | - -## Keywords - -Internet of things (IoT), lift, management, monitoring. - ---- - -\* To access the Recommendation, type the URL in the address field of your web browser, followed by the Recommendation's unique ID. For example, . - -## FOREWORD - -The International Telecommunication Union (ITU) is the United Nations specialized agency in the field of telecommunications, information and communication technologies (ICTs). The ITU Telecommunication Standardization Sector (ITU-T) is a permanent organ of ITU. ITU-T is responsible for studying technical, operating and tariff questions and issuing Recommendations on them with a view to standardizing telecommunications on a worldwide basis. - -The World Telecommunication Standardization Assembly (WTSA), which meets every four years, establishes the topics for study by the ITU-T study groups which, in turn, produce Recommendations on these topics. - -The approval of ITU-T Recommendations is covered by the procedure laid down in WTSA Resolution 1. - -In some areas of information technology which fall within ITU-T's purview, the necessary standards are prepared on a collaborative basis with ISO and IEC. - -## NOTE - -In this Recommendation, the expression "Administration" is used for conciseness to indicate both a telecommunication administration and a recognized operating agency. - -Compliance with this Recommendation is voluntary. However, the Recommendation may contain certain mandatory provisions (to ensure, e.g., interoperability or applicability) and compliance with the Recommendation is achieved when all of these mandatory provisions are met. The words "shall" or some other obligatory language such as "must" and the negative equivalents are used to express requirements. The use of such words does not suggest that compliance with the Recommendation is required of any party. - -## INTELLECTUAL PROPERTY RIGHTS - -ITU draws attention to the possibility that the practice or implementation of this Recommendation may involve the use of a claimed Intellectual Property Right. ITU takes no position concerning the evidence, validity or applicability of claimed Intellectual Property Rights, whether asserted by ITU members or others outside of the Recommendation development process. - -As of the date of approval of this Recommendation, ITU had received notice of intellectual property, protected by patents/software copyrights, which may be required to implement this Recommendation. However, implementers are cautioned that this may not represent the latest information and are therefore strongly urged to consult the appropriate ITU-T databases available via the ITU-T website at . - -© ITU 2021 - -All rights reserved. No part of this publication may be reproduced, by any means whatsoever, without the prior written permission of ITU. - -## Table of Contents - -| | Page | -|------------------------------------------------------------------------------|------| -| 1 Scope ..... | 1 | -| 2 References..... | 1 | -| 3 Definitions ..... | 1 | -| 3.1 Terms define elsewhere..... | 1 | -| 3.2 Terms defined in this Recommendation..... | 2 | -| 4 Abbreviations and acronyms ..... | 2 | -| 5 Conventions ..... | 2 | -| 6 Overview of IoT based monitoring and management for lift..... | 2 | -| 7 Architecture of IoT based monitoring and management for lift..... | 4 | -| 7.1 General architecture of IoT gateway and application for lift ..... | 4 | -| 7.2 Architecture of IoT gateway for lift ..... | 5 | -| 7.3 Architecture of IoT application for lifts ..... | 6 | -| 8 Protocol and data model for IoT based lift monitoring and management ..... | 7 | -| 8.1 Protocol for lift monitoring and management ..... | 8 | -| 8.2 Data model for lift monitoring and management ..... | 9 | -| Appendix I – Use cases of IoT based monitoring and management for lift ..... | 13 | -| I.1 Lift emergency notification ..... | 13 | -| I.2 Lift monitoring in smart building..... | 13 | -| Bibliography..... | 15 | - - - -# Recommendation ITU-T Y.4420 - -# Framework of Internet of things based monitoring and management for lifts - -## 1 Scope - -This Recommendation provides a framework of Internet of things (IoT) based monitoring and management for lift. The scope of this Recommendation includes: - -- Overview of IoT based monitoring and management for lift; -- Architecture of IoT based monitoring and management for lift; -- Protocol and data model for IoT based lift monitoring and management. - -Use cases of IoT based monitoring and management for lifts are provided in an appendix. - -## 2 References - -The following ITU-T Recommendations and other references contain provisions which, through reference in this text, constitute provisions of this Recommendation. At the time of publication, the editions indicated were valid. All Recommendations and other references are subject to revision; users of this Recommendation are therefore encouraged to investigate the possibility of applying the most recent edition of the Recommendations and other references listed below. A list of the currently valid ITU-T Recommendations is regularly published. The reference to a document within this Recommendation does not give it, as a stand-alone document, the status of a Recommendation. - -[ITU-T Y.4101] Recommendation ITU-T Y.4101/Y.2067 (2017), *Common requirements and capabilities of a gateway for Internet of things applications*. - -## 3 Definitions - -### 3.1 Terms define elsewhere - -This Recommendation uses the following terms defined elsewhere: - -**3.1.1 device** [b-ITU-T Y.4000]: With regard to the Internet of things, this is a piece of equipment with the mandatory capabilities of communication and the optional capabilities of sensing, actuation, data capture, data storage and data processing. - -**3.1.2 gateway** [ITU-T Y.4101]: A unit in the Internet of things which interconnects the devices with the communication networks. It performs the necessary translation between the protocols used in the communication networks and those used by devices. - -**3.1.3 Internet of things (IoT)** [b-ITU-T Y.4000]: A global infrastructure for the information society, enabling advanced services by interconnecting (physical and virtual) things based on existing and evolving interoperable information and communication technologies. - -NOTE 1 – Through the exploitation of identification, data capture, processing, and communication capabilities, the IoT makes full use of things to offer services to all kinds of applications, whilst ensuring that security and privacy requirements are fulfilled. - -NOTE 2 – From a broader perspective, the IoT can be perceived as a vision with technological and societal implications. - -**3.1.4 sensor** [b-ITU-T L.1301]: A device that transforms a physical value (e.g., temperature, current) into an electrical or logical unit. The sensor can be directly connected with a data stream to the management system or via a conversion device. - -### **3.2 Terms defined in this Recommendation** - -This Recommendation defines the following term: - -**3.2.1 lift:** A type of vertical transportation that moves people or goods between floors (levels, decks) of a building, vessel, or other structures. - -## **4 Abbreviations and acronyms** - -This Recommendation uses the following abbreviations and acronyms: - -| | | -|----------|------------------------------------------| -| CAN | Controller Area Network | -| CCTV | Closed Circuit Television | -| CoAP | Constrained Application Protocol | -| ELMP-485 | Elevator Monitoring Protocol over RS-485 | -| GW | Gateway | -| HTTP | Hypertext Transfer Protocol | -| IoT | Internet of Things | -| LPWA | Low-Power Wide-Area | -| MQTT | Message Queuing Telemetry Transport | -| NB-IoT | Narrowband IoT | -| PLC | Programmable Logic Controller | -| RS-232 | Recommended Standard 232 | -| RS-485 | Recommended Standard 485 | - -## **5 Conventions** - -None. - -## **6 Overview of IoT based monitoring and management for lift** - -A lift is a type of vertical transport device that is powered by electric motors that drive traction cables and counterweight systems like a hoist. A lift moves people or goods between floors of a building or other structures. Additionally, a lift is composed of several sensors and a control board for controlling the lift movements. - -![Figure 1: Overview of lift monitoring and management system. The diagram illustrates the integration of a lift system in a building with various monitoring and management systems. On the left, the 'Lift system in building' includes an interphone, emergency call and SMART interface device, lift gateway, control board, motor, car, floor, and lift internal communication (CAN, serial). It also shows 'Sensors for lift' (CCTV, and so on.) and a 'Legacy lift monitoring system' (Monitoring, BMS or home network). These connect to the 'Internet'. On the right, the 'Internet' connects to 'Cloud services' (Third party data science, Cloud platform for lift (IoT application)), a 'Remote monitoring system for lift (IoT application)' (Communication server, DB, Video server), and a 'Customer centre' (24 hour monitoring and diagnosis service (Data, voice, video), Lift vendor branches, Customer).](ebff22fb5dd6f50a90e44dca0f82f285_img.jpg) - -\* BMS: Building management system - -Y.4420(21) - -Figure 1: Overview of lift monitoring and management system. The diagram illustrates the integration of a lift system in a building with various monitoring and management systems. On the left, the 'Lift system in building' includes an interphone, emergency call and SMART interface device, lift gateway, control board, motor, car, floor, and lift internal communication (CAN, serial). It also shows 'Sensors for lift' (CCTV, and so on.) and a 'Legacy lift monitoring system' (Monitoring, BMS or home network). These connect to the 'Internet'. On the right, the 'Internet' connects to 'Cloud services' (Third party data science, Cloud platform for lift (IoT application)), a 'Remote monitoring system for lift (IoT application)' (Communication server, DB, Video server), and a 'Customer centre' (24 hour monitoring and diagnosis service (Data, voice, video), Lift vendor branches, Customer). - -**Figure 1 – Overview of lift monitoring and management system** - -Figure 1 describes an overview of the lift monitoring and management system. The control board and other components in the lift are connected by serial and controller area network (CAN) [b-CiA 102] communication. The legacy lift monitoring system is installed for the purpose of integrating monitoring and management of lifts in a building. In addition, it connects to lifts using serial and CAN communication. It is configured to enable network function and stores information on the remote server. Several lift vendors install remote monitoring systems for lifts. This system is operated for lift monitoring and management. Devices such as closed circuit television (CCTV) [b-ITU-T X.1114] installed in the lift are directly linked to the network and used for data transmission to a remote server or monitoring. - -However, the legacy lift monitoring system has an issue with other devices or other vendor lifts interworking in the building. This is due to the lift industry using its own communication protocols and data models for communication between the lift control board and other components in the lift. In addition to this, communication methods are also used to connect with the legacy lift monitoring system. Therefore, when installing lifts in buildings for various companies, it is difficult to integrate, manage and monitor these lifts. - -IoT based monitoring and management for the lift using lift gateway (GW) shown in Figure 1 have the following advantages. It can interwork with other lift vendors and other devices in the building. Moreover, it can use a variety of existing IoT applications. To this end, lifts need to interact with applications through communication networks to provide different kinds of services to end users. In many cases, lifts also cannot connect to communication networks directly. Therefore, gateways support the interconnection of such lifts with communication networks. Correspondingly, various lift companies apply their own data models and protocols. For this reason, interoperability problems have occurred. Thus, this Recommendation describes a framework of IoT based monitoring and management for lift with a protocol and data model to solve these problems. - -## 7 Architecture of IoT based monitoring and management for lift - -### 7.1 General architecture of IoT gateway and application for lift - -Figure 2 describes a general architecture in which sensors or control boards in the lift are interworking with IoT applications. Resource constrained sensors are connected to the control board. Furthermore, the lift gateway is the connecting element between control boards and IoT applications. However, several full resource sensors or control boards can also be directly connected to IoT applications. Therefore, sensor data are transferred to the IoT application directly or collected in the IoT application through the gateway in Figure 2. - -![Figure 2: IoT based monitoring and management for lift. The diagram shows two types of architectures: Type 1 (Through a lift gateway) and Type 2 (Directly connect).](e6df2733626a85205c1db682e6259c46_img.jpg) - -The diagram illustrates two types of IoT architectures for lift monitoring and management: - -- Type 1: Through a lift gateway**: A dashed box labeled "Lift system in building" contains a solid box labeled "Device (Lift)". Inside the "Device (Lift)" box, there are three "Sensor" boxes and one "Control board" box. The "Control board" box is connected to the "Lift gateway" box, which is outside the "Device (Lift)" box. The "Lift gateway" box is connected to the "Internet" cloud, which is then connected to the "IoT application" box. A "Sensor for lift" box is also connected to the "Internet" cloud. -- Type 2: Directly connect**: A dashed box labeled "Lift system in building" contains a solid box labeled "Device (Lift)". Inside the "Device (Lift)" box, there are three "Sensor" boxes and one "Control board" box. The "Control board" box contains a "Lift gateway function" box. The "Lift gateway function" box is connected to the "Internet" cloud, which is then connected to the "IoT application" box. A "Sensor for lift" box is also connected to the "Internet" cloud. - -**IoT device legend:** - -- Full resource (represented by a white box) -- Constrained resource (represented by a grey box) - -Y.4420(21) - -Figure 2: IoT based monitoring and management for lift. The diagram shows two types of architectures: Type 1 (Through a lift gateway) and Type 2 (Directly connect). - -**Figure 2 – IoT based monitoring and management for lift** - -Type 1 in Figure 2 shows a connection in which the device can be connected to IoT applications through a lift gateway. The lift consists of sensors and a control board. The control board communicates and controls the sensors. The sensors and control board shown in Figure 2 are IoT devices. The lifts are devices to which several IoT devices are connected. The amount of data generated by the sensor is small. Therefore, it communicates with the control board using serial communication such as RS-232 [b-TIA-232] and RS-485 [b-TIA-485]. Some control boards support CAN bus to communicate with sensors. Thus, the control board supports serial communication and CAN bus. Some lifts also add extra sensors for inspection and monitoring purposes. In this case, the sensor added to the lift may not be connected to the control board because unauthorized connected sensors can cause lift malfunctions or security issues. - -Among the sensors installed in the lift, CCTV and vibration sensors generate a lot of data. When a lot of data are transmitted through a gateway, a problem occurs in the gateway known as data transmission error or delay. Accordingly, these IoT devices support a direct connection with IoT applications. Therefore, a gateway is required to connect the control board and sensors to the IoT applications. The information collected in the lift is transmitted to the IoT application through the lift gateway. - -However, it is also possible to connect directly to the lift and IoT applications according to the user's (lift admin) requirements. Type 2 in Figure 2 describes a direct connection in which the device can directly connect to IoT applications. Therefore, some control boards support wireless or wired network environments to connect with IoT applications. In this case, the lift gateway function should be added to the control board. Also, some sensor data size is small, and the data generation frequency is low. Therefore, it can transmit data directly to IoT applications by using low-power wide-area (LPWA) [b-IEEE 802.15.4w] network or narrowband IoT (NB-IoT) [b-3GPP TR 36.802] communication. LPWA communication is capable of long-distance communication and large-scale device access while satisfying the low power required by the IoT environment. - -The IoT application collects and manages the information from the lift and use the collected information. These applications include monitoring for lift safety and condition, lift emergency control, and parts management. Moreover, there is an application within the user management for accessing the lift when there are safety problems. The main function of the gateway is to collect lift information and to transmit lift control signals. If the gateway performance is sufficient, it is also possible to execute the functions performed in the IoT application at the gateway. - -The gateway periodically transmits the data to the IoT application or transmits the data to the IoT application by a user (lift admin) registered event. Constrained application protocol (CoAP) [b-IETF RFC 7252], Hypertext transfer protocol (HTTP) [b-IETF RFC 7540] and message queuing telemetry transport (MQTT) [b-ISO/IEC 20922] in IoT environments are used for application protocols. Accordingly, the gateway uses these application protocols to transmit data. - -### **7.2 Architecture of IoT gateway for lift** - -This clause describes the architecture of the IoT gateway for lift. IoT gateway for lift is equally applicable to both type 1 (through a lift gateway) and type 2 (direct connection) in the general architecture. IoT gateway for lift follows the reference technical framework of a gateway for IoT applications defined in [ITU-T Y.4101]. Some modules have been extended as shown in Figure 3 for the lift in IoT gateway defined in [ITU-T Y.4101]. Extended modules are device adaptation and network adaptation in the adaptation capabilities group and data processing modules in the support capabilities group. - -![Architecture of IoT gateway for lift (extended from [ITU-T Y.4101]) diagram showing three capability groups: Applications, Support, and Adaptation, with various modules and extensions highlighted in red.](d4af765160d04ecef538e5066006dc77_img.jpg) - -The diagram illustrates the architecture of an IoT gateway for lift, organized into three main capability groups: - -- Applications capabilities group:** Contains a single module labeled "Applications". -- Support capabilities group:** Contains five modules: "Device management", "Communication", "Data storage", "Data processing (Extension for CoAP, MQTT, and HTTP)", and "Service management". Below these is a "Data dispatching" module. The "Data processing" module is highlighted with a red border. -- Adaptation capabilities group:** Contains an "Interface abstraction" module and two extended modules: "Device adaptation (Extension for sensor and control board)" and "Network adaptation (Extension for CAN, serial, LPWA and TCP/IP)". Both of these modules are highlighted with red borders. - -A vertical bar on the right side of the diagram is labeled "Security and management capabilities group". - -At the bottom left, a red-bordered box is labeled "Extended module". - -At the bottom right, the reference "Y.4420(21)" is noted. - -Architecture of IoT gateway for lift (extended from [ITU-T Y.4101]) diagram showing three capability groups: Applications, Support, and Adaptation, with various modules and extensions highlighted in red. - -**Figure 3 – Architecture of IoT gateway for lift (extended from [ITU-T Y.4101])** - -The extension of device adaptation is as follows: - -- In the lift, various sensors or control boards are mainly composed of a programmable logic controller (PLC) [b-IEC 61131-3] system or an embedded system. Therefore, the lift gateway needs to extend the device adaptation module to support interworking with the lift. Thus, the device adaptation module of the IoT gateway must be extended to be able to connect with the lift sensor board and control board. - -The extension of network adaptation is as follows: - -- Lift control board and sensor board transmit data through non-IP based serial communication. Lift applications transmit data through non-IP based LPWA wireless or IP based communication. For interworking with such serial communication devices and lift applications, the lift gateway must also extend the network adaptation module. Therefore, the network adaptation module of the IoT gateway must be extended to enable non-IP (e.g., serial, LPWA, NB-IoT)/ IP communications. - -The extension of data processing is as follows: - -- The data processing module of the IoT gateway, encapsulates or decapsulates data based on the application protocol. The lift must also provide various IoT applications such as mobile and cloud environments. Accordingly, data processing module of the IoT gateway should be extended to support various protocols (e.g., CoAP, MQTT, and HTTP). - -### 7.3 Architecture of IoT application for lifts - -Lift applications are equally applicable to both type 1 (through a lift gateway) and type 2 (direct connection) in the general architecture. Lift applications follow the reference technical framework of a gateway for IoT applications defined in [ITU-T Y.4101]. Some modules have been extended as shown in Figure 4 for the lift in IoT application defined in [ITU-T Y.4101]. Extended modules are network adaptation modules in the adaptation capabilities group, data processing modules in the support capabilities group, and application modules in the application capabilities group. - -![Architecture of IoT application for lift (extended from [ITU-T Y.4101])](af7916c89a458fdab6c3f443217388ae_img.jpg) - -The diagram illustrates the architecture of an IoT application for lift, organized into three main capability groups on the left: Applications capabilities group, Support capabilities group, and Adaptation capabilities group. A vertical bar on the right represents the Security and management capabilities group. - -- Applications capabilities group:** Contains a single block labeled "Applications (Extension for monitoring, notification, statistics, management, diagnosis)". -- Support capabilities group:** Contains a row of five blocks: "Device management", "Communication", "Data storage", "Data processing (Extension for CoAP, MQTT, and HTTP)", and "Service management". Below this row is a block labeled "Data dispatching". -- Adaptation capabilities group:** Contains a block labeled "Interface abstraction" above a row of two blocks: "Device adaptation" and "Network adaptation (Extension for CAN, serial, LPWA and TCP/IP)". -- Security and management capabilities group:** A vertical bar on the right side of the diagram. - -At the bottom left, a box labeled "Extended module" is shown. At the bottom right, the reference "Y.4420(21)" is noted. - -Architecture of IoT application for lift (extended from [ITU-T Y.4101]) - -**Figure 4 – Architecture of IoT application for lift (extended from [ITU-T Y.4101])** - -The extension of network adaptation is as follows: - -- IoT applications are connected to IoT gateways or external sensors. IoT gateways or external sensors transmit data using non-IP/IP communication technology. Therefore, the network application module of IoT application must be modified to enable non-IP / IP communication. - -The extension of data processing is as follows: - -- The data processing module of IoT application, encapsulates or decapsulates data based on the application protocol. The lift must also provide various IoT applications such as mobile and cloud environments. Accordingly, data processing module of IoT applications should be extended to support various protocols. - -The extension of applications is as follows: - -- Applications capabilities group of IoT applications are capable of various application configurations for the lift. The monitoring application monitors the elevator operating condition with information related to the elevator operation and informs the notifying manager or user of the current lift status and information. It then creates statistics information based on the lift driving data. The management application calculates the timing of replacing the lift parts (lifetime) with the lift operation information and statistics information. It then performs a diagnostic mode function or checks inspection operation based on the collected information. - -## 8 Protocol and data model for IoT based lift monitoring and management - -Figure 5 shows the protocols applied in lift control panels, lift monitoring gateways (e.g., IoT gateways), and application servers (e.g., IoT servers). The data models for the protocols include basic lift information and operation state information. The elevator monitoring protocol over RS-485 (ELMP-485) supports communication between lift and the IoT gateway. The lift transmits monitoring and management data to the IoT gateway with ELMP-485, and the IoT gateway transmits monitoring and management data to the application server using IoT application protocols (e.g., CoAP, MQTT, and HTTP). The protocol conversion process occurs in the IoT gateway. - -![Figure 5: Protocols for IoT based lift monitoring and management. The diagram shows a 'Lift' block on the left containing 'Control board', 'Traction machine (Motor)', 'Car', 'Floor', and vertical dots. These connect via bidirectional arrows to an 'IoT gateway' block in the center. The protocols are: 'CAN based lift control protocol' for the control board, 'Serial based lift control protocol' for the traction machine, and 'Elevator monitoring protocol over RS-485 (ELMP-485)' for the car and floor. The IoT gateway then connects via a bidirectional arrow to an 'IoT application' block on the right, which contains 'Lift monitoring' and 'Lift management'. The IoT protocol is specified as '(CoAP, MQTT, HTTP)'. A reference 'Y.4420(21)' is at the bottom right.](4801720824e4b5e2361a5564f91cfb70_img.jpg) - -Figure 5: Protocols for IoT based lift monitoring and management. The diagram shows a 'Lift' block on the left containing 'Control board', 'Traction machine (Motor)', 'Car', 'Floor', and vertical dots. These connect via bidirectional arrows to an 'IoT gateway' block in the center. The protocols are: 'CAN based lift control protocol' for the control board, 'Serial based lift control protocol' for the traction machine, and 'Elevator monitoring protocol over RS-485 (ELMP-485)' for the car and floor. The IoT gateway then connects via a bidirectional arrow to an 'IoT application' block on the right, which contains 'Lift monitoring' and 'Lift management'. The IoT protocol is specified as '(CoAP, MQTT, HTTP)'. A reference 'Y.4420(21)' is at the bottom right. - -**Figure 5 – Protocols for IoT based lift monitoring and management** - -Figure 6 shows the lift structure. The lift is functionally divided into machine, car, hall, hoistway and pit groups. The monitoring and management data model is presented for each of these groups. The machine group contains the control panel and motor. The car group contains the emergency phone and car. The pit group contains the buffer spring and stop switch. The hall group contains each hall floor and lastly the hoistway group contains the lift hoistway. - -![Figure 6: Structure for lift. This diagram shows the functional components of a lift grouped into five categories: Machine group (Control panel, Traction machine (Motor)), Car group (Emergency phone, Car), Hall group (Hall), Hoistway group (Balance load), and Pit group (Buffer springs/ stop switch). Dashed lines indicate the vertical arrangement and connections between these groups. A reference 'Y.4420(21)' is at the bottom right.](a33da0f14e456f92539ce3e9b7d81f9a_img.jpg) - -Figure 6: Structure for lift. This diagram shows the functional components of a lift grouped into five categories: Machine group (Control panel, Traction machine (Motor)), Car group (Emergency phone, Car), Hall group (Hall), Hoistway group (Balance load), and Pit group (Buffer springs/ stop switch). Dashed lines indicate the vertical arrangement and connections between these groups. A reference 'Y.4420(21)' is at the bottom right. - -**Figure 6 – Structure for lift** - -### 8.1 Protocol for lift monitoring and management - -The structure of the ELMP-485 message is shown in Figure 7. This message uses a flag value to separate the start and end. The values of the start flag (SF) and the end flag (EF) used are the same and are '0x7E' of 1 byte. This flag value '0x7E' can also be used in areas other than the start and end flags. - -| Start flag
(SF-0x7E) | Destination
address
(DA) | Message
type
(Type) | Data field
length
(Len) | Data
field
(DATA) | Cyclic
redundancy
check
(CRC) | End flag
(EF-0x7E) | -|-------------------------|--------------------------------|---------------------------|-------------------------------|-------------------------|----------------------------------------|-----------------------| -| 1 byte | 1 byte | 1 byte | 2 bytes | n byte | 2 bytes | 1 byte | - -Y.4420(21) - -**Figure 7 – ELMP-485 message structure** - -In the message address field, the destination address (DA) is used, and the length is 1 byte. The destination address classification is shown in Table 1. - -**Table 1 – ELMP-485 address classification** - -| Classification | Address | -|--------------------|-------------| -| Broadcast address | 0x00 | -| Individual address | 0x01 ~ 0xF7 | -| Reserved address | 0xF8 ~ 0xFF | - -The message type is 1 byte and is shown in Table 2. The data length (len) and the value of the data filed are determined according to the message type. - -**Table 2 – ELMP-485 message type** - -| Value | Message type | -|-----------|-----------------| -| 0x01 | Data request | -| 0x02 | Data response | -| 0x03 | Update request | -| 0x04 | Update response | -| 0x05~0xFF | Discard | - -An example of the structure of the data request and response is shown in Figure 8. - -| | | | | | | | | -|---------------|------|------|------|--------|------------|--------|------| -| Data request | SF | DA | Type | Len | Data | CRC-16 | EF | -| | 0x7E | 0x02 | 0x01 | 0x0004 | 0x03FFF8F0 | 0x16B9 | 0x7E | -| Data response | SF | DA | Type | Len | Data | CRC-16 | EF | -| | 0x7E | 0x01 | 0x02 | 0x0004 | 0x03F80105 | 0x3068 | 0x7E | - -Y.4420(21) - -**Figure 8 – ELMP-485 message example** - -If '0x7E' is included in the ELMP-485 message, the escape function is used to prevent it from being recognized as SF or EF. For the escape function, the value of the '0x7D' escape flag is defined. When a value of '0x7E' is used outside the start and end flag areas or an escape flag value of '0x7D' is used, an escape flag value of '0x7D' is added before the corresponding byte. In addition, to prevent escape data from remaining in the transmitted message, the data byte value is XOR to '0x20' and transmitted. - -### 8.2 Data model for lift monitoring and management - -Basic lift information includes specification information as shown in Table 3. This specification information is determined when the lift is manufactured and installed in the building. In addition, - -M/O displayed in the table is an item to select mandatory/optional. Mandatory records 'M' and optional records 'O'. The selectable items in the data access mode are read (R), write (W), or both. - -**Table 3 – Basic lift information** - -| Data name | Data access modes | Data type | M/O | Description | -|----------------|-------------------|-----------|-----|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -| Lift no. | R | String | M | Lift unique identifier that can be identified in the network | -| Lift local no. | R | String | M | Lift unique identifier installed in a building | -| Manufacturer | R | String | M | Lift manufacturer | -| Model | R | String | M | Lift model | -| Speed | R | Float32 | M | Rated speed designed for lift
(unit: m/s) | -| Load | R | UInt8 | O | Rated load designed for lift
(unit: kg) | -| Floor | R | UInt8 | M | Total number of floors that the installed lift supports
(ex) The total number of lift floors operating on the second basement and fourth floors above the ground is indicated as '6') | -| Base floor | R | UInt8 | M | The floor that is the standard for lift operation
(Refers to the lobby floor, and the floor that can enter and exit from outside for firefighting purposes) | - -The machine group (Table 4): The machine group includes a control panel and a traction machine located at the top of the hoistway, or in a lift environment with or without a machine room. It is installed inside the hoistway to handle the functions of the existing machine room. - -**Table 4 – Lift operation status information: Machine group** - -| Data name | Data access modes | Data type | M/O | Description | -|---------------------------------------------|-------------------|-----------|-----|-------------------------------------------------------------------------------------------------------------------------------| -| Machine room temperature | R | Float32 | O | Current temperature of the machine room where the traction machine, electric motor, and control panel are installed | -| Control panel mainboard communication state | R | Boolean | O | Control panel main board status information installed in the machine room
(Power and communication status is normal: true) | -| Control panel protocol | R | UInt8 | M | Protocol information used by the control panel main board | -| Control panel model | R | String | M | Control panel mainboard model information | -| Traction machine operation signal | R | Boolean | M | Traction machine start signal (Operation: true, stop: false) | - -The car group (Table 5): A group of devices located in the car for transportation and convenience which also includes an emergency call device. - -**Table 5 – Lift operation status information: Car group** - -| Data name | Data access modes | Data type | M/O | Description | -|-----------------------------------|--------------------------|------------------|------------|----------------------------------------------------------------------------------------------------------------------------------------------------------------| -| Car operation mode | R | UInt8 | M | Lift operation mode (normal, manual check, etc.),
Firefighting,
Evacuation (fire, earthquake detection, etc.),
Dedicated driving, etc. | -| Car current floor | R | UInt8 | M | The floor where the car is located (the lowest floor starts from 0) | -| Car destination floor | R | UInt8 | M | The current floor from where the car moves | -| Car current direction | R | UInt8 | M | Car driving direction
(0: stop,
1: upward,
2: downward) | -| Car current speed | R | Float32 | M | Car current running speed
(unit: m/s) | -| Car overspeed | R | Boolean | M | Overspeed, when the rated speed set on the car exceeds 115%
(Overspeed=true) | -| Car overload | R | Boolean | M | Exceeding the rated load of the car (Overload: true) | -| Car call status | R, W | BitArray | M | Provides car call status information
(If the call is made from each floor, it is displayed as 1) | -| Car level state | R | Boolean | M | The difference in height between the car and hall is recognized, and if it is within the error of the reference value, it is considered normal. | -| Car door state | R, W | UInt8 | M | Car door status display information conveys information about whether it is open, closed, or in progress.
(Open-0,
Opening-1,
Closed-2,
Closing-3) | -| Operation panel board (OPB) state | R | Boolean | M | Transmits whether the communication status of the OPB installed in the car is normal
(Normal: true) | - -The hall group (Table 6): It is a group of devices located on each hall floor. - -**Table 6 – Lift operation status information: Hall group** - -| Data name | Data access modes | Data type | M/O | Description | -|---------------------------------------------|--------------------------|------------------|------------|-------------------------------------------------------------------------------------------------------------------------------| -| Machine room temperature | R | Float32 | O | Current temperature of the machine room where the traction machine, electric motor, and control panel are installed | -| Control panel mainboard communication state | R | Boolean | O | Control panel main board status information installed in the machine room
(Power and communication status is normal: true) | - -**Table 6 – Lift operation status information: Hall group** - -| Data name | Data access modes | Data type | M/O | Description | -|-----------------------------------|-------------------|-----------|-----|--------------------------------------------------------------| -| Control panel protocol | R | UInt8 | M | Protocol information used by the control panel main board | -| Control panel model | R | String | M | Control panel mainboard model information | -| Traction machine operation signal | R | Boolean | M | Traction machine start signal (Operation: true, stop: false) | - -The hoistway group: It is a group of devices located on the entire hoistway where the car moves. - -The pit group: It is a group of devices located in the inspection space under the lift, such as stop switches and buffer springs. - -Table 7 is the data of lift operation statistics related to operation after lift construction. - -**Table 7 – Lift operation statistics information** - -| Data name | Data access modes | Data type | M/O | Description | -|--------------------|-------------------|-----------|-----|----------------------------------------------------------| -| Operation count | R | UInt32 | M | Total number of trips counted as one lift start and stop | -| Operation distance | R | UInt32 | O | Total cumulative lift travel distance (unit: m) | -| Operation time | R | UInt32 | O | Total cumulative lift operation time (unit: H) | -| Downtime | R | UInt32 | O | Accumulated stop time due to lift failure (Unit: H) | - -Table 8 is the data for failure information that can be displayed in the lift control panel and in the standardized main failure information. - -**Table 8 – Lift error information** - -| Data name | Data access modes | Data type | M/O | Description | -|----------------|-------------------|-----------|-----|-----------------------------------------| -| Main_ErrorCode | R | UInt16 | M | Each manufacturer's error code is used. | - -## Appendix I - -### Use cases of IoT based monitoring and management for lift - -(This appendix does not form an integral part of this Recommendation.) - -### I.1 Lift emergency notification - -The manager of the building should notify the people and quickly evacuate in the event of an earthquake, fire, or disaster. In case of a disaster, the lift is operated in an emergency operation mode, and not in a normal operation mode. Thus, lifts are used to evacuate or rescue people. Moreover it is also necessary to add sensors and devices to detect disasters such as fires and earthquakes that may occur in buildings, and these sensors and devices must be linked to the lift. If not, this information must be collected and delivered to the lift disaster-related external information for fires and earthquakes. Moreover, in case of an emergency, the lift operation mode should be changed. Therefore, IoT-based management technology is required to monitor and manage lifts using additional sensors, devices, or external information. As shown in Figure I.1, the fire detector or seismograph installed in the building is connected to the lift through the IoT gateway, and the cloud server (IoT application) and IoT gateway that informs the earthquake and fire information are also interconnected. - -![Diagram illustrating Lift emergency notification system architecture.](898fb89a50d9ec1dfb4e425c816976a7_img.jpg) - -The diagram shows a 'Building' box containing a 'Seismometer' (represented by a sensor icon) and a 'Fire' (represented by a flame icon). Both are connected to a 'Lift gateway' box. The 'Lift gateway' is connected to a 'Lift' box (showing two people inside a lift shaft). The 'Lift gateway' is also connected to a 'Cloud server (IoT application)' box outside the building. The label 'Y.4420(21)' is located at the bottom right of the diagram. - -Diagram illustrating Lift emergency notification system architecture. - -Figure I.1 – Lift emergency notification - -### I.2 Lift monitoring in smart building - -As shown in Figure I.2, there are various IoT devices present in smart buildings. The lift is one of them. In an existing building with multiple lifts installed, the lifts will stop according to the initial setting regardless of the number of people waiting. When one of the nearest lifts arrives, the other lift calls are cancelled, or the other lift arrivals are also stopped. Thus the lift runs inefficiently. However, in smart buildings, the number of people waiting is monitored using CCTV and based on this information, one or several lifts arrives. In addition, it is possible to make only a specific floor accessible to a specific user or disable access to a specific floor by interworking with a security system in a smart building. - -![Diagram of lift monitoring in a smart building showing three manufacturers (A, B, C) connected to a central Gateway, which then connects to IoT applications like Monitoring, Notification, Statistics, Management, and Diagnosis.](b6671cfafda3820aafe9a24fa7a4d8c7_img.jpg) - -**Smart building** - -The diagram illustrates the architecture for lift monitoring in a smart building. It is divided into two main sections: 'Smart building' and 'IoT application'. - -**Smart building section:** - -- Manufacture A:** Contains icons for Fire, Security, and Access. It is connected to a central hub via a CAN bus. -- Manufacture B:** Contains icons for Lighting, Lift, and HVAC. It is connected to the central hub via a Serial connection. -- Manufacture C:** Contains icons for CCTV, Communication, and Energy. It is connected to the central hub via a Wire, wireless connection. -- Central Hub:** A circle with an 'X' inside, representing a central processing or routing unit. -- Gateway:** A box at the bottom of the Smart building section that receives data from the central hub and forwards it to the IoT application. - -**IoT application section:** - -- Contains five stacked boxes representing different applications: Monitoring, Notification, Statistics, Management, and Diagnosis. -- The Gateway connects to the bottom of this stack, specifically to the Diagnosis application. - -Y.4422(21) - -Diagram of lift monitoring in a smart building showing three manufacturers (A, B, C) connected to a central Gateway, which then connects to IoT applications like Monitoring, Notification, Statistics, Management, and Diagnosis. - -**Figure I.2 – Lift monitoring in smart building** - -## Bibliography - -- [b-ITU-T L.1301] Recommendation ITU-T L.1301 (2005), *Minimum Data Set and Communication Interface requirements for Data Centre Energy Management*. -- [b-ITU-T X.1114] Recommendation ITU-T X.1114 (2008), *Authorization framework for home networks*. -- [b-ITU-T Y.4000] Recommendation ITU-T Y.4000/Y.2060 (2012), *Overview of the Internet of things*. -- [b-IEC 61131-3] IEC 61131-3 (2013), *Programmable controllers – Part 3: Programming languages*. -- [b-IEEE 802.15.4w] IEEE 802.15.4w (2020), *IEEE Standard for Low-Rate Wireless Networks – Amendment 2: Low Power Wide Area Network (LPWAN) Extension to the Low-Energy Critical Infrastructure Monitoring (LECIM) Physical Layer (PHY)*. -- [b-IETF RFC 7252] IETF RFC 7252 (2014), *The Constrained Application Protocol (CoAP)*. -- [b-IETF RFC 7540] IETF RFC 7540 (2015), *Hypertext Transfer Protocol Version 2 (HTTP/2)*. -- [b-ISO/IEC 20922] ISO/IEC 20922 (2016), *Information technology — Message Queuing Telemetry Transport (MQTT) v3.1.1*. -- [b-3GPP TR 36.802] 3GPP TR 36.802 (2016), *Evolved Universal Terrestrial Radio Access (E-UTRA); NB-IOT; Technical Report for BS and UE radio transmission and reception*. -- [b-CiA 102] CiA 102 version 3.0.0 (2010), *CAN physical layer for industrial applications*. -- [b-TIA-232] TIA-232 (1997), *Interface Between Data Terminal Equipment and Data Circuit- Terminating Equipment Employing Serial Binary Data Interchange*. -- [b-TIA-485] TIA-485 (1998), *Electrical Characteristics of Generators and Receivers for Use in Balanced Digital Multipoint Systems*. - - - - - -## SERIES OF ITU-T RECOMMENDATIONS - -| | | -|-----------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------| -| Series A | Organization of the work of ITU-T | -| Series D | Tariff and accounting principles and international telecommunication/ICT economic and policy issues | -| Series E | Overall network operation, telephone service, service operation and human factors | -| Series F | Non-telephone telecommunication services | -| Series G | Transmission systems and media, digital systems and networks | -| Series H | Audiovisual and multimedia systems | -| Series I | Integrated services digital network | -| Series J | Cable networks and transmission of television, sound programme and other multimedia signals | -| Series K | Protection against interference | -| Series L | Environment and ICTs, climate change, e-waste, energy efficiency; construction, installation and protection of cables and other elements of outside plant | -| Series M | Telecommunication management, including TMN and network maintenance | -| Series N | Maintenance: international sound programme and television transmission circuits | -| Series O | Specifications of measuring equipment | -| Series P | Telephone transmission quality, telephone installations, local line networks | -| Series Q | Switching and signalling, and associated measurements and tests | -| Series R | Telegraph transmission | -| Series S | Telegraph services terminal equipment | -| Series T | Terminals for telematic services | -| Series U | Telegraph switching | -| Series V | Data communication over the telephone network | -| Series X | Data networks, open system communications and security | -| Series Y | Global information infrastructure, Internet protocol aspects, next-generation networks, Internet of Things and smart cities | -| Series Z | Languages and general software aspects for telecommunication systems | \ No newline at end of file diff --git a/original/E/T-REC-E.118-200605-I_PDF-E.pdf b/original/E/T-REC-E.118-200605-I_PDF-E.pdf deleted file mode 100644 index 42905d87f48bcb6cca51dddce39cee718e2752c2..0000000000000000000000000000000000000000 --- a/original/E/T-REC-E.118-200605-I_PDF-E.pdf +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:a75f40e4ee3ffe50b11cd148f20e1b04af23e2f1a28135b7c2c98fedc309a6c7 -size 317800 diff --git a/original/E/T-REC-E.164-201011-I_PDF-E.pdf b/original/E/T-REC-E.164-201011-I_PDF-E.pdf deleted file mode 100644 index 108223fda3b83daf86bdb5803b5f6428573183c8..0000000000000000000000000000000000000000 --- a/original/E/T-REC-E.164-201011-I_PDF-E.pdf +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:f0541b5806fa7e781388431b7b3429fa5efd9c5ad4b16138efe5099775d303ba -size 369064 diff --git a/original/E/T-REC-E.164.1-200809-I_PDF-E.pdf b/original/E/T-REC-E.164.1-200809-I_PDF-E.pdf deleted file mode 100644 index da375ba487291634ad904248d9d64583a42535f6..0000000000000000000000000000000000000000 --- a/original/E/T-REC-E.164.1-200809-I_PDF-E.pdf +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:994ac6ac376fbb7a6741a1298813f352a4d887e3f0b555e74297bbb7925ccae8 -size 339453 diff --git a/original/G/T-REC-G.798-202309-I_PDF-E.pdf b/original/G/T-REC-G.798-202309-I_PDF-E.pdf deleted file mode 100644 index e4f28bc36e4cdbc4e215419ebc99227edb0da0b0..0000000000000000000000000000000000000000 --- a/original/G/T-REC-G.798-202309-I_PDF-E.pdf +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:e425881ca1a57f66db0be958580ad0d398e0cc4808d9a10fd207bf76427402b7 -size 28920233 diff --git a/original/G/T-REC-G.8275.1-202211-I_PDF-E.pdf b/original/G/T-REC-G.8275.1-202211-I_PDF-E.pdf deleted file mode 100644 index a34b9568ec50cef49892a3c18c0dc8721507389e..0000000000000000000000000000000000000000 --- a/original/G/T-REC-G.8275.1-202211-I_PDF-E.pdf +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:3f5004954ba29d6f27b72b62f49935312ba7d9e6d2facb3186963320785372a7 -size 1753367 diff --git a/original/G/T-REC-G.8275.2-202211-I_PDF-E.pdf b/original/G/T-REC-G.8275.2-202211-I_PDF-E.pdf deleted file mode 100644 index 5c6a4d793a65dae69320b634672f11876330fbee..0000000000000000000000000000000000000000 --- a/original/G/T-REC-G.8275.2-202211-I_PDF-E.pdf +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:354431d68d437014d994dba5e1cf29f34fa9ed37624248ec9514fdec6ee3186c -size 2369941 diff --git a/original/G/T-REC-G.874-202010-I_PDF-E.pdf b/original/G/T-REC-G.874-202010-I_PDF-E.pdf deleted file mode 100644 index a4444936dcaacc8c0f5aa66977b3b91a255c9b56..0000000000000000000000000000000000000000 --- a/original/G/T-REC-G.874-202010-I_PDF-E.pdf +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:9e178dd9d4e338e338dabb96292b07688f5ceb24cc69c71911e0b14b5a12c263 -size 1500319 diff --git a/original/M/T-REC-M.3020-202304-I_PDF-E.pdf b/original/M/T-REC-M.3020-202304-I_PDF-E.pdf deleted file mode 100644 index 0347f86dd192ab5f4cb4873692b80ebe982f61c4..0000000000000000000000000000000000000000 --- a/original/M/T-REC-M.3020-202304-I_PDF-E.pdf +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:eaca436ded64c4c6cd342f599ef115fe6518a8e18b61d347a622668f1776a90f -size 1398556 diff --git a/original/M/T-REC-M.3080-202102-I_PDF-E.pdf b/original/M/T-REC-M.3080-202102-I_PDF-E.pdf deleted file mode 100644 index 69891bc4e2f846a48811e3c818ae7c1036a9d8d6..0000000000000000000000000000000000000000 --- a/original/M/T-REC-M.3080-202102-I_PDF-E.pdf +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:0f881370fc1f9cf7ef9ad04e86ca896a9dec764ecd15dab15f7dcc3382bc5ee7 -size 1709362 diff --git a/original/M/T-REC-M.3383-202304-I_PDF-E.pdf b/original/M/T-REC-M.3383-202304-I_PDF-E.pdf deleted file mode 100644 index 939007e54c6ce2f8d2b166cc4a69f15829fca24f..0000000000000000000000000000000000000000 --- a/original/M/T-REC-M.3383-202304-I_PDF-E.pdf +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:570b9465cc76c5e19b4fa1fa9798d08b0baa5d702656fcc5d6c3ae30173e0a89 -size 881807 diff --git a/original/X/T-REC-X.1058-201703-I_PDF-E.pdf b/original/X/T-REC-X.1058-201703-I_PDF-E.pdf deleted file mode 100644 index b459e56cd8f77aad360ef1ad28a83afbd6924462..0000000000000000000000000000000000000000 --- a/original/X/T-REC-X.1058-201703-I_PDF-E.pdf +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:365fff2ca21f469bfedaf3e1f0d93db652068fe75c631faa944a4f04ee25c20a -size 914508 diff --git a/original/X/T-REC-X.1060-202106-I_PDF-E.pdf b/original/X/T-REC-X.1060-202106-I_PDF-E.pdf deleted file mode 100644 index c3fc5d588a752530f028821bd8a821e351b980c8..0000000000000000000000000000000000000000 --- a/original/X/T-REC-X.1060-202106-I_PDF-E.pdf +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:44ba6c581fb5b51306a151799acb26edcff835a63a082d16ab0b8da3dcfd0d0a -size 1358006 diff --git a/original/X/T-REC-X.1400-202010-I_PDF-E.pdf b/original/X/T-REC-X.1400-202010-I_PDF-E.pdf deleted file mode 100644 index 3a6e115179389719c2aa3535b0ee7c40448ad1b4..0000000000000000000000000000000000000000 --- a/original/X/T-REC-X.1400-202010-I_PDF-E.pdf +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:e219d186ab57f3389beb5fbb4f2f2b44d4772fabc58da7676c673c92e3c9c09e -size 669648 diff --git a/original/Y/T-REC-Y.3510-201602-I_PDF-E.pdf b/original/Y/T-REC-Y.3510-201602-I_PDF-E.pdf deleted file mode 100644 index 30bf62613a0127150b6663b15fc44103a628e591..0000000000000000000000000000000000000000 --- a/original/Y/T-REC-Y.3510-201602-I_PDF-E.pdf +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:c9708126156aa720acd497d21a4a1d3152dd0bc558256ee9f738e91504038f5b -size 1656038 diff --git a/original/Y/T-REC-Y.4420-202107-I_PDF-E.pdf b/original/Y/T-REC-Y.4420-202107-I_PDF-E.pdf deleted file mode 100644 index 082d0886b173ee9699a40b415be5facbcd1c7b8a..0000000000000000000000000000000000000000 --- a/original/Y/T-REC-Y.4420-202107-I_PDF-E.pdf +++ /dev/null @@ -1,3 +0,0 @@ -version https://git-lfs.github.com/spec/v1 -oid sha256:90e32a807ffc3b73262d11678197030492febbe3d1975eb12851036093fb0397 -size 1650397