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.     

Buffer Sizing for TCP Flows in 802.11e WLANs

We consider the task of sizing buffers for TCP flows in 802.11e WLANs. A number of fundamental new issues arise compared to wired networks. These include that the mean service rate is dependent on the level of channel contention and packet inter-service times vary stochastically due to the random nature of CSMA/CA operation. We find that these considerations lead naturally to a requirement for adaptation of buffer sizes in response to changing network conditions.     

Bandwidth estimation schemes for TCP over wireless networks

The use of enhanced bandwidth estimation procedures within the congestion control scheme of TCP was proposed recently as a way of improving TCP performance over links affected by random loss. This paper first analyzes the problems faced by every bandwidth estimation algorithm implemented at the sender side of a TCP connection. Some proposed estimation algorithms are then reviewed, analyzing and comparing their estimation accuracy and performance. As existing algorithms are poor in bandwidth estimation, and in sharing network resources fairly, we propose TIBET (time intervals based bandwidth estimation technique). This is a new bandwidth estimation scheme that can be implemented within the TCP congestion control procedure, modifying only the sender-side of a connection. The use of TIBET enhances TCP source performance over wireless links. The performance of TIBET is analyzed and compared with other schemes. Moreover, by studying TCP behavior with an ideal bandwidth estimation, we provide an upper bound to the performance of all possible schemes based on different bandwidth estimates.     

Buffer and bandwidth allocation for TCP data traffic: experimental results

This paper discusses the dimensioning of buffers and the bandwidth allocation for data traffic in the ATM network. Data traffic is notoriously complex and bursty, making such dimensioning a difficult task. However, the COMBINE project, when dimensioning their InterWorking Units (IWUs), adopted a Poissonian packet arrival model, based upon the argument that burstiness at timescales higher than that of a packet arrival are a problem to be tackled by flow control at higher layers. This paper presents experimental results from the COMBINE testbed that show that this hypothesis was justified and that good TCP goodput was obtained based upon this dimensioning approach, due to TCP's ability to adapt to network congestion. However, it is also shown that it was the TCP algorithm that was ultimately responsible for controlling the packet loss ratio in the network and not the bandwidth allocation or buffer size. The results highlight the importance of taking into account the mutual influence between the ATM layer and the transport layer congestion control algorithms.     

MPTCP中一种减缓缓存阻塞的重传策略

MPTCP中子流间的性能差异、受限的缓存区将导致接收端缓存区阻塞,影响MPTCP整体性能.综合考虑子流的延迟、丢包率、拥塞控制窗口和慢启动门限,提出一种新的重传策略RTX-DLCS.仿真证明该策略能有效减缓缓存区阻塞,提高MPTCP吞吐量.     

Network services and traffic engineering methods for supporting applications on the VTHD experimental gigabit network

vthd is a high-performanceip experimental network. This network and associated research projects have been partially funded by the French government through the French Research Network for Telecommunications (rnrt) in order to support the development of leading-edge network services on the one hand, and test a wide-scale deployment of advanced Internet applications on the other hand. This paper describes the network services that were deemed necessary to support the deployment of innovative applications, as well as several of the applications that have been experimented on the network. It also presents a selection of the traffic engineering methods and experiments that have been developed in the course of thevthd related research projects. This article describes the collective works of members of the project partners, which are represented by the set of authors for the present paper.     

Temporal fairness guarantee in multi-rate wireless LANs for per-flow protection

Wireless LAN technologies such as IEEE 802.11a and 802.11b support high bandwidth and multi-rate data transmission to match the channel condition (i.e., signal to noise ratio). While some wireless packet fair queuing algorithms to achieve the per-flow throughput fairness have been proposed, they are not appropriate for guaranteeing QoS in multi-rate wireless LAN environments. We propose a wireless packet scheduling algorithm that uses the multi-state (multi-rate) wireless channel model and performs packet scheduling by taking into account the channel usage time of each flow. The proposed algorithm aims at per-flow protection by providing equal channel usage time for each flow. To achieve the per-flow protection, we propose a temporally fair scheduling algorithm called Contention-Aware Temporally fair Scheduling (CATS) which provides equal channel usage time for each flow. Channel usage time is defined as the sum of the packet transmission time and the contention overhead time due to the CSMA/CA mechanism. The CATS algorithm provides per-flow protection in wireless LAN environments where the channel qualities of mobile stations are dynamic over time, and where the packet sizes are application-dependent. We also extend CATS to Decentralized-CATS (D-CATS) to provide per-flow protection in the uplink transmission. Using an NS-2 simulation, we evaluate the fairness property of both CATS and D-CATS in various scenarios. Simulation results show that the throughput of mobile stations with stable link conditions is not degraded by the mobility (or link instability) of other stations or by packet size variations. D-CATS also shows less delay and less delay jitter than FIFO. In addition, since D-CATS can coordinate the number of contending mobile stations, the overall throughput is not degraded as the number of mobile stations increases. This work was supported in part by the Brain Korea 21 project of Ministry of Education and in part by the National Research Laboratory project of Ministry of Science and Technology, 2004, Korea.     

