The n-dimensional hypercube network Qn is one of the most popular interconnection networks since it has simple structure and is easy to implement. The n-dimensional augmented cube, denoted by AQn, an important variation of the hypercube, possesses several embedding properties that hypercubes and other variations do not possess. The advantages of AQn are that the diameter is only about half of t...

Let G be a finite directed graph with X, Y disjoint subsets of the nodes of G. Menger's theorem [6] asserts that the maximum cardinal number of a set 0 of pairwise node disjoint paths from X to Y equals the minimum cardinal number of a set which separates X from Y. A special case of Menger's theorem occurs when all the edges of G have initial node in X and terminal node in Y (the bipartite situ...

In this paper a sufficient condition is given for minimal routing in n-dimensional (n-D) meshes with faulty nodes contained in a set of disjoint fault regions. It is based on an early work of the author on minimal routing in low dimension meshes (such as 2-D meshes with faulty blocks). Unlike many traditional models that assume all the nodes know global fault distribution, our approach is based...

A hole in a graph is chordless cycle of length at least 4. theta formed by three internally vertex-disjoint paths 2 between the same pair distinct vertices. wheel and node that has 3 neighbors hole. In this series papers we study class graphs do not contain as an induced subgraph nor wheel. Part II prove decomposition theorem for class, uses clique cutsets 2-joins. paper use to solve several pr...

In this paper a sufficient condition is given for minimal routing in n-dimensional (n-D) meshes with faulty nodes contained in a set of disjoint fault regions. It is based on an early work of the author on minimal routing in low-dimensional meshes (such as 2-D meshes with faulty blocks). Unlike many traditional models that assume all the nodes know global fault distribution, our approach is bas...

For many users, the perceived speed of computing is increasingly dependent on the performance of network server systems, underscoring the need for high performance servers. Cost-effective scalable network servers can be built on clusters of commodity components (PCs and LANs) instead of using expensive multiprocessor systems. However, network servers cache files to reduce disk access, and the c...

Imposing the constraint of timely delivery on usual messages is referred as time-constrained messages. The utility of such messages depends upon the time at which they arrive at their destination. Due to contention among randomly arriving messages at each node/link and multi-hops between the source and destination that a message must travel, it is difficult to guarantee the timely delivery of s...

In this paper, we address the problem of video multicast over Ad hoc wireless networks. Multicasting is an efficient means of one-to-many communication and is typically implemented by creating a multicast tree. Video multicasting demands high quality of service with a continuous delivery to receivers. However, most of the existing multicast solutions do not guarantee this because they are not r...