Name
Abstract | ||
|---|---|---|
An algorithm is proposed which can be used for the topology design of switched LAN with heavy traffic and multi-segments.
The main principle of the algorithm is to split the whole traffic to segments as even as possible. The algorithm consists
of binary division and ordinary division. When the number of segments equals to powers of 2, binary division is used; ordinary
division is based on binary division but suitable to more common cases. Both correctness and time complexity of the algorithm
are discussed in detail, and a comparison of the algorithm with the best result is given at the same time. |
Year | DOI | Venue |
|---|---|---|
1998 | null | Journal of Computer Science and Technology |
Keywords | Field | DocType |
null | Partition problem,Division algorithm,Network planning and design,Computer science,Correctness,Real-time computing,Topology design,Time complexity,Distributed computing,Binary number | Journal |
Volume | Issue | ISSN |
13 | 3 | null |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
5 | ||