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.
To solve anycast routing problem with multiple QoS constraints, a improved anycast routing algorithm based on simplified particle swarm optimization algorithm and diversity strategy is presented. Firstly, the algorithm simplified the complexity of standard PSO algorithm and improved the convergence velocity extraordinarily by dynamically changing the inertia weight. Then, a mutation operator and diversity...
The close loop P type iterative learning control is proposed for systems with state delay in this paper. The design procedure is based upon obtaining the sufficient condition of convergence by Lyapunov theory, an iterative learning law is obtained by resolving linear matrix inequalities (LMI). The proposed method is more easily realized and strong practical. The scheme proposed guarantees that the...
Bottleneck in the production system has become an important factor to achieve the objective. How to deal with bottleneck resource utilization, load balance and reasonable arrangement for the production tasks has become one of the main tasks for production scheduling research. More and More enterprises and scholars are concerned about bottleneck production. So bottleneck identification has become the...
As one of the key technologies in Ad hoc networks, clock synchronization is the prerequisite of important network functions. Main consideration in clock synchronization are the choice of global clock and the accuracy, in which the existing clock synchronization methods still suffer lack. In this paper, the network delay is measured in networking process, and the network nodes complete synchronization...
In the short- and mid-term visions for robotics development, robots are expected to be used also in small and medium-sized companies, sharing spaces with different manufacturing cycles and possibly with human operators. This objective can be fulfilled only assuring high flexibility in production control, safety for workers and for machinery, and interfaces that allow an easy use of the equipment....
In this paper, we prove the existence, uniqueness and successive convergence for a stochastic differential multi-delay system with respect to a continuous martingale. Also, an uniformly convergence rate and the error estimation in L2 of approximate solution are given.
Aiming at the problems of the different authentication information and authentication methods in heterogeneous wireless network, based on the idea of the separation of identity, position, addressing etc information, the paper puts forward the unified client identity, and builds a complete client identity hiding and substitution mechanism, which effectively solve the moving terminals unified access...
In this paper we show data plane restoration measurements for restoration under backbone link failures for a large network with IP/MPLS OSPF routing and also for the same backbone with Traffic Engineering (TE) and Fast Reroute (FRR) deployed. Our study is unique as we analyzed a significant quantity of measurements obtained from a production network over a 14-month period encompassing many link failures...
Since the TCP transmission rate is low during the startup phase, the QoS of various applications is seriously degraded. To improve the TCP transmission rate in the startup phase, many fast startup algorithms have been proposed. In this paper, we evaluate the fundamental performance of fast startup algorithms. Specifically, we focus on the initial window size and Rate-Based Pacing (RBP) start method,...
In this paper a waveform relaxation algorithm based on longitudinal partitioning is presented to efficiently model large distributed networks. The proposed methodology represents lossy transmission lines as a cascade of lumped circuit elements and lossless line segments, where the lossless line segments are modeled using the method of characteristics. This allows the transmission line to be naturally...
Congestion control in transport protocols can be performed implicit when packets are lost, or explicit with feedback from the network. In this paper we compare some aspects of implicit and explicit congestion control using a variant of CUBIC with Quick-Start, called CUBIQ. We compare CUBIQ with regular TCP, XCP and CUBIC, and find that CUBIQ performs as well as XCP in most cases, and much better than...
A handful of proposals address the problem of bootstrapping a large DHT network from scratch, but they all forgo the standard DHT join protocols in favor of their own distributed algorithms that build routing tables directly. Motivating their algorithms, the proposals make a perfunctory claim that the standard join protocols are not designed to handle the huge number of concurrent join requests involved...
In order to reduce the number of BGP updates that routers need to process, it is common to rate-limit such updates using a timer that specifies the minimum time between two consecutive updates for a given destination prefix. Rate-limiting plays an important role in determining the number of routing updates that are generated after a routing event, and the time it takes before the network converges...
A new adaptive calibration scheme for IIP2 in direct down-conversion mixers is proposed for reduced implementation complexity and improved convergence time. The proposed IIP2 adaptive calibration scheme utilizes a modified least-mean-squares (LMS) algorithm with a variable update step and a highly IMD2-correlated reference input. Detailed implementation of the proposed IIP2 adaptive calibration is...
In CDMA cellular communication system power control is one of the most efficient methods to manage the resources, where the main capacity-limiting factor is co-channel interference. In this paper several closed loop power control algorithms are analyzed considering loop delay to cope with random changes of the radio channel and interference. Adaptive algorithms are considered that utilize ideas from...
In our previous work we have proposed a dynamic version of the consensus propagation (CP) algorithm introduced by Moallemi and Van Roy. Here, we pursue a system theoretic approach to the analysis of CP. Specifically, we first develop a state-space model for CP and then use this model to prove stability of CP when applied to time-varying processes. We further show how the state-space model can be used...
In this paper, we present a modified delayed least means square (DLMS) adaptive algorithm to achieve lower adaptation-delay. Besides, we have proposed an efficient pipelined architecture for the implementation of this adaptive filter. We have shown that the proposed DLMS adaptive filter can be implemented by a pipelined inner-product computation unit for calculation of feedback error, and a pipelined...
Effective context-aware broadcasting of information to the areas of interest (AoI) is a challenging problem in vehicular ad-hoc networks. It is usually assumed that the information about these AoI is known a priori, either by a centralized source of information or by the entire set of vehicles. In this paper, we propose a self-adaptive broadcasting scheme based on distributed reinforcement learning,...
RFD and MRAI are the only two built-in mechanisms in BGP router against unstable routes, they can however negatively impact the convergence. In this paper, we propose a churn aggregation approach CAGG to stabilize BGP routing without harming convergence. CAGG is based on the observation that AS PATH change is the dominant cause for BGP updates and only a small number of AS PATHs are explored by each...
In this paper, we present TIPO, a heuristic algorithm for timing constrained power optimization. The algorithm utilizes Dynamic Programming-like (DP_like) search method with consistency iteration and a fast gradient-based multiplier selection method that provides an effective set of Lagrange multipliers. Compared to the previous subgradient method provided by DP_like approach, TIPO is considerably...
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.