基于市场拍卖模型的ATM网络ABR业务控制

本文提出一种分布式的、基于用户竞价模型的ＡＴＭ网络ＡＢＲ业务控制机制,可为用户提供在业务传输中没价格与不同服务质量等级之间的协商。在此欺压耻我们定义了新的资源利用公平性准则。它是最大一最小准则的扩充,本文方法所用的控制和计旨易于实现,并且遵循ＡＴＭ论坛提出的ＡＢＲ业务明确位率反馈控制规范,因而此方法ＡＢＲ业务的计旨几分布式管理相集成提供了一条新思路。     

Evaluation of congestion control protocols for ABR traffic over ATM networks

Congestion control is very important for effective and stable operation of ATM (Asynchronous Transfer Mode) networks. Owing to the bursty and unpredictable characteristic of data network traffic, its congestion control is particularly a challenge for network researchers and designers. The ATM Forum has recently adopted rate‐based congestion control for ABR (Available Bit‐Rate) traffic which is the service class defined for data network applications. However, there is a number of congestion control schemes prevalent. ATM Forum has decided not to specify switch behaviour for ABR traffic; this has further introduced additional ambiguity. Consequently, an evaluation and comparison of the existing protocols would provide valuable guidance for network designers and engineers; it would also give insight for researchers to explore the essence of different congestion control schemes. In the first part of this paper, we investigate the effectiveness of ABR congestion control in the presence of bursty source traffic and the relationship between the burst time scale and the ABR control time scale. Two ABR congestion control schemes, the ABR Explicit Forward Congestion Indication (EFCI) and ABR Congestion Indication (CI) schemes, are compared with Unspecified Bit Rate (UBR) transport which makes no effort to control congestion. Traffic sources of various burst lengths of 100, 1000, 10000, and an equal mix of 100 and 10000 ATM cells are used in simulations. It is found that ABR congestion control schemes effectively control low frequency, medium to long‐term traffic load transients. This is further supported by the result of integrating TCP over ATM congestion control schemes included in the paper. ABR control schemes do not control high frequency, short‐term load transients well, but ABR control is not necessary in such cases since short‐term transients do not require a large amount of buffering. In the second part of this paper, we evaluate and compare six rate‐based congestion control protocols including Scheme I: EFCI, Scheme II: EFCI with separate RM queues, Scheme III: CI, Scheme IV: CI with separate RM queues, Scheme V: the CAPC2 ER (Explicit Rate), and Scheme VI: the EFCI with utilization‐based congestion indication. Each scheme is simulated and compared in the LAN, WAN, and GFC (General Fairness Configuration) environments specified by the ATM Forum. Effects of varying VC (Virtual Circuits) number and changing endsystem–switch distance has been investigated. Their fairness is also compared using the GFC configuration. We have found that ER control scheme performs significantly better than the other five binary control schemes by its faster response to congestion, smoother regulation of bit‐rates, lower queueing delay, shorter buffer queue length, and fairness. Among the other five schemes, the CI scheme performs better than the EFCI scheme. Providing separate RM queues has significantly improved the EFCI scheme in the WAN environment, but has little effect on the CI scheme. Link utilization‐based congestion detection has suffered from either low utilization or an excess cell loss which is unacceptable in most data applications. Copyright © 2000 John Wiley & Sons, Ltd.     

ATM网络中ABR业务的开环控制机制

ＡＴＭ网络中ＡＢＲ业务的流量控制是ＡＴＭ论坛的流量管理规范（ＴＭ４．０）中没有完全解决的问题,ＡＢＲ基于速率的闭环控制方案在最大－最小准则下获得了一定进展。但在拥塞发生在信源外或对突发性业务进行控制的情况下,添加开环控制的ＡＢＲ拥塞控制可以获得比闭环控制更佳的作用。研究了ＡＢＲ的开环控制方案,早期的ＵＩＬＩ机制本身存在在一定的问题,在交换机处采用基于计数的ＵＩＬＩ机制能够取得较好的效果。     

On the performance and fairness of dynamic channel allocation in wireless mesh networks

