Today network operators spend a significant amount of time struggling to understand how their network forwards traffic. Even simple questions such as “How is my network handling Google traffic?” often require operators to manually bridge large semantic gaps between lowlevel forwarding rules distributed across many routers and the corresponding high-level insights. We introduce Net2Text, a syste...

In pure peer-to-peer (P2P) file sharing applications and protocols using a flooding-based query algorithm, a large number of control packets (query packets) are transmitted on the network to search for target files. This clearly leads to a degradation of communication quality on the network and terminals as the number of users of the application increases. To solve such problems, this paper pro...

Data query is a common communication pattern in sensor networks. However, due to the introduction of sleep latency, it is challenging to perform efficient query in low-dutycycle sensor networks. In particular, the round-trip delay from the sink to source nodes and vice versa over the same forwarding path could be extremely long. In this work, westudy the delay optimization problem by jointly co...

We have proposed an improved flooding based geocast scheme, Geocast Scheme based on Successful Transmission Record (GSTR) for environments where reply messages to a query message sent by geocast are sent back to the sender of the query. In GSTR, transmission timing of broadcast of query packets is controlled using records of that the node has forwarded reply messages to query messages which hav...

Existing discovery algorithms for peer to peer networks are based on broadcast of query messages over the relationship connectivity among entities in the network.A query message contains search key words, and it is broadcast with a TTL (time to live) value to limit the scope of search and to reduce high overhead associated with broadcast. Although the use of TTL reduces the amount of overhead, ...

Finding information in a peer-to-peer system currently requires either a costly and vulnerable central index, or ooding the network with queries. In this paper we introduce the concept of Routing Indices (RIs), which allow nodes to forward queries to neighbors that are more likely to have answers. If a node cannot answer a query, it forwards the query to a subset of its neighbors, based on its ...

By using position information in forwarding decisions, location based routing protocols for mobile networks are stateless and efficient. However, they are heavily dependent on location services which provide the position information of the desired destination node. Although several location service schemes have been proposed, their main goal is just to find the location of the destination node....

Location based routing protocols are heavily dependent on location services which provide the position information of the desired destination node. Seldom location service schemes include energy efficiency metrics when evaluating their performance in forwarding location update and query packets. We propose a novel location service that aims at decreasing the distance traveled by the location up...

P eer-to-peer systems are distributed systems that operate without centralized organization or control. To find a particular piece of data within the network, P2P systems explicitly or implicitly provide a lookup mechanism, or locator function, that matches a given string, or key, to one or more network nodes responsible for the value associated with that key. P2P nodes interoperate by using th...

Location based routing protocols are heavily dependent on location services which provide the position information of the desired destination node. Seldom location service schemes include energy efficiency metrics when evaluating their performance in forwarding location update and query packets. We propose a novel location service that aims at decreasing the distance traveled by the location up...