40,717 research outputs found
A knowledge-based system with learning for computer communication network design
Computer communication network design is well-known as complex and hard. For that reason, the most effective methods used to solve it are heuristic. Weaknesses of these techniques are listed and a new approach based on artificial intelligence for solving this problem is presented. This approach is particularly recommended for large packet switched communication networks, in the sense that it permits a high degree of reliability and offers a very flexible environment dealing with many relevant design parameters such as link cost, link capacity, and message delay
Constructive simulation and topological design of protocols
We give a topological simulation for tensor networks that we call the
two-string model. In this approach we give a new way to design protocols, and
we discover a new multipartite quantum communication protocol. We introduce the
notion of topologically-compressed transformations. Our new protocol can
implement multiple, non-local compressed transformations among multi-parties
using one multipartite resource state.Comment: 16 page
Time-Varying Graphs and Dynamic Networks
The past few years have seen intensive research efforts carried out in some
apparently unrelated areas of dynamic systems -- delay-tolerant networks,
opportunistic-mobility networks, social networks -- obtaining closely related
insights. Indeed, the concepts discovered in these investigations can be viewed
as parts of the same conceptual universe; and the formal models proposed so far
to express some specific concepts are components of a larger formal description
of this universe. The main contribution of this paper is to integrate the vast
collection of concepts, formalisms, and results found in the literature into a
unified framework, which we call TVG (for time-varying graphs). Using this
framework, it is possible to express directly in the same formalism not only
the concepts common to all those different areas, but also those specific to
each. Based on this definitional work, employing both existing results and
original observations, we present a hierarchical classification of TVGs; each
class corresponds to a significant property examined in the distributed
computing literature. We then examine how TVGs can be used to study the
evolution of network properties, and propose different techniques, depending on
whether the indicators for these properties are a-temporal (as in the majority
of existing studies) or temporal. Finally, we briefly discuss the introduction
of randomness in TVGs.Comment: A short version appeared in ADHOC-NOW'11. This version is to be
published in Internation Journal of Parallel, Emergent and Distributed
System
Design of a multiple bloom filter for distributed navigation routing
Unmanned navigation of vehicles and mobile robots can be greatly simplified by providing environmental intelligence with dispersed wireless sensors. The wireless sensors can work as active landmarks for vehicle localization and routing. However, wireless sensors are often resource scarce and require a resource-saving design. In this paper, a multiple Bloom-filter scheme is proposed to compress a global routing table for a wireless sensor. It is used as a lookup table for routing a vehicle to any destination but requires significantly less memory space and search effort. An error-expectation-based design for a multiple Bloom filter is proposed as an improvement to the conventional false-positive-rate-based design. The new design is shown to provide an equal relative error expectation for all branched paths, which ensures a better network load balance and uses less memory space. The scheme is implemented in a project for wheelchair navigation using wireless camera motes. © 2013 IEEE
Optimal network topologies for local search with congestion
The problem of searchability in decentralized complex networks is of great
importance in computer science, economy and sociology. We present a formalism
that is able to cope simultaneously with the problem of search and the
congestion effects that arise when parallel searches are performed, and obtain
expressions for the average search cost--written in terms of the search
algorithm and the topological properties of the network--both in presence and
abscence of congestion. This formalism is used to obtain optimal network
structures for a system using a local search algorithm. It is found that only
two classes of networks can be optimal: star-like configurations, when the
number of parallel searches is small, and homogeneous-isotropic configurations,
when the number of parallel searches is large.Comment: 4 pages. Final version accepted in PR
Spatially self-organized resilient networks by a distributed cooperative mechanism
The robustness of connectivity and the efficiency of paths are incompatible
in many real networks. We propose a self-organization mechanism for
incrementally generating onion-like networks with positive degree-degree
correlations whose robustness is nearly optimal. As a spatial extension of the
generation model based on cooperative copying and adding shortcut, we show that
the growing networks become more robust and efficient through enhancing the
onion-like topological structure on a space. The reasonable constraint for
locating nodes on the perimeter in typical surface growth as a self-propagation
does not affect these properties of the tolerance and the path length.
Moreover, the robustness can be recovered in the random growth damaged by
insistent sequential attacks even without any remedial measures.Comment: 34 pages, 12 figures, 2 table
- …