To coalesce or not to coalesce

System performance of Gigabit network hosts can be severely degraded due to interrupt overhead caused by heavy incoming traffic. One of the most popular solutions to mitigate such overhead is interrupt coalescing in which a single interrupt is generated for multiple incoming packets. This is opposed to normal interruption in which an interrupt is generated for every incoming packet. In this paper we investigate the performance of interrupt coalescing analytically and compare it with that of normal interruption. We consider two types of coalescing (viz. count-based and time-based). The system performance is studied in terms of throughput, CPU availability for user applications, latency and packet loss.     

基于CTMC和状态空间模型的宽带无线接入网的QoS性能研究

为了实现同一地域范围内的众多用户在有限带宽条件下提出的高QoS要求,本文对基于IEEE 802.16标准的宽带无线接入网中数据包级QoS（Quality of Service）性能进行了研究.具体做法是,首先采用批马尔可夫到达过程（BMAP,Batch Markov Arrival Process）和连续时间马尔科夫链（CTMC,Continuous Time Markov Chain）对到达过程和流量源进行建模,得到更符合实际和更准确的排队模型;然后基于状态空间,对一个无线接入网络系统进行建模,通过对得到的系统模型并结合前面得到的排队模型的深入分析,从而获得该模型下的各项QoS性能指标,如平均队列长度、丢包率、队列吞吐量和平均包时延.仿真实验结果表明,本文提出的算法模型相比于其他典型的算法模型,能够使得各项QoS性能指标有较大的改善和提高.     

Performance analysis of k-fold multicast networks

Multicast involves transmitting information from a single source to multiple destinations, and is an important operation in high-performance networks. A k-fold multicast network was recently proposed as a cost-effective solution to providing better quality-of-service functions in supporting real-world multicast applications. To give a quantitative basis for network designers to determine the suitable value of system parameter k under different traffic loads, in this paper, we propose an analytical model for the performance of k-fold multicast networks under Poisson traffic. We first give the stationary distribution of network states, and then derive the throughput and blocking probability of the network. We also conduct extensive simulations to validate the analytical model, and the results show that the analytical model is very accurate under the assumptions made. The analytical and simulation results reveal that by increasing the fold of the network, network throughput increases very fast when the fanouts of multicast connections are relatively small, compared with the network size.     

Hub‐polling‐based IEEE 802.11 PCF with integrated QoS differentiation

IEEE 802.11 is one of the most influential wireless LAN (WLAN) standards. Point coordination function (PCF) is its medium access control (MAC) protocol with real‐time traffic (rt‐traffic) quality‐of‐service (QoS) guarantees. In PCF, it is very likely that non‐real‐time traffic (nrt‐traffic) will use the contention free period (CFP) that should be dedicated to traffic having higher priority such as rt‐traffic. Therefore, a modified PCF protocol called MPCF, which is based on hub polling and an integrated QoS differentiation, is presented in this paper. With the integrated QoS differentiation, MPCF can prioritize bandwidth requests according to service classes and QoS requirements. With hub polling, MPCF can reduce the bandwidth for control frames and improve the network throughput. A simple and accurate analytical model is derived and presented in this paper to calculate the system throughput of MPCF. Simulation results show that MPCF protocol is much better than PCF in terms of system capacity and rt‐traffic QoS guarantees. Copyright © 2008 John Wiley & Sons, Ltd.     

QoS‐based radio network dimensioning for LTE networks with heavy real‐time traffic

