Fast ping‐pong arbitration for input–output queued packet switches

Input–output queued switches have been widely considered as the most feasible solution for large capacity packet switches and IP routers. In this paper, we propose a ping‐pong arbitration scheme (PPA) for output contention resolution in input–output queued switches. The challenge is to develop a high speed and cost‐effective arbitration scheme in order to maximize the switch throughput and delay performance for supporting multimedia services with various quality‐of‐service (QoS) requirements. The basic idea is to divide the inputs into groups and apply arbitration recursively. Our recursive arbiter is hierarchically structured, consisting of multiple small‐size arbiters at each layer. The arbitration time of an n‐input switch is proportional to log₄?n/2? when we group every two inputs or every two input groups at each layer. We present a 256×256 terabit crossbar multicast packet switch using the PPA. The design shows that our scheme can reduce the arbitration time of the 256×256 switch to 11 gates delay, demonstrating the arbitration is no longer the bottleneck limiting the switch capacity. The priority handling in arbitration is also addressed. Copyright © 2001 John Wiley & Sons, Ltd.     

应用网络编码的分组交换调度算法

网络编码理论与交换调度算法相结合重点是实现在联合输入输出排队（CIOQ）交换结构中提供组播服务。文章证明了对一个流中的分组进行线性网络编码可以承载不允许网络编码时不能够承载的交换流量模式,也就是说,网络编码允许CIOQ交换结构在实现组播服务时有更大的速率区域,并给出了基于图论方法的描述。运用增强冲突图的稳定集多面体等概念,文章证明了计算离线调度的问题可以简化成某种图染色问题,同时,也针对组播调度提出了一个称之为最大权重稳定集的在线调度算法。     

一种用于北斗大容量通信的丢包重传机制的实现

我国北斗三号卫星导航系统的建立,解决了北斗一号和北斗二号报文通信功能存在的局限性,不仅通信速率得到了极大提升,而且通信容量扩充了近10倍,可支持语音、图片等大容量信息的传输,但是由于语音等信息容量较大,在传输之前需要经过压缩编码和数据分包重组,由于北斗卫星链路容易受到大气条件、电磁干扰等因素影响,容易出现数据丢包,因此,为了保证信息传输完全以及用户体验,需要丢包重传。基于此提出了一种新的北斗大容量通信丢包重传机制,不依赖于终端设备的存储容量,经试验验证成功率可达98.2%,适用于各行各业使用北斗发送大容量数据的应用。     

Design of an ultra fast pipelined wavelength scheduler for optical burst switching

Optical Burst Switching (OBS) is an emerging technology that allows variable size data bursts to be transported directly over DWDM links without encountering O/E/O conversion. In OBS, before the transmission of a data burst, a burst header is transmitted through an electronic control path, setting up and tearing down optical paths on-the-fly. Data bursts can remain in the optical domain and pass through the OBS network transparently. Unfortunately, system performance will be greatly degraded, if burst scheduling requests cannot be processed in time. This article quantitatively studied the negative impact of control path overloading on the performance of OBS networks. Results have shown that control path overloading greatly affects the performance of the OBS routers, especially for systems with large WDM channel counts. In order to remove this performance bottleneck, we have designed and implemented an ultra fast pipelined burst scheduler that is able to process a burst request every two clock cycles, regardless of the number of WDM channels per link. The design has been implemented in Verilog HDL and synthesized to FPGAs. Circuit level simulation results confirm the correctness of the design. The circuit has achieved 100 MHz in Altera Cyclone II devices, allowing the scheduler to process a burst request every 20 ns. To the authors’ best knowledge, this is the fastest implementation of burst scheduling algorithms.     

无线光通信双幅度脉冲位置调制

无线光通信脉冲位置调制(PPM)的功率利用率虽然很高,但带宽需求也非常高,在无线光通信系统中,应当充分考虑带宽需求和功率利用率的平衡问题.针对该问题,提出了一种新的双幅度脉冲位置调制(DAPPM).在给出了其符号结构之后,分析了其带宽利用率.然后,推导了弱湍流信道模型下DAPPM的误时隙率和误包率,并与OOK、PPM、DPIM和DAPIM等调制方式进行了比较.结果表明,在相同的位分辨率条件下,DAPPM的误包率虽然高于PPM和DPIM,但明显优于OOK和DAPIM.同时,DAPPM去除了PPM中冗余的时隙,且平均长度比DPIM短,从而获得了比DPIM更高的带宽利用率.     

