Sciweavers

674 search results - page 40 / 135
» Scalable simulation of complex network routing policies
Sort
View
NIPS
1993
15 years 7 months ago
Packet Routing in Dynamically Changing Networks: A Reinforcement Learning Approach
This paper describes the Q-routing algorithm for packet routing, in which a reinforcement learning module is embedded into each node of a switching network. Only local communicati...
Justin A. Boyan, Michael L. Littman
INFOCOM
2003
IEEE
15 years 11 months ago
Route Driven Gossip: Probabilistic Reliable Multicast in Ad Hoc Networks
Abstract— Traditionally, reliable multicast protocols are deterministic in nature. It is precisely this determinism that tends to become their limiting factor when aiming at reli...
Jun Luo, Patrick Th. Eugster, Jean-Pierre Hubaux
AHS
2007
IEEE
202views Hardware» more  AHS 2007»
15 years 6 months ago
PERPLEXUS: Pervasive Computing Framework for Modeling Complex Virtually-Unbounded Systems
This paper introduces Perplexus, a European project that aims to develop a scalable hardware platform made of custom reconfigurable devices endowed with bio-inspired capabilities...
Eduardo Sanchez, Andrés Pérez-Uribe,...
WINET
2010
224views more  WINET 2010»
15 years 4 months ago
Hierarchical geographic multicast routing for wireless sensor networks
Wireless sensor networks comprise typically dense deployments of large networks of small wireless capable sensor devices. In such networks, multicast is a fundamental routing servi...
Dimitrios Koutsonikolas, Saumitra M. Das, Y. Charl...
NETWORKING
2008
15 years 7 months ago
Modeling Priority-Based Incentive Policies for Peer-Assisted Content Delivery Systems
Content delivery providers can improve their service scalability and offload their servers by making use of content transfers among their clients. To provide peers with incentive t...
Niklas Carlsson, Derek L. Eager