C. Dovrolis, Proportional Differentiated Services for the Internet, PhD Dissertion, 2000.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....the two types of approaches. Proportional Service Differentiation In an effort to quantifying the differentiation between classes of traffic, without absolute service guarantees, the best known effort is the proportional service differentiation model, initially proposed by Dovrolis et al. [20, 21], which attempts to enforce that the ratios of delays or loss rates of successive priority classes be roughly constant. For two priority classes such a service could specify that the delays of packets from the higher priority class be half of the delays from the lower priority class, but without ....

....classes. The other trend is to use scheduling algorithms with dynamic time dependent priorities, in a manner similar to a scheme described by Kleinrock in 1976 ( 46] Ch. 3. 7) WaitingTime Priority (WTP, 23] Mean Delay Proportional (MDP, 57] and the Hybrid Proportional Delay scheduler (HPD, [20]) all fall into this category. The difference between these three schedulers lies in the way the priority of a given packet is computed, but it shall be noted that all three methods use functions increasing with the queueing delays to assign priorities to packets. Dropping Only few dropping ....

C. Dovrolis. Proportional differentiated services for the Internet. PhD thesis, University of Wisconsin-Madison, December 2000.

....or by offering absolute bounds on service parameters, e.g. delays, to a specific set of classes. For instance, the proportional This work is supported in part by the National Science Foundation through grants NCR 9624106 (CAREER) ANI 9730103, and ANI0085955. service differentiation model [4], 5] quantifies the difference in the service by making the ratios of delays or loss rates of different classes roughly constant. This type of service can be implemented through scheduling algorithms [4] 5] 6] 7] 8] 9] 10] 11] and or buffer management algorithms [5] 12] Recent ....

....grants NCR 9624106 (CAREER) ANI 9730103, and ANI0085955. service differentiation model [4] 5] quantifies the difference in the service by making the ratios of delays or loss rates of different classes roughly constant. This type of service can be implemented through scheduling algorithms [4], 5] 6] 7] 8] 9] 10] 11] and or buffer management algorithms [5] 12] Recent works have tried to combine the scheduling and dropping decisions in a single algorithm [13] 14] Most scheduling and or buffer management algorithms aim at proportional differentiation, but do not ....

C. Dovrolis, Proportional differentiated services for the Internet, Ph.D. thesis, University of Wisconsin-Madison, Dec. 2000.

....delays and a lower loss rate than others, but without quantifying the differentiation. Recently, research studies have tried to strengthen the guarantees of relative per class QoS, and have proposed new buffer management and scheduling algorithms which can support stronger notions of relative QoS [6, 13, 14, 31, 32, 39]. Probably the best known such effort is the proportional service differentiation model [13, 14] which attempts to enforce that the ratios of delays or loss rates of successive priority classes be roughly constant. For two priority classes such a service could specify that the delays of packets ....

.... have tried to strengthen the guarantees of relative per class QoS, and have proposed new buffer management and scheduling algorithms which can support stronger notions of relative QoS [6, 13, 14, 31, 32, 39] Probably the best known such effort is the proportional service differentiation model [13, 14], which attempts to enforce that the ratios of delays or loss rates of successive priority classes be roughly constant. For two priority classes such a service could specify that the delays of packets from the higher priority class be half of the delays from the lower priority class, but without ....

[Article contains additional citation context not shown here]

C. Dovrolis. Proportional differentiated services for the Internet. PhD thesis, University of Wisconsin-Madison, December 2000.

....c flSpringer Verlag 2001 than others, but without quantifying the differentiation. Recently, research studies have tried to strengthen the guarantees of relative per class QoS, and have proposed new buffer management and scheduling algorithms which can support stronger notions of relative QoS [6, 7, 15, 16]. Probably the best known such effort is the proportional service differentiation model [6, 7] which attempts to enforce that the ratios of delays or loss rates of successive priority classes be roughly constant. For two priority classes such a service could specify that the delays of packets ....

.... studies have tried to strengthen the guarantees of relative per class QoS, and have proposed new buffer management and scheduling algorithms which can support stronger notions of relative QoS [6, 7, 15, 16] Probably the best known such effort is the proportional service differentiation model [6, 7], which attempts to enforce that the ratios of delays or loss rates of successive priority classes be roughly constant. For two priority classes such a service could specify that the delays of packets from the higher priority class be half of the delays from the lower priority class, but without ....

[Article contains additional citation context not shown here]

C. Dovrolis. Proportional Differentiated Services for the Internet. PhD thesis, University of Wisconsin-Madison, December 2000.

....its scalability and its simplicity, either by trying to quantify the difference in the level of service received by different classes, or by offering absolute bounds on service parameters, e.g. delays, to a specific set of classes. For instance, the proportional service differentiation model [9, 10] quantifies the difference in the service by making the ratios of delays or loss rates of different classes roughly constant. This type of service can be implemented through scheduling algorithms [9, 10, 11, 24, 25] and or buffer management algorithms [7, 10] Recent works have tried to combine ....

....to a specific set of classes. For instance, the proportional service differentiation model [9, 10] quantifies the difference in the service by making the ratios of delays or loss rates of different classes roughly constant. This type of service can be implemented through scheduling algorithms [9, 10, 11, 24, 25] and or buffer management algorithms [7, 10] Recent works have tried to combine the scheduling and dropping decisions in a single algorithm [20, 31] Most scheduling and or buffer management algorithms aim at proportional differentiation, but do not support absolute service guarantees. In a ....

C. Dovrolis. Proportional differentiated services for the Internet. PhD thesis, University of Wisconsin-Madison, December 2000.

....while the rest U Gamma S users with the smallest delay requirements are unsatisfied in the highest class. The maximum value of S and the minimum acceptable class for those S satisfied users can be determined using a centralized algorithm that is similar to the algorithm of Figure 1 (see [19]) In practice, the unsatisfied users may leave the network, or change their rates and or delays requirement. Such user behavior leads to a network load relaxation, and to a new user population U that may be satisfiable. Unsatisfied users, in practice, also introduce some cost for the network ....

C. Dovrolis, Proportional Differentiated Services for the Internet. PhD thesis, University of Wisconsin-Madison, Dec. 2000.

....while the rest U Gamma S users with the smallest delay requirements are unsatisfied in the highest class. The maximum value of S and the minimum acceptable class for those S satisfied users can be determined using a centralized algorithm that is similar to the algorithm of Figure 1 (see [18]) In practice, the unsatisfied users may leave the network, or change their rates and or delays requirement. Such user behavior leads to a network load relaxation, and to a new user population U that may be satisfiable. Unsatisfied users, in practice, also introduce some cost for the network ....

C. Dovrolis, Proportional Differentiated Services for the Internet. PhD thesis, University of Wisconsin-Madison, Dec. 2000.

No context found.

C. Dovrolis, Proportional Differentiated Services for the Internet, PhD Dissertion, 2000.

No context found.

C. Dovrolis. Proportional differentiated services for the Internet. PhD thesis, University of Wisconsin-Madison, December 2000.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC