SONET Link Defragmentation Under Interface Rate Constraints

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

SONET/SDH networks face challenges in defragmentation due to interface rate constraints, which can prevent optimal packing of time slots and lead to service disruptions, despite existing defragmentation techniques like MöbiPack, as they do not account for the specific rate capabilities of SONET equipment.

Innovation Solution

A defragmentation algorithm that computes an optimal layout of free space and migration sequence, considering minimum and maximum cross-connect rates, to ensure hitless migration and optimal packing of time slots, accommodating interface rate constraints and maintaining service continuity.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If defragmentation is performed without considering interface rate constraints, then link packing efficiency is improved, but service disruptions occur due to incompatible migration sequences

Engineering Contradiction:
Improvelink packing efficiencyVSAvoidservice continuity
Core Design Contradiction:
ProductivityVSReliability

Solution Approach 1:

The patent applies parameter changes by incorporating interface rate constraints (minimum and maximum cross-connect rates) as additional parameters in the defragmentation algorithm. This modifies the optimization criteria from solely maximizing packing efficiency to simultaneously satisfying rate compatibility requirements, thereby preventing service disruptions while maintaining efficient link utilization.

Inventive Principle:
Principle #35Parameter changes

Solution Approach 2:

The patent employs preliminary action by pre-calculating and storing the interface rate capabilities (minimum and maximum cross-connect rates) of each interface before performing defragmentation. This advance preparation allows the algorithm to evaluate potential migration sequences against rate constraints beforehand, ensuring that only compatible migrations are selected, thus avoiding service disruptions.

Inventive Principle:
Principle #10Preliminary action

2Reliability

If contiguous time slots are provisioned to accommodate traffic demands, then service requirements are met, but link fragmentation increases reducing available bandwidth

Engineering Contradiction:
Improveservice requirement satisfactionVSAvoidavailable bandwidth
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The patent applies dynamics by implementing a dynamic defragmentation algorithm that continuously monitors link utilization and fragmentation levels. When fragmentation exceeds thresholds or when interface rate constraints prevent optimal packing, the algorithm dynamically reconfigures time slot assignments to balance service requirements with bandwidth efficiency, adapting to changing network conditions.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The patent employs segmentation by dividing the defragmentation process into discrete migration steps that respect interface rate constraints. Instead of attempting to reconfigure the entire link at once, the algorithm segments the reconfiguration into manageable circuit migrations, each validated against rate constraints, thereby reducing fragmentation while maintaining service continuity.

Inventive Principle:
Principle #1Segmentation

3Productivity

If virtual concatenation and LCAS protocols are used to eliminate contiguous slot requirements, then bandwidth utilization improves, but compatibility issues arise with legacy equipment

Engineering Contradiction:
Improvebandwidth utilizationVSAvoidprotocol compatibility
Core Design Contradiction:
ProductivityVSAdaptability or versatility

Solution Approach 1:

The patent applies universality by designing a defragmentation algorithm that serves multiple functions: it optimizes bandwidth utilization like virtual concatenation protocols while simultaneously maintaining compatibility with legacy contiguous slot requirements. The algorithm can operate in modes that satisfy either contiguous or non-contiguous requirements depending on equipment capabilities, making it universally applicable across mixed legacy and modern networks.

Inventive Principle:
Principle #6Universality (Multi-functionality)

Data Source

PatentUS7397815B2Method and apparatus for performing link defragmentation subject to an interface rate constraint
Publication Date: 2008.07.08 LUCENT TECH INC
  • US7397815B2 patent drawing
  • US7397815B2 patent drawing
  • US7397815B2 patent drawing

AI summary

Techniques for defragmenting at least one time division multiplexed link in a communication system, wherein provisioned circuits corresponding to traffic demands are assigned to particular time slots of the link. An optimum layout of free space for the link is computed, subject to an interface rate constraint that may be specified as a minimum cross-connect rate and a maximum cross-connect rate. Particular free slots from the optimum layout of free space are selected, and a hitless migration sequence is determined for migrating one or more of the circuits to one or more of the selected free slots. The time slot assignments of one or more of the circuits are adjusted in accordance with the determined migration, sequence in order to defragment the link.