Forward-looking Pairwise Stability in Networks with Externalities

We consider cooperation situations where players have network relations. Networks evolve according to a stationary transition probability matrix and at each moment in time players receive payoffs from a stationary allocation rule. Players discount the future by a common factor. The pair formed by an allocation rule and a transition probability matrix is called a forward-looking network formation scheme if, first, the probability that a link is created is positive if the discounted, expected gains to its two participants are positive, and if, second, the probability that a link is eliminated is positive if the discounted, expected gains to at least one of its two participants are positive. The main result is the existence, for all discount factors and all value functions, of a forward-looking network formation scheme. Furthermore, we can always nd a forward-looking network formation scheme such that (i) the allocation rule is component balanced and (ii) the transition probabilities increase in the di erence in payo s for the corresponding players responsible for the transition. We use this dynamic solution concept to explore the tension between e ciency and stability.

Managing global network operations along the engineering value chain

Purpose: This paper aims to improve understanding of how to manage global network operations from an engineering perspective. Design/methodology/approach: This research adopted a theory building approach based on case studies. Grounded in the existing literature, the theoretical framework was refined and enriched through nine in-depth case studies in the industry sectors of aerospace, automotives, defence and electrics and electronics. Findings: This paper demonstrates the main value creation mechanisms of global network operations along the engineering value chain. Typical organisational features to support the value creation mechanisms are captured, and the key issues in engineering network design and operations are presented with an overall framework. Practical implications: Evidenced by a series of pilot applications, outputs of this research can help companies to improve the performance of their current engineering networks and design new engineering networks to better support their global businesses and customers in a systematic way. Originality/value: Issues about the design and operations of global engineering networks (GEN) are poorly understood in the existing literature in contrast to their apparent importance in value creation and realisation. To address this knowledge gap, this paper introduces the concept of engineering value chain to highlight the potential of a value chain approach to the exploration of engineering activities in a complex business context. At the same time, it develops an overall framework for managing GEN along the engineering value chain. This improves our understanding of engineering in industrial value chains and extends the theoretical understanding of GEN through integrating the engineering network theories and the value chain concepts. © Emerald Group Publishing Limited.

Using mesoscopic models to design strong and tough biomimetic polymer networks

Using computational modeling, we investigate the mechanical properties of polymeric materials composed of coiled chains, or "globules", which encompass a folded secondary structure and are cross-linked by labile bonds to form a macroscopic network. In the presence of an applied force, the globules can unfold into linear chains and thereby dissipate energy as the network is deformed; the latter attribute can contribute to the toughness of the material. Our goal is to determine how to tailor the labile intra- and intermolecular bonds within the network to produce material exhibiting both toughness and strength. Herein, we use the lattice spring model (LSM) to simulate the globules and the cross-linked network. We also utilize our modified Hierarchical Bell model (MHBM) to simulate the rupture and reforming of N parallel bonds. By applying a tensile deformation, we demonstrate that the mechanical properties of the system are sensitive to the values of N in and N out, the respective values of N for the intra- and intermolecular bonds. We find that the strength of the material is mainly controlled by the value of N out, with the higher value of N out providing a stronger material. We also find that, if N in is smaller than N out, the globules can unfold under the tensile load before the sample fractures and, in this manner, can increase the ductility of the sample. Our results provide effective strategies for exploiting relatively weak, labile interactions (e.g., hydrogen bonding or the thiol/disulfide exchange reaction) in both the intra- and intermolecular bonds to tailor the macroscopic performance of the materials. © 2011 American Chemical Society.

Dialogical strategies for orchestrating strategic innovation networks: the case of the Internet of Things

Strategic innovation has been shown to provide significant value for organisations whilst at the same time challenging traditional ways of thinking and working. There is less known, however, as to how organisations collaborate in innovation networks to achieve strategic innovation. In this paper we explore how innovation networks are orchestrated in developing a strategic innovation initiative around the Internet of Things. We show how a hub actor brings together a diverse group of actors to initially create and subsequently orchestrate the strategic innovation network through the employ of three dialogical strategies, namely persuasive projection, reflective development, and definitional control. Further, we illuminate how different types of legitimacy are established through these various dialogical strategies in orchestrating strategic innovation networks.

Persistent Nodes for Reliable Memory in Geographically Local Networks

A Persistent Node is a redundant distributed mechanism for storing a key/value pair reliably in a geographically local network. In this paper, I develop a method of establishing Persistent Nodes in an amorphous matrix. I address issues of construction, usage, atomicity guarantees and reliability in the face of stopping failures. Applications include routing, congestion control, and data storage in gigascale networks.

Action research in developing knowledge networks

Seeley, H. & Urqhart, C. (2007). Action research in developing knowledge networks. In P. Bath, K. Albright & T. Norris (Eds.), Proceedings of ISHIMR 2007, The twelfth international symposium on health information management research (pp. 217-235.) Sheffield: Centre for Health Information Management Research, University of Sheffield.

Networks in small manufacturing firms

