Proceedings 21st International Conference on Distributed Computing Systems最新文献_第7页

Cost effective mobile agent planning for distributed information retrieval 分布式信息检索的高效移动代理规划

Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918934

Jin-Wook Baek, Jae-Heung Yeo, Gyu-tae Kim, H. Yeom

{"title":"Cost effective mobile agent planning for distributed information retrieval","authors":"Jin-Wook Baek, Jae-Heung Yeo, Gyu-tae Kim, H. Yeom","doi":"10.1109/ICDSC.2001.918934","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918934","url":null,"abstract":"The number of agents and the execution time are two significant performance factors in mobile agent planning (MAP). Fewer agents cause lower network traffic and consume less bandwidth. Regardless of the number of agents used, the execution time for a task must be kept minimal, which means that use of the minimal number of agents must not impact on the execution time unfavorably. As the population of the mobile agent application domain grows, the importance of these two factors also increases. After a careful review of these two factors, we propose two heuristic algorithms for finding the minimal number of traveling agents for retrieving information from a distributed computing environment, while keeping the latency minimal. Although agent planning, specifically MAP, is quite similar to the famous traveling salesman problem (TSP), agent planning has a different objective function from that of TSP. TSP deals with the optimal total routing cost, while MAP attempts to minimize the execution time to complete tasks of information retrieval. In this paper, we suggest two cost-effective MAP algorithms, BYKY1 (Baek-Yeo-Kim-Yeom 1) and BYKY2, which can be used in distributed information retrieval systems to find the factors mentioned above. At the end of each algorithm, 2OPT, a well-known TSP algorithm, is called to optimize each agent's local routing path. Experimental results show that BYKY2 produces near-optimal performance. These algorithms are more realistic and applicable directly to the problem domains than those of previous works.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122012909","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}

引用次数: 35

The home model and competitive algorithms for load balancing in a computing cluster 计算集群中负载平衡的主模型和竞争算法

Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918941

R. Lavi, A. Barak

{"title":"The home model and competitive algorithms for load balancing in a computing cluster","authors":"R. Lavi, A. Barak","doi":"10.1109/ICDSC.2001.918941","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918941","url":null,"abstract":"Most implementations of a computing cluster (CC) use greedy-based heuristics to perform load balancing. In some cases, this is in contrast to theoretical results about the performance of online load balancing algorithms. We define the home model in order to better reflect the architecture of a CC. In this new theoretical model, we assume a realistic cluster structure in which every job has a \"home\" machine which it prefers to be executed on, e.g. due to I/O considerations or because it was created there. We develop several online algorithms for load balancing in this model. We first provide a theoretical worst-case analysis, showing that our algorithms achieve better competitive ratios and perform less reassignments than algorithms for the unrelated machines model, which is the best existing theoretical model to describe such clusters. We then present an empirical average-case performance analysis by means of simulations. We show that the performance of our algorithms is consistently better than that of several existing load balancing methods, e.g. the greedy and the opportunity cost methods, especially in a dynamic and changing CC environment.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"221 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131818732","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}

引用次数: 18

A dynamic heuristic broadcasting protocol for video-on-demand 视频点播的动态启发式广播协议

Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918996

Scott R. Carter, Jehan-Francois Pâris, Saurabh Mohan, D. Long

引用次数: 28

Dynamic database management for PCS networks PCS网络动态数据库管理

Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918999

Jie Li, Yi Pan

引用次数: 9

RAD: a compile-time solution to buffer overflow attacks RAD:一个针对缓冲区溢出攻击的编译时解决方案

Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918971

T. Chiueh, Fu-Hau Hsu

{"title":"RAD: a compile-time solution to buffer overflow attacks","authors":"T. Chiueh, Fu-Hau Hsu","doi":"10.1109/ICDSC.2001.918971","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918971","url":null,"abstract":"Buffer overflow attack can inflict upon almost arbitrary programs and is one of the most common vulnerabilities that can seriously compromise the security of a network-attached computer system. This paper presents a compiler-based solution to the notorious buffer overflow attack problem. Using this solution, users can prevent attackers from compromising their systems by changing the return address to execute injected code, which is the most common method used in buffer overflow attacks. Return address defender (RAD) is a simple compiler patch that automatically creates a safe area to store a copy of return addresses and automatically adds protection code into applications that it compiles to defend programs against buffer overflow attacks. Using it to protect a program does not need to modify the source code of the protected programs. Moreover, RAD does not change the layout of stack frames, so binary code it generated is compatible with existing libraries and other object files. Empirical performance measurements on a fully operational RAD prototype show that programs protected by RAD only experience a factor of between 1.01 to 1.31 slow-down. In this paper we present the principle of buffer overflow attacks, a taxonomy of defense methods, the implementation details of RAD, and the performance analysis of the RAD prototype.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124315428","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}

引用次数: 280

Robust double auction protocol against false-name bids 强大的双重拍卖协议，防止假名投标

Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918942

M. Yokoo, Y. Sakurai, S. Matsubara

{"title":"Robust double auction protocol against false-name bids","authors":"M. Yokoo, Y. Sakurai, S. Matsubara","doi":"10.1109/ICDSC.2001.918942","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918942","url":null,"abstract":"Internet auctions have become an integral part of electronic commerce (EC) and a promising field for applying agent technologies. Although the Internet provides an excellent infrastructure for large-scale auctions, we must consider the possibility of a new type of cheating, i.e., a bidder trying to profit from submitting several bids under fictitious names (false-name bids). Double auctions are an important subclass of auction protocols that permit multiple buyers and sellers to bid to exchange a good, and have been widely used in stock, bond, and foreign exchange markets. If there exists no false-name bid, a double auction protocol called PMD protocol has proven to be dominant-strategy incentive compatible. On the other hand, if we consider the possibility of false-name bids, the PMD protocol is no longer dominant-strategy incentive compatible. We develop a new double auction protocol called the Threshold Price Double auction (TPD) protocol, which is dominant strategy incentive compatible even if participants can submit false-name bids. The characteristics of the TPD protocol is that the number of trades and prices of exchange are controlled by the threshold price. Simulation results show that this protocol can achieve a social surplus that is very close to being Pareto efficient.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"82 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122620220","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}

引用次数: 76

A framework for modeling agent-oriented software 建模面向代理的软件的框架

Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918933

Haiping Xu, S. Shatz

引用次数: 33

Towards communication-sensitive load balancing 朝着通信敏感负载均衡的方向发展

Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.919011

John Cruz, Kihong Park

引用次数: 13

Maintaining mutual consistency for cached Web objects 维护缓存Web对象的相互一致性

Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918967

B. Urgaonkar, A. Ninan, M. Raunak, P. Shenoy, K. Ramamritham

{"title":"Maintaining mutual consistency for cached Web objects","authors":"B. Urgaonkar, A. Ninan, M. Raunak, P. Shenoy, K. Ramamritham","doi":"10.1109/ICDSC.2001.918967","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918967","url":null,"abstract":"Existing Web proxy caches employ cache consistency mechanisms to ensure that locally cached data is consistent with that at the server. We argue that techniques for maintaining consistency of individual objects are not sufficient; a proxy should employ additional mechanisms to ensure that related Web objects are mutually consistent with one another. We formally define the notion of mutual consistency and the semantics provided by a mutual consistency mechanism to end users. We then present techniques for maintaining mutual consistency in the temporal and value domains. A novel aspect of our techniques is that they can adapt to the variations in the rate of change of the source data, resulting in judicious use of proxy and network resources. We evaluate our approaches using real-world Web traces and show that: (i) careful tuning can result in substantial savings in the network overhead incurred without any substantial loss in fidelity, of the consistency guarantees, and (ii) the incremental cost of providing mutual consistency guarantees over mechanisms to provide individual consistency guarantees is small.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126830603","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}

引用次数: 46

Mobile transactional agents 移动交易代理

Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918935

Ron Sher, Y. Aridor, O. Etzion

{"title":"Mobile transactional agents","authors":"Ron Sher, Y. Aridor, O. Etzion","doi":"10.1109/ICDSC.2001.918935","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918935","url":null,"abstract":"Mobile agents is an important enabling technology for certain types of real world applications such as e-commerce and workflows. While the potential benefits are appealing, this technology is not being used by many applications. This is largely attributed to the lack of components such as transactions and their integration with de-facto technologies. This work focuses on bridging this gap and devising an extended transactional model for mobile agents. The nature of mobile agents for autonomous processing and mobility introduces numerous challenges with respect to transactions which are originally, addressed in our work. First, given that, unstructured, execution scripts for agents, it is necessary to isolate side-effects that occur between two successive migrations to later be able to commit or abort them locally according to transaction semantics maintained across multiple hosts. Second, intra-transaction parallelism requires synchronization among multiple autonomous agents to join their processing and to rollback a transaction. Third, recovery from failures at a specific host, may necessitate maintaining a global state of a transaction across all the agent's destinations to determine how to proceed (e.g., repeat activities upon recovery). This paper presents a comprehensive transaction model for mobile agents and its deployment in the context of Java-based mobile agents. The overall complexity of transaction management is handled using a division of labor between an object-oriented programming model, protocols and a concurrency control mechanism. Specifically, the programming model maintains separation of concerns between mobility, transactions and application logic in order to cope with the aforementioned challenges.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131475550","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}

引用次数: 22