Protocol to query for historical network information in a content centric network

• US 10,038,633 B2
• Filed: 03/04/2016
• Issued: 07/31/2018
• Est. Priority Date: 03/04/2016
• Status: Expired due to Fees

• Current Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Original Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Inventors: Wood, Christopher A., Solis, Ignacio, Ioannou, Andriana, Scott, Glenn C.
• Primary Examiner(s): Chan, Wing F
• Assistant Examiner(s): KRISHNAN, RAJESHWARI
• Application Number:
  US15/061,979
• Publication Number:
  US 20170257314A1
• Time in Patent Office: 879 Days
• CPC Class Codes: G06F 15/167 using a common memory, e.g. mailbox
• CPC Class Codes: H04L 45/50 using label swapping, e.g. multi-protocol label switch [MPLS]
• CPC Class Codes: H04L 45/74 Address processing for routing
• CPC Class Codes: H04L 47/125 by balancing the load, e.g. traffic engineering
• CPC Class Codes: H04L 47/193 at the transport layer, e.g. TCP related
• CPC Class Codes: H04L 47/27 Evaluation or update of window size, e.g. using information derived from acknowledged [ACK] packets
• CPC Class Codes: H04L 47/283 in response to processing delays, e.g. caused by jitter or round trip time [RTT]
• CPC Class Codes: H04L 61/58 Caching of addresses or names
• CPC Class Codes: H04L 63/0823 using certificates cryptographic mechanisms or cryptographic arrangements for entity authentication involving certificates H04L9/3263
• CPC Class Codes: H04L 67/1097 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 Class Codes: H04L 67/568 Storing data temporarily at an intermediate stage, e.g. caching
• CPC Class Codes: H04L 69/02 Protocol performance
• CPC Class Codes: H04L 69/16 Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]

Abstract

One embodiment provides a system that facilitates querying of historical network information. During operation, the system generates a query for historical information associated with interest and content object packets, wherein a name for an interest is a hierarchically structured variable length identifier that includes contiguous name components ordered from a most general level to a most specific level, wherein the query is based on a name prefix that includes one or more contiguous name components. The system transmits the query to a responding entity. In response to receiving the historical information from the responding entity, the system performs an operation that increases network efficiency based on the historical information, thereby facilitating a protocol for querying the historical information to increase network efficiency.

Claims

1. A computer system for facilitating querying of historical network information, the system comprising:

a processor; and

a storage device storing instructions that when executed by the processor cause the processor to execute a method performed by a requesting entity of the computer system, the method comprising;

generating a query for historical information associated with interest packets and corresponding content object packets, wherein a name or a name prefix for an interest packet is a hierarchically structured variable length identifier (HSVLI) that includes contiguous name components ordered from a most general level to a most specific level,

wherein the generated query includes contiguous name components comprising a routable name prefix which includes one or more contiguous name components beginning from the most general level, a type for the query, and a random nonce;

transmitting the query to a responding entity; and

in response to receiving the historical information from the responding entity, performing an operation that increases network efficiency based on the historical information, thereby facilitating a protocol for querying the historical information to increase network efficiency,

wherein the operation is one or more of;

setting or changing a transmission window size, setting or changing a rate of transmission for re-transmitted interest packets, and setting or changing a rate of transmission for original interest packets, wherein an original interest packet is not a re-transmitted interest packet.

2. The computer system of claim 1, wherein the query further includes one or more of:

one or more parameters for the query;

a function for the query; and

a payload data.

3. The computer system of claim 1, wherein when the requesting entity and the responding entity are not associated with a same transport stack, the query is an interest packet that further includes:

a user identifier of the requesting entity; and

authentication information of the requesting entity.

4. The computer system of claim 1, wherein the requesting entity is a component of a stack of communication modules, wherein the responding entity is a local forwarder that services the stack, and wherein the query is a control message that further includes:

an identifier for the local forwarder; and

a component which is responsible for collecting and storing the historical information, wherein the component resides in the local forwarder.

5. The computer system of claim 1, wherein the query further includes a command to perform a function on the historical information, wherein the function includes one or more of:

computing an estimate of an average round trip time for an interest and a corresponding content object based on the name prefix, wherein a round trip time begins when an interest packet is transmitted and ends when a corresponding content object packet is received, or begins when an interest packet is received and ends when a corresponding content object packet is transmitted, wherein the estimate is based on a plurality of average round trip times for a corresponding plurality of related namespaces that share at least one name prefix; and