Fuller-Love, Nerys, and Thomas, Esyllt, 'Networks in small manufacturing firms', Journal of Small Business and Enterprise Development (2005) 11(2) pp.244-253 RAE2008

Analysis and optimisation of semiconductor reflective modulators for optical networks

Reflective modulators based on the combination of an electroabsorption modulator (EAM) and semiconductor optical amplifier (SOA) are attractive devices for applications in long reach carrier distributed passive optical networks (PONs) due to the gain provided by the SOA and the high speed and low chirp modulation of the EAM. Integrated R-EAM-SOAs have experimentally shown two unexpected and unintuitive characteristics which are not observed in a single pass transmission SOA: the clamping of the output power of the device around a maximum value and low patterning distortion despite the SOA being in a regime of gain saturation. In this thesis a detailed analysis is carried out using both experimental measurements and modelling in order to understand these phenomena. For the first time it is shown that both the internal loss between SOA and R-EAM and the SOA gain play an integral role in the behaviour of gain saturated R-EAM-SOAs. Internal loss and SOA gain are also optimised for use in a carrier distributed PONs in order to access both the positive effect of output power clamping, and hence upstream dynamic range reduction, combined with low patterning operation of the SOA Reflective concepts are also gaining interest for metro transport networks and short reach, high bit rate, inter-datacentre links. Moving the optical carrier generation away from the transmitter also has potential advantages for these applications as it avoids the need for cooled photonics being placed directly on hot router line-cards. A detailed analysis is carried out in this thesis on a novel colourless reflective duobinary modulator, which would enable wavelength flexibility in a power-efficient reflective metro node.

Design Optimization and Security For Communication Networks

In this work we introduce a new mathematical tool for optimization of routes, topology design, and energy efficiency in wireless sensor networks. We introduce a vector field formulation that models communication in the network, and routing is performed in the direction of this vector field at every location of the network. The magnitude of the vector field at every location represents the density of amount of data that is being transited through that location. We define the total communication cost in the network as the integral of a quadratic form of the vector field over the network area. With the above formulation, we introduce a mathematical machinery based on partial differential equations very similar to the Maxwell's equations in electrostatic theory. We show that in order to minimize the cost, the routes should be found based on the solution of these partial differential equations. In our formulation, the sensors are sources of information, and they are similar to the positive charges in electrostatics, the destinations are sinks of information and they are similar to negative charges, and the network is similar to a non-homogeneous dielectric media with variable dielectric constant (or permittivity coefficient). In one of the applications of our mathematical model based on the vector fields, we offer a scheme for energy efficient routing. Our routing scheme is based on changing the permittivity coefficient to a higher value in the places of the network where nodes have high residual energy, and setting it to a low value in the places of the network where the nodes do not have much energy left. Our simulations show that our method gives a significant increase in the network life compared to the shortest path and weighted shortest path schemes. Our initial focus is on the case where there is only one destination in the network, and later we extend our approach to the case where there are multiple destinations in the network. In the case of having multiple destinations, we need to partition the network into several areas known as regions of attraction of the destinations. Each destination is responsible for collecting all messages being generated in its region of attraction. The complexity of the optimization problem in this case is how to define regions of attraction for the destinations and how much communication load to assign to each destination to optimize the performance of the network. We use our vector field model to solve the optimization problem for this case. We define a vector field, which is conservative, and hence it can be written as the gradient of a scalar field (also known as a potential field). Then we show that in the optimal assignment of the communication load of the network to the destinations, the value of that potential field should be equal at the locations of all the destinations. Another application of our vector field model is to find the optimal locations of the destinations in the network. We show that the vector field gives the gradient of the cost function with respect to the locations of the destinations. Based on this fact, we suggest an algorithm to be applied during the design phase of a network to relocate the destinations for reducing the communication cost function. The performance of our proposed schemes is confirmed by several examples and simulation experiments. In another part of this work we focus on the notions of responsiveness and conformance of TCP traffic in communication networks. We introduce the notion of responsiveness for TCP aggregates and define it as the degree to which a TCP aggregate reduces its sending rate to the network as a response to packet drops. We define metrics that describe the responsiveness of TCP aggregates, and suggest two methods for determining the values of these quantities. The first method is based on a test in which we drop a few packets from the aggregate intentionally and measure the resulting rate decrease of that aggregate. This kind of test is not robust to multiple simultaneous tests performed at different routers. We make the test robust to multiple simultaneous tests by using ideas from the CDMA approach to multiple access channels in communication theory. Based on this approach, we introduce tests of responsiveness for aggregates, and call it CDMA based Aggregate Perturbation Method (CAPM). We use CAPM to perform congestion control. A distinguishing feature of our congestion control scheme is that it maintains a degree of fairness among different aggregates. In the next step we modify CAPM to offer methods for estimating the proportion of an aggregate of TCP traffic that does not conform to protocol specifications, and hence may belong to a DDoS attack. Our methods work by intentionally perturbing the aggregate by dropping a very small number of packets from it and observing the response of the aggregate. We offer two methods for conformance testing. In the first method, we apply the perturbation tests to SYN packets being sent at the start of the TCP 3-way handshake, and we use the fact that the rate of ACK packets being exchanged in the handshake should follow the rate of perturbations. In the second method, we apply the perturbation tests to the TCP data packets and use the fact that the rate of retransmitted data packets should follow the rate of perturbations. In both methods, we use signature based perturbations, which means packet drops are performed with a rate given by a function of time. We use analogy of our problem with multiple access communication to find signatures. Specifically, we assign orthogonal CDMA based signatures to different routers in a distributed implementation of our methods. As a result of orthogonality, the performance does not degrade because of cross interference made by simultaneously testing routers. We have shown efficacy of our methods through mathematical analysis and extensive simulation experiments.

