Data Output Dispatching Device Using Binary Bit Reverse Sequence
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The weighted round robin (WRR) algorithm for data output dispatching in communication products leads to data burst and unstable output due to uneven weighting allocation, causing peak and valley issues in data transmission.
Innovation Solution
A data output dispatching device and method that uses a binary bit reverse sequence to allocate weightings, distributing tokens among queues to reduce the likelihood of sequential packet transmission from the same queue, incorporating a polling circuit to manage buffer outputs based on the reverse count value.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If the WRR algorithm is used for data output dispatching, then the implementation is simple, but data burst occurs due to uneven weighting allocation
Solution Approach 1:
The patent changes the parameter of weighting allocation by introducing a binary bit reverse sequence mechanism. Instead of using fixed weightings in WRR, the system dynamically determines queue service order through bit reversal operations on round-robin counters, transforming the dispatching parameters to achieve uniform data output while maintaining implementation simplicity.
Solution Approach 2:
The patent introduces a binary bit reverse sequence as an intermediary mechanism between the round-robin counter and the queue selection process. This intermediary transforms the simple counter value into a distributed queue access pattern that prevents data burst while keeping the overall system structure simple.
2Productivity
If higher weighting is assigned to a queue, then more data can be transmitted from that queue, but the peak of data output increases causing unstable data output
Solution Approach 1:
The patent changes the parameter of queue access timing by using bit-reversed round-robin counters. This transforms the traditional sequential access pattern into a distributed pattern where queues are accessed in a non-sequential but systematic order, allowing high transmission capacity while preventing output peaks through uniform distribution of data packets across time.
3Productivity
If consecutive units of data are transmitted from a single queue, then the queue's data is cleared efficiently, but sequential transmission from the same queue creates data burst
Solution Approach 1:
The patent applies inversion by reversing the binary representation of the round-robin counter value to determine queue access order. This inversion transforms the sequential access pattern (which causes data burst) into a reversed-distributed pattern that maintains queue clearing efficiency while preventing consecutive transmissions from the same queue.
Data Source
AI summary
The present invention discloses a data output dispatching device and method capable of reducing the probability of packets from the same queue being transmitted sequentially. An embodiment of the method comprises the following steps: providing a plurality of buffers capable of storing the data of Q queues respectively while each queue is associated with a weighting and the sum Ws of all the weightings is between 2(M−1) and 2M and not greater than a maximum sum in which Q is an integer greater than 1, M is a positive integer and N is an integer not less than M; providing a binary bit reverse count value not greater than 2N; and assigning a token to one of the Q queues for data output according to the reverse count value.