SCTP: new transport protocol for TCP/IP

For the past 20 years (1980-2000), applications and end users of the TCP/IP suite have employed one of two protocols: the transmission control protocol or the user datagram protocol. Yet some applications already require greater functionality than what either TCP or UDP has to offer, and future applications might require even more. To extend transport layer functionality, the Internet Engineering Task Force approved the stream control transmission protocol (SCTP) as a proposed standard in October 2000. SUP was spawned from an effort started in the IETF Signaling Transport (Sigtrans) working group to develop a specialized transport protocol for call control signaling in voice-over-IP (VoIP) networks. Recognizing that other applications could use some of the new protocol's capabilities, the IETF now embraces SCTP as a general-purpose transport layer protocol, joining TCP and UDP above the IP layer. Like TCP, STCP offers a point-to-point, connection-oriented, reliable delivery transport service for applications communicating over an IP network     

机会网络中一种提高TCP性能的跨层改进算法

针对机会网络中TCP与传染路由结合时,传染路由的"洪泛"特性和机会网络的间断特性会使得TCP性能变差的问题,提出了一种基于传染路由协议和TCP/Reno协议的跨层改进算法——ACK-EPI.该算法对连接开始阶段的慢开始门限值进行修改,以避免因网络错误进入拥塞避免阶段而导致拥塞窗口增长速度过于缓慢.同时,为了避免网络中已经成功交付但仍存储在网络中其他节点的数据包的复本继续在网络中存在并扩散,造成网络资源浪费,算法还利用ACK作为到达通告来删除这些冗余数据包.通过深入的仿真分析和比较,结果表明ACK-EPI算法能明显改善TCP性能.     

一种TD-HSUPA系统的TCP优化方法

TCP在TD-HSUPA系统中的表现不理想,需要采取一些优化措施,在分析了TD-HSUPA系统的网络协议结构之后,提出了一种适用于TD-HSUPA系统的TCP优化方法--由RNC解析终端TCP连接的状态,在终端可能出现超时之前,由NodeB通过调度和信道分配相结合的方法改变终端物理层网络环境.经仿真表明,对于复杂多变的...     

A compression-gathering technique for improving the performance of ISO 11898 networks

ISO 11898 (CAN) networks suffer from serious limitations on both the maximum network extension and the allowable bit rate because of the particular arbitration technique they adopt.

In this paper, a modification of the basic ISO 11898 protocol is described which combines the content compression and data gathering techniques and provides high performance services for periodic data exchanges and message transmissions.

The new protocol yields, on the average, a 10-times performance improvement over conventional CAN without worsening neither the responsiveness nor the bus length, and also features a satisfactory degree of compatibility with the original standard protocol.     

A reactive and dependable transport protocol for wireless mesh networks

In the last few years, several different mesh network architectures have been conceived by both industry and academia; however, many issues on the deployment of efficient and fair transport protocols are still open. One of these issues is rate adaptation, that is, how to allocate the network resources among multiple flows, while minimizing the performance overhead. In order to address this problem, in this paper, we first define an analytical framework for a very simple topology. The model allows us to study the performance of an adaptive and responsive transport protocol when the effect of the lower layers are ignored. The mathematical approach alone does not represent a feasible solution, but it contributes to determining the strengths and weaknesses of our proposal. The main novelty of the proposed solution is that the congestion control approach is based on a hop-by-hop mechanism, which allows nodes to adapt their transmitting rates in a distributed way and to keep track of dynamic multi-hop network characteristics in a responsive manner. This is in contrast with classical literature solutions, founded on an end-to-end support. Anyway, to ensure the reliability, a coarse-grained end-to-end algorithm is integrated with the proposed hop-by-hop congestion control mechanism to provide packet level reliability at the transport layer. Performance evaluation, via extensive simulation experiments, shows that the proposed protocol achieves a high performance in terms of network throughput.     

基于RTT自适应的无线TCP改进算法

针对TCP Reno在无线环境下的性能恶化问题,在研究分析TCP Reno拥塞控制算法问题的基础上,提出一种基于RTT自适应的改进算法.该算法实现了丢包区分的拥塞窗口与慢启动门限调整,减轻了传统TCP由于无法区分拥塞丢包与误码丢包、盲目将拥塞窗口减半带来的性能下降.分析了该算法的可行性,并通过NS仿真对其吞吐量、带宽利用率、公平性等指标进行评估.仿真结果表明,相对TCP Reno,改进算法实现了无线环境下的TCP性能改善,同时具有一定的友好性与公平性.     

