Networking 2011, Lecture Notes in Computer Science (6641)
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.
The flows are balanced to seek paths which minimise loss.
This paper creates software models of how P2P network topologies could wire up. It considers the possible strategies such as connecting to close nodes, connecting to random links and so on. Resilience and delay are considered.
This paper looks at the problem of sending data using a variation on Orthogonal Frequency Division Multiplexing. In this variant frequencies are packed slightly closer. This means the frequencies are no longer orthogonal but more may be packed into a given amount of spectrum.
IEEE Transactions on Computers, vol.62, no.6, pp.1207,1220
This paper considers the problems of placing management or monitoring nodes in a dynamic network. It trades off:
1) Selecting long-lived nodes
2) Selecting optimal nodes for traffic (close to the nodes they manage).