computing an estimate of a size of a transmission window based on a number of outstanding interest packets for the name prefix for a predetermined period of time,

wherein performing a function is based on one or more interests as input, wherein an output for the function is a variable which can be stored by the system, and wherein the function is defined by the system or a user of the system.

6. The computer system of claim 1, wherein the requesting entity is one of:

an application associated with a first stack, wherein the responding entity resides in or is associated with the first stack;

an application associated with a second stack that is different from the first stack;

a stack component of the first stack, wherein the stack component is different from the responding entity;

a stack component of the second stack; and

any other element or node in the network.

7. The computer system of claim 1, wherein the responding entity resides in one of:

an application;

a single stack of a transport framework;

a shared stack of the transport framework;

a single forwarder;

a shared forwarder; and

any node in a network.

8. The computer system of claim 1, wherein the historical information associated with the packets is one or more of:

a round trip time that begins when an outgoing interest packet is transmitted and ends when a corresponding incoming content object packet is received;

a number of outgoing interest packets for which a corresponding incoming content object packet has not been received;

a number of outgoing interest packets for which a corresponding incoming content object packet is received based on a predetermined amount of time or the round trip time;

a number of bytes correctly retrieved based on the predetermined amount of time or the round trip time;

a number of outgoing interest packets that time out based on the predetermined amount of time or the round trip time;

a number of outgoing interest packets which are retransmitted based on the predetermined amount of time or the round trip time;

a number of re-transmitted outgoing interest packets that time out based on the predetermined amount of time or the round trip time;

a number of interest return messages received based on the predetermined amount of time or the round trip time, wherein an interest return message is received in response to an outgoing interest packet and is identified based on a code indicated in the message;

a number of outgoing interest packets aggregated based on the predetermined amount of time or the round trip time;

a number of active upstream paths identified for a given time;

a strategy for forwarding packets;

a first number of transmitted original interest packets, wherein an original interest packet is not a re-transmitted interest packet, and wherein the first number of original interest packets include names that share one or more name prefixes;

a second number of transmitted original interest packets, wherein the second number of original interest packets include names that do not share any name prefixes;

a first number of active entries in a forwarding information base, wherein the first number of entries include names that share one or more name prefixes; and

a second number of active entries in a forwarding information base, wherein the second number of entries include names that do not share any name prefixes.

9. The computer system of claim 1, wherein the historical information associated with the packets is one or more of:

a round trip time that begins when an incoming interest packet is received and ends when a corresponding incoming content object packet is transmitted;

a number of incoming interest packets for which a corresponding outgoing content object packet has not been transmitted;

a number of incoming interest packets for which a corresponding outgoing content object packet is transmitted based on a predetermined amount of time or the round trip time;

a number of bytes correctly retrieved based on the predetermined amount of time or the round trip time;

a number of incoming interest packets that time out based on the predetermined amount of time or the round trip time;

a number of re-transmitted incoming interest packets based on the predetermined amount of time or the round trip time;

a number of re-transmitted incoming interest packets that time out based on the predetermined amount of time or the round trip time;

a number of interest return messages transmitted based on the predetermined amount of time or the round trip time, wherein an interest return message is transmitted in response to an incoming interest packet and is identified based on a code indicated in the message; and

a number of incoming interest packets aggregated based on a predetermined amount of time or a round trip time.

17. The computer system of claim 1, wherein the historical information associated with the packets is one or more of:

a round trip time that begins when an outgoing interest packet is transmitted and ends when a corresponding incoming content object packet is received;

a number of outgoing interest packets for which a corresponding incoming content object packet has not been received;

a number of outgoing interest packets for which a corresponding incoming content object packet is received based on a predetermined amount of time or the round trip time;

a number of bytes correctly retrieved based on the predetermined amount of time or the round trip time;

a number of outgoing interest packets that time out based on the predetermined amount of time or the round trip time;

a number of outgoing interest packets which are retransmitted based on the predetermined amount of time or the round trip time;

a number of re-transmitted outgoing interest packets that time out based on the predetermined amount of time or the round trip time;

a number of interest return messages received based on the predetermined amount of time or the round trip time, wherein an interest return message is received in response to an outgoing interest packet and is identified based on a code indicated in the message;

a number of outgoing interest packets aggregated based on the predetermined amount of time or the round trip time;

a number of active upstream paths identified for a given time;

