Reliability Assessment of a New General Matching Composed Network

The reliability of a network is an important indicator for maintaining communication and ensuring its stable operation. Therefore, the assessment of reliability in underlying interconnection networks has become an increasingly important research issue. However, at present, the reliability assessment of many interconnected networks is not yet accurate,which inevitably weakens their fault tolerance and diagnostic capabilities. To improve network reliability,researchers have proposed various methods and strategies for precise assessment. This paper introduces a novel family of interconnection networks called general matching composed networks(gMCNs), which is based on the common characteristics of network topology structure. After analyzing the topological properties of gMCNs, we establish a relationship between super connectivity and conditional diagnosability of gMCNs. Furthermore, we assess the reliability of g MCNs, and determine the conditional diagnosability of many interconnection networks.

Dynamic load balancing based on restricted multicast tree in triplet-based hierarchical interconnection network

To solve the load balancing problem in a triplet-based hierarchical interconnection network（THIN） system, a dynamic load balancing （DLB）algorithm--THINDLBA, which adopts multicast tree （MT）technology to improve the efficiency of interchanging load information, is presented. To support the algorithm, a complete set of DLB messages and a schema of maintaining DLB information in each processing node are designed. The load migration request messages from the heavily loaded node （HLN）are spread along an MT whose root is the HLN. And the lightly loaded nodes（LLNs） covered by the MT are the candidate destinations of load migration; the load information interchanged between the LLNs and the HLN can be transmitted along the MT. So the HLN can migrate excess loads out as many as possible during a one time execution of the THINDLBA, and its load state can be improved as quickly as possible. To avoid wrongly transmitted or redundant DLB messages due to MT overlapping, the MT construction is restricted in the design of the THINDLBA. Through experiments, the effectiveness of four DLB algorithms are compared, and the results show that the THINDLBA can effectively decrease the time costs of THIN systems in dealing with large scale computeintensive tasks more than others.

Reliability Analysis of Varietal Hypercube

Connectivity is a vital metric to explore fault tolerance and reliability of network structure based on a graph model. Let be a connected graph. A connected graph G is called supper-κ (resp. supper-λ) if every minimum vertex cut (edge cut) of G is the set of neighbors of some vertex in G. The g-component connectivity of a graph G, denoted by , is the minimum number of vertices whose removal from G results in a disconnected graph with at least g components or a graph with fewer than g vertices. The g-component edge connectivity can be defined similarly. In this paper, we determine the g-component (edge) connectivity of varietal hypercube for small g.

Development of Network Interconnection in China

This paper introduces the current situation of China power industry and interconnection, the necessity to develop interconnection, the principle of nationwide interconnection and the key technologies to be studiedinclude HVDC and FACTS. The paper also discusses thefeasibility of 750 kV to be used in the northwest.regionand to speed up research and development of nighervoltage level in other regions of China, as well as scl-ence and technical innovation for transmission and dis-tribution projects.

Diagnosabilities of exchanged hypercube networks under the pessimistic one-step diagnosis strategy

The exchanged hypercube EH（s, t） （where s ≥ 1 and t ≥ 1） is obtained by systematically reducing links from a regular hypercube Q,＋t＋l. One-step diagnosis of exchanged hypercubes which involves only one testing phase during which processors test each other is discussed. The diagnosabilities of exchanged hypercubes are studied by using the pessimistic one-step diagno- sis strategy under two kinds of diagnosis models： the PMC model and the MM model. The main results presented here are the two proofs that the degree of diagnosability of the EH（s, t） under pessimistic one-step tl/tl fault diagnosis strategy is 2s where I ≤ s ≤ t （respectively, 2t, where 1 ≤ t ≤ s） based on the PMC model and that it is also 2s where 1 ≤ s ≤ t （respectively, 2t, where 1 ≤ t ≤ s） based on the MM＊ model.

Research on reliability index of a large communication network with domain partition and interconnection

In order to indicate the performances of a large-scale communication network with domain partition and interconnection today, a kind of reliability index weighed by normalized capacity is defined. Based on the route rules of network with domain partition and interconnection, the interconnection indexes among the nodes within the domain and among the domains are given from several aspects. It is expatiated on that the index can thoroughly represent the effect on the reliability index of the objective factor and the subjective measures of the designer, which obeys the route rules of a network with domain partition and interconnection. It is discussed that the defined index is rational and compatible with the traditional index.

An Analytical Model for Torus Networks in the Presence of Batch Message Arrivals with Hot-spot Destinations

Interconnection networks are hardware fabrics supporting communications between individual processors in multi- computers. The low-dimensional k-ary n-cubes （or torus） with adaptive wormhole switching have attracted significant research efforts to construct high-performance interconnection networks in contemporary multi-computers. The arrival process and destination distribution of messages have great effects on network performance. With the aim of capturing the characteristics of the realistic traffic pattern and obtaining a deep understanding of the performance behaviour of interconneetion networks, this paper presents an analytical model to investigate the message latency in adaptive-routed wormhole-switched torus networks where there exists hot-spot nodes and the message arrivals follow a batch arrival process. Each generated message has a given probability to be directed to the hot-spot node. The average degree of virtual channel multiplexing is computed by the GE/G/1/V queueing system with finite buffer capacity. We compare analytical results of message latency with those obtained through the simulation experiments in order to validate the accuracy of the derived model.

An Improved Interconnection Network Based on NIN

