Method and apparatus for reducing response time in information-centric networks

A device for reducing response times in an information-centric network, comprising:

• a non-transitory memory storage comprising instructions;
• and
• one or more processors in communication with the memory, wherein the one or more processors execute the instructions to:
• receive an indication from an ingress node of a content object entering a network, the content object associated with a new delivery flow through the network;
• identify an egress node in the network for the content object;
• identify a size of the content object;
• determine a backlog and bandwidth for the new delivery flow based in part on the size of the content object;
• determine backlogs and bandwidths for existing delivery flows in the network;
• determine a set of candidate paths in the network for the new delivery flow from the ingress node to the egress node;
• estimate a total response time for completion of all delivery flows for each candidate path based on the backlog and bandwidth;
• and
• select one of the candidate paths for the new delivery flow having a lowest total response time.

A non-transitory computer readable medium storing computer instructions for reducing response times in an information-centric network, that when executed by one or more processors, cause the one or more processors to perform the step of:

• receive an indication from an ingress node of a content object entering a network, the content object associated with a new delivery flow through the network;
• identify an egress node in the network for the content object;
• identify a size of the content object;
• determine a backlog and bandwidth for the new delivery flow based in part on the size of the content object;
• determine backlogs and bandwidths for existing delivery flows in the network;
• determine a set of candidate paths in the network for the new delivery flow from the ingress node to the egress node;
• estimate a total response time for completion of all delivery flows for each candidate path based on the backlog and bandwidth;
• and
• select one of the candidate paths for the new delivery flow having a lowest total response time.