Efficient Broadcast in an Arrangement Graph Using Multiple Spanning Trees
碩士 === 中華大學 === 電機工程研究所 === 86 === The arrangement graph An,k is a generalization of star graph (n-k=1) and more flexible than the star graph. In this thesis, we consider the broadcast problems in one-port/multi-port arrangement graphs using packet-switching (or store-and-forward) technique. Our p...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
1998
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/08959483276492811890 |