Content location is a challenging problem in decentralized peer-to-peer systems. And query-flooding algorithm in Gnutella system suffers from poor scalability and considerable network overhead. Currently, based on the Small-world pattern in the P2P system, a piggyback algorithm called interest-based shortcuts gets a relatively better performance. However, we believe it could be improved and become even more efficient, and a cluster-based algorithm is put forward. The main concern of our algorithm is to narrow the search scope in content location. Resource shortcuts are grouped into clusters according to their contents, and resource queries are only searched in related shortcut clusters, so that the search efficiency is guaranteed and the network bandwidth is saved. In our experiment, cluster-based algorithm uses only 40% shortcuts roughly, compared with the former algorithm, and the same success rate is achieved. At the end, we refer the relationship between cluster-based algorithm and semantic overlay networks, which is a potential kind of overlay in the future
{"title":"Efficient content location based on interest-cluster in peer-to-peer system","authors":"Xi Tong, Dalu Zhang, Zhe Yang","doi":"10.1109/ICEBE.2005.59","DOIUrl":"https://doi.org/10.1109/ICEBE.2005.59","url":null,"abstract":"Content location is a challenging problem in decentralized peer-to-peer systems. And query-flooding algorithm in Gnutella system suffers from poor scalability and considerable network overhead. Currently, based on the Small-world pattern in the P2P system, a piggyback algorithm called interest-based shortcuts gets a relatively better performance. However, we believe it could be improved and become even more efficient, and a cluster-based algorithm is put forward. The main concern of our algorithm is to narrow the search scope in content location. Resource shortcuts are grouped into clusters according to their contents, and resource queries are only searched in related shortcut clusters, so that the search efficiency is guaranteed and the network bandwidth is saved. In our experiment, cluster-based algorithm uses only 40% shortcuts roughly, compared with the former algorithm, and the same success rate is achieved. At the end, we refer the relationship between cluster-based algorithm and semantic overlay networks, which is a potential kind of overlay in the future","PeriodicalId":118472,"journal":{"name":"IEEE International Conference on e-Business Engineering (ICEBE'05)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124780229","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}
Zhaoxia Lu, Guangzhou Zeng, Yaping Zhong, Gongping Yang
Reliability as well as fault-tolerance is a fundamental issue for the development of robust mobile agent system. A number of research works is done in these areas. Some researchers adopt the use of spatial replication based approach since it can reduce blocking possibility of mobile agent execution. Unfortunately, this fault-tolerance scheme is not cost effective because it incurs great costs of time and communication, which leads to increased system load. In this paper, we present a dynamic stage construction protocol for mobile agent execution to maintain high performance without being forced to make tradeoffs in reliability. The protocol schedules task execution dynamically according to the execution ability of visited nodes, hence avoid the unnecessary revisit to them at latter stage and cut down total execution time. On the other hand, it has specific node selection strategy to guarantee reliability, decrease communication overhead between two consecutive stages and improve efficiency
{"title":"Enable efficient stage construction for replication based fault-tolerant execution of mobile agent","authors":"Zhaoxia Lu, Guangzhou Zeng, Yaping Zhong, Gongping Yang","doi":"10.1109/ICEBE.2005.60","DOIUrl":"https://doi.org/10.1109/ICEBE.2005.60","url":null,"abstract":"Reliability as well as fault-tolerance is a fundamental issue for the development of robust mobile agent system. A number of research works is done in these areas. Some researchers adopt the use of spatial replication based approach since it can reduce blocking possibility of mobile agent execution. Unfortunately, this fault-tolerance scheme is not cost effective because it incurs great costs of time and communication, which leads to increased system load. In this paper, we present a dynamic stage construction protocol for mobile agent execution to maintain high performance without being forced to make tradeoffs in reliability. The protocol schedules task execution dynamically according to the execution ability of visited nodes, hence avoid the unnecessary revisit to them at latter stage and cut down total execution time. On the other hand, it has specific node selection strategy to guarantee reliability, decrease communication overhead between two consecutive stages and improve efficiency","PeriodicalId":118472,"journal":{"name":"IEEE International Conference on e-Business Engineering (ICEBE'05)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125047871","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}
Xiao Liu, Chengen Wang, Xiaochuan Luo, Dingwei Wang
This paper addresses a dynamic lot-sizing model with outsourcing. All the unsatisfied demands are out-sourced without backlogging, where the inventory capacity is limited and shortages are prohibited. Costs are concave and time varying. Some new properties are obtained in an optimal solution and a dynamic programming algorithm is developed to solve the problem in strongly polynomial time
{"title":"A model and algorithm for out-sourcing planning","authors":"Xiao Liu, Chengen Wang, Xiaochuan Luo, Dingwei Wang","doi":"10.1109/ICEBE.2005.9","DOIUrl":"https://doi.org/10.1109/ICEBE.2005.9","url":null,"abstract":"This paper addresses a dynamic lot-sizing model with outsourcing. All the unsatisfied demands are out-sourced without backlogging, where the inventory capacity is limited and shortages are prohibited. Costs are concave and time varying. Some new properties are obtained in an optimal solution and a dynamic programming algorithm is developed to solve the problem in strongly polynomial time","PeriodicalId":118472,"journal":{"name":"IEEE International Conference on e-Business Engineering (ICEBE'05)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123070774","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 agility of modeling business process simulation (BPS) is required by virtual enterprises. Firstly with some new concepts, such as the atomic business process simulation model (BPSM) and the business process simulation federation (BPSF) etc., a frame of business process simulation model for virtual enterprises (VE-BPSM) is presented. Business processes of a member enterprise are classified into three groups: internal, external and hybrid event-triggered processes. The inter-relationship among them is discussed. To facilitate the business process simulation model for a member enterprise (ME-BPSM) to be reused, every external-event-triggered BPSM or every hybrid event-triggered BPSM is built as an atomic business process simulation model (atomic-BPSM). The VE-BPSM can be built as a BPSF through combining atomic-BPSM of member enterprises, so the agility of modeling BPS for a virtual enterprise could be achieved. Finally, an HLA-based method of developing a VE-BPSM is discussed
{"title":"An agile method of modeling business process simulation for virtual enterprises","authors":"Shaowu Cheng, Xiaofei Xu, G. Wang, Quanlong Li","doi":"10.1109/ICEBE.2005.24","DOIUrl":"https://doi.org/10.1109/ICEBE.2005.24","url":null,"abstract":"The agility of modeling business process simulation (BPS) is required by virtual enterprises. Firstly with some new concepts, such as the atomic business process simulation model (BPSM) and the business process simulation federation (BPSF) etc., a frame of business process simulation model for virtual enterprises (VE-BPSM) is presented. Business processes of a member enterprise are classified into three groups: internal, external and hybrid event-triggered processes. The inter-relationship among them is discussed. To facilitate the business process simulation model for a member enterprise (ME-BPSM) to be reused, every external-event-triggered BPSM or every hybrid event-triggered BPSM is built as an atomic business process simulation model (atomic-BPSM). The VE-BPSM can be built as a BPSF through combining atomic-BPSM of member enterprises, so the agility of modeling BPS for a virtual enterprise could be achieved. Finally, an HLA-based method of developing a VE-BPSM is discussed","PeriodicalId":118472,"journal":{"name":"IEEE International Conference on e-Business Engineering (ICEBE'05)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125384676","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 group-based semantic search method - GBSS is introduced to improve the efficiency and scalability of search in P2P systems. GBSS introduces a hybrid architecture in which the storage and search of raw data is based on DHT network, but the storage and search of meta-data are based on unstructured P2P network. With regard to search algorithm, GBSS introduces a new file grouping method requiring no users' descriptions and constructs friend group relations between nodes based on interest similarity between file groups. The forwarding of users' requests makes use of friend group relations. Simulation tests show that compared with traditional flooding algorithms, GBSS is both efficient and scalable
{"title":"Efficient content locating in peer-to-peer systems","authors":"Haitao Chen, Zunguo Huang, Z. Gong","doi":"10.1109/ICEBE.2005.58","DOIUrl":"https://doi.org/10.1109/ICEBE.2005.58","url":null,"abstract":"A group-based semantic search method - GBSS is introduced to improve the efficiency and scalability of search in P2P systems. GBSS introduces a hybrid architecture in which the storage and search of raw data is based on DHT network, but the storage and search of meta-data are based on unstructured P2P network. With regard to search algorithm, GBSS introduces a new file grouping method requiring no users' descriptions and constructs friend group relations between nodes based on interest similarity between file groups. The forwarding of users' requests makes use of friend group relations. Simulation tests show that compared with traditional flooding algorithms, GBSS is both efficient and scalable","PeriodicalId":118472,"journal":{"name":"IEEE International Conference on e-Business Engineering (ICEBE'05)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125786277","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 paper proposes a Petri net extended with stochastic priced transition and discusses the possible application domain of this new type of Petri net. Firstly we define stochastic priced Petri net (SPPN) by adding a stochastic price to transition. Then we use SPPN to establish the economic model for a simple business process and make profit analysis. Finally we draw a conclusion that using SPPN in business process modeling is feasible
{"title":"A Petri net extended with stochastic priced transition","authors":"Xianming Liu, Shixian Li, Yue Jiang","doi":"10.1109/ICEBE.2005.14","DOIUrl":"https://doi.org/10.1109/ICEBE.2005.14","url":null,"abstract":"The paper proposes a Petri net extended with stochastic priced transition and discusses the possible application domain of this new type of Petri net. Firstly we define stochastic priced Petri net (SPPN) by adding a stochastic price to transition. Then we use SPPN to establish the economic model for a simple business process and make profit analysis. Finally we draw a conclusion that using SPPN in business process modeling is feasible","PeriodicalId":118472,"journal":{"name":"IEEE International Conference on e-Business Engineering (ICEBE'05)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130040935","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}
With the industry's efforts in promoting the use of Web services, a huge number of Web services are being developed for the Web. To improve the service provider's competition advantage, it is necessary to support QoS-aware service discovery mechanism as well as the corresponding measurement system. In this paper we present a QoS measurement framework based on the DAML-QoS ontology, together with the measurement code generator. The DAML-QoS ontology is designed to specify QoS constraints for Web services. It works as a complement to DAML-S to provide QoS-aware service discovery. This paper focuses on its measurement framework to check the service provider's runtime compliance with the advertised service level. The code generator helps to generate the measurement code according to the DAML-QoS specification. This ontology level specification tries to reduce the service's integration complexity and achieve better interoperability, automation and extensibility
{"title":"QoS measurement issues with DAML-QoS ontology","authors":"Chen Zhou, L. Chia, Bu-Sung Lee","doi":"10.1109/ICEBE.2005.100","DOIUrl":"https://doi.org/10.1109/ICEBE.2005.100","url":null,"abstract":"With the industry's efforts in promoting the use of Web services, a huge number of Web services are being developed for the Web. To improve the service provider's competition advantage, it is necessary to support QoS-aware service discovery mechanism as well as the corresponding measurement system. In this paper we present a QoS measurement framework based on the DAML-QoS ontology, together with the measurement code generator. The DAML-QoS ontology is designed to specify QoS constraints for Web services. It works as a complement to DAML-S to provide QoS-aware service discovery. This paper focuses on its measurement framework to check the service provider's runtime compliance with the advertised service level. The code generator helps to generate the measurement code according to the DAML-QoS specification. This ontology level specification tries to reduce the service's integration complexity and achieve better interoperability, automation and extensibility","PeriodicalId":118472,"journal":{"name":"IEEE International Conference on e-Business Engineering (ICEBE'05)","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124591723","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}
Currently, much efforts have being focused on dynamic, personalized QoS-based service selection, however, current QoS models are generally composed of static QoS parameters and haven't taken the dynamic nature of service performance into consideration. In our framework, we extend existing QoS model by adding new attributes that reflect performance of services and rely on ANN to provide client dynamic, on demand service performance prediction. Through this way, a client may be more capable of finding the best service based both on his/her preferences and on the service performance estimation
{"title":"Combining QoS-based service selection with performance prediction","authors":"Zhengdong Gao, Gengfeng Wu","doi":"10.1109/ICEBE.2005.38","DOIUrl":"https://doi.org/10.1109/ICEBE.2005.38","url":null,"abstract":"Currently, much efforts have being focused on dynamic, personalized QoS-based service selection, however, current QoS models are generally composed of static QoS parameters and haven't taken the dynamic nature of service performance into consideration. In our framework, we extend existing QoS model by adding new attributes that reflect performance of services and rely on ANN to provide client dynamic, on demand service performance prediction. Through this way, a client may be more capable of finding the best service based both on his/her preferences and on the service performance estimation","PeriodicalId":118472,"journal":{"name":"IEEE International Conference on e-Business Engineering (ICEBE'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130083292","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}
Continuous improvement is the typical field of e-business information fusion in terms of multi-source data. This research proposes a hybrid Dampster-Shafer method with entropy and information value co-evolutionary for desegregation data. The result shows, the modified theory is a multi-criteria decision tool for information fusion in decreasing the information uncertainty effectively, which can advance the e-business performance of continuous improvement process and quality control
{"title":"Dempster-Shafer evidence theory of information fusion based on info-evolutionary value for e-business with continuous improvement","authors":"Z. Yu, Yezhuang Tian, Bao Xi","doi":"10.1109/ICEBE.2005.48","DOIUrl":"https://doi.org/10.1109/ICEBE.2005.48","url":null,"abstract":"Continuous improvement is the typical field of e-business information fusion in terms of multi-source data. This research proposes a hybrid Dampster-Shafer method with entropy and information value co-evolutionary for desegregation data. The result shows, the modified theory is a multi-criteria decision tool for information fusion in decreasing the information uncertainty effectively, which can advance the e-business performance of continuous improvement process and quality control","PeriodicalId":118472,"journal":{"name":"IEEE International Conference on e-Business Engineering (ICEBE'05)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121827994","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 FECT, a implemented prototype framework to support the publication, selection and composition of Web services on the basis of environment ontology and behavior trace. And a case of Web sale is presented to demonstrate FECT
{"title":"FECT: a framework for automatic composition of Web services","authors":"Lishan Hou, Zhi Jin, Budan Wu","doi":"10.1109/ICEBE.2005.67","DOIUrl":"https://doi.org/10.1109/ICEBE.2005.67","url":null,"abstract":"In this paper, we introduce FECT, a implemented prototype framework to support the publication, selection and composition of Web services on the basis of environment ontology and behavior trace. And a case of Web sale is presented to demonstrate FECT","PeriodicalId":118472,"journal":{"name":"IEEE International Conference on e-Business Engineering (ICEBE'05)","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116051813","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
扫码关注我们
求助内容：
应助结果提醒方式：