A high performance backoff protocol for fast execution of composite web services

Using web services to expose applications over the Internet is now a widely accepted practice. Currently, there are several ongoing efforts that provide ways to effectively compose web services distributed across different organizations. One of the problems underlying the deployment of such composite services on the web, however, is service co-allocation that arises when a composite service needs to ensure all the required component services to be available for execution at the same time. Motivated by this, this paper presents a new decentralized protocol, named web service co-allocation protocol (WSCP), which can facilitate fast execution of composite web services. The proposed framework is an enhancement of the famous two phase commit protocol through the incorporation of tentative hold phase as well as the employment of a new high performance backoff protocol developed to better address the dynamics of the service co-allocation problem. The simulation results show that the proposed approach yields significant improvements over existing protocols.     

MRTP: a multiflow real-time transport protocol for ad hoc networks

Real-time multimedia transport has stringent quality of service requirements, which are generally not supported by current network architectures. In emerging mobile ad hoc networks, frequent topology changes and link failures cause severe packet losses, which degrade the quality of received media. However, in such mesh networks, there usually exist multiple paths between any source and destination nodes. Such path diversity has been demonstrated to be effective in combating congestion and link failures for improved media quality. In this paper, we present a new protocol to facilitate multipath transport of real-time multimedia data. The proposed protocol, the multiflow real-time transport protocol (MRTP), provides a convenient vehicle for real-time applications to partition and transmit data using multiple flows. We demonstrate through analysis that data partitioning, which is an essential function of MRTP, can effectively reduce the short-range dependence of multimedia data, thus improving its queueing performance in underlying networks. Furthermore, we show that a few flows are sufficient for MRTP to exploit most of the benefits of multipath transport. Finally, we present a comprehensive simulation study on the performance of MRTP under a mobile ad hoc network. We show that with one additional path, MRTP outperformed single-flow RTP by a significant margin.     

Unreliable transport protocol using congestion control for high-speed networks

Currently there is no control for the real-time traffic of multimedia applications using UDP (User Datagram Protocol) in high-speed networks. Therefore, although a number of high-speed TCP (Transmission Control Protocol) protocols have been developed for gigabit-speed (or faster) links, the real-time traffic could also congest the network and result in unfairness and throughput degradation of TCP traffic. In this paper, a new unreliable transport protocol, FAST DCCP, is presented for the real-time traffic in high-speed networks. FAST DCCP is based on the DCCP protocol and adopts the FAST scheme to realize congestion control. Some modifications have been made to the mechanisms inherited from DCCP so as to let the proposed protocol can efficiently operate under a large size window. In addition, an enhanced protocol, EEFAST DCCP, using the measurements of one-way delay to dynamically adjust the window size is also proposed to improve the throughput of FAST DCCP with the effect of reverse traffic. Simulation results show that FAST DCCP not only can satisfy the requirements of real-time data delivery, but also perform well in bandwidth utilization and fairness in high-speed networks. Meanwhile, EEFAST DCCP is able to effectively conquer the throughput degradation caused by the reverse traffic.     

An improved transport layer protocol for wireless sensor networks

Wireless sensor networks (WSNs) are a kind of communication networks having independent sensor nodes that form multi-hop ad hoc network to transfer data. In the past few years, various transport control protocols in wireless sensor networks (WSNs) have been developed and proposed in the literature. In this paper, we have analyzed pump slowly, fetch quickly (PSFQ) protocol and presented an improved transport layer protocol for wireless sensor networks. The improved protocol has been analyzed based on various factors such as average latency and average error tolerance and it is found that the proposed protocol is better than PSFQ in terms of these factors.     

On-line retrainable neural networks: improving the performance ofneural networks in image analysis problems

A novel approach is presented in this paper for improving the performance of neural-network classifiers in image recognition, segmentation, or coding applications, based on a retraining procedure at the user level. The procedure includes: 1) a training algorithm for adapting the network weights to the current condition; 2) a maximum a posteriori (MAP) estimation procedure for optimally selecting the most representative data of the current environment as retraining data; and 3) a decision mechanism for determining when network retraining should be activated. The training algorithm takes into consideration both the former and the current network knowledge in order to achieve good generalization. The MAP estimation procedure models the network output as a Markov random field (MRF) and optimally selects the set of training inputs and corresponding desired outputs. Results are presented which illustrate the theoretical developments as well as the performance of the proposed approach in real-life experiments.     

Mobility-Aware RSVP: A framework for improving the performance of multimedia services over wireless IP-based mobile networks

