三级Clos网络中分布式调度算法研究

调度算法用于解决交换网络输出端口竞争问题.鉴于现有三级Clos网络调度算法存在实现复杂、性能无法保证的缺点,本文提出了一种利于分布式调度的三级Clos网络结构和相应的负载均衡调度思想,并给出了一种简单负载均衡调度算法.采用这种新结构和相应的调度思想不仅可以简化三级Clos网络的调度,而且可以充分利用现有单Crossbar网络调度的研究成果,保证算法性能.文中通过理论和仿真分析证明基于这种思想的调度算法比现有算法具有很大的优越性.     

Scheduling with accurate communication delay model and scheduler implementation for multiprocessor system-on-chip

In multiprocessor system-on-chip, tasks and communications should be scheduled carefully since their execution order affects the performance of the entire system. When we implement an MPSoC according to the scheduling result, we may find that the scheduling result is not correct or timing constraints are not met unless it takes into account the delays of MPSoC architecture. The unexpected scheduling results are mainly caused from inaccurate communication delays and or runtime scheduler’s overhead. Due to the big complexity of scheduling problem, most previous work neglects the inter-processor communication, or just assumes a fixed delay proportional to the communication volume, without taking into consideration subtle effects like the communication congestion and synchronization delay, which may change dynamically throughout tasks execution. In this paper, we propose an accurate scheduling model of hardware/software communication architecture to improve timing accuracy by taking into account the effects of dynamic software synchronization and detailed hardware resource constraints such as communication congestion and buffer sharing. We also propose a method for runtime scheduler implementation and consider its performance overhead in scheduling. In particular, we introduce efficient hardware and software scheduler architectures. Furthermore, we address the issue of centralized implementation versus distributed implementation of the schedulers. We investigate the pros and cons of the two different scheduler implementations. Through experiments with significant demonstration examples, we show the effectiveness of the proposed approach.     

MrFair: Misbehavior-resistant fair scheduling in wireless mesh networks

It is a critical issue to ensure that nodes and/or flows have fair access to the network bandwidth in wireless mesh networks (WMNs). However, current WMNs based on IEEE 802.11 exhibit severe unfairness. Several scheduling schemes have been proposed to ensure fairness in WMNs. Unfortunately, all of them implicitly trust nodes in the network, and thus are vulnerable to the misbehavior of nodes participating in scheduling. In this paper, we address the threats to fair scheduling in WMNs resulting from node misbehavior and present a generic verification framework to detect such misbehavior. Moreover, we develop two verification schemes based on this framework for distributed and centralized authentication environments, respectively. We validate our approach by extending an existing fair scheduling scheme and evaluating it through simulation. The results show that our approach improves misbehavior detection with light performance overhead.     

Routing strategies for maximizing throughput in LEO satellite networks

This paper develops routing and scheduling algorithms for packet transmission in a low Earth orbit satellite network with a limited number of transmitters and buffer space. We consider a packet switching satellite network, where time is slotted and the transmission time of each packet is fixed and equal to one time slot. Packets arrive at each satellite independently with a some probability during each time slot; their destination satellite is uniformly distributed. With a limited number of transmitters and buffer space on-board each satellite, contention for transmission inevitably occurs as multiple packets arrive at a satellite. First, we establish the stability region of the system in terms of the maximum admissible packet arrival rate that can possibly be supported. We then consider three transmission scheduling schemes for resolving these contentions: random packet win, where the winning packet is chosen at random; oldest packet win, where the packet that has traveled the longest distance wins the contention; and shortest hops win (SHW), where the packet closest to its destination wins the contention. We evaluate the performance of each of the schemes in terms of throughput. For a system without a buffer, the SHW scheme attains the highest throughput. However, when even limited buffer space is available, all three schemes achieve about the same throughput performance. Moreover, even with a buffer size of just a few packets the achieved throughput is close to that of the infinite buffer case.     

Distributed Proportional Fair Scheduling for IEEE802.11 Wireless LANs

In the time varying wireless channel, opportunistic scheduling is one of the important techniques to achieving the rich diversities inherent in wireless communications. However, most existing scheduling schemes require centralized scheduling and little work has been done on developing distributed algorithms The proportional fair scheduling is one of the representative opportunistic scheduling for centralized networks. In this paper, we propose distributed proportional fair scheduling (DPFS) scheme for wireless LAN network. In the proposed DPFS scheme, each receiver estimates channel condition and calculates independently its own priority with probabilistic manner, which can reduce excessive probing overhead required to gather the channel conditions of all receivers. We evaluate the proposed DPFS using extensive simulation and simulation results show that DPFS obtains higher network throughput than conventional scheduling schemes while maintaining fairness among users.     

