Scalability of broadcast performance in wireless network-on-chip

Networks-on-Chip (NoCs) are currently the paradigm of choice to interconnect the cores of a chip multiprocessor. However, conventional NoCs may not suffice to fulfill the on-chip communication requirements of processors with hundreds or thousands of cores. The main reason is that the performance of such networks drops as the number of cores grows, especially in the presence of multicast and broadcast traffic. This not only limits the scalability of current multiprocessor architectures, but also sets a performance wall that prevents the development of architectures that generate moderate-to-high levels of multicast. In this paper, a Wireless Network-on-Chip (WNoC) where all cores share a single broadband channel is presented. Such design is conceived to provide low latency and ordered delivery for multicast/broadcast traffic, in an attempt to complement a wireline NoC that will transport the rest of communication flows. To assess the feasibility of this approach, the network performance of WNoC is analyzed as a function of the system size and the channel capacity, and then compared to that of wireline NoCs with embedded multicast support. Based on this evaluation, preliminary results on the potential performance of the proposed hybrid scheme are provided, together with guidelines for the design of MAC protocols for WNoC.Peer ReviewedPostprint (published version

Holographic and 3D teleconferencing and visualization: implications for terabit networked applications

Abstract not available

Network monitoring in multicast networks using network coding

In this paper we show how information contained in robust network codes can be used for passive inference of possible locations of link failures or losses in a network. For distributed randomized network coding, we bound the probability of being able to distinguish among a given set of failure events, and give some experimental results for one and two link failures in randomly generated networks. We also bound the required field size and complexity for designing a robust network code that distinguishes among a given set of failure events

Polynomial time algorithms for multicast network code construction

The famous max-flow min-cut theorem states that a source node s can send information through a network (V, E) to a sink node t at a rate determined by the min-cut separating s and t. Recently, it has been shown that this rate can also be achieved for multicasting to several sinks provided that the intermediate nodes are allowed to re-encode the information they receive. We demonstrate examples of networks where the achievable rates obtained by coding at intermediate nodes are arbitrarily larger than if coding is not allowed. We give deterministic polynomial time algorithms and even faster randomized algorithms for designing linear codes for directed acyclic graphs with edges of unit capacity. We extend these algorithms to integer capacities and to codes that are tolerant to edge failures

Two-Layered Superposition of Broadcast/Multicast and Unicast Signals in Multiuser OFDMA Systems

We study optimal delivery strategies of one common and $K$ independent messages from a source to multiple users in wireless environments. In particular, two-layered superposition of broadcast/multicast and unicast signals is considered in a downlink multiuser OFDMA system. In the literature and industry, the two-layer superposition is often considered as a pragmatic approach to make a compromise between the simple but suboptimal orthogonal multiplexing (OM) and the optimal but complex fully-layered non-orthogonal multiplexing. In this work, we show that only two-layers are necessary to achieve the maximum sum-rate when the common message has higher priority than the $K$ individual unicast messages, and OM cannot be sum-rate optimal in general. We develop an algorithm that finds the optimal power allocation over the two-layers and across the OFDMA radio resources in static channels and a class of fading channels. Two main use-cases are considered: i) Multicast and unicast multiplexing when $K$ users with uplink capabilities request both common and independent messages, and ii) broadcast and unicast multiplexing when the common message targets receive-only devices and $K$ users with uplink capabilities additionally request independent messages. Finally, we develop a transceiver design for broadcast/multicast and unicast superposition transmission based on LTE-A-Pro physical layer and show with numerical evaluations in mobile environments with multipath propagation that the capacity improvements can be translated into significant practical performance gains compared to the orthogonal schemes in the 3GPP specifications. We also analyze the impact of real channel estimation and show that significant gains in terms of spectral efficiency or coverage area are still available even with estimation errors and imperfect interference cancellation for the two-layered superposition system