Fair Share Of Bandwidth Research Articles

Fair Bandwidth Sharing in Network Using FCFS-TP Protocol

Fair Bandwidth Sharing in Network Using FCFS-TP Protocol

BFTDT: Byzantine Fault Tolerance tryout for Dependable Transactions in Cloud

Cloud Web Services (CWS) is the technology used for business collaboration and integration among the web users. The Web Services Atomic Transactions (WS-AT) have been used for the trusted distributed transaction processing over the web. The WS-AT in the distributed sense has byzantine faults to overcome that Byzantine Faults Techniques (BFT) is used. The reliable coordinator provides the services that are Coordination services, Activation services, Registration Services and Completion services which make the transaction effective and reliable. In the trusted environment, to evade congestion of the resources, fair share bandwidth allocation scheme is used to allocate separate bandwidth for each web users and the transaction is processed Coordinator server and the Transaction Processing Monitor (TPM). The WS-AT for business applications analysis shows the high degree of dependability, security, trust, fault tolerance and fairness of the resources in the trusted environment.

ARA MAC - A Qualifying Approach for improving Attack Resiliency and Adaptivity for Medium Access Control Protocol in WLAN 802. 11

The exponential growth of wireless network in recent years has brought some major research issues that include a fair share of the available bandwidth, quality of service (QoS) and control of misbehaving traffic nodes/sources. However, in wireless networks, including cellular, Ad Hoc, and sensor networks, that are based on a shared medium and often contention-oriented protocols, these issues have not been fully addressed. Most wireless networks are based on IEEE 802.11x standards which provide public wireless access to the Internet. The medium access control (MAC) in IEEE 802.11 uses a distributed contention resolution mechanism for sharing the channel. If the MAC protocol is manipulated or misused, then the consequences can be overwhelming, such as the disruption of the whole network. A selfish/cheater node [10] can manipulate the MAC protocol in different ways to gain access to the channel resulting in some cases of starvation of other nodes in the same network. The manipulation of the MAC layer protocol is hidden from the upper layers, and can be further enhanced if combined with more violations from these upper layers of the ISO/OSI Model. In wireless networks i.e. IEEE 802.11, all nodes contending to access the medium made-up to follow the rules of the Medium Access Control (MAC) sub layer. As the number of nodes increases; the probability of collisions obviously increases which causes longer back-off values of the collided nodes. A suspicious node may be either selfish node (or misbehaving node) which attempts to manipulate its back-off parameters of the CSMA / CA protocol to gain more and more access to the channel, hence get higher performance than their fair share. Suspicious nodes (Misbehavior Node). Which may be an attacker and can increase collisions to decrease the performance of MAC protocols by disobeying CSMA/CA or back-off rules. In this work, we discussed, analyzed and used selfish behavior by attackers to create an opportunist node. We also identified, declared and finally discard/disassociate the attacker nodes in IEEE 802.11 MAC layer environment. The Access point (AP) Allow most of the nodes offers more bandwidth (in terms of the extra number of slots to almost each node) while maintaining fairness if channel utilization is poor and this mode is called opportunist mode. The Proposed Protocol is called as the ARA-MAC. The performance of our method is evaluated through a simulation model to test efficiency. Various parameters are the basis for comparison between the implemented method and CSMA/CA. Key Performance Parameters i.e. Packet Delivery Ratio, RTS/Data Frames, Mean no. Of retry per frame have been used for comparison and performance evaluation. The results show that our proposed algorithm ARA-MAC outperforms basic CSMA/CA in terms of Attack Resiliency and Adaptability. ARA-MAC is able to detect and discard attacker nodes after identification of its maliciousness and also it provides adaptability in existing CSMA/CA. The time period for monitoring of node behavior varies according to the Fibonacci series to identify random timing attackers and also it reduces unnecessary execution of ARA-MAC algorithm at AP (Access Point). This is predominantly important in a distributed system where power consumption is a big concern especially in the case of Wireless Sensor Network. It is also important in a centralized system where constant monitoring of a large number of sources from the Access Point (AP) alone may become promptly a big burden on it. The main purpose of this work is to increase the channel utilization by offering opportunities to a node, and detect such node that is using this concept to degrade the network performance in terms of degraded channel utilization. General Terms Protocol Modification and System Development for Attack Resiliency at MAC Layer.

