Topic
Contract Net Protocol
About: Contract Net Protocol is a research topic. Over the lifetime, 606 publications have been published within this topic receiving 13729 citations.
Papers published on a yearly basis
Papers
More filters
25 Sep 2002
TL;DR: In this article, the negotiation process in VE formulation is defined as a basic research to clarify its effective management, and a framework of multi-agent programming with game theoretic approach is newly proposed as negotiation algorithm amongst the agents.
Abstract: In this paper, we focus on negotiation process in VE formulation as a basic research to clarify its effective management. Each enterprise in VE is defined as agent in multi-utilities and a framework of multi-agent programming with game theoretic approach is newly proposed as negotiation algorithm amongst the agents. Each unit is defined as agent in our VE model, and their decision makings are formulated as a gaine theoretic methodology. We adopt CNP (Contract Net Protocol) as the coordination and negotiation mechanism amongst the units. CNP models transfer of control in a distributed system with the metaphor of negotiation among autonomous intelligent beings. CNP consists of a set of nodes that negotiate with one another through a set of message. Nodes generally represent the distributed computing resources to be managed, correspond to “enterprises” in this paper. We develop a computer simulation model to forni VE through multiple negotiations amongst several potential members in the negotiation domain, and finally clarify the formulation dynamism with the negotiation process.
01 Jan 2004
TL;DR: In this article, an agent-based CAPP and PPC integrated architecture under network is proposed to overcome the rigidity of conventional hierarchical structures and to introduce new integrated architectures that are able to adapt to a dynamic environment, at same time the agent technology and self-organized method of holonic manufacturing have been used in attempts to resolve scheduling problem, a bidding mechanism based on Contract Net protocol is proposed as a key solution component.
Abstract: Manufacturing scheduling is a difficult problem, particularly when it takes place in an open and dynamic environment. In this paper Agent-based CAPP and PPC integrated architecture under network is proposed. The objective is to overcome the rigidity of conventional hierarchical structures and to introduce new integrated architectures that are able to adapt to a dynamic environment, at same time the agent technology and self-organized method of holonic manufacturing have been used in attempts to resolve scheduling problem, a bidding mechanism based on Contract Net protocol is proposed as a key solution component. Our approach is to combine a bidding mechanism based on Contract Net protocol with a mediation mechanism based on Mediator architecture, for dynamic manufacturing scheduling and rescheduling.
TL;DR: In this article, an agent-based flexible scheduling for real-world manufacturing systems is proposed, where the allocation of manufacturing resources is achieved through negotiation among the job and machine agents in a multi-agent system.
Abstract: This paper builds an efficient agent-based flexible scheduling for real-world manufacturing systems. Considering the alternative processes and alternative machines, the allocation of manufacturing resources is achieved through negotiation among the job and machine agents in a multi-agent system (MAS). Ant Colony Intelligence (ACI) is proposed to be combined with Contract Net Protocol (CNP) so as to make agents adaptive to changing circumstances. ACI is integrated into both machine agents and job agents to solve the task allocation and sequencing problem. CNP is introduced to allow the agents to cooperate and coordinate their local schedules in order to find globally near-optimal robust schedules. The negotiation protocol is an interactive bidding mechanism based on the hybrid contract net protocol. The implementation of the issues using CNP model is discussed. Experimental results verify the effectiveness and efficiency of the proposed algorithm integrated with ant-inspired coordination.
19 Sep 1997
TL;DR: A programming paradigm for coarse grain and task level parallelism for heterogeneous parallel machines and applications to be quickly developed which can effectively utilize specialized machines without the need for specialized programming is described.
Abstract: Contract-Linda is a novel programming architecture for heterogeneous parallel machines particularly suited to image processing. Previous research has concentrated on static and pre-determined scheduling of computation and on fine grain parallelism. Predetermined scheduling is satisfactory in cases where the computational process is fully deterministic. However with many image interpretation schemes the flow of control and the nature of the computational procedures can only be determined at run-time. In this paper we describe a programming paradigm for coarse grain and task level parallelism. Task management is based on the contract net protocol and utilizes the Linda Coordination Language to provide run-time scheduling. This paradigm accommodates a closely coupled network of heterogeneous processing modules which differ greatly in computational capability; modules based on neural networks, semantic networks, vector and scalar processors are accommodated. Contract-Linda allows specialized heterogeneous machines to be exploited using a straightforward generic programming model. It does this by providing an internal task management mechanism which ensures that the heterogenous processing elements are used by the tasks most suited to them and exploits dynamic parallelism within the problem as it is solved. By separating the task of describing the problem from that of describing how the work is carried out on the machine (and providing a solution for this problem) we allow applications to be quickly developed which can effectively utilize specialized machines without the need for specialized programming.© (1997) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.
07 Aug 2001
TL;DR: A hybrid component model consisting of a CORBA server and a Contract Net Protocol (CNP) algorithm for distributing tasks to multiple computers for enhanced processing is implemented and a significant reduction in processing times is achieved compared to processing on a single computer.
Abstract: The availability of new digital detector technologies and high speed computer processing has led to the development of CAD (computer-aided diagnostic) tools that assist radiologists in detecting and characterizing mammographic lesions. To meet the challenge of developing and implementing algorithms that are computationally intensive, it is desirable to develop reusable components that can execute in a distributed environment. It is well know that the Common Object Request Broker Architecture (CORBA) provides an open solution in distributed computing. We have implemented a hybrid component model consisting of a CORBA server and a Contract Net Protocol (CNP) algorithm for distributing tasks to multiple computers for enhanced processing. Support classes were developed to wrap algorithms developed in C to operate within the distributed framework. CORBA provides communication between agents on different computers and computer platforms and the CNP algorithm is used to select the 'optimal' computer for performing a task. We have evaluated this framework with CAD processing applied to digitized mammograms by transparently scheduling and distributing multiple tasks on three server computers. We achieved a significant reduction in processing times compared to processing on a single computer.