Enabling novel premium service classes in DiffServ over MPLS‐enabled network

Network resources dimensioning and traffic engineering influence the quality in provisioned services required by the Expedited Forwarding (EF) traffic in production networks established through DiffServ over MPLS‐enabled network. By modeling EF traffic flows and the excess of network resources reserved for it, we derive the range of delay values which are required to support these flows at DiffServ nodes. This enables us to develop an end‐to‐end (e2e) delay budget‐partitioning mechanism and traffic‐engineering techniques within a framework for supporting new premium QoS levels, which are differentiated based on e2e delay, jitter and loss. This framework enables ingress routers to control EF traffic flow admission and select appropriate routing paths, with the goal of EF traffic balancing, avoiding traffic congestion and getting the most use out of the available network resources through traffic engineering. As a result, this framework should enable Internet service providers to provide three performance levels of EF service class to their customers provided that their network is DiffServ MPLS TE aware. Copyright © 2008 John Wiley & Sons, Ltd.     

Priority switching scheduler

We define a novel core network router scheduling architecture called priority switching scheduler (PSS), to carry and isolate time constrained and elastic traffic flows from best-effort traffic. To date, one possible solution has been to implement a core DiffServ network with standard fair queuing and scheduling mechanisms as proposed in the well-known “A Differentiated Services Code Point (DSCP) for Capacity-Admitted Traffic” from RFC5865. This architecture is one of the most selected solutions by internet service provider for access networks (e.g., customer-premises equipment) and deployed within several performance-enhancing proxies (PEPs) over satellite communications (SATCOM) architectures. In this study, we argue that the proposed standard implementation does not allow to efficiently quantify the reserved capacity for the AF class. By using a novel credit-based shaper mechanism called burst limiting shaper (BLS) to manage the AF class, we show that PSS can provide the same isolation for the time constrained EF class while better quantifying the part allocated to the AF class. PSS operates both when the output link capacity is fixed (e.g., wire links and terrestrial networks) or might vary due to system impairments or weather condition (e.g., wireless or satellite links). We demonstrate the capability of PSS through an emulated SATCOM scenario with variable capacity and show the AF output rate is less dependent on the EF traffic, which improves the quantification of the reserved capacity of AF, without impacting EF traffic.     

Opportunistic delay‐margin‐based resource allocation for next‐generation wireless networks

This paper studies and develops efficient traffic management techniques for downlink transmission at the base station (BS) of multi‐service IP‐based networks by combining quality‐of‐service (QoS) provision and opportunistic wireless resource allocation. A delay‐margin‐based scheduling (DMS) for downlink traffic flows based on the delays that each packet has experienced up to the BS is proposed. The instantaneous delay margin, represented by the difference between the required and instantaneous delays, quantifies how urgent the packet is, and thus it can determine the queuing priority that should be given to the packet. The proposed DMS is further integrated with the opportunistic scheduling (OPS) to develop various queueing architectures to increase the wireless channel bandwidth efficiency. Different proposed integration approaches are investigated and compared in terms of delay outage probability and wireless channel bandwidth efficiency by simulation. Copyright © 2010 John Wiley & Sons, Ltd.     

Efficient slice‐aware H.264/AVC video transmission over time‐driven priority networks

This paper proposes a multimedia streaming architecture that combines network and video technologies to handle video traffic over multi‐hop access networks. In this context, resource overprovision typical of current quality of service approaches will become a limiting factor because of the increasing spread of bandwidth‐intensive multimedia applications. The proposed scheme adopts a time‐driven priority scheduling at network nodes and exploits slice classification at the video encoder to differentiate packets. The service guarantees offered by time‐driven priority, together with the packet classification, significantly reduce congestion and increase the video quality at the receiver with respect to the traditional differentiated services (DiffServ) approach, also achieving high resource utilization. This is an important result, as current DiffServ‐based architectures are far from obtaining such resource utilization in conjunction with reasonable delays and jitters. Copyright © 2013 John Wiley & Sons, Ltd.     

A novel framework for G/M/1 queuing system based on scheduling-cum-polling mechanism to analyze multiple classes of self-similar and LRD traffic

