2004 International Symposium on Applications and the Internet Workshops. 2004 Workshops.最新文献_第2页

Shared questionnaire system for school community management 学校社区管理共享问卷系统

2004 International Symposium on Applications and the Internet Workshops. 2004 Workshops. Pub Date : 2004-01-26 DOI: 10.1109/SAINTW.2004.1268671

Hiroya Kubo, H. Ohashi, Masatoshi Tamamura, Takashi Kowata, Ikuyo Kaneko

引用次数: 10

Performance evaluation of OmniRPC in a grid environment 网格环境下OmniRPC的性能评估

2004 International Symposium on Applications and the Internet Workshops. 2004 Workshops. Pub Date : 2004-01-26 DOI: 10.1109/SAINTW.2004.1268704

Yoshihiro Nakajima, M. Sato, T. Boku, D. Takahashi, H. Gotoh

{"title":"Performance evaluation of OmniRPC in a grid environment","authors":"Yoshihiro Nakajima, M. Sato, T. Boku, D. Takahashi, H. Gotoh","doi":"10.1109/SAINTW.2004.1268704","DOIUrl":"https://doi.org/10.1109/SAINTW.2004.1268704","url":null,"abstract":"OmniRPC is a Grid RPC system for parallel programming in a grid environment. In order to understand the performance characteristics of OmniRPC, we executed a synthetic benchmark program which varies the execution time in remote nodes and the amount of communication on several configurations of our grid environment. The result shows the performance of the application is improved if RPC data transmissions are less than 10 KB, the job time in remote nodes is more than 4 seconds, and RPCs are called more than 256 times. Our result also shows a small performance degradation when using the feature of communication multiplexing. We also measured the performance of the EP application from the NAS parallel benchmark suite. In EP, even if using SSH or the Globus GRAM as methods of agent invocation, both performances are almost the same. As a practical application, we parallelized the CONFLEX molecular confirmation search program using OmniRPC. In the comparison of CONFLEX-G with the CONFLEX MPI version, CONFLEX-G achieves comparable efficiencies to the MPI version and increased speed by using two or more clusters.","PeriodicalId":166094,"journal":{"name":"2004 International Symposium on Applications and the Internet Workshops. 2004 Workshops.","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132431527","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}

引用次数: 7

A prototype toward Japanese Virtual Observatory (JVO) 日本虚拟天文台(JVO)样机

2004 International Symposium on Applications and the Internet Workshops. 2004 Workshops. Pub Date : 2004-01-26 DOI: 10.1109/SAINTW.2004.1268692

M. Ohishi, Y. Mizumoto, N. Yasuda, Y. Shirasaki, Masahiro Tanaka, S. Honda, Y. Masunaga

引用次数: 6

Mobile IPv6 and AAA architecture based on WLAN 移动IPv6和基于WLAN的AAA架构

2004 International Symposium on Applications and the Internet Workshops. 2004 Workshops. Pub Date : 2004-01-26 DOI: 10.1109/SAINTW.2004.1268587

R. I. Chen, R. Wang, H. Chao

引用次数: 4

Cyber applications for next societies 下一代社会的网络应用

2004 International Symposium on Applications and the Internet Workshops. 2004 Workshops. Pub Date : 2004-01-26 DOI: 10.1109/SAINTW.2004.1268684

J. Murai, Y. Hibata, K. Kumasaka, Akira Maeda, H. Ohiwa, N. Saito, H. Shimizu

引用次数: 0

Suggestions on how to implement supply chain management: from the perspective of Japanese business relations 如何实施供应链管理的建议:基于日本商业关系的视角

2004 International Symposium on Applications and the Internet Workshops. 2004 Workshops. Pub Date : 2004-01-26 DOI: 10.1109/SAINTW.2004.1268563

Kazuo Kikuchi

引用次数: 1

Distributed pagerank: a distributed reputation model for open peer-to-peer network 分布式pagerank:开放点对点网络的分布式信誉模型

2004 International Symposium on Applications and the Internet Workshops. 2004 Workshops. Pub Date : 2004-01-26 DOI: 10.1109/SAINTW.2004.1268664

Atsushi Yamamoto, Daisuke Asahara, T. Itao, Satoshi Tanaka, T. Suda

{"title":"Distributed pagerank: a distributed reputation model for open peer-to-peer network","authors":"Atsushi Yamamoto, Daisuke Asahara, T. Itao, Satoshi Tanaka, T. Suda","doi":"10.1109/SAINTW.2004.1268664","DOIUrl":"https://doi.org/10.1109/SAINTW.2004.1268664","url":null,"abstract":"This paper proposes a distributed reputation model for open peer-to-peer networks called distributed pagerank. This model is motivated by the observation that although pagerank has already satisfied the requirements of reputation models, the centralized calculation of pagerank is incompatible with peer-to-peer networks. Distributed pagerank is a decentralized approach for calculating the pagerank of each peer by its reputation, in which the relationship between peers is introduced as the equivalent to the link between Web pages. The distributed calculation of pagerank is performed asynchronously by each peer as it communicates with the other peers. The asynchronous calculation accomplishes both demanding no extra messages for the calculation of pagerank and steadily calculating an accurate pagerank of each peer even under the dynamic topology of relationships. The result of the simulation has indicated that the calculated pagerank value of each peer converges at the original pagerank value under the static topology of relationships, which is presumable under a dynamic topology. A fully implemented application of distributed pagerank has also been presented, which supports dynamic formation of communities with reputation ranking.","PeriodicalId":166094,"journal":{"name":"2004 International Symposium on Applications and the Internet Workshops. 2004 Workshops.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126890167","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}

引用次数: 37

Multimedia and routing specific applications on IPv6 networks IPv6网络上的多媒体和路由特定应用

2004 International Symposium on Applications and the Internet Workshops. 2004 Workshops. Pub Date : 2004-01-26 DOI: 10.1109/SAINTW.2004.1268578

Y. Hiranaka, Masato Ohnuma, Akihisa Yoshida, T. Taketa, Tatsumi Hosokawa, Takashi Yamagata, S. Okoma, Y. Hirose, Tsuyoshi Yoneda, Shigehiro Takeda, Teruaki Arashida, Hiroki Nakagawa, Takahiro Kudaira, Kouji Tanaka

引用次数: 1

Grid-enabled applications in molecular dynamics simulations using a cluster of dedicated computers 使用专用计算机集群的分子动力学模拟中的网格应用程序

2004 International Symposium on Applications and the Internet Workshops. 2004 Workshops. Pub Date : 2004-01-26 DOI: 10.1109/SAINTW.2004.1268697

T. Amisaki, S. Fujiwara

引用次数: 3

Mitigating routing misbehaviour of rational nodes in CHORD 减轻CHORD中有理节点的路由错误行为

2004 International Symposium on Applications and the Internet Workshops. 2004 Workshops. Pub Date : 2004-01-26 DOI: 10.1109/SAINTW.2004.1268685

M. Portmann, S. Ardon, A. Seneviratne

{"title":"Mitigating routing misbehaviour of rational nodes in CHORD","authors":"M. Portmann, S. Ardon, A. Seneviratne","doi":"10.1109/SAINTW.2004.1268685","DOIUrl":"https://doi.org/10.1109/SAINTW.2004.1268685","url":null,"abstract":"In peer-to-peer systems, nodes rely on other nodes to route and forward messages to their destinations. If peer-to-peer technology is to be used in a business context, intermediary nodes might have an incentive not to adhere to the specified routing protocol if there is a benefit to be gained from doing so. We address the problem of rationality and self-interest in this context by hiding the content and the originator of messages from intermediary peer nodes. Consequently, rational nodes cannot selectively discriminate against messages originating from particular senders or messages with a specific content. Our proposal is based on the concept of split knowledge, where a message is split into two parts at its origin and these parts are then routed to the destination via two disjoint paths. We present a method of how this concept can be implemented in the CHORD peer-to-peer system. We propose a simple modification to the CHORD routing protocol that allows finding multiple path between two CHORD nodes with a low degree of overlap. Simulation results and analytical approximations demonstrate the performance of the proposed method.","PeriodicalId":166094,"journal":{"name":"2004 International Symposium on Applications and the Internet Workshops. 2004 Workshops.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133255410","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}

引用次数: 12