Performance Evaluation of TCP/IP over SCTP/IP Parallel Networking with Parallel Route Transmission

Chapter 11 - Managing Windows 2000 Network Services Fast Track

11 - FTP Software TCP/IP Internetworking Products

Early data networks were based on point-to-point or multipoint topologies. They were often of a star structure with a central processing unit (CPU) at the star's hub. Terminals in this network were “dumb” terminals and relied on the CPU's processing power for nearly all network activity. When the personal computer (PC) gained wide acceptance, distributed processing became the rule. As a result, data networks and data networking became much more complex. We now see complex multiple star, mesh, and tree like networks where many of the nodes have multiple inlets and outlets. Data rates were based on the limitations of the analog network. In the period of the 2nd edition of this book, this roughly equated to 9600 bps. Today, it is common to have 56-kbps access lines to a larger network where the basic channel data rate is 64 kbps. We can bring together these basic building blocks of 64 kbps to form aggregate channels of 128, 256, and 384 kbps up to 1.536 Mbps or 1.984 Mbps. Data protocols instilled order out of contentious chaos in data network operation. These protocols, applying to wide area networks (WANs), are the principal thrust of the chapter. Most are based on shipping user data in packets or frames. We discuss the transport of user data in cells in Chapter 28. Most packet networks are based on CCITT Rec. X.25. If we widen the definition of packet networks to include the transmission control protocol/internet protocol (TCP/IP), certainly X.25 will have a competitor. Both TCP/IP and X.25 have a comparatively high latency (latency is the time it takes from initiation to completion of a data transaction). Frame relay was introduced in the same period. This is a comparatively low latency system. This section provides design data and brief descriptions of wide area data networking as a whole with hypothetical reference circuits, the archetypical data link layer protocol, high-level data link control (HDLC), X.25 and its companion, link access protocol B-layer (LAPB), TCP/IP family of protocols, frame relay family of protocols, and a brief description of SMDS (switched multimegabit data service). Variants of LAPD are discussed in the frame relay section of this chapter. Keywords: enterprise networks; universal application; high-level data-link control; packet-switched; virtual connections; transmission control protocol; internet protocol; ISO transport protocol; frame relay; switched multimegabit data service; internetworking; ITU-T rec X.75; data network management

Many current implementations of protocols such as the Transmission Control Protocol/Internet Protocol (TCP/IP) are inefficient because data are often accessed more frequently than necessary. Three techniques that reduce the need for memory bandwidth are proposed. The techniques are copy-on-write, page remapping, and single-copy. Afterburner, a network-independent card that provides the services that are necessary for a single-copy protocol stack, is described. The card has 1 MByte of local buffers and provides a simple interface to a variety of network link adapters, including HIPPI and asynchronous transfer mode (ATM). Afterburner can support transfers to and from the link adapter card at rates up to 1 Gbit/s. An implementation of TCP/IP that uses the features provided by Afterburner to reduce the movement of data to a single copy is discussed. Measurements of the end-to-end performance of Afterburner and the single-copy implementation of TCP/IP are presented.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

The authors describe a connection-oriented transport-level protocol (local network transport protocol, LNTP) specifically designed for use on LANs (local area networks). The fundamental philosophy in the design of LNTP is simplicity. Features irrelevant to the LAN environment are not included, resulting in a simpler and more efficient protocol. LNTP uses a simple but effective two-region flow control mechanism which is activated only when the traffic intensity exceeds some value. This eliminates control packets during normal operation and increases concurrency between sender and receiver. LNTP runs under 4.2 BSD UNIX in place of TCP/IP (transmission control protocol/internet protocol). Detailed comparisons between LNTP and TCP/IP show that LNTP is several times faster, although end-to-end throughput rates are only 30% faster because of the overhead attributed to Ethernet and UNIX layers. However, the reduced CPU cycles as well as the increased network throughput indicate that LNTP is a viable replacement for TCP/IP. >

In previous chapters, the local applications and services of UNIX in individual computers have been introduced. This chapter will present the remote and network functions and services of UNIX in servers and workstations. After explanation of general concepts about the Internet and computer networking, Transmission Control Protocol/Internet Protocol (TCP/IP) suit will be presented, and contents associated with layers of TCP/IP model from down to up will be discussed. Finally, we will explain how to use some commands in the application layer of the TCP/IP model, such as telnet, ping, ftp, etc.

Chapter 2 - Microsoft TCP/IP 2000

Chapter 3 - The Internet and TCP/IP

The Stream Control Transmission Protocol (SCTP) is a reliable transport protocol to tackle the limitations of TCP and UDP. SCTP was originally designed to transport PSTN signaling messages over IP networks, but is also capable of serving as a general-purpose transport protocol. SCTP provides attractive features such as multi-streaming and multi-homing that may be helpful in high-mobility environment. SCTP congestion control mechanisms are based upon TCP congestion principals with the exception of the fast recovery algorithm. Original SCTP congestion control can perform badly in high-speed wide area networks because of its slow response with large congestion window. We proposed a new congestion control scheme based on the simple congestion window modification for SCTP to improve its performance in high-speed wide area networks. The results of several experiments we performed proved that our new suggested congestion control scheme for SCTP in high-speed network improved the throughput of the original SCTP congestion control scheme significantly.

In this paper, we propose a vision system using a field programmable gate array(FPGA) and a smart vision chip. The output of the vision chip is varied by illumination conditions. This chip is suitable as a surveillance system in a dynamic environment. However, because the output swing of a smart vision chip is too small to definitely confirm the warning signal with the FPGA, a modification was needed for a reliable signal. The proposed system is based on a transmission control protocol/internet protocol(TCP/IP) that enables monitoring from a remote place. The warning signal indicates that some objects are too near.

