Higher Priority Traffic Flows Research Articles

A Class-based Adaptive QoS Control Scheme Adopting Optimization Technique over WLAN SDN Architecture

Recently, Software-Defined Networking (SDN), a network architecture approach that enables the network to be intelligently and centrally controlled by using software applications, has been introduced. Another important issue in the network management context is Quality of Service (QoS). This work investigates the QoS provisioning of various traffic classes on an SDN-enabled network. We propose and implement the class-based adaptive QoS control scheme on SDN-enabled network for various traffic classes, namely VoIP, Video Streaming and File Transfer. The effectiveness of our proposed scheme is validated by simulation using Mininet and Ryu controller. The procedure to create the simulation platform and all details relevant to all software used are described step-by-step in detail. The main performance evaluation metric is the Maximum Number of Traffic Flows admittable with QoS while Average Throughput, Latency, Jitter, and Packet Loss Rate are maintained at the comparable level of the existing work in the literature called JMABC [11]. Our simulation results are illustrated with 95% confidence interval. According to the simulation results, it is obvious that our proposed class-based adaptive QoS control scheme adopting the optimization technique significantly outperforms the existing similar QoS provision scheme in terms of the maximum number of the high priority traffic flows (VoIP) admittable with QoS while the other evaluation metrics are maintained at the same level.

A methodology to enable QoS provision on InfiniBand hardware

Modern high-speed interconnection networks include support for the provision of quality of service (QoS) to the applications. The output scheduling algorithm plays an important role in the QoS provision, choosing the packets to be delivered from the output buffers. InfiniBand, one of the most used interconnection technologies, includes a table-based scheduler composed of a high- and a low-priority tables, and a counter limiting the number of high priority traffic flows that may be delivered before giving the opportunity to low priority ones. Therefore, the performance of the traffic flows in the network largely depends on the table configuration since the switch scheduler uses this information to allow/deny packets being forwarded, according to the QoS provision scheme. As far as we know, there is no study on the influence of these configurations to the traffic flows performance. In this paper, we present an offline analysis tool to accurately determine the expected end-to-end latency and bandwidth of the traffic flows in an InfiniBand-based network using the information contained in the high- and low-priority tables. Moreover, we present a methodology to aid network administrators in configuring the QoS provision in a real InfiniBand cluster. Finally, we evaluate the analysis tool, comparing its results with those obtained from a real cluster and from simulation.

Classified Round Robin: A Simple Prioritized Arbitration to Equip Best Effort NoCs With Effective Hard QoS

Advances in semiconductor technology enable integrating tens of cores on a single chip. Providing quality-of-service (QoS) for communication flows in complex embedded applications is critical. In this paper, we present a new approach for designing guaranteed service (GS) networks-on-chip by introducing a new arbitration algorithm and differentiating high and low priority traffic flows in best-effort (BE) networks. An analytical model is provided to compute accurate performance bound parameters in the network with the new arbitration. When the flows have the same priorities in a switch, the new algorithm acts exactly the same as the basic round robin arbitration. It works as a superset of the basic algorithm, when the flows have different priorities. The proposed method helps designers to easily equip traditional BE networks with effective hard QoS, changing it to a GS network. This is done without the need to get involved in the designing complexity of traditional GS networks and still benefit from the superior properties of BE networks. We show substantial improvement in performance bounds for high priority flows (more than 40% in delay and 80% in bandwidth, on average) compared to the known approaches.

Binary Heap Based Fair Scheduling Algorithm in Optical Burst Switching Networks

