Network Routing Path Selection Using Sub-Cast List Management
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional packet-routing algorithms fail to consider the load of intermediate systems and network load when determining the optimal routing path for data transmission, leading to inefficiencies in data transmission time, especially for time-sensitive data.
Innovation Solution
An apparatus and method that dynamically manage a sub-cast list to prioritize network routing paths based on responses from intermediate systems, considering time and place factors, and adjust these factors to optimize data transmission across multiple networks in accordance with the characteristics of the data being transmitted.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of time
If conventional packet-routing algorithms are used that consider only the number of hops and bandwidth information, then the routing path can be determined using simple criteria, but the data transmission time cannot be optimized because the load of intermediate systems and network load are not considered
Solution Approach 1:
The system performs preliminary actions by pre-calculating and storing routing path information including intermediate system load and network load data before actual data transmission. The routing apparatus collects load information from intermediate systems in advance and uses this pre-gathered information to determine optimal routing paths, thereby reducing actual transmission time without requiring complex real-time calculations during data transfer.
Solution Approach 2:
The routing apparatus implements feedback mechanisms by continuously collecting load information from intermediate systems and using this feedback to dynamically adjust routing path selections. The system monitors intermediate system load and network load conditions, then uses this feedback information to optimize subsequent routing decisions, improving transmission time through adaptive path selection based on current network conditions.
2Productivity
If the routing path is determined without considering intermediate systems, then the routing decision process is simplified, but the data transmission efficiency deteriorates due to queueing delays in intermediate systems
Solution Approach 1:
The routing apparatus performs preliminary actions by pre-gathering load information from intermediate systems and pre-calculating routing paths that account for intermediate system capacity. This advance preparation enables efficient data transmission by selecting paths through intermediate systems with lower expected queueing delays, improving productivity without requiring complex real-time decision-making during actual data transfer.
Solution Approach 2:
The system uses feedback from intermediate systems regarding their load conditions to continuously improve routing decisions. By collecting and analyzing feedback information about intermediate system performance and current load states, the routing apparatus can select paths that minimize queueing delays, thereby improving data transmission efficiency through informed routing choices.
3Loss of time
If conventional routing algorithms ignore network load between intermediate systems, then the routing path selection is simpler, but the overall transmission time increases due to network congestion
Solution Approach 1:
The routing apparatus performs preliminary actions by pre-collecting network load information between intermediate systems and using this advance information to select optimal routing paths. By gathering bandwidth availability and congestion data before routing decisions are made, the system can avoid heavily loaded network segments and reduce transmission time without requiring complex real-time network monitoring during data transfer.
Solution Approach 2:
The system implements feedback mechanisms by continuously monitoring network load conditions between intermediate systems and using this feedback to dynamically adjust routing path selections. The routing apparatus receives feedback about network congestion and bandwidth availability, then uses this information to select paths that minimize transmission time by avoiding congested network segments.
4Loss of time
If the routing path does not consider data characteristics, then the routing process is more general and simpler, but time-sensitive data cannot be transmitted with optimal priority
Solution Approach 1:
The routing apparatus applies local quality by treating different types of data with different routing priorities based on their characteristics. Time-sensitive data is routed through paths optimized for speed with lower intermediate system load, while non-time-sensitive data can tolerate higher load paths. This localized optimization for specific data types reduces transmission time for critical data without compromising the general routing framework.
Solution Approach 2:
The system uses parameter changes by adjusting routing decisions based on data characteristics such as time-sensitivity. The routing apparatus modifies routing parameters like path selection criteria and intermediate system load thresholds depending on whether the data is time-sensitive or not, thereby optimizing transmission time for time-critical data while maintaining versatile routing capability for all data types.
Data Source
AI summary
Disclosed herein is an apparatus for supporting setting of a network routing path, which includes a sub-cast list management unit for managing a sub-cast list that contains information about one or more other apparatuses for supporting setting of a network routing path with which the apparatus establishes a network session; a session management unit for simultaneously transmitting a SYNC message to at least some of the apparatuses included in the sub-cast list and establishing a network session with one of the apparatuses included in the sub-cast list in consideration of responses to the SYNC message; and a communication unit for transmitting data via the established network session.