The present invention pertains to the field of network communications, and in particular to systems and methods for performing traffic engineering through network slices.
Traffic Engineering (TE) is a technique for managing data transmissions performed over a communications network. TE management entities typically make use of knowledge of a network topology and overall demands on resources to provide traffic flow management. To determine the routing of traffic flows over the network, TE entities may take into account statistical models of network traffic, queuing theory, data measurements, and simulations to model network operations. The modeling of the network allows TE to determine transmission parameters, capacities, and routes for transmitting data according to various network requests. Efficient application of TE techniques can serve to reduce the incidence of network traffic congestion, ensure adherence to quality of service (QoS) requirements, and reduce network costs through successful forecasting of operations.
This background information is provided to reveal information believed by the applicant to be of possible relevance to the present invention. No admission is necessarily intended, nor should be construed, that any of the preceding information constitutes prior art against the present invention.
An object of embodiments is to provide a system and method for performing traffic engineering on a communications network through network slices.
In accordance with embodiments of the present invention, there is provided a method for resource allocation in a network slice for allocating functions in the network slice to a flow within the slice. The method includes receiving network topology information defining the topological location of functions in the network slices, point of presence information defining a physical topology of points of presence associated with the functions, and forwarding graph information associated with the functions. The method further includes receiving flow information associated the flow including an identification of a source and a destination within the network slice associated with the flow and quality of service requirements associated with the flow. The method further includes transmitting allocation instructions to functions in the network slice to direct the flow through selected functions.
In some embodiments, the method further includes selecting the selected functions in accordance with the received network topology information and point of presence information in accordance with the received flow information. In some embodiments, a selected function is selected from a plurality of functions in accordance with a physical location of the point of presence associated with the function and the received flow information. In some embodiments, at least one of the network topology information, the point of presence information and the forwarding graph information are received from a topology management entity. In some embodiments, the flow information is received from a traffic engineering entity.
In accordance with embodiments of the present invention, there is provided a resource allocation apparatus comprising a processor, an input interface, an output interface, and a memory having recorded thereon statements and instructions for execution by the processor, or equivalent electronic systems. The apparatus is configured to receive, using the input interface, network topology information defining the topological location of functions in one or more network slices, point of presence information defining a physical topology of points of presence associated with the functions, and forwarding graph information associated with the functions. The apparatus is further configured to receive, using the input interface, flow information associated the flow including an identification of a source and a destination within the network slice associated with the flow and quality of service requirements associated with the flow. The apparatus is further configured to transmit, using the output interface, allocation instructions to functions in the network slice to direct the flow through selected functions.
In accordance with embodiments of the present invention, there is provided a method for performing traffic engineering on a communications network through a plurality of network slices, each network slice of the plurality of network slices configured to manage a service for transmitting data along one or more flows traversing nodes of the communications network using a portion of physical link resources. The method comprising allocating the portion of physical link resources of the communications network associated with a first network slice in the plurality of network slices in accordance with instructions received from a traffic engineering entity associated with the first network slice.
In accordance with embodiments of the present invention, there is provided a resource allocation apparatus. The resource allocation apparatus comprising a processor; an input interface coupled to the processor, the input interface for receiving instructions from a traffic engineering entity associated with a first network slice from a plurality of network slices each configured to manage a service for transmitting data along one or more flows traversing nodes of a communications network; a memory coupled to the processor, the memory having recorded thereon statements and instructions when executed by the processor to allocate a portion of physical link resources of the communications network associated with the first network slice in accordance with the instructions from the traffic engineering entity associated with the first network slice; and an output interface for providing the portion of physical link resources associated with the first network slice for transmitting data along its one or more flows using its allocated portion of physical link resources.
In accordance with embodiments of the present invention, there is provided a method for performing traffic engineering in a communications network through a first network slice managing a first service, and a second network slice managing a second service. The method comprising transmitting or receiving data associated with the first service according to the first network slice; and transmitting or receiving data associated with the second service according to the second network slice.
In accordance with embodiments of the present invention, there is provided a network node. The network node comprising a processor; an input interface coupled to the processor for receiving a first control signal from a first network slice, data associated with a first service managed by the first network slice, a second control signal from a second network slice, and data associated with a second service managed by the second network slice; a memory coupled to the processor and having stored thereon statements and instructions when executed by the processor to receive or transmit the data associated with the first service according to the first control signal, and receive or transmit the data associated with the second service according to the second control signal; and an output interface coupled to the processor for transmitting the data associated with the first service, and transmitting the data associated with the second service.
Further features and advantages of the present invention will become apparent from the following detailed description, taken in combination with the appended drawings, in which:
It will be noted that throughout the appended drawings, like features are identified by like reference numerals.
As used herein, a “network” or “communication network” comprises a plurality of nodes that may serve various devices including wireless devices and user equipment. The nodes may be physical (e.g. access points, routers, base stations, eNodeB's, gateway etc.) or include virtualized components as will become readily apparent herein. In one example, the network may have a reconfigurable variable architecture, and may support network slicing as further described below. Variability in the network architecture can allow a single network to meet competing demands in different usage scenarios. As a result, the application of these techniques to mobile networks is of great interest, and they are likely to form the foundation of fifth generation (5G) wireless mobile networks.
Communication networks may be flexibly organized through technologies such as Network Function Virtualization (NFV) and Software Defined Networking Network slicing is one feature that may be implemented in advanced networks, that provides the ability to create isolated virtual networks over which different data flows can travel.
A network slice (as defined in 3GPP TR 22.891 entitled “Study on New Services and Markets Technology Enablers”) is a collection of logical functions that support communication service requirements for one or more network services. Network slicing may be performed on NFV based networks to manage respective services associated with each slice, while isolating the traffic of one network slice from another slice to ensure independent operation, and to meet specific quality of service (QoS) requirements. Accordingly, network slicing can provide distinct virtual networks running on the same physical set of network and computing resources. For example, each network slice can meet different service demands. This can also be used to create virtual networks dedicated to particular types of network traffic. Different network slices on the same infrastructure may allow for competing service demands to be satisfied without requiring that the network be provisioned to provide the most demanding requirements from each service across the entire network.
Embodiments of the present invention are directed towards systems and methods for performing traffic engineering in a slice of a communications network such that the traffic engineering decisions can be propagated out of the confines of the slice an into the resources of the underlying communications network. Each network slice may be allocated a proportion of the network's physical link resources (e.g. bandwidth or capacity of the physical links between nodes). Each network slice then performs TE on its own flows using the allocated share of resources in the underlying network. Performing TE functions across multiple network slices provides scalable, modularized operation, which can reduce operational complexity of the communications network while also improving network efficiency.
As indicated above, network slices are isolated from each other. Thus, each slice can independently support network service requests (i.e. “services”), each of which may be required to meet certain performance guarantees. For example, each slice may be dedicated to a different type of traffic (e.g. each having different packet processing and QoS requirements), a different customer, a different service, or different groups of services. Each service may include one or more flows, where each flow comprises a source and destination pair (e.g. between network points, nodes, functions or slices) having a certain demand (i.e. transmission speed or bandwidth) to meet QoS requirements of the service. When the service adheres to a service function chain (SFC), the flow may traverse certain intervening service functions. Each of the functions in the SFC is responsible for performing certain functions.
As shown in
Logical topology 201 may be practically implemented through corresponding physical topology 220 comprising a first service gateway node 206b, second service gateway node 210b, intermediate node 204, and packet gateway node 202b. Each of the nodes 202b, 204, 206b, 210b are communicatively coupled via physical links 207, 209, 211, and 213 as shown. Each physical link may also have specific capacities corresponding to physical limitations of the network. For example, physical link 207 may have a 10 Mbps capacity, while physical links 209, 211, and 213 may have 5 Mbps capacities.
TE entities 330, 340, of MBB network slice 322 and MTC network slice 332 respectively, each perform traffic engineering functions (e.g. such as apply statistics and/or simulations to analyze, predict, and regulate the behaviour of data transmissions over the network 300) for flows associated with services of each respective network slice 322, 332. For example, TE entities 330, 340 may utilize aggregate properties over a long period of time to simulate network behaviour, in order to help determine transmission parameters and routes for more efficient data transmissions. Accordingly, TE entities 330, 340 can be used to achieve a particular Quality of Service (QoS) for the service(s) each manages, or to balance a QoS against the cost of operating and maintaining the network.
For example, the MBB network slice 322 may control access node 370 to transmit or receive data associated with an MBB service, while the MTC slice 332 may also control the access node 370 to transmit or receive data associated with an MTC service. In certain embodiments, the resource allocation module 312 may allocate a first portion of physical link resources of the communications network to the MBB network slice 322 for transmitting or receiving data associated with the MBB service, and further allocate a second potion of physical link resources to the MTC slice 332 for transmitting or receiving data associated with the MTC service. MBB slice 322 and MTC slice 332 may both control the access node 370 to receive or transmit data using control signals via functional control links, which may operate according to TE entities 330, 340 of the respective slices. In this way, traffic engineering for a communications network may be performed in a distributed manner through a plurality of network slices, with each network slice having control of network access nodes to receive or transmit data (across physical links between other access nodes, not shown) associated with each slice.
In certain embodiments, TE entities 330, 340 may utilize a flow-based, or a service-based TE algorithm, in order to determine routing decisions 418 for flows controlled by each slice, according to given inputs. Examples of flow-based and serviced based TE algorithms may be found in U.S. patent application Ser. Nos. 14/870,649, and 14/097,930, which are incorporated by reference herein.
As discussed above with reference to
As an illustrative example, the physical link 580 may have a total capacity of 12 Mbps, and each network slice 322, 332, 342 may require a 4 Mbps share in order to meet the demand of the respective service they are managing. Accordingly, the SDRA module 314 may allocate a 4 Mbps share of the physical link 580 to each of the network slices 322, 332, 342 based on their service demands. The network slices 322, 332, 342 each having been allocated a 4 Mbps logical connection that forms each slice's share of physical link 580, may thereafter perform traffic engineering using their apportioned share of the physical link 580. Instructions sent from TE entities in each of the network slices 322, 332, 342 are then received by nodes 502 and 504, allowing each slice's traffic on physical link 580 to be treated as determined by the respective TE entities.
In other embodiments (not shown), the nodes 502, 504 in
point of presence information, forwarding graph information, network topology information, and network slice flow information. The resources may comprise portions of physical link capacities between various nodes of the communications network, and may be allocated to network slices according to the QoS requirements of the service(s) it manages.
In some embodiments, resources may be allocated to the first network slice further according to a flow based resource assignment algorithm, or a group flow based resource assignment algorithm, both of which may account for multiple TE related conditions and constraints as will be discussed in further detail below.
In some embodiments, a portion of physical link resources may be further allocated to each of the plurality of network slices in accordance with instructions received from traffic engineering entities associated with each of the network slices. For example, network slices that manage services having greater demands, may be allocated a greater proportion of physical link capacities, while network slices that manage services having lower demands, may be allocated a lower proportion of physical link capacities. Network slices having been allocated resources of the communications network, can in turn manage respective services using respective TE entities, including transmission of data along one or more associated flows along the communications network. The data may be transmitted for example, in accordance with traffic engineering functions performed by each network slice.
In certain embodiments (not shown), the network slices may be specifically provided (instantiated, created or defined) by the communications network in order to manage certain service requests. In such embodiments, an optional step 610 may be included of providing the plurality of network slices, each configured to manage a service for transmitting data along one or more flows in a communications network using allocated network resources. Each network slice may also comprise a traffic engineering entity for transmitting data along flows in accordance with traffic engineering functions that may include packet routing and scheduling functionality.
As an example illustrating the steps in flow chart 700 above, a network may have deployed two network slices (S1, S2), wherein the first slice S1 manages a service having two flows (f1, f2), and the second slice S2 manages another service having two flows (f3, f4). An SDRA 314 at step 710 thus determines there are total 4 flows (e.g. f1, f2, f3, f4) to be performed over the network through the two network slices. If the services have SFC constraints, then flow segments adhering to the SFC constraints may be determined at step 715; this is explained in further detail below. At step 720, the SDRA 314 performs a flow-based resource assignment algorithm to determine the resource usage (e.g. R1, R2, R3, R4) required for each flow (f1, f2, f3, f4). At step 730, the SDRA 314 then allocates resources of the physical links to each slice (S1, S2) according to the flows of the services which they manage (e.g. S1→R1+R2; S2→R3+R4). This allows the network slices (S1, S2) to transmit data along flows of the service it manages, using the network resources allocated to each slice (e.g. S1→R1+R2; S2→R3+R4). For example, the first slice S1 may manage a service requiring transmission of data along flows f1, f2, and can use allocated resources R1+R2 to do such. The second slice S2 may manage a service requiring transmitting data along flows f3, f4, and can use its allocated resources R3+R4 to do such. Both the first and second slices (S1, S2) may execute respective transmissions through traffic engineering functions of each slice. In this way, each network slice may be allocated an appropriate share of the physical link resources in order to manage flows of respective services.
In embodiments where services have SFC constraints, the corresponding flows will traverse appropriate service function nodes in accordance with the SFC. Following the example above, if the service managed by the first slice S1 has an SFC constraint requiring packets travel through service function node N1, then flows (f1, f2) managed by the first slice S1 would traverse service function node N1. In step 715, flow segments may be identified from respective flows (f1, f2) which traverse service function node N1 in accordance with the SFC.
In one embodiment, a group of flow segments includes those flow segments having a common starting node, a common ending node, or both. For example, a first group 920 includes flow segments sharing the same ending point N1 (flow segments 902, 904, 906), the second group 930 includes flow segments sharing the same starting point N1 and ending point N2 (flow segment 908), and the third group 940 includes those flow segments sharing the same starting point N2 (flow segments 910, 912, 914).
By identifying groups of flow segments (or groups of flows in certain embodiments which do not require SFC or include intervening nodes) in step 820 and as further illustrated in the example of
With reference to
Referring back to
where:
where:
In other embodiments, a suitable objective function may also be used for the group-flow based resource assignment algorithm. Examples of objective functions include load balancing, weighted max min, etc. Furthermore, other constraints in addition to flow-group conservation constraints and link capacity constraints may be added to account for issues such as delays or specific service requirements.
The memory 1120 may include any type of non-transitory memory such as static random access memory (SRAM), dynamic random access memory (DRAM), synchronous DRAM (SDRAM), read-only memory (ROM), any combination of such, or the like. The mass storage element 1130 may include any type of non-transitory storage device, such as a solid state drive, hard disk drive, a magnetic disk drive, an optical disk drive, USB drive, or any computer program product configured to store data and machine executable program code. According to certain embodiments, the memory 1120 or mass storage 1130 may have recorded thereon statements and instructions executable by the processor 1110 for performing the aforementioned functions and steps of the SDT module 308, SDRA module 312, network slices, or TE entities 330, 340.
As described above, embodiments of the present invention disclose systems and methods for transmitting data through flows of a communication network with one or more network slices using allocated network resources. Each network slice may be configured to manage a customer, a service, or groups of services having certain QoS requirements, and may be allocated a portion of the network's physical link resources to accomplish such. Allocation of the network's physical link resources may be performed by considering individual flows for all network slices, or by considering groups of flow segments through application of a group-based resource assignment algorithm. Upon allocation of network resources to respective network slices, each network slice may perform traffic engineering to transmit data along associated flows. This configuration provides a scalable and versatile traffic engineering architecture which may improve overall network efficiency.
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs.
Through the descriptions of the preceding embodiments, the present invention may be implemented by using hardware only or by using software and a necessary universal hardware platform. Based on such understandings, the technical solution of the present invention may be embodied in the form of a software product. The software product may be stored in a non-volatile or non-transitory storage medium, which can be a compact disk read-only memory (CD-ROM), USB flash disk, or a removable hard disk. The software product includes a number of instructions that enable a computer device (personal computer, server, or network device) to execute the methods provided in the embodiments of the present invention. For example, such an execution may correspond to a simulation of the logical operations as described herein. The software product may additionally or alternatively include number of instructions that enable a computer device to execute operations for configuring or programming a digital logic apparatus in accordance with embodiments of the present invention.
Although the present invention has been described with reference to specific features and embodiments thereof, it is evident that various modifications and combinations can be made thereto without departing from the invention. The specification and drawings are, accordingly, to be regarded simply as an illustration of the invention as defined by the appended claims, and are contemplated to cover any and all modifications, variations, combinations or equivalents that fall within the scope of the present invention.
This application is a continuation of U.S. patent application Ser. No. 15/061,570 filed Mar. 4, 2016 entitled “SYSTEMS AND METHODS FOR PERFORMING TRAFFIC ENGINEERING THROUGH NETWORK SLICES”, the entire contents of which are incorporated herein by reference.
Number | Date | Country | |
---|---|---|---|
Parent | 15061570 | Mar 2016 | US |
Child | 16184130 | US |