Understanding supply chain network are important for modeling the spread of risks in enterprise nodes. This study characterizes the supply chain risk network of the spread of several nodes. To identify the rule of the movement of risk nodes, several parameters describing these properties are measured (degree, risk, the number of risk nodes, average risk, average path length and average clusteri...

The use of multiple independent spanning trees (ISTs) for data broadcasting in networks provides a number of advantages, including the increase of fault-tolerance and bandwidth. Thus, the designs of multiple ISTs on several classes of networks have been widely investigated. Tang et al. [S.-M. Tang, Y.-L. Wang, Y.-H. Leu, Optimal independent spanning trees on hypercubes, Journal of Information S...

The algorithm proposed by Chang and Iyengar' to perfectly balance binary search trees has been modified to not only balance but also thread binary search trees. Threads are constructed in the same sequence as normal pointers during the balancing process. No extra workspace is necessary, and the running time is also linear for the modified algorithm. Such produced tree structure has minimal aver...

We investigate the redundancy that arises from adding a worst case length constraint to uniquely decodable fixed-to-variable codes over achievable Huffman codes. This is in contrast to the traditional metric of the redundancy over the entropy. We show that the cost for adding constraints on the worst case coding length is small, and that the resulting bound is related to the Fibonacci numbers.

In this paper, we propose an approach to analyze the resilience of structured peer-to-peer (P2P) systems under failures. The approach is Markov-chain based, and can be applied to systems with relatively stable size and uniform distribution of nodes. We apply our approach to several well-known structured P2P systems. We find that different system features (types of neighbors of nodes) in P2P sys...

Recently, monitoring quality of a process or product that is characterized by a function or profile is becoming more popular. Many applications are shown for profile monitoring. Most existing control schemes, which have been suggested for profile monitoring in the literatures, consider the independence assumption of observation within profiles. However, in certain situation, this assumption can...

— The increased usage of directional methods of communications to improve medium reuse, network capacity, and bandwidth has prompted research into leveraging directionality in every layer of the network stack. Recently, there has been work on bringing the apparent capacity gains on layer 2 using directional communications methods to layer 3 by using directionality to route packets scalably in u...

We study Small–World graphs in the perspective of their use in the development of efficient as well as easy to implement network infrastructures. Our analysis starts from the Small–World model proposed by Kleinberg: a grid network augmented with directed long–range random links. The choices of the long–range links are independent from one node to another. In this setting greedy routing and some...

The open source software (OSS) development communities have experienced rapid growth in recent years. Previous social network studies on OSS communities focused on collaboration relationships. However, information about how OSS community members perceive each other is largely ignored. In this study, we report an empirical investigation of the evaluation network in an online OSS community which ...

An optimal message routing algorithm for thc cube-connected cycles processor interconnection network is described, and the average:message path length is derived assuming a uniform message routing distribution. The optimal algorithm is comparetl to one preViously proposed and is shown to have significanlly shorter average path length.