Home > Articles > Software Development & Management

This chapter is from the book

3.2 Overall Proposed QoS Mapping Framework in a DiffServ Network

3.2.1 Overall QoS Mapping Framework

A diagram of the proposed QoS mapping framework is presented in Figure 3.1. In our framework, service differentiation is done in terms of the loss rate and delay performance of network service. (We are assuming that the traffic-conditioning entities of the DiffServ network are taking care of the throughput negotiation.)

03fig01.gifFigure 3.1. Overall QoS mapping framework based on RPI and network DS levels.

Each video flow of a user application must be classified according to its importance to receive low-delay or low-loss packet delivery service from the network. For example, low delay is more important to a video conference application than to a streaming video application. Moreover, each packet is associated with the RPI, which is composed of two normalized indices, the RLI and the RDI. These indices are described in detail in Section 3.3. RLI and RDI are basically indices that indicate the impact of a data segment’s loss and delay, respectively, on the quality of the application. Therefore, these indices specify the data segment’s importance in terms of receiving good service quality from the network layer.

The packets associated with the RPI are categorized into intermediate DS traffic categories (i.e., traffic aggregates with different source traffic priorities) in a fine-grained manner by the application. We use the term “intermediate DS traffic categories” because these categories may change as the packet enters the DS domain. The marking of codepoints in the packets in accordance with these intermediate DS traffic categories is a “pre-marking” [17] from the viewpoint of the DS domain. We allow the application to do such a pre-marking on the basis of the application’s knowledge of the packet’s content without it knowing the status of the network or SLA between the application’s domain and the DS domain. Then, pre-marked (i.e., RPI-categorized) packets are conveyed into the DiffServ-aware node for QoS mapping, which takes into account the SLA with the DS domain, and in the case of dynamic QoS mapping, also the network status. Such QoS mapping can be implemented at the end-system itself, at a DiffServ boundary node, or at both. Thus, given a video application and the responding DiffServ network, the QoS mapping is accomplished by mapping (i.e., marking) the relative prioritized packets to maximize end-to-end video quality under a given cost constraint. Then, at the DiffServ junction (i.e., a DiffServ boundary node), the packets are classified, conditioned, and re-marked to certain network DS levels by considering the traffic profile based on the SLA and current network status. (The QoS mapping implemented at the DiffServ boundary node can be designed to consider the SLA and global view of all the aggregate traffic coming from multiple applications.) Finally, the packets with DS-level mapping are forwarded toward the destination through a packet-forwarding mechanism, which mainly comprises queue management and a scheduling scheme.

In this chapter, we consider the case in which the DS domain provides proportional DiffServ through its packet-forwarding mechanisms. The desired differentiation in queuing may be realized by adopting multiple queues with several drop curves such as multiple RED and RIO [42], [97]. Furthermore, if different weighting factors are adopted, a modified version of WFQ scheduling can be used to complement queue management to provide the desired loss-rate/delay differentiation.

The above QoS mapping framework can be applied to multimedia rate-adaptive transport mechanisms. The framework can be used with a futuristic differentiated service with a pricing mechanism that charges different prices for different classes. Since a video codec has several options for trading compression efficiency for flexible delay manipulation, error resilience, and network friendliness, the QoS coordination has to provide a simplified QoS mapping process between the video encoder and target network. The purpose of introducing RPI is to abstract and isolate coding details from the network adaptation. By assigning RPI to each packet in an appropriate manner (i.e., keeping the fine granularity as much as possible), the proposed delivery system can accommodate the demand of each packet to achieve the best end-to-end performance in adapting to network fluctuations.

3.2.2 Deployment Issues

A typical DiffServ architecture defines a simple forwarding mechanism at interior network nodes while pushing most of the complexity to network boundaries [17], [98]. The traffic conditioner (composed of the meter, marker, shaper, and dropper) is placed at the boundary of the network. Given this functionality at the boundary, interior nodes use a packet-forwarding mechanism with queue management and scheduling for incoming packets to deliver differentiated services to various packets. This DiffServ architecture can bring benefits to both the end-user and ISP by providing better service quality for CM applications if they are willing to pay more for higher quality. Thus, the design principles for QoS mapping should consider the interests of both the end users and the ISPs. That is, an end-user should benefit from a DiffServ-aware application through having the option of obtaining higher service quality, while an ISP should enjoy the benefit of flexible charging based on the end-user’s preferences. To handle this negotiation, we need to measure the QoS demand of CM applications and the QoS supply of DiffServ networks in terms of pre-defined granularity. With pre-defined granularity, service differentiation can be demanded by marking differently at the end-system to request targeted DS levels. The service level may then be adjusted (i.e., through re-marking) in the DiffServ network and handled (i.e., forwarded) accordingly.

