17479734
Self-Organization of Autonomous Peers with Human Strategies
Similarly to social networks where people are connected by their social relationships, two autonomous peer nodes can be connected in unstructured peer-to-peer (P2P) networks if users in those nodes are interested in each other's data. The similarity between P2P networks and social networks, where peer nodes are people and connections are relationships, leads us to believe that human strategies in social networks are useful for improving the performance of resource discovery by self-organising autonomous peers on unstructured P2P networks. In this paper, we present an efficient social-like peer-to-peer (ESLP) model for resource discovery by mimicking different human behaviours in social networks.
7638849
Efficient and scalable search on scale-free P2P networks
Unstructured peer-to-peer (P2P) systems (e.g. Gnutella) are characterized by uneven distributions of node connectivity and file sharing. The existence of “hub” nodes that have a large number of connections and “generous” nodes that share many files significantly influences performance of information search over P2P file-sharing networks. In this paper, we present a novel Scalable Peer-to-Peer Search (SP2PS) method with low maintenance overhead for resource discovery in scale-free P2P networks. Different from existing search methods which employ one heuristic to direct searches, SP2PS achieves better performance by considering both of the number of shared files and the connectivity of each neighbouring node. SP2PS enables peer nodes to forward queries to the neighbours that are more likely to have the requested files and also can help in finding the requested files in the future hops. The proposed method has been simulated in different power-law networks with different forwarding degrees and distances. From our analytic and simulation results, SP2PS achieves better performance when compared to other related methods.
16471179
Small World Architecture for Peer-to-Peer Networks
Small-world phenomenon has been observed in existing peer-to-peer (P2P) networks, such as Gnutella and Freenet. Due to the similarity of P2P networks to social networks, the previous small-world model proposed by Duncan Watts can be adopted in the design of P2P networks: each node is connected to some neighbouring nodes, and a group of nodes keep a small number of long links to randomly chosen distant nodes. Unfortunately, current unstructured search algorithms have difficulty distinguishing these random long-range shortcuts. This paper presents small world architecture for P2P networks (SWAN) with a semi-structured P2P search algorithm that is used to create and find long-range shortcuts toward remote peer groups. In SWAN, not every peer node needs to be connected to remote groups, but every peer node can easily find which peer nodes have external connections to a specific peer group
17142920
Service-Oriented Integration of Systems for Military Capability
Service oriented architecture (SOA) is becoming established in computing as a means to integrate processing and data across organisations. This paper proposes that system-level integration can benefit from service oriented architectural descriptions and loose coupling between the problem domain requirements and different system solutions. The problem domain is exemplified as military capability, from the UK Ministry of Defence (MoD), in particular, network enabled capability (NEC). Representations of military capability in the problem domain can be described in terms of processes. The processes are sequences of functions that can be described as services. Then different types of system solutions can implement the described services. Firstly, the paper presents an overview of conceptual SOA and in the context of military capability compares three levels of service integration: business services, systems services and computing services. Secondly, the paper presents a framework for evaluating the performance and effectiveness of service integration to compare different solutions in delivering military capability.
41392373
Small-World Peer-to-Peer for Resource Discovery
Small-world phenomenon is potentially useful to improve the performance of resource discovery in decentralized peer-to-peer (P2P) networks. The theory of small-world networks can be adopted in the design of P2P networks: each peer node is connected to some neighbouring nodes, and a group of peer nodes keep a small number of long links to randomly chosen distant peer nodes. However, current unstructured search algorithms have difficulty distinguishing among these random long-range shortcuts and efficiently finding a set of proper long-range links located in itself or its local group for a specific resource search. This paper presents a semi-structured P2P model to efficiently create and find long-range shortcuts toward remote peer groups.
8904843
Social Peer-to-Peer for Resource Discovery
For resource discovery in social networks, people can directly contact some acquaintances that have knowledge about the resources they are looking for. However, in current peer-to-peer networks, peer nodes lack capabilities similar to social networks, making it difficult to route queries efficiently. In this paper, we present a social-like system (Social-P2P) for resource discovery by mimicking human behaviours in social networks. Different from most informed search algorithms, peer nodes learn knowledge from the results of previous searches and no additional overhead is required to obtain extra information from neighbouring nodes. Unlike community-based P2P information sharing systems, we do not intend to create and maintain peer groups or communities consciously. Peer nodes with the same interests will be highly connected to each other spontaneously. Social-P2P has been simulated in a dynamic environment. From the simulation results and analysis, Social-P2P achieved better performance than current methods
14622249
Knowledge Inventory Management Using Actuarial Method
Knowledge inventory management is nowadays central issue as knowledge management becomes vital for organizations. Knowledge inventory management involves acquiring, retaining, deploying, idling, and abandoning technologies. Managers must make investment decisions about which technologies should be involved into inventory for future usage. Options-pricing model (OPM) has been widely accepted to make investment decisions. An alternative technology is regarded as an option to switch technologies to deal with future contingencies. This paper studies another kind of knowledge inventory problem which OPM is sort of inefficient to deal with. An organization might be forced to invest in some technology in the future because of some specific incident occurs, thus option is replaced by obligation. The characteristics of this kind of problem are portrayed and we show why OPM is not applicable. We treat the specific incident as an insurance accident to organizations and initial investment in some technology as insurance fee which can cover the loss when accident occurs. We use actuarial model to analyze the problem and give the evaluation methods in different conditions.
15609476
An Online Personalized Recommendation Model Based on Bayesian Networks
It is one of an important method of using Bayesian networks in electronic commercial recommended system. But the models of Bayesian networks for describing recommended system have a problem that it could not learn online. The paper puts forward an online personalized recommended model based on Bayesian networks. The paper uses a partial ordering to represent previous structure and find posterior distributions of every node on the orders to realize online structure learning. It also uses a correctional function to revise log likelihood for online parameter learning. The experiment shows that the model can be learned online for personalized recommended system.
46086944
A Research on Dissipative Structure of the Information Resource Organization of E-Government
Government information resource is the foundation of e-government, and government information resource organization pattern is the key factor that affects sustainable development of e-government. At present, a lack of the systematic plan in government information resource organization exists universally. The primary reason is that systematization and formalization of research on government information resource organization pattern is insufficient and lacks support to organize and plan the government information resource. This article starts with the basic assumption of the government information hyper-cycle system consisting of e-government and its object system, depicts the dissipative structure of government information resource organization through introducing superior-rank operator and lower-rank operator in algebra system, and explores actively the self-organized, extensible and universal government information resource organization pattern based on hyper-cycle (PBHC) systematic plan.
3090205
Challenges for End-to-End Quality of Service in Heterogeneous Networks
To guarantee the end-to-end QoS (E2E Quality of Service) in heterogeneous network is an important issue to provide pervasive and trusted service. Currently, the different networks are optimized for different services, but it becomes urgent to provide pervasive service across different networks. This paper gives an overview on how to design a dynamic and integrated QoS architecture under heterogeneous networks. This paper firstly analyzes the actuality of the E2E quality of service in heterogeneous networks, and then discusses the requirements of the E2E QoS of two types of heterogeneous networks, finally points out the five key issues to solve the practical problem in the current network.
694781
A Decentralized Resource Discovery Based on Keywords Combinations and Node Clusters in Knowledge Grid
The organization and discovery of grid resources are foundational and key subjects in grid research. Many research works in this field have presented the solutions to the problem, but few of them are focused on knowledge resources. This paper aims to explore how to support user's knowledge requests submitted in form of multi-keywords. We present a decentralized resource discovery method based on keyword combinations and node clusters. In the method, hot keyword combinations are formed based on user's knowledge requests. Then, grid nodes can be clustered according to these keyword combinations and user's knowledge requests will be transmitted to those clusters that have high correlations with the requests.