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.
The combination of Software Defined Networking (SDN) and Network Function Virtualization (NFV) promises to provide highly flexible and configurable network infrastructures. This relies, however, on an efficient assignment of the respective Service Function Chain (SFC). This is related to Virtual Network Embedding (VNE), where algorithms are devised to provide such an assignment. To evaluate and compare...
The ability to continuously detect the interesting subgraph patterns over dynamic graph-structured data in real time is crucial to many applications. Generally, the edges of such subgraphs have temporal relation. In this paper, the stream model is used to describe the dynamic graph, in which the edges are processed in chronological order. In order to reduce the intermediate results, we propose a topological...
The photovoltaic system works in stand-alone or grid applications, where the operation at the maximum power point (mPP) of generation is required. Maximum Power Point Tracking (MPPT) algorithm allows increasing the output power and it works commonly with a DC-DC converter. This work shows a novel analysis and the basic features of response about different topologies of DC-DC converters with MPPT algorithms...
The fourth industrial revolution is driven by the integration and analysis of a vast amount of diverse data. Thereby, data about production steps, overall manufacturing processes, and also supporting processes is gathered to enable holistic analysis approaches. These approaches promise to provide new insights and knowledge by revealing cost saving possibilities and also automated adjustments of production...
This paper studied the distributed adaptive time-varying formation problem for general linear multi-agent systems over a directed topology. First of all, some conditions to achieve distributed time-varying formations are given, which describe a feasible time-varying formation set. Second, a distributed adaptive algorithm is proposed for achieving fully distributed time-varying formation, which is...
Virtual Network Embedding (VNE) is widely considered as a longstanding challenge in Network Virtualization: how to efficiently embed multiple virtual networks (VNs), with node-link resource requirements, onto the shared substrate network (SN), having finite underlying resources. Most heuristic VNE algorithms in the literature, only considering single network topology attribute and local network resources,...
In interactive human-robot path-planning, a capability for expressing the path topology provides a natural mechanism for describing task requirements. We propose a topology-aware RRT∗ algorithm that can explore in parallel any given set of topologies. The topological information used by the algorithm can either be assigned by the human prior to the planning or be selected from the human in posterior...
In this paper, we introduce a distributed algorithm to compute the Čech complex. This algorithm is aimed at solving the coverage problems in self organized wireless networks. The complexity to compute the minimal Čech complex that gives information about coverage and connectivity of the network is O(n2), where n is the average number of neighbors of each cell. An application based on the distributed...
This paper has as a start point the metaheuristic Particle Swarm Optimization (PSO), which has very good abilities to solve many types of optimization problems. As a main contribution, this work proposes an intelligent algorithm derived from PSO. This algorithm has two main characteristics. The first one consists in the use of an improved version of PSO, namely Hybrid Topology Particle Swarm Optimization...
Distributed Mininet implementations have been extensively used in order to overcome Mininet's scalability issues. Even though they have achieved a high level of success, they still have problems and can face bottlenecks due to the insufficient placement techniques. This paper proposes a new placement algorithm for distributed Mininet emulations with optimisation for Fat-Tree topologies. The proposed...
Among the schemes proposed for failure recovery in software-defined networks, installing backup paths in advance is considered to be an effective approach to reduce the recovery latency. However, the pre-installation poses undue storage overheads on flow tables. In this paper, we propose a customized and cost-efficient backup scheme, which achieves fast recovery from any single-link failure. We introduce...
In Information-Centric Networks (ICN), contents are cached on some intermediary routers. This creates thus a new situation which is totally different from the traditional path-selection paradigm: the source/destination paradigm no longer exists; instead, the new paradigm is how to find a path through a selected group of caches, so that the content is delivered via the shortest way. This paper addresses...
With the migration of computational powers and applications to the cloud, Data Center Networks (DCNs) have become the backbone of the underlying infrastructure. Operation of the data centers relies on huge computational resources and bandwidth, that often undergo high operational costs, frequent link congestions, and imbalanced traffic loads. Software Defined Networking (SDN) based traffic load management...
This paper constructs a novel consensus framework for continuous-time multi-agent systems by using motion planning approaches. In this framework, a novel notion, specifiedtime consensus, is raised. Specified-time consensus means that the consensus of multi-agent systems is achieving with a finite settling time, which can be accurately and arbitrarily pre-specified according to task requirements. In...
Average-consensus filter problem is investigated for a mixed-order multi-agent system, which consists of first-order and second-order agents, and the proportional-integral consensus filter algorithms are proposed for the agents with different constant inputs. Based on generalized Nyquist stability criterion, sufficient convergence conditions are obtained for the multiagent system under a fixed, symmetric...
This paper proposes an automated topology optimization technique for internal antenna design using an improved BPSO. A new transfer function with a time-variant transfer factor is proposed to improve the problem of easily falling into local optimum in conventional BPSO. Compact tri-band planar antenna design is presented, showing that the proposed technique significantly outperforms the previous topology...
Target counting is an established challenge for sensor networks: given a set of sensors that can count (but not identify) targets, how many targets are there? The problem is complicated because of the need to disambiguate duplicate observations of the same target by different sensors. A number of approaches have been proposed in the literature, and in this paper we take an existing technique based...
Recent rapid scale out of high performance computing systems has rapidly and continuously increased the scale and complexity of the interconnects. As a result, current static and over-provisioned interconnects are becoming cost-ineffective. Against this background, we have been working on the integration of network programmability into the interconnect control, based on the idea that dynamically controlling...
Stream processing applications continuously process large amounts of online streaming data in real-time or near real-time. They have strict latency constraints, but they are also vulnerable to failures. Failure recoveries may slow down the entire processing pipeline and break latency constraints. Upstream backup is one of the most widely applied fault-tolerant schemes for stream processing systems...
On the basis of an integrated network-on-chip (NoC) topologies optimality criterion, as well as applying the adjacency matrix to describe NoC topologies, exhaustive search method and its modification by using branch and bound and Monte-Carlo methods are extended to the synthesis of NoC quasi-optimal topologies. Designed ScaNoC suboptimal topology synthesis algorithm is implemented on a high-level...
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.