This paper proposes the Mobility-Aware Resource Reservation Protocol (MARSVP) in which mobility and QoS signaling are performed as a single functional block. The key concept of MARSVP is to convey mobility-specific information (binding updates and their associated acknowledgments) by using newly defined RSVP objects embedded in existing RSVP messages. An appealing feature of MARSVP is that it adheres to the current RSVP standard (RFC 2205) and thus requires minimal changes to end nodes without affecting any of the conventional RSVP routers in between. The proposed mechanism is evaluated using a simulation model for application-level performance and an analytical model for network-level signaling cost. Simulation results indicate a 27.9% improvement in QoS interruption when using Mobile IPv6 (MIPv6), 12.5% when using Hierarchical Mobile IPv6 (HMIPv6), and no improvement when using Fast Handovers for MIPv6 (FMIPv6). On the network-level, signaling cost savings of 9.4% and 11.9% are achieved for MIPv6 and HMIPv6, respectively, while FMIPv6 achieves savings of 17.9% when using Voice-over-IP traffic and 26.7% for Video-over-IP traffic. The results of the conducted studies indicate MARSVP’s superiority to conventional RSVP when deployed over wireless networks.     

一种改善Ad Hoc网络中TCP性能的跨层方法

大量研究表明AdHoc网络中TCP的性能非常差,这主要是由于TCP的拥塞控制机制不能有效地解决由共享信道竞争造成的分组丢失问题。文中提出了一种根据TCP发射端MAC层的RTS重发次数,来自适应地调整TCP的最大窗口大小的跨层方法,以控制网络中分组的数量,减小信道竞争。仿真结果表明,该方法能够显著地提高TCP的吞吐量,并改善其稳定性。     

LyraNET: A zero-copy TCP/IP protocol stack for embedded systems

Embedded systems are usually resource limited in terms of processing power, memory, and power consumption, thus embedded TCP/IP should be designed to make the best use of limited resources. Applying zero-copy mechanism can reduce memory usage and CPU processing time for data transmission. Power consumption can be reduced as well. In this paper, we present the design and implementation of zero-copy mechanism in the target embedded TCP/IP component, LyraNET, which is derived from Linux TCP/IP codes and remodeled as a reusable software component that is independent from operating systems and hardware. Performance evaluation shows that TCP/IP protocol processing overhead can be significantly decreased by 23–63%. Besides, object code size of this network component is only 77.64% of the size of the original Linux TCP/IP stack. The experience of this study can serve as the reference for embedding Linux TCP/IP stack into a target system that requires network connectivity and improving the transmission efficiency of Linux TCP/IP by zero-copy implementation. This paper is an extended version of the paper “LyraNET: A Zero-Copy TCP/IP Protocol Stack for Embedded Operating Systems” that appeared in the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications. Mei-Ling Chiang received the B.S. degree in Management Information Science from National Chengchi University, Taipei, Taiwan, in 1989. She received the M.S. degree in 1993 and her Ph.D degree in 1999 in Computer and Information Science from National Chiao Tung University, Hsinchu, Taiwan. Now she is an Assistant Professor in the Department of Information Management at National Chi-Nan University, Puli, Taiwan. Her current research interests include operating systems, embedded systems, and clustered systems. Yun-Chen Lee received the B.S degree in 2002 and the M.S. degree in 2005 in Information Management from National Chi-Nan University, Puli, Taiwan. He is currently a software engineer in InterVideo Digital Tech., responsible for software development of multimedia-related products.     

Secure three-party key distribution protocol for fast network access in EAP-based wireless networks

In this paper, we present a solution that reduces the time spent on providing network access in multi-domain mobile networks where the authentication process is based on the Extensible Authentication Protocol (EAP). The goal is to achieve fast and smooth handoffs by reducing the latency added by the authentication process. This process is typically required when a mobile user moves from one authenticator to another regardless of whether the new authenticator is in the same domain (intra-domain) or different domain (inter-domain). To achieve an efficient solution to this problem, it has been generally recognized that a fast and secure key distribution process is required. We propose a new fast re-authentication architecture that employs a secure three-party key distribution protocol which reduces the number of message exchanges during the network access control process. Our approach is proved to preserve security and verified by means of a formal tool. The resulting performance benefits are shown through our extensive simulations.     

FPGEN: A fast, scalable and programmable traffic generator for the performance evaluation of high-speed computer networks

