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

Collision Avoidance Tree networks

The Collision Avoidance Tree is a new local area network based on a hardware device called collision avoidance switch, which arbitrates random access to a shared communications channel. Collision Avoidance Tree combines the benefits of random access (low delay when traffic is light; simple, distributed, and therefore robust, protocols) with concurrency of transmission, excellent network utilization and suitability for the domain of high-speed, optical networking.The Collision Avoidance Tree is classified in two classes: the Collision Avoidance Single Broadcast (CASB) Tree and the Collision Avoidance Multiple Broadcast (CAMB) Tree. The CASB Tree allows only a single transmission on the network at a given time, while the CAMB Tree is more general and allows concurrent transmissions on the network.This paper describes network architectures (e.g., station and switch protocols) and designs and implementations of the CASB and CAMB Trees. Performance results derived from analyses, simulations, measurements of experimental networks are also presented

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

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

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

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

Goodbye, ALOHA!

©2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.The vision of the Internet of Things (IoT) to interconnect and Internet-connect everyday people, objects, and machines poses new challenges in the design of wireless communication networks. The design of medium access control (MAC) protocols has been traditionally an intense area of research due to their high impact on the overall performance of wireless communications. The majority of research activities in this field deal with different variations of protocols somehow based on ALOHA, either with or without listen before talk, i.e., carrier sensing multiple access. These protocols operate well under low traffic loads and low number of simultaneous devices. However, they suffer from congestion as the traffic load and the number of devices increase. For this reason, unless revisited, the MAC layer can become a bottleneck for the success of the IoT. In this paper, we provide an overview of the existing MAC solutions for the IoT, describing current limitations and envisioned challenges for the near future. Motivated by those, we identify a family of simple algorithms based on distributed queueing (DQ), which can operate for an infinite number of devices generating any traffic load and pattern. A description of the DQ mechanism is provided and most relevant existing studies of DQ applied in different scenarios are described in this paper. In addition, we provide a novel performance evaluation of DQ when applied for the IoT. Finally, a description of the very first demo of DQ for its use in the IoT is also included in this paper.Peer ReviewedPostprint (author's final draft

Multicasting in WDM Single-Hop Local Lightwave Networks

In modem networks, the demand for bandwidth and high quality of service (QoS) requires the efficient utilisation of network resources such as transmitters, receivers and channel bandwidth. One method for conserving these resources is to employ efficient implementations of multicasting wherever possible. Using multicasting, a source sending a message to multiple destinations may schedule a single transmission which can then be broadcasted to multiple destinations or forwarded from one destination to another, thus conserving the source transmitter usage and channel bandwidth. This thesis investigates the behaviour of single-hop WDM optical networks when they carry multicast traffic. Each station in the network has a fixed-wavelength transceiver and is set to operate on its own unique wavelength as a control channel. Each station also has a tuneable wavelength transceiver in order to transmit or receive signals to or from all the other stations. A transmission on each channel is broadcasted by a star coupler to all nodes. Multicasting in single-hop WDM networks has been studied with different protocols. This thesis studies the multicasting performance adopting receiver collision avoidance (RCA) protocol as a multicasting protocol. This study takes into consideration the effect of the tuneable transceiver tuning time which is the time required to switch from one wavelength to another, and the propagation time required by a packet to propagate from one node to another. The strategy in RCA protocol is that nodes request transmission time by sending a control packet at the head of their queues. Upon receipt of this information all nodes run a deterministic distributed algorithm to schedule the transmission of the multicast packet. With the control information, nodes determine the earliest time at which all the members of the multicast group can receive the packet and the earliest time at which it can be transmitted. If a node belongs to the multicast group addressed in the control packet, its receiver must become idle until all nodes in the group have tuned to the appropriate wavelength to receive the packet. This problem leads to poor transmission and consequently low channel utilisation. However, throughput degradation due to receiver conflicts decreases as the multicast size increases. This is because for a given number of channels, the likelihood of a receiver being idle decreases as the number of intended recipients per transmission increases. The number of wavelengths available in a WDM network continues to be a major constraint. Thus in order to support a large number of end users, such networks must use and reuse wavelengths efficiently. This thesis also examines the number of wavelengths needed to support multicasting in single-hop optical networks