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 ...

the networked control system in modern control widely uses to decrease the implementation cost and increasing the performance. ncs in addition to its advantages is inevitable. nevertheless they suffer of some limitations and deficiencies. packet loss is one of the main limitations which affect the control system in different conditions and finally may lead to system instability. for this reason...

it is shown in [1] that the optimal downlink radio resource allocation for non-realtime traffic in cellular cdma/tdma networks can be mapped to a multi-dimensional multiple-choice knapsack problem (mmkp) which is np-hard. in this correspondence we propose a heuristic algorithm with polynomial time complexity for this problem. numerical results indicate significant computational performance impr...

In this paper we propose a new network layer security protocol that allows encrypted and authenticated communication between hosts. The new protocol has a number of advantages over existing protocols, including: no initial handshake to establish a connection, zero packet overhead, no per-host state and simpler key distribution. The protocol achieves these goals by using identitybased encryption...

We present in this paper a new mechanism for the OLSR routing Protocol, aiming to improve mobility and energy management in mobile adhoc network. As known OLSR use the concept of an MPR mechanism where only nodes selected as MPRs can relay broadcast packet received from their selectors, those nodes have to satisfy certain requirements to assure this mission , speaking of stability and physical ...

The most important routing protocol LEACH of wireless sensor networks (WSNs) has been incorporated by W. Heinzelman. LEACH uses the concept of dynamic clustering when sensor nodes are deploying randomly where number of cluster impact on the network. This paper describes the network quality that depends on the optimum selection of number of clusterhead as a Modification on LEACH protocol using n...

In this paper, loss probabilities and steady state probabilities of data packets for an asynchronous transfer mode (ATM) network are investigated under the buffer division and push-out schemes. Data packets are classified in classes k which arrive in Poisson fashion to the service facility and are served with general service rate under buffer division scheme, finite buffer space N is divided in...