Pub Date : 2003-11-03DOI: 10.1109/CMPSAC.2003.1245397
A. Reyes, José R. Espino, Vijai Mohan, M. Nadkar
Enterprise application integration (EAI) is cooperation of disparate systems and components to implement business rules in a distributed environment. "Systems and components" can be computer-aided design (CAD) or software engineering (CASE) tools, enterprise databases, COTS applications, or in-house software. Ad hoc software interfacing (AHSI) is a special kind of EAI. A tradeoff analysis classifies an EAI problem as an AHSI problem when middleware solutions are seen as heavy-handed, i.e., the planned EAI is not expected to become broad enough to justify the generality of a middleware solution or the client is unwilling to pay for a unified data model. AHSI seeks to "wire" extant software applications as components in new, larger software applications. We call applications-as-components "appliponents". AHSI seeks to minimize appliponent modification to the greatest extent possible. We demonstrate solutions to AHSI problems using XML toolkits, domain-specific language toolkits, and Microsoft BizTalk Server.
{"title":"Ad hoc software interfacing: enterprise application integration (EAI) when middleware is overkill","authors":"A. Reyes, José R. Espino, Vijai Mohan, M. Nadkar","doi":"10.1109/CMPSAC.2003.1245397","DOIUrl":"https://doi.org/10.1109/CMPSAC.2003.1245397","url":null,"abstract":"Enterprise application integration (EAI) is cooperation of disparate systems and components to implement business rules in a distributed environment. \"Systems and components\" can be computer-aided design (CAD) or software engineering (CASE) tools, enterprise databases, COTS applications, or in-house software. Ad hoc software interfacing (AHSI) is a special kind of EAI. A tradeoff analysis classifies an EAI problem as an AHSI problem when middleware solutions are seen as heavy-handed, i.e., the planned EAI is not expected to become broad enough to justify the generality of a middleware solution or the client is unwilling to pay for a unified data model. AHSI seeks to \"wire\" extant software applications as components in new, larger software applications. We call applications-as-components \"appliponents\". AHSI seeks to minimize appliponent modification to the greatest extent possible. We demonstrate solutions to AHSI problems using XML toolkits, domain-specific language toolkits, and Microsoft BizTalk Server.","PeriodicalId":173397,"journal":{"name":"Proceedings 27th Annual International Computer Software and Applications Conference. COMPAC 2003","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130101715","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-11-03DOI: 10.1109/CMPSAC.2003.1245384
E. Im, B. C. Neuman
The goal of the work described in this paper was to build a flexible framework for different replication mechanisms in distributed systems that would be suitable for a wide variety of users and applications. A framework was developed that supports multiple replication mechanisms, allows different objects to be maintained with different replication mechanisms, and enables application programmers to provide their own replication mechanisms. It will be argued that this framework allowed the needs of diverse users and applications in large distributed systems to be met. Our work has produced two significant contributions. First, after an examination of replication mechanisms used in distributed systems, a flexible framework that supports multiple replication mechanisms together was designed and developed. Second, following an examination of different levels of replication between replicas, a unified framework for them was produced. This multi-level replication allows the framework to work well with mobile computing by placing different replicas on mobile sites.
{"title":"A flexible framework for replication in distributed systems","authors":"E. Im, B. C. Neuman","doi":"10.1109/CMPSAC.2003.1245384","DOIUrl":"https://doi.org/10.1109/CMPSAC.2003.1245384","url":null,"abstract":"The goal of the work described in this paper was to build a flexible framework for different replication mechanisms in distributed systems that would be suitable for a wide variety of users and applications. A framework was developed that supports multiple replication mechanisms, allows different objects to be maintained with different replication mechanisms, and enables application programmers to provide their own replication mechanisms. It will be argued that this framework allowed the needs of diverse users and applications in large distributed systems to be met. Our work has produced two significant contributions. First, after an examination of replication mechanisms used in distributed systems, a flexible framework that supports multiple replication mechanisms together was designed and developed. Second, following an examination of different levels of replication between replicas, a unified framework for them was produced. This multi-level replication allows the framework to work well with mobile computing by placing different replicas on mobile sites.","PeriodicalId":173397,"journal":{"name":"Proceedings 27th Annual International Computer Software and Applications Conference. COMPAC 2003","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121323039","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-11-03DOI: 10.1109/CMPSAC.2003.1245334
Peter Ahlbrecht, S. Eckstein, Karl Neumann
A couple of specification and modeling languages dedicated to the particularities of mobile systems have been developed as mobile hardware and software gain wide acceptance. Though these languages facilitate describing systems of mobile objects at different levels of abstraction, they do not allow to distinguish between the ever-mobile units and those which provide the fixed subsystems as the context for the mobile entities. However, as this is an essential distinction for many scenarios, in this article we present some suitable constructs as an extension of an already existing specification language from the area of information retrieval.
{"title":"Conceptual modeling of mobile object systems: language constructs for distinguishing between mobile and stationary subsystems","authors":"Peter Ahlbrecht, S. Eckstein, Karl Neumann","doi":"10.1109/CMPSAC.2003.1245334","DOIUrl":"https://doi.org/10.1109/CMPSAC.2003.1245334","url":null,"abstract":"A couple of specification and modeling languages dedicated to the particularities of mobile systems have been developed as mobile hardware and software gain wide acceptance. Though these languages facilitate describing systems of mobile objects at different levels of abstraction, they do not allow to distinguish between the ever-mobile units and those which provide the fixed subsystems as the context for the mobile entities. However, as this is an essential distinction for many scenarios, in this article we present some suitable constructs as an extension of an already existing specification language from the area of information retrieval.","PeriodicalId":173397,"journal":{"name":"Proceedings 27th Annual International Computer Software and Applications Conference. COMPAC 2003","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126806679","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-11-03DOI: 10.1109/CMPSAC.2003.1245377
J. K. Mak, C. Choy, D. Lun
Prior research suggested modeling languages for precise specification of design pattern structures and behaviors. However, seldom has put effort on their integrations as well as their specifications. To provide a first class CASE support to the recognition, verification and application of design patterns as well as their compounds, a precise specification to their leitmotifs is critical. In this paper, we present the essentials of pattern integration and propose an extended version, we name it exLePUS, to a pattern specification language (LePUS) in order to support the specification of these essentials and thus compound patterns. A case study has illustrated how it is used a well-known compound pattern.
{"title":"Precise specification to compound patterns with ExLePUS","authors":"J. K. Mak, C. Choy, D. Lun","doi":"10.1109/CMPSAC.2003.1245377","DOIUrl":"https://doi.org/10.1109/CMPSAC.2003.1245377","url":null,"abstract":"Prior research suggested modeling languages for precise specification of design pattern structures and behaviors. However, seldom has put effort on their integrations as well as their specifications. To provide a first class CASE support to the recognition, verification and application of design patterns as well as their compounds, a precise specification to their leitmotifs is critical. In this paper, we present the essentials of pattern integration and propose an extended version, we name it exLePUS, to a pattern specification language (LePUS) in order to support the specification of these essentials and thus compound patterns. A case study has illustrated how it is used a well-known compound pattern.","PeriodicalId":173397,"journal":{"name":"Proceedings 27th Annual International Computer Software and Applications Conference. COMPAC 2003","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116650726","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-11-03DOI: 10.1109/CMPSAC.2003.1245367
Yung-Ruei Chang, Hung-Yau Lin, Ing-Yi Chen, S. Kuo
In this paper, we propose an algorithm to construct the ordered binary decision diagram (OBDD) representing the cut function of a terminal-pair network. The algorithm recognizes isomorphic sub-problems and thus avoids redundant computations. The system reliability could be efficiently computed by the OBDD. Finally, we propose an approach to compute the importance measures for multiple components by traversing the OBDD only once. The correctness and the effectiveness of our approach are demonstrated by experiments on 30 benchmark networks. The experimental results on a 2-by-100 lattice network, which has 2/sup 99/ paths or 10,000 cuts, show an impressive improvement compared to the previous works using the sum of disjoint products method that have exponential complexity. The CPU time of our method, including the calculation of not only the reliability but also the importance measures, for a 100-stage lattice network is only about 0.24 seconds. Thus, this approach is very helpful for the reliability and sensitivity analysis of large networks.
{"title":"A cut-based algorithm for reliability analysis of terminal-pair network using OBDD","authors":"Yung-Ruei Chang, Hung-Yau Lin, Ing-Yi Chen, S. Kuo","doi":"10.1109/CMPSAC.2003.1245367","DOIUrl":"https://doi.org/10.1109/CMPSAC.2003.1245367","url":null,"abstract":"In this paper, we propose an algorithm to construct the ordered binary decision diagram (OBDD) representing the cut function of a terminal-pair network. The algorithm recognizes isomorphic sub-problems and thus avoids redundant computations. The system reliability could be efficiently computed by the OBDD. Finally, we propose an approach to compute the importance measures for multiple components by traversing the OBDD only once. The correctness and the effectiveness of our approach are demonstrated by experiments on 30 benchmark networks. The experimental results on a 2-by-100 lattice network, which has 2/sup 99/ paths or 10,000 cuts, show an impressive improvement compared to the previous works using the sum of disjoint products method that have exponential complexity. The CPU time of our method, including the calculation of not only the reliability but also the importance measures, for a 100-stage lattice network is only about 0.24 seconds. Thus, this approach is very helpful for the reliability and sensitivity analysis of large networks.","PeriodicalId":173397,"journal":{"name":"Proceedings 27th Annual International Computer Software and Applications Conference. COMPAC 2003","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115088709","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-11-03DOI: 10.1109/CMPSAC.2003.1245319
A. Gotlieb, Bernard Botella
Usual techniques for automatic test data generation are based on the assumption that a complete oracle will be available during the testing process. However, there are programs for which this assumption is unreasonable. Recently, Chen et al. (1998, 2001) proposed to overcome this obstacle by using known relations over the input data and their unknown expected outputs to seek a subclass of faults inside the program. In this paper, we introduce an automatic testing framework able to check these so-called metamorphic relations. The framework makes use of constraint logic programming techniques to find test data that violate a given metamorphic-relation. Circumstances where it can also prove that the program satisfies this relation are presented. The first experimental results we got with a prototype tool build on the top of the test data generator INKA, show that this methodology can be completely automated.
{"title":"Automated metamorphic testing","authors":"A. Gotlieb, Bernard Botella","doi":"10.1109/CMPSAC.2003.1245319","DOIUrl":"https://doi.org/10.1109/CMPSAC.2003.1245319","url":null,"abstract":"Usual techniques for automatic test data generation are based on the assumption that a complete oracle will be available during the testing process. However, there are programs for which this assumption is unreasonable. Recently, Chen et al. (1998, 2001) proposed to overcome this obstacle by using known relations over the input data and their unknown expected outputs to seek a subclass of faults inside the program. In this paper, we introduce an automatic testing framework able to check these so-called metamorphic relations. The framework makes use of constraint logic programming techniques to find test data that violate a given metamorphic-relation. Circumstances where it can also prove that the program satisfies this relation are presented. The first experimental results we got with a prototype tool build on the top of the test data generator INKA, show that this methodology can be completely automated.","PeriodicalId":173397,"journal":{"name":"Proceedings 27th Annual International Computer Software and Applications Conference. COMPAC 2003","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117085049","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-11-03DOI: 10.1109/CMPSAC.2003.1245369
A. Tai, K. Tso, W. Sanders
We present in this paper an extension of the message-driven confidence-driven framework that we developed for onboard guarded software upgrading. The purpose of this work is to provide the framework with the capability of protecting distributed software upgrades that involve message-passing interface changes. To achieve this goal, we propose an approach to clustering the components involved in software upgrades and those involved in message-passing interface changes, such that from outside the cluster all those components can be perceived collectively as one virtual low-confidence component. Moreover, we develop a confidence-driven mechanism that enables combined use of sender- and receiver-side message logging for efficient, fine-grained error containment and recovery. The paper provides a detailed algorithm description.
{"title":"Protecting distributed software upgrades that involve message-passing","authors":"A. Tai, K. Tso, W. Sanders","doi":"10.1109/CMPSAC.2003.1245369","DOIUrl":"https://doi.org/10.1109/CMPSAC.2003.1245369","url":null,"abstract":"We present in this paper an extension of the message-driven confidence-driven framework that we developed for onboard guarded software upgrading. The purpose of this work is to provide the framework with the capability of protecting distributed software upgrades that involve message-passing interface changes. To achieve this goal, we propose an approach to clustering the components involved in software upgrades and those involved in message-passing interface changes, such that from outside the cluster all those components can be perceived collectively as one virtual low-confidence component. Moreover, we develop a confidence-driven mechanism that enables combined use of sender- and receiver-side message logging for efficient, fine-grained error containment and recovery. The paper provides a detailed algorithm description.","PeriodicalId":173397,"journal":{"name":"Proceedings 27th Annual International Computer Software and Applications Conference. COMPAC 2003","volume":"480 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122743939","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-11-03DOI: 10.1109/CMPSAC.2003.1245385
Jun Kong, Kang Zhang, Jing Dong, G. Song
Software architecture and design are usually modeled and represented by informal diagrams, such as architecture diagrams and UML diagrams. While these graphic notations are easy to understand and are convenient to use, they are not amendable to automated verification and transformation. This paper provides graph grammars for architecture and UML class diagrams. These grammars enable a high level of abstraction for the general organization of a class of software architectures, and form a basis for various analysis and transformations. In this approach, software verification is performed through a syntax analyzer. Architecture transformation is achieved by applying predefined transformation rules.
{"title":"A graph grammar approach to software architecture verification and transformation","authors":"Jun Kong, Kang Zhang, Jing Dong, G. Song","doi":"10.1109/CMPSAC.2003.1245385","DOIUrl":"https://doi.org/10.1109/CMPSAC.2003.1245385","url":null,"abstract":"Software architecture and design are usually modeled and represented by informal diagrams, such as architecture diagrams and UML diagrams. While these graphic notations are easy to understand and are convenient to use, they are not amendable to automated verification and transformation. This paper provides graph grammars for architecture and UML class diagrams. These grammars enable a high level of abstraction for the general organization of a class of software architectures, and form a basis for various analysis and transformations. In this approach, software verification is performed through a syntax analyzer. Architecture transformation is achieved by applying predefined transformation rules.","PeriodicalId":173397,"journal":{"name":"Proceedings 27th Annual International Computer Software and Applications Conference. COMPAC 2003","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115478436","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-11-03DOI: 10.1109/CMPSAC.2003.1245323
Shung-Bin Yan, Feng-Jian Wang
Workflow management systems (WfMSs) are accepted worldwide due to their capability to model and control business processes. With WfMS, enterprises can improve work efficiency and react to the emergent situation quickly. However, most WfMSs adopt the centralized architecture in an organization so that they usually lack of a cooperative communication mechanism across different organizations. In this paper, we propose a cooperative framework for inter-organizational workflow systems. The framework consists of an inter-workflow meta-model, CA-PLAN (Cooperative Agentflow Process LANguage), and a prototype system based on Agentflow, a system developed in our laboratory. The cooperation mechanism between WfMSs in CA-PLAN is modeled as a Remote Call Process (RCP) paradigm. A process service is a mechanism that defines a process to participate in an inter-organizational process among different WfMSs and specifies the associated arguments in and out. A remote process is a proxy mechanism that refers to a process service on another WfMS. RCP provides the mechanism by which the process service and the remote process communicate and pass information back and forth and process monitor mechanism. The mechanism, also allowing dynamic changes and reconfiguration, can adapt dynamic and competitive business environment. Through RCP, the cooperative process across organizations becomes simple, faster, and flexible.
工作流管理系统(WfMSs)由于其建模和控制业务流程的能力而被全世界所接受。利用WfMS，企业可以提高工作效率，快速应对突发情况。然而，大多数wfms在组织中采用集中式体系结构，因此它们通常缺乏跨不同组织的协作通信机制。在本文中，我们提出了一个组织间工作流系统的协作框架。该框架由一个工作流间元模型CA-PLAN (Cooperative Agentflow Process LANguage)和一个基于Agentflow的原型系统组成，该系统是我们实验室开发的。CA-PLAN中WfMSs之间的合作机制被建模为远程调用过程(RCP)范式。流程服务是一种机制，它定义了在不同wfms之间参与组织间流程的流程，并指定了进出的相关参数。远程进程是一种代理机制，它引用另一个WfMS上的进程服务。RCP提供了进程服务和远程进程之间进行通信和来回传递信息的机制以及进程监控机制。该机制允许动态变化和重构，能够适应动态竞争的商业环境。通过RCP，跨组织的合作过程变得简单、快速和灵活。
{"title":"A cooperative framework for inter-organizational workflow system","authors":"Shung-Bin Yan, Feng-Jian Wang","doi":"10.1109/CMPSAC.2003.1245323","DOIUrl":"https://doi.org/10.1109/CMPSAC.2003.1245323","url":null,"abstract":"Workflow management systems (WfMSs) are accepted worldwide due to their capability to model and control business processes. With WfMS, enterprises can improve work efficiency and react to the emergent situation quickly. However, most WfMSs adopt the centralized architecture in an organization so that they usually lack of a cooperative communication mechanism across different organizations. In this paper, we propose a cooperative framework for inter-organizational workflow systems. The framework consists of an inter-workflow meta-model, CA-PLAN (Cooperative Agentflow Process LANguage), and a prototype system based on Agentflow, a system developed in our laboratory. The cooperation mechanism between WfMSs in CA-PLAN is modeled as a Remote Call Process (RCP) paradigm. A process service is a mechanism that defines a process to participate in an inter-organizational process among different WfMSs and specifies the associated arguments in and out. A remote process is a proxy mechanism that refers to a process service on another WfMS. RCP provides the mechanism by which the process service and the remote process communicate and pass information back and forth and process monitor mechanism. The mechanism, also allowing dynamic changes and reconfiguration, can adapt dynamic and competitive business environment. Through RCP, the cooperative process across organizations becomes simple, faster, and flexible.","PeriodicalId":173397,"journal":{"name":"Proceedings 27th Annual International Computer Software and Applications Conference. COMPAC 2003","volume":"239 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121166734","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-11-03DOI: 10.1109/CMPSAC.2003.1245345
K. Ragab, N. Kaji, K. Moriyama, K. Mori
Autonomous community information systems (ACIS) is a proposition made to contend with the extreme dynamism in the large-scale information system. ACIS is a decentralized bilateral-hierarchy architecture that forms a community of individual end-users (community members) having the same interests and demands in somewhere, at specified time. It allows the community members to mutually cooperate and share information without loading up any single node excessively. In this paper, an autonomous decentralized community communication technique is proposed to assure a flexible, scalable and a multilateral communication among the community members. The main ideas behind this communication technique are: content-code communication (communication service-based) for flexibility and multilateral benefits communication for scalable and productive cooperation among members. All members communicate productively for the satisfaction of all the community members. The scalability of the system's response time regardless of the number of the community members has been shown by simulation. Thus, the autonomous decentralized community communication technique reveals great results of the response time with continuous increasing in the total number of members.
{"title":"Scalable multilateral communication technique for large-scale information systems","authors":"K. Ragab, N. Kaji, K. Moriyama, K. Mori","doi":"10.1109/CMPSAC.2003.1245345","DOIUrl":"https://doi.org/10.1109/CMPSAC.2003.1245345","url":null,"abstract":"Autonomous community information systems (ACIS) is a proposition made to contend with the extreme dynamism in the large-scale information system. ACIS is a decentralized bilateral-hierarchy architecture that forms a community of individual end-users (community members) having the same interests and demands in somewhere, at specified time. It allows the community members to mutually cooperate and share information without loading up any single node excessively. In this paper, an autonomous decentralized community communication technique is proposed to assure a flexible, scalable and a multilateral communication among the community members. The main ideas behind this communication technique are: content-code communication (communication service-based) for flexibility and multilateral benefits communication for scalable and productive cooperation among members. All members communicate productively for the satisfaction of all the community members. The scalability of the system's response time regardless of the number of the community members has been shown by simulation. Thus, the autonomous decentralized community communication technique reveals great results of the response time with continuous increasing in the total number of members.","PeriodicalId":173397,"journal":{"name":"Proceedings 27th Annual International Computer Software and Applications Conference. COMPAC 2003","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121414538","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：