On designing self-tuning controllers for AQM routers supporting TCP flows based on pole placement

This paper revisits the simple pole placement technique in the classical control theory, and exploits this technique to propose two kinds of controllers for active queue management (AQM) in Internet protocol (IP) routers: the self-tuning proportional controller based on pole placement (ST/spl I.bar/P/spl I.bar/PP) and the self-tuning proportional-plus-integral controller based on pole placement (ST/spl I.bar/PI/spl I.bar/PP). The damping ratio /spl xi/ and undamped natural frequency /spl omega//sub n/ can be appropriately chosen such that: 1) the transient response performance of the system is satisfied and 2) all the poles would lie in the left-half s-plane to guarantee the stability of the control system. The self-tuning controllers can assign proper intervals of /spl xi/ and /spl omega//sub n/ to achieve good AQM performance and thereby adapting the system to significant load changes very well. Furthermore, the ST/spl I.bar/PI/spl I.bar/PP controller can regulate the packet drop probability based on the knowledge of the instantaneous queue size, and clamp the steady value of the queue length to a specified reference value. We verify the effectiveness of these two controllers via OPNET simulation. Our simulation results show the following: 1) choosing appropriate /spl xi/ and /spl omega//sub n/ can successfully satisfy the transient response of the system and 2) when the network load changes, the ST/spl I.bar/P/spl I.bar/PP controller and the ST/spl I.bar/PI/spl I.bar/PP controller exhibit extremely short settling time.     

Router Buffer Sizing for TCP Traffic and the Role of the Output/Input Capacity Ratio

The issue of router buffer sizing is still open and significant. Previous work either considers open-loop traffic or only analyzes persistent TCP flows. This paper differs in two ways. First, it considers the more realistic case of nonpersistent TCP flows with heavy-tailed size distribution. Second, instead of only looking at link metrics, it focuses on the impact of buffer sizing on TCP performance. Specifically, our goal is to find the buffer size that maximizes the average per-flow TCP throughput. Through a combination of testbed experiments, simulation, and analysis, we reach the following conclusions. The output/input capacity ratio at a network link largely determines the required buffer size. If that ratio is larger than 1, the loss rate drops exponentially with the buffer size and the optimal buffer size is close to 0. Otherwise, if the output/input capacity ratio is lower than 1, the loss rate follows a power-law reduction with the buffer size and significant buffering is needed, especially with TCP flows that are in congestion avoidance. Smaller transfers, which are mostly in slow-start, require significantly smaller buffers. We conclude by revisiting the ongoing debate on ldquosmall versus largerdquo buffers from a new perspective.     

Requirements for contamination control in the gigabit era

The effect of contamination, especially particles and organic materials in cleanrooms, on future device manufacturing was estimated. The number of particles deposited on wafer surfaces was calculated based on particle size distribution in real cleanrooms and the reported data on particle deposition velocity. DRAM yield trend was then calculated taking only particles from the cleanroom environment into account. Killer particle size is assumed to be one-third of the feature size according to the SIA roadmap. In the Gigabit era, a class 0.1-0.01 level environment will be necessary even with a shortened TAT (turn around time). The lower limit of particle density in conventional cleanroom air was estimated to be class 0.1-1 Level by particle generation by people, suggesting the use of a mini-environment fab system to produce high-grade cleanliness. A mini-environment system is also preferable for eliminating other contaminants such as organic compounds. However, box material and additions must be reexamined from the viewpoint of organic contamination control because some organic materials generated from wafer box easily adsorb on silicon surfaces and change the surface conditions     

Optimal dispersion management schemes for WDM soliton systems

Optimal dispersion profiles for a WDM soliton system are obtained by minimising the radiative noise and the collision-induced frequency shift. A two-step optimal profile without dispersion slaving to the ideal exponential profile allows a large increase in the amplifier spacing with no significant deterioration of the system performance     

Database and location management schemes for mobile communications

Signaling traffic incurred in tracking mobile users and delivering enhanced services causes an additional load in the network. Efficient database and location management schemes are needed to meet the challenges from high density and mobility of users, and various service features. In this paper, the general location control and management function is treated as the combination of two parts, the global and local scope. New schemes and methods are proposed, and improvements achieved over established basic schemes are shown by using simulations     

Power-efficient cache management schemes for mobile client-server environments

