US2007195701A1PendingUtilityA1
Simple And Resource-Efficient Resilient Network Systems
Est. expirySep 3, 2023(expired)· nominal 20-yr term from priority
H04L 45/00H04W 8/04H04L 45/50H04L 47/522H04L 47/626H04L 47/50H04L 47/54H04L 45/24
31
PatentIndex Score
0
Cited by
0
References
0
Claims
Abstract
The invention is related to a method for resilient multi-paths connections between edge devices of a communication network. First are determined connection-specific traffic distribution functions for the multi-paths depending on a plausible failure pattern of active and inactive paths of the multi-path of this connection. Further is selected the traffic distribution function for a multi-path depending on the current failure pattern of active an inactive paths of the multi-path of this connection and is distributed the traffic of the connection onto the path of the corresponding multi-path pursuant to the selected traffic distribution function. An essential advantage of the invention is a significant decrease of network capacity for resilient multi-path connections. Another advantage of the invention is the short reaction time in case of an outage of one or more path of the multi-path connections.
Claims
exact text as granted — not AI-modified1 - 16 . (canceled)
17 . A method for providing a resilient multi-path connection between edge devices of a communication network, comprising:
calculating connection-specific traffic distribution functions of the multi-path connection based upon path failure patterns of the multi-path connection; selecting a traffic distribution function of the multi-path connection based upon the calculated connection-specific traffic distribution functions and based upon current path failure pattern of the multi-path connection; and distributing traffic into corresponding paths of the multi-path connection based upon the selected traffic distribution function.
18 . The method as claimed in claim 17 , wherein one path of multi-path is a primary path over which traffic is transmitted in a failure-free scenario and remaining paths are backup paths
19 . The method as claimed in claim 17 , wherein the traffic of the multi-path connection is distributed over a plurality of primary paths over which the traffic is transmitted in a failure-free scenario.
20 . The method as claimed in claim 17 , wherein the calculation of the connection-specific traffic distribution functions of the multi-path connection depends on a topology of the communication network, routes of paths of the multi-path connection through the communication network, and both an expected traffic between the edge devices and available link capacities.
21 . The method as claimed in claim 17 , wherein the paths of the multi-path connection are logically or physically disjoint.
22 . The method as claimed in claim 17 , wherein the paths of the multi-path connection are link or node disjoint.
23 . The method as claimed in claim 17 , wherein a path failure pattern is a combination of detected active and inactive paths of the multi-path connection.
24 . The method as claimed in claim 23 , wherein a partial outage of a path is indicated as inactive by a failure information at the edge devices.
25 . The method as claimed in claim 24 , wherein a failure of a path due to an outage of a contained network element is indicated by a monitoring information which is periodically transmitted over the path.
26 . The method as claimed in claim 17 , wherein the traffic distribution function is optimized for likely and foreseeable path failure pattern.
27 . The method as claimed in claim 17 , wherein the path failure pattern is determined by the following equation:
f g ( s )=Φ p 0 ; g ,s ) . . . Φ( p g kg−1 ,s ) τ with Φ(p,s) is a function indicating whether a partial (single) path p is active or inactive if a failure scenario s (set of failed network elements) occurs, and F g is the failure pattern comprising a set of active and inactive partial path p g i within the multi-path P g for a connection g between two edge devices kg is the maximum number of partial paths p g i within the multi-path P g , i.e., 0<=i<kg.
28 . The method as claimed in claim 17 , wherein a primary capacity of a link is a capacity allocated to a flow if no failure occurs.
29 . The method as claimed in claim 17 , wherein the primary capacity of a link is reused and the traffic distribution function is computed by a linear program with several constraints whose optimization function is determined by following equation:
∀
g
∈
S
:
∑
g
∈
Gs
P
g
T
l
g
(
f
g
(
s
)
)
·
c
(
g
)
≤
b
with
S is a set of all failure scenarios,
Gs is a set of all active aggregate connections in case of failure scenario s,
L g (f) is a load distribution function based upon a failure pattern f,
P g τ lg(f)*c(g): τ transposes a proceeding vector, this computes a vector with a fraction of a traffic rate c(g) caused by the multi-path P g and a rate c(g) of a aggregate connection g,
b is a vector with a capacity of links which are larger than corresponding traffic rates caused by any failure scenario and
∑
g
∈
G
s
c
(
g
)
·
P
g
T
l
g
(
f
g
(
0
)
≤
b
30 . The method as claimed in claim 17 , wherein the primary capacity of a link is not reused and the traffic distribution function is computed by a linear program with several constraints whose optimization function is determined by following equations:
∀
g
∈
S
:
∑
g
∈
Gs
P
g
T
l
g
(
f
g
(
s
)
)
·
c
(
g
)
≤
b
and
∀
g
∈
F
g
:
l
g
(
f
)
+
f
≥
l
g
(
f
g
(
0
)
)
with
S is a set of all failure scenarios,
Gs is a set of all active aggregate connections in case of failure scenario s,
L g (f) is a load distribution function based upon a failure pattern f,
p g τ lg(f)*C(g): τ transposes a proceeding vector, this computes a vector with a fraction of a traffic rate c(g) caused by the multi-path P g and a rate c(g) of a aggregate connection g,
b is a vector with a capacity of links which are larger than corresponding traffic rates caused by any failure scenario and
∑
g
∈
G
s
c
(
g
)
·
P
g
T
l
g
(
f
g
(
0
)
≤
b
31 . An edge device for providing a resilient multi-path connection between edge devices of a communication network, comprising:
a calculator that calculates connection-specific traffic distribution functions of the multi-path connection based upon path failure patterns of the multi-path connection; a selector that selects a traffic distribution function of the multi-path connection based upon the calculated connection-specific traffic distribution functions and based upon current path failure pattern of the multi-path connection; and a distributor that distributes traffic into corresponding paths of the multi-path connection based upon the selected traffic distribution function.
32 . The edge device as claimed in claim 31 , wherein the calculation of the connection-specific traffic distribution functions of the multi-path connection depends on a topology of the communication network, routes of paths of the multi-path connection through the communication network, and both an expected traffic between the edge devices and available link capacities.
33 . A computer program product for providing a resilient multi-path connection between edge devices of a communication network, comprising:
a program subroutine for calculating connection-specific traffic distribution functions of the multi-path connection based upon path failure patterns of the multi-path connection;Cited by (0)
No later patents cite this yet.
References (0)
No backward citations on record.