Congestion pricing by priority auction

This paper analyzes a communication network facing users with a continuous distribution of delay cost per unit time. Priority queueing is often used as a way to provide differential services for users with different delay sensitivities. Delay is a key dimension of network service quality, so priority is a valuable resource which is limited and should to be optimally allocated. We investigate the allocation of priority in queues via a simple bidding mechanism. In our mechanism, arriving users can decide not to enter the network at all or submit an announced delay sensitive value. User entering the network obtains priority over all users who make lower bids, and is charged by a payment function which is designed following an exclusion compensation principle. The payment function is proved to be incentive compatible, so the equilibrium bidding behavior leads to the implementation of "cµ-rule". Social warfare or revenue maximizing by appropriately setting the reserve payment is also analyzed.

Attachment anxiety and friendship group identification under attachment threat:the moderating role of priming support network expectations

We examined the role of priming participants' own network expectations on their subsequent identification with their friendship group. We examined this prime alongside attachment anxiety and attachment threat, as predictors of friendship group identification. Previous research has suggested that attachment anxiety is associated with negative network expectations. In this study, we extended this work to show that when a network expectation prime was absent, higher attachment anxiety was associated with lower group identification under attachment threat, compared to a control condition. However, when expectations of support network were primed, attachment threat no longer affected group identification, so that only attachment anxiety predicted group identification. This suggests that priming participants who are high in attachment anxiety with their own network expectancies (which are negative), results in participants dis-identifying with their friendship group, regardless of whether or not they have experienced attachment threat. © 2012 Elsevier Ltd.

An enhanced scalable probe-based multicast admission control scheme

To guarantee QoS for multicast transmission, admission control for multicast sessions is expected. Probe-based multicast admission control (PBMAC) scheme is a scalable and simple approach. However, PBMAC suffers from the subsequent request problem which can significantly reduce the maximum number of multicast sessions that a network can admit. In this letter, we describe the subsequent request problem and propose an enhanced PBMAC scheme to solve this problem. The enhanced scheme makes use of complementary probing and remarking which require only minor modification to the original scheme. By using a fluid-based analytical model, we are able to prove that the enhanced scheme can always admit a higher number of multicast sessions. Furthermore, we present validation of the analytical model using packet based simulation. Copyright © 2005 The Institute of Electronics, Information and Communication Engineers.

Anticipatory control of long-range phase synchronization

Everyday human behaviour relies on our ability to predict outcomes on the basis of moment by moment information. Long-range neural phase synchronization has been hypothesized as a mechanism by which ‘predictions’ can exert an effect on the processing of incoming sensory events. Using magnetoencephalography (MEG) we have studied the relationship between the modulation of phase synchronization in a cerebral network of areas involved in visual target processing and the predictability of target occurrence. Our results reveal a striking increase in the modulation of phase synchronization associated with an increased probability of target occurrence. These observations are consistent with the hypothesis that long-range phase synchronization plays a critical functional role in humans' ability to effectively employ predictive heuristics.

Design and analysis of distributed utility maximization algorithm for multihop wireless network with inaccurate feedback

Distributed network utility maximization (NUM) is receiving increasing interests for cross-layer optimization problems in multihop wireless networks. Traditional distributed NUM algorithms rely heavily on feedback information between different network elements, such as traffic sources and routers. Because of the distinct features of multihop wireless networks such as time-varying channels and dynamic network topology, the feedback information is usually inaccurate, which represents as a major obstacle for distributed NUM application to wireless networks. The questions to be answered include if distributed NUM algorithm can converge with inaccurate feedback and how to design effective distributed NUM algorithm for wireless networks. In this paper, we first use the infinitesimal perturbation analysis technique to provide an unbiased gradient estimation on the aggregate rate of traffic sources at the routers based on locally available information. On the basis of that, we propose a stochastic approximation algorithm to solve the distributed NUM problem with inaccurate feedback. We then prove that the proposed algorithm can converge to the optimum solution of distributed NUM with perfect feedback under certain conditions. The proposed algorithm is applied to the joint rate and media access control problem for wireless networks. Numerical results demonstrate the convergence of the proposed algorithm. © 2013 John Wiley & Sons, Ltd.

Ad hoc network state aware routing protocol

The environment of a mobile ad hoc network may vary greatly depending on nodes' mobility, traffic load and resource conditions. In this paper we categorize the environment of an ad hoc network into three main states: an ideal state, wherein the network is relatively stable with sufficient resources; a congested state, wherein some nodes, regions or the network is experiencing congestion; and an energy critical state, wherein the energy capacity of nodes in the network is critically low. Each of these states requires unique routing schemes, but existing ad hoc routing protocols are only effective in one of these states. This implies that when the network enters into any other states, these protocols run into a sub optimal mode, degrading the performance of the network. We propose an Ad hoc Network State Aware Routing Protocol (ANSAR) which conditionally switches between earliest arrival scheme and a joint Load-Energy aware scheme depending on the current state of the network. Comparing to existing schemes, it yields higher efficiency and reliability as shown in our simulation results. © 2007 IEEE.