Economic and social upgrading in global production networks: A new paradigm for a changing world

A key challenge in promoting decent work worldwide is how to improve the position of both firms and workers in value chains and global production networks driven by lead firms. This article develops a framework for analysing the linkages between the economic upgrading of firms and the social upgrading of workers. Drawing on studies which indicate that firm upgrading does not necessarily lead to improvements for workers, with a particular focus on the Moroccan garment industry, it outlines different trajectories and scenarios to provide a better understanding of the relationship between economic and social upgrading. The authors 2011 Journal compilation © International Labour Organization 2011.

NAFTA and the apparel commodity chain: Corporate strategies, interfirm networks, and industrial upgrading

The apparel industry is one of the oldest and largest export industries in the world, with global trade and production networks that connect firms and workers in countries at all levels of economic development. This chapter examines the impact of the North American Free Trade Agreement (NAFTA) as one of the most recent and significant developments to affect patterns of international trade and production in the apparel and textile industries. Tr ade policies are changing the institutional environment in which firms in this industry operate, and companies are responding to these changes with new strategies designed to increase their profitability and strengthen their control over the apparel commodity chain. Our hypothesis is that lead firms are establishing qualitatively different kinds of regional production networks in North America from those that existed prior to NAFTA, and that these networks have important consequences for industrial upgrading in the Mexican textile and apparel industries. Post-NAFTA crossborder production arrangements include full-package networks that link lead firms in the United States with apparel and textile manufacturers, contractors, and suppliers in Mexico. Full-package production is increasing the local value added provided by the apparel commodity chain in Mexico and creating new opportunities for Mexican firms and workers. The chapter is divided into four main sections. The first section uses trade and production data to analyze shifts in global apparel flows, highlighting the emergence and consolidation of a regional trade bloc in North America. The second section discusses the process of industrial upgrading in the apparel industry and introduces a distinction between assembly and full-package production networks. The third section includes case studies based on published industry sources and strategic interviews with several lead companies whose strategies are largely responsible for the shifting trade patterns and NAFTA-inspired cross-border production networks discussed in the previous section. The fourth section considers the implications of these changes for employment in the North American apparel industry. © 2009 by Temple University Press. All rights reserved.

Call admission control algorithms in OFDM-based wireless multiservice networks

Orthogonal frequency division multiplexing(OFDM) is becoming a fundamental technology in future generation wireless communications. Call admission control is an effective mechanism to guarantee resilient, efficient, and quality-of-service (QoS) services in wireless mobile networks. In this paper, we present several call admission control algorithms for OFDM-based wireless multiservice networks. Call connection requests are differentiated into narrow-band calls and wide-band calls. For either class of calls, the traffic process is characterized as batch arrival since each call may request multiple subcarriers to satisfy its QoS requirement. The batch size is a random variable following a probability mass function (PMF) with realistically maximum value. In addition, the service times for wide-band and narrow-band calls are different. Following this, we perform a tele-traffic queueing analysis for OFDM-based wireless multiservice networks. The formulae for the significant performance metrics call blocking probability and bandwidth utilization are developed. Numerical investigations are presented to demonstrate the interaction between key parameters and performance metrics. The performance tradeoff among different call admission control algorithms is discussed. Moreover, the analytical model has been validated by simulation. The methodology as well as the result provides an efficient tool for planning next-generation OFDM-based broadband wireless access systems.

On velocity-based local model networks for nonlinear identification

This paper exposes the strengths and weaknesses of the recently proposed velocity-based local model (LM) network. The global dynamics of the velocity-based blended representation are directly related to the dynamics of the underlying local models, an important property in the design of local controller networks. Furthermore, the sub-models are continuous-time and linear providing continuity with established linear theory and methods. This is not true for the conventional LM framework, where the global dynamics are only weakly related to the affine sub-models. In this paper, a velocity-based multiple model network is identified for a highly nonlinear dynamical system. The results show excellent dynamical modelling performances, highlighting the value of the velocity-based approach for the design and analysis of LM based control. Three important practical issues are also addressed. These relate to the blending of the velocity-based local models, the use of normalised Gaussian basis functions and the requirement of an input derivative.