基于跨层公平性准则的自适应无线资源分配方法

该文提出了一种新的公平性准则,它既适用于实时业务又适用于非实时业务,是一种对物理层和MAC层联合优化的跨层公平性准则。基于该准则提出了一种新的跨层自适应资源分配方案。仿真结果显示,该方案不仅可以较好地满足用户提出的QoS要求,而且可以保证用户间服务质量满意度的公平性。     

基于跨层公平性准则的自适应无线资源分配方法

该文提出了一种新的公平性准则,它既适用于实时业务又适用于非实时业务,是一种对物理层和MAC层联合优化的跨层公平性准则。基于该准则提出了一种新的跨层自适应资源分配方案。仿真结果显示,该方案不仅可以较好地满足用户提出的QoS要求,而且可以保证用户间服务质量满意度的公平性。     

一种适用于多用户OFDM系统下行链路的跨层设计调度算法

该文提出了一种适用于多用户正交频分复用(OFDM)系统下行链路的调度算法,基于跨层结构设计,并分别考虑了媒体接入控制(MAC)层的用户服务质量(QoS)要求、用户公平性、数据包队列状态信息以及物理层的信道状态信息(CSI)和功率约束等。多用户OFDM系统可以通过该调度算法充分利用MAC层和物理层的不同参数特性,在保证用户QoS的同时最大化频谱的利用效率。仿真结果表明,在小区内各个移动用户具有不同的接收SNR的情况下,该算法具有服务质量随信噪比波动平缓、丢包率低、实现复杂度低等特点。     

下行多业务OFDMA系统中基于有效容量的资源分配算法研究

该文对多业务OFDMA系统的下行链路资源分配进行了研究,侧重考虑了实时业务用户的QoS要求,建立2维马尔可夫无线信道模型,采用自适应调制技术、有效容量理论以及有效带宽理论,为实时用户分配资源;并实现了非实时业务用户、尽力而为业务用户的资源分配。仿真结果表明,所提算法保证了下行OFDMA系统吞吐量的同时,在实时业务的延时和丢包率等方面都有一定的优越性。     

延迟容忍网络自适应差错控制方法

根据延迟容忍网络的时延较大、误码率较高等特点,在现有的传输控制层和MAC层差错控制的基础上改进,结合IEEE 802.11 DCF机制的特点,提出一种基于MAC层丢包率的自适应差错控制方案.该方案能有效改善延迟容忍网络的传输时延,满足对时延要求比较敏感的业务的要求.     

MIMO-OFDM中基于业务类型的跨层资源分配研究

提出了一种基于PHY层和MAC层的跨层资源自适应方案。该方案首先把业务类型划分为实时业务和非实时业务,并在此基础上针对业务类型在MAC层对分组进行调度和在PHY层对子载波和功率分配。     

多用户MIMO-OFDMA系统混合业务的跨层分组调度算法

该文提出了一种针对多输入多输出-正交频分多址系统混合业务的跨层分组调度算法。该算法基于物理层的信道状况和媒体接入控制子层用户的排队时延,分别为实时业务用户和非实时业务用户的排队时延构建相应的效用函数,以保障不同业务的服务需求。仿真结果表明:该算法不但能保证实时业务的时延需要,而且能够获得很好的吞吐量,并满足公平性要求。     

无线环境下具有实时约束的主动队列管理机制

实时流业务的超期丢包率是衡量无线网络传输过程服务质量的常用参数,但是该参数并不能反映出具有不同重要度的数据包对视频质量的影响。该文将实时传输流的数据包重要度与超期丢包率结合,提出加权超期丢包率的概念,更加准确地描述丢包与视频质量的关系,在无线环境下提出基于数据包不同重要度的适用于实时约束流的主动队列管理算法,通过主动丢弃数据包以最小化服务过程中实时流的加权超期丢包率。仿真结果表明,相比于传统的队列管理算法和实时视频流滤波器算法,该超期数据包主动丢弃算法能够有效降低加权超期丢包率,提供更好的服务质量,提高大约0.5~1.5 dB的峰值信噪比(PSNR)增益。     

宽带实时VBR业务与尽力而为业务复用系统的性能研究

