CN115484516A - Bandwidth allocation method and device in passive optical network - Google Patents

Bandwidth allocation method and device in passive optical network Download PDF

Info

Publication number
CN115484516A
CN115484516A CN202211084245.8A CN202211084245A CN115484516A CN 115484516 A CN115484516 A CN 115484516A CN 202211084245 A CN202211084245 A CN 202211084245A CN 115484516 A CN115484516 A CN 115484516A
Authority
CN
China
Prior art keywords
queue
bandwidth
container
jth
passive optical
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.)
Granted
Application number
CN202211084245.8A
Other languages
Chinese (zh)
Other versions
CN115484516B (en
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.)
Suzhou University
Original Assignee
Suzhou University
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 Suzhou University filed Critical Suzhou University
Priority to CN202211084245.8A priority Critical patent/CN115484516B/en
Publication of CN115484516A publication Critical patent/CN115484516A/en
Application granted granted Critical
Publication of CN115484516B publication Critical patent/CN115484516B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
    • H04Q11/0062—Network aspects
    • H04Q11/0067—Provisions for optical access or distribution networks, e.g. Gigabit Ethernet Passive Optical Network (GE-PON), ATM-based Passive Optical Network (A-PON), PON-Ring
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
    • H04Q11/0062—Network aspects
    • H04Q2011/0086—Network resource allocation, dimensioning or optimisation

Landscapes

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

Abstract

The invention relates to the technical field of passive optical networks, in particular to a bandwidth allocation method and device in a passive optical network facing to service differentiation delay requirements and the passive optical network 1 Starting to calculate the bandwidth for each queue, and summarizing the bandwidth information of all the queues of the T-CONT to form the bandwidth allocated to the T-CONT after the polling is finished; the bandwidth allocation according to the queue for the granularity is finer and more reasonable than the bandwidth allocation directly according to T-CONT, the bandwidth allocation of the TS service required by each time delay is refined on the basis of not changing the upper limit of the total bandwidth of the T-CONT, and the deterministic time delay of different services is ensured according to the Service Level Agreement (SLA) of the service.

Description

