The increasing popularity of local area networks (LANs) and the limitations of a single LAN (on its geographical coverage, information-carrying capacity, and number of stations) have triggered tremendous interest in the study and implementation of interconnected LANs. The authors address the problem of interconnecting the widely deployed CSMA/CD LANs (or LAN segments) via a transparent bridge. A transparent bridge is so called because it "learns" about the network structure and organization during its operation, i.e., it learns about the location of the network stations relative to the bridge in order to do the forwarding of frames selectively; also, the stations need not be aware of the presence of the bridge. The authors make two important contributions. First, they present an approximate analytical model of a transparent CSMA/CD bridge which can be either of the normal store-and-forward type or of the novel cut-through variety (introduced by Kwok and Mukherjee). Using the analytical model, which is also verified via simulation, the performance of the cut-through bridge is compared with (and found to be superior than) that of the normal bridge. Secondly they present the design of a cut-through bridge which can be easily implemented using off-the-shelf components.>

A novel bridging architecture, called a cut-through bridge, which can be used to interconnect existing carrier-sense multiple access with collision detection (CSMA/CD) LANs is proposed. This bridge uses the cut-through switching concept. After providing a design of this bridge, the authors examine its performance via a detailed simulation model. They demonstrate the performance enhancement achievable by the cut-through bridge over a normal bridge, namely lower average frame delay while attaining the same maximum throughput as the latter. Since the cut-through bridge can be readily used to replace passive repeaters while achieving superior performance, it has promise for immediate application in existing CSMA/CD LANs.>

In the above-titled paper by Takine et al. (see ibid., vol.COM-36, no.10, p.1119-27, Oct. 1988) an exact analysis of a nonsymmetric polling system with single message buffers was reported. The commenters provide an alternate method for analyzing the exact mean waiting times of the individual stations in the same system by extending an exact analysis for the two-station case. Some corrections to the numerical results provided in the paper are made.>