Share Of Bandwidth Research Articles

TCCC: A Throughput Consistency Congestion Control Algorithm for MPTCP in Mixed Transmission of Long and Short Flows

Existing congestion control algorithms for MPTCP that care about only long flow transmission aim at the Congestion-Avoidance (CA) phase and they need a long time to reach convergence states. We verified that the exponential growth of congestion window (cwnd) in the uncoupled Slow-Start (SS) leads to not only unfairness to TCP but also buffer overflow due to burst data. Moreover, these algorithms cannot support fair bandwidth sharing among TCP/MPTCP flows before reaching convergence at the bottleneck, which may reduce the transmission efficiency of short flows and even hurts long flows. In this paper, we propose a Throughput Consistency Congestion Control (TCCC) algorithm consisting of Coupled Slow-Start (CSS) and Aggressive Congestion Avoidance (ACA). To prevent packet loss caused by excessive burst data, CSS couples the increment of subflows’ cwnd and reset the ssthresh value to safely move the flows to CA when it achieves expected throughput. Based on CSS, ACA periodically detects path states and allocates the same throughput increment as the best TCP to subflows to achieve fair bandwidth share in CA. Finally, we implement TCCC in both NS3 and real testbed. The results show that TCCC reduces retransmissions, improves transmission efficiency, and maintains better fairness.

Real-time optimized wireless networked control system with cooperative network protocols

In this paper, we present a real-time optimized fuzzy fuzzy proportional integral derivative (FPID)-controlled wireless networked system for a high-torque direct current (DC) motor. The main challenge faced by such systems is the delay in the wireless networked control system (WNCS). We employed a powerful FPID controller tuned using particle swarm optimization (PSO) technique to compensate for the delay. The system is tested on a network using the TrueTime simulator with different parameters. The results show that the system exhibits a very stable response, with the FPID controller compensating for the delay effectively. Increasing the number of nodes negatively impacts the system's performance, resulting in higher overshoot, longer settling time, and longer rise time. Moreover, the choice of bandwidth share and sampling time significantly affects the system's stability and real-time response. The use of transmission control protocol/internet protocol (TCP/IP) or user datagram protocol (UDP) protocols with Node MCU is necessary to transfer data from the Arduino Microcontroller to MATLAB, as MATLAB TrueTime simulator does not support direct serial communication. In conclusion, this study highlights valuable insights into the performance of the proposed system, demonstrating the need for further improvements in the system's design and control algorithms to achieve stable operation.

PRAM: Penalized Resource Allocation Method for Video Services

Abstract The human visual system response to picture quality degradation due to packet loss is very different from the responses of objective quality measures. While video quality due to packet loss may be impaired by at most for one Group of Pictures (GOP), its subjective quality degradation may last for several GOPs. This has a great impact on resource allocation strategies, which normally make decisions on instantaneous conditions of multiplexing buffer. This is because, when the perceptual impact of degraded video quality is much longer than its objective degradation period, any assigned resources to the degraded flow is wasted. This paper, through both simulations and analysis shows that, during resource allocation, if the quality of a video stream is significantly degraded, it is better to penalize this degraded flow from getting its full bandwidth share and instead assign the remaining share to other flows preventing them from undergoing quality degradation.

BBR-With Enhanced Fairness (BBR-EFRA): A new enhanced RTT fairness for BBR congestion control algorithm

Towards the end of 2016, the Google research team proposed and developed a new state-of-the-art TCP congestion control algorithm called Bottleneck Bandwidth and Round-trip propagation time (BBR). When deployed on various Google internal servers, BBR attained higher throughput and low latency performances on modern-day and sophisticated networks than traditional congestion control algorithms like Cubic, Reno, or Vegas. Unlike conventional congestion control algorithms, BBR controls data transmission by maximizing delivery rate and minimizing the round-trip time (RTT), therefore maximizing bandwidth utilization and improving throughput and latency delay performances. However, some experiments have reported persistent queue formation and massive packet retransmissions rate in the bottleneck link, which happens to be the main cause of unfairness between different RTT flows. BBR prefers and favors long RTT over short RTT flows; therefore, long RTT flows are allocated more bandwidth when competing with short RTT flows in the bottleneck link. It was also noted that even the minor difference between the two competing flows could be a source of throughput imbalance and unfairness. The dominance of long RTT flows is the central origin of the high queuing delay, packet loss and retransmission rates, and even severe BBR vulnerability that malicious users can exploit to obtain a larger share of bandwidth simply by increasing the RTT (delay). Therefore, we propose a BBR-With Enhanced Fairness (BBR-EFRA) to mitigate this major concern challenge. Our proposed algorithm adaptively controls the congestion window (CWND) by adjusting the bandwidth delay product (BDP) values of each BBR flow during data transmission based on buffer queue status computation. Our proposed approach guarantees different RTT flows to compete for the available bottleneck bandwidth more equally, hence improving the BBR fairness issue. We evaluated our algorithm on the NS3 simulating environment. BBR-EFRA shows improved RTT fairness by more than 16%, reduced retransmission rate by more than 20%, and queuing delay by more than 18%, and finally increased Jain’s fairness index by more than 1.3 times compared with other recently published BBR variants like an adaptive congestion window of BBR(BBR-ACW). Therefore, with BBR-EFRA, short RTT flows can fairly compete for the available bandwidth even with higher RTT differences under various network scenarios.

