A ROBUST ORGANIZATIONAL POLICY FOR TASK AND RESOURCE ALLOCATION: A NOVEL FRAMEWORK
Journal Title: International Journal of Computer Engineering & Technology (IJCET) - Year 2019, Vol 10, Issue 2
Abstract
In a Multi-Agent System existing formalisms for implementing organizational policies assign specific roles to each agent. Examples are hierarchical organization, contract net protocol, social reasoning mechanism, and the use of matchmaker agents. These policies allow the problem solving roles of the agents to change dynamically but do not adapt to variations in computational load on the multi-agent system. They are designed to operate for a predefined maximum problem-solving load and fail to respond, when the number of task requests, exceed this limit. This paper proposes an adaptive organizational policy, called E-RTA (Efficient Resource and Task Allocation), for Multi-Agent-Systems that operate under time constraints and varying computational loads. We consider MAS (Multi-AgentSystems) as consisting for several problem-solving organizations where each organization is comprises multiple agents that may be grouped into teams for specific problem solving.
Authors and Affiliations
SHUEB ALI KHAN and VINIT KUMAR SHARMA
BUFFER BASED ROUTING MECHANISM FOR LOAD BALANCING IN WIRELESS MESH NETWORKS
In recent years it is witnessed that the Wireless Mesh Networks (WMNs) are becoming the most promising technology as they offer low cost broadband wireless connectivity, larger coverage area, high flexibility and easy...
REVIEW ON CLUSTERING CANCER GENES
Present studies, development of genomic technologies are highly concentrated on galactic scale gene data. In Bioinformatics community, the sizable volume of gene data investigation and distinguishing the behavior of ge...
GPU BASED TOOLBOX FOR FUZZY LOGIC SYSTEM USING WHALE OPTIMIZATION ALGORITHM
Fuzzy Logic System (FLS) is an efficient method to solve engineering problems. However, the training of a Fuzzy Logic System is a time-consuming task. Optimization Algorithm can be used to optimize the rule base of any...
PERMUTATION LABELING OF JOINS OF KITE GRAPH
Let G= (V, E) be a graph with p vertices and q edges. A graph G={V, E} with p vertices and q edges is said to be a Permutation labelling graph if there exists a bijection function f from set of all vertices V G( ) to...
DISTRIBUTED CONTROLLER FAULT TOLERANCE MODEL (DCFT) USING LOAD BALANCING IN SOFTWARE DEFINED NETWORKING
Lack of Flexibility, Centralized Control, and Cost are limitations of the traditional network. Software defined networking (SDN) adds flexibility and programmability in network management by separating the control plan...