Applications of video streaming and real‐time gaming, which generate large amounts of real‐time traffic in the network, are expected to gain considerable popularity in Long Term Evolution networks. Maintaining the QoS such as packet delay, packet loss ratio, median, and cell border throughput requirements in networks dominated by real time traffic, is critical. The existing dimensioning methodology does not consider QoS parameters of real‐time traffic in network dimensioning. Moreover, exhaustive and time‐consuming simulations are normally required to evaluate the performance and QoS of real‐time services. To overcome this problem, we propose an improved radio network dimensioning framework that considers the QoS of real‐time traffic in network dimensioning. In this framework, an analytical model is proposed to evaluate the capacity and performance of real‐time traffic dominant Long Term Evolution networks. The proposed framework provides a fast and accurate means of finding the trade‐off between system load, packet delay, packet loss ratio, required median, and cell border throughput. It also provides network operators with an analytical means for obtaining the minimum number of sites required by jointly considering coverage, capacity and QoS requirements. The accuracy of the proposed model is validated through simulations. Copyright © 2012 John Wiley & Sons, Ltd.     

Wireless network coding in slotted aloha with two-hop unbalanced traffic

This paper deals with two representative unbalanced traffic cases for two-hop wireless relay access systems employing network coding and a slotted ALOHA protocol. Network coding is a recent and highly regarded technology for capacity enhancement with multiple unicast and multisource multicast networks. We have analyzed the performance of network coding on a two-hop wireless relay access system employing the slotted ALOHA under a balanced bidirectional traffic. The relay nodes will generally undergo this unbalanced multidirectional traffic but the impact of this unbalanced traffic on network coding has not been analyzed. This paper provides closed-form expressions for the throughput and packet delay for two-hop unbalanced bidirectional traffic cases both with and without network coding even if the buffers on nodes are unsaturated. The analytical results are mainly derived by solving queueing systems for the buffer behavior at the relay node. The results show that the transmission probability of the relay node is a design parameter that is crucial to maximizing the achievable throughput of wireless network coding in slotted ALOHA on two-hop unbalanced traffic cases. Furthermore, we show that the throughput is enhanced even if the traffic at the relay node is unbalanced.     

Dimensioning of the LTE access network

This paper proposes efficient analytical models to dimension the necessary transport bandwidths for the Long Term Evolution (LTE) access network satisfying the QoS targets required by different services. In this paper, we consider two major traffic types: elastic traffic and real time traffic. For each type of traffic, individual dimensioning models are proposed for both the S1 interface and the X2 interface. For elastic traffic the dimensioning models are based on the Processor Sharing models; while for real time traffic the dimensioning models are based on the fundamental queuing models. For validating these analytical dimensioning models, a developed LTE system simulation model is used. Extensive simulations are performed for various traffic and network scenarios. The analytical results derived from the proposed dimensioning models are compared with the simulation results. The presented results demonstrate that the proposed analytical models can appropriately estimate the required performances for different service classes and priorities. Hence they are suitable to be used for dimensioning of the LTE access network with different traffic and network conditions.     

RQRP protocol for video delivery over IP

The Digital Audio‐Visual Council has adopted the Request/Reply (RQRP) protocol, proposed by one of the authors, for the delivery mechanism of MPEG video streams. In this paper, we investigate the network characteristics of the RQRP protocol and analyse the protocol's performance via both simulation as well as actual experimental results. In this simulation, the RQRP protocol was mathematically an ideal model first and later, a feedback control system. Simulation results showed that, for both models, the network traffic is able to follow the playout rate at the receiver. In the case of the latter, which involves a simpler implementation, oscillation in network traffic is observed. A video‐on‐demand (VoD) system using the RQRP protocol was developed and experiments were performed. The results obtained are consistent with the simulation results. Copyright © 2001 John Wiley & Sons, Ltd.     

New cross-Layer design approach to ad hoc networks under Rayleigh fading

We propose a new cross-layer design employing the predictability of Rayleigh channels to improve the performance of ad hoc networks. In addition, we propose a Markov model for Rayleigh channels and an innovative Markov model for IEEE 802.11 distributed coordination function. By combining these two models, we derive the theoretical expressions for network throughput, packet processing rate, packet loss probability, and average packet delay under Rayleigh channels. The simulation of the proposed cross-layer design is also carried out. It is shown that the new approach improves the network throughput, reduces unnecessary packet transmissions and therefore reduces packets lost. We also show that there is a close match between the analytical and the simulation results which confirms the validity of the analytical models.     

