Industrial networks of the future:review of research and practice

Academic researchers have followed closely the interest of companies in establishing industrial networks by studying aspects such as social interaction and contractual relationships. But what patterns underlie the emergence of industrial networks and what support should research provide for practitioners? Firstly, it appears that manufacturing is becoming a commodity rather than a unique capability, which accounts especially for low-technology approaches in downstream parts of the network, for example in assembly operations. Secondly, the increased tendency towards specialization has forced other, upstream, parts of industrial networks to introduce advanced manufacturing technologies to supply niche markets. Thirdly, the capital market for investments in capacity, and the trade in manufacturing as a commodity, dominates resource allocation to a larger extent than previously was the case. Fourthly, there is a continuous move towards more loosely connected entities that comprise manufacturing networks. More traditional concepts, such as the “keiretsu” and “chaibol” networks of some Asian economies, do not sufficiently support the demands now being placed on networks. Research should address these four fundamental challenges to prepare for the industrial networks of 2020 and beyond.

Affect networks:a structural analysis of the relationship between work ties and job-related affect

The relationship between organizational networks and employees' affect was examined in 2 organizations. In Study 1, social network analysis of work ties and job-related affect for 259 employees showed that affect converged within work interaction groups. Similarity of affect between employees depended on the presence of work ties and structural equivalence. Affect was also related to the size and density of employees' work networks. Study 2 used a 10-week diary study of 31 employees to examine a merger of 2 organizational divisions and found that negative changes in employees' affect were related to having fewer cross-divisional ties and to experiencing greater reductions in network density. The findings suggest that affect permeates through and is shaped by organizational networks.

Strategic innovation networks

This thesis draws on two key areas of the innovation literature, the strategic management of technology (SMOT) and innovation networks. The aim is to integrate these two areas of the management of innovation literature to develop a framework which I describe as the Strategic Innovation Network (SIN). The key proposition that the revised framework (SIN) aims to address is based on the work of Chandler (1962). Chandler's (1962) conclusion that 'structure follows strategy' is examined in relation to the interaction between corporate/technology strategy and network structure. The SIN is intended to address weaknesses in both the SMOT and network literature. The research data is based on five detailed longitudinal case studies. The organisations are defined as mid-corporate firms operating in traditional manufacturing sectors. Each organisation was chosen on the basis that it was aiming to develop its innovative capacity through product or process innovation projects. The research was carried out over an 18 month period with interviews being held regularly to develop the longitudinal aspect of the study analysis. The data for each individual case study is examined using the SIN framework. The longitudinal approach addresses the objective to provide a dynamic model of the innovation processes by mapping the changes in network structure during the course of individual projects. The network structural changes are examined in relation to each organisation's strategy and five key dynamic network stages are identified in relation to the innovation process. These network stages show the influence strategy has on the structures adopted by the five case studies.

Individual differences in human-computer interaction

This thesis initially presents an 'assay' of the literature pertaining to individual differences in human-computer interaction. A series of experiments is then reported, designed to investigate the association between a variety of individual characteristics and various computer task and interface factors. Predictor variables included age, computer expertise, and psychometric tests of spatial visualisation, spatial memory, logical reasoning, associative memory, and verbal ability. These were studied in relation to a variety of computer-based tacks, including: (1) word processing and its component elements; (ii) the location of target words within passages of text; (iii) the navigation of networks and menus; (iv) command generation using menus and command line interfaces; (v) the search and selection of icons and text labels; (vi) information retrieval. A measure of self-report workload was also included in several of these experiments. The main experimental findings included: (i) an interaction between spatial ability and the manipulation of semantic but not spatial interface content; (ii) verbal ability being only predictive of certain task components of word processing; (iii) age differences in word processing and information retrieval speed but not accuracy; (iv) evidence of compensatory strategies being employed by older subjects; (v) evidence of performance strategy differences which disadvantaged high spatial subjects in conditions of low spatial information content; (vi) interactive effects of associative memory, expertise and command strategy; (vii) an association between logical reasoning and word processing but not information retrieval; (viii) an interaction between expertise and cognitive demand; and (ix) a stronger association between cognitive ability and novice performance than expert performance.

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.

