SAFE TUPLESPACE-BASED COORDINATION IN MULTIAGENT SYSTEMS.
Saved in:
| Title: | SAFE TUPLESPACE-BASED COORDINATION IN MULTIAGENT SYSTEMS. |
|---|---|
| Authors: | Minsky, Naftaly H.1, Minsky, Yaron M.2, Ungureanu, Victoria1 |
| Source: | Applied Artificial Intelligence. Jan2001, Vol. 15 Issue 1, p11-33. 23p. |
| Subjects: | LINDA (Computer system), Computer systems, Parallel programming |
| Abstract: | Linda is a high-level coordination model that allows agents to interact via shared tuplespaces without knowing each other's identities and without having to arrange for a definite rendezvous. This high level of abstraction would make Linda particularly suitable for use as a coordination model for heterogeneous distributed systems, if it were not for the fact that the Linda communication is unsafe. In order to enhance the safety of tuplespaces, this article introduces a mechanism for establishing security policies that regulate agent access to tuplespaces. This mechanism is based on a previously published concept of law-governed interaction. It makes a strict separation between the formal statement of a policy, which one calls a "law," and the enforcement of this law, which is carried out by a set of policy-independent trusted controllers. A new policy under this scheme is created basically by formulating its law, and can be easily deployed throughout a distributed system. Two example policies are discussed here in detail: one ensures a secure bidding policy; the other prevents denial of service, by regulating the flow of requests sent to the tuplespaces. [ABSTRACT FROM AUTHOR] |
| Copyright of Applied Artificial Intelligence is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 3953945 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: SAFE TUPLESPACE-BASED COORDINATION IN MULTIAGENT SYSTEMS. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Minsky%2C+Naftaly+H%2E%22">Minsky, Naftaly H.</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Minsky%2C+Yaron+M%2E%22">Minsky, Yaron M.</searchLink><relatesTo>2</relatesTo><br /><searchLink fieldCode="AR" term="%22Ungureanu%2C+Victoria%22">Ungureanu, Victoria</searchLink><relatesTo>1</relatesTo> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Applied+Artificial+Intelligence%22">Applied Artificial Intelligence</searchLink>. Jan2001, Vol. 15 Issue 1, p11-33. 23p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22LINDA+%28Computer+system%29%22">LINDA (Computer system)</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+systems%22">Computer systems</searchLink><br /><searchLink fieldCode="DE" term="%22Parallel+programming%22">Parallel programming</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: Linda is a high-level coordination model that allows agents to interact via shared tuplespaces without knowing each other's identities and without having to arrange for a definite rendezvous. This high level of abstraction would make Linda particularly suitable for use as a coordination model for heterogeneous distributed systems, if it were not for the fact that the Linda communication is unsafe. In order to enhance the safety of tuplespaces, this article introduces a mechanism for establishing security policies that regulate agent access to tuplespaces. This mechanism is based on a previously published concept of law-governed interaction. It makes a strict separation between the formal statement of a policy, which one calls a "law," and the enforcement of this law, which is carried out by a set of policy-independent trusted controllers. A new policy under this scheme is created basically by formulating its law, and can be easily deployed throughout a distributed system. Two example policies are discussed here in detail: one ensures a secure bidding policy; the other prevents denial of service, by regulating the flow of requests sent to the tuplespaces. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Applied Artificial Intelligence is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=3953945 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1080/08839510150204590 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 23 StartPage: 11 Subjects: – SubjectFull: LINDA (Computer system) Type: general – SubjectFull: Computer systems Type: general – SubjectFull: Parallel programming Type: general Titles: – TitleFull: SAFE TUPLESPACE-BASED COORDINATION IN MULTIAGENT SYSTEMS. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Minsky, Naftaly H. – PersonEntity: Name: NameFull: Minsky, Yaron M. – PersonEntity: Name: NameFull: Ungureanu, Victoria IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 01 Text: Jan2001 Type: published Y: 2001 Identifiers: – Type: issn-print Value: 08839514 Numbering: – Type: volume Value: 15 – Type: issue Value: 1 Titles: – TitleFull: Applied Artificial Intelligence Type: main |
| ResultId | 1 |
