Boundary S-matrix for the Tricritical Ising Model

The Tricritical Ising model perturbed by the subleading energy operator \Phi_(3/5) was known to be an Integrable Scattering Theory of massive kinks and in fact preserves supersymmetry. We consider here the model defined on the half-plane with a boundary and computed the associated factorizable boundary S-matrix. The conformal boundary conditions of this model were identified and the corresponding S-matrices were found. We also show how some of these S-matrices can be perturbed and generate ``flows'' between different boundary conditions.Comment: 30 pages, 14 figure

Along & Across algorithm for routing events and queries in wireless sensor networks

published_or_final_versio

Epigenetic silencing of tumor suppressor <i>miR-3151</i> contributes to Chinese chronic lymphocytic leukemia by constitutive activation of MADD/ERK and PIK3R2/AKT signaling pathways

published_or_final_versio

Traffic distribution over equal-cost-multi-paths

To effectively manage the traffic distribution inside a network, traffic splitting is needed for load sharing over a set of equal-cost-multi-paths (ECMPs). In this paper, a new traffic splitting algorithm, called Table-based Hashing with Reassignments (THR), is proposed. Based on the load sharing statistics collected, THR selectively reassigns some active flows from the over-utilized paths to under-utilized paths. The reassignment process takes place in such a way that the packet out-of-order problem is minimized. As compared with the existing traffic splitting algorithms, THR provides close-to-optimal load balancing performance, less than 2% of packets arrived out-of-order, and a very small end-to-end packet delay performance. Although additional traffic monitoring function is needed by THR, we show that the extra complexity incurred is marginal.published_or_final_versio

Time-efficient algorithms for BGP route configuration

Based on the concept of most popular prefix first, two efficient algorithms for BGP route configuration are proposed. The first algorithm MPPF_SES is designed for solving the single egress selection (SES) problem, and the second algorithm MPPF_MES is for multiple egress selection (MES). MPPF_MES has two variants, one aims at minimizing the total amount of resources consumed for carrying the transit traffic, and the other tries to minimize the egress link capacity required. Compared with the existing algorithms, a comparable performance in terms of network resources consumed can be obtained. In case of SES, our MPPF_SES can carry a given traffic load with much lower egress link capacity requirement. In case of MES, our MPPF_MES tends to provide a more stable performance. Last but not the least, our proposed algorithms have a much lower time complexity than the existing approach.published_or_final_versio