Multi-hop Packet Network Scheduling with Reservation Periods
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Multi-hop packet networks face significant challenges in minimizing delay and delay variation, particularly for real-time and interactive services, as existing methods like persistent reservations do not provide controlled delay management, and reducing frame size increases signaling overhead and processing power requirements.
Innovation Solution
A network-wide scheduling method that introduces reservation periods within the time sequence, grouping nodes by location to prioritize delay-sensitive traffic, with reservation periods of varying lengths inversely proportional to distance from a central node, allowing for simultaneous reservation periods in both transmission directions within a single frame.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of time
If frame size is reduced to decrease delay, then transmission delay is reduced, but signaling overhead becomes dominant and processing power requirements increase
Solution Approach 1:
The patent segments the time sequence into multiple reservation periods with different priorities. High-priority delay-sensitive traffic is allocated to specific reservation periods that occur earlier in the frame, allowing shorter effective buffering times for critical traffic without requiring the entire frame to be shortened. This segmentation enables differential delay management without proportionally increasing signaling overhead for all traffic.
Solution Approach 2:
The patent applies local quality by creating reservation periods with different characteristics at different positions in the time sequence. Early reservation periods are optimized for delay-sensitive traffic with guaranteed allocation, while later periods handle other traffic types. This localized optimization allows the system to reduce delay for critical traffic without requiring uniform frame shortening that would increase overall signaling overhead.
2Loss of time
If persistent reservations are used for delay-sensitive traffic, then delay performance improves, but controlled delay management is not achieved
Solution Approach 1:
The patent introduces dynamic reservation periods where the allocation and timing can be adjusted based on network conditions and traffic requirements. Rather than static persistent reservations, the system dynamically assigns reservation periods within the time sequence, allowing controlled delay management through configurable period lengths and positions. This dynamics enables both improved delay performance and actual controllability of delay parameters.
Solution Approach 2:
The patent implements periodic reservation periods within the recurring time sequence structure. By organizing reservations into regular periodic intervals with different priorities, the system achieves controlled delay management through the predictable periodic structure. The periodic action allows delay-sensitive traffic to be consistently handled in specific periods while maintaining overall system controllability through the regular time sequence framework.
3Adaptability or versatility
If nodes negotiate reservations on a packet-by-packet basis, then flexibility is maintained, but delay requirements for real-time services cannot be met
Solution Approach 1:
The patent implements preliminary action by establishing reservation periods in advance within the time sequence structure. Instead of negotiating reservations packet-by-packet, the system pre-allocates specific time periods for different traffic priorities. This preliminary reservation structure maintains flexibility through configurable period assignments while guaranteeing delay requirements are met by having reservations established before traffic arrives, eliminating the delay overhead of packet-by-packet negotiation.
Data Source
AI summary
The invention relates to the scheduling of data transfers in a multi-hop packet network. The nodes of the network are adapted to schedule their transmissions according to a common time sequence, recurring in time domain and comprising a control portion for transmission of at least one control packet and a data portion for transmission of data packets. In order to accomplish a simple and controlled way for minimizing delay and delay variation, the network is classified into several levels with respect to a certain node, each level comprising the nodes located at the same distance from said certain node, measured in number of hops along the shortest path in the network. The data portion is further divided into successive reservation periods, each being allocated to transmissions of delay sensitive traffic through the hops between two predetermined neighboring levels so that a data packet can be transferred across the network within a single time sequence.