Search Results

The transformation from static production facilities into a flexible and decentralized cyber-physical production system (CPPS) is part of the current ongoing Industry 4.0. A CPPS will enable and support communication between people, machines and virtual ...

Distributed systems, potentially growing large and consisting of heterogeneous nodes, are advised to be constructed following the Peer-to-Peer (P2P) networking paradigm. It becomes imperative that a Peer-to-Peer (P2P) network is paired with efficient ...

We give a counterexample to the conjecture of Martin and Thatte that two balanced rooted binary leaf-labeled trees on $n$ leaves have a maximum agreement subtree (MAST) of size at least $n^{\frac{1}{2}}$. In particular, we show that for any $c>0$, there ...

As one of the most important data structures used in algorithm design and programming, balanced search trees are widely used in real-world applications for organizing data. Answering the challenges thrown up by modern large-volume and ever-changing data,...

The emergence and wide availability of remote storage service providers prompted work in the security community that allows clients to verify integrity and availability of the data that they outsourced to a not fully trusted remote storage server at a ...

Many internet applications are based on group communication model. For secure group communication scenario, key management is an important issue. In a hierarchical architecture, key trees are used. When users join or leave a key tree, all the ancestor ...

In group communication scenario, key management is important to preserve forward and backward secrecy. In order to achieve it keys need to be changed during user join/leave which is done by an operation called rekeying. In a centralized key management ...

Divide-and-conquer is an important technique in parallel programming. However, algebraic data structures do not fit divide-and-conquer parallelism. For example, the usual pointer-based implementation of lists cannot efficiently be divided at their ...

If we analyze real life filter sets (classifiers) and also packet classification requirements, it seems that distribution of rule scope is non-uniform and in some sub spaces is denser inside the total space of classifiers. These features guided us to ...

The ability to classify each incoming packet is called packet classification and is based on an arbitrary number of packet header fields. The role of packet classification is important in special services such as VPNs, firewalls and differentiated ...

A logical balanced tree structure can be overlaid on a peer-to-peer (P2P) network to support both exact match and range queries. Load balancing mechanisms are needed for handling skew problems in a tree-structured network. Traditional load balancing ...

Multicast is used to deliver packets to a group of users. To prevent users outside the group from eavesdropping, a group key is maintained to encrypt the group communication, and the group key is changed (rekeying) when a new member joins the group or ...