Probabilistic synchronisation of pinning control

This paper is concerned with synchronization of complex stochastic dynamical networks in the presence of noise and functional uncertainty. A probabilistic control method for adaptive synchronization is presented. All required probabilistic models of the network are assumed to be unknown therefore estimated to be dependent on the connectivity strength, the state and control values. Robustness of the probabilistic controller is proved via the Liapunov method. Furthermore, based on the residual error of the network states we introduce the definition of stochastic pinning controllability. A coupled map lattice with spatiotemporal chaos is taken as an example to illustrate all theoretical developments. The theoretical derivation is complemented by its validation on two representative examples.

Background synaptic activity in rat entorhinal cortical neurones:differential control of transmitter release by presynaptic receptors

The entorhinal cortex (EC) is a key brain area controlling both hippocampal input and output via neurones in layer II and layer V, respectively. It is also a pivotal area in the generation and propagation of epilepsies involving the temporal lobe. We have previously shown that within the network of the EC, neurones in layer V are subject to powerful synaptic excitation but weak inhibition, whereas the reverse is true in layer II. The deep layers are also highly susceptible to acutely provoked epileptogenesis. Considerable evidence now points to a role of spontaneous background synaptic activity in control of neuronal, and hence network, excitability. In the present article we describe results of studies where we have compared background release of the excitatory transmitter, glutamate, and the inhibitory transmitter, GABA, in the two layers, the role of this background release in the balance of excitability, and its control by presynaptic auto- and heteroreceptors on presynaptic terminals. © The Physiological Society 2004.

Neural Network Based Approach for Developing the Enterprise Strategy

Modern enterprises work in highly dynamic environment. Thus, the developing of company strategy is of crucial importance. It determines the surviving of the enterprise and its evolution. Adapting the desired management goal in accordance with the environment changes is a complex problem. In the present paper, an approach for solving this problem is suggested. It is based on predictive control philosophy. The enterprise is modelled as a cybernetic system and the future plant response is predicted by a neural network model. The predictions are passed to an optimization routine, which attempts to minimize the quadratic performance criterion.

Neural Control of Chaos and Aplications

Signal processing is an important topic in technological research today. In the areas of nonlinear dynamics search, the endeavor to control or order chaos is an issue that has received increasing attention over the last few years. Increasing interest in neural networks composed of simple processing elements (neurons) has led to widespread use of such networks to control dynamic systems learning. This paper presents backpropagation-based neural network architecture that can be used as a controller to stabilize unsteady periodic orbits. It also presents a neural network-based method for transferring the dynamics among attractors, leading to more efficient system control. The procedure can be applied to every point of the basin, no matter how far away from the attractor they are. Finally, this paper shows how two mixed chaotic signals can be controlled using a backpropagation neural network as a filter to separate and control both signals at the same time. The neural network provides more effective control, overcoming the problems that arise with control feedback methods. Control is more effective because it can be applied to the system at any point, even if it is moving away from the target state, which prevents waiting times. Also control can be applied even if there is little information about the system and remains stable longer even in the presence of random dynamic noise.

Adaptive Routing and Multi-Agent Control for Information Flows in IP-Networks

The principles of adaptive routing and multi-agent control for information flows in IP-networks.

Logical Models of Composite Dynamic Objects Control

The questions of designing multicriteria control systems on the basis of logic models of composite dynamic objects are considered.

Adaptive Control and Multi-agent Interface for Infotelecommunication Systems of New Generation

Problems for intellectualisation for man-machine interface and methods of self-organization for network control in multi-agent infotelecommunication systems have been discussed. Architecture and principles for construction of network and neural agents for telecommunication systems of new generation have been suggested. Methods for adaptive and multi-agent routing for information flows by requests of external agents- users of global telecommunication systems and computer networks have been described.

Multi-Agent Information Processing and Adaptive Control in Global Telecommunication and Computer Networks

The problems and methods for adaptive control and multi-agent processing of information in global telecommunication and computer networks (TCN) are discussed. Criteria for controllability and communication ability (routing ability) of dataflows are described. Multi-agent model for exchange of divided information resources in global TCN has been suggested. Peculiarities for adaptive and intelligent control of dataflows in uncertain conditions and network collisions are analyzed.

Simultaneous Control of Chaotic Systems Using RBF Networks

Chaos control is a concept that recently acquiring more attention among the research community, concerning the fields of engineering, physics, chemistry, biology and mathematic. This paper presents a method to simultaneous control of deterministic chaos in several nonlinear dynamical systems. A radial basis function networks (RBFNs) has been used to control chaotic trajectories in the equilibrium points. Such neural network improves results, avoiding those problems that appear in other control methods, being also efficient dealing with a relatively small random dynamical noise.