Mobile Ad-Hoc Wireless Networks In Medium Access Control Protocol

Nodes in an ad hoc wireless network share a common broadcast radio channel. The radio spectrum is limited, the bandwidth available for communication in such networks is also limited. Access to this shared medium should be controlled in such manner that all nodes receive a fair share of the available bandwidth, and that the bandwidth is utilized efficiently. Since the characteristics of the wireless medium are completely different from those of the wired medium ,and since ad hoc wireless networks need to address unique issues such as node mobility, limited bandwidth availability ,error-prone broadcast channel hidden and exposed terminals problems and power constraints that are not applicable to wired networks ,a different set of protocols is required for controlling access to the shared medium in such networks, This paper focuses on media access protocols for ad hoc wireless networks

Analysis Performance of Mikrotik Wifi Router on PT. Garindo Sakti Jaya


 Garindo Sakti Jaya is a physiotherapy health provider, as a company founded in 2009 it has not escaped the use of Internet media in work activities Company. The use of Internet media is expected to support employee performance. The challenge that does not often encounter in the use of Internet media is one less stable and less balanced network, for maximum increase and no less evenly between the user. So for the development of PT. Garindo Sakti Jaya requires network traffic management with features help with service quality (QoS). These problems can be predicted by using the router's features and access points. This research methodology using Mikrotik wireless bandwidth management i.e. a mechanism that allows users to use wireless clients optimally. Steps can be made to be able to produce maximum security and bandwidth analysis and testing can be done on the performance management of bandwidth by how to use the Mikrotik wireless router and the access point is Mikrotik router and access the pool point links. There are some parameters made in this study, among other things: the troughput parameter, the parameters and the parameter delays, loss of packages. Based on research that has been done using Mikrotik router generating applications that can satisfy the share of bandwidth and a fairly good WiFi manager on the client side or end user.

Analytic performance model for parallel overlapping memory‐bound kernels

AbstractComplex applications running on multicore processors show a rich performance phenomenology. The growing number of cores per ccNUMA domain complicates performance analysis of memory‐bound code since system noise, load imbalance, or task‐based programming models can lead to thread desynchronization. Hence, the simplifying assumption that all cores execute the same loop can not be upheld. Motivated by observations on plain and modified versions of the HPCG benchmark, we construct a performance model of execution of memory‐bound loop kernels. It can predict the memory bandwidth share per kernel on a memory contention domain depending on the number of active cores and which other workload the kernel is paired with. The only code features required are the single‐thread memory request fraction per kernel, which is directly related to the single‐thread memory bandwidth, and its saturated bandwidth. The former can either be measured directly or predicted using the Execution‐Cache‐Memory performance model. The computational intensity of the kernels and the detailed structure of the code is of no significance. We validate our model on Intel Broadwell, Intel Cascade Lake, and AMD Rome processors pairing various streaming and stencil kernels. The error in predicting the bandwidth share per kernel is less than 8%.

Unfairness of Random Access with Collision Avoidance in Industrial Internet of Things Networks.

This paper is focused on the analysis of unfairness of random media access in Local Operating Networks (LON), which is one of the commercial platforms of the Industrial Internet of Things (IIoT). The unfairness in accessing the LON channel is introduced by a collision avoidance mechanism in the predictive p-persistent CSMA protocol adopted at the media access control layer. The study on the bandwidth share in predictive p-persistent CSMA calls for the analysis of multiple memoryless backoff. In this paper, it is shown that the channel access in LON systems is unfair in the short term for medium traffic load conditions, and in the long term for heavy loaded networks. Furthermore, it is explained that the average bandwidth allocated to a particular node is determined implicitly by the load scenario, while an actual node bandwidth fluctuates in time according to stochastic dynamics of the predictive p-persistent CSMA. Next, it is formally proven that the average bandwidth available to a node is a linear function of its backoff state and does not depend on backoff states of the other stations. Finally, it is demonstrated that possibly unfair bandwidth share in LON networks determined implicitly by load scenario is stable because, with lowering a fraction of actual network bandwidth accessible by a given station, the probability to decrease it in the future also drops.

