Evaluation of a Path-Finding Algorithm for Interconnected Local Area Networks

Wong, J.W.; Vernon, A.J.; Field, James A.

doi:10.1109/jsac.1987.1146661

Cited by 11 publications

(2 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The overhead of source routing scheme on each host is overwheleming in a large interconnected LAN although this scheme possesses more sophisticated routing and network management facilities and reduces the complexity of the bridge [8]. The spanning tree bridge offers the valuable features of transparency for…”

Section: Introductionmentioning

confidence: 99%

Brouter: the transparent bridge with shortest path in interconnected LANs

Lin¹,

Gerla²

[1991] Proceedings 16th Conference on Local Computer Networks

View full text Add to dashboard Cite

Abstract!ikansparency is a popular feature in a distributed system where users can access any local or remote resources just as if they were local. As different units in the distributed environment can be integrated into a single unit by means of a distributed operating system, so can multiple LANs be connected by transparent bridges and appear as one LAN to upper layer protocols and end stations. End stations just transmit their packets on their local LAN8 and leave the forwarding task to bridges. Transparency of the interconnected LANs requires ' self learning' at bridges. The main problem of self learning is packet looping. Thus, a "spanning tree " algorithm was developed to eliminate loops in networks. However, two main disadvantages of the spanning tree solution are non-shortest path routing and resour~e wastage. In this paper, a protocol is proposed which combines the features of transparency and shortest path. The result is a bridge which supports Self learning and distributed routing computation. Since this bridge has all routing facilities as a router, it is called 'brouter" (ie. bridge+router). Brouters are compand with current bridge schemes.Also, performance aspects of the protocol are ezamined.

show abstract

Section: Introductionmentioning

confidence: 99%

Brouter: the transparent bridge with shortest path in interconnected LANs

Lin¹,

Gerla²

[1991] Proceedings 16th Conference on Local Computer Networks

View full text Add to dashboard Cite

show abstract

“…These include: naming, addressing, routing and flow control [7]. The issue of routing in interconnected token rings with an irregular mesh topology has been investigated in [8]. In [9] the issue of flow control in a hierarchy of interconnected token rings has been considered.…”

Section: Introductionmentioning

confidence: 99%

Queueing analysis of transport-layer connections in an internet environment

Vernon

Hurley

Wong

et al.

IEEE International Conference on Communications, World Prosperity Through Communications

View full text Add to dashboard Cite

The performance of transport-layer connections in an internet environment is investigated. We consider the scenario of multiple sender hosts and a single receiver host which are connected through a transport network. Application-layer processes in the sender hosts generate messages which are transferred to a peer process in the receiver host. Messages are transferred over window flow-controlled end-bend connections between transport-layer entities. Buffer space in the host machines is assumed to be limited and thus process blocking can occur. The performance model developed considers the system to be comprised of three submodels: sender, receiver and communications control. Our analysis technique develops a queuing model for each submodel and approximate results are obtained through an iterative solution method, using the results of one submodel as inputs to the others. The accuracy of the approximate analysis is discussed and finally, performance characteristics are presented.

show abstract

Performance comparison of bridge algorithms in interconnected local area networks

Lee

1991

Computer Networks and ISDN Systems

View full text Add to dashboard Cite

Evaluation of a Path-Finding Algorithm for Interconnected Local Area Networks

Cited by 11 publications

References 4 publications

Brouter: the transparent bridge with shortest path in interconnected LANs

Brouter: the transparent bridge with shortest path in interconnected LANs

Queueing analysis of transport-layer connections in an internet environment

Performance comparison of bridge algorithms in interconnected local area networks

Contact Info

Product

Resources

About