Traffic pattern for a multicomputer graph computation

[rdviii]

Define a traffic pattern and expected execution schedule (including switching and network traffic) for a large, error-corrected computation on a quantum multicomputer.

Application: some graph problem application; most likely, Sara's clique finding.

First task is to select this target, second task will be to define complete execution schedule.

[Naphann]

This is partially done with #460. Depending on the exact behaviour of traffic targets. It might already be enough.