PENERAPAN WEB PROXY DAN MANAGEMENT BANDWIDTH MENGGUNAKAN MIKROTIK ROUTERBOARD PADA KANTOR POS PALEMBANG 30000

The Palembang 30000 POS office which is supported by information technology has a computer network that is directly connected to the ISP (Internet Service Provider) which has a bandwidth allocation of 20 Mbps. The problem at the Palembang 30000 POS Office is that there is no web proxy and Bandwidth Management application, so employees can access various sites that interfere with employee performance and employees who use the internet for free result in uneven bandwidth usage. The purpose of this study is to implement a web proxy and bandwidth management, so that the bandwidth is evenly distributed, therefore it is necessary to divide the bandwidth using a proxy routerboard, the method used for bandwidth distribution is using the simple queue method. By implementing a web proxy, it can control internet usage and block website sites that have the potential to interfere with employee performance, by making bandwidth management able to limit bandwidth usage and share bandwidth equally on each client, so internet access is now running more stable.

Dynamic Memory Bandwidth Allocation for Real-Time GPU-Based SoC Platforms

Heterogeneous SoC platforms, comprising both general purpose CPUs and accelerators, such as a GPU, are becoming increasingly attractive for real-time and mixed-criticality systems to cope with the computational demand of data parallel applications. However, contention for access to shared main memory can lead to significant performance degradation on both CPU and GPU. Existing work has shown that memory bandwidth throttling is effective in protecting real-time applications from memory-intensive, best-effort (BE) ones; however, due to the inherent pessimism involved in worst-case execution time (WCET) estimation, such approaches can unduly restrict the bandwidth available to BE applications. In this article, we propose a novel memory bandwidth allocation scheme where we dynamically monitor the progress of a real-time application and increase the bandwidth share of BE ones whenever it is safe to do so. Specifically, we demonstrate our approach by protecting a real-time GPU kernel from BE CPU tasks. Based on profiling information, we first build a WCET estimation model for the GPU kernel. Using such model, we then show how to dynamically recompute on-line the maximum memory budget that can be allocated to BE tasks without exceeding the kernel’s assigned execution budget. We implement our proposed technique on NVIDIA embedded SoC and demonstrate its effectiveness on a variety of GPU and CPU benchmarks.

Misbehavior in Multi-Channel MAC Protocols

Multi-channel MAC (MMAC) protocols are designed to coordinate multi-user access to several non-overlapping frequency bands. They are primarily tasked with the efficient and fair bandwidth utilization under a variety of traffic load conditions, presuming that terminals follow the protocol specifications. However, selfish terminals can manipulate the protocol parameters to gain an unfair share of the common bandwidth. The problem of selfish MAC-layer misbehavior is well-studied for single-channel MAC protocols, but little attention has been paid when channel access is coordinated across multiple channels. In this paper, we address the problem of MAC-layer misbehavior in the multi-channel domain. We identify misbehavior strategies for popular classes of MMAC protocols (split-phase and dedicated control channel MMACs) and evaluate their impact on network throughput and fairness. We show that selfish terminals can easily isolate frequency bands for exclusive use without violating the protocol specifications. We develop corresponding detection and mitigation strategies that greatly reduce the throughput gains due to misbehavior.

PPNet

Software-defined networking introduces opportunities to optimize the Internet Service Provider’s network and to improve client experience for the Video-on-Demand applications. Recent studies on SDN frameworks show that traffic engineering methods allow a fair share of bandwidth between adaptive video streaming clients. Additionally, ISPs can make better estimations of bandwidth and contribute to the bitrate selection for the clients. This study focuses on another aspect of network assistance in video delivery: CDN server selection. In a typical framework where the ISP contributes to the CDN selection, the video provider and the network provider interfaces are merged together. Clients connect to the ISP to get the best CDN server candidate for a given video. This exposes client requests to the ISP. However, video providers have been investing large resources for encrypted video provisioning to preserve their client’s information from third parties, especially network providers. The typical approach is not practical due to privacy concerns. In this study, we present a framework called PPNet to allow CDN-ISP collaboration while preventing the ISP’s access to the video request and availability information. Our framework introduces an isolation between the video provider’s and the ISP’s web interfaces. Clients connect to both of the interfaces and deliver information on a need-to-know basis. As a second contribution, PPNet introduces a practical optimization method for CDN selection. Real-time data collection capabilities of a typical OpenFlow network is used as the input for optimization. Congestion-awareness has been the priority. To adapt for changing network conditions, capability of utilizing multiple servers simultaneously for a single video is introduced. Instead of directing each video client into a CDN node, the proposed system performs request routing per video segment. Finally, we present a system prototype of PPNet and show that our multiple-host adaptive streaming method introduces a significant improvement in quality of experience when compared to the state of the art.