Provisioning guaranteed Quality of Service (QoS) in multiservice wireless internet is challenging due to diverse nature of end-user traffic (e.g., voice, streaming video, interactive gaming) passing through heterogeneous interconnected domains with their own policies and procedures. Numerous studies have shown that multimedia traffic carried in wireless internet possesses self-similar and long-range dependent characteristics. Nonetheless, published work on wireless traffic modeling is merely based on traditional Poisson traffic distribution which fails to capture these characteristics and hence yield misleading results. Moreover, existing work related to self-similar traffic modeling is primarily based on conventional queuing and scheduling combinations which are simple approximations.This paper presents a novel analytical framework for G/M/1 queuing system based on realistic internet traffic distribution to provide guaranteed QoS. We analyze the behavior of multiple classes of self-similar traffic based on newly proposed scheduling-cum-polling mechanism (i.e., combination of priority scheduling and limited service polling model). We formulate the Markov chain for G/M/1 queuing system and present closed form expressions for different QoS parameters i.e., packet delay, packet loss rate, bandwidth, jitter and queue length. We develop a customized discrete event simulator to validate the performance of the proposed analytical framework. The proposed framework can help in building comprehensive service level agreements for heterogeneous wireless domains.     

A framework for delivering fine granularity and fair service discrimination in DiffServ networks

In order to achieve a quality of service (QoS) capable of satisfying an ever increasing range of user requirements, differentiated services (DiffServ) have been introduced as a scalable solution that emerges ‘naturally’ from today's best effort service approach. Mapping the packet treatment into a small number of per hop behaviours (PHBs) is the key idea behind the scalability of DiffServ but this comes at the cost of loosing some behavioural differentiation and some fairness between flows multiplexed into the same aggregated traffic. The paper proposes a novel simple and effective DiffServ approach, the ‘Simple Weighted Integration of diFferentiated Traffic’ (SWIFT), and uses it in a series of simulations covering a relatively wide range of local network conditions. Measured voice and video traffic traces and computer generated self‐similar background traffic were used in simulations performed at various congestion levels and for in‐profile and out‐of‐profile source behaviour. The resulted throughput, mean delay, maximum delay and jitter are used to asses SWIFT's capabilities—isolation of the in‐profile traffic from congestion effects, treatment differentiation, increased resource utilization, fairness in treatment under congestion, and incentivity for nice behaviour. Comparisons with other approaches employing traffic control are also provided. Copyright © 2003 John Wiley & Sons, Ltd.     

Frame‐based adaptive uplink scheduling algorithm in orthogonal frequency division multiple access‐based Worldwide Interoperability for Microwave Access networks

Because the orthogonal frequency division multiple access physical resource available for scheduling in Worldwide Interoperability for Microwave Access networks is frame by frame, an uplink scheduler located at the base station must efficiently allocate available resources to the subscriber stations in response to constant or bursty data traffic on a per‐frame basis. Available resources for real‐time and nonreal‐time traffics, called frame‐based adaptive bandwidth allocation and minimum guarantee and weight‐based bandwidth allocation, respectively, are proposed in this paper. Moreover, both short‐term and long‐term bandwidth predictions for traffic are incorporated so that the long‐term bandwidth prediction can have sustainable throughput requirement, and the short‐term bandwidth prediction can meet the objectives of low delay and jitter. For the scenarios studied, it shows that system performance of the proposed algorithm is better than the hybrid (earliest deadline first + weighted fair queuing + FIFO) algorithm in terms of packet delay, jitter, throughput, and fairness. Copyright © 2011 John Wiley & Sons, Ltd.     

Flow‐Based Admission Control Algorithm in the DiffServ‐Aware ATM‐Based MPLS Network

This paper proposes a flow‐based admission control algorithm through an Asynchronous Transfer Mode (ATM) based Multi‐Protocol Label Switching (MPLS) network for multiple service class environments of Integrated Service (IntServ) and Differentiated Service (DiffServ). We propose the Integrated Packet Scheduler to accommodate IntServ and Best Effort traffic through the DiffServ‐aware MPLS core network. The numerical results of the proposed algorithm achieve reliable delay‐bounded Quality of Service (QoS) performance and reduce the blocking probability of high priority service in the DiffServ model. We show the performance behaviors of IntServ traffic negotiated by end users when their packets are delivered through the DiffServ‐aware MPLS core network. We also show that ATM shortcut connections are well tuned with guaranteed QoS service. We validate the proposed method by numerical analysis of its performance in such areas as throughput, end‐to‐end delay and path utilization.     

