This paper presents the PC-based LabVIEW as a software to develop the algorithm of the robust complex extended Kalman filter (rCEKF) fordetection of the parameters of voltage signal in powersystems. The hardware of ...
详细信息
The current network-on-chip (NoC) topology cannot predict subsequent switch node status promptly. Switch nodes have to perform various functions such as routing decision, data forwarding, packet buffering, congestio...
详细信息
The current network-on-chip (NoC) topology cannot predict subsequent switch node status promptly. Switch nodes have to perform various functions such as routing decision, data forwarding, packet buffering, congestion control and properties of an NoC system. Therefore, these make switch architecture far more complex. This article puts forward a separating on-chip network architecture based on Mesh (S-Mesh), S-Mesh is an on-chip network that separates routing decision flow from the switches. It consists of two types of networks: datapath network (dN) and control network (CN). The CN establishes data paths fordata transferring in dN. Meanwhile, the CN also transfers instructions between different resources. This property makes switch architecture simple, and eliminates conflicts in network interface units between the resource and switch. Compared with 2d-Mesh, Toms Mesh, Fat-tree and Butterfly, the average packet latency in S-Mesh is the shortest when the packet length is more than 53 B. Compared with 2d-Mesh, the areas savings of S-Mesh is about 3%-7/% and the powerdissipation is decreased by approximate 2%.
Implementing the dynamic couple of searching paths andresource allocation becomes increasingly important in the research of Quality of Service (QoS) routing. In this paper, we formulate the problem of dynamic QoS rou...
详细信息
Current MSM switching fabric has poor performance under unbalanced traffic. This paper presents an alternative, novel Central-stage Buffered Three-stage Clos switching (CB-3Clos) fabric and proves that this fabric can...
详细信息
Current MSM switching fabric has poor performance under unbalanced traffic. This paper presents an alternative, novel Central-stage Buffered Three-stage Clos switching (CB-3Clos) fabric and proves that this fabric can emulate output queuing switch without any speedup. By analyzing the condition to satisfy the central-stage load-balance, this paper also proposes a Central-stage Load-balanced-baseddistributed Scheduling algorithm (CLdS) for CB-3Clos. The results show that, compared with Concurrent round-robin baseddispatching (Crrd) algorithm based on MSM, CLdS algorithm has high throughput irrespective with the traffic model and better performance in mean packet delay.
This paper proposes a model of dam-breach problems for Tangjiashan quake lake which had been threatening to breach its dam and wash away people downstream. The proposed model utilizes the theories of flow dynamics and...
详细信息
Multi-nexthop routing Mechanisms is the key point in network congestion, and the essential question is how to forward packets among Multi-nexthop to reach equiponderant forwarding. This paper proposes an equiponderant...
详细信息
The number of users accepted by a cell is limited by the total received interference power at base station transceiver in code-division multiple access (CdMA) system. In this paper, we propose a received power based c...
详细信息
The Counting Bloom Filter (CBF) is a kind of space-efficient data structure that extends a Bloom filter so as to allow approximate multiplicity queries on a dynamic multi-set. This paper evaluates the performance of...
详细信息
The Counting Bloom Filter (CBF) is a kind of space-efficient data structure that extends a Bloom filter so as to allow approximate multiplicity queries on a dynamic multi-set. This paper evaluates the performance of multiplicity queries of three simple CBF schemes-the Naive Counting Bloom Filter (NCBF), the Space-Code Bloom Filter (SCBF) and the d-left Counting Bloom Filter (dlCBF)-using metrics of space complexity and counting error under both uniform and zipfian multiplicity distributions. We compare their counting error under same space complexity, and their space complexity when similar counting errors are achievedrespectively. Ourresults show that dICBF is the best while SCBF is the worst in terms of both space-efficiency and accuracy. Furthermore, the performance gap between dlCBF and the others has a trend of being enlarged with the increment of space occupation or counting accuracy.
Network topology plays an important role in design and with exponent parameter belongs to [2,3];exhibiting a large optimization of routing protocols and network algorithms. Based on degree of clustering;small average ...
详细信息
暂无评论