无线多媒体网络中一种基于测量网络状态的动态呼叫接纳控制算法

提出了一种无线多媒体网络中基于测量网络状态的动态呼叫接纳控制算法.它区分了实时和非实时业务,在网络带宽资源不足时可通过降低非实时业务带宽确保实时业务呼叫连接的可靠性;还可根据当前网络状况调整预留带宽大小,使小区实时业务切换呼叫掉线率低于设定的门限值.大量仿真结果显示该算法具有低实时业务切换呼叫掉线率和与固定预留方案相当的带宽利用率,而只以略高的新呼叫阻塞率为代价,适合各种不同概率发生时实际应用的情况.     

Energy efficient and QoS based routing protocol for wireless sensor networks

The increasing demand for real-time applications in Wireless Sensor Networks (WSNs) has made the Quality of Service (QoS) based communication protocols an interesting and hot research topic. Satisfying Quality of Service (QoS) requirements (e.g. bandwidth and delay constraints) for the different QoS based applications of WSNs raises significant challenges. More precisely, the networking protocols need to cope up with energy constraints, while providing precise QoS guarantee. Therefore, enabling QoS applications in sensor networks requires energy and QoS awareness in different layers of the protocol stack. In many of these applications (such as multimedia applications, or real-time and mission critical applications), the network traffic is mixed of delay sensitive and delay tolerant traffic. Hence, QoS routing becomes an important issue. In this paper, we propose an Energy Efficient and QoS aware multipath routing protocol (abbreviated shortly as EQSR) that maximizes the network lifetime through balancing energy consumption across multiple nodes, uses the concept of service differentiation to allow delay sensitive traffic to reach the sink node within an acceptable delay, reduces the end to end delay through spreading out the traffic across multiple paths, and increases the throughput through introducing data redundancy. EQSR uses the residual energy, node available buffer size, and Signal-to-Noise Ratio (SNR) to predict the best next hop through the paths construction phase. Based on the concept of service differentiation, EQSR protocol employs a queuing model to handle both real-time and non-real-time traffic.     

A cross-layer elastic CAC and holistic opportunistic scheduling for QoS support in WiMAX

QoS provisioning is an important issue in the deployment of broadband wireless access networks with real-time and non-real-time traffic integration. An opportunistic MAC (OMAC) combines cross-layer design features with opportunistic scheduling scheme to achieve high system utilization while providing QoS support to various applications. A single scheduling algorithm cannot guarantee all the QoS requirements of traffics without the support of a suitable CAC and vice versa. In this paper, we propose a cross-layer MAC scheduling framework and a corresponding opportunistic scheduling algorithm in tandem with the CAC algorithm to support QoS in WiMAX point-to-multipoint (PMP) networks. Extensive experimental simulations have been carried out to evaluate the performance of our proposal. The simulation results show that our proposed solution can improve the performance of WiMAX networks in terms of packet delay, packet loss rate and throughput. The proposed CAC scheme can guarantee the admitted connections to meet their QoS requirements.     

An intelligent scheduling system using fuzzy logic controller for management of services in WiMAX networks

The appearance of media applications with high bandwidth and quality of service requirements has made a significant impact in telecommunications technology. In this direction, the IEEE802.16 has defined wireless access systems called WiMAX. These systems provide high-speed communications over a long distance. For this purpose some service classes with QoS requirements are defined; but the QoS scheduler is not standardized in IEEE802.16. The scheduling mechanism has a significant effect on the performance of WiMAX systems for use of bandwidth and radio resources. Some scheduling algorithms have been introduced by researchers; but they only provide some limited aspects of QoS. An intelligent decision support system is therefore necessary for scheduling. In this paper a fuzzy based scheduling system is proposed for compounds of real-time and non-real-time polling services which provide QoS requirements and fairness in dynamic conditions. A series of simulation experiments have been carried out to evaluate the performance of the proposed scheduling algorithm in terms of latency and throughput QoS parameters. The results show that the proposed method performs effectively regarding both of these criteria and achieves proportional system performance and fairness among different types of traffic.     

An efficient bandwidth allocation algorithm for real-time VBR stream transmission under IEEE 802.16 wireless networks

