The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper demonstrates that virtual networks that are dynamically embedded on a given resource network may constitute a security threat as properties of the infrastructure — typically a business secret — are disclosed. We initiate the study of this new problem and introduce the notion of request complexity which captures the number of virtual network embedding requests needed to fully disclose the...
Target localization is one of the most important and fundamental issues in wireless sensor networks (WSNs). Because of its special topology structure, grid-based wireless sensor networks have a great advantage in target localization. In this paper, firstly, we analyze the uncertain area founded by the topology structure of single-level grid-deployed networks. A double-level grid-based localization...
Up to not so long ago, Loop-Free Alternates (LFA) was the only viable option for providing fast protection in pure IP and MPLS/LDP networks. Unfortunately, LFA cannot provide protection for all possible failure cases in general. Recently, the IETF has initiated the Remote Loop-Free Alternates (rLFA) technique, as a simple extension to LFA, to boost the fraction of failure cases covered by fast protection...
The software systems running in an enterprise consist of countless components, having complex dependencies, are hosted on physical or virtualized environments, and are scattered across the technical infrastructure of an enterprise, ranging from on-premise data centers up to public cloud deployments. The resulting topology of the current IT landscape of an enterprise is often extremely complex. We...
In this paper, we describe and analyze the architecture of the proposed Debug Event Distribution Interconnect (EDI). The EDI transmits debug events, which are 1-bit signals, between debug entities in different areas of the Network-on-Chip based Multi-Processor System-on-Chip. The EDI replicates the NoC topology with an EDI node instantiated for each underlying NoC data module. Contention in the EDI...
In a large-scale locality-driven network, knowing the state of a local area is sometimes necessary due to either interactions being local and driven by neighborhood proximity or the users being interested in the state of a certain region. We propose locality-aware predicates that aim at detecting a predicate within a specified area. We model the area of interest as the set of processes that are within...
As the number of processing elements which can be placed on a single chip doubles about every two years, both System-on-Chip (SoC) and the microprocessor market call for high-performance, flexible, scalable, and design-friendly interconnection network architectures [1]. Network-on-Chip (NoC) has been proposed as a solution to multi-core communication problems. The advantages of NoC include high bandwidth,...
It has been shown by McEliece and Lin that convolutional codes can be represented by a minimal trellis structure in order to reduce the decoding complexity of the Viterbi algorithm. This trellis module has an irregular structure presenting sections with different number of states. In this paper we present the sectionalization of the minimal trellis module which yields a more compact and regular trellis...
In this paper, we present a Simple Fault-Tolerant Local Topology Control (SFL) algorithm, for reliable wireless multi-hop networks, that is an improvement on the LTRT algorithm. In SFL, each node builds its local SFL independently by applying LMST k times to achieve k-edge connectivity, to optimize its transmission power by maintaining network connectivity in a localized manner. SFL and LTRT share...
The Internet is facing severe routing scalability problem. The Internet Service Providers cannot afford to upgrade their routers at the pace of routing table growth. Therefore, FIB aggregation has been proposed. However, current single-nexthop FIB aggregation solutions cannot provide a satisfactory performance. In this paper, we first propose the next hop of strict partial order (SPO next hop) to...
A question of interest to those studying the emergence of social systems is the extent to which their organizational structure reflects the structures of the problems that are presented to them. In a recent study [14] used Cultural Algorithms as a framework in which to empirically address this and related questions. There, a problem generator based upon Langton's model of complexity was used to produce...
The technique of diversity coding offers fast recovery against failures in networks while keeping spare capacity comparable to the alternative state-of-the art network restoration techniques. It provides near-hitless recovery when coding is performed on connections with the same destination node. When the coding structure is extended to cover the primary paths, diversity coding can achieve higher...
This paper evaluates two Neuro-Evolution (NE) methods to adapt controllers in simulated robot teams. The first method evolves controllers with fixed topologies and adapts team size as a function of task complexity. The second method evolves controller topology as a function of task complexity, but keeps team sizes constant. These methods are: Collective Neuro-Evolution 2 (CONE-2), and Neuro-Evolution...
Enterprises often have no integrated and comprehensive view of their enterprise topology describing their entire IT infrastructure, software, on-premise and off-premise services, processes, and their interrelations. Especially due to acquisitions, mergers, reorganizations, and outsourcing there is no clear 'big picture' of the enterprise topology. Through this lack, management of applications becomes...
Overlay network architectures that use orthogonal channels have been known to provide effective additional resources to underlying networks in high demand. Overlays are composed of relay nodes provided with rich computational resources and multiple wireless interfaces that make them capable of establishing several non-interfering networks. These networks can be used to move traffic around in a non-interfering...
Underactuated compliant robotic hands exploit passive mechanics and joint coupling to reduce the number of actuators required to achieve grasp robustness in unstructured environments. Reduced actuation requirements generally serve to decrease design cost and improve grasp planning efficiency, but overzealous simplification of an actuation topology, coupled with insufficient tuning of mechanical compliance...
Network Exchange Objects (NEO) is a new software framework designed to facilitate development of complex natural or built distributed system models, where the system model is represented as a graph, through which currencies (e.g., coding information) flux. This paper introduces "system-level hypothesis (SLH) testing" as a form of computational thinking that will drive integration of computational...
Root cause analysis of BGP updates is the key to debug and troubleshoot BGP routing problems. However, inferring the root cause with high accuracy is challenge. Although correlating multiple vantage points is a validate method, how many vantage points are truly necessary to pinpoint the root cause is not resolved. In this paper, we propose a new method to explore two independent vantage points to...
The cost and reliability of a network are very much affected by its topology. Moreover, the network parameters like path length and link load are also dependent on the topology used for a network. These parameters are vital for any network. Hence constructing a set of topology candidates prior to evaluation is crucial. However, constructing candidate set is a time consuming task and this time is greatly...
In this paper, we explore methods to generate optimal network topologies for wireless sensor networks (WSNs) with and without obstacles. Specifically, we investigate a dense network with n sensor nodes and m = nb (0 < b < 1) helping nodes, and evaluate the impact of topology on its throughput capacity. For networks without obstacles, we find that uniformly distributed sensor nodes...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.