Hierarchical Naming Research Articles

Search mechanism for data contents based on bloom filter and tree hybrid structure in system wide information management

AbstractThe system wide information management (SWIM) system infrastructure layer uses information‐centric networking (ICN) to implement the cache routing and sharing of air traffic information data. The SWIM network searches and forwards routes on the basis of content names. The variable length, hierarchical name structure, and routing updates caused by the frequent publication and deletion of content make the implementation of fast name routing lookup algorithms a significant but arduous task. To address this problem, this study designed a name matching mechanism on the basis of the hybrid structure of the Bloom filter and the Tree. Compared with the traditional Bloom filter search scheme, this search mechanism reduces the quantity of Bloom filter insertion entries and reduces the possibility of hash collisions. Compared with the traditional Tree search scheme, the proposed mechanism can effectively solve the problem of numerous memory accesses caused by extremely long name prefixes, improving the query efficiency. In addition, the proposed composite structure is compared with several methods, such as DIPIT and NPT, by analyzing the effects of layering, global delay and search speed. The experimental results show that the proposed structure has a favourable performance in terms of storage overhead and search speed.

An advanced sequence clustering and designation workflow reveals the enzootic maintenance of a dominant West Nile virus subclade in Germany.

West Nile virus (WNV) is the most widespread arthropod-borne (arbo) virus and the primary cause of arboviral encephalitis globally. Members of WNV species genetically diverged and are classified into different hierarchical groups below species rank. However, the demarcation criteria for allocating WNV sequences into these groups remain individual and inconsistent, and the use of names for different levels of the hierarchical levels is unstructured. In order to have an objective and comprehensible grouping of WNV sequences, we developed an advanced grouping workflow using the 'affinity propagation clustering' algorithm and newly included the 'agglomerative hierarchical clustering' algorithm for the allocation of WNV sequences into different groups below species rank. In addition, we propose to use a fixed set of terms for the hierarchical naming of WNV below species level and a clear decimal numbering system to label the determined groups. For validation, we applied the refined workflow to WNV sequences that have been previously grouped into various lineages, clades, and clusters in other studies. Although our workflow regrouped some WNV sequences, overall, it generally corresponds with previous groupings. We employed our novel approach to the sequences from the WNV circulation in Germany 2020, primarily from WNV-infected birds and horses. Besides two newly defined minor (sub)clusters comprising only three sequences each, Subcluster 2.5.3.4.3c was the predominant WNV sequence group detected in Germany from 2018 to 2020. This predominant subcluster was also associated with at least five human WNV infections in 2019-20. In summary, our analyses imply that the genetic diversity of the WNV population in Germany is shaped by enzootic maintenance of the dominant WNV subcluster accompanied by sporadic incursions of other rare clusters and subclusters. Moreover, we show that our refined approach for sequence grouping yields meaningful results. Although we primarily aimed at a more detailed WNV classification, the presented workflow can also be applied to the objective genotyping of other virus species.

Collaborative Storage and Resolution Method between Layers in Hierarchical ICN Name Resolution Systems

Name resolution system is an important infrastructure in Information Centric Networking (ICN) network architecture of identifier–locator separation mode. In the Local Name Resolution System (LNMRS), a hierarchical name resolution system for latency-sensitive scenarios; higher-level resolution nodes serve more users and suffer more storage pressure, which causes the problem of unbalanced storage load between layers, and requires inter-layer collaborative storage under the constraint of deterministic service latency characteristics. In this paper, we use the constraints required for inter-layer collaborative resolution to construct an index neighbor structure and perform collaborative storage based on this structure. This method relieves storage pressure on high-level resolution nodes. Experimental results show that the increase of total storage load brought by the proposed method is 57.1% of that by MGreedy algorithm, 8.1% of that by Greedy algorithm, and 0.8% of that by the K-Mediod algorithm when relieving the same storage load for high-level resolution nodes. Meanwhile, deterministic service latency feature is still sustained when our proposed method is used for collaborative resolution.

Data Naming Mechanism of LEO Satellite Mega-Constellations for the Internet of Things