This paper investigates variable rate control strategies for real-time multimedia variable bit rate (VBR) services over IEEE 802.16 broadband wireless networks. A data rate control mechanism is derived for the case where the uplink channel provides real-time services and the traffic rate parameter remains constant. This paper shows that the common queuing scheduling algorithms have some bandwidth allocation fairness problems for the real-time polling service (rtPS) in the MAC layer. In other words, the use of a VBR for the rtPS by a WiMAX system results in additional access latency jitter and bandwidth allocation disorder in the transmitted multimedia streams during the regular time interval polling of subscribe stations (SSs) for the contention bandwidth request period. However, the proposed scheduling algorithm solves these SSs contending with bandwidth resource allocation problems based on an extended rtPS (ertPS) of quality-of-service (QoS) pre-programming for a ranging response non-contention polling period. The adopted bandwidth allocation of max–min fairness queue scheduling uses a time constraint condition to transmit real-time multimedia VBR streaming in an IEEE 802.16 broadband wireless environment. In addition, we use the ns-2 simulation tool to compare the capacity of multimedia VBR stream and show that the proposed ertPS scheduling algorithm outperforms other rtPS scheduling algorithms.     

一种适用于宽带无线多媒体网络的上行带宽分配方案

提出了一种适用于宽带无线多媒体网络的上行无线带宽分配方案。该方案将业务数据分为3种类型,即实时恒定速率业务、恒定变速率业务、非实时业务,针对不同业务对时延和带宽的不同需求,采取不同的方法获取上行带宽,较好地解决了多业务并发时的上行带宽分配问题,较传统技术提高了带宽利用率,减少了协议开销和传输时延。在详细描述算法的基础上,建立了对应的仿真系统对算法进行了验证。     

Above packet level admission control and bandwidth allocation for IEEE 802.16 wireless MAN

IEEE 802.16 wireless Metropolitan Area Network (MAN) is expected to revolutionize the broadband wireless access technology. Efficient resource management is essential in providing scalability in such large IEEE 802.16-based wireless network and Quality of Service (QoS) for multimedia applications (VoIP, MPEG, FTP, WWW) is usually achieved by appropriate classification of scheduling services and grant/request mechanism. In this paper, we firstly discuss the QoS issue in IEEE 802.16 wireless MANs and propose a dynamic admission control scheme for scheduling services defined in the 802.16 specification. The proposed scheme provides the highest priority for Unsolicited Grant Service (UGS) connections and maximizes the bandwidth utilization by employing bandwidth borrowing and degradation. We develop an approximate analytical model to evaluate the system performance by assuming that the traffic processes of all scheduling services are Poisson processes. In fact, the self-similarity of non-voice traffic makes its traffic process far from Poisson process and should be modeled by Poisson Pareto Burst Process (PPBP). Therefore, in the later part of the paper, we analyze upper bound blocking probabilities of all scheduling services above the packet level using PPBP model for fractal traffic and Gaussian model for aggregated traffic in large wireless network as well as using the Chernoff bound method. Based on the analytical results, we give another admission control and bandwidth allocation mechanism above the packet level so as to minimize the blocking probability of each type of service in IEEE 802.16 wireless MAN. Analytical and simulation results are obtained and compared to demonstrate the effectiveness of proposed schemes and validate our analytical models.     

A real-time protocol for the Internet based on the least mean square algorithm

Generally, real-time applications based on the User Datagram Protocol (UDP) generate large volumes of data and are not sensitive to network congestion. In contrast, Transmission Control Protocol (TCP) traffic is considered "well-behaved" because it prevents the network becoming congested by means of closed-loop control of packet-loss and round-trip-time. The integration of both sorts of traffic is a complex problem, and depends on solutions such as admission control that have not yet been deployed on the Internet. Moreover, the problem of quality-of-service (QoS) and resource allocation is extremely relevant from the point of view of convergence of streaming media and data transmission on the Internet. In this paper an adaptive real-time protocol based on the least mean square (LMS) algorithm is proposed to estimate the application UDP bandwidth in order to reduce the quadratic error between the packet loss and a target. Moreover, the LMS algorithm is also applied to make sure that the reduction in the average bandwidth allocated to each TCP process will not be higher than a given percentage of the average bandwidth allocated before the beginning of the UDP application.     

