Recently we have proposed a novel approach to utilizing agent teams as resource brokers and managers in the grid. Thus far we have presented an overview of the proposed approach discussed how to efficiently implement the information center, where agent teams advertise their needs and resources. In this paper we focus our attention on the way that user selects agent team that will execute its job. Details of initial implementation are presented and discussed
{"title":"Selecting Grid-Agent-Team to Execute User-Job--Initial Solution","authors":"M. Dominiak, M. Ganzha, M. Paprzycki","doi":"10.1109/CISIS.2007.51","DOIUrl":"https://doi.org/10.1109/CISIS.2007.51","url":null,"abstract":"Recently we have proposed a novel approach to utilizing agent teams as resource brokers and managers in the grid. Thus far we have presented an overview of the proposed approach discussed how to efficiently implement the information center, where agent teams advertise their needs and resources. In this paper we focus our attention on the way that user selects agent team that will execute its job. Details of initial implementation are presented and discussed","PeriodicalId":328547,"journal":{"name":"First International Conference on Complex, Intelligent and Software Intensive Systems (CISIS'07)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125788723","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}
The omni-directional image has more advantages in that it provides a wider view than a single directional camera and able to realize flexible TV conferencing even between remotely separated small rooms. In this paper, a new teleconference system by high definition flexible middleware system for omni-directional video transmission is introduced. We describe system architecture and functions of the middleware for high-definition omni-directional image control and effective video transmission system using DV and HDV (1080i format). QoS control function is also introduced to dynamically control the frame rate of video depending on the changes of network and CPU load. The prototype system of a TV conference is constructed to evaluate the performance of our suggested high-definition omni-directional system. Through the performance evaluation of the prototyped system, we could verify the usefulness of our proposed system
{"title":"Implementation and Performance of a New Teleconference System by High Definition Omni-Directional Video Transmission over IP Network","authors":"Yosuke Sato, Yuya Maita, K. Hashimoto, Y. Shibata","doi":"10.1109/CISIS.2007.32","DOIUrl":"https://doi.org/10.1109/CISIS.2007.32","url":null,"abstract":"The omni-directional image has more advantages in that it provides a wider view than a single directional camera and able to realize flexible TV conferencing even between remotely separated small rooms. In this paper, a new teleconference system by high definition flexible middleware system for omni-directional video transmission is introduced. We describe system architecture and functions of the middleware for high-definition omni-directional image control and effective video transmission system using DV and HDV (1080i format). QoS control function is also introduced to dynamically control the frame rate of video depending on the changes of network and CPU load. The prototype system of a TV conference is constructed to evaluate the performance of our suggested high-definition omni-directional system. Through the performance evaluation of the prototyped system, we could verify the usefulness of our proposed system","PeriodicalId":328547,"journal":{"name":"First International Conference on Complex, Intelligent and Software Intensive Systems (CISIS'07)","volume":"14 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127444274","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}
Broadband satellite constellation networks will be required to carry all types of IP traffic, real time interactive traffic as well as non-real time traffic, warranting the need for appropriate QoS for these different traffic flows. In this paper we investigate the need for MPLS traffic engineering in GEO/MEO/LEO satellite networks to address QoS issues. We compare the service received by TCP and UDP flows when they share a link and when they are routed on explicit MPLS traffic trunks. Since MPLS traffic trunks allow non-shortest path links also to be used, the total network throughput goes up with proper traffic engineering. If UDP and TCP flows are mixed in a trunk, TCP flows receive reduced service as the UDP flows increase their rates. Also, we found that with MPLS traffic engineering we can protect real time traffic and VoIP traffic from packet loss and excessive jitter by separating them from other congestion unresponsive flows
{"title":"MPLS Traffic Engineering in Satellite Networks","authors":"A. Durresi, M. Durresi, F. Xhafa","doi":"10.1109/CISIS.2007.39","DOIUrl":"https://doi.org/10.1109/CISIS.2007.39","url":null,"abstract":"Broadband satellite constellation networks will be required to carry all types of IP traffic, real time interactive traffic as well as non-real time traffic, warranting the need for appropriate QoS for these different traffic flows. In this paper we investigate the need for MPLS traffic engineering in GEO/MEO/LEO satellite networks to address QoS issues. We compare the service received by TCP and UDP flows when they share a link and when they are routed on explicit MPLS traffic trunks. Since MPLS traffic trunks allow non-shortest path links also to be used, the total network throughput goes up with proper traffic engineering. If UDP and TCP flows are mixed in a trunk, TCP flows receive reduced service as the UDP flows increase their rates. Also, we found that with MPLS traffic engineering we can protect real time traffic and VoIP traffic from packet loss and excessive jitter by separating them from other congestion unresponsive flows","PeriodicalId":328547,"journal":{"name":"First International Conference on Complex, Intelligent and Software Intensive Systems (CISIS'07)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121452189","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}
In this paper, we introduce an emergence modeling approach to the study of e-service composition, which is inspired by the characteristics of emergence and self-evolution in biological neuroendocrine and immune system. E-services are represented by autonomous bio-entities (mobile agents with biological operation), each bio-entity is described by a Melay state machine. The request of integrating complex processes is translated to an automata analysis problem. Bio-entities establish emergent network based on the matching message to provide e-service composition. Affinity is a parameter which can measure the message matching ability of the bio-entity integrally, it depends on three factors, namely, the matching strength of message, the e-service quality score, and the trust. In this way, the method completes a series of work from composition to management autonomously. The simulation results show that the approach can significantly improve the e-service composition performance. It adapts well to the changes of dynamic environments
{"title":"E-Service Emergence: A Bio-Inspired Method of Composition","authors":"Hongbin Sun, Yongsheng Ding","doi":"10.1109/CISIS.2007.20","DOIUrl":"https://doi.org/10.1109/CISIS.2007.20","url":null,"abstract":"In this paper, we introduce an emergence modeling approach to the study of e-service composition, which is inspired by the characteristics of emergence and self-evolution in biological neuroendocrine and immune system. E-services are represented by autonomous bio-entities (mobile agents with biological operation), each bio-entity is described by a Melay state machine. The request of integrating complex processes is translated to an automata analysis problem. Bio-entities establish emergent network based on the matching message to provide e-service composition. Affinity is a parameter which can measure the message matching ability of the bio-entity integrally, it depends on three factors, namely, the matching strength of message, the e-service quality score, and the trust. In this way, the method completes a series of work from composition to management autonomously. The simulation results show that the approach can significantly improve the e-service composition performance. It adapts well to the changes of dynamic environments","PeriodicalId":328547,"journal":{"name":"First International Conference on Complex, Intelligent and Software Intensive Systems (CISIS'07)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127408228","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}
A. Aikebaier, Naohiro Hayashibara, T. Enokido, M. Takizawa
In distributed applications like computer supported cooperative work (CSCW), multiple peer processes are required to cooperate to make a global decision, e.g. fix a date for a meeting of multiple persons. We discuss how multiple peer processes make a decision to achieve some objectives in a peer-to-peer (P2P) overlay network. Here, every process is assumed to be peer and autonomous. A domain of a process is a collection of possible values which the process can take. Each process first takes a value v in its domain and notifies the other processes of the value v. A process can change the value to another value on receipt of values from other processes. However, a process may not take every value in the domain and can take only some value depending on the value v. For example, a process may abort after notifying commit but cannot commit after abort in the commitment control. An existentially dominant relation shows what values a process can take after taking a value. In addition, values are also ordered in the preferential relation. Based on the existential and preferential relations, each process takes the most preferable value in the domain, which is dominantly preceded by the value v. In this paper, we discuss how every process makes an agreement on a tuple of values while each process can change the value according to the existential and preferential relations. In this paper, we discuss a coordination protocol in a type of heterogeneous system where every pair of processes have the same domain but may have different existential and preferential relations. Each process learns a part of the relations of another process through exchanging values
{"title":"A Distributed Coordination Algorithm for a Heterogeneous Group of Peers","authors":"A. Aikebaier, Naohiro Hayashibara, T. Enokido, M. Takizawa","doi":"10.1109/CISIS.2007.3","DOIUrl":"https://doi.org/10.1109/CISIS.2007.3","url":null,"abstract":"In distributed applications like computer supported cooperative work (CSCW), multiple peer processes are required to cooperate to make a global decision, e.g. fix a date for a meeting of multiple persons. We discuss how multiple peer processes make a decision to achieve some objectives in a peer-to-peer (P2P) overlay network. Here, every process is assumed to be peer and autonomous. A domain of a process is a collection of possible values which the process can take. Each process first takes a value v in its domain and notifies the other processes of the value v. A process can change the value to another value on receipt of values from other processes. However, a process may not take every value in the domain and can take only some value depending on the value v. For example, a process may abort after notifying commit but cannot commit after abort in the commitment control. An existentially dominant relation shows what values a process can take after taking a value. In addition, values are also ordered in the preferential relation. Based on the existential and preferential relations, each process takes the most preferable value in the domain, which is dominantly preceded by the value v. In this paper, we discuss how every process makes an agreement on a tuple of values while each process can change the value according to the existential and preferential relations. In this paper, we discuss a coordination protocol in a type of heterogeneous system where every pair of processes have the same domain but may have different existential and preferential relations. Each process learns a part of the relations of another process through exchanging values","PeriodicalId":328547,"journal":{"name":"First International Conference on Complex, Intelligent and Software Intensive Systems (CISIS'07)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130481019","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}
The trend of grid computing towards more data intensive applications, accessing more and more relational databases and requiring advanced data integration, is still upstanding. Metadata information, e.g. for selection of suitable candidates among similar sources and the exclusion of not required ones, plays a vital role for efficient data integration on the grid. However, there is a lack of service oriented monitoring tools providing this metadata for relational data sources. We stay abreast of this development and make relational databases first class citizens in grid computing by providing a service oriented monitoring tool tailored towards them. To the best of our knowledge, no research effort has been reported on this so far. This paper presents novel usage scenarios needing additional metadata and monitoring information about relational data sources on the grid - in the areas of query optimization, adaptive query processing and data integration management - and requirements to be fulfilled by a monitoring service providing such information. Our approach supports coarse and fine grained information about heterogeneous relational databases via a uniform interface and provides a homogeneous view on the available metadata. We have evaluated our approach by implementing a research prototype based on the Web Service Resource Framework implementation of the current Globus Toolkit. The functionality and performance of the prototype is demonstrated for commonly used relational databases such as MySQL, PostgreSQL and Oracle
{"title":"A Monitoring Service for Relational Databases to Support Advanced Data Integration on the Grid","authors":"A. Wöhrer, P. Brezany","doi":"10.1109/CISIS.2007.6","DOIUrl":"https://doi.org/10.1109/CISIS.2007.6","url":null,"abstract":"The trend of grid computing towards more data intensive applications, accessing more and more relational databases and requiring advanced data integration, is still upstanding. Metadata information, e.g. for selection of suitable candidates among similar sources and the exclusion of not required ones, plays a vital role for efficient data integration on the grid. However, there is a lack of service oriented monitoring tools providing this metadata for relational data sources. We stay abreast of this development and make relational databases first class citizens in grid computing by providing a service oriented monitoring tool tailored towards them. To the best of our knowledge, no research effort has been reported on this so far. This paper presents novel usage scenarios needing additional metadata and monitoring information about relational data sources on the grid - in the areas of query optimization, adaptive query processing and data integration management - and requirements to be fulfilled by a monitoring service providing such information. Our approach supports coarse and fine grained information about heterogeneous relational databases via a uniform interface and provides a homogeneous view on the available metadata. We have evaluated our approach by implementing a research prototype based on the Web Service Resource Framework implementation of the current Globus Toolkit. The functionality and performance of the prototype is demonstrated for commonly used relational databases such as MySQL, PostgreSQL and Oracle","PeriodicalId":328547,"journal":{"name":"First International Conference on Complex, Intelligent and Software Intensive Systems (CISIS'07)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132172470","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}
In this paper, we integrate the traditional finite-state automata (words, or string based) into the membrane computing paradigm, as previous work prevalently concentrated on multiset based automata. We apply P systems with string objects (worms) to implement finite automata, that is, simulating their running, showing that P systems with string objects can properly hold the computability of finite automata. We give the concept of P system with string objects and finite automata, describe the implementation details, and finally make some future work expectation
{"title":"P Systems and Finite Automata","authors":"Xian Xu","doi":"10.1109/CISIS.2007.44","DOIUrl":"https://doi.org/10.1109/CISIS.2007.44","url":null,"abstract":"In this paper, we integrate the traditional finite-state automata (words, or string based) into the membrane computing paradigm, as previous work prevalently concentrated on multiset based automata. We apply P systems with string objects (worms) to implement finite automata, that is, simulating their running, showing that P systems with string objects can properly hold the computability of finite automata. We give the concept of P system with string objects and finite automata, describe the implementation details, and finally make some future work expectation","PeriodicalId":328547,"journal":{"name":"First International Conference on Complex, Intelligent and Software Intensive Systems (CISIS'07)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115364948","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}
In this paper, we study how functional classes guide use of design patterns when implementing mediators. Functional classes is a design style that merges both object-oriented and functional programming paradigms. A functional class is a class without variables having pure functions as methods. Therefore, method calls in functional classes are function calls also in the formal sense. As a result, a functional class is naturally a mediator. In this paper, as the main contribution, we show that functional classes lead to proper use of certain specific design patterns, like Singleton, Adapter, Abstract Factory, and Strategy. We exemplify this with a data mediator implementation called JavaTableFC
{"title":"Functional Classes Guide Use of Design Patterns in Implementing Mediators","authors":"Mikko Kontio, Hannu Mäyrä, Mauno Rönkkö","doi":"10.1109/CISIS.2007.29","DOIUrl":"https://doi.org/10.1109/CISIS.2007.29","url":null,"abstract":"In this paper, we study how functional classes guide use of design patterns when implementing mediators. Functional classes is a design style that merges both object-oriented and functional programming paradigms. A functional class is a class without variables having pure functions as methods. Therefore, method calls in functional classes are function calls also in the formal sense. As a result, a functional class is naturally a mediator. In this paper, as the main contribution, we show that functional classes lead to proper use of certain specific design patterns, like Singleton, Adapter, Abstract Factory, and Strategy. We exemplify this with a data mediator implementation called JavaTableFC","PeriodicalId":328547,"journal":{"name":"First International Conference on Complex, Intelligent and Software Intensive Systems (CISIS'07)","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115897955","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}
Traditionally, protocol engineers have to deal with the design and implementation of complex network services, spending considerable time and effort on creating robust and reliable final source code. Although approaches exist to assist engineers in the development of communication protocols which use several object-oriented frameworks, these do not benefit from new modelling guidelines developed in MDE and UML to exploit automatic code generation from graphical models. This paper introduces a new UML2 profile for communications which guides the construction of software for communications following the client-server architecture. The MDE process is then used to design suitable platform-specific models for the well-known Adaptive Communications Environment (ACE), a high performance C++ toolkit for implementing concurrent and network applications which relies heavily on architectural patterns
{"title":"Applying MDE Methodologies to Design Communication Protocols for Distributed Systems","authors":"Jesús Martínez, P. Merino, Alberto Salmerón","doi":"10.1109/CISIS.2007.11","DOIUrl":"https://doi.org/10.1109/CISIS.2007.11","url":null,"abstract":"Traditionally, protocol engineers have to deal with the design and implementation of complex network services, spending considerable time and effort on creating robust and reliable final source code. Although approaches exist to assist engineers in the development of communication protocols which use several object-oriented frameworks, these do not benefit from new modelling guidelines developed in MDE and UML to exploit automatic code generation from graphical models. This paper introduces a new UML2 profile for communications which guides the construction of software for communications following the client-server architecture. The MDE process is then used to design suitable platform-specific models for the well-known Adaptive Communications Environment (ACE), a high performance C++ toolkit for implementing concurrent and network applications which relies heavily on architectural patterns","PeriodicalId":328547,"journal":{"name":"First International Conference on Complex, Intelligent and Software Intensive Systems (CISIS'07)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124611392","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}
Space-filling curves, particularly Hilbert curves, have proven to be a powerful paradigm for maintaining spatial groupings of multi-dimensional data in a variety of application areas including database systems,data structures and distributed information systems. One significant limitation in the standard definition of Hilbert curves is the requirement that the grid size (i.e. the cardinality) in each dimension be the same. In the real world, not all dimensions are of equal size and the work-around of padding all dimensions to the size of the largest dimension wastes memory and disk space, while increasing the time spent manipulating and communicating these "inflated" values. In this paper we define a new compact Hilbert index which, maintains all the advantages of the standard Hilbert curve and permits dimension cardinalities of varying sizes. This index can be used in any application that would have previously relied on Hilbert curves but, in the case of unequal side lengths, provides a more memory efficient representation. This is particularly important in distributed applications (parallel, P2P and grid), in which not only is memory space saved but communication volume reduced
{"title":"Compact Hilbert Indices for Multi-Dimensional Data","authors":"Chris H. Hamilton, A. Rau-Chaplin","doi":"10.1109/CISIS.2007.16","DOIUrl":"https://doi.org/10.1109/CISIS.2007.16","url":null,"abstract":"Space-filling curves, particularly Hilbert curves, have proven to be a powerful paradigm for maintaining spatial groupings of multi-dimensional data in a variety of application areas including database systems,data structures and distributed information systems. One significant limitation in the standard definition of Hilbert curves is the requirement that the grid size (i.e. the cardinality) in each dimension be the same. In the real world, not all dimensions are of equal size and the work-around of padding all dimensions to the size of the largest dimension wastes memory and disk space, while increasing the time spent manipulating and communicating these \"inflated\" values. In this paper we define a new compact Hilbert index which, maintains all the advantages of the standard Hilbert curve and permits dimension cardinalities of varying sizes. This index can be used in any application that would have previously relied on Hilbert curves but, in the case of unequal side lengths, provides a more memory efficient representation. This is particularly important in distributed applications (parallel, P2P and grid), in which not only is memory space saved but communication volume reduced","PeriodicalId":328547,"journal":{"name":"First International Conference on Complex, Intelligent and Software Intensive Systems (CISIS'07)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121791136","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
扫码关注我们
求助内容：
应助结果提醒方式：