Abstract | ||
---|---|---|
In a dual-ring bridged network, a bridge with RSTP algorithm may send packets to other bridges inefficiently. An RSTP algorithm has only one spanning tree for data communications. A redundant link in a dual-ring bridged network is wasteful and inefficient. Thus, we propose an algorithm that allocates two spanning trees to two separate rings of the dual-ring using PVST (Per VLAN Spanning Tree). After allocating two spanning trees to each bridge port, a layer 2 routing table is built by exchanging new BPDU messages with other bridges using two spanning trees. By using this routing table, bridges can forward data to the destination bridge with the shortest path. Because the proposed algorithm is compatible with existing RSTP algorithms, the proposed algorithm can be used for bridges in all Ethernet networks including Industrial Ethernet networks. It also can be used for smart grid automation network technology. We provide proof of the efficiency of the proposed algorithm via OPNET simulation results. |
Year | DOI | Venue |
---|---|---|
2012 | 10.1007/978-3-642-35585-1_6 | FGIT |
Keywords | Field | DocType |
data communication,industrial ethernet network,rstp algorithm,destination bridge,bridge port,efficient layer,dual-ring bridged network,smart grid automation network,bridges inefficiently,proposed algorithm,ethernet network | End-to-end delay,Computer science,Bridging (networking),Network packet,Computer network,Ethernet,Spanning tree,Routing table,Virtual LAN,Distributed computing,Spanning Tree Protocol | Conference |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
SeokJoon Hong | 1 | 37 | 3.71 |
Inwhee Joe | 2 | 299 | 46.56 |