Multicast Architecture Research Articles

Application of SDN-IP hybrid network multicast architecture in Commercial Aerospace Data Center

Abstract The increasing amount of massive data generated by commercial spacecraft in orbit puts forward higher and higher requirements for the stability, reliability, and computing power of computer systems for commercial aerospace data center. Data center computer systems are gradually transforming from X86 architecture and IP network model to a platform model with cloud computing and software-defined network (SDN) technology. This article proposes a new network architecture based on a unicast/multicast protocol for data interaction between the SDN and IP network. There are three main contributions of this article. The first is that the architecture proposed in this article aims to reduce end-to-end transmission latency and packet loss. The second is to improve the flexibility of system configuration and precise control when the SND controller state changes. The third is to verify the feasibility of deploying network architecture in a real data center environment.

MWAX: A new correlator for the Murchison Widefield Array

AbstractWe describe the design, validation, and commissioning of a new correlator termed ‘MWAX’ for the Murchison Widefield Array (MWA) low-frequency radio telescope. MWAX replaces an earlier generation MWA correlator, extending correlation capabilities and providing greater flexibility, scalability, and maintainability. MWAX is designed to exploit current and future Phase II/III upgrades to MWA infrastructure, most notably the simultaneous correlation of all 256 of the MWA’s antenna tiles (and potentially more in future). MWAX is a fully software-programmable correlator based around an ethernet multicast architecture. At its core is a cluster of 24 high-performance GPU-enabled commercial-off-the-shelf compute servers that together process in real-time up to 24 coarse channels of 1.28 MHz bandwidth each. The system is highly flexible and scalable in terms of the number of antenna tiles and number of coarse channels to be correlated, and it offers a wide range of frequency/time resolution combinations to users. We conclude with a roadmap of future enhancements and extensions that we anticipate will be progressively rolled out over time.

Modulation Method for High-Capacity Fibre Channel Switch and High-Speed Pulse Network Data

Fibre channel (FC) switches are widely used in storage area networks and avionics systems. In this work, the FC protocol, the switching structure and the scheduling algorithm of the FC switch are deeply studied, and a 48-port FC switch is completed on a single-chip field-programmable gate array (FPGA). In addition, an improved scheduling algorithm for Inter-System Link Protocol (iSLP) is proposed for the input and scheduling of optical fiber pulse network data. On this basis, the overall architecture of the FC switch is proposed, the x690tffg1158 FPGA chip is selected, and the FC port control module is designed, which is composed of the receiving controller, the interface state machine, the sending controller, and the flow control. The routing table lookup module of FC switch is designed, the unicast routing table format and multicast routing table format are proposed, and the corresponding unicast and multicast routing table lookup table module architectures are designed. Aiming at the characteristics of high reliability and low distortion in the transmission of high-speed pulse network signals by FC switches, the modulation and demodulation of Bias-T (BIAS-T) are redesigned. The experiment is implemented using Verilog hardware description language (HDL), and Modelsim 10.5 software is adopted to simulate each module of the switch. The switch adopts an 8×N switching structure, which can accurately perform word synchronization. After the link is initialized, the transceivers can send and receive data frames normally. The redesigned BIAS-T is applied to solve the instability of the end of the analog modulation method, and then realize the low distortion and data integrity of the high-speed pulse signal of the FC switch.

QoS-Aware Multicast for Crowdsourced 360° Live Streaming in SDN Aided NG-EPON

The IEEE 802.3ca Task Force group has recently approved the standardization of the next-generation Ethernet passive optical network (NG-EPON) to satisfy future bandwidth demands. NG-EPON architecture classifies the optical network unit (ONU) transmission to allow simultaneous Wavelength-Agile (WA-PON) transmission, which increases the network capacity (50 Gb/s) and flexibility. The recently launched 5G services and related functional standards, new capabilities, and quality of service (QoS) imposed on the optical transport network. The Peer-to-peer (P2P) based live streaming application is the most popular multimedia application in access networks, i.e., Facebook Live, YouTube Live, Twitch, and other streaming and video conferencing services are increasing, especially in global epidemics which requires a higher QoS. Hence, media-based applications require adequate infrastructure resources to meet customer demands such as high bandwidth, low latency, high quality audiovisual, live streaming, and services. Therefore, this paper proposes an SDN enhanced P2P virtual reality (VR) live video streaming application NG-EPON multicast architecture based on 5G-enabled Tactile Internet (TI) and aims to improve the QoS, QoE and provide flexible services to the end-users. Finally, we proposed an SDN-based TI-dynamic wavelength and bandwidth allocation (SD-TI-DWBA) mechanism. Simulation results show that our proposed architecture can improve the system performance and QoS metrics regarding packet delay, jitter, system throughput, and packet loss.

