A Tree-Structured Deterministic Self-Similar Network
نویسندگان
چکیده
Self-similarity is a property existing in natural, social, technological, biological, and many other networks. The whole and the parts, or one part and another part of self-similar networks present some similarity. In the past dozen years, researchers have proposed some deterministic self-similar networks by utilizing various kinds of mechanisms. In this paper, we propose a new deterministic self-similar network model based on the tree fractal. Furthermore, we give the analytic solutions to several important topological characteristics of the proposed model.
منابع مشابه
OPTIMIZATION OF TREE-STRUCTURED GAS DISTRIBUTION NETWORK USING ANT COLONY OPTIMIZATION: A CASE STUDY
An Ant Colony Optimization (ACO) algorithm is proposed for optimal tree-structured natural gas distribution network. Design of pipelines, facilities, and equipment systems are necessary tasks to configure an optimal natural gas network. A mixed integer programming model is formulated to minimize the total cost in the network. The aim is to optimize pipe diameter sizes so that the location-alloc...
متن کاملA Mixed Integer Programming Approach to Optimal Feeder Routing for Tree-Based Distribution System: A Case Study
A genetic algorithm is proposed to optimize a tree-structured power distribution network considering optimal cable sizing. For minimizing the total cost of the network, a mixed-integer programming model is presented determining the optimal sizes of cables with minimized location-allocation cost. For designing the distribution lines in a power network, the primary factors must be considered as m...
متن کاملSelf-stabilizing K-out-of-L exclusion on tree network
In this paper, we address the problem of k-out-of-l exclusion, a generalization of the mutual exclusion problem, in which there are l units of a shared resource, and any process can request up to k units (1 ≤ k ≤ l). We propose the first deterministic self-stabilizing distributed k-out-of-l exclusion protocol in message-passing systems for asynchronous oriented tree networks which assumes bound...
متن کاملQuasi Random Deployment Strategy for Reliable Communication Backbones in Wireless Sensor Networks
Topology construction and topology maintenance are significant sub-problems of topology control. Spanning tree based algorithms for topology control are basically transmission range based type construction algorithms. The construction of an effective backbone, however, is indirectly related to the placement of nodes. Also, the dependence of network reliability on the communication path undertak...
متن کاملThe Local Detection Paradigm and itsApplications to Self Stabilization
A new paradigm for the design of self-stabilizing distributed algorithms, called local detection, is introduced. The essence of the paradigm is in de ning a local condition based on the state of a processor and its immediate neighborhood, such that the system is in a globally legal state if and only if the local condition is satis ed at all the nodes. In this work we also extend the model of se...
متن کامل