Master Thesis - 2001

Recently, as networks widely spread, the amount of information over networks are increasing. Mobile agent as a technology to use them efficiently receives much attention.

In this paper, I propose how to design a logical network which restricts the logical hop between each node and reduces the total traffic weighed on a physical network. Here, I define a logical hop as the number of hops between each node on a logical network. On a logical network, each node has the value of logical hop to the furthest node. In the proposed method, the product of this value and the physical distance to any nodes which do not belong to the logical network yet is calculated and a pair of nodes with the minimum value of it is connected with a new virtual link. When the logical hop between each node exceeds the required restriction, another new virtual link is added as a bypass. Therefore, the logical hop between any pairs of nodes can satisfy the restriction.