Redball: Throttling Shrew Attack in Cloud Data Center Networks

In homeland security and defense, cloud security is critical. As an increasing number of governments and organizations outsource their computing to the cloud, they at the same time make it an attractive target for terrorists and hackers. Cloud computing offers a great opportunity for improved productivity and lowered cost, however, it meanwhile raises potential security issues as attackers from around the nation or world could be its legal tenants. This paper studies one of the potential security problem, namely, legal yet malicious tenants would launch low-rate DoS (Denial of Service) attack (or Shrew attack for short) to the co-residents once they rent and control a part of computing resources. To explore the feasibility and understand the possible attack pattern, we try to identify bottlenecks in the underlying DCNs (Data Center Networks), and then attack the victim with as little traffic. Moreover, an analytical model is built to quantitatively analyze the necessary and sufficient traffic for an effective attack. Finally, we propose a universal receiver-enforced dynamic bandwidth allocation technique named Redball to enhance defense capabilities of the cloud. Redball could intelligently throttle shrew attack in DCNs by decomposing its group behavior, enforce an average fair share of bandwidth among tenants in a workconserving way, and yet sacrifice only a small proportion of flows by delaying allocating bandwidth for them. Further, our proposal modifies only the endpoints, leaving the network gears untouched.

Differentiated Transport-Layer Network Bandwidth Allocation for InfiniBand Datacenter

Datacenters have become the important infrastructure to provide resource and service.The different applications based on virtualization require more rigid and diverse network performance guarantee which motivates us to change traditional TCP-based transmission mechanism in datacenter networks(DCN).After introducing the inherent characteristic of DCN,we concluded three kinds of insight of the improvement to DCN transport layer.Based on the elaboration of key techniques in IB(InfiniBand) transmission optimization we propose the new-type transmission control model for DCN with the advantage of observable network,differentiated application services as well as administrable policies.This paper analyze IB Congestion Control(CC) algorithm as the core transmission control in IB and its related parameters.The proportional bandwidth allocation at the flow level is proved based on the differentiated CC parameter settings.In the end,real IB platform is established to verify that tenant-level fair bandwidth share can be maintained based on the dynamic parameter configuration.It obviously supports the bandwidth isolation demand in cloud datacenter.

TCP slow start with fair share of bandwidth

The initial start-up performance of TCP largely depends on two parameters – ssthresh and cwnd. When these values are not accurate, TCP cannot utilize the bandwidth fully or may generate multiple packet drops. Unfortunately, estimating these parameters are not easy, since little network state information is available for the TCP connection initially. From earlier research, a TCP parameter of a previous connection with the same destination was suggested to be used for a new TCP connection. However, the effectiveness of this method is limited, since the cached parameter of single destination is used. As another attempt, a network monitor was adopted to identify the connections sharing the same subnet, and an averaged parameter of those connections was used for a new TCP connection. In this approach, the overhead of the network monitor may be high. In this paper, fairness of TCP connections sharing the same bottleneck links is considered in obtaining ssthresh and cwnd of a new TCP connection without a network monitor. For evaluation, these parameters are used in simulation with four different slow start strategies, namely, LISS, ISS, MISS, and JS, depending on which parameters are used and whether packet pacing is used. The simulation results show that our estimation method works well for homogeneous and moderately heterogenous environments.

Resource Management in Ambient Network using Network Processor

The Ambient Network project aims at designing a future networking environment where today’s networks (cellular, wireless, fixed) are seamlessly integrated offering a richer and smarter networking experience to applications and users. An efficient resource management method to deal with different characteristics of the heterogeneous technologies is the need of the hour. IXP 2800 network processor is the high end device designed for 10 gigabit data rates with typical usage in high speed packet forwarding systems and ambient networks. This project aims at using network processors for solving resource management issues in ambient networks. The problem of fair allocation among contending traffic flows on a link has been extensively reasearched. Moreover, conventional resource scheduling algorithms depend strongly upon the assumption of prior knowledge of network parameters and cannot handle variations or lack of information about these parameters. In this paper a novel scheduler called the Composite Bandwidth and CPU Scheduler (CBCS). Which jointly allocates the fair share of the link bandwidth as well as processing resource to all competing flows. CBCS also uses a simple and adaptive online prediction scheme for reliably estimating the processing time of the packet.

