Search results for "Distributed computing"
showing 10 items of 622 documents
The Random Neural Network Model for the On-line Multicast Problem
2005
In this paper we propose the adoption of the Random Neural Network Model for the solution of the dynamic version of the Steiner Tree Problem in Networks (SPN). The Random Neural Network (RNN) is adopted as a heuristic capable of improving solutions achieved by previously proposed dynamic algorithms. We adapt the RNN model in order to map the network characteristics during a multicast transmission. The proposed methodology is validated by means of extensive experiments.
An Efficient Distributed Algorithm for Generating Multicast Distribution Trees
2005
Multicast transmission may use network resources more efficiently than multiple point-to-point messages; however, creating optimal multicast trees (Steiner Tree Problem in Networks) is prohibitively expensive. For this reason, heuristic methods are generally employed. Conventional centralized Steiner heuristics provide effective solutions, but they are unpractical for large networks, since they require complete knowledge of the network topology. This paper proposes a distributed algorithm for the heuristic solution of the Steiner Tree Problem. The algorithm allows the construction of effective distribution trees using a coordination protocol among the network nodes. The algorithm has been i…
Enabling Retransmissions for Achieving Reliable Multicast Communications in WSNs
2016
To ensure end-to-end reliable multicast or broadcast transmissions in IEEE 802.15.4 based wireless sensor networks WSNs) is a challenging task since no retransmission and acknowledgment mechanisms are defined in such WSNs. In this paper, we propose three retransmission enabled multicast transmission schemes in order to achieve reliable packet transmissions in such networks. Different from the legacy CSMA/CA principle, these schemes allow a sending or forwarding node to retransmit a packet if necessary and enable implicit or/and explicit acknowledgment for multicast services. Simulations are performed in order to assess the performance of these schemes in terms of number of retransmissions, …
Evaluation and improvement of collective flooding in WSNs with various link correlations
2015
One of the main challenges confronted by wireless sensor networks (WSNs) is to reduce energy consumption of nodes for the purpose of network lifetime extension. In the literature, many backbone based protocols such as connected dominating set (CDS) and broadcast or multicast based protocols are employed in order to improve network performance in terms of metrics like energy consumption, number of transmissions and dissemination delay. In this paper, we evaluate the performance of a recently proposed transmission protocol known as collective flooding (CF), which is based on link correlation, under various link correlation conditions. Through simulations and analyses we demonstrate that altho…
Quality of Service Multicasting over Differentiated Services Networks
2003
This paper proposes a solution to support real-time multicast traffic with Quality of Service (QoS) constraints over Differentiated Services (DiffServ) IP networks. Our solution allows multicast users to dynamically join and leave the multicast tree. Moreover, it allows a multicast user which has negotiated a best-effort session to upgrade to a QoS-enabled session. Our solution is backward compatible with the Protocol Independent Multicast (PIM) scheme. It combines two ideas. First, resource availability along a new QoS path is verified via a probe-based approach. Second, QoS is maintained by marking replicated packets with a special DSCP value, before forwarding them on the QoS path.
Clustering-Based Algorithm for Connectivity Maintenance in Vehicular Ad-Hoc Networks
2014
International audience; Among recent advances in wireless communication technologies' field, Vehicular Ad-hoc Networks (VANETs) have drawn the attention of both academic and industry researchers due to their potential applications including driving safety, entertainment, emergency applications, and content sharing. VANET networks are characterized by their high mobile topology changes. Clustering is one of the control schemes used to make this global topology less dynamic. It allows the formation of dynamic virtual backbone used to organize the medium access, to support quality of service and to simplify routing. Mainly, nodes are organized into clusters with at least one cluster head (CH) …
Self-organization of Computation in Neural Systems
2015
When learning a complex task our nervous system self-organizes large groups of neurons into coherent dynamic activity patterns. During this, a cell assembly network with multiple, simultaneously active, and computationally powerful assemblies is formed; a process which is so far not understood. Here we show that the combination of synaptic plasticity with the slower process of synaptic scaling achieves formation of such assembly networks. This type of self-organization allows executing a difficult, six degrees of freedom, manipulation task with a robot where assemblies need to learn computing complex non-linear transforms and - for execution - must cooperate with each other without interfer…
LaCoDa: Layered connected topology for massive data centers
2017
One of the fundamental challenges of existing data centers is to design a network that interconnects massive number of servers, and therefore providing an efficient and fault-tolerant routing service to upper-layer applications. Several solutions have been proposed (e.g. FatTree, DCell and BCube), however they either scale too fast (i.e., double exponentially) or too slow. This paper proposes a new data center topology, called LaCoDa, that combines the advantages of previous topologies while avoiding their limitations. LaCoDa uses a small node degree that matches physical restriction for servers, and it also interconnects a large number of servers while reducing the wiring complexity and wi…
Towards Modelling Information Security with Key-Challenge Petri Nets
2009
Our global information society is based on distributed wide-area networks. Network security consists of the provisions made in an underlying computer network infrastructure, policies adopted by the network administrator to protect the network-accessible resources from unauthorized access, as well as continuous monitoring and measurement of the network security's effectiveness. In this paper, we describe the use of Petri nets in modelling network security. We propose a new hierarchical method for modelling network attacks and evaluating effectiveness of the corresponding defences. Our model is called Key-Challenge Petri Net (KCPN).
A New Genetic Approach for the Partitioning Problem in Distributed Virtual Environment Systems
2004
The Partitioning problem is a key issue in the design of Distributed Virtual Environment (DVE) systems based on a server-network architecture. This problem consist of efficiently assigning the clients of the simulation (avatars) to the system servers. Despite the existing literature proposes different evolutive approaches for solving this NP-hard problem, an approach based on genetic algorithms is considered as the current best partitioning mechanism.