发布求助
文献互助 智能选刊 最新文献

2011 Tenth International Symposium on Autonomous Decentralized Systems最新文献

筛选
英文 中文
An Approach for Service Composition and Testing for Cloud Computing 面向云计算的服务组合与测试方法
2011 Tenth International Symposium on Autonomous Decentralized Systems Pub Date : 2011-03-23 DOI: 10.1109/ISADS.2011.90
W. Tsai, Peide Zhong, Janaka Balasooriya, Yinong Chen, Xiaoying Bai, J. Elston
{"title":"An Approach for Service Composition and Testing for Cloud Computing","authors":"W. Tsai, Peide Zhong, Janaka Balasooriya, Yinong Chen, Xiaoying Bai, J. Elston","doi":"10.1109/ISADS.2011.90","DOIUrl":"https://doi.org/10.1109/ISADS.2011.90","url":null,"abstract":"As cloud services proliferate, it becomes difficult to facilitate service composition and testing in clouds. In traditional service-oriented computing, service composition and testing are carried out independently. This paper proposes a new approach to manage services on the cloud so that it can facilitate service composition and testing. The paper uses service implementation selection to facilitate service composition similar to Google’s Guice and Spring tools, and apply the group testing technique to identify the oracle, and use the established oracle to perform continuous testing for new services or compositions. The paper extends the existing concept of template based service composition and focus on testing the same workflow of service composition. In addition, all these testing processes can be executed in parallel, and the paper illustrates how to apply service-level MapReduce technique to accelerate the testing process.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"3 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114037332","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}
引用次数: 40
Application of Agent in Bus Signal Priority Intersection Agent在公交信号优先交叉口中的应用
2011 Tenth International Symposium on Autonomous Decentralized Systems Pub Date : 2011-03-23 DOI: 10.1109/ISADS.2011.37
Xiangfeng Cao, Decun Dong, X. Zeng
{"title":"Application of Agent in Bus Signal Priority Intersection","authors":"Xiangfeng Cao, Decun Dong, X. Zeng","doi":"10.1109/ISADS.2011.37","DOIUrl":"https://doi.org/10.1109/ISADS.2011.37","url":null,"abstract":"With the growing problem of urban traffic, public transportation is increasingly emphasized by people. Bus priority is an important means of improving public transport. It reflects the principle of \"people-oriented\" in traffic and improves the public service efficiency. As the latest research of the fields of computers and distributed artificial intelligence, Agent provides a new way of solving the traffic problem. This paper makes a simple overview of the Agent, and designs the agent proposal of basic traffic elements of the bus signal priority intersection, at the same time this paper also works out the functional structures and work processes. The strategies of a single bus priority intersection based on agents are studied. The last part is a summary of the whole paper, and looks ahead at the work to be done.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122385469","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}
引用次数: 2
A Server Cache Size Aware Cache Replacement Algorithm for Block Level Network Storage 面向块级网络存储的服务器缓存大小感知缓存替换算法
2011 Tenth International Symposium on Autonomous Decentralized Systems Pub Date : 2011-03-23 DOI: 10.1109/ISADS.2011.80
Yusuke Nagasako, Saneyasu Yamaguchi
{"title":"A Server Cache Size Aware Cache Replacement Algorithm for Block Level Network Storage","authors":"Yusuke Nagasako, Saneyasu Yamaguchi","doi":"10.1109/ISADS.2011.80","DOIUrl":"https://doi.org/10.1109/ISADS.2011.80","url":null,"abstract":"Storage management cost is one of the most important issues in the current computer system. Network storage is deployed in many companies to decrease this cost. In the network storage system, both the server computer and network storage have cache memory for the same storage. In most cache implementation, LRU replacement algorithm, which is suitable for accesses with temporal locality of reference, is adopted. However, accesses to network storage do not have usual temporal locality but have negative temporal locality. Consequently, caches in network storages do not work effectively. In this paper, we propose a new cache replacement algorithm, which is suitable for negative temporal locality of reference. Our simulation evaluation demonstrated that the proposed algorithm provides better cache hit ratio than other existing algorithms.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128491101","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}
引用次数: 9
China Railway Autonomous Service Integration System Based on ADS 基于ADS的中国铁路自主业务集成系统
2011 Tenth International Symposium on Autonomous Decentralized Systems Pub Date : 2011-03-23 DOI: 10.1109/ISADS.2011.47
J. Dang, Shuxu Zhao, Yangping Wang
{"title":"China Railway Autonomous Service Integration System Based on ADS","authors":"J. Dang, Shuxu Zhao, Yangping Wang","doi":"10.1109/ISADS.2011.47","DOIUrl":"https://doi.org/10.1109/ISADS.2011.47","url":null,"abstract":"More and more research has been focused on improving system expansion and data sharing abilities. of the original system. For China railway information systems, in order to follow its development, how to construct the newly effective information system is its important problem, the existing information service must be used in the newly system. In this paper, aiming at those problems mentioned above, a new system service integration method based on Autonomous Decentralized System is proposed. Based on Autonomous Decentralized System and its correlative technologies, this paper proposes a new integrated method based on Knowledge Data Base via Information Flexibility Descending Field (IFDF) Firstly, according to the information service feature, the definition and its logical functional structure of Autonomous Integration Node (AIN)is described, AIN is the key node to implement service integration. Secondly, this paper describes the flexible and rigid information formats, these information formats can be used to implements logical nodes data exchanging autonomously. Lastly, based on the paper's research, China railway autonomous Service Integration System (CSIS) model is given out. Based on ADS and KDB, its on-line ability can be assured.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115610934","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}
引用次数: 3
Pro-Reactive Route Recovery with Automatic Route Shortening in Wireless Ad Hoc Networks 无线Ad Hoc网络中具有自动路由缩短的主动响应路由恢复
2011 Tenth International Symposium on Autonomous Decentralized Systems Pub Date : 2011-03-23 DOI: 10.1109/ISADS.2011.14
Zilu Liang, Yuzo Taenaka, T. Ogawa, Y. Wakahara
{"title":"Pro-Reactive Route Recovery with Automatic Route Shortening in Wireless Ad Hoc Networks","authors":"Zilu Liang, Yuzo Taenaka, T. Ogawa, Y. Wakahara","doi":"10.1109/ISADS.2011.14","DOIUrl":"https://doi.org/10.1109/ISADS.2011.14","url":null,"abstract":"In this paper, we propose a relay recovery route maintenance protocol for ad hoc networks to combine the benefits of both proactive and reactive route recovery strategies and to minimize their drawbacks. In our proposal, one or more substitute routes usually become ready for the recovery of every link in a route before its break, while the route recovery process actually starts only when the upstream node of a link confirms the link break. Since this scheme does not broadcast any control packet, it can effectively recover a broken link without heavy control overhead traffic. Also, it helps reduce the time delay due to the recovery, since substitute routes are already available when the upstream node initiates the route recovery process. We further propose two automatic route shortening schemes to optimize the route during successful packet forwarding without causing extra control overhead. We have implemented our proposed schemes based on AODV and compared their performance with competitive schemes including original AODV. Simulation results demonstrate that our proposal definitely reduces the time delay and control overhead traffic in route repairing process, and that the route shortening schemes further leads to shorter time delay and average route length.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126207132","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}
引用次数: 6
Towards Automated Dependability Analysis of Dynamically Connected Systems 动态连接系统可靠性自动化分析研究
2011 Tenth International Symposium on Autonomous Decentralized Systems Pub Date : 2011-03-23 DOI: 10.1109/ISADS.2011.23
P. Masci, M. Martinucci, F. Giandomenico
{"title":"Towards Automated Dependability Analysis of Dynamically Connected Systems","authors":"P. Masci, M. Martinucci, F. Giandomenico","doi":"10.1109/ISADS.2011.23","DOIUrl":"https://doi.org/10.1109/ISADS.2011.23","url":null,"abstract":"Dynamic environments may include autonomous and decentralised components that pose many challenges from the point of view of interoperability, thus triggering research studies in several directions. One recent research direction explores the automatic composition of heterogeneous systems through connectors synthesised at run-time. Besides functional properties, such connectors generally need to satisfy also non-functional (dependability-related) properties. This paper investigates the definition of an automated procedure to support the synthesis of dependable connectors.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128043947","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}
引用次数: 16
Role-Based Access-Control Using Reference Ontology in Clouds 云环境中基于角色的引用本体访问控制
2011 Tenth International Symposium on Autonomous Decentralized Systems Pub Date : 2011-03-23 DOI: 10.1109/ISADS.2011.21
W. Tsai, Qihong Shao
{"title":"Role-Based Access-Control Using Reference Ontology in Clouds","authors":"W. Tsai, Qihong Shao","doi":"10.1109/ISADS.2011.21","DOIUrl":"https://doi.org/10.1109/ISADS.2011.21","url":null,"abstract":"In cloud computing, security is an important issue due to the increasing scale of users. Current approaches to access control on clouds do not scale well to multi-tenancy requirements because they are mostly based on individual user IDs at different granularity levels. However, the number of users can be enormous and causes significant overhead in managing security. RBAC (Role-Based Access Control) is attractive because the number of roles is significantly less, and users can be classified according to their roles. This paper proposes a RBAC model using a role ontology for Multi-Tenancy Architecture (MTA) in clouds. The ontology is used to build up the role hierarchy for a specific domain. Ontology transformation operations algorithms are provided to compare the similarity of different ontology. The proposed framework can ease the design of security system in cloud and reduce the complexity of system design and implementation.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126685825","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}
引用次数: 56
Technologies Toward High Performance and High Reliability in Suica System 面向Suica系统高性能、高可靠性的技术
2011 Tenth International Symposium on Autonomous Decentralized Systems Pub Date : 2011-03-23 DOI: 10.1109/ISADS.2011.54
Yuichi Hatsuse, A. Mano, Hidehiko Nagase, Motoharu Yamana, A. Shiibashi
{"title":"Technologies Toward High Performance and High Reliability in Suica System","authors":"Yuichi Hatsuse, A. Mano, Hidehiko Nagase, Motoharu Yamana, A. Shiibashi","doi":"10.1109/ISADS.2011.54","DOIUrl":"https://doi.org/10.1109/ISADS.2011.54","url":null,"abstract":"Railway transportation is required to serve without rest every day. In Japan trains and platforms are terribly crowded every morning and evening, so that the Automatic Fare Collection (AFC) Systems need high performance. On the other hand, the systems need high reliability since the tickets they process are equivalent to cash. This paper introduces Autonomous Cooperative Processing Technology for high performance and Autonomous Decentralized Data Consistency Technology for high reliability. These technologies are applied to Suica System, an AFC system in East Japan Railway Company. The system has been running for about ten years, and serious troubles are not filed. That is, the technologies are proven to be effective.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126722328","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}
引用次数: 0
An Autonomous Decentralized System Architecture Using a Software-Based Secure Data Field 使用基于软件的安全数据域的自治分散系统架构
2011 Tenth International Symposium on Autonomous Decentralized Systems Pub Date : 2011-03-23 DOI: 10.1109/ISADS.2011.50
Luis Carlos Coronado García, Jesús Alejandro González-Fuentes, Pedro Josué Hernández-Torres, C. P. Leguízamo
{"title":"An Autonomous Decentralized System Architecture Using a Software-Based Secure Data Field","authors":"Luis Carlos Coronado García, Jesús Alejandro González-Fuentes, Pedro Josué Hernández-Torres, C. P. Leguízamo","doi":"10.1109/ISADS.2011.50","DOIUrl":"https://doi.org/10.1109/ISADS.2011.50","url":null,"abstract":"Autonomous Decentralized System (ADS) has been proposed for providing on-line expansion and maintenance and also fault-tolerance. The associated architecture is composed by a Data Field (DF - on this element, the information is flowing among all the elements connected to it) and Autonomous Control Processors (ACP - part of an entity where the information coming from the DF is preprocessed and manages data consistency and fault tolerance) with their Application Software Module (ASM - part of an entity which processes the information belonging to its own tasks). We are developing an ADS Infrastructure that will permit us to integrate heterogeneous systems with the characteristics provided by this paradigm. We develop a Software-Based DF composed of Nodes. Each Node is a software application with a simple communication protocol and a basic management user interface. The nodes, all together, are responsible for forming a network communicating one with each others. The main task for each node is to identify any entity and redirect messages for delivery. In our infrastructure, the DF is the core of the architecture and since it is a software implementation there may exist several security risks such as intruders or apocryphal components which can pretend to belong to the system. In this paper we show the technology proposed for providing a secure DF which allows to identify and authenticate each component that pretends to connect to the DF.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"53 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121725912","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}
引用次数: 3
Nearest Neighbor Task Allocation for Large-Scale Distributed Systems 大规模分布式系统的最近邻任务分配
2011 Tenth International Symposium on Autonomous Decentralized Systems Pub Date : 2011-03-23 DOI: 10.1109/ISADS.2011.30
H. Tada
{"title":"Nearest Neighbor Task Allocation for Large-Scale Distributed Systems","authors":"H. Tada","doi":"10.1109/ISADS.2011.30","DOIUrl":"https://doi.org/10.1109/ISADS.2011.30","url":null,"abstract":"In this paper, we consider distributed task allocation in distributed systems. In order to improve the performance, using load information of nodes is promising. In reality, however, it is common that load information is not up to date when it is used. Load information may be updated only periodically, or the communication delay for a task to move to other node makes load information out of date. The performance of task allocation schemes is significantly damaged if the load information is old. In order to tackle this problem, we introduce the nearest neighbor approach which is originally proposed for parallel computing. Restricting the communication to between neighboring nodes, the effect of communication delay is suppressed. Simulation results showed that our proposed scheme suppresses the effect of old load information and shows better performance than a previously proposed scheme.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131337861","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}
引用次数: 4
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信