We investigate the problem of fast-forwarding quantum evolution, whereby dynamics certain systems can be simulated with gate complexity that is sublinear in evolution time. provide a definition considers model computation, Hamiltonians induce and properties initial states. Our accounts for any</mm...

Data link level forwarding provides simple and fast packet forwarding capability. One primary reason for the simplicity of layer 2 forwarding comes from its short, fixed length labels. A node forwarding at network layer must parse a relatively large header, and perform a longest-prefix match to determine a forwarding path. When a node performs layer 2 forwarding it can do direct index lookup in...

As the discovery of non-Poissonian statistics of human mobility trajectories, more attention has been paid to understanding the role of these patterns in different dynamics. In this study, we first introduce the heterogeneous mobility of mobile agents into dynamical networks, and then investigate the forwarding strategy on the heterogeneous dynamical networks. We find that the faster speed and ...

In this paper, we present a measurement study of persistent forwarding loops and a flooding attack that exploits persistent forwarding loops. Persistent forwarding loops may share one or more links with forwarding paths to some hosts. An attacker can exploit persistent forwarding loops to overload the shared links and disrupt Internet connectivity to those hosts. To understand the extent of thi...

the establishment as well as the survival of mobile ad-hoc networks relies on the cooperation of nodes for performing network operations such as routing and packet forwarding. in these networks, misbehaving nodes can severely degrade network’s performance by not cooperating in networking operations. in this paper, we study the issue of node misbehavior in packet forwarding. to counter this type...

the ip lookup process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to ipv6 addresses. the ip address lookup involves computation of the longest prefix matching (lpm), which existing solutions such as bsd radix tries, scale poorly when traıc in the router increases or when employed for ipv6 address lookups. in this paper, we describe a ...

A Peer-to-Peer (P2P) platform is considered for collaborative Information Retrieval (IR). Each peer hosts a collection of text documents with subjects related to its owner's interests. Without a global indexing mechanism, peers locally index their documents, and provide the service to answer queries. A decentralized protocol is designed, enabling the peers to collaboratively forward queries fro...