Structured P2P networks create a virtual topology on top of the physical topology. The only relation between the two layers is the hashing algorithm, which makes the node's logical ID independent of its physical l...
详细信息
Structured P2P networks create a virtual topology on top of the physical topology. The only relation between the two layers is the hashing algorithm, which makes the node's logical ID independent of its physical location. By analyzing the Hash function, some novel logical connections among the destination node, the traditional semantic routing relay node sequence, and the ID of the clustering neighboring nodes are found. In this paper, the SCSRAA (self-organizing clustering semantic routing advanced algorithm) is resented to improve the efficiency of semantic routing. Since the clustering nodes only have local views in self-organizing mode, some rules are proposed for a node to learn other nodes' physical location. The SCSRAA's routing algorithm is described completely. Simulations have verified that the method can improve the semantic routing efficiently.
Tô et al. presented a bilinear-map-based traitor tracing scheme with revocation, but it is a symmetric scheme because it does not provide non-repudiation. An improved Tô scheme was proposed using oblivious p...
详细信息
Tô et al. presented a bilinear-map-based traitor tracing scheme with revocation, but it is a symmetric scheme because it does not provide non-repudiation. An improved Tô scheme was proposed using oblivious polynomial evaluation (OPE) protocol and service parameters. Under the precondition of general sameness capabilities of both Tô's and improved Tô's scheme, the new scheme adds some advantages such as providing multi-service capability, user's non-repudiation and data provider's no framing innocent users. Furthermore, it is also proved to be semantically secure under the decisional bilinear Diffie-Hellman problem (DBDH) assumption.
Semantic routing is one of key parts in P2P routing researches. The intelligent search mechanisms support flexible semantic expression but hold low scalability and recall rate. Contrastively, semantic overlay network ...
详细信息
Semantic routing is one of key parts in P2P routing researches. The intelligent search mechanisms support flexible semantic expression but hold low scalability and recall rate. Contrastively, semantic overlay network is scalable but either is difficult to organize or take too large maintenance spending. This paper proposes a new P2P semantic routing model in which node array is organized by match path and probability balance tree, and then an approximately balance distributed structure is obtained. All nodes will take routing decision according to query content while limiting maintenance spending to relative low level. The model supports flexible semantic search and high scalability, and ensures that each node can reach any corner of the network. The model runs with no center service in which all nodes simultaneously take index storage and data storage, and forward task to share system's running load by only maintaining a little local information.
We present a robust disaster recovery system model according to the requests of disaster recovery talent of a key e-government project of China. The model strengthens the safe communication ability and guarantees the ...
详细信息
Assuming a specific network service provider is in the position of natural monopolization, the pricing strategy most likely adopted by the provider is analyzed with the objective of profit maximization. The optimal pr...
详细信息
Assuming a specific network service provider is in the position of natural monopolization, the pricing strategy most likely adopted by the provider is analyzed with the objective of profit maximization. The optimal pricing problem is decomposed into two sub-problems regarding user demands and marginal cost respectively. The utility characteristics of transport control protocol are taken into account to infer a typical user's transport demands from the principle of net-utility maximization. Then the total demands function is deduced on the assumption that the user's budget constraint subjects to negative exponential distribution. With respect to marginal cost, the active queue management rationale is used for reference. Thereafter the relationship between marginal cost and network congestion cost is carefully examined, from which a piecewise marginal cost function in power form is presented. This pricing mechanism gives attention to the profit maximization objective of network service providers as well as the technical characteristics of transport control protocol. We believe that it would conduce to more efficient network resource allocation.
For group-oriented applications, designing secure and efficient group key management schemes is a major problem. We present a group key management scheme for dynamic peer networks, which supports join, leave, merge an...
详细信息
ISBN:
(纸本)1424406048
For group-oriented applications, designing secure and efficient group key management schemes is a major problem. We present a group key management scheme for dynamic peer networks, which supports join, leave, merge and partition events. In the scheme, the numbers of rounds and messages are close to the lower bounds of those for dynamic group key management, and the length of messages and computation costs are less than those of the existing schemes. Furthermore, this scheme provides forward secrecy, backward secrecy and key independence
An end-to-end real-time scheduling model can be used to describe many distributed real-time systems. An EDF-based end-to-end real-time scheduling model is proposed. According to the time demand analysis technique, a s...
详细信息
An end-to-end real-time scheduling model can be used to describe many distributed real-time systems. An EDF-based end-to-end real-time scheduling model is proposed. According to the time demand analysis technique, a schedulability condition for the end-to-end real-time system is deduced. Then, a schedulability analysis algorithm is developed. The schedulability condition and schedulablity analysis algorithm are suitable not only for end-to-end real-time systems controlled by non-greedy synchronization protocols, but also for those controlled by greedy synchronization protocol. Compared with fix-priority-based end-to-end real-time scheduling model and its algorithms, the model and algorithm proposed are simpler and easier to implement. Simulation results reveal that higher performance can be achieved too.
Due to wide application of the wireless sensor network (WSN), the WSN security problems have become very critical. In broadcast authentication mechanisms, the traditional protocols are confronted with large challenges...
详细信息
Due to wide application of the wireless sensor network (WSN), the WSN security problems have become very critical. In broadcast authentication mechanisms, the traditional protocols are confronted with large challenges. Because they are not suitable for the WSN systems which have low computational power and limited memory size. To get an efficient broadcast authentication protocol, the traditional μTESLA and multi-level μTESLA are utilized and studied. The problems of these protocols are pointed out. Then E-μTESLA is presented on the basis of 2-level μTESLA. At the end, the performances of E-μTESLA are compared with m-level E-μTESLA. The comparison results show that E-μTESLA is more efficient in less computational power, and less storage memory than those of m-level E-μTESLA.
In high-speed Internet links, effective and efficient packet sampling technology in traffic measurement becomes more and more indispensable for its benefits of reducing data quantity and saving various resources. We a...
详细信息
The study on semantic routing efficiency of DHTP2P networks is a key element to promote the development of P2P networks, it is critical for a P2P routing algorithm to be aware of the network physical topology, which l...
详细信息
暂无评论