AQM Congestion Controller for TCP/IP Networks: Multiclass Traffic

Active queue management (AQM) is a congestion control mechanism for the early notification of the incipient congestion pursued by dropping/marking packets. The novelty in our result is that we are able to consider heterogeneous traffic (i.e., multiclass traffic) where each class has its own packet discarding policy, queue size, and bandwidth share. Then, this is so far the first control theory-based approach for the AQM problem on the TCP/IP routers that allows multiclass AQM. Our proposed technique assumes that each class has already a controller, designed a priori, and focuses on designing a static state feedback controller where the proposed design approach is based on the solution of linear matrix inequalities (LMIs). From the theoretical conditions, a new controller design methodology for discrete time systems with multi-delays, saturated inputs, and disturbances is proposed to overcome the obstacle of bilinearity which leads to a quite simple LMI condition that is numerically tractable with any convex optimization algorithm. A numerical example is provided at the end of this paper to show the effectiveness and performances of the proposed approach in the presence of multiclass traffic.

Blocking Probability based Admission Control Technique for QoS Provisioning in WDM networks

In this paper, we have proposed a blocking probability-based admission control technique for QoS provisioning on in WDM networks, for this, we estimate the blocking probability for an arriving connection request. The probability that there is at least one free wavelength at the specified book-ahead time that remains idle for the whole connection duration. Next to this an admission control scheme used in each group for deterministic QoS provisioning. The admission control scheme has its root from network calculus which can derive deterministic bounds on throughput and delay rather than statistical averages. Along with the delay metric, the blocking probability is also considered as the main constraints for admission control. The scheme allocates the aggregate token bucket for each class of traffic based on its bandwidth share.

Filter-based optimal transmission path scheduling in MIMO LTE and LTE-A networks

The multi-in and multi-out (MIMO) wireless communication with robust performance often evinces the considerable bit error rate due to the imbalance signal against to noise, contention due to load, and poor bandwidth share. Hence, it is obvious to define novel methods to select the transmission channel between the source and destination that incorporates multiple antennas in sequence. In order to this, a filter-based technique that filters the unimaginative direct transmission channels between any two antennas in sequence is proposed and explored in this manuscript. The filter that portrayed is an extended version of the wiener filter that boosted up with novel distribution diversity measure called KS-test, which estimates the significance of the channel under defined constraints called noise, load and bandwidth sharing. The experimental study denoting that the proposed filter is outperforming the contemporary models in regard to minimise the bit error rate and other quality metrics.

Blocking probability-based admission control technique for QoS provisioning in WDM networks

In this paper, we have proposed a blocking probability-based admission control technique for QoS provisioning on in WDM networks, for this, we estimate the blocking probability for an arriving connection request. The probability that there is at least one free wavelength at the specified book-ahead time that remains idle for the whole connection duration. Next to this an admission control scheme used in each group for deterministic QoS provisioning. The admission control scheme has its root from network calculus which can derive deterministic bounds on throughput and delay rather than statistical averages. Along with the delay metric, the blocking probability is also considered as the main constraints for admission control. The scheme allocates the aggregate token bucket for each class of traffic based on its bandwidth share.

SD‐MAC: Design and evaluation of a software‐defined passive optical intrarack network in data centers

AbstractWith rapid development of cloud computing services, traffic in data centers (DCs) increases dramatically. Top‐of‐rack Ethernet switches dominate network cost and energy consumptions in DCs. Optical switching technologies have been introduced into DC networks to increase switching capacity and to reduce energy consumption. However, how to design high‐performance optical intrarack networks is still a great challenge. This paper presents a software‐defined passive optical intrarack network (SD‐POIRN) based on optical coupler fabrics. The data plane of SD‐POIRN is a broadcast‐and‐select optical network combining wavelength division multiplexing and time division multiplexing technologies. The control plane of SD‐POIRN has a centralized rack controller for scheduling intrarack data transmissions. This paper proposes a software‐defined media access control (SD‐MAC) protocol for SD‐POIRN. The SD‐MAC utilizes dynamic transmission and receiving server grouping methods and max‐min fair share bandwidth allocation algorithms to dynamically allocate bandwidth among servers in an efficient and fair manner. Network performance evaluation results show that, when the offered load is high, the proposed SD‐MAC protocol effectively increases network throughput and reduces average packet delay compared with previous works.

