Proposal for Adaptive Bandwidth Allocation Using One-Way Feedback Control for MPLS Networks

In this paper, we propose an adaptive bandwidth allocation (BA) and connection admission control (CAC) mechanism based on game theory for polling services in IEEE 802.16 broadband wireless networks. A noncooperative two-person general-sum game is formulated where the base station and a new connection are the players of this game. The game formulation provides not only the decision on accepting or rejecting a connection, but also the amount of bandwidth allocated to a new connection (if admitted). A queueing model considering adaptive modulation and coding (AMC) in the physical layer is used to analyze quality of service (QoS) performances, namely, delay and throughput performances, respectively, for real-time and non-real-time polling services. This queueing model is used by the proposed bandwidth allocation and admission control game to ensure that the payoffs for both the base station and the new connection are maximized. The performance of the proposed scheme is evaluated by simulation and compared with that of traditional admission control with static and adaptive bandwidth allocation.

In this paper, we present a theoretical framework and a distributed mechanism for fair bandwidth allocation on a network with various bottleneck links. In our model, a user is guaranteed a minimum bandwidth and charged a price for a bandwidth capacity request. We defined a utility function that reflects user's bandwidth demand when the user requests the bandwidth capacity. We then present a non-cooperative game with social welfare function to resolve users' conflicting bandwidth capacity requests at bottleneck links. We also show that our proposed game-theoretic solution guarantees fair bandwidth allocation as defined in our residual capacity fairness. In order to guarantee the minimum bandwidth requirement, we integrate an admission control in our solution. However, global optimal admission conditions are not easy to implement for large networks. We therefore propose a distributed admission scheme. As a result, the paper presents fair and practical distributed algorithms for bandwidth allocation and admission control in enterprise networks. Our simulation and evaluation study show that the distributed approach is sufficiently close to the global optimal solution.

The network resource allocation in SDN for control applications is becoming a key problem in the near future because of the conflict between the need of the flow-level flexibility control and the limited capacity of flow table. Based on the analysis of the difference of the definition of network resource between SDN and traditional IP network, the idea of the integrated allocation of link bandwidth and flow table for multiple control applications in SDN is proposed in this paper. Furthermore, a price-based joint allocation model of network resource in SDN is built by introducing the price for each of the resources, which can get the proportional fair allocation of link bandwidth and the minimum global delay at the same time. We have also designed a popular flow scheduling policy based on the proportional fair allocation of link bandwidth in order to achieve the minimum global delay. A flow scheduling module has been implemented and evaluated in Floodlight, named virtual forwarding space (VFS). VFS can not only implement the fair allocation of link bandwidth and minimum delay flow scheduling in data plane but also accelerate packet forwarding by looking up flow cache in control plane.

In order to provide high speed broadband access to users in next generation networks, Gigabit Ethernet-Passive Optical Network (GE-PON) has emerged as one of the most promising technologies. The evolution of the GE-PON technology permits the users to connect to the Internet via gigabit access networks, which contribute to the increase of the network traffic in not only downstream but also along the upstream direction. However, the increase of the upstream traffic may lead to network congestion and complicate the bandwidth allocation issue, thereby affecting the Quality-of-Service (QoS) requirements of the users. In this paper, we point out the performance degradation issue of Transmission Control Protocol (TCP) communications due to the unanticipated effect of Dynamic Bandwidth Allocation (DBA) mechanism employed in GE-PONs. When network congestion occurs, DBA fails to achieve efficient and fair sharing of the bottleneck bandwidth amongst a number of competing TCP connections. In order to overcome this shortcoming of the conventional DBA scheme, we envision an appropriate solution by controlling the TCP flows' rates based upon packet marking. The envisioned solution, dubbed as PPM-TRC, aims at controlling the TCP throughput for achieving both high efficiency and fair utilization of the passive optical line. The effectiveness of the PPM-TRC approach, verified through extensive computer simulations, demonstrates its applicability in dealing with a large number of competing traffic flows.

