A METHODOLOGY OF FORECASTING DEMANDS OF THE COMMUNICATION TRAFFIC

Author(s):  
T. Matsuda ◽  
T. Maki ◽  
T. Sakamaki ◽  
T. Ura

2009 ◽  
Vol 18 (02) ◽  
pp. 255-269 ◽  
Author(s):  
JUN HO BAHN ◽  
JUNG SOOK YANG ◽  
WEN-HSIANG HU ◽  
NADER BAGHERZADEH

This paper presents parallel FFT algorithms with different degree of computation and communication overheads for multiprocessors in a Network-on-Chip (NoC) environment. Of the three parallel FFT algorithms presented in this paper, we propose two parallel FFT algorithms for a 2D NoC that can contain a variable number of processing elements (PEs) and one is a reference parallel FFT algorithm for comparison. A parallel FFT algorithm we propose increases performance by assigning well-balanced computation tasks to PEs. The execution times are reduced because the algorithm uses data locality well to avoid unnecessary data exchanges among PEs and removes the overall idle periods by2 a balanced task scheduling. An enhanced version of this algorithm is suggested in which communication traffic is reduced. In this algorithm, returning transformed data to an original PE after one computation stage before sending them to a next PE for the following stage is removed. Instead, we propose a method that enables to keep regularity of the data communication and computations with twiddle factors. According to the simulation result from our cycle-accurate SystemC NoC model with a parametrizable 2-D mesh architecture, and the analysis of the algorithms in time and complexity, our proposed algorithms are shown to outperform the reference parallel FFT algorithm and FFT implementations on TI Digital Signal Processors (DSPs) that have similar specifications to our simulation environment.


Author(s):  
Anirban Mondal ◽  
Sanjay Kumar Madria ◽  
Masaru Kitsuregawa

This paper proposes CADRE (Collaborative Allocation and De-allocation of Replicas with Efficiency), which is a dynamic replication scheme for improving the typically low data availability in dedicated and cooperative mobile ad-hoc peer-to-peer (M-P2P) networks. In particular, replica allocation and de-allocation are collaboratively performed in tandem to facilitate effective replication. Such collaboration is facilitated by a hybrid super-peer architecture in which some of the mobile hosts act as the ‘gateway nodes’ (GNs) in a given region. GNs facilitate both search and replication. The main contributions of CADRE are as follows. First, it facilitates the prevention of ‘thrashing’ conditions due to its collaborative replica allocation and de-allocation mechanism. Second, it considers the replication of images at different resolutions to optimize the usage of the generally limited memory space of the mobile hosts (MHs). Third, it addresses fair replica allocation across the MHs. Fourth, it facilitates the optimization of the limited energy resources of MHs during replication. The authors’ performance evaluation demonstrates that CADRE is indeed effective in improving data availability in M-P2P networks with significant reduction in query response times and low communication traffic during replication as compared to a recent existing scheme as well as a baseline approach, which does not consider any replication.


2020 ◽  
Vol 2020 ◽  
pp. 1-16
Author(s):  
Xueyuan Yin ◽  
Xingshu Chen ◽  
Lin Chen ◽  
Hui Li

To satisfy security concerns including infrastructure as a service (IaaS) security framework, security service access, network anomaly detection, and virtual machine (VM) monitoring, a layered security framework is built which composes of a physical layer, a virtualization layer, and a security management layer. Then, two security service access methods are realized for various security tools from the perspective of whether security tools generate communication traffic. One without generating traffic employs the VM traffic redirection technology and the other leveraged the mechanism of multitasking process access. Moreover, a stacked LSTM-based network anomaly detection agentless method is proposed, which has advantages of a higher ratio of precision and recall. Finally, a Hypervisor-based agentless monitoring method for VMs based on dynamic code injection is proposed, which has benefits of high security of the external monitoring method and good context analysis of the internal monitoring mechanism. The experimental results demonstrate the effectiveness of the proposed protection framework and the corresponding security mechanisms, respectively.


Sign in / Sign up

Export Citation Format

Share Document