Next-Generation OTT Distribution Architecture Supporting Multicast-Assisted ABR (mABR) and HTTP/3 Over QUIC

<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">The potential audience for streaming media services is massive, but satisfying that kind of demand poses a huge technical challenge. Even if existing content delivery networks (CDNs) were capable of distributing such loads, the costs at that scale would remain beyond the monetary capabilities of any broadcaster. By reducing transmission costs associated with content delivery at scale, broadcasters would pay less to the CDNs, making the content cheaper to the end user. In traditional broadcasting technologies, a majority of commercially available content distribution architectures are based on a paradigm rooted in linear broadcast services, having a very basic media service composition, solely focusing on the delivery of content interpretable on a vast amount of compatible TV sets with built-in tuners.While this helped transform the industry by facilitating the transition from analogue to digital broadcast content distribution, it now leaves content providers and broadcast network operators wondering how they can remain relevant in the age of web and internet streaming. This article will take its point of departure in evolved content distribution systems and the resulting system architectures for next-generation broadcast over-the-top (OTT) live and on-demand streaming. It will focus on a solution for efficient and secure transport of well-known low-latency streaming protocols by employing QUIC as a primary transport protocol for the industry leading IP multicast architectures supporting multicast-assisted adaptive bitrate (mABR) streaming, enabled by novel HTTP/3 server push techniques. At scale, the solution could significantly reduce the amount of open streaming sessions, improving the scalability of existing audio–video streaming architectures, and reducing the wastage of scarce bandwidth. Placing physical gateway boxes within users’ home network that fully support QUIC and multicast content reception can reduce the prevalent lack of user agent support for reception of multicast QUIC content. This new model with the core transport protocol based on QUIC will be the foundation for unified content distribution architectures, spanning internet streaming, IPTV, 5G, and the latest ATSC and DVB physical layers, allowing for an efficient, IP-based delivery of linear content to thin clients.</i>

A Multicast Routing Scheme for the Internet: Simulation and Experimentation in Large-Scale Networks

With the globalisation of the multimedia entertainment industry and the popularity of streaming and content services, multicast routing is (re-)gaining interest as a bandwidth saving technique. In the 1990’s, multicast routing received a great deal of attention from the research community; nevertheless, its main problems still remain mostly unaddressed and do not reach the acceptance level required for its wide deployment. Among other reasons, the scaling limitation and the relative complexity of the standard multicast protocol architecture can be attributed to the conventional approach of overlaying the multicast routing on top of the unicast routing topology. In this paper, we present the Greedy Compact Multicast Routing (GCMR) scheme. GMCR is characterised by its scalable architecture and independence from any addressing and unicast routing schemes; more specifically, the local knowledge of the cost to direct neighbour nodes is enough for the GCMR scheme to properly operate. The branches of the multicast tree are constructed directly by the joining destination nodes which acquire the routing information needed to reach the multicast source by means of an incremental two-stage search process. In this paper we present the details of GCMR and evaluate its performance in terms of multicast tree size (i.e., the stretch), the memory space consumption, the communication cost, and the transmission cost. The comparative performance analysis is performed against one reference algorithm and two well-known protocol standards. Both simulation and emulation results show that GCMR achieves the expected performance objectives and provide the guidelines for further improvements.

Building Scalable and Secure Multicast Delivery Infrastructure in a Local Area Network