The low earth orbit (LEO) mega constellation for the internet of thing (IoT) has become one of the hot spots for B5G and 6G concerns. Information-centric networking (ICN) provides a new approach to the interconnection of everything in the LEO mega constellation. In ICN, data objects are independent of location, application, storage and transport methods. Therefore, data naming is one of the fundamental issues of ICN, and research on the data naming mechanism of the LEO mega constellation for the IoT is thus the focus of this study. Adopting a fusion of hierarchical, multicomponent, and hash flat as one structure, a data naming mechanism is proposed, which can meet the needs of the IoT multiservice attributes and high-performance transmission. Additionally, prefix tokens are used to describe hierarchical names with various embedded semantic functions to support multisource content retrieval for in-network functions. To verify the performance of the proposed data naming mechanism, an NS-3-based simulation platform for LEO mega constellations for the IoT is designed and developed. The test simulation results show that, compared with the IP address, the ICN-HMcH naming mechanism can increase throughput by as much as 54% and reduce the transmission delay of the LEO mega satellites for the IoT by 53.97%. The proposed data naming mechanism can provide high quality of service (QoS) transmission performance for the LEO mega constellation for IoT and performs better than IP-based transmission.

Dynamic Naming Scheme and Lookup Method Based on Trie for Vehicular Named Data Network

Content naming and lookup are decisive functions of the future architecture named data network (NDN). The core concept of NDN is the content distribution between consumers and content providers. The NDN supports advance vehicular networks that is famous with vehicular-named data network (VNDN) with different naming schemes such as hybrid, flat, attribute-based, and hierarchical names. These schemes are used in a static way for vehicular network, in summary, the hybrid, flat, and attribute-based makes a complex structure, and on the other hand, hierarchical names long in length and name lookup performance are a bottleneck in NDN, which can directly affect the network performance. Therefore, we introduce a dynamic naming scheme and lookup method (DNSL) for VNDN to mitigate these issues. We argue that the dynamic naming scheme is a better approach to VNDN, while the static name is a cost-effective, hefty, integrated fashion, and improper for the vehicular network. This study focuses on (1) a dynamic naming scheme using dynamic-tag and (2) a lookup method based on node partition of trie; the trie approach is very famed in data structure and extensively used for the lookup content, insertion, and deletion processes. Our experimental evaluation shows that the DNSL scheme is highly efficient, scalable, and provably correct for VNDN.

Hierarchical Naming Scheme in Named Data Networking for Internet of Things: A Review and Future Security Challenges

The proliferation of connected devices in the Internet of Things (IoT) presents a connectivity challenge. The future internet will require a paradigm shift in which content is evaluated on the basis of “What” it is rather than “Where” it originated. ICN’s goal is to provide the benefits of name-based content addressing in order to facilitate scalable content distribution, security, mobility, and trust. NDN is a new internet architecture that evolved from Content-Centric Networking (CCN). NDN is viewed as a solution to the IoT’s challenges, as well as a way to transcend the IP paradigm. With IoT systems that had a number of challenging characteristics to satisfy, including heterogeneous devices, resource constraints, and energy efficiency. Due to the fact that NDN native features deliver data via hierarchically structured names, it offer promising solutions for current research integrating NDN into IoT. The review discusses the significance of naming, its influence, and security factor. Additionally, research challenges in the areas of naming and security will be discussed. The primary objective of this review is to give a new facelift to a new integrating naming convention for NDN.

As above, so below: Whole transcriptome profiling demonstrates strong molecular similarities between avian dorsal and ventral pallial subdivisions.

Over the last two decades, beginning with the Avian Brain Nomenclature Forum in 2000, major revisions have been made to our understanding of the organization and nomenclature of the avian brain. However, there are still unresolved questions on avian pallial organization, particularly whether the cells above the vestigial ventricle represent distinct populations to those below it or similar populations. To test these two hypotheses, we profiled the transcriptomes of the major avian pallial subdivisions dorsal and ventral to the vestigial ventricle boundary using RNA sequencing and a new zebra finch genome assembly containing about 22,000 annotated, complete genes. We found that the transcriptomes of neural populations above and below the ventricle were remarkably similar. Each subdivision in dorsal pallium (Wulst) had a corresponding molecular counterpart in the ventral pallium (dorsal ventricular ridge). In turn, each corresponding subdivision exhibited shared gene co‐expression modules that contained gene sets enriched in functional specializations, such as anatomical structure development, synaptic transmission, signaling, and neurogenesis. These findings are more in line with the continuum hypothesis of avian brain subdivision organization above and below the vestigial ventricle space, with the pallium as a whole consisting of four major cell populations (intercalated pallium, mesopallium, hyper‐nidopallium, and arcopallium) instead of seven (hyperpallium apicale, interstitial hyperpallium apicale, intercalated hyperpallium, hyperpallium densocellare, mesopallium, nidopallium, and arcopallium). We suggest adopting a more streamlined hierarchical naming system that reflects the robust similarities in gene expression, neural connectivity motifs, and function. These findings have important implications for our understanding of overall vertebrate brain evolution.