Measurement and Modeling of the Origins of Starvation of Congestion-Controlled Flows in Wireless Mesh Networks

Significant progress has been made in understanding the behavior of TCP and congestion-controlled traffic over CSMA-based multihop wireless networks. Despite these advances, however, no prior work identified severe throughput imbalances in the basic scenario of mesh networks, in which a one-hop flow contends with a two-hop flow for gateway access. In this paper, we demonstrate via real network measurements, testbed experiments, and an analytical model that starvation exists in such a scenario; i.e., the one-hop flow receives most of the bandwidth, while the two-hop flow starves. Our analytical model yields a solution consisting of a simple contention window policy that can be implemented via standard mechanisms defined in IEEE 802.11e. Despite its simplicity, we demonstrate through analysis, experiments, and simulations that the policy has a powerful effect on network-wide behavior, shifting the network's queuing points, mitigating problematic MAC and transport behavior, and ensuring that TCP flows obtain a fair share of the gateway bandwidth, irrespective of their spatial location.

An adaptive fuzzy-based CAC scheme for uplink and downlink congestion control in converged IP and DVB-S2 networks

This paper introduces a robust buffer occupancy-based connection admission control (CAC) mechanism to alleviate both uplink and downlink congestions in converged IP and broadcasting networks. The scheme also ensures a fair share of downlink bandwidth among competing satellite terminals (subnetworks) in the event of congestion. The proposed scheme is dubbed Weighted Fair CAC (W-FCAC). It accepts or rejects connections based on an adaptive fuzzy-based approach. The use of the fuzzy-based mechanism is for the purpose of overcoming issues related to instantaneous link capacity assessment, flow characterization and the associated high computational complexity, and use of traffic descriptors for new flows. Additionally, the adaptive fuzzy logic makes the proposed CAC approach robust to traffic dynamics. These features make the scheme highly suitable for DVB-S2 environments where the link capacity frequently fluctuates due to the adaptive coding/modulation of the physical layer during noisy periods. Simulation results elucidate that the proposed W-FCAC scheme prevents downlink congestion and fairly allocates network resources among satellite terminals. It also minimizes the frequency of congestion events while maintaining efficient utilization of network resources.

A novel resource scheduling algorithm for QoS-aware services on the Internet

The popularity and availability of Internet connection has opened up the opportunity for network-centric collaborative work that was impossible a few years ago. Contending traffic flows in this collaborative scenario share different kinds of resources such as network links, buffers, and router CPU. The goal should hence be overall fairness in the allocation of multiple resources rather than a specific resource. In this paper, firstly, we present a novel QoS-aware resource scheduling algorithm called Weighted Composite Bandwidth and CPU Scheduler (WCBCS), which jointly allocates the fair share of the link bandwidth as well as processing resource to all competing flows. WCBCS also uses a simple and adaptive online prediction scheme for reliably estimating the processing times of the incoming data packets. Secondly, we present some analytical results, extensive NS-2 simulation work, and experimental results from our implementation on Intel IXP2400 network processor. The simulation and implementation results show that our low complexity scheduling algorithm can efficiently maximise the CPU and bandwidth utilisation while maintaining guaranteed Quality of Service (QoS) for each individual flow.

Cross-Layer Fair Bandwidth Sharing for Multi-Channel Wireless Mesh Networks

