We measured size-resolved PNCs in the 5-560 nm range at two different types (4- and 3-way) of TIs in Guildford (Surrey, UK) at fixed sites (∼1.5 m above the road level), sequentially at 4 different heights (1, 1.5, 2.5 and 4.7 m), and along the road at five different distances (10, 20, 30, 45 and 60 m). The aims were to: (i) assess the differences in PNCs measured at studied TIs, (ii) identify ...

We show that the capacity of a complex network that models a city street grid to support congested traffic can be optimized by using routes that collectively minimize the maximum ratio of betweenness to capacity in any link. Networks with a heterogeneous distribution of link capacities and with a heterogeneous transport load are considered. We find that overall traffic congestion and average tr...

We show that the capacity of a complex network that models a city street grid to support congested traffic can be optimized by using routes that collectively minimize the maximum ratio of betweenness to capacity in any link. Networks with a heterogeneous distribution of link capacities and with a heterogeneous transport load are considered. We find that overall traffic congestion and average tr...

The congested clique model of distributed computing has been receiving attention as a model for densely connected distributed systems. While there has been significant progress on the side of upper bounds, we have very little in terms of lower bounds for the congested clique; indeed, it is now known that proving explicit congested clique lower bounds is as difficult as proving circuit lower bou...

Networking researchers work from mental models of the Internet’s important properties. The scenarios used in simulations and experiments (including our own) reveal aspects of these mental models, often including one or more of the following implicit assumptions: Flows live for a long time and transfer a lot of data. Simple topologies, like a “dumbbell” topology with one congested link, are suff...

A finite-buffered banyan network analysis technique designed to model networks at high traffic loads is presented. The technique specially models two states of the network queues: queue empty and queue congested (roughly, zero or one slots free). A congested queue tends to stay congested because packets bound for the queue accumulate in the previous stage. The expected duration of this state is...

A banyan network analysis technique is presented which more accurately models a congested network than other reported techniques. The analysis is based on the observation that a full queue (within the switching modules making up the network) causes traffic to back up. For a short time after becoming full the free space in the queue is limited to no more than one slot. A queue in such a conditio...

A banyan network analysis technique is presented which more accurately models a congested network than other reported techniques. The analysis is based on the observation that a full queue (within the switching modules making up the network) causes traac to back up. For a short time after becoming full the free space in the queue is limited to no more than one slot. A queue in such a condition ...