A Hybrid SWIM Data Naming Scheme Based on TLC Structure

Aiming at the problem of low interconnection efficiency caused by the wide variety of data in SWIM (System-Wide Information Management) and the inconsistent data naming methods, this paper proposes a new TLC (Type-Length-Content) structure hybrid data naming scheme combined with Bloom filters. This solution can meet the uniqueness and durability requirements of SWIM data names, solve the “suffix loopholes” encountered in prefix-based route aggregation in hierarchical naming, and realize scalable and effective route state aggregation. Simulation verification results show that the hybrid naming scheme is better than prefix-based aggregation in the probability of route identification errors. In terms of search time, this scheme has increased by 17.8% and 18.2%, respectively, compared with the commonly used hierarchical and flat naming methods. Compared with the other two naming methods, scalability has increased by 19.1% and 18.4%, respectively.

TAC: A unified trust anchor framework based on consortium blockchain

In the current network, there are still many security issues, such as identity fraud and address spoofing. In traditional Public Key Infrastructure(PKI), most trust models adopt a centralized trust model with a single-point trust anchor. The existing PKI system lacks a unified authentication framework and is low efficiency. Aiming at the problems of how to store public keys efficiently and how to make the network secure and trustworthy, this paper proposes a new trust anchor framework based on consortium blockchain, named Trust Anchor Chain(TAC). This study uses the form of consortium to manage TAC, proposes a hierarchical naming ID, named TAC ID to uniquely identify the user in TAC, and proposes a new data structure, named Struct Radix Trie, to store public key information in TAC to improve efficiency. Section 4, TAC has superiority through the comparison between local experiments and remote experiments. In TAC, users can access each other in the TAC, get the public key, and ensure the correctness of the identity. All users work together to maintain TAC to achieve equal network interconnection, security and credibility.

HAC: Enable High Efficient Access Control for Information-Centric Internet of Things

Information-centric networking (ICN) is regarded as a promising architecture for Internet of Things (ICN-IoT) and access control is one of the critical problems to enable secure ICN-IoT. This article proposes high efficient access control (HAC), a high efficient access control system for ICN-IoT. Specifically, HAC enables access control via an elaborate designed hierarchical key tree (HKT) mechanism based on the hierarchical naming scheme of ICN. The proposed HKT contains the hierarchical authority information and allow users to locally derive the key according to their needs, thus greatly decreasing the overhead in IoT’s many-to-many communication scenario. To ensure the security and efficiency of HKT, we further propose a level-oriented ciphertext policy attribute-based encryption (LOCP-ABE) algorithm such that users can only obtain the authority level according to their attributes, and also utilize the ICN’s receiver-driven model and the in-network caching mechanism to speed up the distribution efficiency. Moreover, an attribute-based command verification mechanism is used to improve the efficiency of command verification for resource-constrained and isolated IoT edge. We evaluate the proposed HAC by theoretical security analysis and real-world experiments. The theoretical analysis proves that the proposed HAC is secure and experiment results show that HAC can greatly improve the access control efficiency in ICN-IoT compared with the state of the art.

The Beginning of the Kharkiv Pantheon Formation (on the Materials of Travel Guides of the Second Half of the 19th – Early 20th Centuries)

The author explores the issue of forming the "pantheon" of the most prominent figures in the history of Kharkiv. To this end, Soviet city guides were analyzed. The names found on the guide pages have been recorded in the appropriate database. The author stated the principles of construction of this database and possible interpretations of the obtained results. It contains two fields - "faces" and "mentions". In the first box, those names found on the guide pages were recorded, and in the second box, those ratings that accompany a specific name were recorded. Along with fixing a person's name, a social or professional characteristic (scientist, military, architect, statesman, etc.) was also mentioned. In the "mention" field, depending on the nature of the mention of a person, a coefficient was stated: if the name was mentioned without a rating, it is a factor # 1 (1 point), a combination with such epithets as "known", "prominent" and the like – a factor # 2 (2 points), more or less a detailed characteristic of the activity, first of all from the point of view of impact on the development of the city – factor # 3 (3 points). As a result, it allowed to create a certain hierarchical name system and to separate "TOP-10" of them. In the long run, it will allow you to see a system of names in the dynamics, when some persons will fall out of the list of leaders at certain periods and others will be included in this list. It will also be important to capture changes in terms of increasing or decreasing attention to a particular category of people (social and professional characteristics). In total, more than 650 people were included in the database. The author concluded that in the early 20th century the guides less mentioned statesmen and local administrators, and more of artists, architects, and scientists. Also, the article states that in the late 19th and early 20th centuries the list of "local heroes" in Kharkiv has just begun to form. This can be explained by the absence of some known persons in the TOP-10 list. This is partly due to the fact that the guide genre itself has not yet been completed, and the first guides rather resembled information directories and were thematically imbalanced. Nevertheless, this material can be used in studying the initial stage of assembly of the "Kharkiv Pantheon".