Channel assignment in multichannel multiradio wireless mesh networks is a powerful resource management tool to exploit available multiple channels. Channels can be allocated either statically on the basis of long‐term steady state behavior of traffic or dynamically according to actual traffic demands. It is a common belief that dynamic schemes provide better performance; however, these two broad classes of channel allocation schemes have not been compared in detail. In this paper, we quantify the achievable performance gain and fairness improvement through an optimal dynamic channel allocation scheme. We develop optimal algorithms for a dynamic and three static schemes using mixed integer linear programming and compare them in the context of QoS provisioning, where network performance is measured in terms of acceptance rate of QoS sensitive traffic demands. Our extensive simulations show that static schemes should optimize channel allocation for long‐term traffic pattern and maintain max–min fairness to achieve acceptable performances. Although the dynamic and max–min fair static schemes accomplish the same fairness, the dynamic channel allocation outperforms the static scheme about 10% in most cases. In heavily overloaded regimes, especially when network resources are scarce, both have comparable performances, and the max–min fair scheme is preferred because it incurs less overhead. Copyright © 2011 John Wiley & Sons, Ltd.     

效用max—min公平准则及其在ABR业务中的应用

本文提出一种新的基于效用函数的max-min(UMM）公平准则,它实现的是用户效用之间的公平分配。在ABR业务下,本文提出UMM公平性的另外两个等价定义,考察了用户的最小需求和最大需求。为了求解UMM公平分配,文中给出集中式的UMM公平分配算法及其数学证明。文章从保证分配效率的角度出发赋予峰值信元位率PCR以新的含义。UMM公平性不仅是对以往ABR业务中max-min公平性的概括,还具有很好的推广前景,特别适用于多应用类型的网络资源分配。     

Buffer management and scheduling schemes for TCP/IP over ATM‐GFR

Today ATM technology is facing challenges from integrated service IP, IP switching, gigabit IP router and gigabit ethernet. Although ATM is approved by ITU‐T as the standard technology in B‐ISDN, its survivability is still in question. Since ATM‐UBR (unspecified bit rate) provides no service guarantee and ATM‐ABR (available bit rate) is still unattainable for most users, many existing users have little or no incentives to migrate to ATM technology. The guaranteed frame rate (GFR) service is introduced to deal with this dilemma. The GFR can guarantee the minimum cell rate (MCR) with fair access to excess bandwidth. This paper studies various schemes to support the GFR. We have studied different discarding and scheduling schemes, and compared their throughput and fairness when TCP/IP traffic is carried. Through simulations, it is shown that only per‐VC queueing with weighted round robin (WRR) can guarantee minimum cell rate. Among all the schemes that have been explored, we recommend dynamic threshold–early packet discard (DT–EPD) integrated with MCR+ (a WRR variant) to support the GFR service. Copyright © 2001 John Wiley & Sons, Ltd.     

Scalable max–min fairness in wireless ad hoc networks

Our previous work proposes a macro model to perform flow and access control in wireless ad hoc networks. In this paper, we demonstrate specifically how to apply the model to achieve max–min fair rate allocation. Our proposed scheme is simple and scalable when comparing to other techniques in the literature. Moreover, it has the ability to provide stability in mobile environment. Simulation results show that our new method provides a good max–min fair flow assignment, and with that assignment, quality of service guarantees can be achieved for real-time applications.     

Bandwidth borrowing‐based QoS approach for adaptive call admission control in multiclass traffic wireless cellular networks

This paper proposes a QoS approach for an adaptive call admission control (CAC) scheme for multiclass service wireless cellular networks. The QoS of the proposed CAC scheme is achieved through call bandwidth borrowing and call preemption techniques according to the priorities of the traffic classes, using complete sharing of the available bandwidth. The CAC scheme maintains QoS in each class to avoid performance deterioration through mechanisms for call bandwidth degradation, and call bandwidth upgrading based on min–max and max–min policies for fair resource deallocation and reallocation, respectively. The proposed adaptive CAC scheme utilizes a measurement‐based online monitoring approach of the system performance, and a prediction model to determine the amount of bandwidth to be borrowed from calls, or the amount of bandwidth to be returned to calls. The simulation‐based performance evaluation of the proposed adaptive CAC scheme shows the strength and effectiveness of our proposed scheme. Copyright © 2011 John Wiley & Sons, Ltd.     

An Efficient and Fair Strategy for Radio Resources Allocation in Multi-radio Wireless Mesh Networks

A Load and Interference aware Resource Allocation strategy (LIRA) is proposed for multi-radio Wireless Mesh Networks (WMNs), combining multiple mechanisms that efficiently optimise radio resources (rate, power and channel) to guarantee max–min fair capacity to every aggregating Mesh Access Point (MAP). LIRA is composed of a rate adaptation and power control mechanism, sensitive to the fat-tree traffic specificities of WMNs, using the highest bit rates at MAP gateways and using, for the ramified links, the minimum ones that satisfy their capacity needs. This enables to efficiently reduce the transmitted power and interference, advantageous for channel reutilisation. LIRA also integrates a load and interference aware channel assignment mechanism, allowing the simultaneous operation of all links without interference. When this is not achievable, two auxiliary mechanisms of channel sharing and interference-free channel reuse can be sub-sequentially used, reducing the capacity of certain MAPs to guarantee fairness to all nodes. LIRA’s gateway flow-control mechanism guarantees that all MAPs respect the allocated capacity, guaranteeing that every MAP is able to operate at its max–min fair capacity. The performance of LIRA is evaluated through simulation, considering IEEE 802.11a. For a classical hexagonal deployment of 19 MAPs with an Internet gateway, it is shown how with only 5 channels LIRA guarantees to every MAP a max–min fair capacity of 3.2 Mbit/s, without packet loss, and delay below 6 ms. It guarantees a max–min fair throughput to every MAP, having a capacity usage efficiency of 66.7 %, an energy efficiency of 26.5 Mbit/J and spectrum efficiency of 0.58 bit/s/Hz. For a more challenging scenario with 27 MAPs and 4 gateways, it is shown how LIRA uses its mechanisms in heterogeneous conditions to also guarantee max–min fair throughput to every MAP, between 5 and 11 Mbit/s, without packet loss, and a delay below 12 ms. Any system improvement will enable to reach higher WMN performance levels using the proposed strategy.     

A simple,scalable and provably stable explicit rate computation scheme for flow control in communication networks

This paper describes fast rate computation (FASTRAC), an explicit rate flow control algorithm for available bit rate (ABR) traffic. Using digital control theory, we develop a simple rate controller for the ABR flow control process. We prove that the controller is stable, fair to all participating sources and configurable with respect to responsiveness. The analysis presented shows that stability of the flow control process depends primarily on two factors, the control update rate and the feedback delay. The implementation of the proposed algorithm is much simpler than other fair rate allocation algorithms. The proposed algorithm demonstrates the ability to scale with speed, distance, different feedback delays, number of users, and number of nodes while remaining robust, efficient, and fair under stressing and dynamic traffic conditions. Copyright © 2001 John Wiley & Sons, Ltd.     

Design and evaluation of an efficient traffic control scheme for integrated voice,video, and data over asynchronous transfer mode networks: Explicit allowed rate algorithm

Asychronous transfer mode (ATM) networks are high‐speed networks with guaranteed quality of service. The main cause of congestion in ATM networks is over utilization of physical bandwidth. Unlike constant bit‐rate (CBR) traffic, the bandwidth reserved by variable bit‐rate (VBR) traffic is not fully utilized at all instances. Hence, this unused bandwidth is allocated to available bit‐rate (ABR) traffic. As the bandwidth used by VBR traffic changes, available bandwidth for ABR traffic varies; i.e., available bandwidth for ABR traffic is inversely proportional to the bandwidth used by the VBR traffic. Based on this fact, a rate‐based congestion control algorithm, Explicit Allowed Rate Algorithm (EARA), is presented in this paper. EARA is compared with Proportional Rate Control Algorithm (PRCA) and Explicit Rate Indication Congestion Avoidance Algorithm (ERICA), in both LAN and WAN environments. Simulations of all three algorithms are conducted under both congestion and fairness configurations with simultaneous generation of CBR, rt‐VBR, nrt‐VBR and ABR traffic. The results show that, with very small over‐head on the switch, EARA significantly decreases the required buffer space and improves the network throughput. Copyright © 1999 John Wiley & Sons, Ltd.     

Performance analysis of congestion avoidance algorithms with non‐zero MCR guarantee for ABR service in ATM networks

This paper proposes a novel explicit rate allocation algorithm called Fast Rate Allocation Congestion Avoidance (FRACA) algorithm supporting non‐zero minimum cell rate (MCR). The non‐zero MCR guarantee strategy for ABR service in ATM networks focused in this paper is MCR plus equal share (The ATM Forum Traffic Management Specification, version 4.0. April 1996). The main goals for designing the algorithm are the fast convergence according to the max–min fairness criteria, fairness among all sessions, maximum network utilization while the switch queue length is properly controlled. At the same time, it should work well under a wide range of network conditions without the need for adjusting the algorithm parameters. The performance of the proposed algorithm is evaluated and compared with the Generic Weighted Fairness (GWF) ERICA + (J Comput Comm 2000; 149). Simulation results show that the proposed algorithm achieves the design goals in the evaluated scenarios. Copyright © 2004 John Wiley & Sons, Ltd.     

Analysis of Distributed DDQ for QoS Router

In a packet switching network, congestion is unavoidable and affects the quality of real‐time traffic with such problems as delay and packet loss. Packet fair queuing (PFQ) algorithms are well‐known solutions for quality‐of‐service (QoS) guarantee by packet scheduling. Our approach is different from previous algorithms in that it uses hardware time achieved by sampling a counter triggered by a periodic clock signal. This clock signal can be provided to all the modules of a routing system to get synchronization. In this architecture, a variant of the PFQ algorithm, called digitized delay queuing (DDQ), can be distributed on many line interface modules. We derive the delay bounds in a single processor system and in a distributed architecture. The definition of traffic contribution improves the simplicity of the mathematical models. The effect of different time between modules in a distributed architecture is the key idea for understanding the delay behavior of a routing system. The number of bins required for the DDQ algorithm is also derived to make the system configuration clear. The analytical models developed in this paper form the basis of improvement and application to a combined input and output queuing (CIOQ) router architecture for a higher speed QoS network.     

The distributed robust traffic controller for ATM networks

We propose an approach to design a distributed rate‐based traffic controller to flow‐regulate the best‐effort service (e.g. ABR) traffic and guaranteed service traffic through an ATM switch. The controller is distributed among the source nodes and has a very simple structure. Its local controller at each source node is open‐loop stable and only requires the knowledge of the buffer occupancy at the bottleneck switch. We show that this controller is fair and is not sensitive to the change of VCs over time. It does not have oscillation and can achieve a high utilization. Copyright © 2001 John Wiley & Sons, Ltd.     

On the effects of traffic mixtures in direct broadcast satellite networks

In this paper we present a multi‐criterion control simulation in a realistically complex environment of a satellite network, involving non‐symmetric up and downlinks. Direct broadcast satellite (DBS) networks carrying heterogeneous traffic is characterized with challenges, such as high traffic burstiness, wireless channel dynamics, and large, but limited capacity. On the other hand, there are system characteristics that can be leveraged to address these challenges such as in centralized topology, different levels in quality of service (QoS) and priorities, availability of side information about channel conditions, flexibility in delivery of delay insensitive traffic, etc. We have developed an adaptive resource allocation and management (ARAM) system that takes the advantage of such characteristics to maximize the utilization of the available capacity on the forward DBS link, while maintaining QoS in the presence of channel effects and congestion in the network. Since variable‐bit‐rate (VBR) video traffic is given priority over available‐bit‐rate (ABR) data traffic in the ARAM concept, in this paper we investigate the impact of the fraction of VBR load in overall load. Copyright © 2002 John Wiley & Sons, Ltd.     

Allocating fair rates for available bit rate service in ATMnetworks

A central issue in congestion control for the available bit rate (ABR) service in ATM networks is the computation of the fair rate for every connection at each switching node in the network. The objective is to determine the fair rate for all the connections in a distributed network under dynamic changes in the absence of centralized knowledge about the network, and without the synchronization of different network components. The authors study the problem of fair rate allocation, specifying the requirements of a fair rate allocation algorithm, and provide a survey of various proposed fair rate allocation strategies in the context of the ABR service     

Multi-layer Resources Fair Allocation in Big Data with Heterogeneous Demands

The resource fair allocation is very important for the most systems. This paper focuses on the resource allocation in a big data system. This system has the characteristics of multiple resources owning and heterogeneous resource demanding. Firstly, a basic allocation scheme is proposed. Some allocation properties are introduced including sharing incentive, strategy proofness, envy-freeness, Pareto optimality, resource efficiency, single-layer multi-resource fairness, multi-layer single-resource fairness. Secondly, a single layer dominant and max–min fair allocation (SDMMF) is proposed. The basic idea is that the resources are firstly allocated using dominant resource fairness scheme. If some resources are not fully allocated, using max–min fairness scheme allocate the surplus ones. The SDMMF is theoretically proved satisfying all the hierarchical resource allocation properties. Thirdly, a Multi-layer resource allocation scheme, namely multi-layer dominant and max–min fair allocation (MDMMF) is proposed. The basic idea is that a multi-layer resource demand hierarchy can be divided into a series of single layer resource demand. So a resource demand vector can be built in the hierarchy from down to top. Then, the resource allocation of first layer is calculated using SDMMF allocation. The result of such allocation is further allocating in the third layer. Recursively do the MDMMF allocation until the bottom layer nodes obtain resource allocation shares. Lastly, The MDMMF is also theoretically proved satisfying all the hierarchical resource allocation properties.     

Stochastic approximation based on-line algorithm for fairness in multi-rate wireless LANs

It is well known that IEEE 802.11 based MAC provides max–min fairness to all nodes even in a multi-rate WLAN. However, the max–min fairness may not always be the preferred fairness criteria as it significantly reduces overall system throughput. In this paper, we explore the proportional fairness and the time fairness. First, we obtain a condition that must be satisfied by the attempt probabilities to achieve proportional fairness. Using this condition, we propose a stochastic approximation based on-line algorithm that tunes attempt probabilities to achieve proportional fairness. The proposed algorithm can be implemented in a distributed fashion, and can provide optimal performance even when node uses a rate adaptation scheme. Next, we show that the time fairness is a special case of weighted max–min fairness with the weight for a node is equal to its transmission rate. Thus, the existing algorithms to achieve weighted max–min fairness can be used to achieve time fairness as well. This exposition also demonstrates that the proportional fairness and the time fairness are not the same contrary to what was conjectured. Performance comparison of various fairness criteria is done through ns-3 simulations. Simulation results show that time fair schemes achieve the highest throughput, and the sum of logarithm of individual node’s throughputs under the time fairness is close to that under a proportionally fair scheme.     

Max–min utility fair flow management for networks with route diversity

A regional central manager is employed to set aside, for the regional (or back-bone) network that it manages, for each flow class, communications capacity resources for a specific future time horizon. In the context of such a traffic management operation, a longer temporal scale is involved in controlling the admission and distribution of flows across the network. For management scal-ability purposes, flows are aggregated into flow classes. Furthermore, we consider a network operation under which multiple simultaneously activated routes are employed, across possibly distinct segments, to distribute traffic between identified source–destination pairs. We aim to ensure that the utility assigned to each class is as high as feasibly possible while striving to raise the utility gained by all classes in a max–min fair manner. In doing so, we incorporate the communications capacity constraints that are imposed by the underlying hybrid of directional and/or multiple-access wireline and wireless communications media employed across the network system. We develop and present in this paper an optimal algorithm for solving such a traffic management problem. It yields multi-utility-based max–min fair distributions of flow rates, per each class, across the specified multitude of simultaneously activated multi-segment routes. To guarantee that admitted flows are granted their desired capacity resources (and targeted corresponding utility levels), the selection of optimal flow distributions across the network routes is combined with the use of a flow admission control scheme that serves to optimally limit the aggregate rate of flows admitted for each flow class. As illustrative examples, we demonstrate the effectiveness of our solution in comparing its performance with that obtained under the use of a traffic regulation scheme that is not overlaid with a traffic management mechanism that serves to set aside resources for the support of flow classes. We also illustrate the use of our optimal algorithm for determining the optimal placement of unmanned aerial vehicle platforms that serve to supplement a terrestrial transport segment with a space-based one. Copyright © 2010 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.