|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| A.E. Kamal, "An Algorithm for the Efficient Utilization of Bandwidth in the Slotted Ring," IEEE Transactions on Computers, vol. 41, no. 12, pp. 1620-1627, December, 1992. | |||
| BibTex | x | ||
| @article{ 10.1109/12.214673, author = {A.E. Kamal}, title = {An Algorithm for the Efficient Utilization of Bandwidth in the Slotted Ring}, journal ={IEEE Transactions on Computers}, volume = {41}, number = {12}, issn = {0018-9340}, year = {1992}, pages = {1620-1627}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.214673}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - An Algorithm for the Efficient Utilization of Bandwidth in the Slotted Ring IS - 12 SN - 0018-9340 SP1620 EP1627 EPD - 1620-1627 A1 - A.E. Kamal, PY - 1992 KW - bandwidth utilization; source identification; slotted ring local area network; message sizes; medium access protocol; destination stations; message transmission; station latencies; station identification; performance; local area networks; performance evaluation; protocols. VL - 41 JA - IEEE Transactions on Computers ER - | |||
The slotted ring local area network is very efficient under light load, but suffers from severe performance degradations as the load increases, especially if message sizes are highly variable. An algorithm is presented, in the form of a medium access protocol, to allow for the efficient utilization of the bandwidth of the slotted ring. The protocol is based on the release of slots by destination stations of every slot, except for the first and last slots of a message transmission. This means that station latencies do not have to be increased. As a direct consequence of this property, the source and station identification do not have to be included in every slot, therefore reducing the message overhead. The algorithm results in an improved performance over the entire workload range, and under most workload conditions, therefore illustrating how far the performance of the slotted ring can go.
[1] W. Bux, "Local-area subnetworks: A performance comparison,"IEEE Trans. Commun., Oct. 1981.
[2] W. M. Loucks, V. C. Hamacher, B. R. Preiss, and L. Wong, "Short packet transfer performance in local area ring networks,"IEEE Trans. Comput., vol. C-34, no. 11, pp. 1006-1014, Nov. 1985.
[3] M. V. Wilkes and D. J. Wheeler, "The Cambridge Digital Communication Ring," inProc. Local Area Commun. Network Symp., Boston, MA, May 1979.
[4] A. Hopper and R. M. Needham, "The Cambridge Fast Ring Networking System,"IEEE Trans. Comput., vol. C-37, no. 10, pp. 1214-1223, Oct. 1988.
[5] A. E. Kamal and V. C. Hamacher, "Utilizing bandwidth sharing in the slotted ring,"IEEE Trans. Comput., vol. 39, no. 3, pp. 289-299, Mar. 1990.
[6] J. R. Pierce, "Network for block switching of data,"Bell Syst. Tech. J., vol. 51, no. 6, pp. 1133-1145, July/Aug. 1972.
[7] R. M. Falconer and J. L. Adams, "Orwell: A protocol for an integrated services local network,"British Telecom. Technology J., vol. 3, pp. 27-35, 1985.
[8] F. E. Ross, "FDDI-A tutorial,"IEEE Commun. Mag., vol. 24, no. 5, pp. 10-17, May 1986.
[9] P. Zafiropulo, "On LAN's and MANS: An evolution from Mbit/s to Gbit/s," Tech. Rep. RZ 1968 (#69550), IBM Research Division.
[10] A. E. Kamal, "On the use of multiple tokens on ring networks," inProc. IEEE INFOCOM 90, San Francisco, CA, June 1990, pp. 15-22.