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

Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.最新文献

筛选
英文 中文
Efficient switch schedulers with random decisions 具有随机决策的高效开关调度程序
Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005. Pub Date : 2005-04-04 DOI: 10.1109/ISADS.2005.1452118
D. Serpanos
{"title":"Efficient switch schedulers with random decisions","authors":"D. Serpanos","doi":"10.1109/ISADS.2005.1452118","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452118","url":null,"abstract":"Appropriate use of randomness in the development of scheduling algorithms is a powerful tool, because it leads to systems that are theoretically efficient and fair, while feasible to analyze and obtain concrete performance bounds. However, randomness is hard to implement, due to the high complexity and long delay of efficient random number generators. Thus, deterministic schedulers for high-speed switches have been developed. In this paper, we introduce high-speed schedulers for packet switches, which employ randomness and provide high performance at low cost. The schedulers implement variations of an existing, optimal on-line bipartite graph matching algorithm and achieve fair service and improved performance over PIM at a significantly lower cost; PIM is the main alternative algorithm with random decisions and has been used as the basis for a wide range of deterministic algorithms.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132470641","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
Autonomous multi-agent-based data allocation technology in decentralized database systems for timeliness 分布式数据库系统中基于自治多代理的数据分配技术
Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005. Pub Date : 2005-04-04 DOI: 10.1109/ISADS.2005.1452012
Minoru Takaishi, C. P. Leguízamo, S. Kimura, Ryuji Takanuki
{"title":"Autonomous multi-agent-based data allocation technology in decentralized database systems for timeliness","authors":"Minoru Takaishi, C. P. Leguízamo, S. Kimura, Ryuji Takanuki","doi":"10.1109/ISADS.2005.1452012","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452012","url":null,"abstract":"Due to the progress of information technology, the business market is changing its strategy for a modern online business environment. Autonomous decentralized database system (ADDS) has been proposed in order to meet the innovative e-business requirements. In case the system size increases, a multiple-agent-based coordination is proposed for achieving the timeliness property. The response time is conformed by those transactions that require coordination and those that can be satisfied immediately. In this sense, the distribution of the data in the system for coordination is a medullar issue for the improvement of the response time. A trade-off exits between these two kind of transactions depending on the capacity of allocating data among the sites and the distribution of the data and user requests in the system. A study of the trade-off and the factor that need to be considered for an allocation data technology in order to get an optimal response time is discussed.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133493737","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}
引用次数: 1
Research of double loop optical fiber self-cicatrized network based on Neuron3150 基于Neuron3150的双回路光纤自愈合网络研究
Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005. Pub Date : 2005-04-04 DOI: 10.1109/ISADS.2005.1452084
Ren Wang, Deming Chen, Q. Qian
{"title":"Research of double loop optical fiber self-cicatrized network based on Neuron3150","authors":"Ren Wang, Deming Chen, Q. Qian","doi":"10.1109/ISADS.2005.1452084","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452084","url":null,"abstract":"It is a comparatively popular method by adopting industrial field bus in communication of bay level in substation automation system. There are many kinds of industrial field bus, such as CAN, PROFIBUS, LonWorks and etc. PROFIBUS and CAN both have inherent shortcomings in communication rate and network composition. Recently, industrial Ethernet is one of its development trends, industrial Ethernet cannot construct looped network and its real-time performance do not meet the need of substation automation system in Jones, MT (2003). Lon Works is the most complete field communication bus, which have seven level communication protocol, but its communication rate can only reach 34kbps in commonly I/O mode adopted. The need of real-time of substation automation system is not meet by the communication rate of LonWorks. In this paper, the structure of Neuron3150 is studied and new hardware structure and arithmetic is adopted, thus communication rate of 1.25Mbps and Double loop Optical Fiber self cicatrized Network are carried out, which are adaptive to communication of bay level in existing substation and distribution substation especially.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133516717","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
Efficient on-demand route establishment methods for dense ad-hoc networks 密集ad-hoc网络中高效的按需路由建立方法
Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005. Pub Date : 2005-04-04 DOI: 10.1109/ISADS.2005.1452168
Yujin Noishiki, H. Yokota, A. Idoue
{"title":"Efficient on-demand route establishment methods for dense ad-hoc networks","authors":"Yujin Noishiki, H. Yokota, A. Idoue","doi":"10.1109/ISADS.2005.1452168","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452168","url":null,"abstract":"On-demand ad hoc routing protocols broadcast control packets to establish routes to destination nodes. In ad hoc networks that are joined by many mobile nodes, they generate a high number of broadcast packets, thereby causing contention, packet collisions and battery power wastage in the mobile nodes. We propose an efficient route establishment method to decrease the transmission of control packets adoptively according to the number of adjacent nodes and the number of routes that those nodes accommodate. Through simulation, we demonstrate that our proposed method is especially efficient in dense ad hoc networks. In our proposed method, the number of control packets is decreased without lowering the success ratio of path discoveries according to the number of adjacent nodes. Furthermore, our proposed method improves the performance of packet delivery, taking account of the path concentration.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131426673","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}
引用次数: 5
Lightweight home network middleware supporting mobility management 支持移动性管理的轻量级家庭网络中间件
Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005. Pub Date : 2005-04-04 DOI: 10.1109/ISADS.2005.1452106
Hojae Hyun, Kwangman Koh, Sunyoung Han, Moon-hae Kim, Chun-Hyon Chang
{"title":"Lightweight home network middleware supporting mobility management","authors":"Hojae Hyun, Kwangman Koh, Sunyoung Han, Moon-hae Kim, Chun-Hyon Chang","doi":"10.1109/ISADS.2005.1452106","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452106","url":null,"abstract":"As various kinds of embedded systems (or devices) become widely available, research on home network middleware which can access and control embedded home appliances are actively being progressed. However, there is a significant problem in applying the home network technology to embedded systems because of their limited storage space and low computing power. In order to enhance the practicality of home network middleware, various technical demands have been recently emphasized such as mobility and lightweight. In this paper, we present a lightweight middleware for home network on embedded systems. Also, we propose a mechanism for mobility management which adopts the anycast technology.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131200310","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}
引用次数: 1
Securing instance-level interactions in Web services 保护Web服务中的实例级交互
Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005. Pub Date : 2005-04-04 DOI: 10.1109/ISADS.2005.1452107
Dacheng Zhang, Jie Xu
{"title":"Securing instance-level interactions in Web services","authors":"Dacheng Zhang, Jie Xu","doi":"10.1109/ISADS.2005.1452107","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452107","url":null,"abstract":"The Web service technology enables dynamic service composition, resource utilisation and application integration in a heterogeneous computing environment. Web services can be used to compose and perform flexible and complex business flows. In practice, a Web service may create multiple service instances working for different business flows or business sessions, whilst the service instances within a business session may be created by different Web services, often designed, implemented and maintained by different organisations across different security domains. This introduces new challenges to existing security systems and solutions. For many applications ensuring security only at the level of Web services is not enough for a fine-grained level of control for multi-party collaborations because interactions amongst Web services in fact happen at the level of service instances. In this paper, we address the problem of how to secure instance-level interactions in Web services, and discuss different schemes for identifying and authenticating service instances. We present an experimental system and analyse some performance results. The experimental system implements instance-level communication control and instance authentication. The experimental results demonstrate that the overhead of execution time introduced by instance authentication is proportional to the number of the session partners within a business session.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115714076","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
Adaptive algorithms for finding replacement services in autonomic distributed business processes 在自主分布式业务流程中寻找替代服务的自适应算法
Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005. Pub Date : 2005-04-04 DOI: 10.1109/ISADS.2005.1452105
Tao Yu, Kwei-Jay Lin
{"title":"Adaptive algorithms for finding replacement services in autonomic distributed business processes","authors":"Tao Yu, Kwei-Jay Lin","doi":"10.1109/ISADS.2005.1452105","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452105","url":null,"abstract":"Web service may be used to construct autonomic business processes, where several Web services interact with each other to carry out complex transactions or workflows. During the execution of an autonomic process, if one component service fails or becomes overloaded, a mechanism is needed to ensure that the running process is not interrupted and the failed service is quickly and efficiently replaced. In this paper, we present two algorithms to solve the problem. The first algorithm uses the backup path approach so that the predecessor of a failed service may quickly switch to a predefined backup path. The second algorithm uses the replacement path approach to re-construct a new process by skipping a failed service. All these dynamic adaptations can be done by business process itself or a QoS broker which is part of an autonomic system. The simulation result shows that, when producing the information needed for dynamic adaptation, the running time of business process composition increases only by a constant factor regardless of the system size.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125328761","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}
引用次数: 90
Maximizing the route reliability of mobile agents in unreliable environments 实现不可靠环境下移动代理路由可靠性最大化
Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005. Pub Date : 2005-04-04 DOI: 10.1109/ISADS.2005.1452026
M. Daoud, Q. Mahmoud
{"title":"Maximizing the route reliability of mobile agents in unreliable environments","authors":"M. Daoud, Q. Mahmoud","doi":"10.1109/ISADS.2005.1452026","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452026","url":null,"abstract":"Autonomous mobility of an agent is the most important feature of mobile agent-based systems. In this paper, we study the reliability of mobility (movement) of an agent in a faulty network environment with invariant (constant) latencies between its nodes. To achieve a reliable agent, we used the integer linear programming model to maximize the route reliability to complete a given task. The suggested criteria could be used as part of the planning module in the planning system of mobile agents. Moreover, we propose a bi-objective planning strategy when the network latencies are highly varied. This leads to a new concept which we call it a mixed planning strategy; it is locally static within each subnetwork but globally dynamic over all connected subnetworks.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115143577","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
Enabling context-aware group collaboration in MANETs 在manet中实现上下文感知组协作
Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005. Pub Date : 2005-04-04 DOI: 10.1109/ISADS.2005.1452074
Dario Bottazzi, Antonio Corradi, R. Montanari
{"title":"Enabling context-aware group collaboration in MANETs","authors":"Dario Bottazzi, Antonio Corradi, R. Montanari","doi":"10.1109/ISADS.2005.1452074","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452074","url":null,"abstract":"Recent advances in mobile ad-hoc networks (MANET) technologies promote new opportunities for anytime and anywhere impromptu collaboration and leverage the provisioning of novel collaborative services, such as emergency rescue, e-care, and troop car management. However, the design and deployment of collaborative services in MANET environments raise new group management challenges. In particular, unpredictable users/devices mobility, frequent disconnection/reconnection of devices and continuous changes in network topology call for novel middleware solutions to handle properly the transient and dynamic formation of ad-hoc groups. The paper proposes a context-aware group membership middleware (AGAPE) that bases group management decisions depending on context information, such as user location, user attributes and preferences, and access device properties. User location determines the scope of group member visibility within a network locality, whereas user requirements and device properties govern the joining to a group and influence the played role of a user within a group. AGAPE provides a set of support services to arrange/dissolve and manage ad-hoc groups on demand and propagates the visibility of available group members and of their context up to the application level to allow applications to adapt collaborative decisions and actions accordingly. The paper also presents a MANET-enabled emergency rescue application scenario to show and to evaluate the functioning of AGAPE.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131382846","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
A study on primary path switching strategy of SCTP SCTP主路径交换策略研究
Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005. Pub Date : 2005-04-04 DOI: 10.1109/ISADS.2005.1452131
J. Funasaka, K. Ishida, Hiroyasu Obata, Yukiyoshi Jutori
{"title":"A study on primary path switching strategy of SCTP","authors":"J. Funasaka, K. Ishida, Hiroyasu Obata, Yukiyoshi Jutori","doi":"10.1109/ISADS.2005.1452131","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452131","url":null,"abstract":"As a variety of communication devices emerging, we can easily install two or more communication interfaces on a PC or a PDA and make a multi-home environment. To utilize this multi-home environment effectively, SCTP (stream control transmission protocol) has been proposed and standardized. Extending functions of the original SCTP, a strategy which can adapt SCTP to real-time communications has been proposed. However, the typical existing strategy has not enough considered the switching conditions from the viewpoint of transmission delay, so there is room to improve them. In this paper, we clarify the drawbacks of the existing strategy and their influences on the performance. Then, we propose a new strategy of path switching to reduce the delay and to increase the amount of data successfully delivered. The effect of the proposed strategy is discussed and confirmed through experimental evaluations.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134532706","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}
引用次数: 21
首页 上一页 下一页 尾页
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学术官方微信