3. A computer readable storage medium, tangibly embodying a program of instructions executable by the computer for accessing data objects in a named data network including a plurality of routers, the program of instructions, when executing, performing the following steps: receiving at a first one of the routers a named data object request identifying a first one of the data objects; receiving at the first one of the routers at least a portion of a named graph, wherein the named graph comprises data entities and/or structures comprising a plurality of named data objects and identifies associated data objects, wherein the associated data objects include the first data object, wherein the named graph specifies a node corresponding to each of the identified associated data objects, and wherein each node represents a location at one of the routers; retrieving by the first router the first data object; and retrieving by the first router, based at least in part upon the received named graph, at least one additional identified associated data object when the first data object is retrieved, said at least one additional associated data object is identified based on a strength of a relationship with the requested named data object.
3. A computer readable storage medium, tangibly embodying a program of instructions executable by the computer for accessing data objects in a named data network including a plurality of routers, the program of instructions, when executing, performing the following steps: receiving at a first one of the routers a named data object request identifying a first one of the data objects; receiving at the first one of the routers at least a portion of a named graph, wherein the named graph comprises data entities and/or structures comprising a plurality of named data objects and identifies associated data objects, wherein the associated data objects include the first data object, wherein the named graph specifies a node corresponding to each of the identified associated data objects, and wherein each node represents a location at one of the routers; retrieving by the first router the first data object; and retrieving by the first router, based at least in part upon the received named graph, at least one additional identified associated data object when the first data object is retrieved, said at least one additional associated data object is identified based on a strength of a relationship with the requested named data object. 5. The computer readable storage medium of claim 3 , wherein the program of instructions, when executing, further performs the step of making at least one routing decision by the first router based at least in part upon the received named graph.