CFP last date
20 May 2024
Reseach Article

Solution of Looping Problem In Learning Bridges

by Shish Ahmad, Mohd. Rizwan Beg, Jameel Ahmad, Mohd. Danish
journal cover thumbnail
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 1 - Number 25
Year of Publication: 2010
Authors: Shish Ahmad, Mohd. Rizwan Beg, Jameel Ahmad, Mohd. Danish
10.5120/466-771

Shish Ahmad, Mohd. Rizwan Beg, Jameel Ahmad, Mohd. Danish . Solution of Looping Problem In Learning Bridges. International Journal of Computer Applications. 1, 25 ( February 2010), 5-8. DOI=10.5120/466-771

@article{ 10.5120/466-771,
author = { Shish Ahmad, Mohd. Rizwan Beg, Jameel Ahmad, Mohd. Danish },
title = { Solution of Looping Problem In Learning Bridges },
journal = { International Journal of Computer Applications },
issue_date = { February 2010 },
volume = { 1 },
number = { 25 },
month = { February },
year = { 2010 },
issn = { 0975-8887 },
pages = { 5-8 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume1/number25/466-771/ },
doi = { 10.5120/466-771 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:48:28.172254+05:30
%A Shish Ahmad
%A Mohd. Rizwan Beg
%A Jameel Ahmad
%A Mohd. Danish
%T Solution of Looping Problem In Learning Bridges
%J International Journal of Computer Applications
%@ 0975-8887
%V 1
%N 25
%P 5-8
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Bridges plays an important role as internetworking devices, especially when we use learning bridges as compare to simple or multi-port bridges. Basically when we connect two or more different sub-network using simple bridges only it require to update the network information in its routing table manually, but if we use learning bridges, it automatically update itself and maintain the information of the node of the network in its table which one node is located in which particular sub-network.

References
  1. Clark, K., and K. Hamilton. (1998) Cisco LAN Switching. Indianapolis: Cisco Press.
  2. F. Backes entitled (1989), "Transparent Bridges for Interconnection of IEEE 802 LANs".
  3. G. Varghese, et al. entitled (1991), "Transparent Interconnection of Incompatible Local Area Networks Using Bridges".
  4. J. Hart entitled (1988), "Extending the IEEE 802.1 MAC Bridge Standard to Remote Bridges".
  5. Perlman, Radia (1985). "An Algorithm for Distributed Computation of a Spanning Tree in an Extended LAN". ACM SIGCOMM Computer Communication Review.
  6. Perlman, Radia.(1988) Interconnections, Bridges and Routers. Boston: Addison-Wesley.
  7. R. Garcia, et al.(1988) "A New Transparent Bridge Protocol for LAN Internetworking Using Topologies with Active Loops," a publication from the International Conference on Parallel Processing.
  8. R. Perlman, et al, entitled (1988), "Choosing the Appropriate ISO Layer for LAN Interconnection".
  9. T. Rodeheffer, et al. "SmartBridge: A Scalable Bridge Architecture," a 2000 publication from the ACM Special Interest Group on Computer Communication.
  10. Seifert, W.M "Bridges and routers" Volume 2, Issue 1, Jan. 1988 Page(s):57 - 64 Digital Object Identifier 10.1109/65.3239.
  11. R. Perlman. Rbridges: Transparent routing. In IEEE Infocom 2004, Mar.
  12. S. Sharma, K. Gopalan, S. Nanda, and T. Chiueh. Viking: A multispanning- tree Ethernet architecture for metropolitan area and cluster networks. In IEEE Infocom 2004, Mar. 2004.
  13. Khaled Elmeleegy, Alan L. Cox, T. S. Eugene NgDepartment of Computer Science, Rice University "On Count-to-Infinity Induced Forwarding Loops in Ethernet Networks" 2008.
Index Terms

Computer Science
Information Sciences

Keywords

Networks Bridges Spanning tree Algorithm looping