Sharif Digital Repository

Peer-to-peer networks are beginning to form the infrastructure of future applications. The use of semantic information to organize nodes in a P2P network is a prosperous approach. In this paper we present a novel method, called Semantic Partition Tree, which organizes nodes in a semantic space, using an upper ontology. In this approach each node can find a target in a time proportioned to the depth of the upper ontology, which is significantly less than the number of nodes in the network. Also we simulated our method with several configurations and measured its performance. The results of the simulation show that our scheme is highly scalable and can be used by real P2P networks. © 2007 IEEE... 

This article proposes a new architecture for distributed data management and update massage exchange in massively multiuser virtual environments. The key points in the design of such environments are scalability and QoS-aware message delivery. Therefore it requires robust distributed algorithms in a dynamic peer-to-peer system with frequent node arrivals and departures. Our proposed approach is mainly based on distributed hash tables (DHTs) in order to achieve a decentralized system where any participating node can efficiently retrieve the updates associated with a given object. Therefore, the responsibility of maintaining the mapping from names to values is distributed among the nodes in a... 

Mobile Ad hoc Networks (MANETs) are based on the assumption of that all participants in the network cooperate and forward packets towards the destinations. However, due to the limited nature of the nodes' resources, a node may decide not to cooperate to save its resources while still using the network. Such behavior of some nodes may degrade the whole network performance. To cope with such a situation, we propose a Stable path, Low overhead, Truthful, and Cost efficient (SLTC) routing protocol which stimulates nodes to cooperate. SLTC utilizes the game theoretic notion of mechanism design. To the best of our knowledge, SLTC is the first protocol attaining the message complexity of O(nd),... 

In this paper we will propose a novel distributed architecture for overlay tree construction in collaborative virtual environments that is unlimitedly scalable due to its fully decentralized nature. The routing issue over this architecture will later be discussed and several forwarding schemes based on distributed hash tables (DHT) will be proposed. One of the main concerns for a routing algorithm is to keep a trade-off between the algorithm locality and the algorithm performance. In a global algorithm where nodes make the forwarding decision based on the information gathered from all other nodes in the network, the routing performance may obviously be better. However such a large group...