Reducing session establishment delay using timed out packets in SIP signaling network

Session Initiation Protocol (SIP) has a retransmission mechanism to maintain the reliability for its real time transmission. But these real time transmissions cause overload in the server and creates redundant messages. SIP does not offer sufficient mechanisms for handling overload situations. In this paper, we study the SIP system behavior by separating signaling traffic in two different classes (Invites and Non‐invites) and creating a cut‐off priority queueing model. SIP retransmission mechanism with timeout is modeled as a queueing system with impatient customers. Using this model, the effect of unnecessary retransmissions is studied, and delay distribution and loss probability (Pb_loss) are calculated. The proposed analytical model is verified with simulations that demonstrate that the inclusion of timeout gives better delay performance. Using Pb_loss, an algorithm is developed to control the overload in hop‐by‐hop transaction as described in RFC 6357. The simulation results for the proposed model with overload control and the standard SIP as per RFC 3261 are compared. The results demonstrate that the server utilization factor of an overloaded server always remains less than one and hence avoids system collapse. Further, the redundant messages in the system are reduced by 30% as compared with the standard SIP network. Copyright © 2014 John Wiley & Sons, Ltd.     

UMTS核心网中基于区分服务的QoS控制模型

3G新业务的发展，要求UMTS提供端到端QoS控制。文章构建了在UMTS核心网中为不同业务类提供QoS保证的区分服务模型，提出了从UMTS业务类到DiffServ域服务等级的映射方案，设计了一种新的队列调度算法，采用优先级和分离机制，在流量调整器配合下可满足不同业务类的QoS要求。最后，通过模拟实验证明了模型的有效性。     

Cross‐layer bandwidth and power allocation for a two‐hop link in wireless mesh network

In this paper, a cross‐layer analytical framework is proposed to analyze the throughput and packet delay of a two‐hop wireless link in wireless mesh network (WMN). It considers the adaptive modulation and coding (AMC) process in physical layer and the traffic queuing process in upper layers, taking into account the traffic distribution changes at the output node of each link due to the AMC process therein. Firstly, we model the wireless fading channel and the corresponding AMC process as a finite state Markov chain (FSMC) serving system. Then, a method is proposed to calculate the steady‐state output traffic of each node. Based on this, we derive a modified queuing FSMC model for the relay to gateway link, which consists of a relayed non‐Poisson traffic and an originated Poisson traffic, thus to evaluate the throughput at the mesh gateway. This analytical framework is verified by numerical simulations, and is easy to extend to multi‐hop links. Furthermore, based on the above proposed cross‐layer framework, we consider the problem of optimal power and bandwidth allocation for QoS‐guaranteed services in a two‐hop wireless link, where the total power and bandwidth resources are both sum‐constrained. Secondly, the practical optimal power allocation algorithm and optimal bandwidth allocation algorithm are presented separately. Then, the problem of joint power and bandwidth allocation is analyzed and an iterative algorithm is proposed to solve the problem in a simple way. Finally, numerical simulations are given to evaluate their performances. Copyright © 2008 John Wiley & Sons, Ltd.     

Network queue scheduling algorithm based on self-similar traffic level grading prediction

Self-similarity characteristic of network traffic will lead to the continuous burstness of data in the network.In order to effectively reduce the queue delay and packet loss rate caused by network traffic burst,improve the transmission capacity of different priority services,and guarantee the service quality requirements,a queue scheduling algorithm P-DWRR based on the self-similarity of network traffic was proposed.A dynamic weight allocation method and a service quantum update method based on the self-similar traffic level grading prediction results were designed,and the service order of the queue according was determined to the service priority and queue waiting time,so as to reduce the queuing delay and packet loss rate.The simulation results show that the P-DWRR algorithm can reduce the queueing delay,delay jitter and packet loss rate on the basis of satisfying the different service priority requirements of the network,and its performance is better than that of DWRR and VDWRR.     

Core‐stateless fair rate estimation fair queuing

