Aggregation Identifier Routing for Network Node Efficiency
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional routing protocols, such as IS-IS and OSPF, often select paths that are not optimal for meeting specific network requirements of different services, leading to inefficient routing and high storage demands in network devices supporting OpenFlow, due to the large number of flow tables required for various services.
Innovation Solution
A routing method and system that uses an aggregation identifier to identify service data flows with similar network requirements and destinations, reducing the number of routing entries and improving efficiency by generating and using forwarding tables that include next-hop information for these aggregated flows.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional routing protocols (IS-IS or OSPF) are used to calculate shortest path or lowest-cost path, then routing calculation is performed, but the obtained path is not preferable for meeting specific network requirements of different services
Solution Approach 1:
The patent changes the routing parameters from traditional metric-based (cost, bandwidth) to service-requirement-based parameters. By introducing service type identifiers and network requirement types as routing parameters, the system can select paths that specifically meet service requirements (e.g., low delay for online games, high bandwidth for video on-demand) rather than simply following shortest or lowest-cost paths.
2Reliability
If a large quantity of flow tables are generated according to different network requirements of services, then routing can be optimized for specific services, but the network device needs excessively large quantity of flow tables which leads to high requirement on storage performance
Solution Approach 1:
The patent merges multiple service-specific flow tables into a single unified forwarding table by introducing an aggregation identifier. Instead of maintaining separate flow tables for different service types (online game, video on-demand, VoIP, etc.), the system aggregates them using service requirement types as identifiers, significantly reducing the total number of flow tables while preserving service-specific routing capabilities.
Solution Approach 2:
The unified forwarding table serves multiple functions simultaneously - it handles routing for different service types (online games, video services, VoIP, etc.), different network requirements (delay-sensitive, bandwidth-sensitive, packet loss-sensitive), and different destinations. This multi-functional approach eliminates the need for multiple specialized flow tables.
3Reliability
If a large quantity of flow tables are generated for different services, then service-specific routing is achieved, but it takes a lot of time to search a flow table, thereby affecting execution efficiency of routing
Solution Approach 1:
By merging multiple service-specific flow tables into a single unified forwarding table using aggregation identifiers, the system reduces the total search space. The unified table is organized by service requirement types and destinations, enabling efficient lookup while maintaining service-specific routing accuracy.
Solution Approach 2:
The unified forwarding table is organized with local quality optimizations - each entry is structured with aggregation identifiers that group similar service requirements together. This organization allows for efficient localized search within specific service categories rather than searching through all possible service-specific tables.
Data Source
AI summary
Embodiments of the present disclosure disclose a routing method, a device, and a system. A network node receives a service data packet; the network node searches a forwarding table according to an aggregation identifier, to obtain next-hop information, where the aggregation identifier is used to identify service data flows of one type, where the service data flows have a same network requirement type and a same destination, and the forwarding table includes the aggregation identifier and the next-hop information corresponding to the aggregation identifier; and the network node forwards the service data packet according to the obtained next-hop information. The embodiments of the present disclosure can significantly reduce a quantity of routing entries of a service routing node, reduce operation complexity, and improve routing and forwarding efficiency of a system.