In this paper, we propose a max-flow-min-cost (MFMC) problem to obtain the upper bound of network capacity and develop an efficient packet routing strategy. The MFMC problem is formulated as two linear programs (LP). The optimal solutions of the two LPs are the upper bound of network capacity...

In this letter the synchronization of complex dynamical networks with fractional order chaotic nodes is studied. A fractional order controller for synchronization of complex network is presented. Some new sufficient synchronization criteria are proposed based on the Lyapunov stability theory and...

Studying the function call graphs in complex software can provide significant insights into the software evolution process. We found node in- and out-degree distributions asymmetric in the call graphs of 223 versions of Linux kernel modules (V1.1.0 to V2.4.35). Nodes newly introduced in these...