Flat Names Research Articles

Place attributes and company names: an empirical and conceptual study into public branding and business strategies

PurposeThis research finds out to what extent companies’ names are influenced by the place’s attributes versus the official branding policies of a place and, consequently, whether and how local companies “buy into” the place’s strategies put forth by official bodies.Design/methodology/approachThis paper is both conceptual and empirical, as a mixed quantitative and interpretive approach is used. The companies’ names of a tourist industry (the tour and guiding companies) in three destinations are compared and pitched against the branding of these cities. The companies' names are classified into categories to ascertain whether they reflect (or diverge from) the official strategies. Finally, a conceptual model is developed to explain the findings: the strategic naming model (SNM).FindingsOur main finding is that the overall business features of a place being stronger determinants to the naming strategies than tourist destination branding initiatives. The intrinsic features of a place seem thus to be “above” destination branding policies. The researched features account for different naming strategies, such as highly original names, flat names or non-strategic names.Research limitations/implicationsAs the work is based on a convenience sample, it cannot claim strong representativity. The fact that each of the three data sets was processed by a different researcher might bring up personal biases.Practical implicationsThis work is a call for a more intensive use of naming strategies to the companies’ advantages, as naming is found out to be strategy used to a very low degree. Thanks to this research, companies will understand the different naming possibilities and be able to apply them to their strategies by choosing names which express “uniqueness” or “belonging”. Practitioners will also be aware of whether they are communicating towards the industry or towards the market.Originality/valueNo works were found that empirically pursue our research goals. Therefore, this research might be considered as a novelty. The proposed SNM model explains and relates the most usual company naming techniques, which were unrelated up to date.

DINNRS: A Distributed In-Network Name Resolution System for information-centric networks

Information-Centric Networking (ICN) is a promising network paradigm designed to address the challenges arising from the inherent ambiguity of IP addresses. ICN prioritizes the content itself as the main factor in network transmission. The Name Resolution System (NRS) is the primary component of the ICN architecture, relying on flat naming. Unfortunately, existing NRS frequently encounters scalability and performance issues. In this paper, we present the Distributed In-Network Name Resolution System (DINNRS), an NRS that leverages the software-defined networking and ICN paradigm. DINNRS offers global-scale name-based routing with high scalability and minimal request delay. Additionally, we propose a modular control domain architecture for easy implementation and an enhanced marked cuckoo filter for fast resolving. Simulation experiments using the ICN emulator demonstrate that our methods result in significant performance gains, with a 61.2% reduction in data acquire latency and a 55.2% lower link load control overhead compared to MDHT.

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.

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.

Attribute-based Access Control for ICN Naming Scheme

Information Centric Networking (ICN) is a new network architecture that aims to overcome the weakness of existing IP-based networking architecture. Instead of establishing a connection between the communicating hosts, ICN focuses on the content, i.e., data, transmitted in network. Content copies in ICN can be cached at different locations. The content is out of its owner's control once it is published. Thus, enforcing access control policies on distributed content copies is crucial in ICN. Attribute-Based Encryption (ABE) is a feasible approach to enforce such control mechanisms in this environment. However, applying ABE in ICN faces two challenges: from management perspective, it is complicated to manage attributes in distributed manners; from privacy protection perspective, unlike in traditional networks, the enforced content access policies are public to all the ICN users. Thus, it is desirable that unauthorized content viewers are not able to retrieve the access policy. To this end, a privacy-preserving access control scheme for ICN and its corresponding attribute management solution are presented in this paper. The proposed approach is compatible with existing flat name based ICN architectures.

Naming and name resolution in the future internet: Introducing the NovaGenesis approach

Naming and name resolution have fundamental roles in the current and future Internet architectures. In the contemporary Internet, many limitations and problems on this area are longtime well-known, including the limited number of namespaces, the overloaded semantics of IP addresses and domain names, the use of network layer names at higher-levels of the architecture, and the limited name resolution capabilities of DNS. More recently, information-centric networking (ICN) and ID/Locator splitting have emerged as important approaches for rethinking the role of naming on the Internet. In addition, flat name schemes and innovative name resolution service (NRS) are being proposed to improve content distribution efficiency and provenance. In this paper, we are proposing a novel, hierarchical, distributed, name resolution and network caching service to support any combination of flat or hierarchical, natural language or self-verified naming. We provide a scientific contribution to the problem of structuring and resolving names composed of bindings among any kind of names in hierarchical autonomous domains. Our differentiated ICN approach is the core of a future Internet architecture called NovaGenesis. We evaluate and compare the performance of our approach for hierarchical name resolution services, specially in terms of how much servers are used (utilization). Results suggest that our proposal can be adopted as an alternative to the current Internet or other ICN approaches, like multi-level distributed hash tables. We report a reduction on name resolution services utilization at more than one level of authoritative domains’ hierarchy. When the probability of a queried domain name is in the cache of a resolver is equal to 0.547 (the typical value today), NovaGenesis root and second level name resolution servers have experimented less than half of the current DNS servers utilization. Finally, we have experimentally evaluated the performance of our proposal in a local domain using a C++ Linux implementation and Docker™ containers, analyzing how the number of name records and hash table nodes impact on name resolution lookup times.

