EFFICIENT TRAFFIC MANAGEMENT FOR BRIDGED RESILIENT PACKET RINGS USING TOPOLOGY DISCOVERY AND SPANNING TREE ALGORITHM

摘要

When bridging Resilient Packet Rings, available bandwidth drops dramatically because traffic between rings must be flooded on all the rings. This paper proposes enhancements to topology discovery and spanning tree algorithm that will manage traffic between rings more efficiently and remove the need for flooding.