Home > Articles > Operating Systems, Server > Microsoft Servers

2.5 Sharing Network Resources: Multiple Resource Pools

The general QoS-enabled network is required to simultaneously support applications with differing QoS requirements. Thus, in any part of the network, it must be possible to provide both low- and high-quality services. To this end, any physical subnetwork can be partitioned into a number of logical networks. The physical resources are allocated among the logical networks. Each logical network may be operated at a different point on the network’s QE curve or even on a different QE curve.

2.5.1 Isolation Between Traffic Types Requiring Different Quality Service

High-quality services typically are made practical via the use of signaling and explicit admission control. Low-quality services may be offered by push provisioning, with no explicit admission control. To support both service types simultaneously in a single physical network, policing is required. Policing refers to the capability to prevent traffic from seizing resources to which it is not entitled.

Traffic admitted through the process of signaling and explicit admission control allows itself to be more readily policed than that which is not. The admission control process informs the network of the routes that will be used by admitted traffic. Resource requests for traditional IntServ services also inform the network of the specific quantity of resources that will be used by admitted traffic along the indicated routes. Thus, signaling requests offer the network policing parameters for the signaled traffic. The network then can ensure that the signaled traffic does not claim resources along routes other than those on which it is admitted and that the signaled traffic does not claim excess quantities of resources. (Note that policing may be applied on a per-conversation basis or on an aggregate basis).

By contrast, traffic that is not allotted resources as a result of signaling and explicit admission control does not offer policing parameters to the network. The network manager allots resources to this traffic by pushing classifiers to network devices, which qualify the traffic to receive certain resources. However, because the traffic offers no hint as to where it will appear in the network and at what volumes it will appear, the network manager is hard pressed to select appropriate policing parameters. Without policing, any traffic that appears at a network device and matches the preconfigured classifiers is capable of seizing resources.

To maintain the integrity of high-quality services, the network manager must prevent this rogue traffic from seizing resources that are required to support the high-quality services. Because this traffic offers no policing parameters, the network manager is left with no choice but to subjugate it to the traffic that is being offered high-quality services. This means that at network devices, traffic associated with high-quality services is policed and given prioritized access to resources. Traffic associated with lower-quality services is not policed but is given lower priority in its access to resources. In effect, traffic is divided into two pools.


Because traffic associated with lower-quality services is subjugated to traffic associated with higher-quality services, it is not necessarily true that applications requiring lower-quality services are treated with less importance than applications requiring higher-quality services. For example, many network managers would balk at the notion that SAP/R3 traffic is treated less importantly than video-conferencing traffic. In general, this would be unacceptable.

The overall treatment of the application’s traffic is determined not only by the priority granted to the application’s traffic in any particular queue, but also by the size of the resource pool available to the application’s traffic. Typically, only a small fraction of the resources available at network devices is available for reservation through explicit admission control, with the majority remaining available for traffic associated with lower-quality services.

Thus, although traffic associated with lower-quality services may briefly yield to latency-sensitive traffic associated with higher-quality services, the average amount of resources available to the lower-quality traffic is likely to be higher than that which is available to higher-quality traffic.

2.5.2 The Four Logical Networks

It is useful to recognize four logical networks within the general physical network. Each of these controls a certain (though not necessarily constant size) resource pool. Each may be operated on a different QE curve, and each offers a different general QoS to accommodate a different type of traffic. In general, traffic requiring higher qualities of service is policed so that it does not starve traffic requiring lower-quality services. The four logical networks can be described based on the type of traffic they serve, as follows.

  • Quantifiable traffic requiring high-quality guarantees—This type of traffic requires a specifically quantifiable amount of resources along specific routes. These resources typically are allocated as a result of RSVP signaling, which quantifies the amount of resources required by the traffic flow in each part of the network. The highest-priority queues in network devices are reserved for this traffic. This traffic is subjected to strict admission control and policing. Examples of this type of traffic include IP telephony traffic and other multimedia traffic.

  • Nonquantifiable persistent traffic requiring high-quality guarantees—This type of traffic requires resources that cannot be specifically quantified. However, it tends to be persistent in the sense that it consumes resources along a known route for some reasonable duration. Resources are allocated to this class of traffic as a result of RSVP signaling, which does not specifically quantify the resources required by the traffic flow. This signaling informs the network of the application sourcing the traffic, as well as the route taken through the network. This information facilitates prediction of traffic patterns, enabling reasonable quality guarantees. However, because resource requirements are not strictly quantified, resource consumption cannot be strictly policed, and this traffic is assigned to queues that are of lower priority than those available for quantifiable traffic. Examples of this type of traffic include client-server, session-oriented, mission-critical applications such as SAP and PeopleSoft.

  • Nonquantifiable, nonpersistent traffic requiring low- or medium-quality guarantees—This type of traffic is relatively unpredictable because its resource requirements cannot be quantified and because its route through the network is fleeting and subject to frequent changes. The overhead of signaling cannot be justified for this type of traffic because it can provide little information to assist the network manager in managing the resources allocated to it. Because the impact of this traffic is so unpredictable, this traffic is forced to use queues that are of lower priority than those used by signaled traffic. As a result, only low-quality guarantees can be offered to such traffic. An example of this type of traffic is Web-surfing traffic.

  • Best-effort traffic—This is all remaining traffic, which is not quantifiable and not persistent, and which does not need any QoS guarantees. The network manager must assure that resources are available in the network for such traffic, but no specific QoS must be provided for it. This traffic uses default FIFO queues and receives resources that are left over after the requirements of higher-priority traffic have been satisfied.


Although it is implied that the resource pools are isolated from each other using strict priority queuing (see Chapter 3, “Queuing Mechanisms”), this is not necessarily the case. Other queuing schemes may be used as well, such as allocating relative shares of a link to different subsets of traffic, with no strict priority relationship between the queues.

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