Abstract: A networking system comprising a plurality of content routers coupled to each other and to a plurality of providers and configured to route and cache content data, wherein the content routers are further configured to locate and route requested content to a user node coupled to the content routers, wherein the providers are configured to publish content and the content routers are further configured to receive and cache the content data in response to an interest request for content and to flood a content identifier for the content data to a plurality of neighboring content routers within a specified radius, wherein the content identifier enables the plurality of neighboring content routers to determine a nearest location from which to obtain the content data to enable efficient content routing.

Abstract: A networking system comprising a plurality of content routers coupled to each other and to a plurality of providers and configured to route and cache content data, wherein the content routers are further configured to locate and route requested content to a user node coupled to the content routers, wherein the providers are configured to publish content and the content routers are further configured to receive and cache the content data in response to an interest request for content and to flood a content identifier for the content data to a plurality of neighboring content routers within a specified radius, wherein the content identifier enables the plurality of neighboring content routers to determine a nearest location from which to obtain the content data to enable efficient content routing.

Abstract: A network device identifies a non-adaptive flow as follows. The network device drops packets on a random basis using a Random Early Detection (RED) algorithm. A classifier reads indicia of a flow from at least one field of a header of a packet received by the network device. The network device calculates a drop interval for packets of the flow dropped by the RED algorithm, in response to a time at which the packets were dropped. The network device then applies a statistical test to drop intervals of a plurality of flows in order to identify the non-adaptive flow.

Abstract: A Random Early Detection (RED) policer in accordance with the invention does not tail-drop arriving packets as being non-conforming. For instance, because the RED policer uses a running estimate such as an exponential weighted moving average (EWMA), for example, it allows the policer to absorb traffic bursts. The policer uses randomization in choosing which packets to drop; with this method, the probability of dropping a packet from a particular sending node is roughly proportional to the node's bandwidth share, hence the packets of different flows are fairly dropped.

Abstract: A network device identifies a non-adaptive flow as follows. The network device drops packets on a random basis using a Random Early Detection (RED) algorithm. A classifier reads indicia of a flow from at least one field of a header of a packet received by the network device. The network device calculates a drop interval for packets of the flow dropped by the RED algorithm, in response to a time at which the packets were dropped. The network device then applies a statistical test to drop intervals of a plurality of flows in order to identify the non-adaptive flow.

Abstract: A network device identifies a non-adaptive flow as follows. The network device drops packets on a random basis using a Random Early Detection (RED) algorithm. A classifier reads indicia of a selected flow from at least one field of a header of a packet received by the network device. The network device calculates a drop interval for packets of the selected flow dropped by the RED algorithm, in response to a time at which the packets were dropped. The network device then applies a statistical test to drop intervals of a plurality of flows in order to identify the non-adaptive flow.