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     

TCP/IP performance over satellite links

Achieving high data rates using TCP/IP over satellite networks can be difficult. This article explains some of the reasons TCP/IP has difficulty with satellite links. We present solutions to some problems, and describe the state of the research on some the unsolved problems     

Cross-layer optimization in TCP/IP networks

TCP-AQM can be interpreted as distributed primal-dual algorithms to maximize aggregate utility over source rates. We show that an equilibrium of TCP/IP, if exists, maximizes aggregate utility over both source rates and routes, provided congestion prices are used as link costs. An equilibrium exists if and only if this utility maximization problem and its Lagrangian dual have no duality gap. In this case, TCP/IP incurs no penalty in not splitting traffic across multiple paths. Such an equilibrium, however, can be unstable. It can be stabilized by adding a static component to link cost, but at the expense of a reduced utility in equilibrium. If link capacities are optimally provisioned, however, pure static routing, which is necessarily stable, is sufficient to maximize utility. Moreover single-path routing again achieves the same utility as multipath routing at optimality.     

Low‐loss TCP/IP header compression for wireless networks

Wireless is becoming a popular way to connect mobile computers to the Internet and other networks. The bandwidth of wireless links will probably always be limited due to properties of the physical medium and regulatory limits on the use of frequencies for radio communication. Therefore, it is necessary for network protocols to utilize the available bandwidth efficiently. Headers of IP packets are growing and the bandwidth required for transmitting headers is increasing. With the coming of IPv6 the address size increases from 4 to 16 bytes and the basic IP header increases from 20 to 40 bytes. Moreover, most mobility schemes tunnel packets addressed to mobile hosts by adding an extra IP header or extra routing information, typically increasing the size of TCP/IPv4 headers to 60 bytes and TCP/IPv6 headers to 100 bytes. In this paper, we provide new header compression schemes for UDP/IP and TCP/IP protocols. We show how to reduce the size of UDP/IP headers by an order of magnitude, down to four to five bytes. Our method works over simplex links, lossy links, multi‐access links, and supports multicast communication. We also show how to generalize the most commonly used method for header compression for TCP/IPv4, developed by Jacobson, to IPv6 and multiple IP headers. The resulting scheme unfortunately reduces TCP throughput over lossy links due to unfavorable interaction with TCP's congestion control mechanisms. However, by adding two simple mechanisms the potential gain from header compression can be realized over lossy wireless networks as well as point‐to‐point modem links. This revised version was published online in June 2006 with corrections to the Cover Date.     

DRED: a random early detection algorithm for TCP/IP networks

It is now widely accepted that a RED [2] controlled queue certainly performs better than a drop‐tail queue. But an inherent weakness of RED is that its equilibrium queue length cannot be maintained at a preset value independent of the number of TCP active connections. In addition, RED's optimal parameter setting is largely correlated with the number of connections, the round‐trip time, the buffer space, etc. In light of these observations, we propose DRED, a novel algorithm which uses the basic ideas of feedback control to randomly discard packets with a load‐dependent probability when a buffer in a router gets congested. Over a wide range of load levels, DRED is able to stabilize a router queue occupancy at a level independent of the number of active TCP connections. The benefits of stabilized queues in a network are high resources utilization, predictable maximum delays, more certain buffer provisioning, and traffic‐load‐independent network performance in terms of traffic intensity and number of connections. Copyright © 2002 John Wiley & Sons, Ltd.     

A simple mechanism for stabilizing network queues in TCP/IP networks

In this paper we determine the stability bounds for the DRED active queue management (AQM) algorithm using a previously developed nonlinear dynamic model of TCP. We develop a second‐order linear model with time delay by linearizing the nonlinear model. Using the Pade approximation of time‐delayed system e^?R0s, where R₀ is the delay in the system, we then determine the range of stabilizing gains of DRED when controlling the second‐order system with time delay R₀. We also present examples showing the stability bounds of the DRED controller gain for networks with different parameters such as link capacity, load level, and round‐trip time. In addition, we describe an efficient implementation of the DRED AQM algorithm. Copyright © 2006 John Wiley & Sons, Ltd.     

区分服务网络中的TCP友好公平体系

区分服务(Differentiated Services)是IETF为实现IP服务质量(QoS)而定义的一个体系结构。研究表明,在该体系中存在不公平问题,该文将TCP友好(TCP Friendly)的概念引入到DS网络中,并定义了DS网络中的TCP友好的公平性,仿真验证了目前IETF定义的流量调节(TrafficConditioning)以及丢包策略等机制不能很好地实现TCP友好公平性,因而提出了直接拥塞控制机制来实现这一公平性。     

A new ATM adaptation layer for TCP/IP over wireless ATM networks

This paper describes the design and performance of a new ATM adaptation layer protocol (AAL‐T) for improving TCP performance over wireless ATM networks. The wireless links are characterized by higher error rates and burstier error patterns in comparison with the fiber links for which ATM was introduced in the beginning. Since the low performance of TCP over wireless ATM networks is mainly due to the fact that TCP always responds to all packet losses by congestion control, the key idea in the design is to push the error control portion of TCP to the AAL layer so that TCP is only responsible for congestion control. The AAL‐T is based on a novel and reliable ARQ mechanism to support quality‐critical TCP traffic over wireless ATM networks. The proposed AAL protocol has been validated using the OPNET tool with the simulated wireless ATM network. The simulation results show that the AAL‐T provides higher throughput for TCP over wireless ATM networks compared to the existing approach of TCP with AAL 5. This revised version was published online in July 2006 with corrections to the Cover Date.     

Network management of TCP/IP networks: present and future

