809 research outputs found
Recommended from our members
Tree LANS with collision avoidance : protocol, switch architecture, and performance
Packet collisions and their resolution create a performance bottleneck in random access LANs. A hardware solution to this problem is to use collision avoidance switches. These switches allow the implementation of random access protocols without the penalty of collisions among packets. We review and compare the designs of some tree LANs that use collision avoidance switches. They have the potential of combining the benefits of random access (low delay when traffic is light, simple and distributed, and therefore robust, protocols) with excellent network utilization and concurrency of transmission. The collision avoidance LANs we review are broadcast star, Hubnet-like tree, Tinker-Tree, and a treenet that allows concurrent broadcasts within non-intersecting subtrees. After this review, we present a slotted-time, infinite user analysis of the broadcast star network
Recommended from our members
Performance analysis of a broadcast star local area network with collision avoidance. Part 1, Infinite station population model
Packet collisions and their resolution create a performance bottleneck in random access LANs. As a solution to this problem, a broadcast star network with collision avoidance has been proposed and studied in [3 - 17]. In a broadcast star network, collisions of simultaneously transmitted packets are avoided by means of hardware called a collision avoidance switch. While the channel is being used by one station, the collision avoidance switch blocks other stations from using it. This network implements random access protocols without the penalty of collisions among packets and combines the benefits of random access (low delay when traffic is light; simple, distributed, and therefore robust protocols) with excellent network utilization.In this paper, we analyze the performance of a broadcast star network, assuming synchronous operation of a network. In synchronous operation, the channel time is slotted, and stations transmit only at the beginning of a slot. The number of stations on a network is assumed to be infinite, and packets arrive at stations according to a Poisson process. An exact analysis is developed, and the distribution for the transmission delays is obtained. It is also shown through simulations that a broadcast star operating under synchronous mode yields better performance than that operating under asynchronous mode, where transmissions of packets are not confined to the beginning of slots, and stations start transmission any time
Recommended from our members
A VLSI implementation of the collision avoidance switch protocol for CAMB tree LANs
To solve a performance bottle neck in random access LANs due to packet collisions and their resolution, collision avoidance switches are introduced. These switches allow random access protocols to achieve high performance by resolving collisions among packets. A conventional hardware implementation of these switches is the use of TTL chips. In this implementation; a handful of TTL chips are required to forma single switch (e.g., 18 TTL chips are needed for an implementation of the CAMB switch [7]). Thus, implementation of a complete network, which requires several of these switches, could very well result in a large and complex hardware system.Today's modern chip technology allows us to pack large quantity of logic in a single chip. By transferring the conventional implementation of the collision avoidance switches into a VLSI chip, the complexity of the resultant hardware is greatly reduced, not to mention the improvement in hardware performance and ease of packaging.This report provides an overall study of the collision avoidance protocols for the tree LANs with emphasis on the implementation of collision avoidance switches. Hardware implementations of sorne of these switches are discussed. And a VLSI implementation of the CAMB switch protocol is introduced
Recommended from our members
Design implementation and measurement of a collision avoidance multiple broadcast tree network
Packet collisions and their resolution create a performance bottleneck in random access LANs. Collision avoidance switches are a hardware solution to this problem [1, 2]. Collision avoidance switches allow the implementation of random access protocols without the penalty of collisions among packets.In this paper, we describe a design and implementation of a local area network architecture based on collision avoidance, called the Collision Avoidance Multiple Broadcast (CAMB) tree network. Our implementation follows the protocol layering architecture of the IEEE 802 local area networks, and includes CAMB tree switches, station/network interface boards, and support of transport protocols. We also present the performance measurements of our experimental CAMB tree network
Recommended from our members
Issues in multi-media information networks
In an integrated service environment, where users exchange various types of aural and visual information, networks should appear friendly to its users providing tools for management of multi-media information. Networks should also efficiently satisfy diverse performance requirements of different information being exchanged.In this paper we present new architecture for integrated service networks being investigated and developed by the Distributed Computation and Communication Group at the Department of Computer Science in the Columbia University. Research efforts are devoted to developing both (1) document management software to allow users to manipulate and relate text/graphics/voice information in a dynamic way, and (2) a tree network architecture for reliable and efficient exchange of multi-media information
Saturation Throughput Analysis of IEEE 802.11 in Presence of Non Ideal Transmission Channel and Capture Effects
In this paper, we provide a saturation throughput analysis of the IEEE 802.11
protocol at the data link layer by including the impact of both transmission
channel and capture effects in Rayleigh fading environment. Impacts of both
non-ideal channel and capture effects, specially in an environment of high
interference, become important in terms of the actual observed throughput. As
far as the 4-way handshaking mechanism is concerned, we extend the
multi-dimensional Markovian state transition model characterizing the behavior
at the MAC layer by including transmission states that account for packet
transmission failures due to errors caused by propagation through the channel.
This way, any channel model characterizing the physical transmission medium can
be accommodated, including AWGN and fading channels. We also extend the Markov
model in order to consider the behavior of the contention window when employing
the basic 2-way handshaking mechanism.
Under the usual assumptions regarding the traffic generated per node and
independence of packet collisions, we solve for the stationary probabilities of
the Markov chain and develop expressions for the saturation throughput as a
function of the number of terminals, packet sizes, raw channel error rates,
capture probability, and other key system parameters. The theoretical
derivations are then compared to simulation results confirming the
effectiveness of the proposed models.Comment: To appear on IEEE Transactions on Communications, 200
Mapping Technological Trajectories as Patent Citation Networks. An application to Data Communication Standards
Technical systems, Technological trajectories, Patents, Network analysis, Data communications
Unsaturated Throughput Analysis of IEEE 802.11 in Presence of Non Ideal Transmission Channel and Capture Effects
In this paper, we provide a throughput analysis of the IEEE 802.11 protocol
at the data link layer in non-saturated traffic conditions taking into account
the impact of both transmission channel and capture effects in Rayleigh fading
environment. The impact of both non-ideal channel and capture become important
in terms of the actual observed throughput in typical network conditions
whereby traffic is mainly unsaturated, especially in an environment of high
interference.
We extend the multi-dimensional Markovian state transition model
characterizing the behavior at the MAC layer by including transmission states
that account for packet transmission failures due to errors caused by
propagation through the channel, along with a state characterizing the system
when there are no packets to be transmitted in the buffer of a station.
Finally, we derive a linear model of the throughput along with its interval of
validity.
Simulation results closely match the theoretical derivations confirming the
effectiveness of the proposed model.Comment: To appear on IEEE Transactions on Wireless Communications, 200
- …