Chord routing algorithm based on limited multicasting
Chord is a successful routing algorithm,but the inconsistence between logistic routing and physical routing leads to a very big network delay if the node routing only relies on logistic distance and this will seriously affect the routing efficiency.A Chord routing algorithm based on limited network layer multicasting was proposed,which used multicast technology to obtain physical neighbor nodes and improved on original Chord routing algorithm.It can shorten network search delay greatly,reduce routing hops effectively and improve the performance of routing.
We give a brief introduction to the study of the algebraic structures -- and their geometrical interpretations -- which arise in the BRST construction of a conformal string background. Starting from the chiral algebra $\cA$ of a string background, we consider a number of elementary but universal operations on the chiral algebra. From these operations we deduce a certain fundamental odd Poisson structure, known as a Gerstenhaber algebra, on the BRST cohomology of $\cA$. For the 2D string background, the correponding G-algebra can be partially described in term of a geometrical G-algebra of the affine plane $\bC^2$. This paper will appear in the proceedings of {\it Strings 95}.