Complex Dynamics of Autonomous Communication Networks and the Intelligent Communication Paradigm

Dynamics of arbitrary communication system is analysed as unreduced interaction process. The applied generalised, universally nonperturbative method of effective potential reveals the phenomenon of dynamic multivaluedness of competing system configurations forced to permanently replace each other in a causally random order, which leads to universally defined dynamical chaos, complexity, fractality, self-organisation, and adaptability. We demonstrate the origin of huge, exponentially high efficiency of the unreduced, complex network dynamics and specify the universal symmetry of complexity as the fundamental guiding principle for creation and control of such qualitatively new kind of networks and devices. The emerging intelligent communication paradigm and its practical realisation in the form of knowledge-based networks involve the properties of true, unreduced intelligence and consciousness (http://cogprints.ecs.soton.ac.uk/archive/00003857/) appearing in the complex (multivalued) network dynamics and results

The Vehicle Routing Problem with Service Level Constraints

We consider a vehicle routing problem which seeks to minimize cost subject to service level constraints on several groups of deliveries. This problem captures some essential challenges faced by a logistics provider which operates transportation services for a limited number of partners and should respect contractual obligations on service levels. The problem also generalizes several important classes of vehicle routing problems with profits. To solve it, we propose a compact mathematical formulation, a branch-and-price algorithm, and a hybrid genetic algorithm with population management, which relies on problem-tailored solution representation, crossover and local search operators, as well as an adaptive penalization mechanism establishing a good balance between service levels and costs. Our computational experiments show that the proposed heuristic returns very high-quality solutions for this difficult problem, matches all optimal solutions found for small and medium-scale benchmark instances, and improves upon existing algorithms for two important special cases: the vehicle routing problem with private fleet and common carrier, and the capacitated profitable tour problem. The branch-and-price algorithm also produces new optimal solutions for all three problems

Collocation Games and Their Application to Distributed Resource Management

We introduce Collocation Games as the basis of a general framework for modeling, analyzing, and facilitating the interactions between the various stakeholders in distributed systems in general, and in cloud computing environments in particular. Cloud computing enables fixed-capacity (processing, communication, and storage) resources to be offered by infrastructure providers as commodities for sale at a fixed cost in an open marketplace to independent, rational parties (players) interested in setting up their own applications over the Internet. Virtualization technologies enable the partitioning of such fixed-capacity resources so as to allow each player to dynamically acquire appropriate fractions of the resources for unencumbered use. In such a paradigm, the resource management problem reduces to that of partitioning the entire set of applications (players) into subsets, each of which is assigned to fixed-capacity cloud resources. If the infrastructure and the various applications are under a single administrative domain, this partitioning reduces to an optimization problem whose objective is to minimize the overall deployment cost. In a marketplace, in which the infrastructure provider is interested in maximizing its own profit, and in which each player is interested in minimizing its own cost, it should be evident that a global optimization is precisely the wrong framework. Rather, in this paper we use a game-theoretic framework in which the assignment of players to fixed-capacity resources is the outcome of a strategic "Collocation Game". Although we show that determining the existence of an equilibrium for collocation games in general is NP-hard, we present a number of simplified, practically-motivated variants of the collocation game for which we establish convergence to a Nash Equilibrium, and for which we derive convergence and price of anarchy bounds. In addition to these analytical results, we present an experimental evaluation of implementations of some of these variants for cloud infrastructures consisting of a collection of multidimensional resources of homogeneous or heterogeneous capacities. Experimental results using trace-driven simulations and synthetically generated datasets corroborate our analytical results and also illustrate how collocation games offer a feasible distributed resource management alternative for autonomic/self-organizing systems, in which the adoption of a global optimization approach (centralized or distributed) would be neither practical nor justifiable.NSF (CCF-0820138, CSR-0720604, EFRI-0735974, CNS-0524477, CNS-052016, CCR-0635102); Universidad Pontificia Bolivariana; COLCIENCIAS–Instituto Colombiano para el Desarrollo de la Ciencia y la Tecnología "Francisco José de Caldas

Project network models with discounted cash flows. A guided tour through recent developments.

The vast majority of the project scheduling methodologies presented in the literature have been developed with the objective of minimizing the project duration subject to precedence and other constraints. In doing so, the financial aspects of project management are largely ignored. Recent efforts have taken into account discounted cash flow and have focused on the maximalization of the net present value (npv) of the project as the more appropriate objective. In this paper we offer a guided tour through the important recent developments in the expanding field of research on deterministic and stochastic project network models with discounted cash flows. Subsequent to a close examination of the rationale behind the npv objective, we offer a taxonomy of the problems studied in the literature and critically review the major contributions. Proper attention is given to npv maximization models for the unconstrained scheduling problem with known cash flows, optimal and suboptimal scheduling procedures with various types of resource constraints, and the problem of determining both the timing and amount of payments.Scheduling; Models; Model; Discounted cash flow; Cash flow; Project scheduling; Project management; Management; Net present value; Value; Problems; Maximization; Optimal;

Demand side load management using a three step optimization methodology

In order to keep a proper functional electricity grid and to prevent large investments in the current grid, the creation, transmission and consumption of electricity needs to be controlled and organized in a different way as done nowadays. Smart meters, distributed generation and -storage and demand side management are novel technologies introduced to reach a sustainable, more efficient and reliable electricity supply. Although these technologies are very promising to reach these goals, coordination between these technologies is required. It is therefore expected that ICT is going to play an important role in future smart grids. In this paper, we present the results of our three step control strategy designed to optimize the overall energy efficiency and to increase the amount of generation based on renewable resources with the ultimate goal to reduce the CO2 emission resulting from generation electricity. The focus of this work is on the control algorithms used to reshape the energy demand profile of a large group of buildings and their requirements on the smart grid. In a use case, steering a large group of freezers, we are able to reshape a demand profile full of peaks to a nicely smoothed demand profile, taking into the account the amount of available communication bandwidth and exploiting the available computation power distributed in the grid

Special Libraries, July-August 1953

Volume 44, Issue 6https://scholarworks.sjsu.edu/sla_sl_1953/1005/thumbnail.jp

The entropy reduction engine: Integrating planning, scheduling, and control

The Entropy Reduction Engine, an architecture for the integration of planning, scheduling, and control, is described. The architecture is motivated, presented, and analyzed in terms of its different components; namely, problem reduction, temporal projection, and situated control rule execution. Experience with this architecture has motivated the recent integration of learning. The learning methods are described along with their impact on architecture performance

Special Libraries, July-August 1953

Volume 44, Issue 6https://scholarworks.sjsu.edu/sla_sl_1953/1005/thumbnail.jp