CN115484516B - Bandwidth allocation method and device in passive optical network - Google Patents
Bandwidth allocation method and device in passive optical network Download PDFInfo
- Publication number
- CN115484516B CN115484516B CN202211084245.8A CN202211084245A CN115484516B CN 115484516 B CN115484516 B CN 115484516B CN 202211084245 A CN202211084245 A CN 202211084245A CN 115484516 B CN115484516 B CN 115484516B
- Authority
- CN
- China
- Prior art keywords
- queue
- bandwidth
- transport container
- jth
- container
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
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
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 time delay requirements and the passive optical network, wherein the bandwidth allocation method and device comprises the steps of firstly calculating service energy capacity according to the maximum time delay of service toleranceThe maximum cycle number of each transmission container is divided into a maximum cycle number queue which can be tolerated by the service, the data received in each cycle is a queue in t-cont, and the data is received from Q according to the priority of the queue 1 Calculating bandwidth for each queue, and summarizing the bandwidth information of all the queues of the T-CONT until the polling is finished to obtain the bandwidth distributed to the T-CONT; the bandwidth allocation for granularity removal according to the queues is finer and more reasonable than the bandwidth allocation directly according to T-CONT, the bandwidth allocation of TS business 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 businesses is ensured according to the Service Level Agreement (SLA) of the business.
Description
Technical Field
The invention relates to the technical field of passive optical networks, in particular to a bandwidth allocation method, a bandwidth allocation device and a passive optical network for service differentiation time delay requirements.
Background
In the prior art, in recent years, a great deal of emerging low-delay services (such as Cloud virtual reality technology (Cloud VR), interactive network games, online education and the like) place strict requirements on broadband access networks in terms of bandwidth and deterministic end-to-end delay. In order to meet the requirements of these emerging services, passive Optical Networks (PON) are evolving towards the next generation. The ITU-t sg15 research group has now begun to develop standards for next-generation PON (i.e., higher-rate passive optical networks) that can provide upstream and downstream rates of 50Gbps for a single wavelength.
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 bandwidth utilization, a Dynamic Bandwidth Allocation (DBA) mechanism is employed in the PON. The DBA engine is located at an Optical Line Terminal (OLT) and allocates bandwidth according to the priority of the transport container (T-CONT) and the amount of data stored in each Optical Network Unit (ONU), respectively. According to the ITU-T g.9804.2 protocol, the ITU-T defines four priorities in allocating bandwidth for heterogeneous services, a fixed bandwidth, a guaranteed bandwidth, a non-guaranteed bandwidth and a best effort bandwidth, respectively. In existing mechanisms, all delay sensitive (TS) traffic is given equal priority.
While TS traffic usually belongs to the same priority, they actually have different low latency requirements. For example, the latency requirement for Jiang Jiaohu VR traffic is less than 8 milliseconds, while the latency requirement for industrial automation is no more than 5 milliseconds. If equal priority is employed for all TS traffic, they will be allocated equal bandwidth. For those TS services with more stringent delay requirements, the existing mechanisms do not guarantee their deterministic delay. Thus, existing four priority based DBA algorithms have failed to meet the various delay requirements of new traffic. As the first proposed DBA algorithm for ITU-T PON, the gint and its derivative algorithms mainly solve the bandwidth utilization problem and the allocation frequency problem, which do not solve the deterministic latency problem for multiple services.
Disclosure of Invention
Therefore, the technical problem to be solved by the invention is to solve the problem that bandwidth is not allocated for deterministic delay of multiple services in the prior art.
In order to solve the technical problems, the present invention provides a bandwidth allocation method in a passive optical network, including:
calculating the maximum cycle number m of the service tolerance in the jth transport container according to the service delay requirement of the jth transport container in the nth transport container j ；
Dividing the buffer of the jth transport container into m j Individual queues
Wherein (1)>
An ith queue for the jth transport container, i.e. 1..m j ，/>
The highest priority queue for the jth transport container,/for the jth transport container>
The lowest priority queue for the jth transport container;
constructing a place containing the ith queueSet S with class n transport containers i The number of elements in the set is |S i |；
Updating the data quantity to be sent of each queue in the current period, and calculating the total bandwidth required to be allocated by the n-th transmission container;
taking the queue priority as a sequence, and calculating the bandwidth to be allocated to each queue according to the data volume to be transmitted by each queue in the current period, the total bandwidth to be allocated to the nth class transmission container and the element number in the set;
and counting the sum of the allocated bandwidths calculated by all queues in the jth transmission container, and taking the sum as the final bandwidth authorization to allocate the bandwidth.
Preferably, the data amount to be sent by each queue in the current period is based on the queue priority order
The n-type transmission container needs to allocate the total bandwidth B and the element number S in the set i Computing the bandwidth that each queue should allocate +.>
Comprising the following steps:
s1: setting the initial value of i to 1, the maximum value to m, wherein m is the maximum value in the number of all transmission container queues, and
the initial value of (2) is set to 0;
s2: at the ith iteration, the bandwidth to be allocated to the ith queue of each transport container is updated
S3: judging the ith queue of each transmission container
Whether or not it is not less than the data size expected to be transmitted at the current cycle>
If not, deleting all the n-th class transmission container sets S containing the i-th queue i Corresponding transport container elements in the collection, and updating the number of elements |S in the collection i If the detected value is smaller than the preset threshold value, returning to the step S2;
s4: calculating the remaining total bandwidth B, if B>0 and |S i I=0, then i=i+1 is updated, and step S1 is returned until b=0, ending the iteration.
Preferably, said case B>0 and |S i |>0, i remains unchanged, returning to step S1.
Preferably, the sum of the allocated bandwidths calculated by all queues in the jth transport container is counted
The calculation formula of (2) is as follows:
preferably, the method calculates the maximum cycle number m of the jth transport container which can be tolerated by the service according to the service delay requirement of the jth transport container in the nth transport container j The calculation formula of (2) is as follows:
wherein, the liquid crystal display device comprises a liquid crystal display device,
service delay requirement for jth transport container, F l Is the length of one frame, T p Is the transmission delay, T tr Refers to the time slot length, SI, in the optical line terminal required for transmitting data packets j Is a polling period.
Preferably, the data volume to be sent by each queue in the current period is updated
The calculation formula of (2) is as follows:
wherein, the liquid crystal display device comprises a liquid crystal display device,
for the data quantity to be transmitted for the ith queue of the jth transport container of the last cycle,/-, is->
The amount of data to be transmitted for the (i+1) th queue of the jth transport container of the previous cycle, m being the maximum value among the number of queues of all transport containers,
the total buffer area of the transmission container received by the optical line terminal in the last period is occupied.
Preferably, the calculation formula for calculating the total bandwidth B to be allocated to the n-th class 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 distributing bandwidth in the passive optical network, which comprises:
a service tolerant maximum cycle number calculating module for calculating a maximum cycle number m of the service tolerant in the jth transport container according to the service delay requirement of the jth transport container in the nth transport container j ；
A queue dividing module for dividing the buffer area of the jth transport container into m j Individual queues
Wherein (1)>
An ith queue for the jth transport container, i.e. 1..m j ，/>
The highest priority queue for the jth transport container,/for the jth transport container>
The lowest priority queue for the jth transport container;
a set construction module for constructing a set S of all n-th class transport containers comprising an i-th queue i The number of elements in the set is |S i |；
The data quantity and total bandwidth calculation module is used for updating the data quantity to be sent by each queue in the current period and calculating the total bandwidth required to be allocated by the nth class transmission container;
the bandwidth allocation calculation module is used for calculating the bandwidth to be allocated to each queue according to the data volume to be transmitted by each queue in the current period, the total bandwidth to be allocated by the nth class transmission container and the element number in the set;
and the bandwidth allocation module is used for counting the sum of the allocated bandwidths calculated by all the queues in the jth transmission container, and taking the sum as the final bandwidth authorization to allocate the bandwidth.
The invention also provides a passive optical network comprising the device for distributing the bandwidth 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 passive optical network facing service differentiation delay requirement of the invention firstly calculates the maximum cycle number of service tolerance according to the maximum delay of service tolerance, divides the buffer area of each transmission container into a plurality of queues of the maximum cycle number of service tolerance, and connects each cycleThe received data is a queue in t-cont, and Q is selected according to the priority of the queue 1 Calculating bandwidth for each queue, and summarizing the bandwidth information of all the queues of the T-CONT to become the bandwidth allocated to the T-CONT after the polling is finished, wherein the bandwidth allocation for granularity according to the queues is finer 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 TS service requiring each time delay on the basis of not changing the upper limit of the total bandwidth of T-CONT, ensures the deterministic time delay of different services according to the Service Level Agreement (SLA) of the service, and realizes the maximum utilization of bandwidth resources; the method provided by the invention is easy to realize without changing the existing framework, and the time delay performance of the PON network under the condition of various TS services is obviously improved.
Drawings
In order that the invention may be more readily understood, a more particular description of the invention will be rendered by reference to specific embodiments thereof which are illustrated in the appended drawings, in which:
FIG. 1 is a schematic diagram of a maximum delay of a data frame;
FIG. 2 is a flow chart of an implementation of the bandwidth allocation method in a passive optical network of the present invention;
FIG. 3 is a fine granularity queue schematic;
FIG. 4 is a flow chart of a fine granularity bandwidth allocation algorithm;
FIG. 5 is a schematic diagram of the delay requirement of each light source network element transmitting delay sensitive traffic;
FIG. 6 is a graph of XGEM frame delay cumulative distribution function for different traffic in T2 under low load (0.3) for two approaches;
FIG. 7 is a graph of XGEM frame delay cumulative distribution function for different traffic in T2 under high load (0.75) for two methods;
fig. 8 is a block diagram of a device for allocating bandwidth 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 differentiation time delay requirements and the passive optical network, thereby refining the bandwidth allocation of TS service required by each time delay.
In order to better understand the aspects of the present invention, the present invention will be described in further detail with reference to the accompanying drawings and detailed description. It will be apparent that the described embodiments are only some, but not all, embodiments of the invention. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
Referring to fig. 1, fig. 1 is a flowchart illustrating an implementation method of bandwidth allocation in a passive optical network according to the present invention; the specific operation steps are as follows:
we propose a new set of fine-grained bandwidth allocation algorithms to reasonably allocate the bandwidth of traffic with different latency 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 maximum cycle number m of the service tolerance in the jth transport container according to the service delay requirement of the jth transport container in the nth transport container j ；
In order to precisely control the delay, the maximum delay of the data frame which may occur in the scheduling process is calculated first, as shown in fig. 2, a data frame arrives at the ONU at the moment when the T-CONT uploads the report, so that the round of report cannot upload the information containing the data frame, and the report information containing the data frame cannot be sent until the next cycle (cycle 2). In the following polling period, the amount of data that is arranged in front of the data frame determines whether the OLT can allocate bandwidth for this data packet. And the total number of waiting periods is determined by:
wherein Q is j Represents the total length of the queue, AB, of the jth T-CONT queued before the packet in the T period j Representing the maximum bandwidth that can be allocated to the T-CONT in a polling period. After experiencing (m) j -1) after a period, the OLT transmits a bandwidth grant for the data frame, the data being before starting the uploadThe queuing delay experienced by the packet is: t (T) Q ＝(1+m j )·SI j -T q +T' q Wherein T is q Is the waiting time before reporting, T' q Is the latency before transmission of the data frame. T (T) q And T' q The difference does not exceed one upstream frame length. Thus T is Q The maximum can be written as: t (T) Q ＝(1+m j )·SI j +F l ，F l Is the length of one frame. Until the transmission of the data packet is completed, the total delay L he experiences max The method comprises the following steps: l (L) max ＝T Q +T p +T tr ＝(1+m j )·SI j +F l +T p +T tr ，T tr Refers to the time slot length in the OLT required to transmit the data packet;
thus, according to each service delay requirement
Estimating the maximum number of cycles (i.e. m) that can be tolerated by traffic in the jth T-CONT j ) The method comprises the following steps: />
S102: dividing the buffer of the jth transport container into m j Individual queues
Wherein (1)>
An ith queue for the jth transport container, i.e. 1..m j ，/>
The highest priority queue for the jth transport container,/for the jth transport container>
The lowest priority queue for the jth transport container;
to meet different latency requirements of TS trafficWe introduce a fine-grained queuing mechanism into the existing PON architecture. As shown in FIG. 3, we subdivide the buffer of each T-CONT into m j Queues, provided with Q n For the nth queue (1<n.ltoreq.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 upper cycle) is stored. But the first queue Q 1 Not only the data of the (t-m) th cycle but also the data arriving earlier (having expired) are stored. Thus, for any T-CONT j, Q 1 Is the queue with the highest priority
Is the lowest priority queue.
S103: constructing a set S of all n-th class transport containers comprising an i-th queue i The number of elements in the set is |S i |；
S i Is an inclusion queue
T-CONT of (a) for a total of i; s i I represents S i The number of elements in the matrix.
S104: updating the data quantity to be sent of each queue in the current period, and calculating the total bandwidth required to be allocated by the n-th transmission container;
before the OLT starts to allocate bandwidth, the OLT updates the state of each queue of the T-CONT. Let the current period be T, the ith queue of the jth T-CONT
The state of +.>
The update equation of (2) is as follows:
wherein, the liquid crystal display device comprises a liquid crystal display device,
for the data quantity to be transmitted for the ith queue of the jth transport container of the last cycle,/-, is->
The amount of data to be transmitted for the (i+1) th queue of the jth transport container of the previous cycle, m being the maximum value among the number of queues of all transport containers,
the total buffer area of the transmission container received by the optical line terminal in the last period is occupied, and the transmission container is filled with +.>
Is the data newly received in the previous period;
after the queue update, the OLT needs to calculate the effective bandwidth that can be allocated to the class T-CONT. The method allocates bandwidth to all T-CONTs of the same class in a concentrated way, N T-CONTs of the same class are provided, the maximum bandwidth of each T-CONT is AB, and the reporting length 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: taking the queue priority as a sequence, and calculating the bandwidth to be allocated to each queue according to the data volume to be transmitted by each queue in the current period, the total bandwidth to be allocated to the nth class transmission container and the element number in the set;
bandwidth is calculated and allocated for each queue. The calculation sequence is carried out according to the sequence number (i) of each queue, and the smaller the sequence number is, the higher the priority is. For example, for two different T-CONTs, a first transport container T-CONT1, such as the first transport container of the first type in FIG. 2 (1) And a second transport container T-CONT1 of the first type of transport containers (2) Q of both 1 (i.e
And->
) Is of the same priority; and for T-CONT1 (2) Is->
And T-CONT1 (3) Is->
The former has a higher priority than the latter because 4 is less than 5. But this does not represent that queues in the same T-CONT need to upload data separately in one cycle, as that would reduce bandwidth utilization. The OLT will follow Q 1 And starting to calculate the bandwidth for each queue, and summarizing the bandwidth information of all the queues of the T-CONT until the polling is finished to obtain the bandwidth distributed to the T-CONT.
S106: and counting the sum of the allocated bandwidths calculated by all queues in the jth transmission container, and taking the sum as the final bandwidth authorization to allocate the bandwidth.
Counting the sum of the calculated allocated bandwidths of all queues in the jth transport container
The calculation formula of (2) is as follows:
The bandwidth allocation method in passive optical network facing service differentiation delay requirement of the invention firstly calculates the maximum cycle number of service tolerance according to the maximum delay of service tolerance, divides the buffer area of each transmission container into a plurality of queues with the maximum cycle number of service tolerance, and the data received in each cycle is one queue in t-cont, and is optimized according to the queuesFirst order slave Q 1 Calculating bandwidth for each queue, and summarizing the bandwidth information of all the queues of the T-CONT to become the bandwidth allocated to the T-CONT after the polling is finished, wherein the bandwidth allocation for granularity according to the queues is finer 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 TS service requiring each time delay on the basis of not changing the upper limit of the total bandwidth of T-CONT, ensures the deterministic time delay of different services according to the Service Level Agreement (SLA) of the service, and realizes the maximum utilization of bandwidth resources; the method provided by the invention is easy to realize without changing the existing framework, 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 describes in detail step S105:
s151: setting the initial value of i to 1, setting the maximum value to m (i.e. the maximum number of algorithm iterations), m being the maximum value of all transmission container queues, and
the initial value of (2) is set to 0;
s152: at the ith iteration, the bandwidth to be allocated to the ith queue of each transport container is updated
S153: judging the ith queue of each transmission container
Whether or not it is not less than the data size expected to be transmitted at the current cycle>
If not, deleting all the n-th class transmission container sets S containing the i-th queue i Corresponding transport container elements in the collection, and updating the number of elements |S in the collection i If the detected value is smaller than the preset threshold value, returning to the step S2;
s154: the remaining total bandwidth B is calculated and,if B>0 and |S i I=0, then i=i+1 is updated, the (i+1) th iteration is entered, step S1 is returned until b=0, the iteration is ended, if B>0 and |S i >I 0, i remains unchanged, returning to step S1.
The fine-granularity bandwidth allocation method in the passive optical network facing the service differentiation delay requirement ensures the deterministic delay of each service in the PON environment of TS service with multiple delay requirements.
Based on the above embodiments, the present embodiment uses matlab software to make simulation comparison between the conventional DBA algorithm and the fine granularity bandwidth allocation method proposed herein, and specifically includes the following steps:
in conventional DBA, we have chosen the GIANT algorithm as a benchmark, since GIANT is the first typical DBA algorithm of ITU-t pon. We designed a 50G-PON scenario consisting of 16 ONUs and 1 OLT. Each ONU contains 4 different T-CONTs. As shown in fig. 5, in the simulation there are a total of four delay sensitive traffic with different delay requirements (i.e. 1.5ms, 3ms, 5ms and 10 ms), one of which is transmitted by every 4 ONUs. The distance between the ONU and the OLT is set to 10 km and the propagation delay is 50 mus. The arrival time of traffic generated at the ONUs follows a 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 increase in the low delay traffic fraction in higher rate PONs, we increase the traffic received by each T2 in an ONU to 40%, while the other three T-CONTs account for 20% each. Accordingly, the maximum service rates for 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 the low-delay traffic is concentrated on T2, the delay performance of T1, T3 and T4 in the two methods is unchanged. Thus, the simulation mainly tests the performance of the multiservice in T2.
Fig. 6 and 7 show XGEM frame delay cumulative distribution function graphs (CDF graphs) for different traffic in T2 under low load (0.3) and high load (0.75) conditions. 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 period can be transmitted immediately in the next polling period and thus will not pile up 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, the percentage of data frame delay guarantee of the fine-granularity bandwidth allocation algorithm increases 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, compared to the conventional algorithm. The results show that the fine-grained bandwidth allocation algorithm has better performance regardless of the delay requirement of the TS service.
Referring to fig. 8, fig. 8 is a block diagram illustrating a device for bandwidth allocation in a passive optical network according to an embodiment of the present invention; the specific apparatus may include:
a maximum cycle number calculating module 100 for calculating a maximum cycle number m of the service in the jth transport container according to the service delay requirement of the jth transport container in the nth transport container j ；
A queue dividing module 200 for dividing the buffer of the jth transport container into m j Individual queues
Wherein (1)>
An ith queue for the jth transport container, i.e. 1..m j ，/>
The highest priority queue for the jth transport container,/for the jth transport container>
The lowest priority queue for the jth transport container;
a set construction module 300 for constructing a set S of all n-th class transport containers comprising an i-th queue i The number of elements in the set is |S i |；
The data amount and total bandwidth calculation module 400 is configured to update the data amount to be sent by each queue in the current period, and calculate the total bandwidth to be allocated by the nth class transmission container;
the bandwidth allocation calculating module 500 is configured to calculate, in order of queue priority, a bandwidth to be allocated to each queue according to an amount of data to be sent by each queue in the current period, a total bandwidth to be allocated to the nth class transmission container, and the number of elements in the set;
the bandwidth allocation module 600 is configured to count the sum of the allocated bandwidths calculated by all queues in the jth transport container, and use the sum as the final bandwidth grant to allocate bandwidth.
The apparatus for bandwidth allocation in a passive optical network of this embodiment is configured to implement the foregoing bandwidth allocation method in a passive optical network, so that the embodiment of the bandwidth allocation method in a passive optical network can be seen in the embodiment of the bandwidth allocation method in a previous Wen Moyuan optical network, for example, the service tolerance maximum cycle number calculating module 100, the queue dividing module 200, the set constructing module 300, the data amount and total bandwidth calculating module 400, the bandwidth allocation calculating module 500, and the bandwidth allocating module 600 are respectively configured to implement steps S101, S102, S103, S104, S105 and S106 in the foregoing bandwidth allocation method in a passive optical network, and therefore, the detailed description thereof can be referred to the description of the corresponding embodiments of each part and will not be repeated herein.
The invention also provides a passive optical network, which comprises the device for distributing the bandwidth in the passive optical network, and is applied to the time delay sensitive service with multiple time delay requirements.
It is apparent that the above examples are given by way of illustration only and are not limiting of the embodiments. Other variations and modifications of the present invention will be apparent to those of ordinary skill in the art in light of the foregoing description. It is not necessary here nor is it exhaustive of all embodiments. While still being apparent from variations or modifications that may be made by those skilled in the art are within the scope of the invention.
Claims (10)
1. A bandwidth allocation method in a passive optical network, comprising:
calculating the maximum cycle number m of the service tolerance in the jth transport container according to the service delay requirement of the jth transport container in the nth transport container j ；
Dividing the buffer of the jth transport container into m j Individual queues
Wherein (1)>
I e 1 … m for the ith queue of the jth transport container j ，/>
The highest priority queue for the jth transport container,/for the jth transport container>
The lowest priority queue for the jth transport container;
constructing a set S of all n-th class transport containers comprising an i-th queue i The number of elements in the set is |S i |；
Updating the data quantity to be sent of each queue in the current period, and calculating the total bandwidth required to be allocated by the n-th transmission container;
taking the queue priority as a sequence, and calculating the bandwidth to be allocated to each queue according to the data volume to be transmitted by each queue in the current period, the total bandwidth to be allocated to the nth class transmission container and the element number in the set;
and counting the sum of the allocated bandwidths calculated by all queues in the jth transmission container, and taking the sum as the final bandwidth authorization to allocate the bandwidth.
2. The bandwidth allocation method according to claim 1, wherein the data amount to be transmitted by each queue in the current period is in order of queue priority
The n-type transmission container needs to allocate the total bandwidth B and the element number S in the set i Computing the bandwidth that each queue should allocate +.>
Comprising the following steps:
s1: setting the initial value of i to 1, the maximum value to m, wherein m is the maximum value in the number of all transmission container queues, and
the initial value of (2) is set to 0;
s2: at the ith iteration, the bandwidth to be allocated to the ith queue of each transport container is updated
S3: judging the ith queue of each transmission container
Whether or not it is not less than the data size expected to be transmitted at the current cycle>
If not, deleting all the n-th class transmission container sets S containing the i-th queue i Corresponding transport container elements in the collection, and updating the number of elements |S in the collection i If the detected value is smaller than the preset threshold value, returning to the step S2;
s4: calculating the remaining total bandwidth B, if B > 0 and |S i I=0, then i=i+1 is updated, and step S1 is returned until b=0, ending the iteration.
3. The bandwidth allocation method according to claim 2, wherein if B > 0 and |s i I > 0, i remains unchanged, returnStep S1.
4. The bandwidth allocation method according to claim 2, wherein the sum of the allocated bandwidths calculated for all queues in the jth transport container is counted
The calculation formula of (2) is as follows:
5. the bandwidth allocation method according to claim 1, wherein the calculating the maximum number of cycles m that can be tolerated by the traffic in the jth transport container is performed according to the traffic delay requirement of the jth transport container in the nth transport container j The calculation formula of (2) is as follows:
wherein, the liquid crystal display device comprises a liquid crystal display device,
service delay requirement for jth transport container, F l Is the length of one frame, T p Is the transmission delay, T tr Refers to the time slot length, SI, in the optical line terminal required for transmitting data packets j Is a polling period.
6. The bandwidth allocation method according to claim 1, wherein the updating the amount of data to be transmitted per queue in the current period
The calculation formula of (2) is as follows:
wherein, the liquid crystal display device comprises a liquid crystal display device,
for the data quantity to be transmitted for the ith queue of the jth transport container of the last cycle,/-, is->
The data volume to be transmitted for the (i+1) th queue of the jth transport container of the last cycle, m being the maximum value of the number of queues of all transport containers,/>
The total buffer area of the transmission container received by the optical line terminal in the last period is occupied.
7. The bandwidth allocation method according to claim 1, wherein the calculation formula for calculating the total bandwidth B to be allocated by the n-th class 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 tolerant maximum cycle number calculating module for calculating a maximum cycle number m of the service tolerant in the jth transport container according to the service delay requirement of the jth transport container in the nth transport container j ；
A queue dividing module for dividing the buffer area of the jth transport container into m j Individual queues
Wherein (1)>
I e 1 … m for the ith queue of the jth transport container j ，/>
For the highest priority queue of the jth transport container,
the lowest priority queue for the jth transport container;
a set construction module for constructing a set S of all n-th class transport containers comprising an i-th queue i The number of elements in the set is |S i |；
The data quantity and total bandwidth calculation module is used for updating the data quantity to be sent by each queue in the current period and calculating the total bandwidth required to be allocated by the nth class transmission container;
the bandwidth allocation calculation module is used for calculating the bandwidth to be allocated to each queue according to the data volume to be transmitted by each queue in the current period, the total bandwidth to be allocated by the nth class transmission container and the element number in the set;
and the bandwidth allocation module is used for counting the sum of the allocated bandwidths calculated by all the queues in the jth transmission container, and taking the sum as the final bandwidth authorization to allocate the bandwidth.
9. A passive optical network comprising a device for bandwidth allocation in a passive optical network according to claim 8.
10. The passive optical network of claim 9, wherein the delay sensitive traffic is applied to multiple delay requirements.
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 CN115484516A (en) | 2022-12-16 |
| CN115484516B true 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 (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102158770A (en) * | 2010-02-12 | 2011-08-17 | 中兴通讯股份有限公司 | Method and system for allocating uplink bandwidth in passive optical network |
| KR20210065393A (en) * | 2019-11-27 | 2021-06-04 | 한국전자통신연구원 | Integrated Dynamic Bandwidth Allocation Method and Apparatus in Passive Optical Networks |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100775427B1 (en) * | 2005-12-12 | 2007-11-12 | 삼성전자주식회사 | System and Method for Bandwidth Allocation In GPON |
| KR101310906B1 (en) * | 2009-11-30 | 2013-09-25 | 한국전자통신연구원 | Apparatus and method for assigning dynamic bandwidth |
| CN103560936B (en) * | 2013-11-22 | 2016-08-17 | 烽火通信科技股份有限公司 | A kind of method 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 |
-
2022
- 2022-09-06 CN CN202211084245.8A patent/CN115484516B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102158770A (en) * | 2010-02-12 | 2011-08-17 | 中兴通讯股份有限公司 | Method and system for allocating uplink bandwidth in passive optical network |
| KR20210065393A (en) * | 2019-11-27 | 2021-06-04 | 한국전자통신연구원 | Integrated Dynamic Bandwidth Allocation Method and Apparatus in Passive Optical Networks |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115484516A (en) | 2022-12-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP2467978B1 (en) | Method for soft bandwidth limiting in dynamic bandwidth allocation | |
| KR100832531B1 (en) | Dynamic bandwidth allocation apparatus and method in Ethernet Passive Optical Network, and EPON master apparatus using the same | |
| Leligou et al. | Efficient medium arbitration of FSAN‐compliant GPONs | |
| EP2466769B1 (en) | Bandwidth allocation method and optical line terminal | |
| US20130039182A1 (en) | Congestion control in an optical line terminal | |
| KR102408176B1 (en) | Client service transmission method and device | |
| CN101385383B (en) | Centralized congestion avoidance in passive optical network | |
| JP5005048B2 (en) | Method for allocating dynamic bandwidth in passive optical networks where different ONUs transmit at different rates | |
| US8040918B2 (en) | Dynamic bandwidth allocation in a passive optical access network | |
| US20070133596A1 (en) | EPON system and method for traffic scheduling in EPON system | |
| US20130315596A1 (en) | Optimized dynamic bandwidth scheduler | |
| US20120149418A1 (en) | Bandwidth allocation | |
| JP5257623B2 (en) | Station side device, line concentrator, communication system, and bandwidth allocation method | |
| Su et al. | Time-aware deterministic bandwidth allocation scheme in TDM-PON for time-sensitive industrial flows | |
| CN115484516B (en) | Bandwidth allocation method and device in passive optical network | |
| Skubic et al. | Improved scheme for estimating T-CONT bandwidth demand in status reporting DBA for NG-PON | |
| JP7029757B2 (en) | Communication system, subscriber line termination device and subscriber line end station device | |
| JP7029758B2 (en) | Communication system and subscriber line end station equipment | |
| Lu et al. | Fine-Granularity Bandwidth Allocation for Diverse Low-Latency Services in Higher-Speed Passive Optical Networks | |
| Chen et al. | Predictive credit based dynamic bandwidth allocation mechanisms in Ethernet passive optical network | |
| Hwang et al. | A Bi-Partitional Dynamic Bandwidth Allocation Mechanism for Differentiated Services to Support State Report ONUs in GPON | |
| Ujikawa et al. | Multilevel dynamic bandwidth allocation using buffer observation for cousin-fair access systems | |
| CN117201976A (en) | Bandwidth allocation method and system for cascade passive optical network | |
| Smith | Dynamic bandwidth allocations for extended-reach passive optical networks. | |
| Song et al. | Priority-based dynamic bandwidth allocation in ethernet passive optical networks |
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 |