Dynamic RTP Packet Scheduling for Fair Congestion Handling
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing RTP scheduling algorithms in local area networks often lead to uneven packet loss across multiple streams during network congestion, with the last-scheduled stream experiencing significantly higher packet drops, especially in scenarios with limited bandwidth like wireless networks.
Innovation Solution
A method where queued packets from multiple data streams are assigned to different slots in scheduling windows in a varying order, such as a round-robin or randomly determined sequence, to ensure that dropped packets are shared fairly among all streams, preventing any single stream from being entirely lost during congestion.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If packets are scheduled in a fixed round-robin or prioritized order, then the scheduling process is simple and easy to implement, but the last-scheduled stream experiences significantly higher packet loss during network congestion
Solution Approach 1:
The patent applies dynamics by transitioning from a fixed scheduling order to a dynamic scheduling mechanism. The scheduler varies the transmission order of streams within each scheduling window based on current network conditions and stream characteristics. This dynamic adjustment ensures that no single stream is consistently positioned at the end of the transmission queue, thereby distributing packet loss more evenly across all streams during congestion while maintaining scheduling simplicity through automated adaptation.
2Productivity
If streams are transmitted at high rate to maintain streaming performance, then the streaming rate is improved, but packet loss increases significantly during network congestion
Solution Approach 1:
The patent applies parameter changes by dynamically adjusting the transmission parameters of different streams within each scheduling window. The scheduler varies parameters such as transmission timing, stream selection order, and packet scheduling based on current network congestion levels and stream priorities. This allows the system to maintain high streaming rates when network conditions permit while automatically reducing packet loss during congestion through parameter adaptation, rather than using a fixed transmission rate.
3Device complexity
If a fixed scheduling window is used for all streams, then the scheduling process is simple, but the last-scheduled stream experiences larger packet drops due to buffer fullness at the wireless bridge
Solution Approach 1:
The patent applies dynamics by making the scheduling window contentions-based rather than fixed. Within each scheduling window, the scheduler dynamically determines which stream to transmit next based on current buffer status and network conditions. This dynamic approach prevents any single stream from being consistently positioned at the end of the transmission sequence, thereby reducing packet drops for all streams while maintaining relatively simple scheduling structure through automated decision-making.
Data Source
AI summary
Apparatus and a method for transmitting a plurality of streams of data packets through a computer network assigns queued packets from each of the plurality of data streams to respective slots in scheduling windows such that queued packets from respective ones of the plurality of data streams occupy different slots in respectively different ones of the scheduling windows. The packets are transmitted through the network in the order defined by the scheduling windows.