Investigation of the M2/G2/1/∞,N queue with restricted admission of priority customers and its application to HSDPA mobile systems

This paper investigates a queuing system for QoS optimization of multimedia traffic consisting of aggregated streams with diverse QoS requirements transmitted to a mobile terminal over a common downlink shared channel. The queuing system, proposed for buffer management of aggregated single-user traffic in the base station of High-Speed Downlink Packet Access (HSDPA), allows for optimum loss/delay/jitter performance for end-user multimedia traffic with delay-tolerant non-real-time streams and partially loss tolerant real-time streams. In the queuing system, the real-time stream has non-preemptive priority in service but the number of the packets in the system is restricted by a constant. The non-real-time stream has no service priority but is allowed unlimited access to the system. Both types of packets arrive in the stationary Poisson flow. Service times follow general distribution depending on the packet type. Stability condition for the model is derived. Queue length distribution for both types of customers is calculated at arbitrary epochs and service completion epochs. Loss probability for priority packets is computed. Waiting time distribution in terms of Laplace–Stieltjes transform is obtained for both types of packets. Mean waiting time and jitter are computed. Numerical examples presented demonstrate the effectiveness of the queuing system for QoS optimization of buffered end-user multimedia traffic with aggregated real-time and non-real-time streams.     

Embedded fuzzy expert system for Adaptive Weighted Fair Queueing

This paper introduces an embedded fuzzy expert system for Adaptive Weighted Fair Queueing (AWFQ) located in the network traffic router to update weights for output queues. WFQ algorithm allows differentiated service for traffic classes according to Quality of Service (QoS) requirements. Link sharing and packet scheduling methods are the most critical factors when guaranteeing QoS. There are many different scheduling mechanisms but adequate and adaptive QoS aware scheduling solutions are still in a phase of development due to the rapid growth of multimedia in the Internet. The proposed AWFQ model in this work simplifies the link sharing to two service classes: one for UDP and another for TCP. The implementation of the model is based on adaptive change of weight coefficients that determine the amount of allowed bandwidth for the service class. New weight coefficients are calculated periodically on routers according to developed embedded fuzzy expert system. It is shown through simulations that the AWFQ model is more stable and reacts faster to different traffic states than the traditional WFQ scheduler. The embedded expert system adjusts the weights of AWFQ with two parameters that are based on the share of the UDP and TCP input traffic data rate and the change of the share of the UDP and TCP input data rate.     

An Admission Control Scheme Based on Online Measurement for VBR Video Streams Over Wireless Home Networks

This paper presents an online measurement-based admission control scheme on the basis that the aggregate VBR video traffic is lognormally distributed. The proposed scheme consists of two components: measurement process and admission decision. The measurement process applies a linear Kalman filter to estimate statistical parameters of aggregate VBR video traffic. The estimated statistical parameters are used to calculate the effective bandwidth for admission decision. Variable bit rate (VBR) video traffic with high data rate is expected to occupy a dominant proportion of bandwidth for future wireless broadband home networks. To guarantee quality-of-service (QoS) of such VBR video streams, while achieving a high level of channel utilization, an efficient admission control scheme is urgently required, especially for emerging wireless multimedia indoor services, such as HDTV, online video game, etc. The proposed scheme is computationally efficient and accurate without much prior traffic information. Simulation results verify its effectiveness and show that it performs well for both a small number of connections and a large number of connections.     

A new fast friendly window-based congestion control for real-time streaming media transmission

1 Introduction In the current Internet, not all applications use TCP and they do not follow the same concept of fairly sharing the available bandwidth. The rapid growing of real-time streaming media applications will bring much UDP traffic without integrating TCP compatible congestion control mechanism into Internet. It threats the quality of service (QoS) of real-time applications and the stability of the current Internet. For this reason, it is desirable to define appropriate rate rule…     

Two efficient packet aggregation mechanisms and QoS support in a slotted dual bus optical ring network

