We propose the concept of open network as an arbitrary selection of nodes of a large unknown network. Using the hypothesis that information of the whole network structure can be extrapolated from an arbitrary set of its nodes, we use Rényi mutual entropies in different qorders to establish the minimum critical size of a random set of nodes that represents reliably the information of the main ne...

This paper explores the compressibility of complex systems by considering the simplification of Boolean networks. A method, which is similar to that reported by Bastolla and Parisi,4,5 is considered that is based on the removal of frozen nodes, or stable variables, and network “leaves,” i.e. those nodes with outdegree = 0. The method uses a random sampling approach to identify the minimum set o...

We present a practical approach to routing and anycasting with near-optimum delays taking into account the processing loads at routers and processing elements of a computer network. To accomplish this, the minimum-delay routing problem formulated by Gallager is generalized into the problem of minimum-delay routing with load-balancing to account for processing delays in network nodes (servers an...

Given an undirected graph with nonnegative edge-costs, a subset of nodes of size k called the terminals, and an integer q between 1 and k, the minimum q-Steiner forest problem is to nd a forest of minimum cost with at most q trees that spans all the terminals. When q = 1, we have the classical minimum-cost Steiner tree problem on networks. In this note, we adapt a primal-dual approximation algo...

A new fault management protocol that makes use of native fault tolerant features of TTP/C has been developed. It can tolerate multiple nodes failures no matter how close in time and in minimum time. The time it takes to detect a node failure and to reconfigure the system is minimum and it is fixed by the TTP/C protocol. The protocol tolerates that several nodes, including the active management ...

The capacitated minimum spanning tree (CMST) problem is to 3nd a minimum cost spanning tree in a network where nodes have speci3ed demands, with an additional capacity constraints on the subtrees incident to a given source node s. The capacitated minimum spanning tree problem arises as an important subproblem in many telecommunication network design problems. In a recent paper, Ahuja et al. (Ma...

The aim of this paper is to minimize the overlapping coverage area in Wireless Sensor Networks with nodes having adjustable radius. We proposed Area-aware Coverage (A2C) that considers the sensing and transmission range of sensor nodes adjustable and uses six phases to detect and minimize overlapping coverage area. We also minimized the presence of redundant nodes and nodes with minimum coverag...

This thesis considers two NP hard generalized network design problems, where the nodes of a graph are partitioned into clusters and exactly one node from each cluster must be connected. The objective of both problems is to identify for a given graph a subgraph with minimal total edge costs and satisfying certain constraints. The Generalized Minimum Spanning Tree (GMST) problem extends the class...

In this paper we address the minimum-energy broadcast problem in multi-hop wireless networks, so that all broadcast requests initiated by different source nodes take place on the same broadcast tree. Our approach differs from the most commonly used one where the determination of the broadcast tree depends on the source node, thus resulting in different tree construction processes for different ...

the mathematical aspect of cartographic mapping is a process which establishes a unique connection between points of the earth’s sphere and their images on a plane. it was proven in differential geometry that an isometric mapping of a sphere onto a plane with all corresponding distances on both surfaces remaining identical can never be achieved since the two surfaces do not possess the same gau...