Saturation Throughput Analysis of IEEE 802.11e EDCA Through Analytical Model

The IEEE 802.11e EDCA is designed to provide quality of support for real time applications with stringent latency and throughput requirements. Theoretical frameworks for analysis of throughput performance of wireless LAN employing exponential back-off exist extensively. Several models rely on simplification assumptions that preclude their direct applicability to the enhanced distributed coordination access (EDCA) which uses heterogeneous protocol parameters, while other models are exceedingly complex to analyze. In this paper, a tractable analytical model is proposed for saturation throughput of the IEEE 802.11e EDCA. The prioritization through channel access parameters including the AIFS and contention window is catered for within a three dimensional Markov chain. The integration of back-off counter freezing and retry limit enhance the models precision. Its validation is done by simulation on NS-2. Practical applicability of the model is established based on accuracy and computational efficiency. The model is utilized for throughput analysis of the EDCA under saturated traffic loads.     

Performance Analysis of Network Coding Based Two-Way Relay Wireless Networks Deploying IEEE 802.11

In this paper, we investigate the performance analysis of the IEEE 802.11 DCF protocol at the data link layer. We analyze the impact of network coding in saturated and non-saturated traffic conditions. The cross-layer analytical framework is presented in analyzing the performance of the encode-and-forward (EF) relaying wireless networks. This situation is employed at the physical layer under the conditions of non-saturated traffic and finite-length queue at the data link layer. First, a model of a two-hop EF relaying wireless channel is proposed as an equivalent extend multi-dimensional Markovian state transition model in queuing analysis. Then, the performance in terms of queuing delay, throughput and packet loss rate are derived. We provide closed-form expressions for the delay and throughput of two-hop unbalanced bidirectional traffic cases both with and without network coding. We consider the buffers on nodes are unsaturated. The analytical results are mainly derived by solving queuing systems for the buffer behavior at the relay node. To overcome the hidden node problem in multi hop wireless networks, we develop a useful mathematical model. Both models have been evaluated through simulations and simulation results show good agreement with the analytical results.     

Performance analysis and comparison of burst transmission schemes in unsaturated 802.11e WLANs

Contention free bursting (CFB) and block acknowledgement (BACK) are two innovative burst transmission schemes specified in the IEEE 802.11e standard for reducing the contention overheads and further improving the channel utilization of wireless local area networks (WLANs). Existing studies on performance analysis of the CFB and BACK schemes have been primarily focused on the system throughput and have not taken into account the realistic factors, such as unsaturated traffic loads and finite buffer capacity. To fill this gap, this paper proposes a new and comprehensive analytical model for evaluating the Quality‐of‐Service (QoS) metrics including throughput, end‐to‐end delay, and frame loss probability of both burst transmission schemes under unsaturated traffic conditions. The proposed model is validated through extensive simulation experiments and then is used to conduct performance analysis and comparison of the burst transmission schemes under various working conditions. The analytical results reveal that (1) both CFB and BACK schemes can substantially improve the QoS performance; (2) BACK scheme outperforms the CFB scheme when the transmission opportunity (TXOP) limit exceeds a threshold; (3) the analytical model can be used to identify the optimal configuration of system parameters for the burst transmission schemes subject to QoS constraints. Copyright © 2010 John Wiley & Sons, Ltd.     

An approximate analysis of shared‐buffer channel‐grouped ATM switches under imbalanced traffic

Grouping output channels in a shared‐buffer ATM switch has shown to provide great saving in buffer space and better throughput under uniform traffic. However, uniform traffic does not represent a realistic view of traffic patterns in real systems. In this paper, we extend the queuing analysis of shared‐buffer channel‐grouped (SBCG) ATM switches under imbalanced traffic, as it better represent real‐life situations. The study focuses on the impact of the grouping factor and other key switch design parameters on the performance of such switches as compared to the unichannel allocation scheme in terms of cell loss probability, throughput, mean cell delay and buffer occupancy. Numerical results from both the analytical model and simulation are presented, and the accuracy of the analysis is presented. Copyright © 2005 John Wiley & Sons, Ltd.     