In a wireless mesh network (WMN) with a number of stationary wireless routers, the aggregate capacity can be increased when each router is equipped with multiple network interface cards (NICs) and each NIC is assigned to a distinct orthogonal frequency channel. In this paper, given the logical topology of the network, we mathematically formulate a crosslayer fair bandwidth sharing problem as a non-linear mixedinteger network utility maximization problem. An optimal joint design, based on exact binary linearization techniques, is proposed which leads to a global maximum. A near-optimal joint design, based on approximate dual decomposition techniques, is also proposed which is practical for deployment. Performance is assessed through several numerical examples in terms of network utility, aggregate network throughput, and fairness index. Results show that our proposed designs can lead to multi-channelWMNs which are more efficient and fair compared to their singlechannel counterparts. The performance gain on both efficiency and fairness increase as the number of available NICs per router or the number of available frequency channels increases.

Improving fairness among TCP flows by stateless buffer control with early drop maximum

Transmission control protocol (TCP) has been recognized as the most important transport-layer protocol for the Internet. It is distinguished by its reliable transmission, flow control, and congestion control. However, the issue of fair bandwidth-sharing among competing flows was not properly addressed in TCP. As web-based applications and interactive applications grow more popular, the number of short-lived flows conveyed on the Internet continues to rise. With conventional TCP, short-lived flows will be unable to obtain a fair share of available bandwidth. As a result, short-lived flows will suffer from longer delays and a lower service rate. It is essential for the Internet to come up with an effective solution to this problem in order to accommodate the new traffic patterns. With a more equitable sharing of bottleneck bandwidth as its goal, a stateless queue management scheme featuring early drop maximum (EDM) is developed and presented in this article. The fundamental idea is to drop packets from those flows having more than an equal share of bandwidth. The congestion window size of a TCP sender is carried in the options field on each packet. The proposed scheme will be exercised on routers and make its decision on packet dropping according to the congestion windows. In case of link congestion, the queued packet with the largest congestion window will be dropped from the queue. This will lower the sending rate of its sender and release part of the occupied bandwidth for the use of other competing flows. By so doing, the entire system will approach an equilibrium point with a rapid and fair distribution of bandwidth. As a stateless approach, the proposed scheme inherits numerous advantages in implementation and scalability. Extensive simulations were conducted to verify the feasibility and the effectiveness of the proposed approach. As revealed in the simulation results, the proposed scheme outperforms existing stateless techniques, including Drop-Tail and Random Early Drop, in many respects, such as a fairer sharing of available bandwidth and a shorter response time for short-lived flows.

TCP-Cherry: A new approach for TCP congestion control over satellite IP networks

TCP performance is vulnerable to long delays and errors over satellite links despite their potential for ubiquitous coverage. In this paper, we therefore propose a new TCP congestion control mechanism, TCP-Cherry, to improve TCP performance over satellite IP networks. The basic idea is to probe the network for available resources using data segments that do not put the network into congestion. To this goal, TCP-Cherry deploys a new type of low-priority data segments, namely, supplement segments that in addition to probing the network, carry data not yet transmitted as regular data segments. Our major contributions in this work include two new algorithms, Fast-Forward Start and First-Aid Recovery, for congestion control in the presence of data segments belonging to two different levels of priority. Another unique feature of our scheme is the mechanism for selection of supplement segments which keeps the overhead of duplicate transmission minimum. We also propose a simple scheme for avoiding gradual decrease of TCP congestion window owing to recurring loss of probing segments. Simulation results show that our proposed TCP-Cherry yields upto a maximum improvement of more than 150% in goodput compared with other existing schemes. We also observe that TCP-Cherry maintains a fair share of bandwidth among competing TCP connections. In addition, the supplement segments used for probing the network induce the minimal network overhead.

Loss-resilient window-based congestion control

