588 research outputs found
Operability of Mobile Agent Applications in a Protected Environment
There is a shift toward increasingly heterogeneous networks in today�s communications environment. Such diversity requires that network operators have greater experience and increased training. Managing these diverse networks especially in institutions requires the collection of large quantities of data from a dependable network that must be analyzed before management of any activity can be comenced. In this research, we have identified the operability of mobile Agents in a protected network environment
A trust framework for peer-to-peer interaction in ad hoc networks
PhDAs a wider public is increasingly adopting mobile devices with diverse applications,
the idea of who to trust while on the move becomes a crucial one. The need to find
dependable partners to interact is further exacerbated in situations where one finds
oneself out of the range of backbone structures such as wireless base stations or
cellular networks. One solution is to generate self-started networks, a variant of
which is the ad hoc network that promotes peer-to-peer networking. The work in
this thesis is aimed at defining a framework for such an ad hoc network that provides
ways for participants to distinguish and collaborate with their most trustworthy
neighbours.
In this framework, entities create the ability to generate trust information by directly
observing the behaviour of their peers. Such trust information is also shared in order
to assist those entities in situations where prior interactions with their target peers
may not have existed.
The key novelty points of the framework focus on aggregating the trust evaluation
process around the most trustworthy nodes thereby creating a hierarchy of nodes that
are distinguished by the class, defined by cluster heads, to which they belong.
Furthermore, the impact of such a framework in generating additional overheads for
the network is minimised through the use of clusters. By design, the framework also
houses a rule-based mechanism to thwart misbehaving behaviour or non-cooperation.
Key performance indicators are also defined within this work that allow a framework
to be quickly analysed through snapshot data, a concept analogous to those used
within financial circles when assessing companies. This is also a novel point that
may provide the basis for directly comparing models with different underlying
technologies.
The end result is a trust framework that fully meets the basic requirements for a
sustainable model of trust that can be developed onto an ad hoc network and that
provides enhancements in efficiency (using clustering) and trust performance
Descubrimiento dinámico de servidores basado en información de localización usando una tabla de Hash distribuida balanceada
The current Internet includes a large number of distributed services. In order to guarantee the QoS of the communications in these services, a client has to select a close-by server with enough available resources. To achieve this objective, in this Thesis, we propose a simple and practical solution for Dynamic and Location Aware Server Discovery based on a Distributed Hash Table (DHT). Specifically, we decide to use a Chord DHT system (although any other DHT scheme can be used). In more detail, the solution works as follows. The servers offering a given service S form a Chord-like DHT. In addition, they register their location (topological and/or geographical) information in the DHT. Each client using the service S is connected to at least one server from the DHT. Eventually, a given client C realizes that it is connected to a server providing a bad QoS, then, it queries the DHT in order to find an appropriate server (i.e. a close-by server with enough available resources). We define 11 design criteria, and compare our solution to the Related Work based on them. We show that our solution is the most complete one. Furthermore, we validate the performance of our solution in two different scenarios: (i) NAT Traversal Server Discovery and (ii) Home Agent Discovery in Mobile IP scenarios. The former serves to validate our solution in a highly dynamic environment whereas the latter demonstrates the appropriateness of our solution in more classical environments where the servers are typically always-on hosts. The extra overhead suffered from the servers involved in our system comes from their participation in the Chord DHT. Therefore, it is critical to fairly balance the load among all the servers. In our system as well as in other P2P systems (e.g. P2PSIP) the stored objects are small, then routing dominates the cost of publishing and retrieving objects. Therefore, in the second part of this Thesis, we address the issue of fairly balancing the routing load in Chord DHTs. We present an analytical model to evaluate the routing fairness of Chord based on the well accepted Jain’s Fairness Index (FI). Our model shows that Chord performs poorly. Following this observation, we propose a simple enhancement to the Chord finger selection algorithm with the goal of mitigating this effect. The key advantage of our proposal as compared to previous approaches is that it adds a neglible overhead to the basic Chord algorithm. We validate the goodness of the proposed solution analytically and by large scale simulations.-------------------------------------------------------------------------------------------------------------------------------------------------------------En los últimos años un gran número de servicios distribuÃdos han aparecido en Internet. Para garantizar la Calidad de Servicio de las comunicaciones en estos servicios sus clientes deben conectarse a un servidor cercano con suficientes recursos disponibles. Para alcanzar este objetivo, en esta Tesis, se propone una solución simple y práctica para el Descubrimiento Dinámico de Servidores basado en Información de Localizació usando una Tabla de Hash DistribuÃda (DHT). En concreto, hemos decidido usar una DHT de tipo Chord (aunque cualquier otro tipo de DHT puede usarse). A continuación describimos brevemente nuestra solución. Los servidores que ofrecen un servicio especÃfico S forman una DHT tipo Chord donde registran su información de localización (topológica y/o geográfica). Cada cliente que usa el servicio S está conectado al menos a un servidor de la DHT. En caso de que un cliente C perciba que el servidor al que está conectado está ofreciendo una mala Calidad de Servicio, C consulta la DHT para encontrar un servidor más apropiado (p.ej. un servidor cercano con suficientes recursos disponibles). En la Tesis se definen 11 criterios de diseño y se compara nuestra solución con las soluciones existentes en base a ellos, demostrando que la nuestra es la solución más completa. Además, validamos el rendimiento de nuestra solución en dos escenarios diferentes: (i) Descubrimiento de Servidores para atravesar Traductores de Direcciones de Red (NATs) y (ii) Descubrimiento de Agentes Hogar (HAs) en escenarios de Movilidad IP. El primero sirve para validar el rendimiento de nuestra solución en escenarios altamente dinámicos mientras que el segundo demuestra la validez de la solución en un escenario más clásico donde los servidores son máquinas que están ininterrumpidamente funcionando. Los servidores involucrados en nuestro sistema sufren una sobrecarga debido a su participación en la DHT tipo Chord. Desafortunadamente, esta sobrecarga es inherente al sistema anteriormente descrito y no se puede eliminar. En cambio lo que sà podemos hacer es balancear la carga de la manera más justa posible entre todos los servidores. En nuestro sistema, al igual que en otros sistemas P2P (p.ej. P2PSIP) los objetos almacenados tienen un tamaño pequeño, produciendo que sea la tarea de enrutamiento la que domina el coste de publicar y obtener objetos. Por lo tanto, en la segunda parte de esta Tesis abordamos el reparto equilibrado de la carga de enrutamiento en DHTs tipo Chord. En primer lugar, definimos un modelo analÃtico para evaluar el reparto de la carga de enrutamiento entre los nodos que forman una DHT tipo Chord. Para ello nos basamos en una métrica aceptada por la comunidad investigadora como es el Jain’s Fairness Index (FI). El modelo resultante demuestra que Chord tiene un rendimiento pobre en el reparto justo de la carga de enrutamiento. Basándonos en esta observación proponemos una modificación simple al algoritmo de selección de punteros de Chord para mejorar el reparto de la carga de enrutamiento. La ventaja fundamental de nuestra solución en comparación con otras propuestas anteriores es que nuestra solución añade un coste despreciable al algoritmo básico de Chord. Finalmente, validamos el rendimiento de nuestra solución analÃticamente y por medio de simulaciones a gran escala
Easy management and user interconnection across Grid sites
Dissertação de mestrado em Engenharia de InformáticaDistributed computing systems are undoubtedly a powerful resource,providing functions that no other system can do. However, their inherent complexity can lead many users and institutions not to consider these systems when faced by challenges posed by the deployment and administration tasks.
The first solution for this problem is the European Grid Initiative (EGI) roll, a tool that simplifies and streamlines those tasks, by extending the tools that are currently available for cluster administration to the grid. It allows the infrastructure to be easily scaled and adopted by the institutions that are involved in grid projects such as EGI.
The second part of this work consists of a platform that enables the interconnection of computing assets from multiple sources to create a unified pool of resources. It addresses the challenge of building a global computing infrastructure by providing a communication overlay able to deal with the existence of computing facilities located behind NAT devices.
The integration of these two tools results in a solution that not only scales the infrastructure by simplifying the deployment and administration, but also enables the interconnection of those resources
Recommended from our members
Trust Management for P2P application in Delay Tolerant Mobile Ad-hoc Networks. An Investigation into the development of a Trust Management Framework for Peer to Peer File Sharing Applications in Delay Tolerant Disconnected Mobile Ad-hoc Networks.
Security is essential to communication between entities in the internet. Delay tolerant and disconnected Mobile Ad Hoc Networks (MANET) are a class of networks characterized by high end-to-end path latency and frequent end-to-end disconnections and are often termed as challenged networks. In these networks nodes are sparsely populated and without the existence of a central server, acquiring global information is difficult and impractical if not impossible and therefore traditional security schemes proposed for MANETs cannot be applied. This thesis reports trust management schemes for peer to peer (P2P) application in delay tolerant disconnected MANETs. Properties of a profile based file sharing application are analyzed and a framework for structured P2P overlay over delay tolerant disconnected MANETs is proposed. The framework is implemented and tested on J2ME based smart phones using Bluetooth communication protocol. A light weight Content Driven Data Propagation Protocol (CDDPP) for content based data delivery in MANETs is presented. The CDDPP implements a user profile based content driven P2P file sharing application in disconnected MANETs. The CDDPP protocol is further enhanced by proposing an adaptive opportunistic multihop content based routing protocol (ORP). ORP protocol considers the store-carry-forward paradigm for multi-hop packet delivery in delay tolerant MANETs and allows multi-casting to selected number of nodes. Performance of ORP is compared with a similar autonomous gossiping (A/G) protocol using simulations. This work also presents a framework for trust management based on dynamicity aware graph re-labelling system (DA-GRS) for trust management in mobile P2P applications. The DA-GRS uses a distributed algorithm to identify trustworthy nodes and generate trustable groups while isolating misleading or untrustworthy nodes. Several simulations in various environment settings show the effectiveness of the proposed framework in creating trust based communities. This work also extends the FIRE distributed trust model for MANET applications by incorporating witness based interactions for acquiring trust ratings. A witness graph building mechanism in FIRE+ is provided with several trust building policies to identify malicious nodes and detect collusive behaviour in nodes. This technique not only allows trust computation based on witness trust ratings but also provides protection against a collusion attack. Finally, M-trust, a light weight trust management scheme based on FIRE+ trust model is presented
Discovery of Malicious Attacks to Improve Mobile Collaborative Learning (MCL)
Mobile collaborative learning (MCL) is highly acknowledged and focusing
paradigm in eductional institutions and several organizations across the world.
It exhibits intellectual synergy of various combined minds to handle the
problem and stimulate the social activity of mutual understanding. To improve
and foster the baseline of MCL, several supporting architectures, frameworks
including number of the mobile applications have been introduced. Limited
research was reported that particularly focuses to enhance the security of
those pardigms and provide secure MCL to users. The paper handles the issue of
rogue DHCP server that affects and disrupts the network resources during the
MCL. The rogue DHCP is unauthorized server that releases the incorrect IP
address to users and sniffs the traffic illegally. The contribution specially
provides the privacy to users and enhances the security aspects of mobile
supported collaborative framework (MSCF). The paper introduces multi-frame
signature-cum anomaly-based intrusion detection systems (MSAIDS) supported with
novel algorithms through addition of new rules in IDS and mathematcal model.
The major target of contribution is to detect the malicious attacks and blocks
the illegal activities of rogue DHCP server. This innovative security mechanism
reinforces the confidence of users, protects network from illicit intervention
and restore the privacy of users. Finally, the paper validates the idea through
simulation and compares the findings with other existing techniques.Comment: 20 pages and 11 figures; International Journal of Computer Networks
and Communications (IJCNC) July 2012, Volume 4. Number
- …