Review on the Simulation of Cooperative Caching Schemes for MANETs

In this paper, a review of the main simulation parameters utilized to evaluate the performance of cooperative caching schemes in Mobile Ad Hoc Networks is presented. Firstly, a taxonomy of twenty five caching schemes proposed in the literature about Mobile Ad Hoc Networks is defined. Those caching schemes are briefly described in order to illustrate their basis and fundamentals. The review takes into consideration the utilized network simulator, the wireless connection standard, the propagation model and routing protocol, the employed simulation area and number of data servers, the number of mobile devices and their coverage area, the mobility model, the number of documents in the network, the replacement policy and cache size, the mean time between requests, the document popularity distribution, the TTL (Time To Live) of the documents and the simulation time. Those simulation parameters have been compared among the evaluation of the studied cooperative caching schemes in order to obtain the most common utilized values. This work will allow to compare the performance of the proposed cooperative caching schemes using a common simulation environment.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech

Accepted for Photonic Network Communications

Abstract-When deploying Grid infrastructure, the problem of dimensioning arises: how many servers to provide, where to place them, and which network to install for interconnecting server sites and users generating Grid jobs? In contrast to classical optical network design problems, it is typical of optical Grids that the destination of traffic (jobs) is not known beforehand. This leads to so-called anycast routing of jobs. For network dimensioning, this implies the absence of a clearly defined (source,destination)-based traffic matrix, since only the origin of Grid jobs (and their data) is known, but not their destination. The latter depends not only on the state of Grid resources, including network, storage, and computational resources, but also the Grid scheduling algorithm used. We present a phased solution approach to dimension all these resources, and use it to evaluate various scheduling algorithms in two European network case studies. Results show that the Grid scheduling algorithm has a substantial impact on the required network capacity. This capacity can be minimized by appropriately choosing a (reasonably small) number of server site locations: an optimal balance can be found, in between the single server site case requiring a lot of network traffic to this single location, and an overly fragmented distribution of server capacity over too many sites without much statistical multiplexing opportunities, and hence a relatively large probability of not finding free servers at nearby sites

A Cluster-Based Architecture to Structure the Topology of Parallel Wireless Sensor Networks

A wireless sensor network is a self-configuring network of mobile nodes connected by wireless links where the nodes have limited capacity and energy. In many cases, the application environment requires the design of an exclusive network topology for a particular case. Cluster-based network developments and proposals in existence have been designed to build a network for just one type of node, where all nodes can communicate with any other nodes in their coverage area. Let us suppose a set of clusters of sensor nodes where each cluster is formed by different types of nodes (e.g., they could be classified by the sensed parameter using different transmitting interfaces, by the node profile or by the type of device: laptops, PDAs, sensor etc.) and exclusive networks, as virtual networks, are needed with the same type of sensed data, or the same type of devices, or even the same type of profiles. In this paper, we propose an algorithm that is able to structure the topology of different wireless sensor networks to coexist in the same environment. It allows control and management of the topology of each network. The architecture operation and the protocol messages will be described. Measurements from a real test-bench will show that the designed protocol has low bandwidth consumption and also demonstrates the viability and the scalability of the proposed architecture. Our ccluster-based algorithm is compared with other algorithms reported in the literature in terms of architecture and protocol measurements

Network emulation focusing on QoS-Oriented satellite communication

This chapter proposes network emulation basics and a complete case study of QoS-oriented Satellite Communication

Communication platform for inter-satellite links in distributed satellite systems

EThOS - Electronic Theses Online ServiceGBUnited Kingdo

Effizientes Routing in strukturierten P2P Overlays

Als Fundament für neuartige Netzwerkanwendungen sind strukturierte P2P Overlays attraktiv. In diesen Strukturen folgen Datenpakete logischen Verbindungen zwischen den Netzwerkteilnehmern, die jedoch meist komplexen Wegen durch das zugrunde liegende Netzwerk entsprechen. Die in dieser Arbeit vorgestellten Konzepte verringern die daraus resultierenden hohen Routing-Latenzen im Overlay. Schwerpunkt dabei ist ein Verfahren zur Vergabe von auf Netzwerk-Koordinaten basierenden Teilnehmerkennungen

Effizientes Routing in strukturierten P2P Overlays

Als Fundament für neuartige Netzwerkanwendungen sind strukturierte P2P Overlays attraktiv. In diesen Strukturen folgen Datenpakete logischen Verbindungen zwischen den Netzwerkteilnehmern, die jedoch meist komplexen Wegen durch das zugrunde liegende Netzwerk entsprechen. Die in dieser Arbeit vorgestellten Konzepte verringern die daraus resultierenden hohen Routing-Latenzen im Overlay. Schwerpunkt dabei ist ein Verfahren zur Vergabe von auf Netzwerk-Koordinaten basierenden Teilnehmerkennungen