A review of research and practice for the industrial networks of the future

Academic researchers have followed closely the interest of companies in establishing industrial networks by studying aspects such as social interaction and contractual relationships. But what patterns underlie the emergence of industrial networks and what support should research provide for practitioners? First, it appears that manufacturing is becoming a commodity rather than a unique capability, which accounts especially for low-technology approaches in downstream parts of the network, for example, in assembly operations. Second, the increased tendency towards specialisation has forced other, upstream, parts of industrial networks to introduce advanced manufacturing technologies for niche markets. Third, the capital market for investments in capacity, and the trade in manufacturing as a commodity, dominates resource allocation to a larger extent than was previously the case. Fourth, there is becoming a continuous move towards more loosely connected entities that comprise manufacturing networks. Finally, in these networks, concepts for supply chain management should address collaboration and information technology that supports decentralised decision-making, in particular to address sustainable and green supply chains. More traditional concepts, such as the keiretsu and chaibol networks of some Asian economies, do not sufficiently support the demands now being placed on networks. Research should address these five fundamental challenges to prepare for the industrial networks of 2020 and beyond. © 2010 Springer-Verlag London.

Technology transfer through international manufacturing networks:valuing technology from an owner’s perspective

Technology is a key part of organisational knowledge and gives its owners their distinctive capabilities and competitive advantages. However, to best use these assets technology often needs to be transferred and shared with others through a form of technology collaboration. This raises the important question of how technology should be valued when it is being transferred. Technology valuation has become a critical issue in most transfer transactions. Transfer arrangements and terms of payment have a significant effect on the generation and sharing of joint benefits in commercial, technical and strategic aspects. In this paper the concept of “owner's value” is explored by highlighting its structure and components and assessing the importance of factors affecting value. The influence on technology valuation of the transfer arrangement, the associated terms of payment and the interaction between the shared benefits, cost and risks are discussed.

Industrial networks of the future:a critical commentary on research and practice

Academia has followed the interest by companies in establishing industrial networks by studying aspects such as social interaction and contractual relationships. But what patterns underlie the emergence of industrial networks and what support should research provide for practitioners? Firstly, it seems that manufacturing is becoming a commodity rather than a unique capability, which accounts especially for low-technology approaches in downstream parts of the network, for example in assembly operations. Secondly, the increased tendency to specialize forces other parts of industrial networks to introduce advanced manufacturing technologies for niche markets. Thirdly, the capital market for investments in capacity and the trade in manufacturing as a commodity dominates resource allocation to a larger extent. Fourthly, there will be a continuous move toward more loosely connected entities forming manufacturing networks. More traditional concepts, like keiretsu and chaibol networks, do not sufficiently support this transition. Research should address these fundamental challenges to prepare for the industrial networks of 2020 and beyond.

Adaptive resource allocation for QoE-aware mobile communication networks

A real-time adaptive resource allocation algorithm considering the end user's Quality of Experience (QoE) in the context of video streaming service is presented in this work. An objective no-reference quality metric, namely Pause Intensity (PI), is used to control the priority of resource allocation to users during the scheduling process. An online adjustment has been introduced to adaptively set the scheduler's parameter and maintain a desired trade-off between fairness and efficiency. The correlation between the data rates (i.e. video code rates) demanded by users and the data rates allocated by the scheduler is taken into account as well. The final allocated rates are determined based on the channel status, the distribution of PI values among users, and the scheduling policy adopted. Furthermore, since the user's capability varies as the environment conditions change, the rate adaptation mechanism for video streaming is considered and its interaction with the scheduling process under the same PI metric is studied. The feasibility of implementing this algorithm is examined and the result is compared with the most commonly existing scheduling methods.