基于物理层安全的最优化跨层调度方案

无线网络的调度方案要求以链路质量、传输率和时延等网络参数作为主要参考依据,控制和管理网络中节点的传输行为。现有的无线网络调度方案中都没有把网络安全纳入考虑,但是通常情况下,网络安全正是影响网络性能的重要因素。文中设计了一个新的无线网络调度方案,该方案可以在物理层实现通信的完美保密。通过把这个调度方案和IEEE802.11的Mac协议中已有的分布式协调功能(DCF)相结合,从而可以实现一个保证了物理层安全的新Mac协议——SecDCF。文中采用Matlab对该协议进行仿真,仿真结果显示在实现物理层安全的前提下,SecDCF相比传统的DCF可以显著提升性能。     

定长光突发下的FDL缓存和调度

为了改善光突发交换的阻塞性能,分析了定长光突发交换在FDL光缓存的排队和调度,提出了基于中间共享FDL光缓存结构的长队列优先(LQP)调度方案,该方案使交换端口充分共享FDL缓存单元,调度时间短,在模拟仿真中得到较好的阻塞性能结果。     

Delay guaranteed MDP scheduling scheme for HCCA based on 802.11p protocol in V2R environments

In recent years, the vehicular ad hoc network has attracted worldwide attention from academe and industry. Many researches have been executed to improve the quality of services (QoS) of the intelligent transportation system. However, current existing channel access schemes at the medium access control layer specified in 802.11 protocol, including hybrid coordination function control channel access (HCCA) and enhanced distributed channel access, could not efficiently achieve the QoS requirements in some special situations. This paper proposes a delay guaranteed HCCA (DG‐HCCA) scheduling scheme, which works based on a Markov decision process model and the measurement of historic performance, to guarantee the QoS enhanced data transmission for vehicles to roadside unit. Besides, this paper also presents a performance analysis model to systematically evaluate the system performance of the channel utility and the average delay. The performance of the proposed delay guaranteed HCCA scheduling scheme is compared with that of original HCCA scheme specified in 802.11p standard and other 2 HCCA improved schemes by the simulation experiments. The simulation results demonstrate that the proposed solution could highly fulfill the transmission delay requirements with a better channel utility and less loss rates than those by the standard HCCA scheme and other 2 schemes.     

Performance comparison of OBS and SONET in metropolitan ring networks

This paper explores the feasibility of deploying optical burst switching (OBS) in metropolitan area networks (MANs) as an alternative to synchronous optical network (SONET), over wavelength-division multiplexing. We present a comparison between two OBS architectures (with centralized and distributed scheduling schemes), SONET, and next-generation SONET (NG-SONET), respectively. We quantify some of the performance metrics such as end-to-end delay and loss rate when supporting Ethernet traffic in metro ring networks. Our simulation results show that OBS offers significant performance improvement over SONET and NG-SONET. In general, the OBS architecture with distributed scheduling has a superior delay performance, whereas the OBS architecture with centralized scheduling has a better loss metric.     

Optimal Power Schedule for Distributed MIMO Links

We present an optimal power scheduling scheme to maximize the throughput of a set of distributed multiple-input multiple-output (MIMO) wireless links. This scheme exploits both spatial and temporal freedoms of the source covariance matrices of all MIMO links. In particular, the source covariance matrix of each MIMO link is allowed to vary within a block of time (and/or frequency) slots. This scheme, also referred to as space-time power scheduling, optimizes an integration of link scheduling and power control for MIMO links. The computational problem involved in this scheme is non-convex. However, a gradient-projection algorithm developed for this scheme consistently yields a higher capacity than all other existing schemes.     

异步传感器网络随机事件捕获在线调度方案

针对已有异步传感器网络中依据随机事件的随机特性进行节点休眠调度离线问题,给出描述事件随机特性随机变量分布参数的Bayes估计。讨论了瞬时捕获概率、传感器捕获事件能量效率和分布参数的Bayes估计值之间的关系,得到了传感器休眠调度和分布参数Bayes估计值之间的关系式。由此得到了传感器节点在线实时调整的休眠周期调度方案。最后进行了在线调度方案和离线调度方案模拟实验,对相应结果进行了对比分析。实验结果表明相较于离线调度方案,在线调度方案具有更好的适应性。     

