Recently, we have proposed a new prefix lookup algorithm which would use the prefixes as scalar numbers. This algorithm could be applied to different tree structures such as Binary Search Tree and some other balanced trees like RB-tree, AVL-tree and B-tree with minor modifications in the search, insert and/or delete procedures to make them capable of finding the prefixes of an incoming string e...

Internet routers’ forwarding tables (FIBs), which must be stored in expensive fast memory for high-speed packet forwarding, are growing quickly in size due to increased multihoming, finer-grained traffic engineering, and deployment of IPv6 and VPNs. To address this problem, several Internet architectures have been proposed to reduce FIB size by returning to the earlier approach of route caching...

The Internet community is near the ‘bottom of the barrel’ for unallocated IPv4 address prefixes. Network 1.0.0.0/8 was allocated in January 2010 for use on the public Internet, despite being unofficially utilised in various ways for many years. Recent work has revealed this prefix to be quite ‘dirty’, with significant levels of public UDP and TCP traffic already inbound to certain parts of 1.0....

Unsupervised morphological analysis is the task of segmenting words into prefixes, suffixes and stems without prior knowledge of language-specific morphotactics and morpho-phonological rules. This paper introduces a simple, yet highly effective algorithm for unsupervised morphological learning for Bengali, an Indo-Aryan language that is highly inflectional in nature. When evaluated on a set of ...

Vocabularies are more and more (re)-used in the Linked Data ecosystem. However, managing the prefixes associated to their Uniform Resource Identifiers (URIs) is still cumbersome and namespaces are sometimes referring to different pair . In this paper, we propose to align two well-known services with the aim of managing and harmonizing vocabularies’ namespaces. We use prefix.cc that...

BGP, the de-facto inter-domain routing protocol, was designed without considering security. Recently, network operators have experienced hijacks of their network prefixes, often due to BGP misconfiguration by other operators, sometimes maliciously. In order to address this, prefix origin validation, based on a RPKI infrastructure, was proposed and developed. Today, many organizations are regist...

With a rapid increase in the data transmission link rates and an immense continuous growth in the Internet traffic, the demand for routers that perform Internet protocol packet forwarding at high speed and throughput is ever increasing. The key issue in the router performance is the IP address lookup mechanism based on the longest prefix matching scheme. Earlier work on fast Internet Protocol V...

IP route look up is the most time consuming operation of a router. Route lookup is becoming a very challenging problem due to the increasing size of routing tables. To reduce the number of entries, routing tables store variable length address prefixes. To determine the outgoing port for a given address, the longest matching prefix amongst all the prefixes, needs to be determined. This makes the...

McMillan has presented a deadlock detection method for Petri nets based on finite complete prefixes (i.e. net unfoldings). The basic idea is to transform the PSPACE-complete deadlock detection problem for a 1-safe Petri net into a potentially exponentially larger NP-complete problem of deadlock detection for a finite complete prefix. McMillan suggested a branch-and-bound algorithm for deadlock ...

The Fibonacci word f=010010100100101⋯ is one of the most well-studied words in area combinatorics on words. It not periodic, but nevertheless contains many highly periodic factors (contiguous subwords). For example, it cubes (i.e., non-empty form xxx). We study prefixes that end with a cube. Using computer prover Walnut, we obtain an exact description positions at which cube ends. This gives ce...