Quarc: a novel network-on-chip architecture

This paper introduces the Quarc NoC, a novel NoC architecture inspired by the Spidergon NoC. The Quarc scheme significantly outperforms the Spidergon NoC through balancing the traffic which is the result of the modifications applied to the topology and the routing elements.The proposed architecture is highly efficient in performing collective communication operations including broadcast and multicast. We present the topology, routing discipline and switch architecture for the Quarc NoC and demonstrate the performance with the results obtained from discrete event simulations

Quarc: a high-efficiency network on-chip architecture

The novel Quarc NoC architecture, inspired by the Spidergon scheme is introduced as a NoC architecture that is highly efficient in performing collective communication operations including broadcast and multicast. The efficiency of the Quarc architecture is achieved through balancing the traffic which is the result of the modifications applied to the topology and the routing elements of the Spidergon NoC. This paper provides an ASIC implementation of both architectures using UMCpsilas 0.13 mum CMOS technology and demonstrates an analysis and comparison of the cost and performance between the Quarc and the Spidergon NoCs

Low Cost Quality of Service Multicast Routing in High Speed Networks

Many of the services envisaged for high speed networks, such as B-ISDN/ATM, will support real-time applications with large numbers of users. Examples of these types of application range from those used by closed groups, such as private video meetings or conferences, where all participants must be known to the sender, to applications used by open groups, such as video lectures, where partcipants need not be known by the sender. These types of application will require high volumes of network resources in addition to the real-time delay constraints on data delivery. For these reasons, several multicast routing heuristics have been proposed to support both interactive and distribution multimedia services, in high speed networks. The objective of such heuristics is to minimise the multicast tree cost while maintaining a real-time bound on delay. Previous evaluation work has compared the relative average performance of some of these heuristics and concludes that they are generally efficient, although some perform better for small multicast groups and others perform better for larger groups. Firstly, we present a detailed analysis and evaluation of some of these heuristics which illustrates that in some situations their average performance is reversed; a heuristic that in general produces efficient solutions for small multicasts may sometimes produce a more efficient solution for a particular large multicast, in a specific network. Also, in a limited number of cases using Dijkstra's algorithm produces the best result. We conclude that the efficiency of a heuristic solution depends on the topology of both the network and the multicast, and that it is difficult to predict. Because of this unpredictability we propose the integration of two heuristics with Dijkstra's shortest path tree algorithm to produce a hybrid that consistently generates efficient multicast solutions for all possible multicast groups in any network. These heuristics are based on Dijkstra's algorithm which maintains acceptable time complexity for the hybrid, and they rarely produce inefficient solutions for the same network/multicast. The resulting performance attained is generally good and in the rare worst cases is that of the shortest path tree. The performance of our hybrid is supported by our evaluation results. Secondly, we examine the stability of multicast trees where multicast group membership is dynamic. We conclude that, in general, the more efficient the solution of a heuristic is, the less stable the multicast tree will be as multicast group membership changes. For this reason, while the hybrid solution we propose might be suitable for use with closed user group multicasts, which are likely to be stable, we need a different approach for open user group multicasting, where group membership may be highly volatile. We propose an extension to an existing heuristic that ensures multicast tree stability where multicast group membership is dynamic. Although this extension decreases the efficiency of the heuristics solutions, its performance is significantly better than that of the worst case, a shortest path tree. Finally, we consider how we might apply the hybrid and the extended heuristic in current and future multicast routing protocols for the Internet and for ATM Networks.

A Review of the Energy Efficient and Secure Multicast Routing Protocols for Mobile Ad hoc Networks

This paper presents a thorough survey of recent work addressing energy efficient multicast routing protocols and secure multicast routing protocols in Mobile Ad hoc Networks (MANETs). There are so many issues and solutions which witness the need of energy management and security in ad hoc wireless networks. The objective of a multicast routing protocol for MANETs is to support the propagation of data from a sender to all the receivers of a multicast group while trying to use the available bandwidth efficiently in the presence of frequent topology changes. Multicasting can improve the efficiency of the wireless link when sending multiple copies of messages by exploiting the inherent broadcast property of wireless transmission. Secure multicast routing plays a significant role in MANETs. However, offering energy efficient and secure multicast routing is a difficult and challenging task. In recent years, various multicast routing protocols have been proposed for MANETs. These protocols have distinguishing features and use different mechanismsComment: 15 page

