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

Automatic map-based FTTx access network design

Several mature and standardized optical access network technologies are available for network operators providing broadband services, being now in deployment phase; therefore cost estimation, business analysis, efficient deployment strategies, network and topology design issues for FTTx access networks play an increasingly important role regarding profitability and market success. In a competitive environment, techno-economic evaluation supports the optimal choice among available technologies. Even the tradeoff between future proof technical superiority and short term investment minimization requires a farseeing decision. In our point of view, cost estimation and techno-economic evaluation is strongly related to strategic network design: among others the uneven population density, irregular street system or infrastructure have significant impact on the network topology, thus the deployment costs as well. In order to deal with these aspects, a high-level, strategic network design is necessary that adapts to geospatial characteristics of the services area, providing accurate and detailed network information for the techno-economic evaluation [1]. We have developed a topology designer methodology that supprts the above requirements, providing (near) optimal topology of the fully or partially optical access network, based on the geospatial information about the service area: digital maps, existing infrastructure and subscriber database. Automatic topology design for large-scale service areas, with 10.000s of subsribers is a highly complex mathematical problem. The tough algorithms for a near optimal, yet efficient solution. The developed algorithms were evaluated regarding their speed and accuracy. Based on topology design results, a detailed and flexible techno-economic comparison is carried out, since the framework handles various broadband access network technologies, as presented in a case study. --Topology design,Strategic Design,Network planning,GIS,Map,Techno-economic,Cost estimation

Joint Hybrid Backhaul and Access Links Design in Cloud-Radio Access Networks

The cloud-radio access network (CRAN) is expected to be the core network architecture for next generation mobile radio systems. In this paper, we consider the downlink of a CRAN formed of one central processor (the cloud) and several base-station (BS), where each BS is connected to the cloud via either a wireless or capacity-limited wireline backhaul link. The paper addresses the joint design of the hybrid backhaul links (i.e., designing the wireline and wireless backhaul connections from the cloud to the BSs) and the access links (i.e., determining the sparse beamforming solution from the BSs to the users). The paper formulates the hybrid backhaul and access link design problem by minimizing the total network power consumption. The paper solves the problem using a two-stage heuristic algorithm. At one stage, the sparse beamforming solution is found using a weighted mixed `1=`2 norm minimization approach; the correlation matrix of the quantization noise of the wireline backhaul links is computed using the classical rate-distortion theory. At the second stage, the transmit powers of the wireless backhaul links are found by solving a power minimization problem subject to quality-of-service constraints, based on the principle of conservation of rate by utilizing the rates found in the first stage. Simulation results suggest that the performance of the proposed algorithm approaches the global optimum solution, especially at high signal-to-interference-plus-noise ratio (SINR).Comment: 6 pages, 3 figures, IWCPM 201

Updating Content in Cache-Aided Coded Multicast

Motivated by applications to delivery of dynamically updated, but correlated data in settings such as content distribution networks, and distributed file sharing systems, we study a single source multiple destination network coded multicast problem in a cache-aided network. We focus on models where the caches are primarily located near the destinations, and where the source has no cache. The source observes a sequence of correlated frames, and is expected to do frame-by-frame encoding with no access to prior frames. We present a novel scheme that shows how the caches can be advantageously used to decrease the overall cost of multicast, even though the source encodes without access to past data. Our cache design and update scheme works with any choice of network code designed for a corresponding cache-less network, is largely decentralized, and works for an arbitrary network. We study a convex relation of the optimization problem that results form the overall cost function. The results of the optimization problem determines the rate allocation and caching strategies. Numerous simulation results are presented to substantiate the theory developed.Comment: To Appear in IEEE Journal on Selected Areas in Communications: Special Issue on Caching for Communication Systems and Network

Implementation of a station/network interface for a CAMB tree network

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. An architecture based on collision avoidance is the CAMB (Collision Avoidance Multiple Broadcast) tree network, where concurrent broadcasts are possible.This paper is a companion to an earlier report. "TTL Implementations of a CAMB Tree Switch," where a tree network architecture was described for two different implementations of a CAMB tree switch. In the pages that follow, a hardware implementation of the interface between the network stations and the packet switches is proposed. This implementation is based on the first switch design in the companion paper