Hierarchical and hash based naming with Compact Trie name management scheme for Vehicular Content Centric Networks

Content-Centric Network (CCN) is a promising future Internet architecture, attracting research community and being widely adopted in the vehicular networks. The main concept of CCN is to smoothly distribute digital contents between the content provider and consumer. In these types of networks, contents are identified by unique names, however, naming those contents is still a challenging task. Therefore, we propose a hierarchical and hash based naming with efficient Compact Trie (CT) management scheme for Vehicular Content-Centric Network (VCCN). The proposed naming scheme makes the best use of the features offered by hierarchical as well as hash-based or flat naming schemes. The hierarchical part of the digital content name contains information about the content provider, type, its sub-types and attributes of the content itself that is shared between vehicles. The hash part uniquely identifies the digital content required for VCCN applications. The proposed naming scheme satisfies two main purposes: first, it helps in minimizing the routing table by aggregating the name prefixes and simplifying the routing decisions. Second, it contains attributes, spatial, temporal and their range information to easily find and resolve the content. The proposed scheme manages prefixes (e.g. Add, Search and Delete) in the tables e.g. Forwarding Information Base (FIB), Pending Interest Table (PIT), etc. The CT is relatively faster and space-efficient than Simple Trie and has better performance compared to the existing solutions of naming the required content(s). The evaluation results show that the proposed CT based prefix management scheme performs 45.5% and 23.3% faster prefix search and 55% and 34% faster prefix delete operation compared to Simple Trie and Bloom-Filter based name management schemes, respectively. The memory profile results show that average memory consumption of the proposed CT implementation is 24 and 186 times smaller than the Simple Trie and the NLAPB, respectively.

U-Sphere: Strengthening scalable flat-name routing for decentralized networks

Supporting decentralized peer-to-peer communication between users is crucial for maintaining privacy and control over personal data. State-of-the-art protocols mostly rely on distributed hash tables (DHTs) in order to enable user-to-user communication. They are thus unable to provide transport address privacy and guaranteed low path stretch while ensuring sub-linear routing state together with tolerance of insider adversaries. In this paper we present U-Sphere, a novel location-independent routing protocol that is tolerant to Sybil adversaries and achieves low O(1) path stretch while maintaining O˜(n) per-node state. Departing from DHT designs, we use a landmark-based construction with node color groupings to aid flat name resolution while maintaining the stretch and state bounds. We completely remove the need for landmark-based location directories and build a name-record dissemination overlay that is able to better tolerate adversarial attacks under the assumption of social trust links established between nodes. We use large-scale emulation on both synthetic and actual network topologies to show that the protocol successfully achieves the scalability goals in addition to mitigating the impact of adversarial attacks.

Geometric Name Routing for ICN in dynamic world

A new paradigm of scalable routing for ICN is to combine a geometric routing scheme with a Distributed Hash Table. However, for most routing schemes in this paradigm, when a node joins or leaves, large numbers of nodes, even the whole topology, need to be re-embedded, and a great number of contents need to be re-registered. In this paper, we propose D-Griffin, a geometric routing scheme on flat names for dynamic topologies. D-Griffin provides two advantages. First, it avoids re-embedding the topology by using an online greedy embedding scheme and a void handling greedy forwarding scheme. Second, it decreases the number of re-registrations by using a name mapping scheme with a tradeoff between topology independence and load balancing. Theoretical and experimental analyses show that D-Griffin provides guaranteed content lookup, low description complexity, low path stretch, scalable routing update, and acceptable load balancing.

Optimizing Bandwidth of Call Traces for Wireless Embedded Systems

Call traces expose runtime behaviors that greatly aid system developers in profiling performance and diagnosing problems within wireless embedded applications. Strict resource constraints limit the volume of trace data that can be handled on embedded devices, especially bandwidth limited wireless embedded systems. We propose two new call trace gathering techniques, local identifier logging and control flow logging, which provide significant reductions in bandwidth consumption compared to the current standard practice of global identifier logging. Intuition into the savings made possible by the proposed trace gathering techniques is provided by an analytical comparison of the bandwidth required by various call tracing approaches. Confirmation of this intuition is demonstrated through experimentation that reveals log bandwidth savings of approximately 85% compared to global identifier logging using flat name spaces, and 35% compared to global identifier logging using optimal Huffman coding.

A layered naming architecture for the internet

Currently the Internet has only one level of name resolution, DNS, which converts user-level domain names into IP addresses. In this paper we borrow liberally from the literature to argue that there should be three levels of name resolution: from user-level descriptors to service identifiers; from service identifiers to endpoint identifiers; and from endpoint identifiers to IP addresses. These additional levels of naming and resolution (1) allow services and data to be first class Internet objects (in that they can be directly and persistently named), (2) seamlessly accommodate mobility and multi-homing and (3) integrate middleboxes (such as NATs and firewalls) into the Internet architecture. We further argue that flat names are a natural choice for the service and endpoint identifiers. Hence, this architecture requires scalable resolution of flat names, a capability that distributed hash tables (DHTs) can provide.