NINQ: Name-Integrated Query Framework for Named-Data Networking of Things.

Information-Centric Networking (ICN) is a paradigm shift from host-to-host Internet Protocol (IP)-based communication to content-based communication. In ICN, the content-retrieval process employs names that are given through different naming schemes such as hierarchical, flat, attribute, and hybrid. Among different ICN architectures, Named-Data Networking (NDN) has gained much interest in the research community and is actively being explored for the Internet of Things (IoT) and sensor networks, and follows a hierarchical naming format. NDN protocol follows a pull-based communication model where the content consumer gets content irrespective of the location of the content provider. The content provider in NDN and sensor networks can be considered to be a distributed database that monitors or controls the environment and caches the sensed data or controls information into their memory. The proposed Name-INtegrated Query (NINQ) framework for NDN-based IoT provides a flexible, expressive, and secure query mechanism that supports content retrieval as well as control and configuration command exchange among various nodes in a smart building. Different use cases are presented in this paper that expand on the behavior of proposed query framework in different scenarios. Simulation results of data collection and exchange of control commands show that proposed query framework significantly improves Interest Satisfaction Rate (ISR), Command Satisfaction Rate (CSR), energy efficiency, and average delay. Moreover, it is evident from the simulation results that proposed query framework significantly reduces the number of transmissions in the network in both data collection and exchange of control command scenarios, which improves the network performance.

OpenCache: A lightweight regional cache collaboration approach in hierarchical-named ICN

Information-centric networking (ICN) names contents instead of end-nodes and enables in-network caching to reuse those named packets, thus improving the efficiency of content delivery. On-path caching is an inherent feature in ICN, which caches contents along the path from providers to consumers, while off-path caching is not directly supported and its maintenance normally requires non-trivial overhead. In this paper, we propose a lightweight regional cache collaboration approach, called OpenCache, to sharing popular cached data among small-range caches with least cache information exchanges, especially for hierarchical-named ICN. Different from other available solutions, OpenCache enables collaborators to exchange aggregated hierarchical names (i.e., prefixes), instead of data structures summarized from separated and specific data names, to fundamentally reduce the collaborating cost of communication and maintenance. In addition, our approach exploits forwarding information base (FIB) to selectively relay Interest packets to nearby collaborative routers for low-cost data retrieval. Theoretical analyses and extensive experiments have been conducted to evaluate our scheme and the results show that OpenCache can reduce packet latency in retrieving data by about 38% compared to original ICN while its additional collaborating overhead is only around 15% of other schemes. Our approach explores the feasibility of lightweight collaboration with aggregation of hierarchical names.

Local Name Translation for Succinct Communication Towards Named Data Networking of Things

Scalable and hierarchical naming on contents enables the flexibility of named data networking of things towards globally massive data and applications. However, the side effects of frequent packet fragmentation across layers and thus non-trivial traffic overhead are unavoidable due to scalable and unlimited-length names. In this letter, a local name translation (LAT) is proposed to translate long names into short ones to establish succinct local communication, while preserving the advantages of scalable naming for global uses. With over 30% bandwidth reduction and 40% storage saving, the succinctness and effectiveness of the LAT are verified through model analyses and evaluation results.

A Semantic Concast service for data discovery, aggregation and processing on NDN

Offering a flexible paradigm for intelligently discovering, aggregating and processing big distributed data is a crucial requirement in large content-centric Internet. However, the major hindrances to this paradigm are network's dynamic feature, traffic balance, wired forwarding and the absence of cooperation between communications and computations. In this paper, we present a scalable Semantic Concast service on Named Data Networking (NDN) being considered as a promising paradigm for the future Internet. The service enables cooperation between data discovering, aggregating and processing among intermediate nodes for a user's Interest that contained a hierarchical name and semantic constraints. Specifically, multiple types and strategies of data aggregation and processing for combining and processing the positive data and suppressing the negative, futile data, as well as a determination of response completeness are introduced for enhancing relevant results recall and sharing. The experimentation demonstrated the Semantic Concast service can effectively improve service quality, reduce network traffic and shorten response time.

Hierarchical and Flat-Based Hybrid Naming Scheme in Content-Centric Networks of Things

