Host-based rerouting mechanism is a routing scheme that stores and forwards data in application layer. With this, users can communicate in a indirect way. Thus, identity information such as IP addresses can be effectively hidden against eavesdropper. In anonymous communication systems, such as Mixes, Onion Routing, and Crowds, this mechanism is adopted to provide anonymity. This mechanism, howe...

Content Delivery Network (CDN) is an intermediate layer of infrastructure that helps to efficiently deliver the ever increasing multimedia content from content providers to a large community of geographically distributed clients. Content routing is an essential component of CDN architecture. In this paper we propose a hierarchical content routing architecture for large-scale CDN, in which CDN s...

Energy conservation is important for mobile ad hoc networks where devices are expected to work for longer periods of time without the need for charging their batteries. Therefore there is a need of an intelligent routing protocol that can minimize overhead and ensure the use of minimum energy routes. In Progressive Energy Efficient Routing, energy efficient shortest paths are selected with mini...

DHT based Peer-to-Peer (P2P) algorithms are very promising for their efficient routing performance. However, most commercial P2P systems donot adapt DHT algorithms and still use central facilities or broadcasting based routing mechanisms. One reason impeding the DHT algorithm popularity is the routing information maintenance overhead in DHT algorithms, it generates considerable network traffic ...

Mobile Ad-hoc Network (MANET) is an autonomous, multi-hop and dynamic network composed of number of wireless mobile nodes. Routing protocols are challenges in designing Mobile Ad-hoc networks with low energy consuming and low control overhead. Ad-hoc on demand distance vector routing protocol (AODV) is specially designed for mobile ad-hoc networks with Expanding Ring Search (ERS) technique for ...

An ad hoc network is a P2P network, formed by a collection of wireless mobile hosts requiring no fixed infrastructure. Many on-demand routing algorithms proposed for such kind of networks incur much routing overhead during the route discovery process. This paper presents Band Zone Route Discovery, a new route discovery scheme to cut down the routing overhead. The basic idea of the proposed sche...

Geographic routing is well suited for large scale sensor networks, because its per node state is independent of the network size. However, due to the local minimum caused by holes/obstacles, the path stretch of geographic routing may degrade up to O(c2), where c is the path length of the optimal route. Recently, a geographic routing protocol based on the visibility graph (VIGOR) showed that a c...

This paper presents on-demand routing scalability improvements achieved using a “passive” clustering. Any on demand routing typically requires some form of flooding. Clustering can dramatically reduce transmission overhead during flooding. In fact, by using clustering, we restrict the set of forwarding nodes during flood search and thus reduce the energy cost and traffic overhead of routing in ...

Large-scale P2P systems typically have hundreds of thousands of peers that involve frequent dynamic activities. Current structured overlays do not identify well the rhythm in the dynamic activities, thus resulting in high maintenance overhead. In this paper, we present a new state cache system, called SCS, that solves the problem by exploiting the access patterns of dynamic activities in P2P sy...

Mobile ad-hoc network routing protocol performance is evaluated mostly through simulative studies. One-factor-at-atime approach is commonly used to quantify the effect of various factors on the protocol performance. In this work, the effect of several factors was investigated simultaneously and speedily with the application of Taguchi design of experiments. The effect of the factors which inclu...