Mobile Ad hoc Network (MANET) is a collection of mobile nodes without any centralized administration. These nodes collect the information through overhearing and store information in route caches through routing protocol. When the route cache freshness is absent, it leads to the stale route information resulting in pollution caches. If the node overhears the packet to another node, node's ...

Traditional reliable transport protocols have been designed to perform end-to-end delivery transparently to the intermediate nodes along the path (e.g., TCP). The resourceconstrained nature of a Wireless Sensor Network (WSN) requires a new paradigm where intermediate nodes are able to cache packets and retransmit them on-demand during packet loss recovery in order to avoid incurring costly end-...

This research investigates memory latency of cluster-based cache-coherent multiprocessor systems with di€erent interconnection topologies. Each node in a cluster includes a small number of processors and a portion of the shared-memory, which are all connected through a split transaction bus. Each processor has two levels of caches. As the number of processors in a node is small, a snoopy cache ...

In this paper, we address an optimization problem that arises in the context of cache placement in sensor networks. In particular, we consider the cache placement problem where the goal is to determine a set of nodes in the network to cache/store the given data item, such that the overall communication cost incurred in accessing the item is minimized, under the constraint that the total communi...

This paper discusses the use of the CPU cache when the processor is being used to manipulate stream data, in particular isochronous media such as as video. The principal idea is to enable data to avoid main memory and ow directly into a portion of the cache. When used with a \cache aware" operating system this method is shown to provide a rich support environment for multimedia manipulation. Ex...

In this paper, we address an optimization problem that arises in context of cache placement in sensor networks. In particular, we consider the cache placement problem where the goal is to determine a set of nodes in the network to cache/store the given data item, such that the overall communication cost incurred in accessing the item is minimized, under the constraint that the total communicati...

The paper presents the design of an I/O balancing file system on Web server clusters. High-speed networks allow machines to access remote data nearly as quickly as they can access local data. This trend motivates the introduction of I/O balancing mechanism into cluster file systems. Two effective approaches are issued in the paper: file migration and unique cache. The former is to migrate the f...

In this paper we have proposed an adaptive dynamic cache replacement algorithm for a multimedia servers cache system. The goal is to achieve an effective utilization of the cache memory which stores the prefix of popular videos. A replacement policy is usually evaluated using hit ratio, the frequency with which any video is requested. Usually discarding the least recently used page is the polic...

In this paper we propose a new method for improving the average response time of Web servers by cooperatively caching the results of requests for dynamic content. The work is motivated by our recent study of access logs from the Alexandria Digital Library server at UCSB, which demonstrates that approximately a 30 percent decrease in average response time could be achieved by caching dynamically...

As people’s demand for application services continues to grow, traditional TCP and IP network architectures face many security mobility challenges. In order completely eliminate these problems, scientists have proposed a representative new Internet architecture, such as content center network. Each node in the has data storage function. limited cache area, effective is cached through collaborat...