Sharif Digital Repository

predicting the latency between hosts in the internet can play a significant rolein the improvement of the performance of many services that use latency distances among hosts as a decision making input. Although, the information regarding the point to point delay among internet peers is required in many applications, such information is not easily available to the peers. Latency data acquisition requires a considerableamount of measurements to be performed at each node in order for that node to keep a recordof its latency to all the other nodes. Moreover, the measurements need to be regularly repeated in order to be updatedagainst the network dynamics where the latency values are frequently... 

Large scale decentralized communication systems have motivated a new trend towards online routing where routing decisions are performed based on a limited and localized knowledge of the network. Geometrical greedy routing has been among the simplest and most common online routing schemes. While a geometrical online routing scheme is expected to deliver each packet to the point in the network that is closest to the destination, geometrical greedy routing, when applied over generalized substrate graphs, does not guarantee such delivery as its forwarding decision might deliver packets to a localized minimum instead. This letter investigates the necessary and sufficient conditions of greedy... 

In this paper, we consider the problem of overlay generation for video adaptation and streaming applications in a way to efficiently utilize the bandwidth and computing power of the participating peers. Therefore, the proposed architecture performs regular streaming functions as well as video adaptation functions, moving the video contents adaptation computation load away from dedicated media-streaming/adaptation servers to the participating peers. To verify the performance of our design, we followed an analytical approach based on 0-1 Integer Linear Programming method to model the system and to æakulate the optimum overlay. The performance of our scheme is evaluated by simulations.... 

Predicting latency between nodes on the internet can have a significant impact on the performance of many services that use latency distances among nodes as a decision making input. Coordinate-based approaches are among the family of latency prediction techniques where latency between each pair of nodes is modeled as the virtual distance among those nodes over a virtual system. This article proposes the Decentralized Coordinate System (DCS) as a fully distributed system that does not rely on any infrastructure support from the underlying network. DCS uses a two-phase algorithm: first, each host is assigned rough coordinates, then, the rough estimation is refined in a way that it gradually... 

This article proposes a new distributed architecture for update message exchange inmassively multi-user virtual environments (MMVE) MMVE applications require delivery of updates among various locations in the virtual environment. The proposed architecture here exploits the location addressing of geometrical routing in order to alleviate the need for IP-specific queries. However, the use of geometrical routing requires careful choice of overlay to achieve high performance in terms of minimizing the delay. At the same time, the MMVE is dynamic, in sense that users are constantly moving in the 3D virtual space. As such, our architecture uses a distributed topology control scheme that aims at... 

Ontology Alignment is a process for finding related entities of different ontologies. This paper discusses the results of our research in this area. One of them is a formulation for a new structural measure which extends famous related works. In this measure with a special attention to the transitive properties, it is tried to increase recall with less harm on precision. Second contribution is a new method for compound measure creation without any need to the mapping extraction phase. Effectiveness of these ideas is discussed and quantitative evaluations are explained in this paper. Copyright © 2006, Hassan Abolhassani, Babak Bagheri Hariri, & Seyed H. Haeri  

In this paper we propose a new architecture based on Z-order curve and kd-tree that can efficiently handle issues related to update messages distribution to interested entities' locations in a three-dimensional (3D) virtual environments where locations are described in terms of 3D coordinates. We also aim to minimize the number of routing hops in distribution of update messages, especially when updates are forwarded to a specific range of users/entities in the virtual environment. Our results are promising and show improvements in both of the objectives. ©2009 IEEE  

Ontology matching is a process for selection of a good alignment across entities of two (or more) ontologies. This can be viewed as a two-phase process of (1) applying a similarity measure to find the correspondence of each pair of entities from two ontologies, and (2) extraction of an optimal or near optimal mapping. This paper is focused on the second phase and introduces our evolutionary approach for that. To be able to do so, we need a mechanism to score different possible mappings. Our solution is a weighting mechanism named coincidence-based weighting. A genetic algorithm is then introduced to create better mappings in successive iterations. We will explain how we code a mapping as... 

The rapid growth of the world-wide web poses unprecedented scaling challenges for general-purpose crawlers and search engines. A focused crawler aims at selectively seek out pages that are relevant to a pre-defined set of topics. Besides specifying topics by some keywords, it is customary also to use some exemplary documents to compute the similarity of a given web document to the topic. In this paper we Introduce a new hybride focused crawler, which uses link structure of documents as well as similarity of pages to the topic to crawl the web © 2006 HEE