HT-Paxos: High Throughput State-Machine Replication Protocol for Large Clustered Data Centers

Paxos is a prominent theory of state machine replication. Recent data intensive Systems those implement state machine replication generally require high throughput. Earlier versions of Paxos as few of them are classical Paxos, fast Paxos and generalized Paxos have a major focus on fault tolerance and latency but lacking in terms of throughput and scalability. A major reason for this is the heavyweight leader. Through offloading the leader, we can further increase throughput of the system. Ring Paxos, Multi Ring Paxos and S-Paxos are few prominent attempts in this direction for clustered data centers. In this paper, we are proposing HT-Paxos, a variant of Paxos that one is the best suitable for any large clustered data center. HT-Paxos further offloads the leader very significantly and hence increases the throughput and scalability of the system. While at the same time, among high throughput state-machine replication protocols, HT-Paxos provides reasonably low latency and response time

Multiuser Diversity Management for Multicast/Broadcast Services in 5G and Beyond Networks

The envisaged fifth-generation (5G) and beyond networks represent a paradigm shift for global communications, offering unprecedented breakthroughs in media service delivery with novel capabilities and use cases. Addressing the critical research verticals and challenges that characterize the International Mobile Telecommunications (IMT)-2030 framework requires a compelling mix of enabling radio access technologies (RAT) and native softwarized, disaggregated, and intelligent radio access network (RAN) conceptions. In such a context, the multicast/broadcast ser vice (MBS) capability is an appealing feature to address the ever-growing traffic demands, disruptive multimedia services, massive connectivity, and low-latency applications. Embracing the MBS capability as a primary component of the envisaged 5G and beyond networks comes with multiple open challenges. In this research, we contextualize and address the necessity of ensuring stringent quality of service (QoS)/quality of experience (QoE) requirements, multicasting over millimeter-wave (mmWave) and sub-Terahertz (THz) frequencies, and handling complex mobility behaviors. In the broad problem space around these three significant challenges, we focus on the specific research problems of effectively handling the trade-off between multicasting gain and multiuser diversity, along with the trade-off between optimal network performance and computational complexity. In this research, we cover essential aspects at the intersection of MBS, radio resource management (RRM), machine learning (ML), and the Open RAN (O-RAN) framework. We characterize and address the dynamic multicast multiuser diversity through low-complexity RRM solutions aided by ML, orthogonal multiple access (OMA) and non-orthogonal multiple access (NOMA) techniques in 5G MBS and beyond networks. We characterize the performance of the multicast access techniques conventional multicast scheme (CMS), subgrouping based on OMA (S-OMA), and subgrouping based on NOMA (S-NOMA). We provide conditions for their adequate selection regarding the specific network conditions (Chapter 4). Consequently, we propose heuristic methods for the dynamic multicast access technique selection and resource allocation, taking advantage of the multiuser diversity (Chapter 5.1). Moreover, we proposed a multicasting strategy based on fixed pre-computed multiple-input multiple-output (MIMO) multi-beams and S-NOMA (Chapter 5.2). Our approach tackles specific throughput requirements for enabling extended reality (XR) applications attending multiple users and handling their spatial and channel quality diversity. We address the computational complexity (CC) associated with the dynamic multicast RRM strategies and highlight the implications of fast variations in the reception conditions of the multicast group (MG) members. We propose a low complexity ML-based solution structured by a multicast-oriented trigger to avoid overrunning the algorithm, a K-Means clustering for group-oriented detection and splitting, and a classifier for selecting the most suitable multicast access technique (Chapter 6.1). Our proposed approaches allow addressing the trade-off between optimal network performance and CC by maximizing specific QoS parameters through non-optimal solutions, considerably reducing the CC of conventional exhaustive mechanisms. Moreover, we discuss the insertion of ML-based multicasting RRM solutions into the envisioned disaggregated O-RAN framework (Chapter 6.2.5). We analyze specific MBS tasks and the importance of a native decentralized, softwarized, and intelligent conception. We assess the effectiveness of our proposal under multiple numerical and link level simulations of recreated 5G MBS use cases operating in μWave and mmWave. We evaluate various network conditions, service constraints, and users’ mobility behaviors