Internet Protocol (IP) multicasting is a method for one-to-many and many-to-many communication between hosts in an IP network. This communication happens in a real-time synchronous fashion. It is a useful mechanism for distributing management data in a Local Area Network (LAN). Management data includes frequent updating of host Operating System (OS), security patches, OS update for network hardware, new configuration updates, etc. In the absence of any admission control or a source identification, any host with malicious intent can disseminate malicious codes or rootkits exploiting the underlying multicast framework. Routing protocols like RIPv2 and OSPF use a certain form of authentication to exchange routing information with their peer routers. However, their authentication and the distribution of routing information in its present form has several security and performance-related issues. Motivated through these problems, in this paper, we propose an efficient and scalable multicast architecture for distributing management and routing information in a LAN. We use Core-based Tree (CBT) for constructing the multicast delivery tree and the pseudo identity-based encryption of the underlying cryptosystem. We also demonstrate that our proposed multicast architecture is immune to a number of popular attacks.

A QoE-Driven Multicast Strategy With Segment Routing—A Novel Multimedia Traffic Engineering Paradigm

Quality of Experience (QoE) reflects end users' overall experience and feeling with network services, but needs support in terms of end-to-end Quality of Service (QoS). Segment routing (SR) as a new routing paradigm can provide good end-to-end QoS guarantee, making traditional multimedia traffic routing more efficient and scalable. In this paper, we address two problems related to the new SR mechanism: enabling fine-grained end-to-end QoS routing under a complex network environment and constructing the multicast routing tree with branch node load balancing. To solve these problems, an Inaccurate information-based QoE-driven Routing algorithm (IQdR) and a Branch-aware Multicast Tree (BaMT) algorithm were proposed. Simulation test results that have compared the performance of our proposed solution against that of other algorithms show that the previous works were outperformed. Additionally, the results also show that our multicast architecture improves the scalability of the network in terms of the number of flows.

Low latency multicasting architecture implemented using new network topology

An important service in distributed systems, as multiprocessors, is the ability to transmit multicast messages. Cache coherence protocols and parallel algorithms are examples of applications requiring multicast messages. Several algorithms have been developed to implement multicasting namely the path based, and the tree based. These algorithms were able to ease the rapid saturation effect generated by such type of transmission. However, for some applications, these algorithms are not always efficient, and the multicast service might still generate the network saturation for low data loads. That's why recent studies have tried to apply these routing algorithms using a new network topology based on 3D integrated circuit technology (3DIC) . However, the 3DIC has not reached maturity because of the use of multiple number of TSV (through silicon vias).In this paper, we demonstrate the benefits of implementing adaptive multicast algorithm on a VRNOC architecture. Simulations and hardware synthesis results show that the proposed on-chip network architecture provides significant improvements in average network latency (15%) and resources (33% in number of links) than a fully 3D NOC.

A directional multicasting-based architecture for wireless sensor networks

ABSTRACTEnergy scarcity, limited transmission range and interference are the primary challenges that need to be considered judiciously for Wireless Sensor Networks (WSNs). Directional data transmission can improve the network capacity as well as the network lifetime by facilitating spatial multiplexing and range extension, which inherently yields interference reduction, as the result of concurrent data transmissions. Another promising method of achieving energy conservation is the transmission power control. Transmission power control also contributes to the mitigation of interference thereby promotes throughput by means of rendering multiple hosts to communicate in the same directionality simultaneously without impairing each other’s transmissions. Harnessing the antenna directionality with dynamic power control gives the opportunity to WSNs to consume their scarce energy resources in a more efficient manner. In this article, we propose an energy efficient multi-cast routing-based architecture (MRBA). This architecture mainly bases on the idea of multi-cast routing methodology with hop-by-hop data fragmentation and power-controlled directional transmission. Multiple next-hop utilization during packet transmission together with directional relaying of the sub-packets provide interference reduction together with fair data transfer load sharing among the nodes. Simulation results show that significant improvements can be achieved in terms of energy saving and end-to-end delay enhancement with respect to omnidirectional architectures.

All-Optical Wavelength Multicasting in Quadruple Resonance-Split Coupled Silicon Microring Cavity