In this paper, a novel approach for efficiently supporting IP packets directly into a slotted optical wavelength-division-multiplexing (WDM) layer with several quality of service (QoS) requirements is presented and analyzed. The approach is based on two main features. First, an aggregation cycle is performed at fixed time intervals by assembling several IP packets into a single macro-packet of fixed size, called an aggregate packet. Second, since IP packets have variable size, the aggregation process may allow or not the segmentation of an IP packet if it does not fit into the remaining gap in the aggregate packet. As a key element of our proposition, an efficient QoS support access mechanism is presented. The new QoS control performs aggregation in a loop manner by always beginning the aggregation cycle with the highest priority class. The aggregation cycle ends if the aggregate packet cannot accommodate more IP packets, or if the lowest priority class is reached. We introduce two analytical models that allow us to evaluate the effectiveness of the aggregation technique with and without segmentation. On the other hand, a third analytical model is presented to analyze the standard case (where no aggregation is performed), and comparisons between the three models are carried out. The aggregation models are validated by simulations, and the effect of self-similarity is also analyzed. The application of the proposed approach takes place in a slotted dual bus optical ring network (SDBORN), where we prove that a good fairness and high bandwidth efficiency are achieved, and that only two QoS classes (real-time and non-real-time classes) at the access interface (IP domain) are sufficient in order to fulfill the strict delay requirements of real-time data traffic.     

An efficient joint channel assignment and QoS routing protocol for IEEE 802.11 multi-radio multi-channel wireless mesh networks

With the emerging of video, voice over IP (VoIP) and other real-time multimedia services, more and more people pay attention to quality of service (QoS) issues in terms of the bandwidth, delay and jitter, etc. As one effective way of broadband wireless access, it has become imperative for wireless mesh networks (WMNs) to provide QoS guarantee. Existing works mostly modify QoS architecture dedicated for ad hoc or sensor networks, and focus on single radio and single channel case. Meanwhile, they study the QoS routing or MAC protocol from view of isolated layer. In this paper, we propose a novel cross-layer QoS-aware routing protocol on OLSR (CLQ-OLSR) to support real-time multimedia communication by efficiently exploiting multi-radio and multi-channel method. By constructing multi-layer virtual logical mapping over physical topology, we implement two sets of routing mechanisms, physical modified OLSR protocol (M-OLSR) and logical routing, to accommodate network traffic. The proposed CLQ-OLSR is based on a distributed bandwidth estimation scheme, implemented at each node for estimating the available bandwidth on each associated channel. By piggybacking the bandwidth information in HELLO and topology control (TC) messages, each node disseminates information of topology and available bandwidth to other nodes in the whole network in an efficient way. From topology and bandwidth information, the optimized path can be identified. Finally, we conduct extensive simulation to verify the performance of CLQ-OLSR in different scenarios on QualNet platform. The results demonstrate that our proposed CLQ-OLSR outperforms single radio OLSR, multi-radio OLSR and OLSR with differentiated services (DiffServ) in terms of network aggregate throughput, end-to-end packet delivery ratio, delay and delay jitter with reasonable message overheads and hardware costs. In particular, the network aggregate throughput for CLQ-OLSR can almost be improved by 300% compared with the single radio case.     

基于区分服务的自适应跨层调度算法

中高速传感器网络中不同业务对QoS有不同的要求。针对该情况,引入区分服务的思想,提出一种适合混合业务的多元参数自适应跨层调度算法。该算法根据不同的业务动态调整时延补偿因子和吞吐量补偿因子,使实时业务能满足时延较小的要求,非实时业务能满足吞吐量较大的要求。仿真结果表明,该调度算法可以灵活地在系统效率和用户服务质量满意度之间取得折中,保证不同类型业务用户间的公平性。     

异构网络中保障业务QoS的TCP协议研究

