High speed fiber optics local area networks: Design and implementation

The design of high speed local area networks (HSLAN) for communication among distributed devices requires solving problems in three areas: (1) the network medium and its topology; (2) the medium access control; and (3) the network interface. Considerable progress has been made in all areas. Accomplishments are divided into two groups according to their theoretical or experimental nature. A brief summary is given in Section 2, including references to papers which appeared in the literature, as well as to Ph.D. dissertations and technical reports published at Stanford University

Throughput analysis of the IEEE 802.4 token bus standard under heavy load

It has become clear in the last few years that there is a trend towards integrated digital services. Parallel to the development of public Integrated Services Digital Network (ISDN) is service integration in the local area (e.g., a campus, a building, an aircraft). The types of services to be integrated depend very much on the specific local environment. However, applications tend to generate data traffic belonging to one of two classes. According to IEEE 802.4 terminology, the first major class of traffic is termed synchronous, such as packetized voice and data generated from other applications with real-time constraints, and the second class is called asynchronous which includes most computer data traffic such as file transfer or facsimile. The IEEE 802.4 token bus protocol which was designed to support both synchronous and asynchronous traffic is examined. The protocol is basically a timer-controlled token bus access scheme. By a suitable choice of the design parameters, it can be shown that access delay is bounded for synchronous traffic. As well, the bandwidth allocated to asynchronous traffic can be controlled. A throughput analysis of the protocol under heavy load with constant channel occupation of synchronous traffic and constant token-passing times is presented

Design and implementation of interface units for high speed fiber optics local area networks and broadband integrated services digital networks

The design and implementation of interface units for high speed Fiber Optic Local Area Networks and Broadband Integrated Services Digital Networks are discussed. During the last years, a number of network adapters that are designed to support high speed communications have emerged. This approach to the design of a high speed network interface unit was to implement package processing functions in hardware, using VLSI technology. The VLSI hardware implementation of a buffer management unit, which is required in such architectures, is described

Multi-Objective and Financial Portfolio Optimization of Carrier-Sense Multiple Access Protocols with Cooperative Diversity

8th International Workshop on Multiple Access Communications (MACOM2015), Helsinki, Finland.This paper presents a trade-off design and optimization of a class of wireless carrier-sense multiple access protocols where collision-free transmissions are assisted by the potential cooperative retransmissions of inactive terminals with a correct copy of the original transmission. Terminals are enabled with a decode-and-forward relaying protocol. The analysis is focused on asymmetrical settings, where terminals experience different channel and queuing statistics. This work is based on multi-objective and financial portfolio optimization tools. Each packet transmission is thus regarded not only as a network resource, but also as a financial asset with different values of return and risk (or variance of the return). The objective of this financial optimization is to find the transmission policy that simultaneously maximizes return and minimizes risk in the network. The work is focused on the characterization of the boundaries (envelope) of different types of trade-off performance regions: the conventional throughput region, sum-throughput vs. fairness, sum-throughput vs. power, and return vs. risk regions. Fairness is evaluated by means of the Gini-index, which is a metric commonly used in economics to measure income inequality. Transmit power is directly linked to the global transmission rate. The protocol is shown to outperform non-cooperative solutions under different network conditions that are here discussed

Capacity of an IEEE 802.11b wireless LAN supporting VoIP

In this paper we evaluate the capacity of an IEEE 802.11b network carrying voice calls in a wide range of scenarios, including varying delay constraints, channel conditions and voice call quality requirements. We consider both G.711 and G.729 voice encoding schemes and a range of voice packet sizes. We first present an analytical..

A 3-player protocol preventing persistence in strategic contention with limited feedback

In this paper, we study contention resolution protocols from a game-theoretic perspective. In a recent work, we considered acknowledgment-based protocols, where a user gets feedback from the channel only when she attempts transmission. In this case she will learn whether her transmission was successful or not. One of the main results of ESA2016 was that no acknowledgment-based protocol can be in equilibrium. In fact, it seems that many natural acknowledgment-based protocols fail to prevent users from unilaterally switching to persistent protocols that always transmit with probability 1. It is therefore natural to ask how powerful a protocol must be so that it can beat persistent deviators. In this paper we consider age-based protocols, which can be described by a sequence of probabilities of transmitting in each time step. Those probabilities are given beforehand and do not change based on the transmission history. We present a 3-player age-based protocol that can prevent users from unilaterally deviating to a persistent protocol in order to decrease their expected transmission time. It is worth noting that the answer to this question does not follow from the results and proof ideas of ESA2016. Our protocol is non-trivial, in the sense that, when all players use it, finite expected transmission time is guaranteed. In fact, we show that this protocol is preferable to any deadline protocol in which, after some fixed time, attempt transmission with probability 1 in every subsequent step. An advantage of our protocol is that it is very simple to describe, and users only need a counter to keep track of time. Whether there exist $n$-player age-based protocols that do not use counters and can prevent persistence is left as an open problem for future research.Comment: arXiv admin note: substantial text overlap with arXiv:1606.0658

Strategic Contention Resolution in Multiple Channels

We consider the problem of resolving contention in communication networks with selfish users. In a \textit{contention game} each of $n \geq 2$ identical players has a single information packet that she wants to transmit using one of $k \geq 1$ multiple-access channels. To do that, a player chooses a slotted-time protocol that prescribes the probabilities with which at a given time-step she will attempt transmission at each channel. If more than one players try to transmit over the same channel (collision) then no transmission happens on that channel. Each player tries to minimize her own expected \textit{latency}, i.e. her expected time until successful transmission, by choosing her protocol. The natural problem that arises in such a setting is, given $n$ and $k$, to provide the players with a common, anonymous protocol (if it exists) such that no one would unilaterally deviate from it (equilibrium protocol). All previous theoretical results on strategic contention resolution examine only the case of a single channel and show that the equilibrium protocols depend on the feedback that the communication system gives to the players. Here we present multi-channel equilibrium protocols in two main feedback classes, namely \textit{acknowledgement-based} and \textit{ternary}. In particular, we provide equilibrium characterizations for more than one channels, and give specific anonymous, equilibrium protocols with finite and infinite expected latency. In the equilibrium protocols with infinite expected latency, all players transmit successfully in optimal time, i.e. $\Theta(n/k)$, with probability tending to 1 as $n/k \to \infty$.Comment: The results of this work are included in the 11th International Symposium on Algorithmic Game Theory (SAGT 2018) and the 16th Workshop on Approximation and Online Algorithms (WAOA 2018