We demonstrate an all-optical four-channel wavelength multicasting in a coupled silicon microring resonator system. The scheme is based on two-photon-absorption-induced free carrier dispersion in silicon. The coupled cavity facilitates resonance splitting that is utilized as individual channels for multicasting. Using the split resonances, we achieve an aggregate multicasted data rate of 48 Gbps (4 × 12 Gbps). Moreover, we also present a detailed analysis and performance of the multicasting architecture using bit error rate and eye diagram measurements.

Design and performance evaluation of mixed multicast architecture for internet of things environment

Internet of things (IoT) has become one of the most important fields in computing arena. The environments of IoT require highly efficient, immediate and worldwide communication services. Accordingly, efficient multicast routing architecture is a fundamental premise for IoT. This paper proposes a mixed multicast architecture for IoT environments that employs the centric, hierarchical, and distributed traditional multicast architectures. The aim is to determine the most suitable traditional multicast architecture, relative to the current state of the IoT system. First, an algorithm to manage the proposed multicast architecture is introduced. Then, an IoT case study for each traditional multicast architecture is demonstrated. Finally, a simulation environment is established, using the network simulator package NS2, to measure the performance of the proposed architecture. The considered performance metrics are end-to-end delay, packet loss, throughput, energy consumption, and transformation rate between traditional multicast architectures. The results demonstrate the superiority of the proposed architecture relative to individual traditional multicast architectures.

Networking Issues for 3D Medical Collaborative Virtual Environments: Design and Applications

Collaborative Virtual Environments (CVEs) are Virtual Reality (VR) systems and can simulate medical procedures such as surgeries performed by a group of remote users which can interact with one another through the simulation in real-time, with the aid of a network such as the Internet.Therefore, it is important to note that research on CVE-specific networking issues allows us to better understand the requirements for real-time applications. This paper discloses design and implementation issues of a peer-to-peer multicast architecture on the collaborative module of theCyberMed VR framework, aiming at providing better network scalability, as well as it shows as results, some developed applications as validation. Finally, we compared the performance of the newly implemented peer-to-peer multicast architecture with the peer-to-peer unicast previously existent with simulated models designed with OPNET Network Modeler and R statistical software. As result of our experiments, the null hypothesis was rejected (p = 2.2e-16, level of significance = 5%) confirming what we expected about the behavior of CyberMed’s multicast protocol.

Editors’ Note

It is our pleasure to introduce you the second issue of JIS in 2017. This issue contains six papers of the Special Issue of the 15th Brazilian Symposium on Human Factors in Computing Systems (IHC 2016). As we have been doing since IHC 2014, the best papers of the conference are invited to submit extended versions to a special issue of JIS, guest edited by the conference program chairs. In the current publication, our guest editors are Profs. Carla Leitão, from Pontifícia Universidade Católica - Rio de Janeiro (PUC-Rio), and Luciana Salgado, from Universidade Federal Fluminense (UFF), who we thank a lot for the dedication in the preparation of this issue. We invited you to read their editorial in the following.We also have in this issue an original paper by Paulo Paiva, Liliane Machado, Jauvane de Oliveira, and Ronei de Moraes, entitled “Networking Issues for 3D Medical Collaborative Virtual Environments: Design and Applications”. The authors discuss specific networking issues for Collaborative Virtual Environments (CVEs) applied to the simulation of medical procedures. They designed, developed, and validated a peer-to-peer multicast architecture on the collaborative module of the CyberMed Virtual Reality framework, aiming at providing better network scalability.Finally, we would like to thank the authors and reviewers that contributed to JIS. At the end of the issue we acknowledge the reviewers that contributed to JIS in 2015, 2016, and 2017.JIS Editorial Board is looking forward to receiving your contributions. We hope you enjoy reading this issue!

Secure receiver access control for IP multicast at the network level: Design and validation