Information-centric networking (ICN) approaches have been considered as an alternative approach to TCP/IP. Contrary to the traditional IP, the ICN treats content as a first-class citizen of the entire network, where names are given through different naming schemes to contents and are used during the retrieval. Among ICN approaches, content centric networking (CCN) is one of the key protocols being explored for Internet of Things (IoT), names the contents using hierarchical naming. Moreover, CCN follows pull-based strategy and exhibits the communication loop problem because of its broadcasting mode. However, IoT requires both pull and push modes of communication with scalable and secured content names in terms of integrity. In this paper, we propose a hybrid naming scheme that names contents using hierarchical and flat components to support both push and pull communication and to provide both scalability and security, respectively. We consider an IoT-based smart campus scenario and introduce two transmission modes: 1) unicast mode and 2) broadcast mode to address loop problem associated with CCN. Simulation results demonstrate that proposed scheme significantly improves the rate of interest transmissions, number of covered hops, name aggregation, and reliability along with addressing the loop problem.

A Secure Link State Routing Protocol for NDN

The Named-data Link State Routing protocol (NLSR) is a protocol for intra-domain routing in Named Data Networking (NDN). It is an application level protocol similar to many IP routing protocols, but NLSR uses NDN’s interest/data packets to disseminate routing updates, directly benefiting from NDN’s built-in data authenticity. The NLSR design, which was first developed in 2013 and deployed on the NDN test bed in August 2014, has undergone significant changes. Following an application-driven design approach, NLSR’s development helped drive the development of the trust/security functionality of NDN libraries as well as a number of features in NDN’s forwarding daemon and ChronoSync. In this paper, we describe the current design and implementation of NLSR, with emphasis on those features that differentiate it from an IP-based link state routing protocol: 1) naming: a hierarchical naming scheme for routers, keys, and routing updates; 2) security: a hierarchical trust model for routing within a single administrative domain; 3) routing information dissemination: using ChronoSync to disseminate routing updates; and 4) multipath routing: a simple way to calculate and rank multiple forwarding options. Although NLSR is designed in the context of a single domain, its design patterns may offer a useful reference for future development of inter-domain routing protocols.

Don’t Trust the Cloud, Verify

Cloud services have turned remote computation into a commodity and enable convenient online collaboration. However, they require that clients fully trust the service provider in terms of confidentiality, integrity, and availability. Toward reducing this dependency, this article introduces VICOS , a protocol for verification of integrity and consistency for cloud object storage that enables a group of mutually trusting clients to detect data integrity and consistency violations for a cloud object storage service. It aims at services where multiple clients cooperate on data stored remotely on a potentially misbehaving service. VICOS enforces the consistency notion of fork-linearizability, supports wait-free client semantics for most operations, and reduces the computation and communication overhead compared to previous protocols. VICOS is based on a generic authenticated data structure. Moreover, its operations cover the hierarchical name space of a cloud object store, supporting a real-world interface and not only a simplistic abstraction. A prototype of VICOS that works with the key-value store interface of commodity cloud storage services has been implemented, and an evaluation demonstrates its advantage compared to existing systems.

Provider mobility in content centric networks - issues and challenges

As the amount of data stored and retrieved in the internet increases, newer architectures that support high volumes of data become necessary. Content centric networking (CCN) architecture by PARC is an information centric architecture that focuses on the content to be retrieved, rather than the address from which it has to be retrieved. Data objects in CCN are assigned hierarchical names and requests for data are routed based on longest prefix matching. While CCN offers freedom from host addresses and improves data retrieval speeds by using in-network caching, mobility of content providers is a big challenge. In view of the rapidly growing number of mobile nodes and volume of data, we analyse the problems associated with provider mobility in CCN. We then explore the existing solutions to address these problems and compare their performance. Lastly, we discuss open issues in supporting provider mobility in CCN.

Provider mobility in content centric networks - issues and challenges

As the amount of data stored and retrieved in the internet increases, newer architectures that support high volumes of data become necessary. Content centric networking (CCN) architecture by PARC is an information centric architecture that focuses on the content to be retrieved, rather than the address from which it has to be retrieved. Data objects in CCN are assigned hierarchical names and requests for data are routed based on longest prefix matching. While CCN offers freedom from host addresses and improves data retrieval speeds by using in-network caching, mobility of content providers is a big challenge. In view of the rapidly growing number of mobile nodes and volume of data, we analyse the problems associated with provider mobility in CCN. We then explore the existing solutions to address these problems and compare their performance. Lastly, we discuss open issues in supporting provider mobility in CCN.