Bandwidth allocation method and device in passive optical network
Technical Field
The present invention relates to the field of passive optical network technology, and in particular, to a bandwidth allocation method and apparatus in a passive optical network for service differentiation delay requirements, and a passive optical network.
Background
In the prior art, in recent years, a large number of emerging low-delay services (such as Cloud virtual reality technology (Cloud VR), interactive network games, online education, etc.) have placed strict requirements on broadband access networks in terms of bandwidth and deterministic end-to-end delay. To meet the requirements of these emerging services, passive Optical Networks (PONs) are evolving towards the next generation. Today the ITU-TSG15 research group has started to set standards for next generation PONs (i.e. higher rate passive optical networks) that can provide single wavelength 50Gbps uplink and downlink rates.
In higher rate passive optical networks (e.g., 50 GPON), time Division Multiplexing (TDM) remains a critical access technology that can be used to share upstream bandwidth among multiple ONUs. In order to improve the bandwidth utilization, a Dynamic Bandwidth Allocation (DBA) mechanism is adopted in the PON. The DBA engine is located at an Optical Line Terminal (OLT), and allocates bandwidth according to the priority of a transmission container (T-CONT) in each Optical Network Unit (ONU) and the amount of stored data, respectively. According to the ITU-T g.9804.2 protocol, ITU-T defines four priorities when allocating bandwidth for different kinds of traffic, respectively fixed bandwidth, guaranteed bandwidth, non-guaranteed bandwidth and best-effort bandwidth. In existing mechanisms, all delay sensitive (TS) traffic is given equal priority.
Although TS traffic generally belongs to the same priority, they actually have different low latency requirements. For example, the delay requirement for strongly interactive VR traffic is below 8 milliseconds, while the delay requirement for industrial automation is no more than 5 milliseconds. If equal priority is used for all TS traffic, they will be allocated equal bandwidth. For those TS services with more stringent delay requirements, the existing mechanisms cannot guarantee their deterministic delay. Therefore, the existing DBA algorithm based on four priorities has been unable to meet various delay requirements of new services. As the first DBA algorithm proposed for ITU-T PON, GIANT and its derivatives mainly solve the bandwidth utilization problem and the frequency allocation problem, neither of which solves the deterministic latency problem for multi-traffic.
Disclosure of Invention
Therefore, the technical problem to be solved by the present invention is to overcome the problem that bandwidth is not allocated for deterministic delay of multiple services in the prior art.
In order to solve the above technical problem, the present invention provides a bandwidth allocation method in a passive optical network, including:
calculating the maximum cycle number m of the j transmission container according to the service delay requirement of the j transmission container in the n type transmission container j ；
Dividing the buffer of the jth transport container into m j A queue
Figure BDA0003834806870000021
Wherein, the first and the second end of the pipe are connected with each other,
Figure BDA0003834806870000022
i ∈ 1.. M, which is the ith queue of the jth transport container j ，
Figure BDA0003834806870000023
The highest priority queue for the jth transport container,
Figure BDA0003834806870000024
the lowest priority queue of the jth transmission container;
constructing a set S of all nth class transport containers including the ith queue i The number of elements in the set is | S i |；
Updating the data volume to be sent of each queue in the current period, and calculating the total bandwidth required to be allocated by the nth transmission container;
calculating the bandwidth to be allocated to each queue according to the data volume to be transmitted of each queue in the current period, the total bandwidth to be allocated to the nth transmission container and the number of elements in the set by taking the priority of the queue as the sequence;
and counting the sum of the distribution bandwidths calculated by all queues in the jth transmission container, and performing bandwidth distribution by taking the sum as the final bandwidth authorization.
Preferably, the queue priorities are used as the sequence, and the data volume to be sent of each queue in the current period is determined according to the data volume to be sent of each queue
Figure BDA0003834806870000025
The n-th type transmission container needs to be allocated with a total bandwidth B and the number | S of elements in the set i L, calculatingBandwidth that each queue should allocate
Figure BDA0003834806870000026
The method comprises the following steps:
s1: setting the initial value of i to 1, the maximum value to m, m being the maximum value of the number of queues of all the transmission containers, will
Figure BDA0003834806870000027
Is set to 0;
s2: updating the bandwidth to be allocated to the ith queue of each transmission container in the ith iteration
Figure BDA0003834806870000031
S3: judging the ith queue of each transmission container
Figure BDA0003834806870000032
Whether the data volume to be transmitted in the current period is not less than the corresponding data volume to be transmitted in the current period
Figure BDA0003834806870000033
If not, deleting the n-th type transmission container set S containing the ith queue i And updating the number of elements in the set | S i If yes, returning to the step S2;
s4: calculating the remaining total bandwidth B if B>0 and | S i If | =0, i = i +1 is updated, the step S1 is returned until B =0, and the iteration is ended.
Preferably, if B>0 and | S i |>0, i remains unchanged, and the process returns to step S1.
Preferably, the sum of the allocated bandwidths calculated by all queues in the jth transmission container is counted
Figure BDA0003834806870000034
The calculation formula of (c) is:
Figure BDA0003834806870000035
preferably, the maximum number m of cycles that the traffic in the jth transport container can tolerate is calculated according to the traffic delay requirement of the jth transport container in the nth class of transport containers j The calculation formula of (2) is as follows:
Figure BDA0003834806870000036
wherein, the first and the second end of the pipe are connected with each other,
Figure BDA0003834806870000037
traffic delay requirement for jth transport container, F l Is the length of a frame, T p Is the transmission delay, T tr Refers to the length of the time slot, SI, in the OLT required for transmitting the data packet j Is a polling period.
Preferably, the updating of the amount of data to be sent in each queue in the current period
Figure BDA0003834806870000038
The calculation formula of (c) is:
Figure BDA0003834806870000039
wherein the content of the first and second substances,
Figure BDA00038348068700000310
the amount of data to be sent for the ith queue of the jth transport container of the previous cycle,
Figure BDA00038348068700000311
the amount of data to be sent in the (i + 1) th queue of the jth transport container in the previous cycle, m is the maximum value of the number of queues of all transport containers,
Figure BDA00038348068700000312
and the total buffer occupation of the transmission container type received by the optical line terminal in the last period.
Preferably, the calculation formula for calculating the total bandwidth B required to be allocated to the nth type transport container is as follows:
B＝N·(AB-T r )
wherein N is the total number of the transmission containers, AB is the maximum bandwidth of each transmission container, T r Is the report length.
The invention also provides a device for bandwidth allocation in a passive optical network, which comprises:
a service tolerance maximum cycle number calculating module, configured to calculate a maximum cycle number m that can be tolerated by service in a jth transport container according to a service delay requirement of the jth transport container in an nth class of transport containers j ；
A queue dividing module for dividing the buffer of the jth transmission container into m j A queue
Figure BDA0003834806870000041
Wherein the content of the first and second substances,
Figure BDA0003834806870000042
i queue for jth transport container, i ∈ 1.. M j ，
Figure BDA0003834806870000043
The highest priority queue for the jth transport container,
Figure BDA0003834806870000044
a lowest priority queue for a jth transport container;
a set constructing module for constructing a set S of all nth class transmission containers including the ith queue i The number of elements in the set is | S i |；
The data volume and total bandwidth calculation module is used for updating the data volume to be sent of each queue in the current period and calculating the total bandwidth required to be allocated to the nth transmission container;
a bandwidth allocation calculation module, configured to calculate, by taking queue priority as an order, a bandwidth to be allocated to each queue according to a data amount to be sent by each queue in the current period, a total bandwidth to be allocated to the nth-type transport container, and the number of elements in the set;
and the bandwidth allocation module is used for counting the sum of the allocated bandwidths calculated by all queues in the jth transmission container and performing bandwidth allocation by taking the sum as the final bandwidth authorization.
The invention also provides a passive optical network, which comprises the bandwidth distribution device in the passive optical network.
Preferably, the passive optical network is applied to delay sensitive services with multiple delay requirements.
Compared with the prior art, the technical scheme of the invention has the following advantages:
the bandwidth allocation method in the passive optical network facing the service differentiation delay requirement calculates the maximum cycle number which can be tolerated by the service according to the maximum delay which can be tolerated by the service, divides the buffer area of each transmission container into a plurality of queues with the maximum cycle which can be tolerated by the service, receives data in each cycle, namely one queue in t-cont, and allocates the queues from Q according to the priority of the queues 1 Starting to calculate the bandwidth for each queue, summarizing the bandwidth information of all the queues of the T-CONT to form the bandwidth allocated to the T-CONT after the polling is finished, wherein the bandwidth allocation according to the granularity of the queues is thinner and more reasonable than the bandwidth allocation directly according to the T-CONT; the method provided by the invention can refine the bandwidth allocation of the TS service required by each time delay on the basis of not changing the upper limit of the total bandwidth of the T-CONT, ensure the deterministic time delay of different services according to the Service Level Agreement (SLA) of the service, and realize the maximum utilization of bandwidth resources; the method provided by the invention is easy to realize, the existing framework is not required to be changed, and the time delay performance of the PON network under the condition of various TS services is obviously improved.
Drawings
In order that the present disclosure may be more readily and clearly understood, reference is now made to the following detailed description of the present disclosure taken in conjunction with the accompanying drawings, in which:
FIG. 1 is a schematic diagram of maximum delay of a data frame;
fig. 2 is a flowchart of an implementation of the bandwidth allocation method in a passive optical network according to the present invention;
FIG. 3 is a fine-grained queue diagram;
FIG. 4 is a flow chart of a fine-grained bandwidth allocation algorithm;
fig. 5 is a schematic diagram of the delay requirements for each light source network element to transmit delay sensitive traffic;
FIG. 6 is a graph of XGEM frame delay cumulative distribution function of different traffic in T2 under low load (0.3) for two methods;
FIG. 7 is a graph of cumulative distribution function of XGEM frame delay for different traffic in T2 under high load (0.75) for two methods;
fig. 8 is a block diagram of a device for bandwidth allocation in a passive optical network according to an embodiment of the present invention.
Detailed Description
The core of the invention is to provide a bandwidth allocation method and device in a passive optical network facing to service differentiated time delay requirements and the passive optical network, and to refine bandwidth allocation of TS services required by various time delays.
In order that those skilled in the art will better understand the disclosure, the invention will be described in further detail with reference to the accompanying drawings and specific embodiments. It should be apparent that the described embodiments are only some embodiments of the present invention, and not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Referring to fig. 1, fig. 1 is a flowchart illustrating an implementation of a bandwidth allocation method in a passive optical network according to the present invention; the specific operation steps are as follows:
a new fine-grained bandwidth allocation algorithm is provided to reasonably allocate the bandwidths of services with different time delay requirements. The algorithm will preferentially allocate bandwidth to a portion of T-CONT1 (T1), T-CONT 2 (T2), T-CONT 3 (T3), and then will allocate the remaining bandwidth to T3 and T-CONT 4 (T4).
S101: calculating the second transmission container according to the service delay requirement of the jth transmission container in the nth transmission containerMaximum number m of cycles tolerable by the traffic in j transport containers j ；
In order to accurately control the time delay, the maximum time delay of a data frame which may occur in the scheduling process is calculated, as shown in fig. 2, a data frame arrives at an ONU at the moment when the T-CONT reports, so the report in this round cannot upload information containing the data frame, and the report information containing the data frame cannot be sent until the next period (period 2). In the following polling period, the amount of data that is queued ahead of the data frame determines whether the OLT can allocate bandwidth for this data packet. The total number of waiting cycles is determined by the following formula:
Figure BDA0003834806870000061
wherein Q is j Representing the total length of the queue, AB, of the jth T-CONT preceding the packet in the T period j Representing the maximum bandwidth that can be allocated to the T-CONT in a polling period. Is undergoing (m) j -1) after a period, the OLT sends a bandwidth grant to the data frame, and before starting the upload, the queuing delay experienced by the data packet is: t is a unit of Q ＝(1+m j )·SI j -T q +T' q Wherein, T q Is the wait time before reporting, T' q Is the latency before transmission of the data frame. T is q And T' q The difference does not exceed one upstream frame length. Thus T Q The maximum can be written as: t is Q ＝(1+m j )·SI j +F l ，F l Is the length of one frame. The total delay L experienced by the packet until its transmission is complete max Comprises the following steps: l is max ＝T Q +T p +T tr ＝(1+m j )·SI j +F l +T p +T tr ，T tr The length of a time slot in an OLT (optical line terminal) required for transmitting a data packet is referred to;
thereby, the delay requirement of each service can be met
Figure BDA0003834806870000062
Estimate the maximum number of cycles (i.e. m) that the service can tolerate in the jth T-CONT j ) Comprises the following steps:
Figure BDA0003834806870000071
s102: divide the buffer of the jth transport container into m j A queue
Figure BDA0003834806870000072
Wherein the content of the first and second substances,
Figure BDA0003834806870000073
i ∈ 1.. M, which is the ith queue of the jth transport container j ，
Figure BDA0003834806870000074
The highest priority queue for the jth transport container,
Figure BDA0003834806870000075
a lowest priority queue for a jth transport container;
in order to meet different delay requirements of TS services, a fine-grained queue mechanism is introduced in an existing PON architecture. As shown in FIG. 3, we subdivide each T-CONT buffer into m j A queue, set Q n Is the nth queue (1)<n is less than or equal to m), then Q n The data received in the (t-m + n-1) th cycle is stored. For example, when n = m, Q n The data of the (t-1) th cycle (i.e., the last cycle) is stored. But the first queue Q 1 Not only will the (t-m) th cycle of data be stored, but also the earlier cycle arriving data (that has expired). Thus, for any T-CONT j, Q 1 Is the highest priority queue, and
Figure BDA00038348068700000714
is the lowest priority queue.
S103: constructing a set S of all nth class transport containers including the ith queue i The number of elements in the set is | S i |；
S i Is an inclusion queue
Figure BDA0003834806870000076
T of-a set of CONT, i in total; i S i I represents S i Number of elements in (1).
S104: updating the data volume to be sent of each queue in the current period, and calculating the total bandwidth required to be allocated to the nth transmission container;
before the OLT starts to allocate the bandwidth, the OLT updates the state of each queue of the T-CONT. Setting the current period as T, the jth queue of the T-CONT
Figure BDA0003834806870000077
In a state of
Figure BDA0003834806870000078
The update equation of (2) is as follows:
Figure BDA0003834806870000079
wherein the content of the first and second substances,
Figure BDA00038348068700000710
the amount of data to be sent for the ith queue of the jth transport container of the previous cycle,
Figure BDA00038348068700000711
the amount of data to be sent for the ith +1 st queue of the jth transport container in the last cycle, m is the maximum value of the number of queues of all transport containers,
Figure BDA00038348068700000712
the total buffer occupation of the type of transport container received by the optical line terminal in the last period,
Figure BDA00038348068700000713
is the data newly received in the last cycle;
after the queue is updated, the OLT needs to calculate the effective bandwidth that can be allocated to this type of T-CONT. The method allocates bandwidth to all the T-CONT of the same class in a centralized way, and the T-CONT of the class is set to be N in total, the maximum bandwidth of each T-CONT is AB, and the length of report is T r . The total bandwidth is thus: b = N. (AB-T) r ) Wherein N is the total number of the transmission containers, AB is the maximum bandwidth of each transmission container, T r Is the report length.
S105: calculating the bandwidth to be allocated to each queue according to the data volume to be transmitted of each queue in the current period, the total bandwidth to be allocated to the nth transmission container and the number of elements in the set by taking the priority of the queue as the sequence;
bandwidth is calculated and allocated for each queue. The calculation sequence is carried out according to the sequence number (i.e. i) of each queue, and the smaller the sequence number is, the higher the priority is. For example, for two different T-CONT, the first transport container T-CONT1 in the first type of transport containers in fig. 2 (1) And a second transport container T-CONT1 in the first type of transport container (2) Q of both 1 (i.e. the
Figure BDA0003834806870000081
And
Figure BDA0003834806870000082
) Are of the same priority; and for T-CONT1 (2) Is/are as follows
Figure BDA0003834806870000083
And T-CONT1 (3) Is/are as follows
Figure BDA0003834806870000084
The former has a higher priority than the latter because 4 is less than 5. But this does not represent that the queues in the same T-CONT need to upload data separately during a cycle, since that would reduce bandwidth utilization. OLT will slave Q 1 And starting to calculate the bandwidth for each queue until the polling is finished, and summarizing the bandwidth information of all the queues of the T-CONT to form the bandwidth allocated to the T-CONT.
S106: and counting the sum of the distribution bandwidths calculated by all queues in the jth transmission container, and performing bandwidth distribution by taking the sum as the final bandwidth authorization.
Counting the allocated bandwidth calculated by all queues in the jth transport containerAnd
Figure BDA0003834806870000085
the calculation formula of (c) is:
Figure BDA0003834806870000086
finally, the process is carried out in a batch,
Figure BDA0003834806870000087
will be sent as a bandwidth grant in the BW-map to the jth T-CONT and the bandwidth allocation is finished.
The bandwidth allocation method in the passive optical network facing to the service differentiation delay requirement firstly calculates the maximum cycle number of the service tolerance according to the maximum delay of the service tolerance, divides the buffer area of each transmission container into a plurality of queues with the maximum cycle of the service tolerance, receives data in each cycle, namely one queue in t-cont, and selects Q from the queues according to the priority of the queues 1 Starting to calculate the bandwidth for each queue, summarizing the bandwidth information of all the queues of the T-CONT to form the bandwidth allocated to the T-CONT after the polling is finished, wherein the bandwidth allocation according to the granularity of the queues is thinner and more reasonable than the bandwidth allocation directly according to the T-CONT; the method provided by the invention can refine the bandwidth allocation of the TS service required by each time delay on the basis of not changing the T-CONT total bandwidth upper limit, ensure the deterministic time delay of different services according to the Service Level Agreement (SLA) of the service, and realize the maximum utilization of bandwidth resources; the method provided by the invention is easy to realize, the existing framework is not required to be changed, and the time delay performance of the PON network under the condition of various TS services is obviously improved.
As shown in fig. 4, based on the above embodiment, the present embodiment further details step S105:
s151: setting the initial value of i to 1, setting the maximum value to m (i.e. the maximum number of iterations of the algorithm), where m is the maximum value of the number of queues of all the transmission containers, will
Figure BDA0003834806870000091
Is set to 0;
s152: updating the bandwidth which should be allocated to the ith queue of each transmission container in the ith iteration
Figure BDA0003834806870000092
S153: judging the ith queue of each transmission container
Figure BDA0003834806870000093
Whether the data volume to be sent in the current period is not less than the corresponding data volume to be sent in the current period
Figure BDA0003834806870000094
If not, deleting the n-th type transmission container set S containing the ith queue i And updating the number of elements in the set | S i If yes, returning to the step S2;
s154: calculating the remaining total bandwidth B if B>0 and | S i If | =0, updating i = i +1, entering the (i + 1) th iteration, returning to the step S1 until B =0, ending the iteration, and if B =0>0 and | S i >And |0, keeping i unchanged, and returning to the step S1.
The fine-grained bandwidth allocation method in the passive optical network facing the service differentiation time delay requirement ensures the deterministic time delay of each service in the PON environment of TS service with multiple time delay requirements.
Based on the above embodiments, the present embodiment uses matlab software to perform simulation comparison on the traditional DBA algorithm and the fine-grained bandwidth allocation method proposed herein, which specifically includes the following steps:
in the conventional DBA, we have chosen the GIANT algorithm as the benchmark, since GIANT is the first DBA algorithm typical of ITU-TPON. We have designed a 50G-PON scenario consisting of 16 ONUs and 1 OLT. Each ONU contains 4 different T-CONT. As shown in fig. 5, there are a total of four delay sensitive services with different delay requirements (i.e., 1.5ms, 3ms, 5ms, and 10 ms) in the simulation, with one of the services being transmitted for every 4 ONUs. The distance between the ONU and the OLT was set to 10 km and the propagation delay was 50 μ s. The arrival time of the traffic generated at the ONUs follows the poisson process, with each ONU having the same arrival rate. The resulting data frame is an ethernet frame, and after encapsulation, the XGEM frame is between 72 bytes and 1526 bytes in size. Due to the increased proportion of low delay traffic in higher rate PONs, we increase the traffic received by each T2 in the ONU to 40%, while the other three T-CONT account for 20% each. Accordingly, the maximum service rates of the different types of T-CONT (i.e., T1, T2, T3, T4) are 0.63Gb/s, 0.94Gb/s, and 0.63Gb/s, respectively. Since the fine-grained bandwidth allocation algorithm and the conventional algorithm have the same service parameters and low-latency traffic is concentrated on T2, the latency performance of T1, T3 and T4 in the two methods does not change. Thus, the simulation mainly tests the performance of the multi-service in T2.
Fig. 6 and 7 show graphs of XGEM frame delay cumulative distribution functions (CDF graphs) for different traffic in T2 under low load (0.3) and high load (0.75) for both methods. As shown in fig. 6, when the load is 0.3, the results of the two methods are very similar, mainly because the data received in each polling cycle can be transmitted immediately in the next polling cycle and thus will not accumulate in the buffer. Under high load, as shown in fig. 7, for T2 traffic with delay requirements of 1.5ms, 3ms, 5ms and 10ms, respectively, compared with the conventional algorithm, the percentage of data frame delay guarantees of the fine-grained bandwidth allocation algorithm is increased from 8.9% to 98.2%, from 33.4% to 98.6%, from 62.4% to 97.5%, and from 96.3% to 97.5%, respectively. The results show that the fine-grained bandwidth allocation algorithm has better performance no matter what the delay requirement of the TS service is.
Referring to fig. 8, fig. 8 is a block diagram illustrating a structure of a bandwidth allocation apparatus in a passive optical network according to an embodiment of the present invention; the specific device may include:
a maximum cycle number tolerance calculation module 100, configured to calculate a maximum cycle number m that can be tolerated by the service in a jth transport container according to a service delay requirement of the jth transport container in the nth class transport container j ；
A queue partitioning module 200 for partitioning a buffer of a jth transport container into m j A queue
Figure BDA0003834806870000101
Wherein, the first and the second end of the pipe are connected with each other,
Figure BDA0003834806870000102
i ∈ 1.. M, which is the ith queue of the jth transport container j ，
Figure BDA0003834806870000103
The highest priority queue for the jth transport container,
Figure BDA0003834806870000104
the lowest priority queue of the jth transmission container;
a set constructing module 300 for constructing a set S of all nth type transport containers including the ith queue i The number of elements in the set is | S i |；
A data volume and total bandwidth calculating module 400, configured to update a data volume to be sent in each queue in a current period, and calculate a total bandwidth to be allocated to an nth-type transmission container;
a bandwidth allocation calculating module 500, configured to calculate, by taking the queue priority as an order, a bandwidth to be allocated to each queue according to the amount of data to be sent in each queue in the current period, the total bandwidth to be allocated to the nth-type transport container, and the number of elements in the set;
and the bandwidth allocation module 600 is configured to count a sum of allocated bandwidths calculated by all queues in the jth transmission container, and perform bandwidth allocation by using the sum as a final bandwidth grant.
The apparatus for bandwidth allocation in a passive optical network of this embodiment is configured to implement the foregoing method for bandwidth allocation in a passive optical network, and therefore a specific implementation manner of the apparatus for bandwidth allocation in a passive optical network may be seen in portions of the foregoing method for bandwidth allocation in a passive optical network, for example, a traffic tolerance maximum cycle number calculating module 100, a queue dividing module 200, a set constructing module 300, a data amount and total bandwidth calculating module 400, a bandwidth allocation calculating module 500, and a bandwidth allocating module 600, which are respectively configured to implement steps S101, S102, S103, S104, S105, and S106 in the foregoing method for bandwidth allocation in a passive optical network, so that the specific implementation manner thereof may refer to descriptions of corresponding embodiments of the respective portions, and no further description is provided herein.
The invention also provides a passive optical network, which comprises the device for bandwidth distribution in the passive optical network and is applied to the delay sensitive service with multiple delay requirements.
It should be understood that the above examples are only for clarity of illustration and are not intended to limit the embodiments. Other variations and modifications will be apparent to persons skilled in the art in light of the above description. This need not be, nor should it be exhaustive of all embodiments. And obvious variations or modifications therefrom are within the scope of the invention.