Each DS level is identified by the ToS or DS byte (i.e., the DSCP) defined in the IP header. The DiffServ working group also defines PHBs using the DS byte to specify the required forwarding behavior for packets in accordance with DS levels. Among initial PHBs being standardized are the EF PHB for DiffServ PS [24] and the AF PHB for DiffServ AS [23]. The EF PHB group specifies a forwarding behavior in which packets experience very small losses and queuing delays. EF PHB, based on priority queueing, better suits latency-stringent applications at the cost of a higher price. The AF PHB group specifies a forwarding behavior to preferentially drop best-effort (BE) and/or out-of-profile packets when congestion occurs. By limiting the volume of AF flows and managing the BE traffic appropriately, network nodes can ensure better loss behavior for AF-marked packets. As a result, the DiffServ framework provides DS levels with different losses and delays. For example, one EF queue, four AF queues with three drop preferences, and one BE queue may be defined as depicted on the network side in Figure 3.2. We can draw three equivalent cost lines in Figure 3.2, imagining several pricing model possibilities for the ISP. Line (a) considers only loss rate, while Line (c) depends only on delay. Line (b) relies on both loss rate and delay, and it is flexible. That is, at the same cost, it provides various service combinations such as higher delay with a lower loss rate, and vice versa.

03fig02.gifFigure 3.2. QoS mapping from source RPI into network DS levels.

Different DS levels are to be provided based on the marking (on the DS byte) of an application packet, and different amounts of loss and delay are expected based on the requested DS level. Thus, it is natural to think of associating a packet with both loss and delay priorities (i.e., RLI/RDI) rather than with loss alone, albeit in a fine-grained manner. For streaming video applications, the RLI association of each packet should reflect the loss impact of each packet on the video quality. For RDI, classification of video streams depends more on application context (e.g., video conferencing or video-on-demand) than on video content within a stream. For example, as shown on the source side of Figure 3.2, the quality request of two video applications, (A) and (B), are clearly distinguishable in terms of RDI depending on application usage, with added variability expressed by RLI.

For delay differentiation within a stream, Tan and Zakhor [99] considered frame-encoding modes. In this case, the highest delay sensitivity is given to the intra-coded frames (I frames), the next priority is assigned to the predicted frames (P frames), and the bi-directional, interpolated frames (B frames) have the lowest priority based on the encoding and decoding order of each frame type. This implies, however, that within a stream, the RLI and RDI attributes of packets are not completely orthogonal, which makes a reasonable classification somewhat difficult (this is discussed further in Section 3.3). Considering the complexity involved in varying RDI for each packet, we believe an appropriately fixed RDI with varying RLI is more than sufficient. Thus, in this work, we assign a fixed RDI for all packets of an application, as shown in Figure 3.2, and try to establish a satisfactory range of DS levels for the given RDI.

Given the RPI of each packet, our goal is to identify the best QoS mapping for video packets with content-aware forwarding under a cost constraint. At the end-system, an RPI is assigned to each packet, and it is then categorized into the kth category among K DS traffic categories. However, it is still up to a specific deploying environment to determine where the QoS mapping will be conducted. If the QoS mapping is conducted at the network adaptation unit of the end-system, an application can take advantage of its content-awareness (i.e., original RPI) to the extreme. Also, it can cover the early stage of DiffServ deployment, since it does not require any additional supporting network node except for prioritized DS levels. However, it lacks knowledge of the dynamics of the network and of the aggregation effect of competing flows, which can impede the efficiency of mapping because of the lack of a proper feedback mechanism. To provide a better fit into the access network scenario shared by multiple DiffServ-aware applications, it might be worthwhile to introduce a special version of a DiffServ boundary node to handle the proposed QoS mapping. With this, we could treat effective QoS mapping between aggregated CM packets and network DS levels (with fluctuating, but bounded service levels) under the TCA in the SLA. By adjusting the QoS mapping dynamically through coordinated interaction with end-systems, we could expect to achieve sophisticated exploitation of the DiffServ advantage.

However, note that in this chapter, we promote the futuristic concept of a proposed QoS mapping framework while deferring the discussion of practical issues such as dynamic QoS mapping and its aggregation effect.3 By focusing on the QoS mapping problem of each single flow, we have intensively investigated the potential of the proposed framework. In particular, we will discuss how to create the required building components, such as the RPI association/categorization, the persistent packet-forwarding mechanism desired, and the practical formulation of QoS mapping. Thus, with several DiffServ network deployment scenarios and corresponding QoS mappings to consider, both network and end-to-end video performances of the proposed mapping framework are evaluated for end-to-end streaming video over simulated DiffServ networks.

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