Cell Reordering Fast Timeout for Multi-Conversation Routers
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In computing and communication networks, routers face challenges in reordering out-of-order cells from multiple paths, leading to significant delays and potential cell loss, which can cause input stalls and undesirable events like overflow in the switch fabric.
Innovation Solution
Implementing a method that includes receiving out-of-order cells, reordering them, determining if a reorder window size is exceeded, and subjecting conversations to a fast timeout to drop missing cells, allowing the system to continue processing other conversations while waiting for missing cells to reduce delays and prevent input stalls.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Manufacturing precision
If the destination waits for missing cells before reordering, then reordering accuracy is improved, but processing time increases significantly
Solution Approach 1:
The patent changes the timeout parameter from a fixed value to a dynamic value that can be adjusted based on conversation priority and current system state. High-priority conversations receive shorter timeout values, allowing them to proceed with reordering even if some cells are missing, while low-priority conversations use longer timeouts to ensure complete data availability. This resolves the contradiction by making reordering accuracy adaptable rather than absolute.
Solution Approach 2:
The patent implements partial reordering where the destination can reorder and process cells even if not all cells from a conversation have been received. Instead of waiting for complete data sets, the system performs reordering on available portions of data, allowing processing to continue with partial information. This reduces processing time while maintaining acceptable reordering accuracy for the cells that are available.
2Speed
If the destination enforces strict timeout for one conversation, then that conversation's processing speed is improved, but other conversations are stalled
Solution Approach 1:
The patent segments the timeout mechanism by conversation, allowing each conversation to have its own timeout policy and state. Instead of a global timeout that affects all conversations uniformly, the system maintains separate timeout counters and states for each conversation stream. This enables selective timeout enforcement where only specific conversations are subject to timeout while others continue processing normally, resolving the contradiction between individual conversation speed and overall productivity.
Solution Approach 2:
The patent implements dynamic timeout adjustment where timeout values and enforcement strictness can change based on current system conditions and conversation priorities. The timeout mechanism is not static but adapts to varying loads and priorities, allowing the system to be lenient with timeouts during high-load conditions to maintain overall throughput while being stricter during low-load conditions to improve individual conversation processing speed.
3Reliability
If the destination uses unit garbage collection, then cell loss is reduced, but input delay increases significantly
Solution Approach 1:
The patent enables continuous reordering operations by allowing the destination to proceed with reordering even when some cells are missing or dropped. Instead of pausing reordering to wait for or garbage-collect missing cells, the system maintains continuous operation by reordering available cells and marking missing ones as dropped. This eliminates idle waiting time in the reordering process while still achieving reliable data reconstruction by filling gaps using error correction or retransmission protocols.
4Reliability
If the destination performs bulk garbage collection, then cell loss is managed, but switch fabric causes overflow problems
Solution Approach 1:
The patent extracts the garbage collection function from a bulk, periodic operation and transforms it into a continuous, incremental process integrated with the normal reordering workflow. Instead of accumulating many out-of-order cells before performing bulk garbage collection, the system continuously identifies and handles dropped cells as they are detected during reordering. This extraction of the garbage collection function from batch processing to continuous processing prevents buffer overflow in the switch fabric by maintaining steady-state operation levels.
Data Source
AI summary
A device reorders first cells of a first conversation; determines whether a reorder window size is exceeded a first time based on the first conversation; subjects the first conversation to a fast time out when the reorder window size is exceeded the first time; reorders second cells of a second conversation while subjecting the first conversation to the fast time out; prepares a packet based on the first conversation; and transmits the packet to a PFE of another device.