Claims (10)

1. A method for bandwidth allocation in a passive optical network, comprising:
calculating the maximum cycle number m of the j transmission container according to the service delay requirement of the j transmission container in the n type transmission container j ；
Divide the buffer of the jth transport container into m j A queue
Figure FDA0003834806860000011
Wherein the content of the first and second substances,
Figure FDA0003834806860000012
i ∈ 1 \ 8230; m of the ith queue of the jth transport container j ，
Figure FDA0003834806860000013
The highest priority queue for the jth transport container,
Figure FDA0003834806860000014
the lowest priority queue of the jth transmission container;
constructing a set of all nth class transport containers including the ith queueClosing S i The number of elements in the set is | S i |；
Updating the data volume to be sent of each queue in the current period, and calculating the total bandwidth required to be allocated by the nth transmission container;
calculating the bandwidth to be allocated to each queue according to the data amount to be transmitted of each queue in the current period, the total bandwidth to be allocated to the nth transmission container and the number of elements in the set by taking the priority of the queue as an order;
and counting the sum of the distribution bandwidths calculated by all queues in the jth transmission container, and performing bandwidth distribution by taking the sum as the final bandwidth authorization.
2. The method of claim 1, wherein the queue priorities are used as the sequence, and the method is characterized in that the queue priorities are used as the sequence according to the amount of data to be sent in each queue in the current period
Figure FDA0003834806860000015
The total bandwidth B required to be allocated by the nth type transmission container and the number | S of elements in the set i Calculating the bandwidth each queue should allocate
Figure FDA0003834806860000016
The method comprises the following steps:
s1: setting the initial value of i to 1, the maximum value to m, m being the maximum value of the number of queues of all the transmission containers, will
Figure FDA0003834806860000017
Is set to 0;
s2: updating the bandwidth to be allocated to the ith queue of each transmission container in the ith iteration
Figure FDA0003834806860000018
S3: judging the ith queue of each transmission container
Figure FDA0003834806860000021
Whether the data volume to be transmitted in the current period is not less than the corresponding data volume to be transmitted in the current period
Figure FDA0003834806860000022
If not, deleting the n-th type transmission container set S containing the ith queue i And updating the number of elements in the set | S i If yes, returning to the step S2;
s4: calculating the remaining total bandwidth B if B > 0 and | S i If | =0, i = i +1 is updated, the step S1 is returned until B =0, and the iteration is ended.
3. A method for bandwidth allocation in a passive optical network as claimed in claim 2, wherein if B > 0 and | S i If | is greater than 0, i remains unchanged, and the step S1 is returned to.
4. A method for bandwidth allocation in a passive optical network as claimed in claim 2, characterized in that the sum of the allocated bandwidths calculated from all queues in the statistical jth transport container
Figure FDA0003834806860000023
The calculation formula of (2) is as follows:
Figure FDA0003834806860000024
5. a method for bandwidth allocation in a passive optical network as claimed in claim 1, wherein the maximum number m of cycles that can be tolerated by the traffic in the jth transport container is calculated according to the traffic delay requirement of the jth transport container in the nth class of transport containers j The calculation formula of (2) is as follows:
Figure FDA0003834806860000025
wherein the content of the first and second substances,
Figure FDA0003834806860000026
traffic delay requirement for jth transport container, F l Is the length of a frame, T p Is the transmission delay, T tr Refers to the length of the time slot, SI, in the OLT required for transmitting the data packet j Is a polling period.
6. A method for bandwidth allocation in a passive optical network as claimed in claim 1, wherein said updating the amount of data to be sent in each queue in the current period
Figure FDA0003834806860000027
The calculation formula of (c) is:
Figure FDA0003834806860000028
wherein the content of the first and second substances,
Figure FDA0003834806860000029
the amount of data to be sent for the ith queue of the jth transport container of the last cycle,
Figure FDA0003834806860000031
the amount of data to be sent in the (i + 1) th queue of the jth transport container in the previous cycle, m is the maximum value of the number of queues of all transport containers,
Figure FDA0003834806860000032
and the total buffer occupation of the transmission container type received by the optical line terminal in the last period.
7. A method for bandwidth allocation in a passive optical network as claimed in claim 1, wherein the calculation formula for calculating the total bandwidth B to be allocated to the nth transmission container is:
B＝N·(AB-T r )
wherein N is the total number of the transmission containers, AB is the maximum bandwidth of each transmission container, T r Is the report length.
8. An apparatus for bandwidth allocation in a passive optical network, comprising:
a service tolerance maximum cycle number calculating module, configured to calculate a maximum cycle number m that can be tolerated by service in a jth transport container according to a service delay requirement of the jth transport container in an nth class of transport containers j ；
A queue dividing module for dividing the buffer of the jth transmission container into m j A queue
Figure FDA0003834806860000033
Wherein, the first and the second end of the pipe are connected with each other,
Figure FDA0003834806860000034
i ∈ 1 \ 8230; m of the ith queue of the jth transport container j ，
Figure FDA0003834806860000035
The highest priority queue for the jth transport container,
Figure FDA0003834806860000036
the lowest priority queue of the jth transmission container;
a set constructing module for constructing a set S containing all nth class transmission containers of the ith queue i The number of elements in the set is | S i |；
The data volume and total bandwidth calculation module is used for updating the data volume to be sent of each queue in the current period and calculating the total bandwidth required to be allocated by the nth transmission container;
a bandwidth allocation calculation module, configured to calculate, with queue priority as an order, a bandwidth to be allocated to each queue according to a data amount to be sent by each queue in the current period, a total bandwidth to be allocated to the nth transmission container, and the number of elements in the set;
and the bandwidth allocation module is used for counting the sum of the allocated bandwidths calculated by all queues in the jth transmission container and performing bandwidth allocation by taking the sum as the final bandwidth authorization.
9. A passive optical network comprising an apparatus for bandwidth allocation in a passive optical network as claimed in claim 8.
10. The passive optical network according to claim 9, characterized in that it is applied to delay sensitive services with multiple delay requirements.
CN202211084245.8A 2022-09-06 2022-09-06 Bandwidth allocation method and device in passive optical network Active CN115484516B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202211084245.8A CN115484516B (en) 2022-09-06 2022-09-06 Bandwidth allocation method and device in passive optical network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202211084245.8A CN115484516B (en) 2022-09-06 2022-09-06 Bandwidth allocation method and device in passive optical network

