Ming-Chien Yang

Fault-tolerant cycle-emebedding of crossed cubes

The crossed cube CQn introduced by Efe has many properties similar to those of the popular hypercube. However, the diameter of CQn is about one half of that of the hypercube. Failures of links and nodes in an interconnection network are inevitable. Hence, in this paper, we consider the hybrid fault-tolerant capability of the crossed cube. Letting fe and fv be the numbers of faulty edges and vertices in CQn, we show that a cycle of length l, for any 4 ≤ l ≤ |V(CQn)| - fv, can be embedded into a wounded crossed cube as long as the total number of faults (fv + fv) is no more than n - 2, and we say that CQn is (n - 2)-fault-tolerant pancyclic. This result is optimal in the sense that if there are n - 1 faults, there is no guarantee of having a cycle of a certain length in it.

Hamiltonian circuit and linear array embeddings in faulty k-ary n-cubes

In this paper, we investigate the fault-tolerant capabilities of the k-ary n-cubes for even integer k with respect to the hamiltonian and hamiltonian-connected properties. The k-ary n-cube is a bipartite graph if and only if k is an even integer. Let F be a faulty set with nodes and/or links, and let k>=3 be an odd integer. When |F|=<2n-2, we show that there exists a hamiltonian cycle in a wounded k-ary n-cube. In addition, when |F|=<2n-3, we prove that, for two arbitrary nodes, there exists a hamiltonian path connecting these two nodes in a wounded k-ary n-cube. Since the k-ary n-cube is regular of degree 2n, the degrees of fault-tolerance 2n-3 and 2n-2 respectively, are optimal in the worst case.

RIHT: A Novel Hybrid IP Traceback Scheme

Because the Internet has been widely applied in various fields, more and more network security issues emerge and catch peoples attention. However, adversaries often hide themselves by spoofing their own IP addresses and then launch attacks. For this reason, researchers have proposed a lot of traceback schemes to trace the source of these attacks. Some use only one packet in their packet logging schemes to achieve IP tracking. Others combine packet marking with packet logging and therefore create hybrid IP traceback schemes demanding less storage but requiring a longer search. In this paper, we propose a new hybrid IP traceback scheme with efficient packet logging aiming to have a fixed storage requirement for each router (under 320 KB, according to CAIDAs skitter data set) in packet logging without the need to refresh the logged tracking information and to achieve zero false positive and false negative rates in attack-path reconstruction. In addition, we use a packets marking field to censor attack traffic on its upstream routers. Lastly, we simulate and analyze our scheme, in comparison with other related research, in the following aspects: storage requirement, computation, and accuracy.

Path embedding in star graphs

Abstract The star graph interconnection network has been introduced as an attractive alternative to the hypercube network. In this paper, we consider the path embedding problem in star graphs. Assume that n ⩾ 4 . We prove that paths of all even lengths from d ( x , y ) to n ! - 2 can be embedded between two arbitrary vertices x and y from the same partite set in the n-dimensional star graph. In addition, paths of all odd lengths from d ( x , y ) to n ! - 1 can be embedded between two arbitrary vertices x and y from different partite sets in the n-dimensional star graph except that if x and y are adjacent, there is no path of length 3 between them. The result is optimal in the sense that paths of all possible lengths are found in star graphs.

Conditional diagnosability of balanced hypercubes under the PMC model

Diagnosability is a critical metric for determining the reliability of a multiprocessor system. In 2005, a new measure for fault diagnosis of a system, namely conditional diagnosability, was proposed to improve the number of faulty processors identified. In this paper, we study the conditional diagnosability of balanced hypercubes under the PMC model and show that the conditional diagnosability of the n-dimensional balanced hypercube is 4n-3 for n>=1.

Super connectivity of balanced hypercubes

Abstract The reliability of an interconnection network is an important issue for multiprocessor systems. In this paper, we study a reliability measure, called super connectivity, in the balanced hypercube BH n , which is a variant of the hypercube. We show that the super connectivity of BH n is 4 n - 4 and the super edge-connectivity of BH n is 4 n - 2 for n ⩾ 2 . That is, to become a disconnected graph containing no isolated vertex, we need to remove at least 4 n - 4 vertices (resp. 4 n - 2 edges) from BH n .

Conditional diagnosability of matching composition networks under the MM* model

Diagnosability is a critical metric for determining the reliability of a multiprocessor system. In 2005, Lai et al. proposed a new measure for the fault diagnosis of a system, i.e., conditional diagnosability, in which it is assumed that at least one of the neighbors of an arbitrary node in the system is not faulty. In this paper, we obtain a sufficient condition for a class of networks, called Matching Composition Networks (MCNs), which are conditionally t-diagnosable under the MM^* model. Then, we apply the sufficient condition to show the conditional diagnosability of bijective connection (BC) networks. Finally, we show that the sufficient condition can be applied to networks other than BC networks.

Collaboration of Set-Top Box and Residential Gateway Platforms

This paper introduces a means of enabling the collaboration of set-top box and residential gateway platforms. We propose an approach that can let MHP Xlets use OSGi resources and vice versa, i.e., OSGi bundles use MHP services in a simple and efficient way. In our approach, BundleContexts and XletContexts are passed to authorized Xlets and bundles, respectively. The required software components have been implemented, and an experiment has been conducted, which has verified that our proposal is practical.

Cycle embedding in star graphs with conditional edge faults

Among the various interconnection networks, the star graph has been an attractive one. In this paper, we consider the cycle embedding problem in star graphs with conditional edge faults. We show that there exist cycles of all even lengths from 6 to n! in an n-dimensional star graph with = =4.

High accuracy and low storage hybrid IP traceback

Since adversaries may spoof their source IPs in their attacks, traceback schemes have been proposed to identify the attack source. Among these methods, Hybrid IP traceback schemes fuse packet marking and packet logging, using only one packet for traceback and reducing the storage requirements during packet logging. However, if a hybrid traceback scheme logs a packets digests on a router, the routers storage requirements will increase with the packet numbers. Its storage requirements cannot be bounded. Thus, we propose a 16-bit single packet hybrid IP traceback scheme. In our logging, the storage requirements can be bounded by the number of routes. And our marking can guarantee that fragmented packets can be re-assembled at the destination. Thus, compared with existing hybrid traceback schemes, our proposed scheme has higher accuracy in source tracking and has lower storage requirements for the routers.