Search results for "Distributed computing"

showing 10 items of 622 documents

Cost-Efficient On-Chip Routing Implementations for CMP and MPSoC Systems

2011

[EN] The high-performance computing domain is enriching with the inclusion of networks-on-chip (NoCs) as a key component of many-core (CMPs or MPSoCs) architectures. NoCs face the communication scalability challenge while meeting tight power, area, and latency constraints. Designers must address new challenges that were not present before. Defective components, the enhancement of application-level parallelism, or power-aware techniques may break topology regularity, thus, efficient routing becomes a challenge. This paper presents universal logic-based distributed routing (uLBDR), an efficient logic-based mechanism that adapts to any irregular topology derived from 2-D meshes, instead of usi…

RouterComputer scienceRouting tableDistributed computing02 engineering and technologyMPSoCNetwork topology01 natural sciencesNetworks-on-chip0103 physical sciences0202 electrical engineering electronic engineering information engineeringElectrical and Electronic EngineeringRouting010302 applied physicsStatic routingbusiness.industryComputer Graphics and Computer-Aided Design020202 computer hardware & architectureFault-toleranceARQUITECTURA Y TECNOLOGIA DE COMPUTADORESNetwork on a chip13. Climate actionLogic designEmbedded systemScalabilityMultipath routingbusinessSoftwareIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
researchProduct

AQM Stability in Multiple Bottleneck Networks

2004

In this paper, we highlight that multiple bottlenecks can affect the performance of active queue management controllers, which are usually configured on a single bottleneck basis, as if each controller were the only element regulating the TCP traffic along its path. To see this, we consider a network scenario where RED is configured at each router, according to previously developed control theoretic techniques. These configuration rules assure stability in a single bottleneck scenario. Yet, we show that instability may arise when two link become congested. We justify this result through a multiple bottleneck model and give guidelines for new cooperative AQM controllers.

RouterQueueing theorybusiness.industryComputer scienceDistributed computingPropagation delayActive queue managementBottleneckActive Queue Management bottlenecksIntelligent NetworkSettore ING-INF/04 - AutomaticaControl theoryPath (graph theory)Settore MAT/09 - Ricerca OperativabusinessComputer network
researchProduct

Computer networks stability independence of the queuing delays

2015

Communication in intelligent computer networks is an indispensible attribute of the dataflow quality in Web traffic. We propose a model that investigates intelligent computer networks stability while specifying its limits. Packet queuing delay affects the performance of the network, and especially its stability. If the network is presented as a dynamic system in block diagram form, we compute a transfer function and determine the quasi-polynomial system. The characteristic polynomial distribution of zeros of complex variable quasi-plane determines the boundaries of the network stability. The approach relies on estimation of the network system's transfer functions and its quasi-polynomial. C…

RouterQueueing theorycommunicationbusiness.industryNetwork packetDataflowComputer scienceDistributed computingWeb trafficalgorithmsStability (probability)quasi polynomialsExponential stabilityComputer Science::Networking and Internet ArchitectureQueuing delayqueuing theoryNetwork performancesignal processingbusinessIntelligent computer networksmathematical modelComputer networkFifth International Conference on the Innovative Computing Technology (INTECH 2015)
researchProduct

Parallel Genetic Algorithms for the Tuning of a Fuzzy AQM Controller

2003

This paper presents the results of the application of a parallel Genetic Algorithm (GA) in order to design a Fuzzy Proportional Integral (FPI) controller for active queue management on Internet routers. The Active Queue Management (AQM) policies are those policies of router queue management that allow the detection of network congestion, the notification of such occurrences to the hosts on the network borders, and the adoption of a suitable control policy. Two different parallel implementations of the genetic algorithm are adopted to determine an optimal configuration of the FPI controller parameters. Finally, the results of several experiments carried out on a forty nodes cluster of workst…

RouterSettore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniQueue management systemComputer sciencebusiness.industryDistributed computingFuzzy control systemActive queue managementFuzzy logicNetwork congestionTCP Actuve Queue Management Genetic algorithms Fuzzy logic AQM TCP congestion controlControl theoryGenetic algorithmbusinessComputer network
researchProduct

A Migration Path for the Internet: From Best-Effort to a QoS Capable Infrastructure by Means of Localized Admission Control

2000

Looking back at many proposals appeared on the scene in these years, a fundamental lesson to be learned is that their success or failure is strictly tied to their backward compatibility with existing infrastructures. In this paper, we consider the problem of providing explicit admission control decisions for QoS aware services. We rely the decision to admit a new flow upon the successful and timely delivery, through the Internet, of probe packets independently generated by the end points. Our solution, called GRIP (Gauge&Gate Realistic Internet Protocol), is fully distributed and scalable, as admission control decisions are taken at the edge network nodes, and no coordination between router…

Routerbusiness.industryComputer scienceNetwork packetResource Reservation Protocolcomputer.internet_protocolQuality of serviceInternet layerDistributed computingComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSAdmission controlBackward compatibilitylaw.inventionlawInternet ProtocolThe InternetbusinesscomputerComputer network
researchProduct

A new Scheme for RPL to handle Mobility in Wireless Sensor Networks

2017

Mobile wireless sensor networks (WSNs) are characterised by dynamic changes in the network topology leading to route breaks and disconnections. The IPv6 routing protocol for low power and lossy networks (RPL), which has become a standard, uses the Trickle timer algorithm to handle changes in the network topology. However, neither RPL nor Trickle timer are well adapted to mobility. This paper investigates the problem of supporting mobility when using RPL. It enhances RPL to fit with sensors' mobility by studying two cases. Firstly, it proposes to modify RPL in order to fit with a dynamic and hybrid topology in the context of medical applications. Secondly, it investigates a more general case…

