Home > Articles > Operating Systems, Server > Solaris

Like this article? We recommend

Categorizing TCP Traffic

The maximum frame size of the Ethernet is 1518 bytes. Since Sun uses the version 2 format of Ethernet frame, the Ethernet header is always 14 bytes. Excluding the last four bytes of cyclic redundancy check (CRC) code, the maximum payload for each Ethernet frame, or packet, is 1500 bytes. This is called the MTU size of the Ethernet interface. Since the IP and TCP headers require 20 bytes each when the TCP network is used, the actual payload perceived by the user application is 1,460 bytes for each packet. This 1,460-byte payload is called the TCP maximum segment size (MSS) when Ethernet is the underlying carrier1. Based on the MSS, TCP network traffic can be categorized into two types:

  • Bulk transfer traffic—The payload size of most segments from the sender to the receiver is 1,460 bytes.

  • Small packet traffic—The payload size of most segments from the sender to the receiver is below 1,460 bytes.

In the real life, network traffic is a mixture of both, however, this article presents them separately because they are treated differently in the Solaris OE according to the TCP specifications [5].

Typically, bulk transfer traffic is seen when the amount of data to move from one computer to another is far larger than 1,460 bytes. Traffic generated by FTP transfers, network-based backup, and downloading web pages with large amount of graphics fall into this category. Small packet traffic, however, is usually generated by the client/server type of applications. These kinds of applications typically see short requests from the client (for example, a database query), and short replies from the server. (for example, a selected row in the database). Although bulk transfer traffic is the bigger consumer of the two for network bandwidth, both types of traffic require a large amount of system resource to process packets. A system must perform well for both types of traffic to satisfy the demands of the end users, but these two types of traffic exert different types of pressure on the system, and hence behave very differently. The following section describes this behavior.

Bulk Transfer Traffic Performance Issues

The performance of bulk transfer traffic is commonly measured by throughput because the goal is to move as much data as possible in as little time as possible. The overall performance, however, depends on many factors:

  • Size of the TCP window

  • TCP uses the sliding-windows protocol [4] to control the flow of data and to assist reliable delivery. There are two types of windows. One is the send window, the other is the receive window. The send window, together with the sender's congestion window [4], helps the sender to avoid congestion. The receive window prevents the sender from overwhelming the receiver with packets by enforcing a limit on how much data can be sent without waiting for acknowledgment. In a switch-based LAN environment, congestion is usually not an issue. Hence, the window typically refers to the receive window. The size of the receive window can be thought of as the size of a pipe between two water-delivering sites. Once a window is negotiated, data from the sender can start to fill the pipe while it flows from the sender to the receiver. When the pipe is full, the sender will stop sending for a while until the receiver drains the pipe to make room. Ideally, in the steady state, data flows at a constant rate from the sender to the receiver. This rate is determined by the slower party between the receiver and the sender. Suppose the rate is X bps, and the latency from sender to the receiver is T seconds (includes the time the sender takes to send a packet, the time the packet travels in the pipe, and the time the receiver takes to process the packet), the pipe must hold at least X * T/8 bytes at any given time to ensure that the size of the pipe is not a performance bottleneck. To get one gigabit per second (Gbps) on Ethernet (including the headers), the system must deliver 1,000,000,000/8/1518 = 82,345 packets per second. This is equivalent to delivering one full-sized packet every 12 microseconds. If the latency is 100 microseconds, the size of the window needs to be at least 1,000,000,000 * 0.0001/8 = 12,500 bytes.

  • Overhead to move data from the sender to the receiver

  • The significance of this issue is two fold. First, if the sender and receiver are incapable of handling 82,345 packets-per-second, reducing overhead helps to improve throughput and packet rate. Second, if the sender and receiver are capable of handling 82,345 packets- per-second, reducing overhead makes the CPUs more available to run other tasks instead of handling the network traffic. The TCP parameters that affect the overhead include, but are not limited to—tcp_maxpsz_multiplier, tcp_deferred_acks max, and tcp_deferred_ack interval.

  • Quality of the link

  • The quality of the link determines the frequency of dropped/erroneous packets, which leads to retransmitted TCP segments and duplicated acknowledgments (DUP-ACKs). Retransmission and DUP-ACKs waste the effective bandwidth. This article, however, does not evaluate the impact of link quality.

Hence, the general approach to have the best available performance of TCP bulk transfer traffic is to set up a TCP receive window that is sufficiently large and to make the data movement as efficient as possible. Some example mechanisms are selecting the appropriate size for socket buffers, minimizing the number of system calls to send the same amount of data, moving as much data as possible in kernel with each action, and minimizing the number of acknowledgment (ACK) packets from the receiver. "Bulk Transfer Traffic Performance" discusses the details of these mechanisms.

Small Packet Traffic Issues

Request-reply types of applications typically generate small packet traffic. Thus, the latency resulting from packet processing is more important than the throughput delivered. This network latency is usually calculated as measurement time over the number of packets transferred. Hence, if the measurement time is one second, latency is the reciprocal of packet rate-per-second. Since packet rate also shows a server's capability to process packets besides latency, this article uses this metric for the studies on small packet traffic.

Similar issues such as TCP window size and transfer overhead, discussed previously, also affect the performance of small packet traffic. However, small packet traffic faces other challenges too:

  • Nagle's control flow algorithm

  • In RFC 896[5], Nagle's algorithm is proposed to control congestion and reduce the amount of small packets in the Internet traffic. Small packets are not the most efficient way to transfer data, and, hence, the bandwidth hungry Internet backbone should avoid them as much as possible. Nagle's algorithm says: "The sender should not transmit the next small packet if it has already one unacknowledged small packet outstanding. Instead, the sender should accumulate small packets until the amount of data to be transferred exceeds theMTU or when the receiver sends the acknowledgment for the outstanding packet." Hence, applications that send small packets continuously from systems that adopt Nagle's algorithm may observe unwanted delay if the receiving systems enable deferred acknowledgment. However, subsequent sections of this article show that applications can disable Nagle's algorithm on a per connection basis.

  • Distinguish the end of a transmission and the traffic generated by small packets

  • For example, a transfer of 1470 bytes results in a full-sized packet (MTU packet) and a packet with 10 bytes of payload is a small packet. Hence, some algorithms targeting quick resolution of end-of-transfer issues may potentially work against the performance of small packet traffic. This issue is not well understood.

Later sections of this article discuss the performance issues of bulk transfer and small packet traffic separately. But before the packet rate and throughput numbers are discussed, how long does a packet travel from the sender's application to the receiver's application?

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information

To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.


Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.


If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information

Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.


This site is not directed to children under the age of 13.


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information

If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information

Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents

California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure

Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact

Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice

We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020