It is shown analytically that for uniform traffic, throughput close to twice the nominal network bandwidth may be achieved with only several erasure nodes. The optimal erasure node locations are calculated. The results are tested by simulation of the DQDB (distributed queue dual bus) protocol, yielding a realistic improvement of 40% with only three erasure nodes. Fair access among the stations is improved as well. The analytic results are generalized by providing an algorithm for determining the optimal erasure node locations and the throughput improvement, given any arbitrary traffic pattern. The application of this methodology to the related problem of bridged subnetworks is discussed.
展开▼