The Novel Interconnection Network (NIN) based on inverted-graph topology and crossbar switch is a kind of lower latency and higher throughput interconnection network. But it has a vital disadvantage, high hardware complexity. In order to reduce system hardware cost, an improved NIN (ININ) structure is proposed. As same as NIN, ININ has constant network diameter. Besides of keeping advantages of NIN, hardware cost of ININ is lower than NIN. Furthermore, we design a new deadlock-free routing algorithm for the improved NIN. Key words NIN - ININ - inverted-graph interconnection network - hardware complexity - network band-width - network throughput CLC number TP 302 Foundation item: Supported by the National Natural Science Foundation of China (69873016)Biography: Li Fei (1974-), male, Ph. D candidate, research direction: architecture of interconnection network.

An new representation for interconnection network structures

An important theoretic interest is to study the relations between different interconnection networks, and to compare the capability and performance of the network structures. The most popular way to do the investigation is network emulation. Based on the classical voltage graph theory, the authors develop a new representation scheme for interconnection network structures. The new approach is a combination of algebraic methods and combinatorial methods. The results demonstrate that the voltage graph theory is a powerful tool for representing well known interconnection networks and in implementing optimal network emulation algorithms, and in particular, show that all popular interconnection networks have very simple and intuitive representations under the new scheme. The new representation scheme also offers powerful tools for the study of network routings and emulations. For example, we present very simple constructions for optimal network emulations from the cube connected cycles networks to the butterfly networks, and from the butterfly networks to the hypercube networks. Compared with the most popular way of network emulation, this new scheme is intuitive and easy to realize, and easy to apply to other network structures.

Virtual and physical address translation mechanism of interconnect network

Most of users are accustomed to utilizing virtual address in their parallel programs running at the scalable high-performance parallel computing systems.Therefore a virtual and physical address translation mechanism is necessary and crucial to bridge the hardware interface and software application.In this paper,a new virtual and physical translation mechanism is proposed,which includes an address validity checker,an address translation cache（ATC）,a complete refresh scheme and many reliability designs.The ATC employs a large capacity embedded dynamic random access memory（eDRAM）to meet the high hit ratio requirement.It also can switch the cache and buffer mode to avoid the high latency of accessing the main memory outside.Many tests have been conducted on the real chip,which implements the address translation mechanism.The results show that the ATC has a high hit ratio while running the well-known benchmarks,and additionally demonstrates that the new high-performance mechanism is well designed.

Some LCP Decompositions of Multistage Interconnection Networks

Some useful layered cross product decompositons are derived both for general bit permutation networks and for(2n-1)-stage multistage interconnection networks.Several issues in related works are clarified and the rearrangeability of some interesting networks are considered.In particular, the rearrangeability of one class of networks is formulated as a new type of combinatorial design problmes.

THE PN2I NETWORK: A SCALABLE BANYAN NETWORK

To design a Banyan network with an arbitrary even-sized port number, the PN2I network is proposed. The PN2I network can be divided into two classes: the complete and incomplete versions. A simple routing algorithm is given, but in the incomplete PN2I networks,this routing algorithm fails to make the traffic in links even, which deteriorates the performance badly. Thus a new routing algorithm is proposed, which makes the incomplete PN2I networks behave almost the same as the PN2I networks with respect to the performance issues.

BALANCE ROUTING TRAFFIC IN GENERALIZED SHUFFLE-EXCHANGE NETWORK

A methodology is proposed to handle problem that under equiproble address of packet traffic at the input port, Generalized Shuffle-Exchange Network (GSEN) routes traffic unevenly because of the unbalanced routing tags. The idea is to use routing tag according to probability, which can be evaluated by using Moore-Penrose inverse in matrix analysis. An instance is used to illustrate the idea, and the simulation is done to show the improvement in performance issues.

Algorithm and Performance Analysis of Optical Multistage Interconnection Network

A sorting algorithm based on the Batcher' s algorithm is presented. An 8X8multistage interconnection network(MIN) is constructed. Applying wavelength division multiplexing(WDM) technology and integrating control mode, the designed network can realize non-blockingcommunication. The time delay of the MIN and the switches needed are also analyzed in theory, thededuced result conforms that the MIN designed previously is feasible. In the case of the samecommunication quality guaranteed, MIN uses the least switches and completes the communication moreefficiently.

A Sufficient Condition for Networks to be n-Neighbor d-Diagnosable under the Comparison Model

Diagnosability of multiprocessor systems is an important research topic.The system and an interconnection network have an underlying topology,which is usually presented by a graph.In 2012,Peng et al.proposed a metric for fault diagnosis of the graph,namely,the n-neighbor diagnosability that restrains every fault-free node to contain at least n fault-free neighbors.It is difficult to get the n-neighbor diagnosability of the graph from the definition of the n-neighbor diagnosability.Afterwards,some sufficient and necessary conditions are given.It is also difficult to find the n-neighbor diagnosability of the graph from those results.In this paper,we show some new sufficient conditions for the graph to be n-neighbor d-diagnosable under the MM*model.It improves the corresponding result of[Theoretical Computer Science 773(2019)107-114].

Research on the Method of Implementing Named Data Network Interconnection Based on IP Network

In order to extend the application scope of NDN and realize the transmission of different NDNs across IP networks,a method for interconnecting NDN networks distributed in different areas with IP networks is proposed.Firstly,the NDN data resource is located by means of the DNS mechanism,and the gateway IP address of the NDN network where the data resource is located is found.Then,the transmission between different NDNs across the IP network is implemented based on the tunnel technology.In addition,in order to achieve efficient and fast NDN data forwarding,we have added a small number of NDN service nodes in the IP network,and proposed an adaptive probabilistic forwarding strategy and a link cost function-based forwarding strategy to make NDN data obtaining the cache service provided by the NDN service node as much as possible.The results of analysis and simulation experiments show that,the interconnectionmethod of NDN across IP network proposed is generally effective and feasible,and the link cost function forwarding strategy is better than the adaptive probability forwarding strategy.