Traffic Allocation in Resilient Packet Ring Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traditional SONET-based metropolitan networks are inefficient in managing bursty data traffic due to fixed bandwidth allocation, leading to underutilization and congestion in ring topologies, while Ethernet networks lack deterministic bandwidth management, resulting in suboptimal utilization of shared fiber resources.
Innovation Solution
A method and system for allocating traffic demands in a Resilient Packet Ring (RPR) network that selects the direction with the smallest incremental load increase to route traffic demands, optimizing the use of bi-directional ring segments and ensuring global fairness across the network.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If fixed bandwidth allocation is used in SONET networks, then circuit protection and connectivity restoration are improved, but bandwidth utilization efficiency deteriorates
Solution Approach 1:
The patent implements dynamic bandwidth allocation in RPR networks, replacing the static fixed allocation of SONET. The system continuously monitors traffic conditions and dynamically adjusts bandwidth allocation based on actual demand, allowing efficient utilization of bursty data traffic while maintaining protection capabilities through dynamic resource management rather than static reservations.
Solution Approach 2:
The patent changes the fundamental parameter of bandwidth allocation from fixed to variable. By introducing dynamic bandwidth allocation mechanisms that adapt to real-time traffic patterns, the system optimizes bandwidth utilization while preserving the ring topology's protection capabilities through flexible resource allocation rather than rigid fixed assignments.
2Speed
If shortest path routing is used in RPR rings, then traffic transmission speed is improved, but network load distribution deteriorates
Solution Approach 1:
The patent implements dynamic routing decisions that adapt to real-time network conditions. Rather than static shortest-path routing, the system dynamically selects optimal paths based on current traffic loads, allowing traffic to be routed through less congested paths when necessary. This dynamic approach maintains fast transmission while improving overall network capacity utilization through balanced load distribution.
Solution Approach 2:
The patent introduces feedback mechanisms that monitor network traffic conditions and use this information to adjust routing decisions. By continuously feedback about network state and adapt routing accordingly, the system maintains fast transmission speeds while optimizing capacity utilization through intelligent, condition-based path selection rather than rigid shortest-path algorithms.
3Ease of operation
If Ethernet switching is used for bandwidth management, then link-level fairness is improved, but global fairness deteriorates
Solution Approach 1:
The patent implements a universal bandwidth management approach in RPR networks that handles both local and global fairness requirements through a unified mechanism. The system provides link-level fairness through simple bridging operations while simultaneously achieving global fairness through coordinated control across the entire ring network, eliminating the need for separate mechanisms for different fairness levels.
Solution Approach 2:
The patent merges link-level and global fairness management into a single integrated approach. By combining simple link-level bridging operations with coordinated global control mechanisms, the system achieves both local fairness in Ethernet-like operations and global fairness across the entire ring network, eliminating the trade-off between the two levels of fairness management.
Data Source
AI summary
A method of allocating a plurality of traffic demands on a network having a plurality of stations connected by a bi-directional ring is disclosed. The method comprises selecting a first traffic demand from the plurality of traffic demands. The method then acquires a first existing traffic volume for a first direction of the bi-directional ring and a second existing traffic volume for a second direction of the bi-directional ring. Either the first or second direction is selected for transmitting the first traffic demand based on the smallest incremental increase in the load of the bi-directional ring.