Core‐stateless mechanisms, such as core‐stateless fair queuing (CSFQ), reduce the complexity of fair queuing, which usually need to maintain states, manage buffers, and perform flow scheduling on a per‐flow basis. However, they require executing label rewriting and dropping decision on a per‐packet basis, thus preventing them from being widely deployed. In this paper, we propose a novel architecture based on CSFQ without per‐packet labelling. Similarly, we distinguish between edge routers and core routers. Edge routers maintain the per‐flow state by employing a fair queuing mechanism to allocate each flow a fair bandwidth share locally and a token bucket mechanism to regulate those flows with feedback packets sent from egress edge routers. Core routers do not maintain per‐flow state; they use FIFO packet scheduling extended by a fare rate alarm mechanism by estimating the arrival rate and the number of flows using a matching–mismatching algorithm. The novel scheme is called core‐stateless fair rate estimation fair queuing (CSFREFQ). CSFREFQ is proven to be capable of achieving max–min fairness. Furthermore, we present and discuss simulations and experiments on the performance under different traffic scenarios. Copyright © 2005 John Wiley & Sons, Ltd.     

Prioritized e‐mail servicing to reduce non‐spam delay and loss: A performance analysis

This paper proposes a prioritized e‐mail servicing on e‐mail servers to reduce the delay and loss of non‐spam e‐mails due to queuing. Using a prioritized two‐queue scheme, non‐spam e‐mails are queued in a fast queue and given higher service priority than spam e‐mails that are queued in a slow queue. Four prioritized e‐mail service strategies for the two‐queue scheme are proposed and analyzed. We modeled these four strategies using discrete‐time Markov chain analysis under different e‐mail traffic loads and service capacities. Non‐spam e‐mails can be delivered within a small delay, even under heavy e‐mail loadings and high spam‐to‐non‐spam a priori. Results from our analysis of the two‐queue scheme show that it gives non‐spam delay and loss probability two orders of magnitude smaller than the typical single‐queue approach during heavy spam traffic. Moreover, prioritized e‐mail servicing protects e‐mail servers from spam attacks. Copyright © 2007 John Wiley & Sons, Ltd.     

E‐MAC: an elastic MAC layer for IEEE 802.11 networks

We present a system for real‐time traffic support in infrastructure and ad hoc IEEE 802.11 networks. The proposed elastic MAC (E‐MAC) protocol provides a distributed transmission schedule for stations with real‐time traffic requirements, while allowing a seamless coexistence with standard IEEE 802.11 clients, protecting best‐effort 802.11 traffic from starvation by means of admission control policies. Our scheduling decisions are based on an ‘elastic’ transmission opportunity (TXOP) assignment which allows for efficient wireless resource usage: whenever a real‐time station does not use the assigned TXOP, the other real‐time stations can take over the unused access opportunity, thus preventing the well‐known inefficiencies of static time division multiple access (TDMA) schemes. Unlike other TDMA‐based solutions for 802.11, E‐MAC does not require a tight synchronization among the participating clients, thus allowing its implementation on commodity WLAN hardware via minor software changes at the client side, and no changes at the access points (APs). We studied the performance of our mechanism via ns‐2 simulations and a mathematical model, showing that it outperforms IEEE 802.11e in terms of throughput, delay, and jitter. We finally provide a proof of concept through the results obtained in a real testbed where we implemented the E‐MAC protocol. Copyright © 2011 John Wiley & Sons, Ltd.     

Efficient scheduling discipline for Hierarchical Diff‐EDF

Packet networks are currently enabling the integration of traffic with a wide range of characteristics that extend from video traffic with stringent quality of service (QoS) requirements to the best‐effort traffic requiring no guarantees. QoS guarantees can be provided in conventional packet networks by the use of proper packet‐scheduling algorithms. As a computer revolution, many scheduling algorithms have been proposed to provide different schemes of QoS guarantees, with Earliest Deadline First (EDF) as the most popular one. With EDF scheduling, all flows receive the same miss rate regardless of their traffic characteristics and deadlines. This makes the standard EDF algorithm unsuitable for situations in which the different flows have different miss rate requirements since in order to meet all miss rate requirements it is necessary to limit admissions so as to satisfy the flow with the most stringent miss rate requirements. In this paper, we propose a new priority assignment scheduling algorithm, Hierarchal Diff‐EDF (Differentiate Earliest Deadline First), which can meet the real‐time needs of these applications while continuing to provide best‐effort service to non‐real time traffic. The Hierarchal Diff‐EDF features a feedback control mechanism that detects overload conditions and modifies packet priority assignments accordingly. Copyright © 2007 John Wiley & Sons, Ltd.     

