Topology Reconfiguration with Successive Approximations

Abstract

Topology control consists of computing new topologies to dynamically optimize the network under changing traffic conditions and then carrying out the reconfiguration process to achieve the target topology. This thesis considers the process of topology reconfiguration and use the packet drops that happen during this process as a cost metric for this process. It is shown that by implementing the topology reconfiguration as a series of smaller steps (successive approximation), the number of packets that are dropped during the reconfiguration are reduced. Using this knowledge, the topology computation algorithm can be refined to also minimize the reconfiguration cost along with the typical objective of minimizing congestion.

Exploration of doped quantum magnets with ultracold atoms

“…The parton picture was first proposed on phenomenological grounds by Béran et al [16] where it was already pointed out that the strong renormalization of doped holes can be understood by simple arguments from a parton ansatz. Several subsequent works, still on a phenomenological level, discussed the connection to observations in the lowdoping regime [131,12], including a paper by P. Anderson [4]. Unlike the polaron theory, the parton picture can be directly connected to the one-dimensional case where spinons and chargons are deconfined, whereas magnons no longer constitute well-defined excitations.…”

Molecular inspired models for prediction and control of directional FSO/RF wireless networks

“…Reconfigure topology: if there is a better topology or an essential link cannot be retained, the network topology should go into a reconfiguration phase to try to re-gain/improve connectivity. Low complexity algorithms for dynamic topology optimization have been developed [14][15][16][17].…”