Publications:A class of Fiber-Ribbon Pipeline Ring networks for parallel and distributed computing systems
From CERES
| Title | A class of Fiber-Ribbon Pipeline Ring networks for parallel and distributed computing systems |
|---|---|
| Author | Magnus Jonsson and Carl Bergenhem |
| Year | 2001 |
| PublicationType | Conference Paper |
| Journal | |
| HostPublication | PDPTA'2001 : Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications |
| DOI | |
| Conference | International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 2001), Las Vegas, NV, June 25-28, 2001 |
| Diva url | http://hh.diva-portal.org/smash/record.jsf?searchId=1&pid=diva2:239981 |
| Abstract | In this paper, three ring networks made up of fiber-ribbon point-to-point links are presented. The first network is a control-channel based network in which one fiber in each link joins with others to form a control-channel ring. This ring improves performance of the network by sending medium access control information immediately before the data transmissions. High throughputs can be achieved in the network due to pipelining, i.e., several packets can be traveling through the network simultaneously but in different segments of the ring. Also, real-time demands can be met using slot reserving. The network, called CC-FPR (Control-Channel based Fiber-ribbon Pipeline Ring), can be built today using off-the-shelf fiber-optic components. The increasingly good price/performance ratio for fiber-ribbon links indicates a high potential for the success of the proposed kind of networks. The second network is similar to the first one except that it divides the network into two sub-networks, one for packet switched traffic and one for circuit -switched traffic. When the main data flow in the network does not change rapidly, this is a good choice of a simple but powerful network. In the third network, the medium access protocol of the first network is exchanged with a one with global deadline scheduling to support best-effort real-time traffic. |