Publications (2)

Publication Number Publication Date
CN115484516A true CN115484516A (en) 2022-12-16
CN115484516B CN115484516B (en) 2023-07-07

Family

ID=84392504

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202211084245.8A Active CN115484516B (en) 2022-09-06 2022-09-06 Bandwidth allocation method and device in passive optical network

Country Status (1)

Country Link
CN (1) CN115484516B (en)

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070133988A1 (en) * 2005-12-12 2007-06-14 Yu-Gun Kim GPON system and method for bandwidth allocation in GPON system
US20110129223A1 (en) * 2009-11-30 2011-06-02 Electronics And Telecommunications Research Institute Apparatus and method for allocating dynamic bandwidth
CN102158770A (en) * 2010-02-12 2011-08-17 中兴通讯股份有限公司 Method and system for allocating uplink bandwidth in passive optical network
CN103560936A (en) * 2013-11-22 2014-02-05 烽火通信科技股份有限公司 Method for calculating ONU average queue length in PON system
CN106330771A (en) * 2016-07-29 2017-01-11 北京蓝山科技股份有限公司 Dynamic bandwidth allocation device and method based on GPON system
KR20210065393A (en) * 2019-11-27 2021-06-04 한국전자통신연구원 Integrated Dynamic Bandwidth Allocation Method and Apparatus in Passive Optical Networks

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070133988A1 (en) * 2005-12-12 2007-06-14 Yu-Gun Kim GPON system and method for bandwidth allocation in GPON system
US20110129223A1 (en) * 2009-11-30 2011-06-02 Electronics And Telecommunications Research Institute Apparatus and method for allocating dynamic bandwidth
CN102158770A (en) * 2010-02-12 2011-08-17 中兴通讯股份有限公司 Method and system for allocating uplink bandwidth in passive optical network
CN103560936A (en) * 2013-11-22 2014-02-05 烽火通信科技股份有限公司 Method for calculating ONU average queue length in PON system
CN106330771A (en) * 2016-07-29 2017-01-11 北京蓝山科技股份有限公司 Dynamic bandwidth allocation device and method based on GPON system
KR20210065393A (en) * 2019-11-27 2021-06-04 한국전자통신연구원 Integrated Dynamic Bandwidth Allocation Method and Apparatus in Passive Optical Networks

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
PANDELIS KOURTESSIS等: "Efficient T-CONT-Agnostic Bandwidth and Wavelength Allocation for NG-PON2", 《 JOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKING》, vol. 11, no. 7, pages 383, XP011732026, DOI: 10.1364/JOCN.11.000383 *
董亮: "基于T-CONT轮询的GPON上行动态带宽分配算法研究", 《中国优秀硕士学位论文全文数据库 基础科学辑 信息科技》, no. 3, pages 136 - 915 *

