This paper describes a system for middleboxes that process application level data -- that is reconstructed TCP flows not packets. The system consists of three parts:
1) A language specific to middleboxes that can quickly express data formats and how to process them but in a "safe" way that allows middleboxes to co-exist on the same physical hardware.
2) An abstraction, the task graph, that breaks middlebox logic into small, parallelisable logical units (tasks) connected by channels through which data flows.
3) A system that allows the compiled code to execute in a performant way.

This paper looks at a model of reducing peak-rate load by incentivising users
to move from peak rate slots to off-peak time periods. It has its roots in
their HotNets 2008 paper “Good things come to those who (can) wait”.
(Users are granted bandwidth in the off-peak for good behaviour in the on-peak.)

This paper looks at CDN networks and, in particular, suggests
Provider-aided Distance Information System (PaDIS), which is a mechanism
to rank client-host pairs based upon information such as RTT,
bandwidth or number of hops. Headline figure, 70% of http traffic
from a major european ISP can be accessed via multiple different
locations. “Hyper giants” are defined as the large content providers
such as google, yahoo and CDN providers which effectively build
their own network and have content in multiple places.

This paper looks at time-dependent pricing schemes. A day is
split into 48 half hour periods indexed by
an integer. The system is known as TUBE (Time-dependent Usage-based
Broadband-price Engineering).
They use a control loop to adapt the prices ISPs charge users
in response to changing behaviour.

This paper considers the problem of balancing traffic across network egresses. It achieves a workable solution using a scalable packet market scheme which couples end-hosts controlling their own connection with an overall controller which can select routes appropriately for each flow.