Sink location is considered as a basic service in geographic routing in wireless sensor networks. Obtaining the location of sink node by source node using an efficient method with low complexity has always been a challenging issue in research. In this paper, a sink location algorithm based on Fano plane is proposed. The research challenge is how to ensure the intersection of two SLQ (Location Q...

this paper deals with the basic notions of k-tautimmersions . these notions come from two special cases; that is, tight and taut immersions. tight and taut based on high and distance functions respectively and their basic notions are normal bundle, endpoint map, focal point, critical normal. we generalize hight and distance functions to cylindrical function and define basic notions of k-taut im...

IP routing is notoriously vulnerable to accidental misconfiguration and malicious attack. Although secure routing protocols are an important defense, the data plane must be part of any complete solution. Existing proposals for secure (link-level) forwarding are heavy-weight, requiring cryptographic operations at each hop in a path. Instead, we propose a light-weight data-plane mechanism (called...

Modern network devices have to meet stringent performance requirements while providing support for a growing number of use cases and applications. In such a context, a programmable network data plane has emerged as an important feature of modern forwarding elements, such as switches and network cards. Bosshart et al. [1] introduced RMT, a first example of a high-performance programmable data pl...

In this research, we introduce a reasonable noise model for range data which is obtained by a laser radar range jnder, and derive two simple approximate solutions of the optimal local planejtting the range data under the noise model. Then we compare our methods with the general least-squares based methods, such as Z-function fitting, the eigenvalue method, and the maximum likelihood estimation ...

In many applications one is concerned with the approximation of functions from a finite set of scattered data sites with associated function values. We describe a scheme for constructing a hierarchy of triangulations that approximates a given data set at varying levels of resolution. Intermediate triangulations can be associated with a particular level of a hierarchy by considering their approx...

Sub-microsecond network and memory latencies require fast user-level access to local and remote storage. While user-level access to local storage has been demonstrated recently, it does currently not extend to serverless parallel systems in datacenter environments. We propose direct user-level access to remote storage in a distributed setting, unifying fast data access and high-performance remo...

This document is subject to BCP 78 and the IETF Trust’s Legal Provisions Relating to IETF Documents (http://trustee.ietf.org/license-info) in effect on the date of publication of this document. Please review these documents carefully, as they describe your rights and restrictions with respect to this document. Code Components extracted from this document must include Simplified BSD License text...

Software Defined Networking (SDN) is a new network architecture where network control is decoupled from forwarding and is directly programmable. However, existing techniques provide limited support for stateful forwarding in SDN data plane. Relying on the controller for all state maintaining gives rise to scalability and performance issues. In this paper, we present Stateful Forwarding Abstract...