Data Mining for Browsing Patterns in Weblog Data by Art Neural Networks

Categorising visitors based on their interaction with a website is a key problem in Web content usage. The clickstreams generated by various users often follow distinct patterns, the knowledge of which may help in providing customised content. This paper proposes an approach to clustering weblog data, based on ART2 neural networks. Due to the characteristics of the ART2 neural network model, the proposed approach can be used for unsupervised and self-learning data mining, which makes it adaptable to dynamically changing websites.

Modeling security and cooperation in wireless networks using game theory

This research involves the design, development, and theoretical demonstration of models resulting in integrated misbehavior resolution protocols for ad hoc networked devices. Game theory was used to analyze strategic interaction among independent devices with conflicting interests. Packet forwarding at the routing layer of autonomous ad hoc networks was investigated. Unlike existing reputation based or payment schemes, this model is based on repeated interactions. To enforce cooperation, a community enforcement mechanism was used, whereby selfish nodes that drop packets were punished not only by the victim, but also by all nodes in the network. Then, a stochastic packet forwarding game strategy was introduced. Our solution relaxed the uniform traffic demand that was pervasive in other works. To address the concerns of imperfect private monitoring in resource aware ad hoc networks, a belief-free equilibrium scheme was developed that reduces the impact of noise in cooperation. This scheme also eliminated the need to infer the private history of other nodes. Moreover, it simplified the computation of an optimal strategy. The belief-free approach reduced the node overhead and was easily tractable. Hence it made the system operation feasible. Motivated by the versatile nature of evolutionary game theory, the assumption of a rational node is relaxed, leading to the development of a framework for mitigating routing selfishness and misbehavior in Multi hop networks. This is accomplished by setting nodes to play a fixed strategy rather than independently choosing a rational strategy. A range of simulations was carried out that showed improved cooperation between selfish nodes when compared to older results. Cooperation among ad hoc nodes can also protect a network from malicious attacks. In the absence of a central trusted entity, many security mechanisms and privacy protections require cooperation among ad hoc nodes to protect a network from malicious attacks. Therefore, using game theory and evolutionary game theory, a mathematical framework has been developed that explores trust mechanisms to achieve security in the network. This framework is one of the first steps towards the synthesis of an integrated solution that demonstrates that security solely depends on the initial trust level that nodes have for each other.^

Towards simulation and emulation of large-scale computer networks

Developing analytical models that can accurately describe behaviors of Internet-scale networks is difficult. This is due, in part, to the heterogeneous structure, immense size and rapidly changing properties of today's networks. The lack of analytical models makes large-scale network simulation an indispensable tool for studying immense networks. However, large-scale network simulation has not been commonly used to study networks of Internet-scale. This can be attributed to three factors: 1) current large-scale network simulators are geared towards simulation research and not network research, 2) the memory required to execute an Internet-scale model is exorbitant, and 3) large-scale network models are difficult to validate. This dissertation tackles each of these problems. ^ First, this work presents a method for automatically enabling real-time interaction, monitoring, and control of large-scale network models. Network researchers need tools that allow them to focus on creating realistic models and conducting experiments. However, this should not increase the complexity of developing a large-scale network simulator. This work presents a systematic approach to separating the concerns of running large-scale network models on parallel computers and the user facing concerns of configuring and interacting with large-scale network models. ^ Second, this work deals with reducing memory consumption of network models. As network models become larger, so does the amount of memory needed to simulate them. This work presents a comprehensive approach to exploiting structural duplications in network models to dramatically reduce the memory required to execute large-scale network experiments. ^ Lastly, this work addresses the issue of validating large-scale simulations by integrating real protocols and applications into the simulation. With an emulation extension, a network simulator operating in real-time can run together with real-world distributed applications and services. As such, real-time network simulation not only alleviates the burden of developing separate models for applications in simulation, but as real systems are included in the network model, it also increases the confidence level of network simulation. This work presents a scalable and flexible framework to integrate real-world applications with real-time simulation.^