EP3044933A1 - A method for operating an information-centric network and network - Google Patents

A method for operating an information-centric network and network

Info

Publication number
EP3044933A1
EP3044933A1 EP13774618.6A EP13774618A EP3044933A1 EP 3044933 A1 EP3044933 A1 EP 3044933A1 EP 13774618 A EP13774618 A EP 13774618A EP 3044933 A1 EP3044933 A1 EP 3044933A1
Authority
EP
European Patent Office
Prior art keywords
sdn controller
ndo
request
icn
requests
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
EP13774618.6A
Other languages
German (de)
French (fr)
Other versions
EP3044933B1 (en
Inventor
Fabian SCHNEIDER
Dirk Kutscher
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
NEC Corp
Original Assignee
NEC Europe Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by NEC Europe Ltd filed Critical NEC Europe Ltd
Publication of EP3044933A1 publication Critical patent/EP3044933A1/en
Application granted granted Critical
Publication of EP3044933B1 publication Critical patent/EP3044933B1/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/12—Discovery or management of network topologies
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/40—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks using virtualisation of network functions or resources, e.g. SDN or NFV entities
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/28—Flow control; Congestion control in relation to timing considerations
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/06—Protocols specially adapted for file transfer, e.g. file transfer protocol [FTP]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/50—Network services
    • H04L67/56—Provisioning of proxy services
    • H04L67/566—Grouping or aggregating service requests, e.g. for unified processing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L61/00—Network arrangements, protocols or services for addressing or naming
    • H04L61/45—Network directories; Name-to-address mapping
    • H04L61/457—Network directories; Name-to-address mapping containing identifiers of data entities on a computer, e.g. file names
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y04—INFORMATION OR COMMUNICATION TECHNOLOGIES HAVING AN IMPACT ON OTHER TECHNOLOGY AREAS
    • Y04S—SYSTEMS INTEGRATING TECHNOLOGIES RELATED TO POWER NETWORK OPERATION, COMMUNICATION OR INFORMATION TECHNOLOGIES FOR IMPROVING THE ELECTRICAL POWER GENERATION, TRANSMISSION, DISTRIBUTION, MANAGEMENT OR USAGE, i.e. SMART GRIDS
    • Y04S40/00—Systems for electrical power generation, transmission, distribution or end-user application management characterised by the use of communication or information technologies, or communication or information technology specific aspects supporting them

Definitions

  • the present invention relates to a method for operating an information-centric network, ICN, wherein at least one named data object, NDO, is addressable and wherein after an initial request a request aggregation of subsequent requests for the at least one NDO is performed according to a definable rule. Further, the present invention relates to an information-centric network, ICN, comprising at least one addressable named data object, NDO, and means for performing after an initial request a request aggregation of subsequent requests for the at least one NDO according to a definable rule. In ICN, communication is not based on packets that are "sent from" and "destined to" hosts or host interface addresses.
  • requestors send requests to the network, asking for named data objects, NDOs, that have been published before and that are available in one or many copies in the network.
  • the network elements e.g. switches or nodes, that receive a request - unless they have a local copy in their cache - typically have to decide where to forward the request to, for example which interface to use for forwarding the request.
  • a network switch or network node can participate in a routing protocol that helps to distribute this information, or a network switch or network node can employ a Name Resolution Service, NRS, that can map NDOs to locators in underlying networks, for example IP.
  • NRS Name Resolution Service
  • a corresponding response message i.e., the NDO or a locator
  • This return path can be determined in different ways: For example network elements can maintain state or they can obtain some information from data structure inside messages, such as a label stack.
  • SDN Software-Defined Networking
  • SDN relies on the concept of providing an API, Application Programming Interface/protocol for packet forwarding devices such as switches, nodes and routers, which allows programmability of network elements and entire networks.
  • An example for such a controller to switch protocol is OpenFlow, see OpenFlow Switch Specification, Version 1.0.0 (Wire Protocol 0x01 ), December 31 , 2009. http://www.openflow.org/documents/openflow-spec- vl .O.O.pdf.
  • Request aggregation is the concept to avoid forwarding subsequent requests for the same NDO arriving at the same ICN node or switch, so that the request and the NDO are transmitted only once over the path between that node or switch and the content source.
  • Fig. 1 which is showing a per-node request aggregation. Concretely, Fig. 1 is showing three different points in time, where requests R1 , R2 and R3 are performed from different requestors.
  • a content A which is provided within a source S.
  • the content A shall be transmitted to hosts H1 , H2 and H3 according to the indications by arrows within Fig. 1 , right part.
  • Nodes N1 to N6 are provided within the shown ICN structure.
  • the left part of Fig. 1 is showing the request R1 for the content A.
  • This request R1 is transmitted from N1 to N6 and the source S as shown within the left and middle parts of Fig. 1.
  • a further request R3 is directed to N1 and is aggregated and delayed by node N1.
  • a further request R2 directed to node N2 will be transmitted to N6 and the source S.
  • the content A is transmitted two times on two ways from S to N1 and from S to N2 for provision to hosts H1 , H2 and H3.
  • a node or switch delays the forwarding of subsequent requests for the same NDO, as he expects the responses to first request to pass by and will then serve both or all requests.
  • Per-node request aggregation is well known for ICN.
  • the aforementioned object is accomplished by a method comprising the features of claim 1 and by a network comprising the features of claim 31.
  • the method is characterized in that a software-defined networking, SDN, with a SDN controller is implemented in the ICN and that a network-wide request aggregation is performed by the SDN controller.
  • the network is characterized in that a software-defined networking, SDN, with a SDN controller is implemented in the ICN and that the SDN controller is configured for performing a network-wide request aggregation.
  • SDN software-defined networking
  • the invention it has been recognized that it is possible to allow a very effective use of network resources by further reducing transmitted ICN messages.
  • Such a further reduction of transmitted ICN messages can be provided by an enhancement of the network control by the implementation of software-defined networking, SDN, with a SDN controller.
  • the SDN controller performs a network-wide request aggregation instead of the known per-node request aggregation within known information-centric networks.
  • the invention is especially beneficial for live streaming of data to multiple receivers or hosts, as many requests for the same NDO arrive at the same time at different nodes or switches of the network.
  • This invention provides a network-wide version of request aggregation made possible through ICN control.
  • a centralized SDN controller is used for providing request aggregation mechanisms.
  • the SDN controller can detect duplicate requests. Depending on the definable rule the SDN controller can decide on which requests to delay. Such a decision can be performed centrally. Further depending on the definable rule the SDN controller can decide how to route and/or where to duplicate the at least one NDO. The NDO can be seen as a response to a respective request.
  • the ICN can operate in a mode wherein a request path and a response path are provided at the same time upon an initial handling of the initial request.
  • a similar but simpler approach is possible, wherein the ICN operates in a mode wherein a response path is only provided when a NDO response or a transmission of the NDO or a transmission of the content of the NDO is generated.
  • a best content source for the at least one NDO can be determined. In this way a best content source is selected between multiple content sources all providing the same at least one NDO. Such a determination of a best content source can be performed under the knowledge where content of the NDO or the NDO itself is cached. Thus, the determination of a best content source can be cache-aware, i.e. can know where content is cached.
  • the term "content source” or “source” is used for an ICN switch or node or router actually providing the desired NDO form its storage as well as for an ICN node or switch or router at the egress of the ICN, wherein said ICN node or switch or router knows how to retrieve the content from another ICN node or switch or router.
  • the ICN elements “node” or “switch” or “router” are used herein synonymously.
  • a concrete embodiment of a SDN controller for network-wide request aggregation can comprise a Pending-Request Table, PRT.
  • PRT Pending-Request Table
  • Such a PRT can also be designated as pending interest table.
  • the PRT can comprise a name or identification of the requested NDO and/or a counter differentiating between requests for the same name or identification and/or an identifier of an ingress SDN switch/node and/or a selected content source for the NDO and/or a selected return path for the NDO and/or the estimated time of arrival of the requests at the content source.
  • the SDN controller can comprise the topology of the ICN with regard to an optimization of the routing of NDOs, for example.
  • the SDN controller can comprise an expected per link one-way delay information. This will provide a very sophisticated routing and scheduling of requests and NDOs.
  • the SDN controller can comprise a cost metric for all possible paths and/or content sources.
  • a cost metric can serve as input to a spanning tree calculation and can be related to a link delay and/or a link bandwidth and/or a link utilization and/or a content source utilization.
  • a relation to other traffic engineering metrics is also useful and/or possible.
  • the SDN controller can comprise the definable rule.
  • the SDN controller can determine the best available content source 5 ⁇ ' for serving the requested NDO X, wherein i denotes the Tth request seen by the SDN controller and wherein the current time is set to t°. Further, using /* ⁇ ', an ingress switch/node of the ICN, and S*-' - the SDN controller can calculate a path for the request RP -' : '' ⁇ S*' and a path for returning the NDO P Xi : S Xi ⁇ l Xi . Then, the SDN controller can determine all other pending request j for the same NDO X, whose request has not yet reached the content source, ⁇ ⁇ ⁇ > P, and can add them to a list of candidate requests C for aggregation.
  • the SDN controller can configure RP Xi and P X/ and estimate the estimated time of arrival ⁇ ⁇ , ⁇ that request at the content source. If the list of candidate requests C is not empty, the SDN controller can check whether aggregation of requests is possible. Then, the SDN controller can calculate one or more multiple spanning trees, MST, from a set of all possible content sources ( ⁇ S*J in C ⁇ U S ⁇ ' ) to a set of all ingress switches/nodes ⁇ l x in C ⁇ U l X! ).
  • the SDN controller can evaluate the resulting MSTs regarding their cost. If the lowest cost MST that includes the ingress switch/node / ⁇ ' is equivalent to P Xi , then no aggregation will be performed. If there is a MST with lower cost, the SDN controller can instruct the ingress switch/node /* to drop the request and update 5 ⁇ 'and all other affected ⁇ ' and can configure a new path in the ICN.
  • the MST can define duplication points in the ICN. Additionally or alternatively, the SDN controller can configure copy rules in the switches/nodes within the ICN.
  • the SDN controller can set the ETA for the current request to the minimum of ETA of the other requests in the selected MST ⁇ ETA x Jin MST ⁇ ).
  • a feedback can notify the SDN controller when the at least one NDO is sent from its content source. In this case, there is no longer a need for delay annotations in the topology and the ETA estimation.
  • an entry in the PRT can be removed. This will avoid the storage of data which are no longer necessary for further request aggregation.
  • the present invention provides a mechanism for network-wide request aggregation for ICN leveraging knowledge and control mechanisms of a preferably centralized controller.
  • Main applications for this approach are streaming services or live streaming services, due to the timely synchronized number of requests for the same NDO.
  • the invention can provide a cost-aware optimization of request/response routing and a request/response-timing-aware path-selection. Further, per-request aggregation decisions are possible.
  • the present invention provides a further reduction of transmitted ICN messages, e.g. request and response messages, and a real-time, network-state-aware delivery tree optimization for NDOs.
  • ICNs request aggregation is done on a per-node basis.
  • the present invention provides a network-wide approach to realize additional optimization potential.
  • the present invention is useful with ICNs that are deployed with a preferably centralized control approach, that allows to individually steer, drop and copy ICN requests and NDO responses.
  • ICNs that are deployed with a preferably centralized control approach, that allows to individually steer, drop and copy ICN requests and NDO responses.
  • Fig. 1 is showing in a diagram three subsequent situations of a per-node request aggregation within known information-centric networks
  • Fig. 2 is showing in a diagram three subsequent situations of a network-wide request aggregation according to the invention.
  • Fig. 3 is showing a flow chart of decisions for a network-wide request aggregation at a network controller according to the invention.
  • a method for operating an information-centric network wherein at least one named data object, NDO, is addressable and wherein after an initial request a request aggregation of subsequent requests for the at least one NDO is performed according to a definable rule.
  • NDO data object
  • a software-defined networking, SDN with a SDN controller is implemented in the ICN and a network-wide request aggregation is performed by the SDN controller.
  • the embodiment comprises a network-wide version of request aggregation, made possible through a preferably centralized ICN control by the SDN controller.
  • the detection of duplicate requests will be performed by the SDN controller and the SDN controller can decide centrally on which requests to delay and how to route and where to duplicate the NDOs or responses.
  • Fig. 2 explains the difference to known per-node request aggregation according to Fig. 1.
  • the NDO A needs to be transmitted through the network only once as compared to two times in the per-node request aggregation case - see Fig. 1 - and is duplicated at the node N3 for provision to the nodes N1 and N2 and further transmission to hosts H1 , H2 and H3, see the right part of Fig. 2.
  • Fig. 2 From the middle part of Fig. 2 is obtainable that subsequent requests R2 and R3 are delayed at nodes N1 and N2 by the SDN controller. Only request R1 , see the left part of Fig. 2, is transmitted to the source S for getting the content A.
  • the invention is especially beneficial for streaming or live streaming of data to multiple receivers, as many requests for the same NDO arrive at the same time at different nodes of the network.
  • the software-defined ICN is operating in a 'provision request and response path at the same time' upon the initial handling of the request.
  • the response path is only provisioned when the NDO response is generated a similar but simpler approach is possible at the SDN controller.
  • the suggested embodiment includes a way to determine the best source for the requested content. This function can or cannot be cache-aware, i.e. know where content is cached.
  • node is used synonymously for the elements “node” or “switch” or “router”.
  • node is used for all network elements which can route and/or transmit NDOs or data.
  • a pending-request table PRT often called pending interest table in ICN.
  • the selected content source e.g. cache, for the NDO (S)
  • the requests estimated time of arrival at the content source (ETA) The topology of the SDN controlled ICN, along with a cost metric for all the possible paths/content sources.
  • the topology needs to be annotated with expected per link one-way delay information.
  • the cost metric serves as input to a multiple spanning tree calculation and can be related to one or a combination of the following information:
  • FIG. 3 gives the high-level overview. The procedure starts in the top left corner ("Start") whenever the SDN controller detects a new request at the ingress of its network. We assume the request is for an N DO with the name X. Furthermore we assume this request is the /th request seen by the SDN controller of this ICN and we set the current time to P. Finally we denote the ingress node by l Xi .
  • the controller determines the best available content source S*-' for serving the requested NDO X.
  • the controller calculates a path for the request Rpx - /x , i ⁇ sx and a path for returning the NDO P Xi : S ' ⁇ l Xi c. Then in Section A the controller determines all other pending requests j for the same NDO with name X, whose request has not yet reached the content source ⁇ ⁇ ⁇ > P) and adds them to a list of candidate requests Cfor aggregation.
  • step f If this list of candidates is empty (not /C/> 0) the request is not aggregated and the controller configures RP Xi P Xi . This is e.g. the case when no other requests for the same NDO are present in the ICN. In addition the controller estimates the estimated time of arrival ⁇ ⁇ / ⁇ that request at the content source. The next step is step f.
  • the controller enters in Section B and tries to see if there is a way to aggregate requests. For that purpose the controller calculates multiple spanning trees, MSTs, from the set of all possible sources ( ⁇ S X J in C ⁇ U S*-') to the set of all ingress nodes ⁇ l x J in C ⁇ U l X! ). Then the controller evaluates the resulting MSTs regarding their cost.
  • step d If the lowest cost MST that includes the ingress node l Xi is equivalent to P XI then there is no need for request aggregation and the controller continues with the actions described in step d.
  • the controller instructs the ingress l Xi switch to drop the request and update S Xi . It will also update P Xl an all other affected
  • step f the controller sets the ETA for the current request to the minimum of the ETA of the other requests in the selected MST ⁇ ETA X J in MST ⁇ ).
  • a simplified version of this control mechanism could be to configure the network in a way so that explicit feedback notifies the SDN controller when NDOs are sent out. That way there is no longer a need for delay annotations in the topology and the ETA estimation - done in the two boxes before the "Enter to PRT" box in Fig. 3.
  • the ETA checking would be swapped out for a simple check if the NDO response has already been sent out. This requires storing this binary information in the PRT, replacing the ETA information.
  • this simplified version requires communicating the sending of the NDO to the SDN controller and a processing of this trigger, updating the PRT. This will either cause overhead at the ICN object source node or the SDN controller or switch next to it.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

For allowing a very effective use of network resources by simple means a method for operating an information-centric network, ICN, is claimed, wherein at least one named data object, NDO, is addressable and wherein after an initial request a request aggregation of subsequent requests for the at least one NDO is performed according to a definable rule. The method is characterized in that a software- defined networking, SDN, with a SDN controller is implemented in the ICN and that a network-wide request aggregation is performed by the SDN controller. Further, an according information-centric network is claimed, preferably for carrying out the above mentioned method.

Description

A METHOD FOR OPERATING AN INFORMATION-CENTRIC
NETWORK AND NETWORK
The present invention relates to a method for operating an information-centric network, ICN, wherein at least one named data object, NDO, is addressable and wherein after an initial request a request aggregation of subsequent requests for the at least one NDO is performed according to a definable rule. Further, the present invention relates to an information-centric network, ICN, comprising at least one addressable named data object, NDO, and means for performing after an initial request a request aggregation of subsequent requests for the at least one NDO according to a definable rule. In ICN, communication is not based on packets that are "sent from" and "destined to" hosts or host interface addresses.
In ICN, requestors send requests to the network, asking for named data objects, NDOs, that have been published before and that are available in one or many copies in the network. The network elements, e.g. switches or nodes, that receive a request - unless they have a local copy in their cache - typically have to decide where to forward the request to, for example which interface to use for forwarding the request. Typically a network switch or network node can participate in a routing protocol that helps to distribute this information, or a network switch or network node can employ a Name Resolution Service, NRS, that can map NDOs to locators in underlying networks, for example IP.
Once a request has been forwarded and reached the destination, e.g., a NDO copy in a cache, a corresponding response message, i.e., the NDO or a locator, has to be relayed back to the requestor, possibly passing one or more on-path caches that can cache the objects in order to satisfy future requests from their cache. This return path can be determined in different ways: For example network elements can maintain state or they can obtain some information from data structure inside messages, such as a label stack. A survey of information-centric networking is obtainable from Ahlgren, B.; Dannewitz, C; Imbrenda, C; Kutscher, D.; Ohlman, B., "A survey of information- centric networking," Communications Magazine, IEEE , vol.50, no.7, pp.26, 36, July 2012, doi: 10.1 109/MCOM.2012.6231276, URL: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6231276
The basic idea of SDN is to separate network control-plane logic from data-plane forwarding. This means breaking today's feature-rich network elements, e.g. switches, nodes or routers, into dumb forwarding elements and complex network controllers. Software-Defined Networking, SDN, relies on the concept of providing an API, Application Programming Interface/protocol for packet forwarding devices such as switches, nodes and routers, which allows programmability of network elements and entire networks. An example for such a controller to switch protocol is OpenFlow, see OpenFlow Switch Specification, Version 1.0.0 (Wire Protocol 0x01 ), December 31 , 2009. http://www.openflow.org/documents/openflow-spec- vl .O.O.pdf.
Information-centric networking approaches, such as CCN, Content Centric Networking, or Netlnf, Network of Information, follow the basic principle of addressing content objects, NDOs, and not hosts or end-points. One often mentioned advantage in ICN is "request aggregation". Request aggregation is the concept to avoid forwarding subsequent requests for the same NDO arriving at the same ICN node or switch, so that the request and the NDO are transmitted only once over the path between that node or switch and the content source. For reference, see also Fig. 1 which is showing a per-node request aggregation. Concretely, Fig. 1 is showing three different points in time, where requests R1 , R2 and R3 are performed from different requestors. There is requested a content A which is provided within a source S. The content A shall be transmitted to hosts H1 , H2 and H3 according to the indications by arrows within Fig. 1 , right part. Nodes N1 to N6 are provided within the shown ICN structure. The left part of Fig. 1 is showing the request R1 for the content A. This request R1 is transmitted from N1 to N6 and the source S as shown within the left and middle parts of Fig. 1. Within this middle part of Fig. 1 a further request R3 is directed to N1 and is aggregated and delayed by node N1. A further request R2 directed to node N2 will be transmitted to N6 and the source S. As obtainable from the right part of Fig. 1 the content A is transmitted two times on two ways from S to N1 and from S to N2 for provision to hosts H1 , H2 and H3.
For request aggregation in ICN, a node or switch delays the forwarding of subsequent requests for the same NDO, as he expects the responses to first request to pass by and will then serve both or all requests. Per-node request aggregation is well known for ICN.
Even though the known request aggregation mechanism is helpful for reducing the scope of transmitted ICN messages like request and response messages a further enhancement of the effectiveness of use of network resources seems to be useful in view of generally increasing traffic within data networks.
Thus, it is an object of the present invention to improve and further develop a method for operating an information-centric network and an according information- centric network for allowing a very effective use of network resources by simple means.
In accordance with the invention, the aforementioned object is accomplished by a method comprising the features of claim 1 and by a network comprising the features of claim 31. According to claim 1 the method is characterized in that a software-defined networking, SDN, with a SDN controller is implemented in the ICN and that a network-wide request aggregation is performed by the SDN controller.
According to claim 31 the network is characterized in that a software-defined networking, SDN, with a SDN controller is implemented in the ICN and that the SDN controller is configured for performing a network-wide request aggregation.
According to the invention it has been recognized that it is possible to allow a very effective use of network resources by further reducing transmitted ICN messages. Such a further reduction of transmitted ICN messages can be provided by an enhancement of the network control by the implementation of software-defined networking, SDN, with a SDN controller. Further according to the invention the SDN controller performs a network-wide request aggregation instead of the known per-node request aggregation within known information-centric networks. The invention is especially beneficial for live streaming of data to multiple receivers or hosts, as many requests for the same NDO arrive at the same time at different nodes or switches of the network. This invention provides a network-wide version of request aggregation made possible through ICN control.
On the basis of the invention a very effective use of network resources is possible by simple means.
Within a concrete embodiment a centralized SDN controller is used for providing request aggregation mechanisms.
For providing a very effective request aggregation the SDN controller can detect duplicate requests. Depending on the definable rule the SDN controller can decide on which requests to delay. Such a decision can be performed centrally. Further depending on the definable rule the SDN controller can decide how to route and/or where to duplicate the at least one NDO. The NDO can be seen as a response to a respective request.
With regard to a very reliable operation of the request aggregation mechanism the ICN can operate in a mode wherein a request path and a response path are provided at the same time upon an initial handling of the initial request. However, a similar but simpler approach is possible, wherein the ICN operates in a mode wherein a response path is only provided when a NDO response or a transmission of the NDO or a transmission of the content of the NDO is generated.
Regarding a very effective use of the network resources a best content source for the at least one NDO can be determined. In this way a best content source is selected between multiple content sources all providing the same at least one NDO. Such a determination of a best content source can be performed under the knowledge where content of the NDO or the NDO itself is cached. Thus, the determination of a best content source can be cache-aware, i.e. can know where content is cached.
Within this description the term "content source" or "source" is used for an ICN switch or node or router actually providing the desired NDO form its storage as well as for an ICN node or switch or router at the egress of the ICN, wherein said ICN node or switch or router knows how to retrieve the content from another ICN node or switch or router. The ICN elements "node" or "switch" or "router" are used herein synonymously.
A concrete embodiment of a SDN controller for network-wide request aggregation can comprise a Pending-Request Table, PRT. Such a PRT can also be designated as pending interest table.
Regarding a very reliable operation of the request aggregation method entries in the PRT should comprise different information. Thus, the PRT can comprise a name or identification of the requested NDO and/or a counter differentiating between requests for the same name or identification and/or an identifier of an ingress SDN switch/node and/or a selected content source for the NDO and/or a selected return path for the NDO and/or the estimated time of arrival of the requests at the content source.
Further, the SDN controller can comprise the topology of the ICN with regard to an optimization of the routing of NDOs, for example.
Within a further embodiment the SDN controller can comprise an expected per link one-way delay information. This will provide a very sophisticated routing and scheduling of requests and NDOs.
Within a further embodiment the SDN controller can comprise a cost metric for all possible paths and/or content sources. Such a cost metric can serve as input to a spanning tree calculation and can be related to a link delay and/or a link bandwidth and/or a link utilization and/or a content source utilization. A relation to other traffic engineering metrics is also useful and/or possible. Generally, with regard to a reliable and effective request aggregation mechanism the SDN controller can comprise the definable rule.
Within a concrete request aggregation method the SDN controller can determine the best available content source 5^' for serving the requested NDO X, wherein i denotes the Tth request seen by the SDN controller and wherein the current time is set to t°. Further, using /*■', an ingress switch/node of the ICN, and S*-' - the SDN controller can calculate a path for the request RP -' : ''→ S*' and a path for returning the NDO PXi: SXi→ lXi. Then, the SDN controller can determine all other pending request j for the same NDO X, whose request has not yet reached the content source, ΕΤΑχί > P, and can add them to a list of candidate requests C for aggregation.
If the list of candidate requests C is empty, the request will not be aggregated and the SDN controller can configure RPXi and PX/ and estimate the estimated time of arrival ΕΤΑΧ,ΊΟΓ that request at the content source. If the list of candidate requests C is not empty, the SDN controller can check whether aggregation of requests is possible. Then, the SDN controller can calculate one or more multiple spanning trees, MST, from a set of all possible content sources ({S*J in C} U S^' ) to a set of all ingress switches/nodes {{lx in C} U lX!).
Then, the SDN controller can evaluate the resulting MSTs regarding their cost. If the lowest cost MST that includes the ingress switch/node /^' is equivalent to PXi, then no aggregation will be performed. If there is a MST with lower cost, the SDN controller can instruct the ingress switch/node /* to drop the request and update 5^'and all other affected ^'and can configure a new path in the ICN. The MST can define duplication points in the ICN. Additionally or alternatively, the SDN controller can configure copy rules in the switches/nodes within the ICN.
Then, the SDN controller can set the ETA for the current request to the minimum of ETA of the other requests in the selected MST {{ETAxJin MST}).
Within a very simple version of the request aggregation mechanism a feedback can notify the SDN controller when the at least one NDO is sent from its content source. In this case, there is no longer a need for delay annotations in the topology and the ETA estimation.
Within a further preferred embodiment, once the at least one NDO has been delivered to the requestor, an entry in the PRT can be removed. This will avoid the storage of data which are no longer necessary for further request aggregation.
The present invention provides a mechanism for network-wide request aggregation for ICN leveraging knowledge and control mechanisms of a preferably centralized controller. Main applications for this approach are streaming services or live streaming services, due to the timely synchronized number of requests for the same NDO. The invention can provide a cost-aware optimization of request/response routing and a request/response-timing-aware path-selection. Further, per-request aggregation decisions are possible.
The present invention provides a further reduction of transmitted ICN messages, e.g. request and response messages, and a real-time, network-state-aware delivery tree optimization for NDOs.
In current ICNs request aggregation is done on a per-node basis. The present invention provides a network-wide approach to realize additional optimization potential.
The present invention is useful with ICNs that are deployed with a preferably centralized control approach, that allows to individually steer, drop and copy ICN requests and NDO responses. There are several ways how to design and further develop the teaching of the present invention in an advantageous way. To this end it is to be referred to the patent claims subordinate to patent claim 1 on the one hand and to the following explanation of preferred examples of embodiments of the invention, illustrated by the drawing on the other hand. In connection with the explanation of the preferred embodiments of the invention by the aid of the drawing, generally preferred embodiments and further developments of the teaching will be explained. In the drawings
Fig. 1 is showing in a diagram three subsequent situations of a per-node request aggregation within known information-centric networks,
Fig. 2 is showing in a diagram three subsequent situations of a network-wide request aggregation according to the invention and
Fig. 3 is showing a flow chart of decisions for a network-wide request aggregation at a network controller according to the invention.
According to the invention a method for operating an information-centric network, ICN, is provided wherein at least one named data object, NDO, is addressable and wherein after an initial request a request aggregation of subsequent requests for the at least one NDO is performed according to a definable rule. Further, a software-defined networking, SDN, with a SDN controller is implemented in the ICN and a network-wide request aggregation is performed by the SDN controller.
The embodiment comprises a network-wide version of request aggregation, made possible through a preferably centralized ICN control by the SDN controller. The detection of duplicate requests will be performed by the SDN controller and the SDN controller can decide centrally on which requests to delay and how to route and where to duplicate the NDOs or responses. Fig. 2 explains the difference to known per-node request aggregation according to Fig. 1. Within Fig. 2 the NDO A needs to be transmitted through the network only once as compared to two times in the per-node request aggregation case - see Fig. 1 - and is duplicated at the node N3 for provision to the nodes N1 and N2 and further transmission to hosts H1 , H2 and H3, see the right part of Fig. 2. From the middle part of Fig. 2 is obtainable that subsequent requests R2 and R3 are delayed at nodes N1 and N2 by the SDN controller. Only request R1 , see the left part of Fig. 2, is transmitted to the source S for getting the content A. The invention is especially beneficial for streaming or live streaming of data to multiple receivers, as many requests for the same NDO arrive at the same time at different nodes of the network.
Within an embodiment of the invention the following assumptions can be made:
• The software-defined ICN is operating in a 'provision request and response path at the same time' upon the initial handling of the request. When the response path is only provisioned when the NDO response is generated a similar but simpler approach is possible at the SDN controller.
· The suggested embodiment includes a way to determine the best source for the requested content. This function can or cannot be cache-aware, i.e. know where content is cached.
• For the rest of our description we use the term "content source" or "source" for both an ICN node actually providing the desired NDO from its storage as well as for an ICN node at the egress of the software-defined ICN network, which knows how to retrieve the content from another ICN.
Within the present document and description of the embodiment the term "node" is used synonymously for the elements "node" or "switch" or "router". The term "node" is used for all network elements which can route and/or transmit NDOs or data.
This embodiment of a software-defined SDN controller for network-wide request aggregation comprises:
1. A pending-request table PRT, often called pending interest table in ICN.
Entries in the PRT need the following information, see also PRT fields in Fig. 3:
a. The name of the requested NDO (X) b. A counter differentiating between requests for the same name (n) c. The identifier of the ingress SDN switch (I)
d. The selected content source, e.g. cache, for the NDO (S)
e. The selected return path for the NDO (P)
f. The requests estimated time of arrival at the content source (ETA) The topology of the SDN controlled ICN, along with a cost metric for all the possible paths/content sources. The topology needs to be annotated with expected per link one-way delay information. The cost metric serves as input to a multiple spanning tree calculation and can be related to one or a combination of the following information:
a. Link delay
b. Link bandwidth
c. Link utilization
d. ICN content source utilization
e. Other traffic engineering metrics are applicable as well
A procedure to determine if and how to aggregate requests. Fig. 3 gives the high-level overview. The procedure starts in the top left corner ("Start") whenever the SDN controller detects a new request at the ingress of its network. We assume the request is for an N DO with the name X. Furthermore we assume this request is the /th request seen by the SDN controller of this ICN and we set the current time to P. Finally we denote the ingress node by lXi.
a. First the controller determines the best available content source S*-' for serving the requested NDO X.
b. Next using /Xl and 5^' the controller calculates a path for the request Rpx - /x,i→ sx and a path for returning the NDO PXi: S '→ lXi c. Then in Section A the controller determines all other pending requests j for the same NDO with name X, whose request has not yet reached the content source ΕΤΑχι > P) and adds them to a list of candidate requests Cfor aggregation.
d. If this list of candidates is empty (not /C/> 0) the request is not aggregated and the controller configures RPXi PXi. This is e.g. the case when no other requests for the same NDO are present in the ICN. In addition the controller estimates the estimated time of arrival ΕΤΑΧ/ΊΟΓ that request at the content source. The next step is step f.
e. If however the list of candidates is not empty (/C/> 0), the controller enters in Section B and tries to see if there is a way to aggregate requests. For that purpose the controller calculates multiple spanning trees, MSTs, from the set of all possible sources ({SXJ in C} U S*-') to the set of all ingress nodes {{lxJ in C} U lX!). Then the controller evaluates the resulting MSTs regarding their cost.
i. If the lowest cost MST that includes the ingress node lXi is equivalent to PXI then there is no need for request aggregation and the controller continues with the actions described in step d.
ii. However if there is a better spanning tree with lower cost the controller instructs the ingress lXi switch to drop the request and update SXi. It will also update PXl an all other affected
Ρχί and it configures the new path in the network. The spanning tree defines the duplication points in the network, and the controller will configure copy rules in the switches accordingly. As a final step before continuing with step f the controller sets the ETA for the current request to the minimum of the ETA of the other requests in the selected MST {{ETAXJ in MST}).
f. Enter request in PRT and end. Within the above description i and j are non-negative integers.
A simplified version of this control mechanism could be to configure the network in a way so that explicit feedback notifies the SDN controller when NDOs are sent out. That way there is no longer a need for delay annotations in the topology and the ETA estimation - done in the two boxes before the "Enter to PRT" box in Fig. 3. In Section A the ETA checking would be swapped out for a simple check if the NDO response has already been sent out. This requires storing this binary information in the PRT, replacing the ETA information. However this simplified version requires communicating the sending of the NDO to the SDN controller and a processing of this trigger, updating the PRT. This will either cause overhead at the ICN object source node or the SDN controller or switch next to it.
In the embodiment described above we limit our optimizations to requests that have not yet reached their content source, because we need to be able to configure the return path. With tighter control over the information-centric network it is also possible to keep optimizing even if the NDO is already on its way to the requestor(s). However there is a trade-off between tight control and state-tracking overhead at the SDN controller and in the control network.
An even tighter control would be required for a system that exploits knowledge about on-path caching, and uses predictions to direct requests to nodes not yet holding the requested NDO. Once NDOs have been delivered to the requestor the entry in the PRT should be removed. However the PRT eviction strategy is not very relevant for this embodiment, as we preselect the candidate PRT entries based on the ETA of the request at the content source. The invention can co-exist with cache optimization and other traffic engineering mechanisms. The cache optimization should be interfaced with the "Determine best content source" function in Fig. 3. Traffic engineering should probably use the same cost metric as the multiple spanning tree calculation. Many modifications and other embodiments of the invention set forth herein will come to mind the one skilled in the art to which the invention pertains having the benefit of the teachings presented in the foregoing description and the associated drawings. Therefore, it is to be understood that the invention is not to be limited to the specific embodiments disclosed and that modifications and other embodiments are intended to be included within the scope of the appended claims. Although specific terms are employed herein, they are used in a generic and descriptive sense only and not for purposes of limitation.

Claims

C l a i m s
1. A method for operating an information-centric network, ICN, wherein at least one named data object, NDO, is addressable and wherein after an initial request a request aggregation of subsequent requests for the at least one NDO is performed according to a definable rule,
c h a r a c t e r i z e d in that a software-defined networking, SDN, with a SDN controller is implemented in the ICN and that a network-wide request aggregation is performed by the SDN controller.
2. A method according to claim 1 , wherein the SDN controller detects duplicate requests.
3. A method according to claim 1 or 2, wherein the SDN controller decides on which requests to delay.
4. A method according to one of claims 1 to 3, wherein the SDN controller decides how to route and/or where to duplicate the at least one NDO.
5. A method according to one of claims 1 to 4, wherein the ICN operates in a mode wherein a request path and a response path are provided at the same time upon an initial handling of the initial request.
6. A method according to one of claims 1 to 4, wherein the ICN operates in a mode wherein a response path is only provided when a NDO response is generated.
7. A method according to one of claims 1 to 6, wherein a best content source for the at least one NDO will be determined.
8. A method according to claim 7, wherein the determination is performed under the knowledge where content of the NDO or the NDO is cached.
9. A method according to one of claims 1 to 8, wherein the SDN controller comprises a Pending-Request Table, PRT.
10. A method according to claim 9, wherein the PRT comprises a name (X) or identification of the requested NDO and/or a counter (n) differentiating between requests for the same name (X) or identification and/or an identifier (I) of an ingress SDN switch/node and/or a selected content source (S) for the NDO and/or a selected return path (P) for the NDO and/or the estimated time of arrival (ETA) of the requests at the content source.
1 1. A method according to one of claims 1 to 10, wherein the SDN controller comprises the topology of the ICN.
12. A method according to one of claims 1 to 1 1 , wherein the SDN controller comprises an expected per link one-way delay information.
13. A method according to one of claims 1 to 12, wherein the SDN controller comprises a cost metric for all possible paths and/or content sources (S).
14. A method according to claim 13, wherein the cost metric serves as input to a spanning tree calculation.
15. A method according to claim 13 or 14, wherein the cost metric is related to a link delay and/or a link bandwidth and/or a link utilization and/or a content source (S) utilization.
16. A method according to one of claims 1 to 15, wherein the SDN controller comprises the definable rule.
17. A method according to one of claims 1 to 16, wherein the SDN controller determines the best available content source 5^' for serving the requested NDO X, wherein i denotes the Tth request seen by the SDN controller and wherein the current time is set to P.
18. A method according to claim 17, wherein - using /X/ an ingress switch/node of the ICN, and S*' - the SDN controller calculates a path for the request RPXi : lXi → 5^' and a path for returning the NDO PXi: lXi.
19. A method according to claim 18, wherein the SDN controller determines all other pending requests for the same NDO X, whose request has not yet reached the content source, ETAXJ > P, and adds them to a list of candidate requests C for aggregation.
20. A method according to claim 19, wherein, if the list of candidate requests C is empty, the request will not be aggregated and the SDN controller configures RPX ' and PX/ and estimates the estimated time of arrival T^' for that request at the content source.
21. A method according to claim 19, wherein, if the list of candidate requests C is not empty, the SDN controller checks whether aggregation of requests is possible.
22. A method according to claim 21 , wherein the SDN controller calculates one or more multiple spanning trees, MST, from a set of all possible content sources
{{SXJ in C} U SXi) to a set of all ingress switches/nodes {{lxJ in C} U lX!).
23. A method according to claim 22, wherein the SDN controller evaluates the resulting MSTs regarding their cost.
24. A method according to claim 23, wherein, if the lowest cost MST that includes the ingress switch/node lXi is equivalent to PXi, then no aggregation will be performed.
25. A method according to claim 23, wherein, if there is a MST with lower cost, the SDN controller instructs the ingress switch/node lXi to drop the request and update configures a new path in the ICN.
26. A method according to claim 25, wherein the MST defines duplication points in the ICN.
27. A method according to claim 25 or 26, wherein the SDN controller configures copy rules in the switches/nodes within the ICN.
28. A method according to claim 26 or 27, wherein the SDN controller sets the ETA for the current request to the minimum of ETA of the other requests in the selected MST ({ETAXJ in MST}).
29. A method according to one of claims 1 to 28, wherein a feedback notifies the SDN controller when the at least one NDO is sent from its content source.
30. A method according to one of claims 9 to 29, wherein an entry in the PRT is removed, once the at least one NDO has been delivered to the requestor.
31. An information-centric network, ICN, preferably for carrying out the method according to any one of claims 1 to 30, comprising at least one addressable named data object, NDO, and means for performing after an initial request a request aggregation of subsequent requests for the at least one NDO according to a definable rule,
c h a r a c t e r i z e d in that a software-defined networking, SDN, with a SDN controller is implemented in the ICN and that the SDN controller is configured for performing a network-wide request aggregation.
EP13774618.6A 2013-09-12 2013-09-12 A method for operating an information-centric network and network Active EP3044933B1 (en)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/EP2013/068919 WO2015036023A1 (en) 2013-09-12 2013-09-12 A method for operating an information-centric network and network

Publications (2)

Publication Number Publication Date
EP3044933A1 true EP3044933A1 (en) 2016-07-20
EP3044933B1 EP3044933B1 (en) 2019-01-09

Family

ID=49328499

Family Applications (1)

Application Number Title Priority Date Filing Date
EP13774618.6A Active EP3044933B1 (en) 2013-09-12 2013-09-12 A method for operating an information-centric network and network

Country Status (3)

Country Link
US (1) US10193816B2 (en)
EP (1) EP3044933B1 (en)
WO (1) WO2015036023A1 (en)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9781061B2 (en) * 2013-04-12 2017-10-03 Nec Corporation Method and system for providing an information centric network with a software defined network
US9854062B2 (en) * 2013-12-18 2017-12-26 Panasonic Intellectual Property Management Co., Ltd. Data relay apparatus and method, server apparatus, and data sending method
US10142220B2 (en) * 2014-04-29 2018-11-27 Hewlett Packard Enterprise Development Lp Efficient routing in software defined networks
US9806997B2 (en) 2015-06-16 2017-10-31 At&T Intellectual Property I, L.P. Service specific route selection in communication networks
WO2018113943A1 (en) * 2016-12-21 2018-06-28 Telefonaktiebolaget Lm Ericsson (Publ) First and second icn network nodes and method therein for generating data content
WO2022044235A1 (en) * 2020-08-27 2022-03-03 日本電信電話株式会社 Control device, control method, program, and communication system
US20220245470A1 (en) * 2021-02-03 2022-08-04 Asserts Inc. Automatically generating an application knowledge graph

Family Cites Families (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8516146B1 (en) 1999-11-24 2013-08-20 Robert C. Yen Method and system for reduction of delay and bandwidth requirements in internet data transfer
US7809848B1 (en) 2005-03-15 2010-10-05 Oracle America, Inc. System and method for aggregating NFS requests
JP5621778B2 (en) * 2009-09-25 2014-11-12 日本電気株式会社 Content-based switch system and content-based switch method
US8504718B2 (en) * 2010-04-28 2013-08-06 Futurewei Technologies, Inc. System and method for a context layer switch
US8488575B2 (en) 2010-11-18 2013-07-16 At&T Intellectual Property, I, L.P. Methods, devices, and computer program products for providing a plurality of application services via a customized private network connection
US9083484B2 (en) * 2012-02-13 2015-07-14 Ciena Corporation Software defined networking photonic routing systems and methods
US9049251B2 (en) * 2012-02-28 2015-06-02 Futurewei Technologies, Inc. Method and apparatus for internet protocol based content router
JP5919046B2 (en) * 2012-03-13 2016-05-18 株式会社日立製作所 Path calculation method
WO2013184941A1 (en) * 2012-06-06 2013-12-12 Huawei Technologies Co., Ltd. Method of seamless integration and independent evolution of information-centric networking via software defined networking
US8982734B2 (en) * 2012-06-26 2015-03-17 Intel Corporation Methods, apparatus, and systems for routing information flows in networks using spanning trees and network switching element resources
US9548874B2 (en) * 2012-12-07 2017-01-17 Verizon Patent And Licensing Inc. Selecting a content delivery network
US20150372911A1 (en) * 2013-01-31 2015-12-24 Hitachi, Ltd. Communication path management method
US9160650B2 (en) * 2013-06-17 2015-10-13 Futurewei Technologies, Inc. Enhanced flow entry table cache replacement in a software-defined networking switch
US9400811B2 (en) * 2013-07-05 2016-07-26 Juniper Networks, Inc. Systems and methods for increasing the scalability of software-defined networks
US9118571B2 (en) * 2013-07-08 2015-08-25 Telefonaktiebolaget L M Ericsson (Publ) Methods of operating load balancing switches and controllers using matching patterns with unrestricted characters
US9819643B2 (en) * 2014-10-13 2017-11-14 Telefonaktiebolaget L M Ericsson (Publ) CCN name patterns

Also Published As

Publication number Publication date
US10193816B2 (en) 2019-01-29
WO2015036023A1 (en) 2015-03-19
US20160226782A1 (en) 2016-08-04
EP3044933B1 (en) 2019-01-09

Similar Documents

Publication Publication Date Title
EP3044933B1 (en) A method for operating an information-centric network and network
US11134012B2 (en) Communication system, communication device, controller, and method and program for controlling forwarding path of packet flow
Egilmez et al. OpenQoS: An OpenFlow controller design for multimedia delivery with end-to-end Quality of Service over Software-Defined Networks
Melazzi et al. An openflow-based testbed for information centric networking
US20140019639A1 (en) Computer system and communication method
CN104468205B (en) The system administration that execution route is oriented to
US20130111063A1 (en) Routing method in content-centric network
US20160094439A1 (en) Method and apparatus for interface capability and elastic content response encoding in information centric networking
CN102792646A (en) Communication system, control device, communication method, and program
JP6544401B2 (en) PACKET TRANSFER DEVICE, CONTROL DEVICE, COMMUNICATION SYSTEM, COMMUNICATION METHOD, AND PROGRAM
JP6954295B2 (en) Communication systems, edge nodes, communication methods and programs
JP2013541235A (en) Control device, communication system, communication method, and recording medium for recording communication program
CN108989218B (en) A data forwarding device and method based on network fusion architecture
JP5725236B2 (en) Communication system, node, packet transfer method and program
EP2905932B1 (en) Method for multiple path packet routing
WO2015136928A1 (en) Flow control device, communication system, control method for flow control device, and program
JP6662195B2 (en) Intelligent routing in information-centric networking
US8798050B1 (en) Re-optimization of loosely routed P2MP-TE sub-trees
KR101524825B1 (en) Packet routing method, packet routing control apparatus and packet routing system in wireless mesh network
EP2940967B1 (en) Content-centric networking
CN105075198A (en) Control device, communication system, control information transmission method, and program
Lara et al. Inter-domain routing with cut-through switching for the mobilityfirst future Internet architecture
CA2858449A1 (en) A device for multipath routing of packets in computer networking and the method for its use
Lara et al. Cut-through switching options in a mobilityfirst network with openflow
Langrin et al. A Hybrid DTN/NDN Middleware Gateway Controller for UAV Applications

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20160212

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

AX Request for extension of the european patent

Extension state: BA ME

DAX Request for extension of the european patent (deleted)
RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: NEC LABORATORIES EUROPE GMBH

REG Reference to a national code

Ref country code: DE

Ref legal event code: R079

Ref document number: 602013049599

Country of ref document: DE

Free format text: PREVIOUS MAIN CLASS: H04L0029080000

Ipc: H04L0012240000

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: GRANT OF PATENT IS INTENDED

INTG Intention to grant announced

Effective date: 20180817

RIC1 Information provided on ipc code assigned before grant

Ipc: H04L 12/841 20130101ALI20180807BHEP

Ipc: H04L 29/06 20060101ALI20180807BHEP

Ipc: H04L 12/24 20060101AFI20180807BHEP

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE PATENT HAS BEEN GRANTED

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: NEC CORPORATION

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

Ref country code: AT

Ref legal event code: REF

Ref document number: 1088682

Country of ref document: AT

Kind code of ref document: T

Effective date: 20190115

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602013049599

Country of ref document: DE

REG Reference to a national code

Ref country code: NL

Ref legal event code: MP

Effective date: 20190109

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG4D

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190109

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 1088682

Country of ref document: AT

Kind code of ref document: T

Effective date: 20190109

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190109

Ref country code: PL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190109

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190109

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190109

Ref country code: NO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190409

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190509

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190109

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190410

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190409

Ref country code: RS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190109

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190509

Ref country code: HR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190109

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190109

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602013049599

Country of ref document: DE

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: AL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190109

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190109

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190109

Ref country code: IT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190109

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190109

Ref country code: RO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190109

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190109

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190109

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SM

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190109

26N No opposition filed

Effective date: 20191010

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190109

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: TR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190109

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MC

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190109

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190930

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190912

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190912

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190930

REG Reference to a national code

Ref country code: BE

Ref legal event code: MM

Effective date: 20190930

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: BE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190930

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 20190912

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190930

Ref country code: GB

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190912

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190109

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190109

Ref country code: HU

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT; INVALID AB INITIO

Effective date: 20130912

REG Reference to a national code

Ref country code: DE

Ref legal event code: R079

Ref document number: 602013049599

Country of ref document: DE

Free format text: PREVIOUS MAIN CLASS: H04L0012240000

Ipc: H04L0041000000

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190109

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20250919

Year of fee payment: 13

REG Reference to a national code

Ref country code: DE

Ref legal event code: R081

Ref document number: 602013049599

Country of ref document: DE

Owner name: NEC ASIA PACIFIC PTE LTD., SG

Free format text: FORMER OWNER: NEC CORP., TOKYO, JP