a strategy for forwarding packets;

a first number of transmitted original interest packets, wherein an original interest packet is not a re-transmitted interest packet, and wherein the first number of original interest packets include names that share one or more name prefixes;

a second number of transmitted original interest packets, wherein the second number of original interest packets include names that do not share any name prefixes;

a first number of active entries in a forwarding information base, wherein the first number of entries include names that share one or more name prefixes; and

a second number of active entries in a forwarding information base, wherein the second number of entries include names that do not share any name prefixes.

18. The computer system of claim 1, wherein the historical information associated with the packets is one or more of:

a round trip time that begins when an incoming interest packet is received and ends when a corresponding incoming content object packet is transmitted;

a number of incoming interest packets for which a corresponding outgoing content object packet has not been transmitted;

a number of incoming interest packets for which a corresponding outgoing content object packet is transmitted based on a predetermined amount of time or the round trip time;

a number of bytes correctly retrieved based on the predetermined amount of time or the round trip time;

a number of incoming interest packets that time out based on the predetermined amount of time or the round trip time;

a number of re-transmitted incoming interest packets based on the predetermined amount of time or the round trip time;

a number of re-transmitted incoming interest packets that time out based on the predetermined amount of time or the round trip time;

a number of interest return messages transmitted based on the predetermined amount of time or the round trip time, wherein an interest return message is transmitted in response to an incoming interest packet and is identified based on a code indicated in the message; and

a number of incoming interest packets aggregated based on a predetermined amount of time or a round trip time.

10. A computer system for facilitating querying of historical network information, the system comprising:

a processor; and

a storage device storing instructions that when executed by the processor cause the processor to execute a method performed by a responding entity of the computer system, the method comprising;

receiving a query from a requesting entity for historical information associated with interest packets and corresponding content object packets, wherein a name or a name prefix for an interest packet is a hierarchically structured variable length identifier (HSVLI) that includes contiguous name components ordered from a most general level to a most specific level,

wherein the generated query includes contiguous name components comprising a routable name prefix, a type for the query, and a random nonce;

in response to authenticating the requesting entity, transmitting the queried historical information, which causes the requesting entity to perform an operation to increase network efficiency based on the historical information, thereby facilitating a protocol for querying the historical information to increase network efficiency,

wherein the operation is one or more of;

setting or changing a transmission window size, setting or changing a rate of transmission for re-transmitted interest packets, and setting or changing a rate of transmission for original interest packets, wherein an original interest packet is not a re-transmitted interest packet.

11. The computer system of claim 10, wherein the query further includes one or more of:

one or more parameters for the query;

a function for the query; and

a payload data.

12. The computer system of claim 10, wherein when the requesting entity and the responding entity are not associated with a same transport stack, the query is an interest packet that further includes:

a user identifier of the requesting entity; and

authentication information of the requesting entity.

13. The computer system of claim 10, wherein the responding entity is a local forwarder that services a stack of communication modules, wherein the requesting entity is a component of the same stack of communication modules, and wherein the query is a control message that further includes:

an identifier for the local forwarder; and

a component which is responsible for collecting and storing the historical information, wherein the component resides in the local forwarder.

14. The computer system of claim 10, wherein the query further includes a command to perform a function on the historical information, wherein the function includes one or more of:

computing an estimate of an average round trip time for an interest and a corresponding content object based on the name prefix, wherein a round trip time begins when an interest packet is transmitted and ends when a corresponding content object packet is received, or begins when an interest packet is received and ends when a corresponding content object packet is transmitted, wherein the estimate is based on a plurality of average round trip times for a corresponding plurality of related namespaces that share at least one name prefix; and

computing an estimate of a size of a transmission window based on a number of outstanding interest packets for the name prefix for a predetermined period of time

wherein performing a function is based on one or more interests as input, wherein an output for the function is a variable which can be stored by the system, and wherein the function is defined by the system or a user of the system.

15. The computer system of claim 10, wherein the requesting entity is one of:

an application associated with a first stack, wherein the responding entity resides in or is associated with the first stack;

an application associated with a second stack that is different from the first stack;

a stack component of the first stack, wherein the stack component is different from the responding entity;

a stack component of the second stack; and

any other element or node in the network.

16. The computer system of claim 10, wherein the responding entity resides in one of:

an application;

a single stack of a transport framework;

a shared stack of the transport framework;

a single forwarder;

a shared forwarder; and

any node in a network.