System And Method For Joint Dynamic Forwarding And Caching In Content Distribution Networks

Patent metadata

Field	Value
Publication number	US-2025039277-A1
Application number	US-202418898619-A
Country	US
Kind code	A1
Filing date	Sep 26, 2024
Priority date	Sep 30, 2013
Publication date	Jan 30, 2025
Grant date	—

Abstract

A system and method for joint dynamic interest request forwarding and dynamic cache placement and eviction and provided within the context of the Named Data Networking (NDN) architecture. The system and method employ a virtual control plane that operates on the user demand rate for data objects in the network, and an actual plane that handles Interest Packets and Data Packets. Distributed algorithms within the virtual plane achieve network load balancing through dynamic forwarding and caching, thereby maximizing the user demand rate that the NDN network can satisfy. A method of congestion control is also provided to achieve optimal network fairness using the VIP framework.

First claim

What is claimed is:

1 . A computer-implemented method comprising:
in a computer network comprising a plurality of nodes and links between the nodes, and operable to transmit one or more interest packets associated with requested data objects and to transmit one or more data packets associated with the requested data objects, computer-executable instructions for:
generating a virtual interest packet (VIP) corresponding to each requested data object, each VIP comprising an identification of a data object;
maintaining a count of VIPs associated with a same requested data object at each node in the network, the VIP count variable over time at each node with demand for each requested data object;
determining incoming VIP transmission rates and outgoing VIP transmission rates at one or more nodes in the network;
transmitting the virtual interest packets to balance distribution of VIPs across the nodes of the network; and
satisfying demand for data objects by caching a portion of the data packets in transitory cache memory at one or more nodes to balance demand for the data packets across the network.

2 . The computer-implemented method of claim 1 , further comprising using a same VIP count for both transmitting the interest packets and caching the data packets.

3 . The computer-implemented method of claim 1 , further comprising maintaining a separate VIP queue for each data object, the VIP queue having a size equivalent to the VIP count for an associated data object.

4 . The computer-implemented method of claim 1 , further comprising updating the VIP count associated with each requested data object over a time slot.

5 . The computer-implemented method of claim 4 , wherein updating the VIP count includes:
subtracting an outgoing VIP transmission rate summed over neighbor nodes over the time slot from the VIP count at the beginning of the time slot; adding a number of incoming exogenous requests for the requested data object received during the time slot; adding an incoming VIP transmission rate summed over neighbor nodes received during the time slot; and if a data object is cached at a node at that time slot, subtracting a maximum rate in data objects per time slot at which copies of a data packet can be produced from transitory cache memory at the node.

6 . The computer-implemented method of claim 1 , further comprising incrementing the VIP count by 1 for each requested data object.

7 . The computer-implemented method of claim 1 , further comprising reducing the VIP count for a requested data object by a maximum rate at a node in an event a requested data object is stored in transitory cache memory, the maximum rate including a maximum rate in data objects per time slot at which copies of a data packet can be produced from transitory cache memory at the node.

8 . The computer-implemented method of claim 7 , wherein the data packet includes a data name, data content, and signature data.

9 . The computer-implemented method of claim 1 , wherein the computer network includes a named data network, a content-centric network, an information centric network, a content distribution network, a data center, a cloud computing architecture, or a peer-to-peer network.

Assignees

• Univ Northeastern
• California Inst Of Techn

Inventors

• Yeh Edmund Meng
• Cui Ying
• Liu Ran
• Ho Tracey
• Burd Michael
• Leong Derek

Classifications

• H04L45/02

  Topology update or discovery · CPC title

• H04L47/27

  Evaluation or update of window size, e.g. using information derived from acknowledged [ACK] packets · CPC title

• H04L67/568 Primary

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

• H04L45/64

  using an overlay routing layer · CPC title

• H04L45/586 Primary

  of virtual routers · CPC title