Performance analysis of relative service using TCP‐aware marking and dynamic WRED

The implementation of successful assured forwarding (AF) services according to the DiffServ framework remains a challenging problem today, despite the numerous proposals for assured forwarding per‐hop‐behaviour (AF PHB) mechanisms and AF‐based service implementations. The interaction of the TCP and UDP traffic under an AF‐based service and a number of relative issues such as fairness among flows, achievable bandwidth guarantees and qualitative performance have been taken into consideration in this work in order to address the existing limitations. We propose two modules, the TCP‐window aware marker (TWAM) and the dynamic WRED (WRED) mechanism for implementing the differentiated services (DiffServ) AF PHB. We provide analytical models and an experimental evaluation in order to demonstrate how they succeed in enhancing the quality, improving the performance and easing the deployment of a production level AF‐based service. Copyright © 2008 John Wiley & Sons, Ltd.     

面向大规模确定性网络的全局循环排队与转发机制

时延抖动敏感的工业控制和远程驾驶应用驱动网络由尽力而为服务向确定性转发服务转变。为满足确定性应用时延抖动的有界需求,工业界和学术界在逐流过滤整形和队列转发控制方面进行了大量研究,实现了小规模以太网环境下轻载稳定流的微秒级时延和亚微秒级抖动保障。多数研究因较少考虑长距离网络拓扑变化、传输时延波动和短时突发流量过载等影响,难以满足大规模骨干网场景下的确定性要求。在循环排队转发（cyclic queuing and forwarding,CQF）基础上,考虑了源目的路径特性和确定性流量强度因素,提出了全局循环排队转发三队列（global cyclic queuing and forwarding 3-queue,GCQF-3）,并在基于OMNeT++搭建的确定性网络仿真系统中,比较了CQF、CQF-3和GCQF-3的转发控制机制,实验表明GCQF-3能根据确定性流量状态及时调整门控时机和排队优先级,在时延、抖动和网络利用率等方面都达到最佳。     

Using GI‐G‐1 queuing model for rtPS performance evaluation in 802.16 networks

Among the scheduling services, rtPS (real‐time polling service) is designated for real‐time applications. Among three packet delay intervals, performance effect on polling interval has been widely studied, but less on the intervals of scheduling and delivery. To evaluate the performance of delay‐sensitive rtPS applications, instead of using continuous queueing model, a discrete‐time GI‐G‐1 model, which considers intervals of polling, scheduling, and delivery, is proposed. By taking VoIP as a typical rtPS application, the transmission latency under different QoS settings, polling probability, and traffic load are presented. The latency is also compared among various codec schemes. The results indicate that when the codec rate is either fulfilled or dissatisfied by the promised bandwidth of service levels, the performance is highly dependent upon the polling probability, no matter what the traffic condition is. However, if the codec rate is in between the promised bandwidth of various service levels, the polling probability is a dominant factor in light traffic environment, while the settings on QoS parameters will strongly determine the performance in heavy traffic situation. In addition to the verification using simulation, the bandwidth utilization derived from the GI‐G‐1 model can be applied to improve the serving capacity of base stations. Copyright © 2011 John Wiley & Sons, Ltd.     

A distributed MAC scheme supporting voice services in mobile ad hoc networks

Future mobile ad hoc networks are expected to support voice traffic. The requirement for small delay and jitter of voice traffic poses a significant challenge for medium access control (MAC) in such networks. User mobility presents unique difficulties in this context due to the associated dynamic path attenuation. In this paper, a MAC scheme for mobile ad hoc networks supporting voice traffic is proposed. With the aid of a low‐power probe prior to DATA transmissions, resource reservation is achieved in a distributed manner, thus leading to small packet transmission delay and jitter. The proposed scheme can automatically adapt to dynamic path attenuation in a mobile environment. Statistical multiplexing of on/off voice traffic can also be achieved by partial resource reservation for off voice flows. Simulation results demonstrate the effectiveness of the proposed scheme. Copyright © 2009 John Wiley & Sons, Ltd.