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.
Geographical correlated failures are threats that cause major interruptions and damage to networking systems. To mitigate this rarely addressed challenge, this letter presents a novel geographical location-aware route selection algorithm to support uninterrupted networking. The multi-path routing method developed calculates multiple paths that satisfy different constraints, while ensuring the prescribed...
Scale-free can be seemed as one of the most impacting discoveries in complex networks theory and has already been successfully proved to be highly effective in constructing error-tolerant topology structures of wireless sensor networks (WSNs). As in scale-free WSNs, a few key nodes possess most connections, requiring them to take excessive message-relay tasks. Due to this reason, the energy of these...
This paper presents an effective content replication scheme for peer-to-peer online social networks (P2P-OSN). The topology of P2P-OSN is defined by the social network of the participants. P2P-OSN allow people to share content and run applications with their 1-hop friends in decentralized fashion, while denying access to their potentially private data to other users. Content replication in these networks...
This paper describes a search-based level generation approach that uses the search space of action sequences, represented as graphs, rather than spatial layouts. The search is guided by mutation operators that manipulate the graph topology, and the paper explores various objective functions that are based on generic level evaluation metrics. The evolved action sequences are passed to a grammar-based...
δ-Hyperbolicity is a graph parameter that shows how close to a tree a graph is metrically. In this work, we propose a method that reduces the size of the graph to only a subset that is responsible for maximizing its δ-hyperbolicity using the local dominance relationship between vertices. Furthermore, we empirically show that the hyperbolicity of a graph can be found in a set of vertices that are in...
This paper presents a novel approach for allocating resources in systems with multiple accelerators. It has three main contributions. First, a new model based on Birkhoff's representation theory in capturing the ordering properties of resource allocation requests (RArs). Second, an effective technique for resource allocation based on this model, targeting systems with multiple accelerators. Third,...
Network exists because of human, and plays a vital role also because of our actual requirements. Many networks in the real-world cannot keep working properly without control theory or control behavior. Essentially, control is a combinatorial optimization problem. On the one hand, we aim to achieve the control objectives better and faster; on the other hand, we hope to reduce resource consumption as...
The topological structure of the Internet - the interconnection of routers and autonomous systems (ASes) - is large and complex. Frequently it is necessary to evaluate network protocols and applications on “Internet-like” graphs in order understand their security, resilience, and performance properties. A fundamental obstacle to emulation and simulation is creating realistic Internet-like topologies...
Physical topology design (PTD) of networks is frequently accomplished by combining several solutions in a iterative way, specially if meta-heuristics are deployed. Suitable operators to recombine network topologies aiming at creating novel options for network design that preserve desired properties can improve the quality of algorithms developed to solve the PTD problem. In this paper we propose to...
In this paper we extend the theory of control of discrete event systems, defined by their trace processes, to their sequential, or steady-state behavior. The control synthesis problem for finite behavior of such processes was first studied by Smedinga. Here we investigate the control synthesis problem for simultaneous control of finite and infinite (sequential) behavior of trace processes. We use...
The ongoing trend towards a global services economy creates considerable market opportunities for various stakeholders. A service intermediary who offers complex services to customers and consumes services from suppliers and thus creates a service value network, faces the challenge of adhering to agreed service levels while minimizing associated costs, risks and potential penalties. Starting from...
In this paper we study the convergence of consensus algorithms in wireless sensor networks with random topologies and instantaneous symmetric links which exist with different probabilities independently in time but correlated in space. Aiming at minimizing the convergence time of the algorithm, we adopt an optimization criterion based on the spectral radius of a positive semidefinite matrix for which...
Existing network operator-friendly P2P traffic control techniques like P4P argue that network operators can reduce inter-domain traffic while peer-to-peer (P2P) applications can improve their performance through the traffic localization. However, the existing work has not addressed how the traffic localization affects an intra-domain traffic control in detail. In fact, not considering the impact on...
Social network methods are frequently used to analyze networks derived from Open Source Project communication and collaboration data. Such studies typically discover patterns in the information flow between contributors or contributions in these projects. Social network metrics have also been used to predict defect occurrence. However, such studies often ignore or side-step the issue of whether (and...
Threatens faced by large-scale network attacks, it is of great importance to exert an emergency response, in order to mitigate the further hazardous caused by network attacks. To implement a reasonable control strategy, a minimal set of routers is computed in a network that can be used to control and reduce damage done by a large-scale attack such as worm or DDOS attacks. Our work focuses on large...
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.