18. A computer system for facilitating fair scheduling of interests in a content centric network, the system comprising: a processor; and a storage device storing instructions that when executed by the processor cause the processor to perform a method, the method comprising: receiving an initial interest which indicates an allocation of a predetermined number of tokens based on a name prefix and a priority or a weight assigned to a transport stack; receiving a first interest which indicates a command to set a window size for the transport stack based on the name prefix, 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, and wherein a name prefix includes one or more contiguous name components; receiving a second interest with a name that includes the name prefix indicated in the first interest; in response to determining that the window size for the transport stack is sufficient, transmitting the second interest to a forwarder component associated with the transport stack; and in response to determining that the window size is not sufficient, refraining from transmitting the second interest, thereby facilitating scheduling of interests.
19. The computer system of claim 18 , wherein a respective token is used to forward the second interest with the name that includes the name prefix, wherein: transmitting the second interest to the forwarder component includes transmitting the second interest to the forwarder component in response to determining a sufficient number of tokens for the name prefix refraining from transmitting the second interest includes refraining from transmitting the second interest in response to determining an insufficient number of tokens for the name prefix, the method further comprising: decreasing the number of tokens for the name prefix in response to determining the sufficient number of tokens.