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.
An innovated evolving network representation model to characterize weighted, complex, scale-free networks is proposed. A new node or a community is added to network in the process of evolution while emergences of new links occur according to the ‘Triad Formation’ possessing symmetry and the random selection mechanism. A weighted scale-free network with high-value clustering coefficient can be obtained...
We propose a novel inter-layer path control mechanism in a PCE-VNTM cooperative multi-layer networks (MLN). For this, we define a novel FA-LSP aware PCE which only reports and manages a forwarding adjacency-label switched path (FA-LSP) state. In our scheme, the FA-LSP can be distinguished from the pure higher-layer TE link more and accurately controlled with a network policy. We worked out the methodology...
As high-performance systems continue to expand in power and size, scalable communication and data transfer is necessary to facilitate next generation monitoring and analysis. Many popular frameworks such as MapReduce, MPI and MRNet utilize scalable reduction operations to fulfill the performance requirements of a large distributed system. The structures to handle these aggregations may simply consist...
Wireless sensor network protocols very often use the Trickle algorithm to govern information dissemination. For example, the widely used IPv6 Routing Protocol for Low-Power and Lossy Networks (RPL) uses Trickle to emit control packets. We derive an analytical model of Trickle to take into account multiple redundancy constants and the common lack of synchronization among nodes. Moreover, we demonstrate...
Current multicomputers are typically built as interconnected clusters of shared-memory multicore computers. A common programming approach for these clusters is to simply use a message-passing paradigm, launching as many processes as cores available. Nevertheless, to better exploit the scalability of these clusters and highly-parallel multicore systems, it is needed to efficiently use their distributed-...
Simulation is an important method to evaluate future computer systems. However, the increasing complexity of the target systems has made the development of simulators very difficult. Furthermore, detailed simulation of large-scale parallel architecture is so slow that full evaluation of real application becomes a great challenge. This paper presents SimICT, a fast and flexible simulation framework...
With continuing miniaturization, NoCs with 1024 nodes will become realistic around the year 2020. The design of such NoCs requires efficient simulation techniques to evaluate design alternatives and to validate functional correctness. The current state of the art, sequential simulation, will no longer provide acceptable simulation time. Parallel simulation exploiting multicore and multithreading capabilities...
This paper presents a hierarchical composite synchronization algorithm for parallel discrete-event simulation. The composite approach combines an asynchronous CMB-style channel scanning method with a synchronous window-based method to avoid pathological situations where neither synchronization algorithms would perform optimally. The hierarchical approach addresses the discrepancy in the communication...
In a recent paper, Cucker and Smale proposed a multi-agent model to study the flocking behavior, where they assume that all agents can interact with all other agents. Though this model attracted much attention of researchers, the global interactions used in that paper changed the nature of multi-agent systems. In this paper we will investigate a new flocking model, in which the global interactions...
We present a preliminary study of self-organizing TDMA for battery-constrained multihop wireless networks, such as sensor networks. Compared with existing TDMA approaches, this work emphasizes operation in the context of battery saving techniques that allow the radio to spend most of its time powered down, relying on some rendezvous mechanism to ensure that sender and receiver are simultaneously powered...
We consider the multi-parameterised process algebraic verification of safety properties. There is a cut-off result for such verification tasks, but it cannot be naturally applied to systems involving linear parts. We show how the limitation can be overcome by computing a network invariant for each linear part and including all the processes obtained during the computation in the system model.
We present a formal framework to evaluate stochastic properties of MANET protocols. It captures the interplay between stochastic behavior of protocols deployed at different network layers, and the underlying dynamic topology. The link connectivity model, which implicitly models node mobility, specifies link up and down lifetimes. We use so-called constrained labeled multi-transition systems (CLMSs)...
Peer-to-peer (P2P) systems, which are realized as overlays on top of the underlying Internet routing architecture, contribute a significant portion of today's Internet traffic. They have recently absorbed a lot of attention from the Internet users and the research community. Regarding the difficulty and cost for a large scale living deployment, many proposed P2P protocols were evaluated by a simulator...
The Peer-to-Peer (P2P) technology being widely adopted in today's both academic research and practical service providing, has many potential advantages, including high scalability and cost-effectiveness. However, the behavior of these P2P systems under large scale and complex interactions is still poorly understood and many challenges in improving their performance remain. A fundamental problem in...
In this paper, we propose an eigenvector criterion for achieving optimal synchronizability in a dynamical network. Two synchronization-optimal small-world (SOSW) models are generated by adding or rewiring edges from a nearest-neighbor coupled regular network according to the eigenvector criterion. We find that networks having very similar topology characteristics may have different synchronizability...
This paper addresses the problem of how to adapt an algorithm designed for fixed topology networks to produce the intended results, when run in a network whose topology changes dynamically, in spite of encountering topological changes during its execution. We present a simple and unified procedure, called a reset procedure, which, when combined with the static algorithm, achieves this adaptation....
Universal networks offer the advantage that they can execute programs written for simpler architectures without significant run-time overhead. In this paper we investigate simulations of tree machines; the fact that divide-and-conquer algorithms are programmed naturally on trees motivates our investigation. Among various proposals for parallel computing the boolean hypercube has emerged as a particularly...
Sublinear signal propagation delay in VLSI circuits carries a far greater penalty in wire area than is commonly realized. Therefore, the global complexity of VLSI circuits is more layout dependent than previously thought. This effect will be truly pronounced in the emerging wafer scale integration technology. We establish lower bounds on the trade-off between sublinear signalling speed and layout...
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.