MPLS and DiffServ have been widely accepted as the service model to adopt for providing Quality of Services (QoS) over next generation IP networks. The combination of MPLS and DiffServ presents a very attractive strategy to broadband network providers. Bandwidth Allocation mechanism in DiffServ guaranties to meet the QoS requirements for all types of services. The objectives of this paper are to simulate and estimate the efficiency of Maximum Allocation with Reservation (MAR) method in small network cases. Problem statement of MAR is enhanced with bandwidth utilization variables. Simulation results illustrate the efficiency of traffic predictors and MAR in small network cases. Ill. 3, bibl. 8 (in English; summaries in English, Russian and Lithuanian).

The growth of real-time, streaming media application traffic in the Internet presents a number of challenges to the Internet Service Provider (ISP) because most of the real-time constraints and interactive nature of these applications render the use of unreliable User Datagram Protocol (UDP) or ineffective Transmission Control Protocol (TCP). These streaming media application flows are usually high bandwidth and long duration, which means they should utilize network congestion control to avoid congestion collapse and ensure fairness. The Internet Engineering Task Force (IETF) developed the Datagram Congestion Control Protocol (DCCP) to provide congestion control for these types of real-time applications. A major factor behind this effort was the desire to eliminate the duplication of effort and potential for error resulting from each application implementing its own congestion control. The emergence of new concept of centrally controlled Software-Defined Networks (SDN), really take advantage of the information available at the central controller to improve network performance. In this paper, the performance of video streaming was examine, and it is shown that DCCP capable of having a fairly bandwidth tolerance to other network traffic than typical real-time, streaming media congestion control methods. Given fair bandwidth allocation using OpenFlow protocol, DCCP provides equivalent or better video quality.

In this paper a global control system for admission control, routing and bandwidth allocation in the ATM environment is presented. The traffic is divided into classes, characterized by statistical parameters and by quality of service (QoS) requirements, as the rates of lost and delayed cells. At connection set-up, a strategy decides if a connection request has to be accepted or rejected and which is the best route that all the cells of that connection have to follow. The decision about acceptance guarantees the QoS requirements for each class, while the routing strategy is aimed at minimizing the number of blocked calls in the network. The whole system provides also a mechanism to achieve a fair and adaptive bandwidth allocation for each traffic class; the bandwidth allocation control has a longer intervention period than the admission and routing control. In fact, the global strategy can be regarded as a hierarchical one. Several simulation results are reported, to verify the effectiveness both of the admission and routing mechanism and of the allocation strategy.

Fairness and system throughput, influenced by wireless interference, are major objectives of resource allocation in wireless networks. Whereas traditionally max-min fairness protocols have been developed for wired networks (where interference is not a factor for network performance), in this paper we investigate the problem of flow routing and fair bandwidth allocation under the constraints of the physical interference model for multihop wireless networks. A max-min fair (MMF) routing algorithm under physical interference constraints is proposed where multiple candidate paths coexist for each user to the base station. The algorithm is formulated as a multicommodity flow problem where the lexicographically largest bandwidth allocation vector is found among all optimal allocation vectors. We compare our approach with two MMF interference routing algorithms in the literature that use the protocol interference model to garner fair bandwidth allocation. We show that our algorithm performs better in terms of blocking probability, bandwidth usage and link load.

TCP congestion control has been designed to ensure Internet stability along with fair and efficient allocation of the network bandwidth. During the last decade, many congestion control algorithms have been proposed to improve the classic Tahoe/Reno TCP Congestion control. This paper aims at evaluating and comparing three control algorithms, which are Westwood+, New Reno and Vegas TCP. Simulation scenarios are carefully designed in order to investigate goodput, fairness and friendliness provided by each of the algorithms. results show that Westwood+ TCP is friendly towards New Reno TCP and improves fairness in bandwidth allocation whereas Vegas TCP is fair but is not able to grab its bandwidth share when coexisting with Reno or in the presence of reverse traffic because of its RTT-based congestion detection mechanism. Finally results show that Westwood* remarkably improves utilization of wireless links that are affected by losses not due to congestion.

Architecture and performance of non-blocking ATM switches with shared internal queueing