面向OFDM应用的低硬件开销低功耗64点FFT处理器设计

在基于正交频分复用(Orthogonal Frequency Division Multiplexing,OFDM)的无线系统中,快速傅里叶变换(Fast Fourier Transform,FFT)作为关键模块,消耗着大量的硬件资源。为此,针对于IEEE802. 11a标准的无线局域网基带技术,提出了一种低硬件开销、低功耗的基-24算法流水线架构FFT处理器设计方案。在硬件实现上,采用单路延迟负反馈(Single-path Delay Feedback,SDF)流水线架构;为了降低硬件资源消耗,基于新型的改良蝶形架构利用正则有符号数(Canonical Signed Digit,CSD)常数乘法器替代布斯乘法器完成所有的复数乘法运算。设计采用QUARTUS PRIME工具进行开发,搭配Cyclone 10 LP系列器件,编译结果显示该方案与其他已存在的方案相比,至少节约硬件成本25%,降低功耗18%。     

Performance analysis and hardware implementation of a nearly optimal buffer management scheme for high‐performance shared‐memory switches

Burst traffic is a common traffic pattern in modern IP networks, and it may lead to the unfairness problem and seriously degrade the performance of switches and routers. From the perspective of switching mechanism, the majority of commercial switches adopt the on‐chip shared‐memory switching architecture, and high‐speed packet buffer with efficient queue management is required to deal with the unfairness and congestion problem. In this paper, the performance of a shared‐private buffer management scheme is analyzed in detail. In the proposed scheme, the total memory space is split into shared area and private area. Each output port has a private memory area that cannot be used by other ports. The shared area is completely shared among all output ports. A theoretical queuing model of the proposed scheme is formulated, and closed‐form formulas for multiple performance parameters are derived. Through the numerical studies, we demonstrate that a nearly optimal buffer partition policy can be obtained by setting an equally small amount of private area for each queue. This work is validated by simulations as well as hardware experiments. Software simulations show that the proposed scheme performs better than existing methods, and packet dropping caused by burst traffic can be significantly reduced. Besides, a prototype of the buffer management module is implemented and evaluated in field programmable gate array platform. The evaluation shows that the proposed scheme can ensure the efficiency and fairness while keeping a high throughput in real workload.     

ReTrust: attack-resistant and lightweight trust management for medical sensor networks

Wireless medical sensor networks (MSNs) enable ubiquitous health monitoring of users during their everyday lives, at health sites, without restricting their freedom. Establishing trust among distributed network entities has been recognized as a powerful tool to improve the security and performance of distributed networks such as mobile ad hoc networks and sensor networks. However, most existing trust systems are not well suited for MSNs due to the unique operational and security requirements of MSNs. Moreover, similar to most security schemes, trust management methods themselves can be vulnerable to attacks. Unfortunately, this issue is often ignored in existing trust systems. In this paper, we identify the security and performance challenges facing a sensor network for wireless medical monitoring and suggest it should follow a two-tier architecture. Based on such an architecture, we develop an attack-resistant and lightweight trust management scheme named ReTrust. This paper also reports the experimental results of the Collection Tree Protocol using our proposed system in a network of TelosB motes, which show that ReTrust not only can efficiently detect malicious/faulty behaviors, but can also significantly improve the network performance in practice.     

A TQR-iteration based adaptive SVD for real time angle andfrequency tracking

The transposed VR (TQR) iteration is a square root version of the symmetric QR iteration. The TQR algorithm converges directly to the singular value decomposition (SVD) of a matrix and was originally derived to provide a means to identify and reduce the effects of outliers for robust SVD computation. The paper extends the TQR algorithm to incorporate complex data and weighted norms, formulates a TQR-iteration based adaptive SVD algorithm, develops a real time systolic architecture, and analyzes performance. The applications of high resolution angle and frequency tracking are developed and the updating scheme is so tailored. A deflation mechanism reduces both the computational complexity of the algorithm and the hardware complexity of the systolic architecture, making the method ideal for real time applications. Simulation results demonstrate the performance of the method and compare it to existing SVD tracking schemes. The results show that the method is exceptional in terms of performance to cost ratio and systolic implementation     

Instruction cache organisation for embedded low-power processors

