DARPA ULTRALOG Final Report - Industrial and Manufacturing ...
DARPA ULTRALOG Final Report - Industrial and Manufacturing ...
DARPA ULTRALOG Final Report - Industrial and Manufacturing ...
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
synchronizability of a scale-free dynamical network is robust against r<strong>and</strong>om removal of nodes,<br />
but is fragile to specific removal of the most highly connected nodes.<br />
The scale free property <strong>and</strong> high degree of clustering (the small world effect) however are not<br />
exclusive for a large number of real networks. Yet most models proposed to describe the topology<br />
of complex networks have the difficulty capturing simultaneously these two features. It has been<br />
shown in (Ravasz <strong>and</strong> Barabasi, 2003) that these two features are the consequence of a<br />
hierarchical organization present in the networks. This argument also agrees with that proposed<br />
by Herbert Simon (Simon 1997) who argues: “we could expect complex systems to be hierarchies<br />
in a world in which complexity has to evolve from simplicity. In their dynamics, hierarchies have<br />
a property, near decomposability, that greatly simplifies their behavior. Near decomposability<br />
also simplifies the description of complex systems <strong>and</strong> makes it easier to underst<strong>and</strong> how the<br />
information needed for the development of the system can be stored in reasonable compass”.<br />
Indeed many networks are fundamentally modular: one can easily identify groups of nodes that<br />
are highly interconnected with each other, but have only a few or no links to nodes outside of the<br />
group to which they belong. This clearly identifiable modular organization is at the origin of high<br />
degree of clustering coefficient. On the other h<strong>and</strong> these modules can be organized in a<br />
hierarchical fashion into increasingly large groups, giving rise to “hierarchical networks”, while<br />
still maintaining the scale-free topology. Thus modularity, scale-free character <strong>and</strong> high degree of<br />
clustering can be achieved under a common roof. Moreover, in hierarchical networks the degree<br />
of clustering characterizing the different groups follows a strict scaling law, which can be used to<br />
identify the presence of hierarchical structure in real networks.<br />
The mathematical theory of graphs with arbitrary degree distributions known as “generalized<br />
r<strong>and</strong>om graphs” can be found in (Newman et al. 2001) <strong>and</strong> (Newman 2003). Using the<br />
“generating function formulation”, the authors have been able to solve the percolation problem<br />
(i.e. have found conditions for predicting the appearance of a giant component), have obtained<br />
formulae for calculating clustering coefficient <strong>and</strong> average path length for generalized r<strong>and</strong>om<br />
graphs. The authors have proposed <strong>and</strong> studied models of propagation of diseases, failures, fads<br />
<strong>and</strong> synchronization on such graphs <strong>and</strong> have extended their results for bipartite <strong>and</strong> directed<br />
graphs.<br />
Network dynamics though in its infancy promises a formal framework to characterize the<br />
organizational <strong>and</strong> functional aspects in supply chains. With the changing trends in supply chains,<br />
many new issues have become critical like: organizational resistance to change, inter-functional<br />
or inter-organizational conflicts, relationship management, <strong>and</strong> consumer <strong>and</strong> market behavior.<br />
Such problems are ill structured <strong>and</strong> behavioral <strong>and</strong> cannot be commonly addressed by analytical<br />
tools such as mathematical programming. Successful supply chain integration depends on the<br />
supply chain partners’ ability to synchronize <strong>and</strong> share real-time information. The establishment<br />
of collaborative relationship among supply chain partners is a pre-requisite to information<br />
sharing. As a result successful supply chain management relies on systematically studying<br />
questions like 1) what are the robust architectures for collaboration <strong>and</strong> what are the coordination<br />
strategies that lead to such architectures, 2) if different entities make decisions on whether or not<br />
to cooperate on the basis of imperfect information about the group activity, <strong>and</strong> incorporate<br />
expectations on how their decision will affect other entities, can overall cooperation be sustained<br />
for long periods of time 3) how do the expectations, group size, <strong>and</strong> diversity affect coordination<br />
<strong>and</strong> cooperation <strong>and</strong> 4) which kinds of organizations are most able to sustain ongoing collective<br />
action, <strong>and</strong> how might such organizations evolve over time. Network dynamics addresses many<br />
of such questions <strong>and</strong> should be explored in context of supply chains.<br />
8. Conclusions <strong>and</strong> Future Work<br />
The idea of managing the whole supply chain <strong>and</strong> transform them into a highly autonomous,<br />
dynamic, agile, adaptive <strong>and</strong> reconfigurable network certainly provides an appealing vision for<br />
managers. The infrastructure provided by Information technology has made this vision partially