Network node, endpoint node and method of receiving an interest message

US10715592B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-10715592-B2
Application numberUS-201716099679-A
CountryUS
Kind codeB2
Filing dateMay 12, 2017
Priority dateMay 13, 2016
Publication dateJul 14, 2020
Grant dateJul 14, 2020

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

The invention relates to a network node ( 15 ) comprising at least one communication interface, at least one memory, and at least one processor. The at least one processor is configured to receive an interest message on the at least one communication interface from a downstream node ( 14 ), the interest message comprising a name of a requested data object, to determine whether to bid for storing the requested data object in the at least one memory, to calculate a bid value, to forward the interest message to an upstream node ( 16 ) on the at least one communication interface, the interest message including the calculated bid value in dependence on at least the determination whether to bid, to receive a data message comprising the requested data object from the upstream node on the at least one communication interface, to determine from at least the data message whether the network node won the bid, to store the data object in the at least one memory if the network node won the bid, and to forward the data message to the downstream node on the at least one communication interface.

First claim

Opening claim text (preview).

The invention claimed is: 1. A network node, comprising: at least one communication interface; at least one memory; and at least one processor, configured to: receive an interest message on said at least one communication interface from a downstream node, said interest message comprising a name of a requested data object; determine whether to bid for storing said requested data object in said at least one memory; calculate a bid value; forward said interest message to an upstream node on said at least one communication interface, said interest message including said calculated bid value in dependence on at least said determination whether to bid; receive a data message comprising said requested data object from said upstream node on said at least one communication interface; determine from at least said data message whether said network node won said bid; store said data object in said at least one memory if said network node won said bid; and forward said data message to said downstream node on said at least one communication interface. 2. The network node of claim 1 , wherein said received interest message further comprises a received bid value and said at least one processor is further configured to: include said calculated bid value in said interest message if said determination whether to bid was positive and said calculated bid value represents a higher bid than said received bid value. 3. The network node of claim 1 , wherein said at least one processor is further configured to: record bidding information in said at least one memory, said bidding information representing whether said network node included said calculated bid value in said interest message. 4. The network node of claim 3 , wherein said at least one processor is further configured to: determine from at least said data message and said bidding information whether said network node won said bid. 5. The network node of claim 4 , wherein said received data message comprises an ignore counter, said ignore counter representing an amount of downstream nodes that lost said bid as determined by said upstream node or a further upstream node, and wherein said at least one processor is further configured to: determine from at least said ignore counter and said bidding information whether said network node won said bid. 6. The network node of claim 5 , wherein said at least one processor is further configured to: increment a node counter in said interest message before forwarding said interest message to said upstream node, said node counter representing an amount of downstream nodes. 7. The network node of claim 6 , wherein said at least one processor is further configured to: record a losing bidder count in said at least one memory if said network node included said calculated bid value in said interest message, said losing bidder count being based on said node counter included in said received interest message and representing an amount of downstream nodes that lost said bid as determined by said network node. 8. The network node of claim 7 , wherein said at least one processor is further configured to: set said ignore counter in said data message based on said losing bidder count before forwarding said data message to said downstream node if said network node won said bid. 9. The network node of claim 1 , wherein said at least one processor is further configured to: determine whether to bid for storing said requested data object in said at least one memory by checking whether at least one empty slot is available on said at least one memory and/or whether a least recently cached item is older than a certain age threshold. 10. The network node of claim 1 , wherein said at least one processor is further configured to: determine whether to bid for storing said requested data object in said at least one memory by checking whether said calculated bid value represents a bid which exceeds a certain auction threshold. 11. An endpoint node, comprising: at least one communication interface; and at least one processor configured to: determine a name of a requested data object; create an interest message comprising said name of said requested data object and a bid field for inserting a bid value, said bid value being left undefined so as to indicate that an auction of a right to cache said requested data object should start; and transmit said interest message to an upstream node on said at least one communication interface. 12. A method of receiving an interest message, the method comprising: receiving an interest message on at least one communication interface from a downstream node, said interest message comprising a name of a requested data object; determining whether to bid for storing said requested data object in at least one memory; calculating a bid value; forwarding said interest message to an upstream node on said at least one communication interface, said interest message including said calculated bid value in dependence on at least said determination whether to bid; receiving a data message comprising said requested data object from said upstream node on said at least one communication interface; determining from at least said data message whether a network node won said bid; storing said data object in said at least one memory if said network node won said bid; and forwarding said data message to said downstream node on said at least one communication interface. 13. A non-transitory computer medium having stored thereon one or more computer programs comprising at least one software code portion that, when run on a computer system, causes the computer system to perform the method of claim 12 . 14. A network node, comprising: at least one communication interface; at least one memory; and at least one processor configured to: receive an HTTP request for a data object on said at least one communication interface from a downstream node; determine whether to bid for storing said requested data object in said at least one memory; calculate a bid value; forward said HTTP request to an upstream node on said at least one communication interface, said HTTP request including said calculated bid value in dependence on at least said determination whether to bid; receive a response message comprising said requested data object from said upstream node on said at least one communication interface determine from at least said response message whether said network node won said bid; store said data object in said at least one memory if said network node won said bid; and forward said response message to said downstream node on said at least one communication interface. 15. A method of receiving an HTTP request, the method comprising: receiving said HTTP request for a data object on at least one communication interface from a downstream node; determining whether to bid for storing said requested data object in at least one memory; calculating a bid value; forwarding said HTTP request to an upstream node on said at least one communication interface, said HTTP request including said calculated bid value in dependence on at least said determination whether to bid; receiving a response message comprising said requested data object from said upstream node on said at least one communication interface; determining from at least said response message whether a network node won said bid; storing said data object in said at least one memory if said network node won said bid; and forwarding said response message to said downstream node on said at least one communication interface.

Assignees

Inventors

Classifications

  • Routing a service request depending on the request content or context · CPC title

  • Policies or rules for updating, deleting or replacing the stored data · CPC title

  • H04L67/02Primary

    based on web technology, e.g. hypertext transfer protocol [HTTP] · CPC title

  • Storing data temporarily at an intermediate stage, e.g. caching · CPC title

  • for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS] · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US10715592B2 cover?
The invention relates to a network node ( 15 ) comprising at least one communication interface, at least one memory, and at least one processor. The at least one processor is configured to receive an interest message on the at least one communication interface from a downstream node ( 14 ), the interest message comprising a name of a requested data object, to determine whether to bid for storin…
Who is the assignee on this patent?
Koninklijke Kpn Nv, Nederlandse Organisatie Voor Toegepast Natuurweten Schappelijk Onderzoek Tno, TNO
What technology area does this patent fall under?
Primary CPC classification H04L67/5682. Mapped technology areas include Electricity.
When was this patent published?
Publication date Tue Jul 14 2020 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 1 related publication on this page (citations in our corpus or others sharing the same primary CPC).