A Traffic Scheduling Technique for Metropolitan Area Gateways

In the future, metropolitan area networks (MAN's) will provide high bandwidth interconnection between local access networks in high density office, industrial, and residential settings. In these systems, the metropolitan area gateway (MAG) is responsible for coordinating the flow of traffic in and out of the metropolitan subnetwork. In certain environments, it is expected that the traffic will possess distinct characteristics. In this paper, a technique called SWIFT is proposed which efficiently schedules these traffic flows when the local access network is based upon broadband CATV-type cable technology. SWIFT satisfies the important constraint that it is compatible with existing CSMA/CD packet data network adapters which means that it may be implemented in previously installed systems. In this paper, a throughput model is given for the proposed technique. Also, an analytic model is given which approximates the mean remote delay when the traffic is moderately to heavily remote-bound. The performance results presented indicate that a system operating the SWIFT algorithm can achieve much reduced delays at higher throughput than would otherwise be possible.     

Impact of bursty error rates on the performance of wireless local area network (WLAN)

With an increasing popularity of DCF based wireless LAN, the modeling of 802.11 distributed coordination function (DCF) has attracted lots of research attention. Existing analysis of 802.11 DCF has been focused on the determination of the throughput and the packet delay under saturated traffic and ideal channel conditions. Although some recent papers address the saturated performance under a simple uniform error model, they can hardly capture the impact of bursty characteristics of wireless fading on the performance of 802.11 DCF. This paper presents exact formulae for the throughput and the delay in DCF for various traffic conditions when either saturated or unsaturated traffic load is present. A two-state Markov channel model is incorporated to present the bursty characteristics of channel errors. With our analysis, the impact of bursty channel error on unsuccessful transmission probability and the DCF performance can be determined. The results of our analytical framework reveal that the four-way handshaking scheme does not improve throughput substantially for light traffic load. However, for heavy traffic load, the four-way handshaking scheme is advantageous as compared to the basic access scheme. Also, extensive simulation is done to substantiate the accuracy of our analytical model.     

Performance analysis and optimization of best‐effort service in IEEE 802.16 networks

The IEEE 802.16‐based WiMAX technology has great potential for the fourth‐generation mobile networks. Some of its service classes use the contention‐based broadcast polling mechanism to request resources. In this paper, we investigate the performance experienced by these services when the network is unsaturated. In particular, we model each subscriber station as an M/G/1 queue where the service time is determined by the parameters of the network configuration and the binary exponential backoff contention resolution algorithm. We develop a fixed‐point analysis to derive analytical expressions for network throughput and packet access delay. The accuracy of the analytical model is validated by comparing it with simulation over a wide range of operating conditions. The implications of various different parameter configurations on the performance are investigated using the analytical model. Moreover, we show that the model can be degenerated to the saturated condition. The utility of both the unsaturated and saturated models is further demonstrated by finding the optimal set of parameter values that maximize the network throughput. Copyright © 2011 John Wiley & Sons, Ltd.     

A new analytical model for the CQ switch throughput calculation under the bursty traffic

In this paper we propose a new analytical iterative method for the throughput calculation of the Crosspoint Queued (CQ) switch with a random scheduling algorithm under the bursty traffic model. This method is verified by comparing it with the simulation results, which shows a very good match. To the authors’ knowledge, this is the first analytical method for the throughput calculation of such a switch for the bursty traffic model.     

Giving applications access to Gb/s networking

Operating systems (OSs) used in high-speed networks must reduce copying to deliver maximal throughput to applications and must deliver this throughput while preserving the capability of the host to perform applications processing. One way to reduce copying by enabling data transfers directly to and from buffers located in application-process address spaces is presented. The method has been demonstrated experimentally and is shown to deliver high throughputs. OS support must also include scheduling, which allows bandwidth-allocated traffic streams to be delivered. The implementation described provides resource scheduling for network users, and considerably reduces interrupt overhead