Title :
On optimal routing trees
Author :
Du, D.Z. ; Hwang, F.K. ; Shing, M.T. ; Wittbold, J.T.
Author_Institution :
Math. Sci. Res. Inst., Berkeley, CA, USA
fDate :
10/1/1988 12:00:00 AM
Abstract :
The authors consider the problem of transforming a routing matrix to an optimal routing tree where the cost of a tree is the sum of the link costs. A routing tree is called alphabetical if the partition at each internal node is always into components of consecutive categories. The authors give a cubic algorithm for the optimal alphabetical routing tree problem. They also solve the optimal routing tree problem for some other special cases
Keywords :
information theory; switching theory; telecommunication networks; trees (mathematics); alphabetical routing; cubic algorithm; link costs; optimal routing trees; routeing matrix transformation; telecommunication networks; Circuits and systems; Cities and towns; Cost function; Partitioning algorithms; Polynomials; Routing; Size measurement; Subspace constraints; Switching systems; Telephony;
Journal_Title :
Circuits and Systems, IEEE Transactions on