该文以宽带实时VBR业务与尽力而为业务复用系统且对实时业务采取完全共享接纳策略为背景,以系统平均剩余容量、实时业务丢包率和尽力而为业务平均延时为主要研究对象,通过对多业务排队模型深入分析,导出了几个主要性能指标的计算公式,得出了实时VBR业务丢包率随呼叫级负荷增加并非单调增加的新结论。仿真验证了公式的正确性。     

广播网络中基于补丁流的丢包恢复机制研究

现有的数字广播网络由于没有回传通道,发送端无法知悉传输过程中的丢包状况。接收端处在广播网络的不同位置,常常因处于小区边缘或受障碍物遮挡等原因造成信号减弱,从而导致丢包率提高。该文提出了一种基于pFEC (patching Forward Error Correction,补丁FEC)的丢包恢复机制,来解决单向广播网络的丢包问题。该方法利用蜂窝移动网络的双向信道来传输补丁流,提供自适应的FEC来降低丢包率。这种方式可以在广播业务中为不同位置的用户提供不同的丢包恢复能力。理论建模及仿真结果显示,在蜂窝移动网络丢包率不高的情况下,pFEC机制能够有效应对个别用户突发的丢包,从而提高广播业务整体的可靠性和服务质量。     

基于自相似流量水平分级预测的网络队列调度算法

网络流量的自相似特性会导致网络中数据的突发状态持续,为有效降低网络流量突发引起的队列排队时延和分组丢失率,提高不同优先级业务的传输能力,保障业务服务质量需求,提出了一种基于网络流量自相似特性的队列调度算法——P-DWRR。该算法设计了基于自相似流量水平分级预测结果的动态权值分配方法及服务量子更新方法,并根据业务优先级和队列等待时间确定队列的服务次序,以减小数据分组排队时延,降低分组丢失率。仿真结果表明,P-DWRR算法在满足网络不同业务优先级要求的基础上,降低了数据分组的排队时延、时延抖动和分组丢失率,性能优于DWRR和VDWRR。     

Addressing self-similarity in optical switching networks by means of ant colony optimization

In this work, we propose the use of an Ant Colony Optimization (ACO) algorithm to mitigate packet loss in an optical packet switching network that carries self-similar traffic, which is known to have a great impact in the buffer performance in terms of loss probability as exemplified in this work. By adaptively routing the packets and balancing the network load, we demonstrate by some simulations the effectiveness of this approach when compared with a shortest-path routing scheme, achieving a performance that is comparable to the Poisson traffic scenario in some cases. The proposed algorithm can be used as a viable alternative to traffic shaping techniques.     

Interference management using basestation coordination in broadband wireless access networks

This paper proposes a transmission‐scheduling algorithm for interference management in broadband wireless access networks. The algorithm aims to minimize the cochannel interference using basestation coordination while still maintaining the other quality of service (QoS) requirements such as packet delay, throughput and packet loss. The interference reduction is achieved by avoiding (or minimizing) concurrent transmission of potential dominant interferers. Dynamic slot allocation based on traffic information in other cells/sectors is employed. In order to implement the algorithm in a distributed manner, basestations (BSs) have to exchange traffic information. Both real‐time and non‐real‐time services are considered in this work. Results show that significant reduction in the packet error rate can be achieved without increasing the packet delay at low to medium loading values and with a higher but acceptable packet delay at high loading values. Since ARQ schemes can also be used for packet error rate reduction, we compare the performance of the proposed scheme with that of ARQ. Results indicate that although ARQ is more effective in reducing packet error rate, the proposed algorithm incurs much less packet delay particularly at medium to high loading. Copyright © 2006 John Wiley & Sons, Ltd.     

HSDPA中继系统实时业务调度算法研究

在传统的高速下行链路分组接入（HSDPA,HighSpeedDownlinkPacketAccess）系统中,对于实时业务的调度,主流算法是修正的最大加权时限优先（Modified—LargestWeightDeadlineFirst,M—LWDF）算法。但由于中继的引入,中继用户的延时增加必然会导致中继用户的丢包率增大,从而降低了系统的性能。基于此,本文提出了一种改进的M—LWDF算法,并通过VolP业务对该算法进行了仿真验证。结果表明该算法能够在保证用户QoS要求的前提下,提高系统吞吐量。     

Assessing the accuracy of using aggregated traffic traces in network engineering

