Pancyclicity of recursive circulant graphs

In this paper, we study the existence of cycles of all lengths in the recursive circulant graphs, and we show a necessary and sufficient condition for the graph being pancyclic and bipancyclic.     

微波电路互联与制造技术

介绍微波电路CAD与优化、微波集成电路及其制造、微波互联材料与工艺、微波MEMS等微波电路互联与制造新工艺、新技术的国内外研究和发展动态。     

Linearly many faults in Cayley graphs generated by transposition trees

We prove that when linearly many vertices are deleted in a Cayley graph generated by a transposition tree, the resulting graph has a large connected component containing almost all remaining vertices.     

On the number of broadcast schemes in networks

Broadcasting is the process of spreading one piece of information among a group of individuals connected by an interconnection network. In this paper we give exact lower and upper bounds for the number of broadcast schemes in arbitrary networks. Also, we give the exact value for complete bipartite graphs and an upper bound for regular networks. Based on the counting method we describe a new random algorithm for broadcasting in networks.     

Longest fault-free paths in hypercubes with vertex faults

The hypercube is one of the most versatile and efficient interconnection networks (networks for short) so far discovered for parallel computation. Let f denote the number of faulty vertices in an n-cube. This study demonstrates that when f ? n − 2, the n-cube contains a fault-free path with length at least 2ⁿ − 2f − 1 (or 2ⁿ − 2f − 2) between two arbitrary vertices of odd (or even) distance. Since an n-cube is a bipartite graph with two partite sets of equal size, the path is longest in the worst-case. Furthermore, since the connectivity of an n-cube is n, the n-cube cannot tolerate n − 1 faulty vertices. Hence, our result is optimal.     

Design and evaluation of a high throughput QoS-aware and congestion-aware router architecture for Network-on-Chip

This paper proposes a novel QoS-aware and congestion-aware Network-on-Chip architecture that not only enables quality-oriented network transmission and maintains a feasible implementation cost but also well balance traffic load inside the network to enhance overall throughput. By differentiating application traffic into different service classes, bandwidth allocation is managed accordingly to fulfill QoS requirements. Incorporating with congestion control scheme which consists of dynamic arbitration and adaptive routing path selection, high priority traffic is directed to less congested areas and is given preference to available resources. Simulation results show that average latency of high priority and overall traffic is improved dramatically for various traffic patterns. Cost evaluation results also show that the proposed router architecture requires negligible cost overhead but provides better performance for both advanced mesh NoC platforms.     

UPnP基本原理以及在NAT中的应用

在互联网应用越来越丰富的情况下,设备之间如何通过UPn P方案实现互联互通显得日益重要,本文介绍了UPn P所定义的基本协议（如SSDP、GENA、SOAP等）,重点分析了UPn P实现的基本工作流程,并通过抓包工具捕获数据包,对各种流程传递的协议报文进行详尽分析,最后结合NAT技术,重点叙述UPn P在NAT技术中的应用。通过本文能够加深认识设备之间互联互通的一种方案。     

白色家电互联协议的研究与实现

为了实现白色家电互联硬件成本最小化,本文研究和开发了简单、易于实现的白色家电互联协议,MCU作为控制中心,CC1101模块作为无线收发模块,2051作为终端节点处理器,建立了一个小型控制网络,从而实现白色家电的互联。实验结果表明:该系统能够满足互联的功能,并且出错率较低。     

The two-equal-disjoint path cover problem of Matching Composition Network

Embedding of paths have attracted much attention in the parallel processing. Many-to-many communication is one of the most central issues in various interconnection networks. A graph G is globally two-equal-disjoint path coverable if for any two distinct pairs of vertices (u,v) and (w,x) of G, there exist two disjoint paths P and Q satisfied that (1) P (Q, respectively) joins u and v (w and x, respectively), (2) |P|=|Q|, and (3) V(PQ)=V(G). The Matching Composition Network (MCN) is a family of networks which two components are connected by a perfect matching. In this paper, we consider the globally two-equal-disjoint path cover property of MCN. Applying our result, the Crossed cube CQ_n, the Twisted cube TQ_n, and the Möbius cube MQ_n can all be proven to be globally two-equal-disjoint path coverable for n5.