当TCP协议应用于异构网络时业务的QoS无法得到保障,具体而言,一方面TCP协议与无线网络适配性较差,导致网络丢包率升高、吞吐量下降;另一方面,TCP协议对于业务不区分优先级,不能满足高优先级业务的需求。因此,文章提出了异构网络中基于捕食模型的保障业务QoS的TCP协议(QoS - Internet Predator based on Prey Model,Q-IPPM)。Q-IPPM算法不仅会根据异构网络的带宽改进TCP协议的拥塞控制架构,还根据不同业务的负载状况和优先级控制不同业务流量占比。实验结果表明,Q-IPPM算法不仅可以提显著提高异构网络的吞吐量,降低网络丢包率,还能够根据业务优先级和负载状况将带宽“按需分配”给不同业务,从而保障了异构网络中业务的QoS。     

DSMAC:一种适于无线多媒体传感器网络的信道接入协议

多媒体传感器网络作为一种多媒体信息获取和处理方式,已在军事、民用及商业领域中显示出广阔的应用前景.信道接入协议能否高效地使用无线信道是保证无线多媒体传感器网络通信的最关键的因素之一.分析支持多媒体业务传输的无线传感器网络信道接入协议的要求,提出适于多媒体传感器网络提供区分服务的信道接入协议--DSMAC(different service medium access control),对实时业务与非实时业务实现了区分服务,在信道接入帧内的随机竞争期实现突发业务及时接入,支持突发多媒体业务实时传输,并提出了多信道簇间传输方式,避免了隐终端冲突.最后,对协议的服务区分、实时性、吞吐量以及能量有效性等性能进行了仿真实验,验证了其优良性能.     

QoS-aware bandwidth allocation and admission control in IEEE 802.16 broadband wireless access networks: A non-cooperative game theoretic approach

In this paper, we propose an adaptive bandwidth allocation and admission control mechanism based on game theory for IEEE 802.16 broadband wireless networks. A non-cooperative two-person non-zero-sum game is formulated where the base station and a new connection are the players of this game. The solution of the game formulation provides not only the decision on accepting or rejecting a connection, but also the amount of bandwidth allocated to a new connection (if admitted). A queueing model considering adaptive modulation and coding in the physical layer is used to analyze quality of service (QoS) performances, namely, the delay performance for real-time and the throughput performance for non-real-time polling services and best effort service. This queueing model is used by the proposed bandwidth allocation and admission control mechanism to ensure that the utilities for both the base station and the new connection are maximized. The performance of the proposed scheme is evaluated by simulation and compared with that of each of the traditional admission control with static and adaptive bandwidth allocation schemes.     

数字家庭网关上网络QoS算法的研究

家庭网络中数字家电种类繁多,而且随着多媒体设备越来越多、功能越来越强,对服务质量（QoS）管理提出了更高的要求。现有的QoS架构中存在很多流量管理方面的问题,如低优先级流量饿死、拥塞、流量优先级指定等。通过分析比较各种QoS架构的优缺点,提出一种数字家庭网关上的网络QoS算法。采用带宽控制、准入控制、优先级验证等机制,从网络流量管理角度解决QoS问题,并通过模拟分析证实了该QoS算法的有效性。     

Dynamic bandwidth allocation for 3G wireless systems—A fuzzy approach

3G Wireless systems are to support multiple classes of traffic with widely different characteristics and quality of service (QoS) requirements. A major challenge in this system is to guarantee the promised QoS for the admitted users, while maximizing the resource allocation through dynamic resource sharing. In the case of multimedia call, each of the services has its own distinct QoS requirements concerning probability of blocking (P_B), service access delay (SAD), and access delay variation (ADV). The 3G wireless system attempts to deliver the required QoS by allocating appropriate resources (e.g. bandwidth, buffers), and bandwidth allocation is a key in achieving this. Dynamic bandwidth allocation policies reported so far in the literature deal with audio source only. They do not consider QoS requirements. In this work, a fuzzy logic (FL)-based dynamic bandwidth allocation algorithm for multimedia services with multiple QoS (P_B, SAD, ADV, and the arrival rate) requirements are presented and analyzed. Here, each service can declare a range of acceptable QoS levels (e.g. high, medium, and low). As QoS demand varies, the proposed algorithm allocates the best possible bandwidth to each of the services. This maximizes the utilization and fair distribution of resources. The proposed allocation method is validated in a variety of scenarios. The results show that the required QoS can be obtained by appropriately tuning the fuzzy logic controller (FLC).