This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Integrated Approach to Distributed Demand Assignment in Multiple-Bus Local Networks
May 1989 (vol. 38 no. 5)
pp. 679-695
Multiple-bus local networks (MBLNs) provide an architecturally simple solution to serve high-reliability high-capacity local area networks applications. Access mechanisms for MBLNs possessing stability and favorable delay characteristics are developed. A technique is proposed that uses a single explicit token to achieve demand-assignment multiple access (DAMA) to arbitrate access on all buses i

[1] W. R. Franta and J. R. Heath, "A simple model of hyperchannel local network channel selection procedure in multi-channel networks," TR, Univ. Minnesota, 1982.
[2] M. A. Marsan, D. Roffinella, and A. Murru, "ALOHA and CSMA protocols for multichannel broadcast networks," presented at Canadian Commun. Energy Conf., Montreal, P.Q., Canada, Oct. 1982.
[3] O. Spaniol,Multifrequency ALOHA-type Systems, Informatik-Fachberichte. Berlin, Germany: Springer-Verlag, 1976, pp. 277- 295.
[4] W. Szpankowski, "Packet switching in multiple radio channels: Analysis and stability of a random access system,"Comput. Networks, vol. 7, pp. 17-26.
[5] M. A. Marsan, "Multichannel local area networks," inProc. COMPCON, Sept. 1982.
[6] M. A. Marsan and D. Roffinella, "Multichannel local area network protocols,"IEEE J. Select. Areas Commun., vol. SAC-1, pp. 885- 897, Nov. 1983.
[7] T. D. Todd, "Performance of capacity allocation in multiple access networks," Ph.D. dissertation, Univ. of Waterloo, Waterloo, Ont., Canada, 1984.
[8] H. K. Tijms,Stochastic Modelling and Analysis. New York: Wiley, 1986.
[9] O. Spaniol, "Analysis and performance evaluation of hyperchannel access protocols,"Perform. Eval., pp. 170-179, 1981.
[10] W. C. Hohn, "The control data loosely coupled network lower level protocols," inProc. NCC, May 1980, pp. 129-134.
[11] W. Bux, "Local-area subnetworks: A performance comparison,"IEEE Trans. Commun., Oct. 1981.
[12] F. Tobagi and V. B. Hunt, "Performance analysis of carrier sense multiple access with collision detection,"Comput. Networks, vol. 4, Oct./Nov. 1980.
[13] T. Vo Dai, "Throughput-delay analysis of non slotted and non persistent CSMA-CD protocol," inProc. IFIP-TC-6 Int. Symp. Local Comput. Networks, Florence, Italy, Apr. 1982.
[14] M. Fine and F. A. Tobagi, "Demand assignment multiple access schemes in broadcast bus local area networks,"IEEE Trans. Comput., vol. C-33, Dec. 1984.
[15] K. S. Trivedi,Probability and Statistics with Reliability, Queueing and Computer Science Applications. Englewood Cliffs, NJ: Prentice-Hall, 1982.
[16] R. J. T. Morris and Y. T. Wang, "Some results for multiqueue systems with multiple cyclic servers,"Perform. Computer-Communication Systems. Amsterdam, The Netherlands. Elsevier Science Publishers B. V., North Holland, IFIP, 1984, pp. 245-258.
[17] Y. T. Wang and R. J. T. Morris, "Load sharing in distributed systems,"IEEE Trans. Comput., vol. C-34, Mar. 1985.
[18] V. V. Karmarkar, "Performance enhanced multiple-bus local network systems," Ph.D. dissertation, Univ. of Iowa, 1987.
[19] I. Rubin and L. F. M. DeMoraes, "Message delay analysis for polling and token multiple-access schemes for local computer networks,"IEEE J. Select. Areas Commun., vol. SAC-1, pp. 935-947, Nov. 1983.
[20] P. M. Gopal and J. W. Wong, "Analysis of a hybrid token-CSMA/CD protocol for bus networks,"Comput. Networks, vol. 9, pp. 131-141, Feb. 1985.
[21] T. Nute, "HCSMA-A nearly conflict-free hybrid CSMA protocol with high utilization," inProc. IEEE Comput. Networking Symp., Dec. 1984, pp. 75-84.
[22] C. H. Sauer and E. A. MacNair,Simulation of Computer Communication Systems. Englewood Cliffs, NJ: Prentice-Hall, 1983.
[23] W. R. Franta and I. Chlamtac,Local Networks. Lexington, MA: Lexington, 1981.
[24] R. Cherukuriet al., "Evaluation of token passing schemes in local area networks," inProc. IEEE Comput. Networking Symp., Dec. 1982, pp. 57-68.
[25] A. Konheim and B. Meister, "Waiting lines and times in a system with polling,"J. ACM, vol. 21, pp. 470-490, July 1974.
[26] H. Kobayashi and A. G. Konheim, "Queueing models for computer communications system analysis,"IEEE Trans. Commun., vol. COM-25, pp. 2-29, 1977.
[27] H. Takagi,Analysis of Polling Systems. Cambridge, MA: MIT Press, 1986.
[28] L. F. M. de Moraes and I. Rubin, "Analysis and comparison of message queueing delays in token-rings and token-buses local area networks," inProc. IEEE Int. Conf. Commun., May 1984, pp. 130-135.
[29] S. M. Ross,Introduction to Probability Models. New York: Academic, 1985.
[30] IEEE Draft Std. 802.4-1985, "Token passing bus access method and physical layer specification," IEEE Computer Society and ANSI, 1985.

Index Terms:
access mechanisms; distributed demand assignment; multiple-bus local networks; high-reliability high-capacity local area networks applications; MBLNs; stability; delay characteristics; token; demand-assignment multiple access; DAMA; buses; performance; hybrid; carrier-sense multiple access with collision detection; CSMA-CD; hybrid algorithm; colliding messages; token-passing; local area networks; token networks.
Citation:
V.V. Karmarkar, J.G. Kuhl, "An Integrated Approach to Distributed Demand Assignment in Multiple-Bus Local Networks," IEEE Transactions on Computers, vol. 38, no. 5, pp. 679-695, May 1989, doi:10.1109/12.24270
Usage of this product signifies your acceptance of the Terms of Use.