Search results for "Distributed computing"
showing 10 items of 622 documents
Monitoring wireless sensor networks through logical deductive processes
2006
This paper proposes a distributed multi-agent architecture for wireless sensor networks management, which exploits the dynamic reasoning capabilities of the Situation Calculus in order to emulate the reactive behavior of a human expert to fault situations. The information related to network events is generated by tunable agents installed on the network nodes and is collected by a logical entity for network managing where it is merged with general domain knowledge, with the aim of identifying the root causes of faults, and deciding on reparative actions. The logical inference system has being devised to carry out automated isolation, diagnosis, and, whenever possible, repair of network anoma…
Overlapping Community Structure in Co-authorship Networks: A Case Study
2014
Community structure is one of the key properties of real-world complex networks. It plays a crucial role in their behaviors and topology. While an important work has been done on the issue of community detection, very little attention has been devoted to the analysis of the community structure. In this paper, we present an extensive investigation of the overlapping community network deduced from a large-scale co-authorship network. The nodes of the overlapping community network represent the functional communities of the co-authorship network, and the links account for the fact that communities share some nodes in the co-authorship network. The comparative evaluation of the topological prop…
Experiences with the integration of protocol software tools
1996
An analysis of a number of protocol software tools that are widely used in the development of communication protocols in the Finnish telecommunications industry is presented. To analyse the integrated use of these tools, a non-trivial application layer protocol with ACSE, ROSE and a simple presentation layer has been designed and implemented with the help of these software tools. Particular attention has been paid to compose a complete protocol implementation from the fragments produced with separate tools. Our observations clearly indicate that this integration is a major problem with the current practices.
New novel idea for Cloud Computing: How can we use Kalman filter in security of Cloud Computing
2012
Cloud is a virtual image about some amount of undefined powers, that is widespread and had unknown power and inexact amount of hardware and software configurations, and because of we have not any information about clouds location and time dimensions and also the amounts of its sources we tell that Cloud Computing. This technology presents lots of abilities and opportunities such as processing power, storage and accessing it from everywhere, supporting, working - team group - with the latest versions of software and etc., by the means of internet. On the other hand, in such a large scale networks we should consider the reliability and powerfulness of such networks in facing with events such …
5G IoT System for Real-Time Psycho-Acoustic Soundscape Monitoring in Smart Cities With Dynamic Computational Offloading to the Edge
2021
Environmental noise monitoring for smart cities need to be as much efficient as possible in order to mitigate its significant impact in the health of their inhabitants. 5G Internet of Things (IoT) systems offer a big opportunity to offload the computation from the sensor nodes, since it provides a series of new concepts for dynamic computing that the previous technologies did not offer. In this article, a complete 5G IoT system for psycho-acoustic monitoring has been designed and implemented using different options for offloading computation to different parts of the system. This offloading has been done by developing different functional splittings of the psycho-acoustic metrics algorithms…
Alignment-Free Sequence Comparison over Hadoop for Computational Biology
2015
Sequence comparison i.e., The assessment of how similar two biological sequences are to each other, is a fundamental and routine task in Computational Biology and Bioinformatics. Classically, alignment methods are the de facto standard for such an assessment. In fact, considerable research efforts for the development of efficient algorithms, both on classic and parallel architectures, has been carried out in the past 50 years. Due to the growing amount of sequence data being produced, a new class of methods has emerged: Alignment-free methods. Research in this ares has become very intense in the past few years, stimulated by the advent of Next Generation Sequencing technologies, since those…
A Network Formation Game Approach to Study BitTorrent Tit-for-Tat
2007
The Tit-for-Tat strategy implemented in BitTorrent (BT) clients is generally considered robust to selfish behaviours. The authors of [1] support this belief studying how Tit-for-Tat can affect selfish peers who are able to set their upload bandwidth. They show that there is a "good" Nash Equilibrium at which each peer uploads at the maximum rate. In this paper we consider a different game where BT clients can change the number of connections to open in order to improve their performance. We study this game using the analytical framework of network formation games [2]. In particular we characterize the set of pairwise stable networks the peers can form and how the peers can dynamically reach…
A service-oriented routing scheme with load balancing in wireless mesh networks
2008
Wireless mesh networks will play an important role in the next-generation wireless communication systems as it can provide wide coverage and scalable broadband Internet access services. However, congestion in such networks may lead to throughput degradation, packet loss and longer transmission delay. Therefore, routing and traffic forwarding schemes which are aware of the congestion status of a wireless network can efficiently improve network performance. In this paper, we propose a new congestion-aware routing scheme which may direct different paths for different services types, according to network congestion status. The goal of this routing scheme is to use traffic load metric for choosi…
An Efficient Implementation of Distributed Routing Algorithms for NoCs
2008
The design of NoCs for multi-core chips introduces new design constraints like power consumption, area, and ultra low latencies. Although 2D meshes are preferred, heterogeneous blocks, fabrication faults, reliability issues, and chip virtualization may lead to the need of irregular topologies or regions. In this situation, efficient routing becomes a challenge. Although the use of routing tables at switches is flexible, it does not scale in terms of latency and area due to its memory requirements. LBDR (logic-based distributed routing) is proposed as a new routing method that removes the need of using routing tables at all. LBDR enables the implementation of many routing algorithms on most …
Applications of the vehicle routing problem with trailers and transshipments
2013
Abstract The vehicle routing problem with trailers and transshipments (VRPTT) is a recent and challenging extension of the well-known vehicle routing problem. The VRPTT constitutes an archetypal representative of the class of vehicle routing problems with multiple synchronization constraints (VRPMSs). In addition to the usual task covering constraints, VRPMSs require further synchronization between vehicles, concerning spatial, temporal, and load aspects. VRPMSs possess considerable practical relevance, but limited coverage in the scientific literature. The purpose of the present paper is to describe how several important types of VRPMSs, such as multi-echelon location-routing problems and …