The mono-stereo controller using an audio mute clock has been used at the International Broadcasting Bureau (IBB) FM 106.6 MHz transmitter in Ulaan Baatar, Mongolia since 2010. The major problem of the FM broadcast station was from a frozen programmable logic controller, PLC, that must be manually reset and the report by the VOA listeners. A PLC auto power reset circuit was proposed and built as a mono-stereo controller to monitor the operation of the PLC. The circuit was also used to restart the PLC whenever it became frozen. A cloud router and Transmission Control Protocol/Internet Protocol (TCP/IP) to a Recommended Standard Number 232 (RS-232) converter were used to synchronize the time parameter of the PLC. From the results, this circuit improved transmitter availability and quality of the 24 hours/day broadcast program without affecting the listeners. The reliability of the cloud router is acceptable with low delay of data transfer via the internet connection between Thailand and Mongolia. The cloud router, leased by IBB from a provider that offers Internet services at speeds of up to 1000 Mb/s via a remote terminal, is used for scheduled programming and correct time synchronization of the PLC. The proposed system is very stable and there has been no incidence of a frozen PLC when connected to the Internet or when it was disconnected. Hence, the designed PLC auto power reset circuit can be used for relief of this frozen PLC problem.

Chapter 3 - MCSA/MCSE 70-291: The Dynamic Host Configuration Protocol

Early data networks were based on point‐to‐point or multipoint topologies. They were often of a star structure with a central processing unit (CPU) at the star's hub. Terminals in this network were “dumb” terminals and relied on the CPU's processing power for nearly all network activity.When the personal computer (PC) gained wide acceptance, distributed processing became the rule. As a result, data networks and data networking became much more complex. We now see complex multiple star, mesh, and tree like networks where many of the nodes have multiple inlets and outlets.Data rates were based on the limitations of the analog network. In the period of the 2nd edition of this book, this roughly equated to 9600 bps. Today, it is common to have 56‐kbps access lines to a larger network where the basic channel data rate is 64 kbps. We can bring together these basic building blocks of 64 kbps to form aggregate channels of 128, 256, and 384 kbps up to 1.536 Mbps or 1.984 Mbps.Data protocols instilled order out of contentious chaos in data network operation. These protocols, applying to wide area networks (WANs), are the principal thrust of the chapter. Most are based on shipping user data in packets or frames. We discuss the transport of user data in cells in Chapter 28.Most packet networks are based on CCITT Rec.X.25. If we widen the definition of packet networks to include the transmission control protocol/internet protocol (TCP/IP), certainly X.25 will have a competitor. Both TCP/IP and X.25 have a comparatively high latency (latencyis the time it takes from initiation to completion of a data transaction). Frame relay was introduced in the same period. This is a comparatively low latency system.This section provides design data and brief descriptions of wide area data networking as a whole with hypothetical reference circuits, the archetypical data link layer protocol, high‐level data link control (HDLC), X.25 and its companion, link access protocol B‐layer (LAPB), TCP/IP family of protocols, frame relay family of protocols, and a brief description of SMDS (switched multimegabit data service). Variants of LAPD are discussed in the frame relay section of this chapter.

Given the current expansion of cloud computing, the expected advent of the Internet of Things, and the requirements of future fifth‐generation network infrastructures, significantly larger pools of computational and storage resources will soon be required. This emphasizes the need for more scalable data centers that are capable of providing such an amount of resources in a cost‐effective way. A quick look into today's commercial data centers shows that they tend to rely on variations of well‐defined leaf‐spine/Clos data center network (DCN) topologies, offering low latency, ultrahigh bisectional bandwidth, and enhanced reliability against concurrent failures. However, DCNs are typically restricted by the use of the Transmission Control Protocol/Internet Protocol (TCP/IP) suite, thus suffering limited routing scalability. In this work, we study the benefits that replacing TCP/IP with the recursive internetwork architecture (RINA) can bring into commercial DCNs, focusing on forwarding and routing scalability. We quantitatively evaluate the benefits that RINA solutions can yield against those based on TCP/IP and highlight how, by deploying RINA, topological routing solutions can improve even more the efficiency of the network. To this goal, we propose a rule‐and‐exception forwarding policy tailored to the characteristics of several DCN variants, enabling fast forwarding decisions with merely neighbors' information. Upon failures, few exceptions are necessary, whose computation can also profit from the known topology. Extensive numerical results show that the proposed policy requirements depend mainly on the number of neighbors and concurrent failures in the DCN rather than its size, dramatically reducing the amount of forwarding and routing information stored at DCN nodes.

We characterize the operation of the SCTP transport protocol over the land mobile satellite channel (LMSC), which is subject to intermittent blockages, and contrast its performance with that of TCP. In particular, we study the ability of SCTP's multihoming capability to adjust to channel blockages. For small files, SCTP's larger connection setup overheads cause single-homed connections to complete transfers slightly slower than TCP. However, depending on the ability of alternate paths, multihoming can improve transfer times so much that SCTP is competitive with an optimized TCP gateway. For large files, quirks in the congestion control of multihomed associations cause performance to deteriorate considerably; though single-homed SCTP is faster than end-to-end TCP, none of the other options can compete with a highly optimized satellite TCP gateway operating without congestion control over the satellite channel. SCTP multihoming semantics do not lend themselves to protocol-spoofing gateways, but some changes to default parameters can help. In the LMSC environment, applications would generally do best to use multihomed SCTP (if available) for small file transfers and gateway-enhanced TCP for larger transactions.