Aggregated traffic traces are commonly used in network engineering for QoS or performance parameters evaluation. Many performance models come from such aggregated traces. However, real traffic is a marked point process combining two processes: one for the arrival times of packets and the other for their size in bytes. This paper deals with assessing whether aggregated traces are a good representation of real traffic. Based on the analysis of many traffic traces, and focusing only on loss probability, it is shown that the packet drop probability obtained for the aggregated traffic traces can significantly differ from the real packet drop probability obtained for the real traffic traces. Then, a solution which enables one to obtain correct loss probability based on aggregated traffic traces is proposed by determining the correct aggregation scale and traffic parameters to be applied.     

Variable bit-rate coding of video signals for ATM networks

Statistical characteristics of video signals for video packet coding, are clarified and a variable-bit-rate coding method for asynchronous transfer mode (ATM) networks is described that is capable of compensating for packet loss. ATM capabilities are shown to be greatly affected by delay, delay jitter, and packet loss probability. Packet loss has the greatest influence on picture quality. Packets may be lost either due to random bit error in a cell header or to network control when traffic is congested. A layered coding technique using discrete-cosine transform (DCT) coding is presented which is suitable for packet loss compensation. The influence of packet loss on picture quality is discussed, and decoded pictures with packet loss are shown. The proposed algorithm was verified by computer simulations     

OBS基于回退和信道分级的冲突解决算法

解决突发包的冲突问题是光突发交换网络的关键技术之一。为了降低突发包冲突时丢包率,提出了一种新型的基于信道分级和回退机制的冲突解决算法,该算法考虑突发业务优先级,将信道分成两个级别,有区别地对待高低优先级两种业务类型,并且增加了一部分回退信道作为保护和重发冲突数据包,能够有效地保证高优先级业务的传输可靠性。结果表明,当冲突发生时,网络能根据此时高低优先级业务量的比重配比,自适应地调节两个级别信道的数量,兼顾到低优先级业务的低丢包率,保证了较低的延时率。此算法相比以往的冲突解决算法具有较低的丢包率和相对小的延时率。     

A novel adaptive traffic prediction AQM algorithm

In the Internet, network congestion is becoming an intractable problem. Congestion results in longer delay, drastic jitter and excessive packet losses. As a result, quality of service (QoS) of networks deteriorates, and then the quality of experience (QoE) perceived by end users will not be satisfied. As a powerful supplement of transport layer (i.e. TCP) congestion control, active queue management (AQM) compensates the deficiency of TCP in congestion control. In this paper, a novel adaptive traffic prediction AQM (ATPAQM) algorithm is proposed. ATPAQM operates in two granularities. In coarse granularity, on one hand, it adopts an improved Kalman filtering model to predict traffic; on the other hand, it calculates average packet loss ratio (PLR) every prediction interval. In fine granularity, upon receiving a packet, it regulates packet dropping probability according to the calculated average PLR. Simulation results show that ATPAQM algorithm outperforms other algorithms in queue stability, packet loss ratio and link utilization.     

On Dynamic Optimization of Packet Matching in High-Speed Firewalls

Packet matching plays a critical role in the performance of many network devices and a tremendous amount of research has already been invested to come up with better optimized packet filters. However, most of the related works use deterministic techniques and do not exploit the traffic characteristics in their optimization schemes. In addition, most packet classifiers give no specific consideration for optimizing packet rejection, which is important for many filtering devices like firewalls. Our contribution in this paper is twofold. First, we present a novel algorithm for maximizing early rejection of unwanted flows with minimal impact on other flows. Second, we present a new packet filtering dynamic optimization technique that uses statistical search trees to utilize traffic characteristics and minimize the average packet matching time. The proposed techniques timely adapt to changes in the traffic conditions by performing simple calculations for optimizing the search data structure. Our techniques are practically attractive because they exhibit simple-to-implement and easy-to-deploy algorithms. Our extensive evaluation study using Internet traces shows that the proposed techniques can significantly minimize the packet filtering time with reasonable memory space requirements.     

A new traffic allocation algorithm in Ad hoc networks

~~A new traffic allocation algorithm in Ad hoc networks1. Su Kai-rong, ZHENG Wu,XIAO Shu-cheng, et al. Research on technology of mobile Ad hoc network access. Joural of Chongqing University of Posts and Telecommunications: Natural Science. 2005, 17(5): 61…