This paper addresses the problem of fair allocation of bandwidth resources on lossy channels in hybrid heterogeneous networks. It discusses more particularly the ability of window-based congestion control to support non-congestion related losses. We investigate methods for efficient packet loss recovery by retransmission, and build on explicit congestion control mechanisms to decouple the packet loss detection from the congestion feedback signals. For different retransmission strategies that respectively rely on conventional cumulative acknowledgments or accurate loss monitoring, we show how the principles underlying the TCP retransmission mechanisms have to be adapted in order to take advantage of an explicit congestion feedback. A novel retransmission timer is proposed in order to deal with multiple losses of data segments and, in consequence, to allow for aggressive reset of the connection recovery timer. It ensures significant benefit from temporary inflation of the send-out window, and hence the fair share of bottleneck bandwidth between loss-prone and lossy connections. Extensive simulations analyze the performance of the new loss monitoring and recovery strategies, when used with two distinct explicit congestion control mechanisms. The first one relies on a coarse binary congestion notification from the routers. The second one, introduced in [D. Katabi, M. Handley, C. Rohrs, Internet congestion control for high bandwidth-delay product environments, ACM SIGCOMM (2002) 89-102], exploits accurate and finely-tuned router feedbacks to compute a precise congestion window adjustment. For both congestion control mechanisms, we observe that retransmissions triggered based on a precise monitoring of losses lead to efficient utilization of lossy links, and provide a fair share of the bottleneck bandwidth between heterogeneous connections, even for high loss ratios and bursty loss processes. Explicit window-based congestion control, combined with appropriate error control strategies, can therefore provide a valid solution to reliable and controlled connections over lossy network infrastructures.

ATM 망에서 인터넷 서비스를 위한 셀 스케줄링 알고리즘

최근 ATM 포럼에서 승인한 GFR(Guaranteed Frame Rate) 서비스는 ATM 망에서 TCP/IP 트래픽을 효율적으로 서비스하는 중요한 서비스가 될 것으로 기대된다. GFR 서비스는 프레임 단계에서 최소 대역 서비스를 보장할 뿐 아니라 가용 대역을 공평하게 사용하도록 지원한다. 본 논문에서는 GFR 서비스를 위한 새로운 셀 스케쥴링 알고리즘을 제안한다. 제안된 알고리즘은 VC에 우선순위를 제공하고 버퍼에 있는 좀더 서비스를 받지 못한 셀에 좀더 높은 우선순위를 부여한다. 높은 우선순위의 VC들은 낮은 우선순위의 VC들 보다 더 많은 서비스를 받는다. 제안된 알고리즘은 GFR VC에 MCR 보장과 공평 대역 공유를 제공할 수 있다. 시뮬레이션 결과는 제안된 셀 스케줄링 알고리즘이 TCP 출력과 공평성 면에서 기존의 알고리즘 보다 우수한 성능을 제공함을 보여주고 있다. Guaranteed Frame Rate(GFR), recently approved by the ATM Forum, expects to become an important service category to efficiently support TCP/IP traffic in ATM networks. The GFR service not only guarantees a minimum service rate at the frame level, but also supports a fair share of available bandwidth. We proposed new scheduling scheme for the GFR service. Proposed scheme provides priority to VCs and high priority to a VC which have more untagged cells in buffer. High priority VCs have much more serviced than low priority. Proposed scheme can provide MCR(minimum cell rate) guarantee and fair sharing to GFR VCs. Computer simulation results show that proposed scheduling scheme provide a much better performance in TCP goodput and fairness than previous scheme.

Design, Analysis and Implementation of a Novel Multiple Resource Scheduler

Over the past decade, the problem of achieving fair bandwidth allocation on a link shared by multiple traffic flows has been extensively researched. However, as these flows traverse a computer network, they share many different kinds of resources, such as links, buffers, and router CPU. The ultimate goal should hence be overall fairness in the allocation of multiple resources rather than a single specific resource such as link bandwidth. In this paper, we present a novel scheduler, called prediction-based composite fair queuing (PCFQ), which jointly allocates the fair share of the link bandwidth and processing resources to all competing flows. We derive the worst-case delay bound, the work complexity, and the relative fairness bound for the PCFQ scheduler and show that it outperforms a system consisting of separate bandwidth and CPU schedulers. We further present simulation results which illustrate the improved performance characteristics achieved by PCFQ. We also demonstrate that our composite scheduler can be easily implemented on an off-the-shelf network processor such as the Intel IXP 2400. Experimental results from the IXP 2400 implementation highlight the effectiveness and high performance of this algorithm in a real-world system.

Enhancement of fairness in a DiffServ network using a novel queuing algorithm