A low-power I-cache architecture is proposed that is appropriate for embedded low-power processors. Unlike existing schemes, the proposed organisation places an extra small cache in parallel alongside the L1 cache. Since it allows simultaneous accesses to both caches, the proposed scheme introduces little performance degradation. Using simple hardware logic (for sequential accesses) and a compiler transformation (for loop accesses), most L1 cache requests are served by a small cache, so that the amount of energy consumed by the L1 cache is significantly reduced. Experimental results show that for the SPEC95 benchmarks, the proposed organisation reduces the energy-delay product on average by 67.2% over a conventional cache design and 16.8% over the filter cache design     

Low Complexity Decoder Architecture for Low-Density Parity-Check Codes

In this paper, we propose a low complexity decoder architecture for low-density parity-check (LDPC) codes using a variable quantization scheme as well as an efficient highly-parallel decoding scheme. In the sum-product algorithm for decoding LDPC codes, the finite precision implementations have an important tradeoff between decoding performance and hardware complexity caused by two dominant area-consuming factors: one is the memory for updated messages storage and the other is the look-up table (LUT) for implementation of the nonlinear function Ψ(x). The proposed variable quantization schemes offer a large reduction in the hardware complexities for LUT and memory. Also, an efficient highly-parallel decoder architecture for quasi-cyclic (QC) LDPC codes can be implemented with the reduced hardware complexity by using the partially block overlapped decoding scheme and the minimized power consumption by reducing the total number of memory accesses for updated messages. For (3, 6) QC LDPC codes, our proposed schemes in implementing the highly-parallel decoder architecture offer a great reduction of implementation area by 33% for memory area and approximately by 28% for the check node unit and variable node unit computation units without significant performance degradation. Also, the memory accesses are reduced by 20%.     

A distributed mobility control scheme in LISP networks

The locator identifier separation protocol (LISP) has been made as an identifier-locator separation scheme for scalable Internet routing. However, the LISP was originally designed for fixed network environment, rather than for mobile network environment. In particular, the existing LISP mobility control schemes use a centralized map server to process all the control traffics, and thus they are intrinsically subject to some limitations in mobile environment, such as large overhead of mapping control traffics at central map server and degradation of handover performance. To overcome these problems, we propose a distributed mobility control scheme in LISP networks. In the proposed scheme, we assume that a mobile host has a hierarchical endpoint identifier which contains the information of its home network domain. Each domain has a distributed map server (DMS) for distributed mapping management of Endpoint Identifiers (EIDs) and Locators (LOCs). For roaming support, each DMS maintains a home EID register and a visiting EID register which are used to keep the EID-LOC mappings for mobile hosts in the distributed manner. For performance analysis, we compare the control traffic overhead (CTO) at map servers, the signaling delay required for EID-LOC mapping management, and the handover delay for the existing and proposed schemes. From numerical results, it is shown that the proposed distributed scheme can give better performance than the existing centralized schemes in terms of CTO, total signaling delay for EID-LOC mapping management, and handover delay.     

Efficient and scalable architecture for searchable symmetric encryption

The existing encryption schemes were usua11y poor of index construction and maintenance,which was difficu1t to meet the retrieva1 requirements for distributed ciphertext.Aiming at the above shortage of existing schemes,a structure of separab1e ciphertext inverted index was proposed for improving the performance of para11e1 constructing cryptograph index,simp1ifying the data maintenance process,and increasing the compatibi1ity with the traditiona1 NoSQL system.The method of centra1ized inverted index was adopted to improve the retrieva1 efficiency of distributed retrieva1 system.Then,the proposed scheme was proved to meet the wide1y adopted IND-CKA security standard.Fina11y,Cassandra was combined to eva1uate the severa1 performance parameters,and the experimenta1 resu1ts show proposed architecture has good app1icabi1ity to the distributed and massive encrypted data environment.     

Pipelined Scheduling of Functional HW/SW Modules for Platform‐Based SoC Design

We developed a pipelined scheduling technique of functional hardware and software modules for platform‐based system‐on‐a‐chip (SoC) designs. It is based on a modified list scheduling algorithm. We used the pipelined scheduling technique for a performance analysis of an MPEG4 video encoder application. Then, we applied it for architecture exploration to achieve a better performance. In our experiments, the modified SoC platform with 6 pipelines for the 32‐bit dual layer architecture shows a 118% improvement in performance compared to the given basic SoC platform with 4 pipelines for the 16‐bit single‐layer architecture.