Name
Abstract | ||
|---|---|---|
This text focuses on the simulation and evaluation of Tree Building Control Protocol (TBCP) described in (1). The TBCP is distributed algorithm used for building a spanning tree over TBCP entities. In this paper, the main part of the TBCP algorithm called join procedure is explained and the state machine of the join procedure is presented. Then, the non-distributed Branch and Bound algorithm finding an optimal spanning tree is shown. Finally, the TBCP is simulated in OPNET Modeler and compared to the optimal spanning tree. |
Year | Venue | Keywords |
|---|---|---|
2002 | PDPTA | tree building control protocol,distributed algorithm,state machine,spanning tree,branch and bound algorithm |
Field | DocType | ISBN |
Mathematical optimization,Distributed minimum spanning tree,Computer science,Prim's algorithm,K-ary tree,Spanning tree,Segment tree,Kruskal's algorithm,Distributed computing,Interval tree,Minimum spanning tree | Conference | 1-892512-90-4 |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ondrej Dolejs | 1 | 0 | 0.34 |
| Zdenek Hanzalek | 2 | 9 | 1.60 |