Also Published As

Publication number Publication date
CN115484516B (en) 2023-07-07

Similar Documents

Publication Publication Date Title
US9326051B2 (en) Method for soft bandwidth limiting in dynamic bandwidth allocation
Leligou et al. Efficient medium arbitration of FSAN‐compliant GPONs
KR100506209B1 (en) Dynamic bandwidth allocation method considering multiple servics for ethernet passive optical network
CN102594682B (en) Traffic-prediction-based dynamic bandwidth allocation method for gigabit-capable passive optical network (GPON)
KR100666989B1 (en) Epon system and method of traffic scheduling thereof
EP2466769B1 (en) Bandwidth allocation method and optical line terminal
JP2014508463A (en) Optimized dynamic bandwidth scheduler
Arokkiam et al. Refining the GIANT dynamic bandwidth allocation mechanism for XG-PON
US20120149418A1 (en) Bandwidth allocation
JP2008270898A (en) Optical subscriber line terminal
Su et al. Time-aware deterministic bandwidth allocation scheme in TDM-PON for time-sensitive industrial flows
Qi-yu et al. A dynamic bandwidth allocation scheme for GPON based on traffic prediction
CN115484516B (en) Bandwidth allocation method and device in passive optical network
WO2023082500A1 (en) Mapping multiplexing method and apparatus for optical transport network, and electronic device and storage medium
Lu et al. Fine-Granularity Bandwidth Allocation for Diverse Low-Latency Services in Higher-Speed Passive Optical Networks
Skubic et al. Improved scheme for estimating T-CONT bandwidth demand in status reporting DBA for NG-PON
US11706759B2 (en) Systems and methods for latency reduction using map staggering
CN115484517B (en) Line rate optimization method and device in passive optical network
Saffer et al. Analysis of globally gated Markovian limited cyclic polling model and its application to uplink traffic in the IEEE 802.16 network
KR100986224B1 (en) Device for active bandwidth allocation in ethernet passive optical network and method thereof
TWI396401B (en) Dynamic Bandwidth Assignment Method for Passive Fiber Network
KR101001515B1 (en) Media access control method for weighted fairness guarantee scheduling in ethernet passive optical network
Peha Simulating ATM integrated-services networks
JP6787853B2 (en) Communication system, subscriber line termination device and subscriber line end station device
Hwang et al. A Bi-Partitional Dynamic Bandwidth Allocation Mechanism for Differentiated Services to Support State Report ONUs in GPON

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant