21st International Conference on Advanced Information Networking and Applications (AINA '07)最新文献_第9页

Fault Detection and Recovery in a Transactional Agent Model 事务代理模型中的故障检测和恢复

21st International Conference on Advanced Information Networking and Applications (AINA '07) Pub Date : 2007-05-21 DOI: 10.1109/AINA.2007.70

Y. Tanaka, Naohiro Hayashibara, T. Enokido, M. Takizawa

{"title":"Fault Detection and Recovery in a Transactional Agent Model","authors":"Y. Tanaka, Naohiro Hayashibara, T. Enokido, M. Takizawa","doi":"10.1109/AINA.2007.70","DOIUrl":"https://doi.org/10.1109/AINA.2007.70","url":null,"abstract":"Servers can be fault-tolerant through replication and checkpointing technologies in the client server model. However, application programs cannot be performed and servers might block in the two-phase commitment protocol due to the client fault. In this paper, we discuss the transactional agent model to make application programs fault-tolerant by taking advantage of mobile agent technologies where a program can move from a computer to another computer in networks. Here, an application program on a faulty computer can be performed on another operational computer by moving the program. A transactional agent moves to computers where objects are locally manipulated. Objects manipulated have to be held until a transactional agent terminates. Some sibling computers which the transactional gent has visited might be faulty before the transactional agent terminates. The transactional agent has to detect faulty sibling computers and makes a decision on whether it commits/aborts or continues the computation by skipping the faulty computers depending on the commitment condition. For example, a transactional agent has to abort in the atomic commitment if a sibling computer is faulty. A transactional agent can just drop a faulty sibling computer in the at-least-one commitment. We evaluate the transactional agent model in terms of how long it takes for the transactional agent to treat faulty sibling computers .","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124163227","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

Experimental Performance Evaluation of a Pro-Active Ad-hoc Routing Protocol in Out- and Indoor Scenarios 一种主动Ad-hoc路由协议在室外和室内场景下的实验性能评估

21st International Conference on Advanced Information Networking and Applications (AINA '07) Pub Date : 2007-05-21 DOI: 10.1109/AINA.2007.68

G. Marco, Makoto Ikeda, Tao Yang, L. Barolli

引用次数: 69

How to Study Wireless Mesh Networks: A hybrid Testbed Approach 如何研究无线网状网络:一种混合试验台方法

21st International Conference on Advanced Information Networking and Applications (AINA '07) Pub Date : 2007-05-21 DOI: 10.1109/AINA.2007.77

A. Zimmermann, M. Günes, Martin Wenig, Ulrich Meis, J. Ritzerfeld

{"title":"How to Study Wireless Mesh Networks: A hybrid Testbed Approach","authors":"A. Zimmermann, M. Günes, Martin Wenig, Ulrich Meis, J. Ritzerfeld","doi":"10.1109/AINA.2007.77","DOIUrl":"https://doi.org/10.1109/AINA.2007.77","url":null,"abstract":"Simulation is the most famous way to study wireless an mobile networks since they offer a convenient combination of flexibility and controllability. However, their largest disadvantage is that the gained results are difficult to transfer into reality since not only the abstraction of the upper network layer are typically high, but also the environment of mobile and wireless networks is very complex. This is due to two reasons. First there are typically many simplifications in the models of the upper networking layers, and second the environment of mobile and wireless networks is in particular complicated and thus difficult to be considered in all details. In this paper we introduce UMIC-mesh, a hybrid testbed approach, that consists of real mesh nodes and a virtualization environment. On the one hand the virtualization allows the development and testing of software as if it was executed on real mesh routers, but in a more repeatable and controllable way. On the other hand the results and conclusions gained by a software evaluation in the testbed can be easily transferred into reality, since the testbed represents a high degree of realism.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128178644","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}

引用次数: 41

A Distributed Coordination Protocol for a Heterogeneous Group of Peer Processes 异构对等进程组的分布式协调协议

21st International Conference on Advanced Information Networking and Applications (AINA '07) Pub Date : 2007-05-21 DOI: 10.1109/AINA.2007.12

A. Aikebaier, Naohiro Hayashibara, T. Enokido, M. Takizawa

{"title":"A Distributed Coordination Protocol for a Heterogeneous Group of Peer Processes","authors":"A. Aikebaier, Naohiro Hayashibara, T. Enokido, M. Takizawa","doi":"10.1109/AINA.2007.12","DOIUrl":"https://doi.org/10.1109/AINA.2007.12","url":null,"abstract":"In peer-to-peer (P2P) applications like computer supported cooperative work (CSCW), multiple peer processes are required to cooperate to make a global decision, e.g. fix a meeting schedule of multiple persons. We discuss how multiple peer processes make a decision to achieve some objectives in a peer-to-peer (P2P) overlay network. Here, every process is assumed to be peer and autonomous. That is, there is no centralized coordination. A domain of a process is a collection of possible values which the process can take. Each process first takes a value v in its domain and notifies the other processes of the value v. A process can change the value with another value on receipt of values from other processes. However, a process can take only some value depending on the value v. For example, a process may abort after notifying commit but cannot commit after notifying abort in the commitment control. An existentially (E)-precedent relation shows what values a process can take after taking a value. In addition, a process takes a more preferable value if the process can take one of multiple values. Thus, values are ordered in the preferentially (P)-precedent relation. Based on the E- and P- precedent relations, each process takes the most preferable one in the values which can be changed from the current value v. In this paper, we discuss how every process makes an agreement on a value while each process can change the value according to the relations. In this paper, we discuss a coordination protocol in a type of heterogeneous system where every pair of processes have different E-precedent relation and P-precedent relation on the same domain. Each process learns a part of the precedent relations of another process through exchanging values.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134487930","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}

引用次数: 28

Three Dimension QoS Deviation based Scheduling in Adaptive Wireless Networks 基于三维QoS偏差的自适应无线网络调度

21st International Conference on Advanced Information Networking and Applications (AINA '07) Pub Date : 2007-05-21 DOI: 10.1109/AINA.2007.136

R. Beidokhti, M. Moghaddam, J. Chitizadeh

引用次数: 1

OntSum: A Semantic Query Routing Scheme in P2P Networks Based on Concise Ontology Indexing 基于简洁本体索引的P2P网络语义查询路由方案

21st International Conference on Advanced Information Networking and Applications (AINA '07) Pub Date : 2007-05-21 DOI: 10.1109/AINA.2007.104

Juan Li, S. Vuong

引用次数: 18

DHHT-RAID: A Distributed Heterogeneous Scalable Architecture for Dynamic Storage Environments DHHT-RAID:用于动态存储环境的分布式异构可扩展架构

21st International Conference on Advanced Information Networking and Applications (AINA '07) Pub Date : 2007-05-21 DOI: 10.1109/AINA.2007.59

Gunnar Schomaker

引用次数: 3

On Quantifying Fault Patterns of the Mesh Interconnect Networks 网状互连网络故障模式量化研究

21st International Conference on Advanced Information Networking and Applications (AINA '07) Pub Date : 2007-05-21 DOI: 10.1109/AINA.2007.98

F. Safaei, M. Fathy, A. Khonsari, M. Ould-Khaoua, Hosein Shafiei, S. Khosravipour

引用次数: 0

A Thesaurus Construction Method from Large ScaleWeb Dictionaries 一种基于大规模网络词典的词库构建方法

21st International Conference on Advanced Information Networking and Applications (AINA '07) Pub Date : 2007-05-21 DOI: 10.1109/AINA.2007.23

Kotaro Nakayama, T. Hara, S. Nishio

引用次数: 49

Un-biasing the Link Farm Effect in PageRank Computation 在PageRank计算中消除链接场效应

21st International Conference on Advanced Information Networking and Applications (AINA '07) Pub Date : 2007-05-21 DOI: 10.1109/AINA.2007.143

A. Rungsawang, K. Puntumapon, Bundit Manaskasemsak

{"title":"Un-biasing the Link Farm Effect in PageRank Computation","authors":"A. Rungsawang, K. Puntumapon, Bundit Manaskasemsak","doi":"10.1109/AINA.2007.143","DOIUrl":"https://doi.org/10.1109/AINA.2007.143","url":null,"abstract":"Link analysis is a critical component of current Internet search engines' results ranking software, which determines the ordering of query results returned to the user. The ordering of query results can have an enormous impact on web traffic and the resulting business activity of an enterprise; hence businesses have a strong interest in having their Web pages highly ranked in search engine results. This has led to attempts to artificially inflate page ranks by spamming the link structure of the Web. Building an artificial condensed link structure called a \"link farm\" is one technique to influence a page ranking system, such as the popular PageRank algorithm. In this paper, we present an approach to remove the bias due to link farms from PageRank computation. We propose a method to first measure the PageRank weight accumulated by link farms, and then distribute the weight to other web pages by a modification of the transition matrix in the standard PageRank algorithm. We present results of a selected Web graph that is manually spammed. The results show that the proposed approach can effectively reduce the bias from link farms in PageRank computation.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132034433","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}

引用次数: 13