In a previous work we have proposed the PD (proportional and derivative) algorithm, which is an explicit algorithm for ABR flow control in ATM networks. The performance study of this algorithm has shown that on one hand, it achieves a full utilization of network links and the fairness in bandwidth allocation. On the other hand, the PD algorithm ensures good buffer occupancy with respect to the fixed threshold. In this study, both a simple network topology and the GFC1 topology have been considered. The PD algorithm implies control gains in the calculation of the supported rate, thus in this paper, we are interested in investigating the effect of the control gain choice on the stability of the system, in terms of buffer occupancy and source rate behaviour, when the PD algorithm is applied.

It has been reported that TCP Reno underutilizes network bandwidth, especially in High-Speed Long-Distance (HSLD) networks, while it has been widely adopted the dominant transport protocol in current Internet. Moreover, the Additive Increase Multiplicative Decrease (AIMD) congestion control algorithm of the TCP Reno has equilibrium and dynamic problems that become more and more severe as the bandwidth-delay product increases. An ideal TCP congestion control algorithm that achieves a high utilization, a small queueing delay, a stable behavior and fairness in bandwidth allocation has been major objectives of networking research in recent years. In this paper, we propose a new congestion control protocol, called TCP KWIK, a modification to the TCP Reno for HSLD networks. TCP KWIK uses delay-based feedback information to address these problems in order to stabilize a network around a fair and efficient operating point. We argue that the delay-based approach is better than the end-to-end congestion control as the networks capacity increases. Their advantage is small at low speed but decisive at high speed. The simulation results demonstrate the effectiveness of our proposed algorithm.KeywordsPacket LossCongestion ControlLoss ProbabilityRound Trip TimeCongestion WindowThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Heterogeneous networks (HetNets) composed of macrocells and small cells are expected to improve the transmission performance of users significantly. Designing efficient resource allocation schemes, specifically, bandwidth allocation and power allocation schemes for HetNets is of particular importance for it may affect user quality of service (QoS) and network performance severely. In this paper, we consider the resource allocation problem of a HetNet composed of a macrocell and a number of femtocells and propose a resource characteristic and user QoS oriented bandwidth and power allocation algorithm for the femto base stations (FBSs) which share spectrum with the macro base station. By taking into account the service requirements of the femto user equipments (FUEs) and the bandwidth resource characteristics of the network, various bandwidth resource allocation schemes are proposed. Particularly, in the case of slightly insufficient bandwidth resource, we propose a bankruptcy game based bandwidth resource allocation algorithm for the FBSs, and solve the bandwidth allocation problem by means of Shapley value method. To stress the tradeoff between data rate and power consumption, we examine the energy efficiency of the FBSs and formulate the power allocation problem as a multi-objective optimization problem with the objectives of maximizing the energy efficiency of all the FBSs. The optimal power allocation strategy can be obtained by solving the optimization problem via ideal point method and generic algorithm. Simulation results demonstrate the efficiency of the proposed algorithm.

With the rapidly growth of the network technology, broadband communication systems have become very important. However, most scheduling algorithms in network devices lacks of the ability to dynamically allocate bandwidth among connection with various quality demand. In this paper, we propose an adaptive bandwidth allocation mechanism to enhance the network quality to meet the requirements of various applications. The proposed scheme can allocate the resources of the network bandwidth according to the queue dynamics of each router and a weight-adjusting mechanism that comprises priorities. In this algorithm, we not only consider the priority of each queue, but also will efficiently utilize the link bandwidth. To verify the proposed scheme, we develop a packet schedule based on Linux kernel. The result shows that the proposed scheduling algorithm indeed improves the bandwidth utilization and comprises the priority mechanism.

Queue management and congestion control are very important to the robustness and fairness of the Internet. In this paper, a new queue management algorithm, termed self adjustable choke (SAC) is proposed to achieve both fairness and congestion control in an Internet router. It is based on the well-known RED algorithm and a recently proposed CHOKe algorithm. The SAC scheme has kept the advantages of simplicity and lower processing cost of RED and CHOKe, while solving their unfair bandwidth allocation properties. In particular, the SAC scheme treats TCP and UDP flows differently, and can adaptively adjust its parameters according to the current traffic status. As a result, using the SAC, bandwidth is distributed evenly among different flows, no matter how different these flows are. This will be demonstrated and compared to CHOKe using experimental results under various traffic scenarios.