Testing today’s high-speed network equipment requires the generation of network traffic which is similar to the real Internet traffic at Gbps line rates. There are many software-based traffic generators which can generate packets according to different stochastic distributions. However, they are not suitable for high-speed hardware test platforms. This paper describes FPGEN (Fast Packet GENerator), a programmable random traffic generator which is entirely implemented on FPGA (Field Programmable Gate Array). FPGEN can generate variable packet sizes and traffic with Poisson and Markov-modulated on-off statistics at OC-48 rate per interface. Our work that is presented in this paper includes the theoretical design of FPGEN, the hardware design of the FPGA-based traffic generator board (printed circuit board design and construction) and the implementation of FPGEN on FPGA. Our experimental study demonstrates that FPGEN can achieve both the desired rate and statistical properties for the generated traffic.     

Improved WWW multimedia transmission performance in HTTP/TCP overATM networks

Transmission control protocol/Internet protocol (TCP/IP) is the de facto standard of the networking world. It dynamically adjusts routing of packets to accommodate failures in channels and allows construction of very large networks with little central management. But IP packets are based on the datagram model and are not really suited to real-time traffic. In order to overcome the drawbacks, a new network technology, ATM, is proposed. ATM provides quality of service (QOS) guarantees for various classes of applications and in-order delivery of packets via connection oriented virtual circuits. Unfortunately, when ATM is to be internetworked with the existing network infrastructure, some special signaling, addressing and routing protocols are needed. IP over ATM is one of the methods proposed by IETF. It allows existing TCP/IP applications to run on ATM end-stations and ATM networks to interconnect with legacy LAN/WAN technologies. But the performance of TCP/IP over ATM leaves something to be desired. Partial packet discard (PPD) and early packet discard (EPD) are two schemes to improve its performance. This paper proposes a “selective packet retransmission” scheme for improving HTTP/TCP performance when transmitting through ATM networks. In selective packet retransmission, we take advantage of the property of humans' perception tolerance for errors to determine whether to retransmit a corrupted TCP segment or not. For lossable data, such as images, when an error occurs because of cell losses, it will not be retransmitted. The simulations show that, for the same buffer size and traffic load, selective packet retransmission performs better than PPD, EPD, and plain TCP over ATM     

A link layer adaptive pacing scheme for improving throughput of transport protocols in wireless mesh networks

In this paper, we study the performance of a static multihop wireless network, specifically that of the backhaul network of a two-tier Wireless Mesh Network (WMN) operating on IEEE 802.11 Medium Access Control (MAC) protocol. The performance of an IEEE 802.11 based backhaul network is greatly affected by the MAC contention and congestion in the network. If the sources pump data into the network than can be supported, loss rate increases due to MAC contention and congestion in the network. This also leads to the problem of unfairness among flows. In this paper, we propose a Link Layer Adaptive Pacing (LLAP) scheme that adaptively controls the offered load into the network. This improves the performance of higher layer protocols without any modifications to them. Our LLAP scheme estimates the four hop transmission delay in the network path without incurring any additional overhead (Control packets) and accordingly paces the packet transmissions to reduce MAC contentions in the network. We implement the LLAP scheme in ns-2.29 network simulator and extensively study its performance for both User Datagram Protocol (UDP) and Transmission Control Protocol (TCP) traffic in different network scenarios. In all the cases, our scheme shows a significant improvement in the performance of both UDP and TCP traffic.     

A social-aware routing protocol for opportunistic networks

Understanding nodes mobility is of fundamental importance for data delivery in opportunistic and intermittently connected networks referred to as Delay Tolerant Networks (DTNs). The analysis of such mobility patterns and the understanding of how mobile nodes interact play a critical role when designing new routing protocols for DTNs. The Cultural Greedy Ant (CGrAnt) protocol is a hybrid Swarm Intelligence-based approach designed to address the routing problem in such dynamic and complex environment. CGrAnt is based on: (1) Cultural Algorithms (CA) and Ant Colony Optimization (ACO) and (2) operational metrics that characterize the opportunistic social connectivity between wireless users. The most promising message forwarders are selected via a greedy transition rule based mainly on local information captured from the DTN environment. Whenever global information is available, it can also be used to support decisions. We compare the performance of CGrAnt with Epidemic, PROPHET, and dLife protocols in two different mobility scenarios under varying networking parameters. Results obtained by the ONE simulator show that CGrAnt achieves a higher message delivery and lower message redundancy than the three protocols in both scenarios. The only exception is in one of the scenarios, when messages have a time to live lower than 900 min, where CGrAnt delivers a bit less messages than dLife, although with a lower message redundancy.