The classical service model of IP multicast is open; anyone can receive multicast data. When using this model, it is impossible to ensure that receivers are authorized to receive the data, or (if appropriate) to generate any revenue from a service based on open multicast. This has resulted in restricted deployment of IP multicast.We have developed a secure IP multicast architecture to enforce receiver access control at two levels: application level and network level. This paper addresses the design and validation of the solution at the network level. The design starts from four assumptions, which express the independence of the network-level solution from the previous work at the application level. At the network level, receiver access control is achieved using two proposed protocols: Secure Internet Group Management Protocol (SIGMP) and Group Security Association Management (GSAM) protocol.SIGMP is an extension to IGMP, in which the messages that are related to secure groups are protected by IPsec Group Security Associations (GSAs). GSAM manages the IPsec GSAs used in SIGMP and couples the network-level access control with the application-level access control.The design requirements for SIGMP and for GSAM are expressed in terms of Design Criteria and Security Goals. These design requirements are then used to justify the final design. Several security properties of GSAM have been formally validated using AVISPA and the remaining security properties of our proposal have been analyzed.

A novel scheme for secure group communication in multicast network

Group key management is an important framework and functional building block for any secure multicast architecture. To improve the performance and scalability of rekeying for group key management in large-scale systems, a novel scheme was proposed. In this paper, we present dynamic and large-scale groups, and the overhead of key generating and key updating is usually relevant to the group size, which becomes a performance bottleneck in achieving scalability. The overhead of key management can be shared by the sub-group controller (SGC) and group controller, and in addition, the new protocol conduces to constant computation and communication overhead during rekeying and enhances more security. Users in the systems are grouped into sub-groups based on their subscription span. The inter-group and intra-group communication is done with the help of group key and sub-group key, respectively. An analysis shows that the cost of rekeying operations is reduced and security breaches have been reduced with the proposed group key management.

Efficient round‐robin multicast scheduling for input‐queued switches

The input-queued (IQ) switch architecture is favoured for designing multicast high-speed switches because of its scalability and low implementation complexity. However, using the first-in-first-out (FIFO) queueing discipline at each input of the switch may cause the head-of-line (HOL) blocking problem. Using a separate queue for each output port at an input to reduce the HOL blocking, that is, the virtual output queuing discipline, increases the implementation complexity, which limits the scalability. Given the increasing link speed and network capacity, a low-complexity yet efficient multicast scheduling algorithm is required for next generation high-speed networks. This study proposes the novel efficient round-robin multicast scheduling algorithm for IQ architectures and demonstrates how this algorithm can be implemented as a hardware solution, which alleviates the multicast HOL blocking issue by means of queue look-ahead. Simulation results demonstrate that this FIFO-based IQ multicast architecture is able to achieve significant improvements in terms of multicast latency requirements by searching through a small number of cells beyond the HOL cells in the input queues. Furthermore, hardware synthesis results show that the proposed algorithm can be very efficiently implemented in hardware to perform multicast scheduling at very high speeds with only modest resource requirements.

Zone Based Secure Multicast Architecture for Intra-Cluster Communication in MANET

In mobile ad hoc networks (MANETs) in order to enhance efficiency, the multicast MANET is used for a sender node, which sends data packets to a number of nodes in the network through a multicast session. Due to the complicatedness in zone membership management and multicast packet forwarding over a dynamic topology, completion of efficient and scalable multicast with security in MANET becomes a challenge. In order to achieve a secure multicast architecture for MANETS, in this paper, we propose a Zone based Secure Multicast Architecture for Intra-cluster Communication in MANET. Initially, cluster creation is performed. Then, in a broad environment, a zone-based bidirectional tree is constructed and the zone leader is elected using trust value. Trust value is estimated from the Markov trust model. Finally, the secure voting process in the selected zone leader is made by using the elliptic curve discrete algorithm (ECDSA).

An IPv6 Security Multicast System Based on CA Authentication

To deploy network components of a security multicast which is based on the multicast group security architecture and its key management architecture, an IPv6 security multicast system using CA authentication is designed. The multicast group members use CA certificate to access network, while the role of Group Controller/key Server deployed in the network is to establish and manage the group key and negotiate SA with multicast source. The proposed scheme solves the problem of components deployment of multicast system with security, and has strong scalability as well which means various multicast protocols and group management protocols can run on this system.

English

Group key management is an important functional building block for any secure multicast architecture. In this regards, it is identified some security issues in the group key management when a user join or leave the group then forward secrecy and backward secrecy issues comes in the multicast networks. This paper provides an efficient and improve mechanism for group key management solutions with computational and communication overhead are less while rekeying cost also minimize