Routing protocol020203 distributed computingComputer Networks and CommunicationsComputer sciencebusiness.industryNetwork packetComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS020206 networking & telecommunicationsContext (language use)02 engineering and technologyNetwork topologyIPv6Key distribution in wireless sensor networksHardware and Architecture0202 electrical engineering electronic engineering information engineeringTimerbusinessWireless sensor networkSoftwareComputer networkInternational Journal of Ad Hoc and Ubiquitous Computing
researchProduct

A self-routing protocol for distributed consensus on logical information

2010

In this paper, we address decision making problems, depending on a set of input events, with networks of dynamic agents that have partial visibility of such events. Previous work by the authors proposed so-called logical consensus approach, by which a network of agents, that can exchange binary values representing their local estimates of the events, is able to reach a unique and consistent decision. The approach therein proposed is based on the construction of an iterative map, whose computation is centralized and guaranteed under suitable conditions on the input visibility and graph connectivity. Under the same conditions, we extend the approach in this work by allowing the construction o…

Routing protocol020301 aerospace & aeronautics0209 industrial biotechnologyoptimal information flowComputer scienceDistributed computingMulti-agent systemVisibility (geometry)Graph theory02 engineering and technologyLogical consensus algorithm020901 industrial engineering & automationSettore ING-INF/04 - Automatica0203 mechanical engineeringConsensusRouting (electronic design automation)Wireless sensor networkConnectivity
researchProduct

MAC strategies for single rendezvous multi-hop cognitive radio networks

2009

This paper presents two MAC strategies for multi-hop cognitive radio networks in single radio multi-channel cases. Both strategies use one of the idle multiple channels for communication among secondary users, and the network will leave the current channel and jump to another channel as a group if any primary user appears. The first strategy is based on a pre-defined pattern that will always tune to the next available channel when primary user emerges. The second one is based on the concept of connected dominating set in which a backbone is formed in the network in order to keep the continuity of the communication. The strategies are evaluated in both homogeneous and heterogeneous channels …

Routing protocolCognitive radiobusiness.industryComputer scienceDistributed computingRendezvousThroughputbusinessConnected dominating setComputer Science::Information TheoryComputer networkHop (networking)Communication channel2009 IEEE 20th International Symposium on Personal, Indoor and Mobile Radio Communications
researchProduct

Assignment of Roles and Channels for a Multichannel MAC in Wireless Mesh Networks

2009

International audience; A multichannel MAC improves throughput in wireless mesh networks by multiplexing transmissions over orthogonal channels. In this paper, we propose an efficient way for constructing the wireless mesh structure associated with Molecular MAC, a multichannel MAC layer designed for efficient packet forwarding. Molecular MAC outperforms other classical approaches, but requires a specific structure for efficient operation. First, we propose a centralized protocol that provides an upper bound for constructing such a molecular structure through a MILP (Mixed Integer Linear Programming) formulation that maximizes network capacity. Then, we present two distributed self-stabiliz…

Routing protocolComputer scienceDistributed computing[ INFO.INFO-NI ] Computer Science [cs]/Networking and Internet Architecture [cs.NI]Mesh networkingThroughput0102 computer and information sciences02 engineering and technology01 natural sciencesMultiplexinglaw.invention[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]law0202 electrical engineering electronic engineering information engineeringComputer Science::Networking and Internet ArchitectureComputer Science::Information TheorySpanning treeWireless mesh network[INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI]business.industryRadio Link ProtocolComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSPacket forwarding020206 networking & telecommunications010201 computation theory & mathematicsbusinessCommunication channelComputer network
researchProduct

ECAR: an Energy/Channel Aware Routing Protocol For Cooperative Wireless Sensor Networks

2011

International audience; The proliferation of low power networks like Wireless Sensor Networks (WSN) rose up new challenges. Power conservation and channel quality become the most important parameters. Obviously, hop count based routing protocols are no more adapted to such networks having power limitations and channel problems. Several alternatives were suggested to cope with these constraints. In MAC layer for example, cooperative protocols were designed to enhance the channel use: the neighbor nodes help the source to retransmit its packets. However, if the path proposed by the routing protocol contains poor channels, the cooperative communications will not save all the packets. Therefore…

Routing protocolDynamic Source RoutingComputer scienceDistributed computing[ INFO.INFO-NI ] Computer Science [cs]/Networking and Internet Architecture [cs.NI]Enhanced Interior Gateway Routing ProtocolWireless Routing Protocol02 engineering and technology01 natural sciencesHop (networking)Routing Information Protocol[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]Ad hoc On-Demand Distance Vector Routing0202 electrical engineering electronic engineering information engineeringDestination-Sequenced Distance Vector routingwireless sensor networksComputingMilieux_MISCELLANEOUSenergy efficiency0105 earth and related environmental sciencesZone Routing ProtocolStatic routing010505 oceanographyNetwork packetbusiness.industryComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSPath vector protocol020206 networking & telecommunicationsDistance-vector routing protocolLink-state routing protocolOptimized Link State Routing ProtocolInterior gateway protocolbusinesscooperative relayingWireless sensor networkbiobjective routing protocolEfficient energy useComputer network
researchProduct