6,887 research outputs found
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
Recommended from our members
Effective video multicast over wireless internet
With the rapid growth of wireless networks and great success of Internet video, wireless video services are expected to be widely deployed in the near future. As different types of wireless networks are converging into all IP networks, i.e., the Internet, it is important to study video delivery over the wireless Internet. This paper proposes a novel end-system based adaptation protocol calledWireless Hybrid Adaptation Layered Multicast (WHALM) protocol for layered video multicast over wireless Internet. In WHALM the sender dynamically collects bandwidth distribution from the receivers and uses an optimal layer rate allocation mechanism to reduce the mismatches between the coarse-grained layer subscription levels and the heterogeneous and dynamic rate requirements from the receivers, thus maximizing the degree of satisfaction of all the receivers in a multicast session. Based on sampling theory and theory of probability, we reduce the required number of bandwidth feedbacks to a reasonable degree and use a scalable feedback mechanism to control the feedback process practically. WHALM is also tuned to perform well in wireless networks by integrating an end-to-end loss differentiation algorithm (LDA) to differentiate error losses from congestion losses at the receiver side. With a series of simulation experiments over NS platform, WHALM has been proved to be able to greatly improve the degree of satisfaction of all the receivers while avoiding congestion collapse on the wireless Internet
Experimental Evaluation of Large Scale WiFi Multicast Rate Control
WiFi multicast to very large groups has gained attention as a solution for
multimedia delivery in crowded areas. Yet, most recently proposed schemes do
not provide performance guarantees and none have been tested at scale. To
address the issue of providing high multicast throughput with performance
guarantees, we present the design and experimental evaluation of the Multicast
Dynamic Rate Adaptation (MuDRA) algorithm. MuDRA balances fast adaptation to
channel conditions and stability, which is essential for multimedia
applications. MuDRA relies on feedback from some nodes collected via a
light-weight protocol and dynamically adjusts the rate adaptation response
time. Our experimental evaluation of MuDRA on the ORBIT testbed with over 150
nodes shows that MuDRA outperforms other schemes and supports high throughput
multicast flows to hundreds of receivers while meeting quality requirements.
MuDRA can support multiple high quality video streams, where 90% of the nodes
report excellent or very good video quality
B-RPM: An Efficient One-to-Many Communication Framework for On-Chip Networks
The prevalence of multicore architectures has accentuated the need for scalable on-chip communication media. Various parallel applications and programming paradigms use a mix of unicast (one-to-one) and multicast (one-to-many) to maintain data coherence and consistency. Providing efficient support for these communication patterns becomes a critical design point for on-chip networks (OCN). High performance on-chip networks design advocates balanced traffic across the whole network, which makes adaptive routing appealing. Adaptive routing explores the path diversity of the network, increases throughput, and reduces network latency compared with oblivious routing.
In this work, we propose an adaptive multicast routing, Balanced Recursive Partitioning Multicast (B-RPM), to achieve balanced one-to-many on-chip communication. The algorithm derives its functionality from previously proposed algorithm Recursive Partitioning Multicast (RPM). Unlike RPM which uses fixed set of directional priorities and position of destination nodes, B-RPM replicates packet based on the local congestion information and position of destination nodes with respect to current node. B-RPM employs a new deadlock avoidance technique Dynamically Sized Virtual Networks (DSVN). Built upon the traditional virtual networks, DSVN dynamically allocates the network resources to different VNs according to the run-time traffic status, which delivers better resources utilization. We also propose a new scheme for representing multiple destinations in packet head. The scheme works simply by differentiating multicast and unicast packets. The algorithm combined with dynamically sized virtual networks enables us to improve network performance at high load on average by 20% (up to 50%) and saturation throughput of network on average by 10% (up to 18%) over the most recent multicast algorithm. Also the new header representation scheme enables us to save 24% of dynamic link power
Random Linear Network Coding for 5G Mobile Video Delivery
An exponential increase in mobile video delivery will continue with the
demand for higher resolution, multi-view and large-scale multicast video
services. Novel fifth generation (5G) 3GPP New Radio (NR) standard will bring a
number of new opportunities for optimizing video delivery across both 5G core
and radio access networks. One of the promising approaches for video quality
adaptation, throughput enhancement and erasure protection is the use of
packet-level random linear network coding (RLNC). In this review paper, we
discuss the integration of RLNC into the 5G NR standard, building upon the
ideas and opportunities identified in 4G LTE. We explicitly identify and
discuss in detail novel 5G NR features that provide support for RLNC-based
video delivery in 5G, thus pointing out to the promising avenues for future
research.Comment: Invited paper for Special Issue "Network and Rateless Coding for
Video Streaming" - MDPI Informatio
Feasibility Study of Enabling V2X Communications by LTE-Uu Radio Interface
Compared with the legacy wireless networks, the next generation of wireless
network targets at different services with divergent QoS requirements, ranging
from bandwidth consuming video service to moderate and low date rate machine
type services, and supporting as well as strict latency requirements. One
emerging new service is to exploit wireless network to improve the efficiency
of vehicular traffic and public safety. However, the stringent packet
end-to-end (E2E) latency and ultra-low transmission failure rates pose
challenging requirements on the legacy networks. In other words, the next
generation wireless network needs to support ultra-reliable low latency
communications (URLLC) involving new key performance indicators (KPIs) rather
than the conventional metric, such as cell throughput in the legacy systems. In
this paper, a feasibility study on applying today's LTE network infrastructure
and LTE-Uu air interface to provide the URLLC type of services is performed,
where the communication takes place between two traffic participants (e.g.,
vehicle-to-vehicle and vehicle-to-pedestrian). To carry out this study, an
evaluation methodology of the cellular vehicle-to-anything (V2X) communication
is proposed, where packet E2E latency and successful transmission rate are
considered as the key performance indicators (KPIs). Then, we describe the
simulation assumptions for the evaluation. Based on them, simulation results
are depicted that demonstrate the performance of the LTE network in fulfilling
new URLLC requirements. Moreover, sensitivity analysis is also conducted
regarding how to further improve system performance, in order to enable new
emerging URLLC services.Comment: Accepted by IEEE/CIC ICCC 201
- …