Multiclass AQM on a TCP/IP router: A control theory approach

SummaryActive queue management (AQM) is a well‐known technique to improve routing performance under congested traffic conditions. It is often deployed to regulate queue sizes, thus aiming for constant transmission delay. This work addresses AQM using an approach based on control theory ideas. Compared with previous results in the literature, the novelty is the consideration of heterogeneous traffic, ie, multiclass traffic. Thus, each traffic class may have different discarding policies, queue sizes, and bandwidth share. This feature brings the proposal nearer to real network management demands than previous approaches in the literature. The proposed technique assumes that each class already has a simple controller, designed a priori, and focuses on designing a static state‐feedback controller for the multiclass system, where the design is based on using LMIs for the calculations. For this, optimization problems with LMI constraints are proposed to compute the state‐feedback gains that ensure stability for a large set of admissible initial conditions. These conditions ensure not only closed‐loop stability but also some level of performance. As far as we know, this is the first control theory based approach for the AQM problem on TCP/IP routers that allows a multiclass AQM while also considering time‐varying delays and input saturation. This is an important step to frame AQM in a more formal, yet realistic context, enabling it to address important service level agreement (SLA) directives. The proposal is tested on a simulated system at the end of this paper, showing the feasibility and performance of the approach in the presence of multiclass traffic.

Novel Multiple Bypass Bin Scheme and Low-power Approach for HEVC CABAC Binary Arithmetic Encoder

HEVC is one of the most recent video coding standards, designed to face a new age of video processing challenges, such as higher video resolutions and limited traffic share bandwidth. The HEVC standard is divided into multiple steps, whereas the entropy encoding is the final stage before the coded bitstream generation. The CABAC (Context Adaptive Binary Arithmetic Coding) is the sole algorithm used for the entropy encoding at HEVC, providing reduced final bitstream generation, at the cost of increasing computational complexity and difficulties for parallelism opportunities. One of the novelties of the CABAC for the HEVC is the increase of certain types of input data (called bins), which have smaller dependencies among them (i.e. bypass bins), thus leading to the possibility to process multiples of them in parallel at once. The present work introduces a novel scheme for multiple bypass bins processing at once, leading to increasing bins-per-cycle throughput compared to related works. Moreover, the new technique is suitable for achieving a BAE (Binary Arithmetic Encoder) architecture (the CABAC critical part) able to process 8K UHD videos. Along with the multiple bypass bins technique, a low-power approach is achieved, based on statistical analysis of the recommended test video sequences, accomplishing around 15%of power savings.

ARFC: Advance response function of TCP CUBIC for IoT‐based applications using big data

SummaryThe throughput of a TCP flow depends on the average size of Congestion Window (cwnd) of a congestion control mechanism being used during the communication. The size of cwnd depends upon the usage of available link bandwidth during communication. The response function is a measure of average throughput of a single TCP flow of congestion control mechanism as the level of random packet loss is varied. Nowadays, many organizations are deploying IoT based applications for the analytics of their Big Data. TCP CUBIC and TCP Compound are the default congestion control mechanisms in Linux and Microsoft Windows Operating Systems respectively. Whereas, TCP Reno which is also known as Standard TCP congestion control mechanism is act as a trademark congestion control mechanism. During communication among different IoT applications, TCP CUBIC flows use more available link bandwidth as compared to TCP Reno flows, thus, the average cwnd size of TCP CUBIC flows are greater than the TCP Reno flows. It implies that these both kinds of flows are not sharing available link fairly, which refers as low TCP friendliness of TCP CUBIC. It means that the throughput of TCP CUBIC flows is higher than the trademark congestion control mechanism, i.e., TCP Reno flows. As a result, friendliness behavior or fair share of available link bandwidth among TCP CUBIC flows and TCP Reno flows is decreased. In other words, TCP friendliness of TCP CUBIC flows is reduced. Now, it is important to decrease the average cwnd size of TCP CUBIC flows, such that available link bandwidth can be shared fairly among flows of TCP CUBIC and TCP Reno. The aim of this research is to enhance the TCP friendliness behavior of TCP CUBIC congestion control mechanism for IoT based applications using Big Data. In this paper, an Advance Response Function of TCP CUBIC (ARFC) is designed to share fairly available link bandwidth among flows of TCP CUBIC and TCP Reno. Results show that TCP friendliness behavior of TCP CUBIC is increased by using ARFC. Overall, 18.6% performance is increased by using ARFC.