Abstract | ||
---|---|---|
A pairwise switch-connection mechanism for interconnecting multiple token passing ring networks is proposed. The total number of internetwork packet store-and-forwards occurring at the bridges can be significantly reduced under the new switching method. A simple scheduling algorithm is developed to guarantee non-overlapped pairwise connection among the interconnected ring networks. Easy network access can be achieved through the use of different types of free tokens and local timers. Only simple table look-up operation is needed for the internetwork address translation. Therefore, the internetwork packets can be routed efficiently. Finally, simulation results are provided to show the fair network throughput under such switch-connection approach |
Year | DOI | Venue |
---|---|---|
1991 | 10.1109/LCN.1991.208107 | LCN |
Keywords | Field | DocType |
packet switching,pairwise connection,simulation results,scheduling,token networks,local timers,scheduling algorithm,table look-up operation,internetwork packet store-and-forwards,pairwise switch-connection mechanism,bridges,free tokens,multiple switch-connected token passing ring networks,table lookup,internet,network topology,ring network,switches,optical fibers | Token passing,Scheduling (computing),Computer science,Network packet,Computer network,Token ring,Network topology,Throughput,Packet switching,Token bus network,Distributed computing | Conference |
ISBN | Citations | PageRank |
0-8186-2370-5 | 0 | 0.34 |
References | Authors | |
4 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Jiunn-Hwa Yu | 1 | 13 | 1.62 |
Wen-Tsuen Chen | 2 | 1271 | 129.24 |