Conditional Diagnosability of $(n,k)$ -Star Graphs Under the PMC Model

Chang, Nai-Wen; Hsieh, Sun Yuan

doi:10.1109/tdsc.2016.2562620

Cited by 44 publications

(3 citation statements)

References 59 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If a network device sends broadcast packets, it will obviously consume a lot of bandwidth. If the broadcast is regarded as multicast only to the node requesting the message or to set broadcast suppression for the broadcast message, that is, the broadcast traffic of the node reaches a threshold, the broadcast message will be discarded, and these measures have yet to be verified in the application 20 Device virtualization is also common in DCN.…”

Section: Preliminarymentioning

confidence: 99%

“…If the broadcast is regarded as multicast only to the node requesting the message or to set broadcast suppression for the broadcast message, that is, the broadcast traffic of the node reaches a threshold, the broadcast message will be discarded, and these measures have yet to be verified in the application. 20 3 Device virtualization is also common in DCN. For example, in a DCN, a common network device is virtualized to lease multiple virtual devices to users.…”

Section: Problems In Dcnmentioning

confidence: 99%

See 1 more Smart Citation

Topology analysis and routing algorithms design for PTNet network

Han

Zhang

et al. 2020

Concurrency and Computation

View full text Add to dashboard Cite

Summary Data center network (DCN) is used for transmission, storage, and processing of big data, which plays an important role in cloud computing and CDN distribution. Network topology and routing algorithm are its core research content and key technical issues. The traditional network topology is difficult to guarantee the quality of service in scalability and fault tolerance. The server‐centric DCN topology can ensure the scale of the DCN by recursively increasing the number of network nodes and links. Relative to the Dcell, BCube, and BCCC typical network topology, PTNet network as a typical representative of a new type of the server‐centric DCN topology, which has more advantages in scalability, fault tolerance, and so on. The PTNet network topology is theoretically analyzed in terms of network diameter, bottleneck throughput, and total number of links in the network. Based on the deep research of PTNet network, this article analyzes and studies the network topology, multicast, and broadcast routing algorithm.

show abstract

Section: Preliminarymentioning

confidence: 99%

Section: Problems In Dcnmentioning

confidence: 99%

Topology analysis and routing algorithms design for PTNet network

Han

Zhang

et al. 2020

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…On the basis of this condition, the researchers proved that the conditional diagnosability of Q n was 4(n − 2) + 1 for n ≥ 5, which is greater by nearly a factor of four than the traditional diagnosability. Subsequently, conditional diagnosability has been extensively studied ( [8]- [12]).…”

Section: Introductionmentioning

confidence: 99%

The G-Good-Neighbor Local Diagnosability of a Hypercube Network Under the PMC Model

Yin

Liang

2020

IEEE Access

View full text Add to dashboard Cite

A significant indicator used in evaluating the reliability of a multiprocessor system is fault diagnosability. Researchers concentrate on the diagnosability of the entire system while ignoring important local information about the system. In our paper, an innovative concept of fault diagnosability, called ggood-neighbor local diagnosability, is put forward to study the diagnosability of a system at a node under the g-good-neighbor condition. Moreover, we obtain the relationship between the local diagnosability of a system at each node and the whole system's diagnosability under the g-good-neighbor condition. Under the PMC model, we prove that the g-good-neighbor local diagnosability of an n-dimensional hypercube network Q n at each node is at least 2 g (n − g + 1) − 1 for 0 ≤ g ≤ n − 3 and that when n − 2 ≤ g ≤ n − 1, the g-good-neighbor local diagnosability of Q n at each node is 2 n−1 − 1. Further, we easily derive the diagnosability of hypercube Q n under the g-good-neighbor condition. INDEX TERMS Multiprocessor system, g-good-neighbor local diagnosability, PMC model, hypercube network.

show abstract