Packet Queuing Method Using Group Counters for Bypass
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for implementing bypass capable queues in computer networks are complex and prone to errors, particularly when handling different packet types, as they require intricate pointer manipulations or timestamping, which can lead to computational inefficiencies and difficulties in maintaining packet ordering.
Innovation Solution
A method that groups received packets into ordered series with group tags and maintains counters to track the number of groups for each packet type, allowing packets to be transmitted only if sufficient transmit credit is available and preserving the relative ordering of packet types without the need for complex pointer updates or timestamping.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If pointer-based queue linkage is used to implement bypass capable queue, then packet ordering can be maintained, but computational complexity and processing overhead increase significantly
Solution Approach 1:
The patent segments the queue into separate first queue and second queue for different packet types, with separate head pointers for each queue. This segmentation allows independent management of packet types while maintaining overall ordering through the group counter mechanism, reducing the complexity of managing a single mixed queue.
Solution Approach 2:
The patent introduces a group counter as an intermediary mechanism that tracks the relative ordering between packets of different types without requiring complex pointer manipulations. The group counter acts as a mediator that simplifies the bypass capability logic while maintaining packet ordering requirements.
2Reliability
If timestamp-based packet ordering is used, then relative packet order can be preserved, but computational cost increases and timestamp wraparound issues occur
Solution Approach 1:
The patent changes the parameter used for tracking packet order from timestamps to a group counter that increments based on packet type transitions. This parameter change avoids timestamp wraparound issues and reduces computational complexity while maintaining the ability to preserve relative packet ordering.
3Ease of operation
If separate queues for each packet type are used, then packet type isolation is achieved, but additional linkage mechanisms are required to maintain relative ordering
Solution Approach 1:
The group counter serves as an intermediary that links the separate first queue and second queue without requiring complex pointer manipulations between them. It maintains the relative ordering information that would otherwise need to be stored in the queue structures themselves.
4Adaptability or versatility
If complex pointer updates are performed during packet transmission, then bypass capability is achieved, but error rates increase and processing time increases
Solution Approach 1:
The patent extracts the bypass capability logic from complex pointer manipulations and implements it through simpler group counter comparisons. The bypass decision is made by checking whether the group counter indicates packets of the second type should be transmitted, rather than performing complex pointer updates.
Data Source
AI summary
A method of queuing data packets, said data packets comprising data packets of a first packet type and data packets of a second packet type. The method comprises grouping received packets of said first and second packet types into an ordered series of groups, each group comprising at least one packet, maintaining a group counter indicating the number of groups at the beginning of the series of groups comprising only packets of the second packet type, and transmitting a packet. A packet of the second packet type is available for transmission if but only if the group counter is indicative that the number of groups at the beginning of the series of groups comprising only packets of the second packet type is greater than zero.