In this paper, a binary-heap based fair scheduling algorithm (BFSA) for optical burst switching (OBS) networks is proposed. BFSA calculates the cost function (CF) for every generated burst at edge nodes. CF is calculated using four fair parameters associated with each burst and it is updated at every hop until reaching the destination node. Moreover, a minimum priority queue is implemented using a binary heap tree for all incoming bursts at each code node. In contention case, the minimum cost burst that occupies the root node of the heap is considered as a victim and it is replaced by the new arriving high priority burst flow. BFSA is a fast scheduling scheme that is easily implemented at core nodes with no extra hardware components. BFSA is evaluated in terms of burst loss ratio and throughput using NS-2 simulator. Results reveal that BFSA is able to address fairness in OBS networks as it achieves better burst loss ratio and better throughput. BFSA performs much better than other fairness schemes such as the last hop pre-emption (LHP) and the fair prioritized pre-emption (FPP) schemes. In addition, it shows better fairness performance for higher priority traffic flows.

FEBA: A Bandwidth Allocation Algorithm for Service Differentiation in IEEE 802.16 Mesh Networks

In wireless mesh networks, the end-to-end throughput of traffic flows depends on the path length, i.e., the higher the number of hops, the lower becomes the throughput. In this paper, a fair end-to-end bandwidth allocation (FEBA) algorithm is introduced to solve this problem. FEBA is implemented at the medium access control (MAC) layer of single-radio, multiple channels IEEE 802.16 mesh nodes, operated in a distributed coordinated scheduling mode. FEBA negotiates bandwidth among neighbors to assign a fair share proportional to a specified weight to each end-to-end traffic flow. This way traffic flows are served in a differentiated manner, with higher priority traffic flows being allocated more bandwidth on the average than the lower priority traffic flows. In fact, a node requests/grants bandwidth from/to its neighbors in a round-robin fashion where the amount of service depends on both the load on its different links and the priority of currently active traffic flows. If multiple channels are available, they are all shared evenly in order to increase the network capacity due to frequency reuse. The performance of FEBA is evaluated by extensive simulations. It is shown that wireless resources are shared fairly among best-effort traffic flows, while multimedia streams are provided with a differentiated service that enables quality of service.

Dynamic admission control in hybrid QoS networks with WiFi access

Providing quality of service (QoS) guarantees for multimedia applications over Hybrid networks by wired and wireless LANs is rapidly becoming an important issue. In order to protect the high priority traffic flows and improve network performance in a heavy-loaded network, a new dynamic admission control algorithm is proposed in this paper. We firstly propose a method to fit the fractional autoregressive integrated moving average (FARIMA) models to four actual wireless traffic traces and a traffic prediction based on the upper probability limit. Our experiments show that the one-step forecasts based on the FARIMA models are better than those based on autoregressive integrated moving average (ARIMA) models. We also propose a prediction-based admission control algorithm in hybrid QoS networks with WiFi access using the FARIMA models. The com- prehensive simulation experiments are performed to verify the effectiveness of the pro- posed admission control algorithm.

Resource management and QoS control in multiple traffic wireless and mobile Internet systems

AbstractEnd‐to‐end quality of service (QoS) control for multiple traffic in wired networks is carried out through Differentiated services (DiffServ). Edge routers in DiffServ domain classify incoming flows into different per‐hop behavior (PHB) groups and give a policy‐based QoS guarantee to these behavior aggregates. As Internet extends into the wireless and mobile section, different traffic flows should be treated differently not only in wired core network, but also in wireless resource allocations. In this paper, we propose a preemptive priority handoff and adaptive resource allocation scheme. DiffServ PHB groups are mapped into different wireless and mobile QoS classes. Traffic flows are categorized into these classes in order to allow the system to allocate different bandwidth and make resource reservation according to their priorities. Higher priority traffic flows are permitted to preempt lower priority flows in service. Lower ones, on the contrary, can expand their bandwidth into areas reserved for higher priority traffic flows for better resource utilization. We use both analytical model and simulation to evaluate the system performance in terms of blocking probabilities, forced termination probabilities, and delay. The forced termination probability of high priority traffic flows can be decreased significantly by introducing the preemptive priority scheme. Therefore, this scheme can be used in wireless part of the system along with DiffServ to give further guarantee for low delay, low jitter, and low loss services to high priority services. Copyright © 2005 John Wiley & Sons, Ltd.