Recent network management activities in the TCP/IP community have focused on standardizing two network management protocols-Simple Network Management Protocol (SNMP) and Common Management Information Services and Protocol Over TCP/IP (CMOT)-that provide for the exchange of management information. The current SNMP and CMOT approaches to TCP/IP network management are compared from several different perspectives; comparisons are based on both theory and knowledge gained from actual implementation experiences. The current level of user and vendor acceptance for these two protocols is examined and explained, and ongoing standardization efforts are summarized. Relevant ongoing work is summarized, and trends over the next few years are discussed     

一种用于TCP/IP减荷的体系结构

TCP/IP减荷的目的是为了将系统主处理器从用于协议处理的繁重的内核中断服务中解脱出来。笔者从对TCP/IP减荷的需求出发,分析了TCP/IP减荷在设计方面的要求,进而提出了一种用于TCP/IP减荷的体系结构。     

The performance of TCP/IP for networks with high bandwidth-delayproducts and random loss

This paper examines the performance of TCP/IP, the Internet data transport protocol, over wide-area networks (WANs) in which data traffic could coexist with real-time traffic such as voice and video. Specifically, we attempt to develop a basic understanding, using analysis and simulation, of the properties of TCP/IP in a regime where: (1) the bandwidth-delay product of the network is high compared to the buffering in the network and (2) packets may incur random loss (e.g., due to transient congestion caused by fluctuations in real-time traffic, or wireless links in the path of the connection). The following key results are obtained. First, random loss leads to significant throughput deterioration when the product of the loss probability and the square of the bandwidth-delay product is larger than one. Second, for multiple connections sharing a bottleneck link, TCP is grossly unfair toward connections with higher round-trip delays. This means that a simple first in first out (FIFO) queueing discipline might not suffice for data traffic in WANs. Finally, while the Reno version of TCP produces less bursty traffic than the original Tahoe version, it is less robust than the latter when successive losses are closely spaced. We conclude by indicating modifications that may be required both at the transport and network layers to provide good end-to-end performance over high-speed WANs     

Guaranteed frame rate: a better service for TCP/IP in ATM networks

Guaranteed frame rate, approved by the ATM Forum, is expected to become an important service category to efficiently support TCP/IP traffic in ATM networks. We first describe the GFR traffic contract in detail. We then present different types of switch implementations that have been proposed to support GFR. We analyze the performance of three of these switch implementations by simulations in two different network environments. These simulations show that the scheduler-based implementations provide a much better performance than the simple switch implementation. However, we also show that coupling an active packet discard mechanism to a scheduler-based switch implementation does not produce a performance gain when many TCP connections are multiplexed inside one ATM VC     

Teaching TCP/IP Hands-On

Service discovery is critical to maintaining the privacy of clients and service providers. Individuals often disclose personal information when looking for services, or intruders can deduce this information from historical discovery data, so service-discovery protocols need to protect it from illegitimate access. Privacy-aware service-discovery protocols, however, must still be flexible and scalable so that they can support the requirements of service-oriented pervasive computing. We present EVEY (enhancing privacy of service discovery), a privacy-aware service-discovery protocol that supports syntactic and semantic matching between service requests and advertisements. It protects private information related to service discovery by introducing ambiguity in both service advertisements and service requests so that they can represent a group of services instead of a single, specific service instance.     

A multicast routing algorithm for LEO satellite IP networks

Satellite networks provide global coverage and support a wide range of services. Since low Earth orbit (LEO) satellites provide short round-trip delays, they are becoming increasingly important for real-time applications such as voice and video traffic. Many applications require a mechanism to deliver information to multiple recipients. A multicast routing algorithm for datagram traffic is introduced for LEO satellite IP networks. The new scheme creates multicast trees by using the datagram routing algorithm. The bandwidth utilization and delay characteristics are assessed through simulations     

APS-FeW适用于无线网络的TCP增强方案

TCP的控制隐含了一个假设,即分组丢失都是由网络拥塞引起的,而这一点对于无线网络不成立.因此在无线情况下,会引入了冗余控制,使得传输性能下降.浮点窗口算法(FeW)通过限制TCP的分组注入量,减少冗余控制,在此基础上,提出了改进方案自适应包长算法(APS).仿真数据表明,基于FeW的APS算法(APS-FeW)比FeW算法提升了10%～25%的吞吐量.     

如何安装TCP／IP

在Windows 95客户机中,由于安装的是调制解调器,支持拨号上网的连接访问,不需要安装一个物理网卡,而只需安装一个逻辑网络接口卡,处理与Modem的信息传递.     

TCP/IP协议的拥塞控制策略

网络拥塞问题会导致网络性能下降,对网络正常运行有很大影响,严重时会导致死锁的产生.文中分析了网络拥塞的产生的原因,并着重讨论了传统端到端的TCP拥塞控制的策略和方法,传统TCP拥塞控制策略提出了改进策略和网络层的IP拥塞控制策略.最后对基于TCP和IP拥塞控制策略进行了对比探讨.     

TCP-Peach+: enhancement of TCP-Peach for satellite IP networks

In this letter an improvement to TCP-Peach congestion control scheme, called TCP-Peach+, is proposed to further improve the goodput performance for satellite IP networks. In TCP-Peach+, two new algorithms, jump start and quick recovery, are proposed for congestion control in satellite networks. These algorithms are based on low priority segments, called NIL segments, which are used to probe the availability of network resources as well as error recovery. Simulation experiments show that TCP-Peach+ outperforms TCP-Peach in terms of goodput and achieves fair share of network resources as well     

TCP/IP的路由原理

在阐述TCP/IP分层模型的基础上,分析了基于TCP/IP协议的数据及其流向,并全面地剖析了TCP/IP的路由寻径原理,