Programmable Switch Priority Adjustment for Packet Delay Guarantees
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current methods for delay guarantee in programmable networks fail to provide real-time, adaptive packet-level transmission priority adjustments, leading to inefficiencies and network congestion, especially in scenarios with time-sensitive flows.
Innovation Solution
Implementing a transmission protocol and control protocol to manage packet-level transmission priority through intra-, inter-programmable switch priority adjustments and global parameter adjustments, enabling real-time adaptation based on packet processing delay and queuing, and optimizing time-sensitive flow deployment.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If control plane adjusts packet priority based on communication with data plane, then transmission delay guarantee can be achieved, but communication delay increases and real-time adjustment capability is lost
Solution Approach 1:
The patent enables programmable switches to autonomously adjust packet transmission priorities based on real-time network status monitoring. The switches themselves perform the adjustment actions without external control plane intervention, eliminating communication delays while maintaining reliable delay guarantee through self-contained decision-making capability at the data plane level.
Solution Approach 2:
The patent implements dynamic priority adjustment mechanisms that adapt transmission priorities in real-time based on current network conditions. Instead of static control plane commands, the system continuously monitors queue lengths, packet delays, and network status, dynamically modifying priorities to respond immediately to changing conditions without communication latency.
2Productivity
If fixed transmission priority is assigned to data flows, then implementation is simple, but cannot satisfy specific transmission delay requirements of time-sensitive flows
Solution Approach 1:
The patent transforms fixed priority assignment into dynamic priority adjustment. Programmable switches continuously monitor network status and automatically adjust transmission priorities of data flows based on real-time conditions such as queue lengths and packet delay metrics, enabling time-sensitive flows to receive appropriate priority treatment while maintaining implementation feasibility through automated rules.
Solution Approach 2:
The patent changes the transmission priority parameter dynamically based on network conditions and flow characteristics. Instead of assigning fixed priority values, the system adjusts priority levels in response to varying network status and specific flow requirements, allowing time-sensitive flows to obtain higher priorities when needed while keeping the mechanism implementable through parameter-based control.
3Reliability
If re-routing planning based on QOS is implemented, then delay requirements can be satisfied, but traffic fluctuations occur and network QoS is significantly affected
Solution Approach 1:
The patent implements dynamic priority adjustment at existing routing paths rather than triggering re-routing. By continuously adapting transmission priorities based on real-time network status, the system satisfies delay requirements through priority modulation without causing the traffic fluctuations and QoS degradation associated with route changes.
Solution Approach 2:
The patent extracts the delay guarantee function from the routing layer and implements it at the priority scheduling layer. Instead of changing routes to satisfy delay requirements, the system maintains existing paths and achieves delay guarantee through extracted priority adjustment mechanisms, avoiding the disruptive effects of re-routing on network QoS.
4Device complexity
If queue scheduling processes all packets in the same manner, then implementation is simple, but unable to handle packets with different delay requirements
Solution Approach 1:
The patent applies different priority treatments to different packets based on their specific delay requirements. Instead of uniform scheduling, the system identifies time-sensitive flows and assigns them differentiated priority levels through programmable switch rules, enabling packets with different delay requirements to be handled appropriately while maintaining relatively simple implementation through flow-based classification.
Data Source
AI summary
An adaptive adjustment method of packet-level transmission priority for delay guarantee in programmable networks. The method realizes the adaptive adjustment of packet-level transmission priority in programmable networks from three aspects to satisfy the preset transmission delay requirements, namely: adaptive adjustment of priority in programmable switches based on processing delay state and switch queuing state, adaptive adjustment of priority among programmable switches based on transmission delay in upstream switches, and adaptive adjustment of global parameters based on packet transmission delay satisfaction, so as to realize the packet-level transmission delay guarantee in different positions with different time scales. In addition, for a scene with a large number of time-sensitive flows, based on the optimization model and heuristic algorithm, the optimization deployment of time-sensitive flows can be realized in polynomial time under the condition of limited network resources to improve the overall extent of delay satisfaction.