Multi-Link MLD Operation with Localized Per-TID B-ACK
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing multi-link device (MLD) architectures face challenges in seamless roaming due to the inability to efficiently perform per-Traffic Identifier (TID) frame aggregation and Block Acknowledgment (B-ACK) functions across non-collocated Access Points (APs, leading to delayed acknowledgments and potential service disruptions.
Innovation Solution
A multi-AP MLD entity architecture is introduced, where an Upper Service Access Point (U-SAP) establishes a TID-to-link map, and Lower Service Access Points (L-SAPs) perform localized per-TID frame aggregation and B-ACK functions, eliminating transport hops and ensuring timely acknowledgments.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If per-TID frame aggregation and B-ACK functions are performed centrally across non-collocated APs, then multi-link capacity is increased, but acknowledgment delay increases and service disruptions occur
Solution Approach 1:
The patent segments the centralized B-ACK function into distributed per-link B-ACK entities at each L-SAP. This allows each link to independently perform frame aggregation and generate acknowledgments locally, eliminating the need for inter-AP transport hops and reducing acknowledgment delay while maintaining multi-link operation capacity.
Solution Approach 2:
The patent implements local quality by enabling each L-SAP to perform per-TID frame aggregation and B-ACK functions independently for its associated link. This localization ensures that acknowledgments are generated at the point of data transmission without requiring centralized coordination across non-collocated APs, thereby reducing latency.
2Loss of time
If per-TID frame aggregation and B-ACK functions are performed locally at each L-SAP, then acknowledgment timeliness is improved, but system complexity increases
Solution Approach 1:
The patent divides the complex centralized B-ACK functionality into simpler, independent per-link B-ACK entities at each L-SAP. Each L-SAP only needs to handle frame aggregation and acknowledgment for its own link, reducing the computational complexity at each node while improving overall system responsiveness.
3Productivity
If centralized B-ACK functions are used across non-collocated APs, then resource utilization is optimized, but service continuity during roaming is compromised
Solution Approach 1:
The patent segments the B-ACK function into independent per-link entities that can operate autonomously. During roaming events, this segmentation allows seamless failover between links since each L-SAP maintains independent frame aggregation and acknowledgment capabilities, ensuring service continuity without requiring centralized coordination.
Solution Approach 2:
Each L-SAP performs self-service by independently handling frame aggregation and B-ACK functions for its link without requiring intervention from centralized controllers or other APs. This autonomy ensures that during roaming or link failures, each link can maintain or quickly restore service independently.
Data Source
AI summary
Seamless client roaming for Multi-Link Device (MLD) clients may be provided. First, a Traffic Identifier (TID)-to-link map may be established by an Upper Service Access Point (U-SAP) of a multi-AP MLD entity that assigns subsets of TIDs to at least two links of the entity. For example, a client device logically associates with the U-SAP, while the client device physically connects to a first and second AP of the entity on a respective first and second link, where the first and second AP include first and second Lower Service Access Points (L-SAPs) and are non-collocated. Next, using the map, data received at the U-SAP is directed over one of the two links for transmission to the client device. Further, frame aggregation and block acknowledgment functions may be performed by one of the first or second L-SAP based on whether data transmission is over the first or second link.