Building topology in communications networks

Patent metadata

Field	Value
Publication number	US-9794129-B2
Application number	US-201214358144-A
Country	US
Kind code	B2
Filing date	Apr 30, 2012
Priority date	Nov 28, 2011
Publication date	Oct 17, 2017
Grant date	Oct 17, 2017

Abstract

The present proposal provides a specific solution for communications network topology summarization with a good trade-off between high scalability, good stability and resources utilization efficiency.

First claim

The invention claimed is:

1. A method of building a summarized topology of a communications network comprising:
receiving Class of Service (CoS) settings defined by a plurality of CoS baskets, wherein respective CoS baskets are defined by a specific combination of a range of delay and a range of bandwidth;
receiving traffic information;
receiving traffic demands for traffic between a pair of border nodes;
building an Expected Traffic Matrix (EM) based on the CoS baskets and the traffic information to route the traffic demands to corresponding CoS baskets represented in the EM, based on respective bandwidth and delay requirements associated with the traffic demands;
for a particular traffic demand in the EM, selecting a path in the CoS basket which meets the bandwidth and delay requirement of the particular traffic demand;
associating each CoS basket with a Summary Link connecting the pair of border nodes, wherein the Summary link represents a set of connections;
building a summarized topology of the network, wherein the pair of border nodes is linked by the Summary Links corresponding to the CoS baskets;
monitoring a number of paths in a first CoS basket with bandwidth equal or higher than a guaranteed bandwidth to check if the number is above a threshold; and
determining that the number of paths in the first CoS basket with the bandwidth equal or higher than the guaranteed bandwidth is below the threshold, and in response;
creating a new set of traffic demands compatible with parameters of the first CoS basket;
routing the new set of traffic demands with a constraint that resources assigned to paths that are currently in any of the CoS baskets are not available; and
responsive to finding a path with desired characteristics, refilling the first CoS basket with the path.

2. The method according to claim 1 , wherein the traffic information is received in form of a traffic matrix.

3. The method according to claim 1 , wherein the traffic information is received in form of stochastic distributions.

4. The method according to claim 1 , wherein each traffic demand, for which a path has been created, has a specified bandwidth, delay, source, and destination.

5. The method according to claim 4 , further comprising:
responsive to receiving the particular traffic demand, determining the CoS basket for the particular traffic demand to route, and selecting from the CoS basket, the path to serve the particular traffic demand, the selected path having a smallest bandwidth equal or greater than the specified bandwidth of the particular traffic demand.

6. The method according to claim 5 , wherein remainder bandwidth of the path selected to serve the traffic demand is available for serving another traffic demand by recording its availability in a traffic engineering database (TE DB).

7. The method according to claims 1 , further comprising:
responsive to determining that no path with the desired characteristics is found, determining whether there is still at least one path with a bandwidth greater or equal to the guaranteed bandwidth in the first CoS basket; and
responsive to determining that no such path is found in the first CoS basket, updating dynamic parameters of the first CoS basket and modifying the resources of the summarized topology.

8. A device that builds a summarized topology of a communications network comprising:
an interface operative to receive Class of Service (CoS) settings, traffic information, and traffic demands for traffic between a pair of border nodes, wherein the CoS settings are defined by a plurality of CoS baskets and wherein respective CoS baskets are defined by a specific combination of a range of delay and a range of bandwidth; and
a processor operative to build an Expected Traffic Matrix (EM) based on the CoS baskets and the traffic information to route the traffic demands to corresponding CoS baskets represented in the EM, based on respective bandwidth and delay requirements associated with the traffic demands, wherein the processor is further operative, for a particular traffic demand in the EM, to select a path from a plurality of paths in the CoS basket which meets the bandwidth and delay requirement of the particular traffic demand, and in which the processor is also operative to associate each CoS basket with a Summary Link that connects the pair of border nodes, wherein the Summary link represents a set of connections in order to build a summarized topology of the network, and wherein the pair of border nodes is linked by the Summary Links corresponding to the CoS baskets, and
wherein the processor is further operative to monitor a number of paths in a first CoS basket with bandwidth equal or higher than a guaranteed bandwidth to check if the number is above a threshold, and when determined that the number of paths in the first CoS basket with the bandwidth equal or higher than the guaranteed bandwidth is below the threshold;
create a new set of traffic demands compatible with parameters of the first CoS basket;
route the new set of traffic demands with a constraint that resources assigned to paths that are currently in any of the CoS baskets are not available; and
responsive to finding a path with desired characteristics, refill the first CoS basket with the path.

9. The device according to claim 8 , further including a topology module that is operative to build the summarized topology of the network, wherein the processor and the topology module are implemented in the same hardware element in the device.

Assignees

• Iovanna Paola
• Oriolo Gianpaolo
• Zema Cristiano
• ERICSSON TELEFON AB L M (publ)

Inventors

• Iovanna Paola
• Oriolo Gianpaolo
• Zema Cristiano

Classifications

• H04L45/02

  Topology update or discovery · CPC title

• H04L41/12 Primary

  Discovery or management of network topologies · CPC title

• H04L45/302

  Route determination based on requested QoS · CPC title

• H04L41/122

  of virtualised topologies, e.g. software-defined networks [SDN] or network function virtualisation [NFV] · CPC title