Queue Analysis and Multiplexing of Heavy-tailed Traffic in Wireless Packet Data Networks

Recent research based on traffic measurements shows that Internet traffic flows have a fractal nature (i.e., self-similarity property), which causes an underestimation of network engineering parameters when using the conventional Poisson model. Preliminary field measurements demonstrate that packet data traffic in wireless communications also exhibits self-similarity. In this paper, we investigate the queuing behavior of self-similar traffic flows for data applications in a packet-switching single-server wireless network. The traffic is generated by an on–off source with heavy-tailed on periods and exponentially distributed off periods. We extend previous analysis of a relation among the asymptotic distribution of loss probability, traffic specifications, and transmission rate for a wireline system to a wireless system, taking into account wireless propagation channel characteristics. We also investigate the multiplexing of heavy-tailed traffic flows with a finite buffer for the downlink transmission of a wireless network. Computer simulation results demonstrate that assumptions made in the theoretical analysis are reasonable and the derived relationships are accurate.     

Short packet communication in underlay cognitive network assisted by an intelligent reflecting surface

We propose short packet communication in an underlay cognitive radio network assisted by an intelligent reflecting surface (IRS) composed of multiple reconfigurable reflectors. This scheme, called the IRS protocol, operates in only one time slot (TS) using the IRS. The IRS adjusts its phases to give zero received cumulative phase at the secondary destination, thereby enhancing the end-to-end signal-to-noise ratio. The transmitting power of the secondary source is optimized to simultaneously satisfy the multi-interference constraints, hardware limitations, and performance improvement. Simulation and analysis results of the average block error rates (BLERs) show that the performance can be enhanced by installing more reconfigurable reflectors, increasing the blocklength, lowering the number of required primary receivers, or sending fewer information bits. Moreover, the proposed IRS protocol always outperforms underlay relaying protocols using two TSs for data transmission, and achieves the best average BLER at identical transmission distances between the secondary source and secondary destination. The theoretical analyses are confirmed by Monte Carlo simulations.     

Packet Delay Analysis of Symmetric Gated Polling System for DBA Scheme in an EPON

In this paper, we analyze the mean packet delay of a dynamic bandwidth allocation (DBA) scheme in an Ethernet passive optical network (EPON). We propose the interleaved polling system with a gated service discipline and a two-stage queue in order to investigate the delay performance of DBA scheme in an EPON. We assume that input packets arrive at an optical network unit (ONU) according to a Poisson process from several types of users. We use a continuous time queueing model in order to find the mean packet delay and the mean cycle time of an arbitrary packet. We obtain the closed form solution for the mean packet delay of the proposed gated polling system with a two-stage queue. We obtain another result on the mean packet delay by solving a system of linear equations derived from the moments of the queue length distribution. We give some numerical results to investigate the delay performances for the symmetric polling system with statistically identical stations. In addition, we compare numerical results on the closed form solution with numerical results on a system of linear equations.     

Improving TCP performance for vertical handover in heterogeneous wireless networks

The incorporation of wireless local area networks (WLANs) into existing cellular networks as supplementary access technologies has become an issue of great interest. However, vertical handover (VHO), which allows users to roam between a WLAN and a cellular network, causes an abrupt change in certain link characteristics such as the round trip time and data rate. Owing to such changes, reordering problem and premature timeout occur and trigger unnecessarily fast retransmission during VHO, causing throughput degradation. Thus, we propose a new transmission control protocol (TCP) mechanism, which resolves the reordering problem by suppressing unnecessary retransmission caused by spurious duplicate acknowledgments (dupacks) incurred because of the reordering problem, and prevents premature timeout by employing an adaptive retransmission timer. We analytically investigate the throughput of our proposed TCP scheme. The numerical and simulation results show that our proposed TCP performs better in terms of throughput than other schemes appearing in the literature. Copyright © 2009 John Wiley & Sons, Ltd.     

POS信号中IP包提取的设计及实现

针对目前广泛应用的POS技术,文章主要研究了POS信号中PPP／HDLC,LAPS／HDLC,SDL三种映射协议的封装格式及映射方式,提出了从POS信号中提取出IP数据包的方法,并用软件编程实现。