scholarly journals Scalable Name Lookup for NDN Using Hierarchical Hashing and Patricia Trie

2020 ◽  
Vol 10 (3) ◽  
pp. 1023 ◽  
Author(s):  
Junghwan Kim ◽  
Myeong-Cheol Ko ◽  
Moon Sun Shin ◽  
Jinsoo Kim

Named data networking (NDN) is a content-centric network for the future of the internet. An NDN a packet is delivered based on a content name instead of a destination IP address. The name lookup for packet forwarding is challenging because the content name is variable, and its space is unbounded. This paper proposes a novel name lookup scheme that employs a hashing technique combined with Patricia tries. In this scheme, hash tables are dynamically maintained according to the hierarchical structure of the name, so the name can effectively accommodate variable and unbounded content names. Unlike chaining, a Patricia trie compares a key string only once at a leaf node, so it provides a fast name lookup. The proposed lookup scheme is implemented and evaluated by using an Intel Core i7-2600 CPU and 4GB of memory. Experimental results show that our scheme gives good scalability and a high throughput of name lookup with a controlled memory consumption.

Author(s):  
Janusz Adam Frykowski

AbstractThe following paper depicts the history of Saint Simeon Stylites Uniate Parish in Rachanie since it became known in historical sources until 1811- that is the time it ceased to be an independent church unit. The introduction of the article contains the geographical location of the parish, its size and the position within the hierarchical structure of the Church. Having analysed post-visit inspection protocols left by Chelm Bishops, the appearance as well as fittings and ancillary equipment of the church in Rachanie in that particular period are reported. Moreover, the list of 4 local clergymen is recreated and their benefice is determined. As far as possible, both the number of worshipers and the number of Holy Communion receivers is determined.


1993 ◽  
Vol 18 (2-4) ◽  
pp. 129-149
Author(s):  
Serge Garlatti

Representation systems based on inheritance networks are founded on the hierarchical structure of knowledge. Such representation is composed of a set of objects and a set of is-a links between nodes. Objects are generally defined by means of a set of properties. An inheritance mechanism enables us to share properties across the hierarchy, called an inheritance graph. It is often difficult, even impossible to define classes by means of a set of necessary and sufficient conditions. For this reason, exceptions must be allowed and they induce nonmonotonic reasoning. Many researchers have used default logic to give them formal semantics and to define sound inferences. In this paper, we propose a survey of the different models of nonmonotonic inheritance systems by means of default logic. A comparison between default theories and inheritance mechanisms is made. In conclusion, the ability of default logic to take some inheritance mechanisms into account is discussed.


2021 ◽  
Vol 50 (14) ◽  
pp. 5011-5022 ◽  
Author(s):  
Adam F. Sapnik ◽  
Duncan N. Johnstone ◽  
Sean M. Collins ◽  
Giorgio Divitini ◽  
Alice M. Bumstead ◽  
...  

Defect engineering is used to augment the porosity of MIL-100. Incorporation of defects leads to structural collapse and ultimately causes amorphisation. Pair distribution function analysis reveals a stepwise collapse of the hierarchical structure.


Sign in / Sign up

Export Citation Format

Share Document