To conserve the battery capacity of mobile terminals and manage uplink bandwidth effectively, power-efficient cache management schemes that can be used in mobile environments are proposed. With the proposed schemes, the number of redundant data request messages for identical data decreases significantly compared with conventional cache management schemes.     

Traffic management for TCP/IP over satellite ATM networks

Several Ka-band satellite systems have been proposed that will use ATM technology to seamlessly transport Internet traffic. The ATM UBR, GFR, and ABR service categories have been designed for data. However, several studies have reported poor TCP performance over satellite ATM networks. We describe techniques to improve TCP performance over satellite ATM networks. We first discuss the various design options available for TCP end systems, IP-ATM edge devices, as well as ATM switches for long-latency connections. We discuss buffer management policies, guaranteed rate services, and the virtual source/virtual destination option in ATM. We present a comparison of ATM service categories for TCP transport over satellite links. The main goal of this article is to discuss design and performance issues for the transport of TCP over UBR, GFR, and ABR services for satellite ATM networks     

Compact wavelength-selective switch for gigabit filtering in access networks

A compact [200/spl times/200 /spl mu/m/sup 2/] wavelength-selective switch based on thermally tunable SiO/sub 2/--Si/sub 3/N/sub 4/ microring resonators has been designed and realized. The switch supports gigabit filtering applications in access networks. Spectral measurements show an ON-OFF ratio of 12 dB and a channel separation of 20 dB. The 10-Gb/s measurements on a single ring show no degradation of the modulated signal and a theoretical BER (bit-error rate) <10/sup -12/.     

Optimal design of hybrid FEC/ARQ schemes for TCP over wireless links with Rayleigh fading

In this paper, we investigate interactions between TCP and wireless hybrid FEC/ARQ schemes. The aim is to understand what is the best configuration of the wireless link protocol in order to guarantee TCP performance and channel efficiency. Interactions between TCP and different link layer mechanisms are evaluated by means of an analytic model that reproduces: 1) a Rayleigh fading channel with FEC coding, 2) a generic selective repeat ARQ Protocol, and 3) the TCP behavior in a wired-cum-wireless network scenario. The analytic model is validated-by means of ns-based simulations. The analysis represents a contribution to the optimal design of link layer parameters of wireless networks crossed by TCP/IP traffic. The main findings can be summarized as follows: 1) fully reliable ARQ protocols are the best choice for both TCP performance and wireless link efficiency and 2) optimal values of FEC redundancy degree from the point of view of energy efficiency maximizes TCP performance as well.     

A context management framework for supporting context-aware distributed applications

Service platform functions are enablers of adaptive communication services and applications that hide the heterogeneity of the infrastructure, manage personal reachability, manage implicit context, and adapt modality to the context. Furthermore, they can offer a diversity of services, whereby an optimal tradeoff can be made for end users in comfort, cost, security, and mobility. We consider the enablers of context-aware services in distributed environments and present a context management framework that is generic through its hierarchic ordering of context sources and extensible with multiple reasoning realizations. The article focuses on the architectural principles and reasoning methods of the framework.     

TD-SCDMA系统混合业务下的无线资源管理算法研究

给出了智能天线技术在系统级研究的理论模型，推导了采用多用户检测和自适应智能天线技术后的容量和负载评估理论模型。基于该模型，给出了一种新的接入控制算法，并为实时多媒体业务提出了一种先进的动态信道分配算法。仿真结果表明，提出的理论模型和无线资源管理算法适用于TD-SCDMA系统，能够显著提高系统性能，用于实际TD-SCDMA网络的规划优化。     

Design and evaluation of multicast GFR for supporting TCP/IP over hybrid wired/wireless ATM

The major challenges of designing multicast traffic control protocols for a combined wired/wireless network are the varying transmission characteristics (bandwidth, error, and propagation delay) of the wireless and wired media, and the different, possibly conflicting frame rate requests from multiple sources. To address these issues, in this paper we design and evaluate new unicast and multicast guaranteed frame rate (GFR) schemes for supporting TCP/IP traffic over a combined wired/wireless ATM network. We first propose a new, flexible weighted buffer management, and a frame‐based virtual spacing (VS) mechanism implementing weighted fair queueing. The unicast GFR scheme is based on the integration of the new weighted buffer management, and either cell‐based or frame‐based VS. It is then extended to support multicast GFR flows. The multicast scheme presented in this paper is the first multicast GFR scheme appeared in the literature. These schemes are carefully evaluated over several network configuration, supporting heterogeneous TCP/IP traffic with various frame rates. Simulation results show that the new schemes guarantee the minimum rates requested, provide excellent fairness, and achieve reasonably high efficiency. The new schemes may be extended to provide differentiated service in both IP and mobile IP frame work. This revised version was published online in July 2006 with corrections to the Cover Date.