Yingwei Jin

Theoretical analysis on a traffic-based routing algorithm of mobile agents

In this paper, we propose a mobile agent-based routing algorithm in which the traffic cost is considered. We define a traffic cost function for each link based on known traffic information and find the probability distribution that mobile agents may select a neighboring node and move to. We theoretically analyze the probability distribution and provide the optimal probability distribution that makes inference on the known traffic information and approximates to a unbiased distribution.

Distribution of mobile agents in vulnerable networks

Advances in the Internet and the computer industry have created many new application areas for network routing such as Grid computing and also brings new challenges to traditional routing techniques. In this paper we propose a mobile agent‐based routing model in vulnerable networks for these applications. To characterize the behaviors of mobile agents and their effects on the network performance, we analyze the population distribution of mobile agents as a measurement of the computational resource consumption. Our analysis reveals theoretical insights into the statistical behaviors of mobile agents and provides useful tools for effectively managing mobile agents in large networks. Copyright

A Survey of Cache/Proxy for Transparent Data Replication

Web caching is an important technology for reduc- ing Internet access latency, alleviating network traf- fic, and spreading server load. An important issue that affects the performance of web caching is caching architecture, in which several caches are usually fed- erated for making caches cooperate on a large scale and effectively increase the cache population. Trans- parent data replication is such a caching architec- ture, which has shown to be easy to manage and have good system scalability. In this paper, we present an survey of state-of-the-art techniques of cache/proxy placement for transparent data replication.

The Cache Replacement Problem for Multimedia Object Caching

Multimedia object caching, by which the same multimedia object can be adapted to diverse mobile appliances through the technique of transcoding, is an important technology for improving the scalability of Web services, especially in the environment of mobile networks. The performance of multimedia object caching mainly depends on how the objects are selected to be removed for a new object (multimedia object replacement) and where the different versions of a multimedia object are placed (multimedia object placement). In this paper, we address the problem of cache replacement for multimedia object caching. We first propose an optimal solution for this problem. The performance objective is to minimize the total access cost by considering both transmission cost and transcoding cost. The performance of the proposed solution is evaluated with a set of carefully designed simulation experiments for various performance metrics over a wide range of system parameters. The simulation results show that our solution consistently and significantly outperforms comparison solutions in terms of all the performance metrics considered.

A mobile agent-based routing model for grid computing

Grid computing is an innovative approach which can optimize compute resources and manage data and computing workloads. In this paper, we propose a hierarchical routing model by using mobile agents to collect and update the dynamic changes of routing information in grid systems, which has been proved to be the only optimal solution that makes inference on the known traffic information and approximates to a unbiased distribution. Our method is fault tolerant, scalable, and relies completely on local information. Extensive simulations show the priority of our algorithm to state-of-art algorithms.

A trust management model for service-oriented distributed networks

The service‐oriented distributed network requires more stable and persistent services, but the services from dishonest or unstable nodes would damage the correctness and availability of services. To efficiently obtain the services from high dependable nodes, many trust management systems have been developed. However, the previous trust models in distributed networks ignore a fact that the entity itself could provide trust information for services also. In this paper, we present a novel trust management model based on the subjective logic trust for service‐oriented distributed networks. The proposed algorithm involves passive trust of entity and combines the direct trust and recommendation trust. We also propose a novel scheme called passive trust feedback to avoid the deceit of malicious nodes and unstable nodes, and to encourage honest nodes. Our proposed model expands the trust range of service resource via passive trust of entity, which generates a flexible access path to the service resources. Simulations show that the proposed trust management model can significantly improve the feasibility of trust management as well as effectively detect malicious entities. Copyright

A Trust Model Based on Similarity Evaluation in P2P Networks

Due to lack of effective trust management mechanism, there are a lot of deceptive behaviors in P2P networks, which seriously decrease the quality of network services. In order to improve the quality of services (or transactions), this paper proposes a novel trust and reputation model based on similarity evaluation in P2P environments. According to the different context of services, the model gives the similarity degree evaluation, and presents local reputation and global reputation computation. Experimental results demonstrate that this model can get more real trust value and deal with the malicious attacks.

Solution to Multi-objective Fuzzy Optimization Dynamic Programming with Uncertain Information

Uncertain information will often exist in a complicated system which may result from many reasons. The accuracy of the conclusion will definitely be influenced without taking this uncertain information into consideration in the process of decision-making. By considering these uncertain factors, the solution proposed in the essay to multi-objective fuzzy optimization dynamic programming makes itself more universal.

A New Solution to Non-structural System Group Decision-making Problems

Research on non-structural system group decision-making problems largely depends on the knowledge and experience of the experts for tactical analysis. The usual method of voting may result in a great loss of information in case of much renunciation, and the accuracy of voting can therefore be directly influenced.This paper proposes a new solution to non-structural system group decision-making problems by taking advantage of the characteristics of correlate and the information easy to lose to make an overall analysis of the ayes, blackballs and renunciation polls for an accurate result.