Age Saturation Mechanism for Packet Network Arbitration
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Locally fair arbiters in interconnection networks can lead to global unfairness due to asymmetry, causing performance issues, and existing age-based arbiters face challenges with age overflow and resource-intensive monitoring, leading to unpredictable behavior and delays.
Innovation Solution
Implementing age-based arbitration systems that convert data packet age to injection time for storage in FIFO queues, allowing age recalculation upon transmission, and using bounded aging rates to prevent overflow, thereby avoiding continuous updates and reducing resource requirements.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If age-based arbitration is implemented to prioritize older packets, then network performance is improved, but age overflow and unpredictable behavior occur
Solution Approach 1:
The patent applies preliminary action by pre-converting packet age to injection time at the point of queue insertion. This prevents age overflow before it can occur during packet traversal, as the injection time (a static timestamp) replaces the continuously incrementing age counter. The conversion is performed in advance using the formula: injection time = current time - packet age, ensuring reliability is maintained while preserving the age-based prioritization functionality.
Solution Approach 2:
The patent changes the parameter representation from age (a continuously increasing value prone to overflow) to injection time (a static timestamp). This parameter transformation resolves the overflow issue while maintaining the ability to prioritize older packets, as packets with earlier injection times naturally receive higher priority in the arbitration process.
2Measurement precision
If continuous age updates are performed to maintain accurate packet age, then arbitration accuracy is improved, but resource consumption increases
Solution Approach 1:
The patent performs the time conversion action in advance when the packet is inserted into the queue, rather than continuously updating during transmission. The injection time is calculated once using the formula: injection time = current time - packet age. This preliminary conversion eliminates the need for continuous age updates, significantly reducing computational resources while maintaining arbitration accuracy through the static timestamp.
Solution Approach 2:
The patent creates a static copy of the time information (injection timestamp) that remains valid throughout the packet's journey through the network. This copied timestamp value replaces the need for dynamic age tracking, reducing resource consumption while preserving the ability to accurately determine packet priority at any point in the network.
3Ease of operation
If locally fair arbiters are used to ensure equal access, then individual queue fairness is improved, but global unfairness arises due to network asymmetry
Solution Approach 1:
The patent introduces asymmetry into the arbitration mechanism by using injection time (absolute timestamp) rather than relative age counters. This asymmetric approach breaks the symmetry of locally fair arbiters that treat all queues equally, allowing the system to account for network path differences and asymmetries. Packets are prioritized based on their absolute injection time into the network, not their relative position in a queue, enabling global fairness despite network asymmetry.
Data Source
AI summary
Systems and method for routing data packets in an interconnection network. The data packets transmitted across the interconnection network each include age data. Routers positioned throughout the interconnection network may control the flow of the data packets through the use of aging first-in, first-out (FIFO) queues and age-based arbiters. The age-based arbiters within the routers are configured to prioritize older data packets over newer data packets being pushed from the FIFO queues. Each data packet inserted into the FIFO queues may be updated such that the age data of the data packet is converted from an age to an injection time. When the data packet is read from the FIFO, the age data of the data packet is converted back to an age.