Results 11 - 20
of
86
Atomic congestion games: fast, myopic and concurrent
"... We study here the effect of concurrent greedy moves of players in atomic congestion games where n selfish agents (players) wish to select a resource each (out of m resources) so that her selfish delay there is not much. Such games usually admit a global potential that decreases by sequential and se ..."
Abstract
-
Cited by 7 (0 self)
- Add to MetaCart
(Show Context)
We study here the effect of concurrent greedy moves of players in atomic congestion games where n selfish agents (players) wish to select a resource each (out of m resources) so that her selfish delay there is not much. Such games usually admit a global potential that decreases by sequential and selfishly improving moves. However, concurrent moves may not always lead to global convergence. On the other hand, concurrent play is desirable because it might essentially improve the system convergence time to some balanced state. The problem of “maintaining ” global progress while allowing concurrent play is exactly what is examined and answered here. We examine two orthogonal settings: (i) A game where the players decide their moves without global information, each acting “freely ” by sampling resources randomly and locally deciding to migrate (if the new resource is better) via a random experiment. Here, the resources can have quite arbitrary latency that is load dependent. (ii) An “organised” setting where the players are prepartitioned into selfish groups (coalitions) and where each coalition does an improving coalitional move. Here the concurrency is among the members of the coalition. In this second setting, the resources have latency functions that are only linearly dependent on the load, since this is the only case so far where a global potential exists. In both cases (i), (ii) we show that the system converges to an “approximate” equilibrium very fast (in
Ant Algorithms for Search in Unstructured Peer-to-Peer Networks
- IN PROCEEDINGS OF THE PH.D. WORKSHOP, 22ND INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE
, 2006
"... Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is yet known about its applicability to the task of query routing in peer-to-peer environments. This work presents SemAnt, an algorithm for distributed query routing based o ..."
Abstract
-
Cited by 7 (2 self)
- Add to MetaCart
(Show Context)
Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is yet known about its applicability to the task of query routing in peer-to-peer environments. This work presents SemAnt, an algorithm for distributed query routing based on the Ant Colony Optimization meta-heuristic. The experimental results show that the algorithm produces robust results and converges fast. Based on the results gained so far, the goal for the Ph.D. thesis is to extend the algorithm to include strategies for self-adaptation to volatile networks where nodes may leave or join at any time.
Engineering of softwareintensive systems: State of the art and research challenges
- in SoftwareIntensive Systems and New Computing Paradigms, ser. Lecture Notes in Computer Science
"... ..."
(Show Context)
Using Taxonomies for Content-based Routing with Ants
- in Proceedings of the Workshop on Innovations in Web Infrastructure, 15th International World Wide Web Conference (WWW2006
, 2006
"... Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is known yet about its appropriateness for search in peer-to-peer environments. This paper presents SemAnt, a distributed content-based routing algorithm based on the Ant Co ..."
Abstract
-
Cited by 6 (3 self)
- Add to MetaCart
(Show Context)
Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is known yet about its appropriateness for search in peer-to-peer environments. This paper presents SemAnt, a distributed content-based routing algorithm based on the Ant Colony Optimization meta-heuristic and adapted for deployment in peer-to-peer networks. Under the assumption that content is annotated according to a taxonomy, it is possible to determine the hierarchical relationships between queries, and to exploit this information to improve the routing process. Our results show that using taxonomies enhances search performance in peer-to-peer networks. The degree of enhancement is highly dependent on the content distribution in the network.
Theory and practice of Ant Colony Optimization for routing in dynamic telecommunications networks
, 2008
"... Telecommunications networks are becoming increasingly large, dynamic, and heterogeneous. The ..."
Abstract
-
Cited by 5 (2 self)
- Add to MetaCart
(Show Context)
Telecommunications networks are becoming increasingly large, dynamic, and heterogeneous. The
C.: Using group selection to evolve leadership in populations of self-replicating digital organisms
- In: Proceedings of the International Genetic and Evolutionary Computation Conference (GECCO
, 2007
"... This paper describes a study in the evolution of distributed cooperative behavior, specifically leader election, through digital evolution and group selection. In digital evolution, a population of self-replicating computer programs exists in a user-defined computational environment and is subject t ..."
Abstract
-
Cited by 5 (3 self)
- Add to MetaCart
(Show Context)
This paper describes a study in the evolution of distributed cooperative behavior, specifically leader election, through digital evolution and group selection. In digital evolution, a population of self-replicating computer programs exists in a user-defined computational environment and is subject to instruction-level mutations and natural selection. Group selection is the theory that the survival of the individual is linked to the survival of the group, thus encouraging cooperation. The results of experiments using the AVIDA digital evolution platform demonstrate that group selection can produce populations capable of electing a leader and, when that leader is terminated, electing a new leader. This result serves as an existence proof that group selection and digital evolution can produce complex cooperative behaviors, and therefore have promise in the design of robust distributed computing systems.
C.: Directed evolution of communication and cooperation in digital organisms
- In: Proceedings of the European Conference on Artificial Life (ECAL
, 2007
"... Abstract. This paper describes a study in the use of digital evolution to produce cooperative communication behavior in a population of digital organisms. The results demonstrate that digital evolution can produce organisms capable of distributed problem solving through interactions between members ..."
Abstract
-
Cited by 5 (4 self)
- Add to MetaCart
(Show Context)
Abstract. This paper describes a study in the use of digital evolution to produce cooperative communication behavior in a population of digital organisms. The results demonstrate that digital evolution can produce organisms capable of distributed problem solving through interactions between members of the population and their environment. Specifically, the organisms cooperate to distribute among the population the largest value sensed from the environment. These digital organisms have no “built-in ” ability to perform this task; each population begins with a single organism that has only the ability to self-replicate. Over thousands of generations, random mutations and natural selection produce an instruction sequence that realizes this behavior, despite continuous turnover in the population.
A Tile-based Approach for Self-assembling Service Compositions
"... Abstract—This paper presents a novel approach to the design of self-adaptive service-oriented applications based on a new model called service tiles. The approach allows designers to develop a service-oriented system by building an assembly of component services that accomplishes the given goal. The ..."
Abstract
-
Cited by 5 (4 self)
- Add to MetaCart
Abstract—This paper presents a novel approach to the design of self-adaptive service-oriented applications based on a new model called service tiles. The approach allows designers to develop a service-oriented system by building an assembly of component services that accomplishes the given goal. The assembly is computed automatically starting from the specification of a subset of the whole system, a few constraints, and the goals the application should fulfill. An application designed according to the service-tile model can also dynamically self-adapt by replacing, in part or entirely, services in the assembly whenever they fail or the application context changes. The service-tile design technique has been implemented in a prototype and some experiments with several examples demonstrate the feasibility of the approach and its practical efficiency. I.
Evolving quorum sensing in digital organisms
- in Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation
, 2009
"... For centuries it was thought that bacteria live asocial lives. However, recent discoveries show many species of bacteria communicate in order to perform tasks previously thought to be limited to multicellular organisms. Central to this capability is quorum sensing, whereby organisms detect cell dens ..."
Abstract
-
Cited by 5 (3 self)
- Add to MetaCart
(Show Context)
For centuries it was thought that bacteria live asocial lives. However, recent discoveries show many species of bacteria communicate in order to perform tasks previously thought to be limited to multicellular organisms. Central to this capability is quorum sensing, whereby organisms detect cell density and use this information to trigger group behaviors. Quorum sensing is used by bacteria in the formation of biofilms, secretion of digestive enzymes and, in the case of pathogenic bacteria, release of toxins or other virulence factors. Indeed, methods to disrupt quorum sensing are currently being investigated as possible treatments for numerous diseases, including cystic fibrosis, epidemic cholera, and methicillin-resistant Staphylococcus aureus. In this paper we demonstrate the evolution of a quorum sensing behavior in populations of digital organisms. Specifically, we show that digital organisms are capable of evolving a strategy to collectively suppress self-replication, when the population density reaches a specific, evolved threshold. We present the evolved genome of an organism exhibiting this behavior and analyze the collective operation of this “algorithm. ” Finally, through a set of experiments we demonstrate that the behavior scales to populations up to 400 times larger than those in which the behavior evolved.
A model and algorithm for self-adaptation in service-oriented systems
- In IEEE European Conference on Web Services (ECOWS
"... Abstract—In this paper, we address the problem of selfadaptation in internet-scale service-oriented systems. Services need to adapt by select the best neighboring services solely based on local, limited information. In such complex systems, the global significance of the various selection parameters ..."
Abstract
-
Cited by 4 (2 self)
- Add to MetaCart
(Show Context)
Abstract—In this paper, we address the problem of selfadaptation in internet-scale service-oriented systems. Services need to adapt by select the best neighboring services solely based on local, limited information. In such complex systems, the global significance of the various selection parameters dynamically changes. We introduce a novel metric measuring the distribution and potential impact of service properties affecting such selection parameters. We further present an formalism identifying the most significant properties based on aggregated service interaction data. We ultimately provide a ranking algorithm exploiting these dynamic interaction characteristics. Experimental evaluation demonstrates scalability and adaptiveness of our approach. I.
