[go: up one dir, main page]

WO2024031206A1 - Mécanisme de rapport précis pour les exigences de bande passante d'une unité de réseau optique - Google Patents

Mécanisme de rapport précis pour les exigences de bande passante d'une unité de réseau optique Download PDF

Info

Publication number
WO2024031206A1
WO2024031206A1 PCT/CN2022/000113 CN2022000113W WO2024031206A1 WO 2024031206 A1 WO2024031206 A1 WO 2024031206A1 CN 2022000113 W CN2022000113 W CN 2022000113W WO 2024031206 A1 WO2024031206 A1 WO 2024031206A1
Authority
WO
WIPO (PCT)
Prior art keywords
overhead
onu
bandwidth
optical network
payload
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/CN2022/000113
Other languages
English (en)
Chinese (zh)
Inventor
孙武
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Individual
Original Assignee
Individual
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Individual filed Critical Individual
Priority to PCT/CN2022/000113 priority Critical patent/WO2024031206A1/fr
Publication of WO2024031206A1 publication Critical patent/WO2024031206A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems

Definitions

  • the present invention belongs to the field of communications, and relates to the dynamic bandwidth allocation (Dynamic Bandwidth Allocation, DBA for short) of Passive Optical Networks (PON for short), paying special attention to the priorities ( Accurate reporting of Quality of Service (QoS) queue bandwidth requirements.
  • the PON in the present invention includes but is not limited to the following protocols: EPON, 10G EPON, GPON, 10G GPON, etc.
  • a typical passive optical network system mainly consists of an optical line terminal (OLT), an optical distribution network and an optical network unit.
  • the topology is a point-to-multipoint structure, that is, an optical line terminal connects multiple devices through the optical distribution network. optical network unit.
  • the optical line terminal is responsible for allocating corresponding time slots to each optical network unit for the transmission of uplink data; while the uplink bandwidth is fully utilized, the uplink data sent by each optical network unit is Conflicts cannot occur; therefore, how to better realize uplink bandwidth allocation in passive optical network systems is one of the most important technologies in passive optical network technology.
  • the OLT will estimate the bandwidth requirements of various priority queues of each ONU as accurately as possible, and allocate appropriate bandwidth to each queue of the ONU according to the Service Level Agreement (Service Level Agreement, referred to as SLA), and then download the bandwidth.
  • SLA Service Level Agreement
  • the OLT estimates the bandwidth requirements of various priorities in the ONU through the information reported by the ONU and/or the statistical information on the OLT side.
  • GPON and 10G GPON implement dynamic bandwidth allocation through the DBRu and Grant mechanisms (see Figure 1): ONU reports the bandwidth requirements of a certain priority queue of the ONU through DBRu, specifically the amount of cached data in Buffer104 , and the OLT allocates the bandwidth after receiving the information reported by the ONU and sends it to each ONU through the Grant in the BWmap (Bandwidth Map) structure; in the EPON and 10G EPON protocols, the MPCP (Multi-Point Control Protocol) protocol is used
  • the REPORT frame and GATE frame are used for dynamic bandwidth allocation: ONU reports the bandwidth requirements of a certain priority queue of the ONU through the REPORT frame, which is also the amount of buffered data in Buffer104, and the OLT receives the ONU report After receiving the information, the bandwidth is allocated and sent to each ONU through G
  • the existing ONU reporting mechanism of PON technology still has shortcomings in accurately estimating the ONU's bandwidth requirements: First, the ONU reports the amount of buffered data in Buffer104 at a certain time instead of the input port of Buffer104 over a period of time. The amount of data absorbed within the ONU, the latter represents the actual bandwidth demand of a certain priority queue of the ONU within a period of time; secondly, the information reported by the ONU only includes the demand for payload, and does not include uploading these payloads. The overhead required by the load (overhead), and the actual bandwidth requirement of the ONU is the sum of the payload and the overhead; thirdly, the reporting mechanism of the existing PON protocol is obtained after an uncertain delay after the payload has entered the buffer.
  • the present invention will adjust the relevant mechanisms in the existing PON protocol to allow the ONU to proactively report a certain priority queue
  • the uplink frame structure of 10G GPON will be used as an example; as shown in Figure 3, two ONUs each uploaded an uplink burst ( Also called burst), there is a reserved bandwidth between two uplink bursts, called gap; the head and tail of an ONU burst are the XGTC Header and XGTC Trailer check bits respectively; the ONU burst contains the current ONU
  • the payload of the priority queue (called AllocID in the 10GPON protocol) (XGEM payload as shown in Figure 3) also includes the XGEM Header and DBRu of each AllocID.
  • the present invention proposes that the bandwidth demand information of a certain priority queue reported by the ONU is not the amount of buffered data in Buffer 104 at a certain moment, but includes the amount of data absorbed by the input port of Buffer 204 within a period of time as shown in Figure 2;
  • the period of time referred to above refers to a dynamic bandwidth allocation cycle (DBA Allocation Cycle); the length of a dynamic bandwidth allocation cycle can be fixed or unfixed; as shown in Figure 4, generally, in a dynamic bandwidth allocation cycle
  • DBA Allocation Cycle the length of a dynamic bandwidth allocation cycle can be fixed or unfixed; as shown in Figure 4, generally, in a dynamic bandwidth allocation cycle
  • All AllocIDs in each ONU can upload their own upstream payload and overhead in the same upstream burst, and one AllocID contains several XGEM Ports. -ID; each data packet (Service Data Unit, SDU for short) or slice of SDU corresponds to an XGEM Port-ID.
  • SDU Service Data Unit
  • the overhead of the payload can be divided into two parts; one is the overhead related to AllocID, such as the bandwidth requirement DBRu of the QoS queue that each AllocID needs to be reported regularly; in Figure 3, this overhead includes DBRu and XGEM Header; Generally speaking, how many AllocIDs an ONU contains, how many DBRus are reported accordingly; how many XGEM Port-IDs an AllocID contains, how many XGEM Header overheads need to be reported when DBRu is non-zero; It is worth mentioning that EPON and 10G EPON protocols continue to use the simple Ethernet data format, but add the MPCP protocol to implement bandwidth reporting and other functions. They do not introduce universal framing protocols and Port-ID, so in EPON and 10G In EPON, the overhead related to the queue does not include the XGEM Header.
  • the second is the overhead related to ONU.
  • this overhead includes XGTC Header, XGTC Trailer and gap; in the dynamic bandwidth allocation algorithm on the OLT side, AllocID is used as the unit for allocating bandwidth instead of ONU;
  • ONU The relevant overhead can be distributed to all AllocIDs of the ONU in a certain way (for example, evenly distributed), or this part of the overhead can be uniformly reserved at the OLT end without reporting it at the ONU end.
  • ONU-related The overhead can be evenly distributed to all AllocIDs of the ONU.
  • the ONU regularly and proactively reports to the OLT the sum of the payload and related overhead absorbed by its QoS queues within a dynamic bandwidth allocation cycle; these overheads include two parts, one is the overhead related to AllocID, and the other is Is the overhead related to ONU; since each ONU will allocate bandwidth once and only once within a DBA Allocation Cycle, the overhead related to ONU is basically fixed; the overhead related to AllocID depends on the number of AllocIDs contained in the ONU and Each AllocID contains the number of XGEM Port-IDs.
  • a queue needs to report the cost of one DBRu.
  • An XGEM Port-ID needs to report the cost of an XGEM Header when DBRu is non-zero.
  • the OLT side Every time the OLT side slices the data packet to be uploaded, the OLT side must allocate an additional XGEM Header overhead; every time the OLT side slices the AllocID, it must allocate a DBRu overhead and an ONU-related overhead. However, these two overheads are default overheads and are not included in the additional overhead caused by slicing.
  • overhead can be classified in another way: DBRu overhead and ONU-related overhead can be classified as default overhead; non-default XGEM Header overhead can be defined as Port-ID-related overhead, which can also be divided into There are two categories: one is the overhead related to Port-ID reported by the ONU side, and the other is the overhead related to Port-ID caused by slicing on the OLT side. It can be seen that regardless of the classification, idle frames are not included in the overhead.
  • OLT When the payload and overhead of AllocID are accurately reported, for fixed bandwidth and guaranteed bandwidth, OLT will accurately meet the requirements of AllocID, and the ONU end does not need to send an idle frame (Idle Frame) to the OLT end; for non-guaranteed bandwidth and the best-effort bandwidth, there is naturally no opportunity to send idle frames; that is to say, from the perspective of ONU reporting, no bandwidth will be wasted; the accurate reporting mechanism at the ONU end proposed by the present invention can maximize the use of the total uplink bandwidth.
  • Idle Frame idle frame
  • the payload is reported to the OLT at the entrance of the buffer; in the implementation of the PON series protocol, the payload is sent to the buffer and after an uncertain delay in the buffer, Only when the payload is reported to the OLT; therefore, in terms of the delay from when the payload is reported to the OLT to when the payload is taken away by the OLT, compared with the method proposed by the protocol, the method of this patent will have a smaller and more efficient payload upload. Stable delay.
  • Figure 1 is a framework diagram of the ONU bandwidth reporting and OLT bandwidth allocation mechanism of the PON protocol
  • Figure 2 is a framework diagram of the ONU bandwidth reporting and OLT bandwidth allocation mechanism proposed by the present invention
  • Figure 3 is a schematic diagram of the uplink frame structure of 10G GPON
  • Figure 4 is a timing diagram in which each queue is sequentially allocated bandwidth during the allocation period.
  • OLT201 and ONU202 respectively represent the master node and slave node of the communication system; in the slave node ONU202, Buffer204 is used to absorb the input payload; in the master node OLT201, the dynamic bandwidth
  • the allocation module DBA203 is used to allocate uplink bandwidth to the communication system.
  • the embodiment uses Figure 2 to describe the dynamic bandwidth allocation process: ONU202 reports the sum of the input payload and related overhead at the entrance of Buffer204; the bandwidth requirement is reported to the DBA203 module through DBRu or REPORT 206; the DBA203 module provides Each priority queue allocates corresponding bandwidth on the upstream channel; the allocated bandwidth is sent to ONU202 through Grant or GATE 205; each priority queue of ONU uploads corresponding upstream data in the allocated time slot.
  • the uplink frame structure of 10G GPON will be used as an example; the bandwidth demand information of a certain priority queue reported by the ONU is not the amount of cached data in Buffer104 at a certain time, but includes the amount of data cached in Buffer104 at a certain time, but includes the following information:
  • DBA Allocation Cycle dynamic bandwidth allocation cycle
  • each ONU will allocate bandwidth once and only once in turn. All AllocIDs in each ONU can upload their own uplink payload and overhead in the same uplink burst.
  • An AllocID contains several XGEM Port-IDs.
  • the overhead of the payload can be divided into two parts; the first part is the overhead related to AllocID; in Figure 3, this overhead includes DBRu and XGEM Header; how many AllocIDs a certain ONU contains, then how many DBRus are reported accordingly ;How many XGEM Port-IDs a certain AllocID contains, and how many XGEM Header overheads need to be reported when DBRu is non-zero.
  • the second part is the overhead related to ONU.
  • this overhead includes XGTC Header, XGTC Trailer and gap; in the dynamic bandwidth allocation algorithm on the OLT side, AllocID is used as the unit for allocating bandwidth instead of ONU;
  • the ONU-related overhead can be distributed to all AllocIDs of the ONU in some way (for example, evenly distributed), or this part of the overhead can be reserved uniformly on the OLT side without reporting it on the ONU side; in this implementation, ONU-related overhead is evenly distributed among all AllocIDs of the ONU.
  • the ONU regularly and proactively reports to the OLT the sum of the payload and related overhead absorbed by its QoS queues within a dynamic bandwidth allocation cycle; these overheads include two parts, one is the overhead related to AllocID, and the other is Is the overhead related to ONU; since each ONU will allocate bandwidth once and only once within a DBA Allocation Cycle, the overhead related to ONU is basically fixed; the overhead related to AllocID depends on the number of AllocIDs contained in the ONU and Each AllocID contains the number of XGEM Port-IDs.
  • a queue needs to report the cost of one DBRu.
  • An XGEM Port-ID needs to report the cost of an XGEM Header when DBRu is non-zero.
  • Overhead can also be classified in another way: DBRu overhead and ONU-related overhead can be classified as default overhead; non-default XGEM Header overhead can be defined as Port-ID-related overhead.
  • the method proposed by the present invention accurately reports the actual bandwidth demand of a certain priority queue of ONU within a period of time; in accurately reporting the payload and AllocID
  • the OLT will accurately meet the requirements of AllocID, and the ONU end does not need to send an idle frame (Idle Frame) to the OLT end; for non-guaranteed bandwidth and best-effort bandwidth, the ONU end Naturally, there is no chance to send idle frames; that is to say, the ONU does not need to send idle frames to the OLT, and no bandwidth will be wasted; at the same time, there will be a smaller and more stable delay when the payload is uploaded from the ONU to the OLT. .
  • the method proposed by the present invention avoids the OLT remotely estimating the bandwidth requirements of the ONU; the original estimation method is complex and inaccurate and will bring more delay.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Small-Scale Networks (AREA)

Abstract

La présente invention divulgue un mécanisme de rapport précis pour l'exigence de bande passante de chaque file d'attente de priorité d'une unité de réseau optique dans un système de communication de réseau optique passif. Selon la présente invention, des défauts de protocoles de réseaux optiques passifs existants dans un mécanisme de rapport d'exigence de bande passante d'unité de réseau optique sont tout d'abord analysés, et il est proposé qu'un terminal de ligne optique soit empêché d'estimer à distance les exigences de bande passante de l'unité de réseau optique. Dans le nouveau mécanisme de rapport, la quantité de données reçues par le port d'entrée d'une mémoire tampon au cours d'une période est rapportée au lieu de la quantité de données de mémoire tampon à un certain moment par l'unité de réseau optique, et les informations rapportées contiennent une charge utile et un surdébit correspondant. Du fait de cette amélioration, il n'est plus nécessaire que l'unité de réseau optique envoie une trame inactive au terminal de ligne optique, ceci permettant d'obtenir une utilisation efficace à 100 % d'une bande passante de liaison montante. De plus, le mécanisme de rapport effectue un rapport à l'entrée de la mémoire tampon au lieu d'effectuer un rapport au bout d'un temps de retard incertain après que la charge utile a pénétré dans la mémoire tampon, de sorte que, par comparaison avec des procédés de mise en oeuvre proposés sur la base des protocoles de réseaux optiques passifs existants, le procédé selon la présente invention permet d'atteindre le retard le plus petit possible et le plus stable. La figure 2 est le dessin relatif à l'abrégé de la présente invention.
PCT/CN2022/000113 2022-08-08 2022-08-08 Mécanisme de rapport précis pour les exigences de bande passante d'une unité de réseau optique Ceased WO2024031206A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/CN2022/000113 WO2024031206A1 (fr) 2022-08-08 2022-08-08 Mécanisme de rapport précis pour les exigences de bande passante d'une unité de réseau optique

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2022/000113 WO2024031206A1 (fr) 2022-08-08 2022-08-08 Mécanisme de rapport précis pour les exigences de bande passante d'une unité de réseau optique

Publications (1)

Publication Number Publication Date
WO2024031206A1 true WO2024031206A1 (fr) 2024-02-15

Family

ID=89850082

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2022/000113 Ceased WO2024031206A1 (fr) 2022-08-08 2022-08-08 Mécanisme de rapport précis pour les exigences de bande passante d'une unité de réseau optique

Country Status (1)

Country Link
WO (1) WO2024031206A1 (fr)

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070237177A1 (en) * 2006-04-10 2007-10-11 Hideki Endo PON system
CN101378388A (zh) * 2007-08-28 2009-03-04 华为技术有限公司 一种无源光网络数据传输的方法、系统和设备
CN102118212A (zh) * 2009-12-30 2011-07-06 中兴通讯股份有限公司 一种进行光网络单元带宽分配的方法及光线路终端
CN102131131A (zh) * 2010-10-14 2011-07-20 华为技术有限公司 一种实现无源光网络拉远的方法和系统及中继装置
WO2013189017A1 (fr) * 2012-06-18 2013-12-27 中兴通讯股份有限公司 Procédé, dispositif, et système pour une allocation dynamique de la bande passante
CN110234041A (zh) * 2019-02-13 2019-09-13 孙武 一种光网络单元带宽需求的精确上报机制

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070237177A1 (en) * 2006-04-10 2007-10-11 Hideki Endo PON system
CN101378388A (zh) * 2007-08-28 2009-03-04 华为技术有限公司 一种无源光网络数据传输的方法、系统和设备
CN102118212A (zh) * 2009-12-30 2011-07-06 中兴通讯股份有限公司 一种进行光网络单元带宽分配的方法及光线路终端
CN102131131A (zh) * 2010-10-14 2011-07-20 华为技术有限公司 一种实现无源光网络拉远的方法和系统及中继装置
WO2013189017A1 (fr) * 2012-06-18 2013-12-27 中兴通讯股份有限公司 Procédé, dispositif, et système pour une allocation dynamique de la bande passante
CN110234041A (zh) * 2019-02-13 2019-09-13 孙武 一种光网络单元带宽需求的精确上报机制

Similar Documents

Publication Publication Date Title
CN102396189B (zh) 动态带宽分配设备和方法以及pon中的光线路终端
CN101771902B (zh) 分配无源光网络上行带宽的方法、系统及装置
CN1929361B (zh) 传输装置
CN103430486B (zh) 最佳动态带宽调度器
KR100547705B1 (ko) 기가비트 이더넷 수동 광 가입자망의 음성서비스를 위한대역폭 할당방법
CN108370270B (zh) 动态带宽的分配方法、装置和无源光网络系统
EP2466769B1 (fr) Procédé d'attribution de bande passante et terminal de ligne optique
KR100950337B1 (ko) Ｔｄｍａ 기반 수동 광가입자망을 위한 효율적인 동적대역폭 할당 장치 및 방법
CN109428827B (zh) 一种流量自适应的缓存分配装置及方法、onu设备
CN110234041B (zh) 一种光网络单元带宽需求的精确上报机制
KR100566294B1 (ko) 기가비트 이더넷 수동 광 가입자망에서 동적 대역폭할당방법
CN100411346C (zh) 无源光网络中多类别业务的调度方法及其系统
CN109348315B (zh) 基于时分复用的调节带宽分配参数的动态带宽分配方法
CN100581294C (zh) 以太网无源光网络多业务动态带宽请求的方法
CN100546227C (zh) 以太网无源光网络多业务动态带宽分配的方法
KR20170111455A (ko) QoS 보장을 위한 맵핑 방법이 적용된 유무선 통합 네트워크 및 업스트림 데이터 전송 방법
WO2007065801A1 (fr) Procede, systeme de communication et unite centrale de communication de controle des acces a un support partage,
CN100574197C (zh) 快速响应的动态带宽分配方法、系统及装置
WO2024031206A1 (fr) Mécanisme de rapport précis pour les exigences de bande passante d'une unité de réseau optique
EP1786149A1 (fr) Procédé, système de communication et unité centrale et péripherique pour contrôler l'accès à un medium partagé
JP5722827B2 (ja) 光加入者線終端装置、光ネットワーク終端装置、及び光ネットワークシステム
CN108667542B (zh) 一种实现上行时分复用的方法及装置
KR100986224B1 (ko) 이더넷 수동광가입자망에서의 동적 대역할당 장치 및 그 방법
US20250202613A1 (en) Energy-efficient dynamic bandwidth assignment
WO2018133480A1 (fr) Procédé et dispositif d'attribution dynamique de bande passante

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 22954186

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 22954186

Country of ref document: EP

Kind code of ref document: A1