Search

The named data networking (NDN)-based microservice-centric in-network computation poses various challenges in terms of interest aggregation and pending interest table (PIT) lifetime management. A same-named microservice-centric interest packet may have a different number of input parameters with nonidentical input values. In addition, the same-named interest packet with the same number of parameters may have different corresponding parameter values. The vanilla NDN request aggregation (based on the interest name, while ignoring the input parameters count and/or their corresponding values) may result in false aggregation. Moreover, the microservice-centric requested computations may fail to accomplish in the default 4s PIT timer due to the input size. To address these challenges, this paper presents MIA-NDN: microservice-centric interest aggregation in named data networking. We designed microservice-centric interest-naming to enable name-based communication. MIA-NDN develops a robust interest aggregation mechanism that not only performs the interest aggregation based on the interest name but also considers the input parameter counts and their corresponding values in the interest aggregation process to avoid false packet aggregations. A dynamic PIT timer mechanism based on input size was devised that avoids the PIT entry losses if the execution time exceeds the default PIT timer value to avoid computation losses and uphold the application quality of service (QoS). Extensive software-based simulations confirm that the MIA-NDN outperforms the benchmark scheme in terms of microservice-centric interest aggregation, microservice satisfaction rate, and communication overhead. [ABSTRACT FROM AUTHOR]

Recently food shortage has become the major flagging scenario around the globe. To resolve this challenge, there is dire need to significantly increase crop productivity per unit area. In the present study, 24 genotypes of rice were grown in pots to assess their tillering number, number of primary and secondary branches per panicle, number of grains per panicle, number of grains per plant, and grain yield, respectively. In addition, the potential function of miR156 was analyzed, regulating seed sequence in rice. Furthermore, OsSPL14 gene for miR156 was sequenced to identify additional mutations within studied region. The results demonstrated Bas-370 and L-77 showed highest and lowest tillers, respectively. Bas-370, Rachna basmati, Bas-2000, and Kashmir Basmati showed high panicle branches whereas, L-77, L-46, Dilrosh, L-48, and L-20 displayed lowest panicle branches. Bas-370 and four other studied accessions contained C allele whereas, L-77 and 18 other investigated accessions had heterozygous (C and T) alleles in their promoter region. C-T allelic mutation was found in 3rd exon of the OsSPL14 gene. The sequence analysis of 12 accessions revealed a novel mutation (C-T) present ~2bp upstream and substitution of C-A allele. However, no significant correlation for novel mutation was found for tillering and panicle branches in studied rice accessions. Taken together present results suggested novel insight into the binding of miR156 to detected mutation found in 3rd exon of the OsSPL14 gene. Nevertheless, L-77, L-46, Dilrosh, L-48, and L-20 could be used as potential breeding resource for improving panicle architecture contributing yield improvement of rice crop. [ABSTRACT FROM AUTHOR]

Recent years have witnessed the huge popularity of Information-Centric Networking (ICN) and its realization as Named Data Networking (NDN) in the context of wireless sensor networks (WSNs). The participating nodes in WSNs are usually equipped with a single radio interface. The existing solutions lack in providing the efficient next forwarder selection in NDN-based single radio WSNs. In this work, we propose a collaborative Interest and Data Forwarding (CIDF-WSN) Strategy for Named Data Wireless Sensor Networks. CIDF-WSN develop a Neighbor Information Base (NFIB) which enables the node to select the optimal next-hop relay in Interest packet forwarding. An efficient Interest packet processing mechanism assisted by the Interest Cache Table (ICT) is provided to avoid Interest packets loss and frequent re-transmissions. In addition, CIDF-WSN also provides a robust Data packet transfer mechanism accompanied by the Temp Cache Table (TCT) to avoid Data packet losses and to ensure well-timed content delivery. Simulation results reveal that CIDF-WSN outperforms the recently published works in terms of Interest satisfaction rate, total energy consumption, Data retrieval delays, and communication overhead. [ABSTRACT FROM AUTHOR]

The participating nodes in Wireless Sensor Networks (WSNs) are usually resource-constrained in terms of energy consumption, storage capacity, computational capability, and communication range. Energy is one of the major constraints which requires an efficient mechanism that takes into account the energy consumption of nodes to prolong the network lifetime. Particularly in the large scale heterogeneous WSNs, this challenge becomes more critical due to high data collection rate and increased number of transmissions. To this end, clustering is one of the most popular mechanisms which is being used to minimize the energy consumption of nodes and prolong the lifetime of the network. In this paper, therefore, we propose a robust clustering mechanism for energy optimization in heterogeneous WSNs. In the proposed scheme, nodes declare themselves as cluster head (CH) based on available resources such as residual energy, available storage and computational capability. The proposed scheme employs the multi criteria decision making technique named as Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) which allows the child nodes to select the optimal CH among several potential CH candidates. Moreover, we also propose mechanisms such as CH-acquaintanceship and CH-friendship in order to prolong the network lifetime. Simulation results show that our proposed scheme minimizes the control overhead, reduces the power consumption and enhances overall lifetime of the network by comparing with the most recent and relevant proposed protocol for WSNs. [ABSTRACT FROM AUTHOR]

In recent years, cloud computing has emerged as a promising paradigm providing various resources in the Cloud Data Center (CDC), including computations, storage, and even platform as a service. The virtualization technology plays a pivotal role in CDC resources management and provides an enchanting feature of virtual machine (VM) migration which provides several benefits in terms of VM scheduling, fault tolerance, load balancing, energy efficiency, power management, and security. To achieve efficient VM migration, a plethora of VM migration schemes have been proposed in the literature aiming to serve the quality of service-driven user requirements. This paper surveys the most recent and state-of-the-art Artificial Intelligence (AI) based and conventional load balancing, energy-aware, SLA aware, and network-aware live VM migration schemes. Through an extensive literature review, this paper investigates the most critical aspects of conventional and AI-driven live VM migration schemes. Finally, a few open research challenges that require further consideration from the research community are highlighted. [Display omitted] • Overview of cloud computing, data centers, virtualization, and VM migration. • Conventional and AI-based Live VM migration schemes categorization. • Live VM migration survey of load, energy, SLA, and network schemes. • VM migration analysis based on migration cost and AI benefits and drawbacks. • Live VM migration research challenges and future directions. [ABSTRACT FROM AUTHOR]