Core-Stateless Fair Queuing (CSFQ) algorithm was proposed to allocate bandwidth fairly at routers in the Differentiated Services Model (DiffServ Model). However, CSFQ can not effectively provide the fairness between TCP connections and UDP connections. Besides, the setting of buffer size strongly affects the efficiency of CSFQ. In this paper, we present a novel CSFQ-based queuing algorithm. Based on the estimated value of fair share, the probability to drop packet is determined to ensure fair share of bandwidth. The simulated experimental results demonstrate that the proposed scheme outperforms CSFQ.

Bandwidth-sharing networks in overload

Bandwidth-sharing networks as considered by Massoulié and Roberts provide a natural modeling framework for describing the dynamic flow-level interaction among elastic data transfers. Under mild assumptions, it has been established that a wide family of so-called α -fair bandwidth-sharing strategies achieve stability in such networks provided that no individual link is overloaded. In the present paper we focus on α -fair bandwidth-sharing networks where the load on one or several of the links exceeds the capacity. Evidently, a well-engineered network should not experience overload, or even approach overload, in normal operating conditions. Yet, even in an adequately provisioned system with a low nominal load, the actual traffic volume may significantly fluctuate over time and exhibit temporary surges. Furthermore, gaining insight into the overload behavior is crucial in analyzing the performance in terms of long delays or low throughputs as caused by large queue build-ups. The way in which such rare events tend to occur, commonly involves a scenario where the system temporarily behaves as if it experiences overload. In order to characterize the overload behavior, we examine the fluid limit, which emerges from a suitably scaled version of the number of flows of the various classes. The convergence of the scaled number of flows to the fluid limit is empirically validated through simulation experiments. Focusing on linear solutions to the fluid-limit equation, we derive a fixed-point equation for the corresponding asymptotic growth rates. It is proved that a fixed-point solution is also a solution to a related strictly concave optimization problem, and hence exists and is unique. We use the fixed-point equation to investigate the impact of the traffic intensities and the variability of the flow sizes on the asymptotic growth rates. The results are illustrated for linear topologies and star networks as two important special cases. Finally, we briefly discuss extensions to models with user impatience.

Design, Analysis, and Implementation of a Novel Low Complexity Scheduler for Joint Resource Allocation

Over the past decade, the problem of fair bandwidth allocation among contending traffic flows on a link has been extensively researched. However, as these flows traverse a computer network, they share different kinds of resources (e.g., links, buffers, router CPU). The ultimate goal should hence be overall fairness in the allocation of multiple resources rather than a specific resource. Moreover, conventional resource scheduling algorithms depend strongly upon the assumption of prior knowledge of network parameters and cannot handle variations or lack of information about these parameters. In this paper, we present a novel scheduler called the composite bandwidth and CPU scheduler (CBCS), which jointly allocates the fair share of the link bandwidth as well as processing resource to all competing flows. CBCS also uses a simple and adaptive online prediction scheme for reliably estimating the processing times of the incoming data packets. Analytically, we prove that CBCS is efficient, with a per-packet work complexity of O(1). Finally, we present simulation results and experimental outcomes from a real-world implementation of CBCS on an Intel IXP 2400 network processor. Our results highlight the improved performance achieved by CBCS and demonstrate the ease with which it can be implemented on off-the-shelf hardware

Flow-level QoS for a dynamic load of rate adaptive sessions sharing a bottleneck link

We consider the flow-level quality of service (QoS) seen by a dynamic load of rate adaptive sessions sharing a bottleneck link based on fair share bandwidth allocation. This is of interest both in considering wired networks supporting rate adaptive multimedia sessions and wireless networks supporting voice with rate adaptation to realize graceful degradation during congested periods. Two QoS metrics are considered: the time-average instantaneous utility of the allocated bandwidth, and the time-average of transition penalties associated with the changes in allocation seen by a flow. We present a simple model for rate adaptation, where (heterogeneous) flows can vary their rates within (different) ranges, and present closed-form results for these perceived flow-level QoS metrics. We then prove asymptotic results for large capacity systems exhibiting the salient features of rate adaptation in a dynamic network. Finally, we provide a concrete example, showing how the QoS seen by sessions with different degrees of adaptivity would vary under a natural fair bandwidth allocation policy.