$P$ and a set of lines $L$ such that each line contains exactly $s+1$ points and each point lies in exactly $s+1$ lines. The point graph of a GQ is strongly regular. We limit ourselves to classical GQs, which are closely related to orthogonal, symplectic and unitary groups.
In the first part of the talk we will discuss bounds for the independence
number of the point graphs of GQs. In the second part we will present some
results on the existence of intriguing sets, a natural generalization of
Delsartes cliques and Delsartes cocliques, in GQs. In the third part we will
present similar results for generalized hexagons and generalized octagons.
In this paper, we introduce Roundabout, a software support framework
for reconfigurable networks that reduces the amount of disruption to
existing flows during topology reconfiguration. This framework
deconstructs the planned topology changes (link additions and
removals) into a series of smaller steps where each step only affects
a small fraction of existing flows. It also proactively reroutes
before and after each step to avoid packet losses due to topology
reconfiguration and allow existing flows to take advantage of newly
added links. We evaluate our system through both simulations and
experiments on our prototype deployed on an emulated DCN. Our results
show that, under representative workloads, Roundable can perform
network reconfigurations that avoid network partitions and provide
sufficient bandwidth to satisfy bandwidth reservation requirements.