Huang, Yaqing
Email Address
ORCID
Disciplines
Search Results
Now showing 1 - 2 of 2
Publication A Simple FIFO-Based Scheme for Differentiated Loss Guarantees(2006-07-22) Huang, Yaqing; Guérin, Roch AToday’s Internet carries traffic from a broad range of applications with different requirements. This has stressed its original, one-class, best-effort model, and has been a major driver of the many efforts aimed at introducing QoS. These efforts have, however, been met with only limited success, in part because the complexity they add is often at odds with the scalability requirements of the Internet. This has motivated many investigations for solutions that offer a better trade-off between service differentiation and complexity. This paper shares similar goals and proposes a simple scheme, Bounded Random Drop (BRD), that supports multiple service classes and is implemented using a single FIFO queue and a basic random dropping mechanism. BRD focuses on loss differentiation, as although losses and delay are both important, the steady rise of Internet link speeds is progressively limiting the impact of delay differentiation. It offers strong loss differentiation capabilities, and does not require traffic profiles or admission controls. BRD guarantees each class losses that, when feasible, are no worse than a specified bound, while enforcing differentiation only when required to meet those bounds. The performance of BRD is investigated for a broad range of traffic mixes and shown to consistently achieve its design goals.Publication Supporting Excess Real-time Traffic with Active Drop Queue(2006-07-01) Huang, Yaqing; Guérin, Roch A; Gupta, PranavReal-time applications often stand to benefit from service guarantees, and in particular delay guarantees. However, most mechanisms that provide delay guarantees also hard-limit the amount of traffic the application can generate, i.e., to enforce to a traffic contract. This can be a significant constraint and interfere with the operation of many real-time applications. Our purpose in this paper is to propose and investigate solutions that overcome this limitation.We have four major goals: (1) guarantee a delay bound to a contracted amount of real-time traffic; (2) transmit with the same delay bound as many excess real-time packets as possible; (3) enforce a given link sharing ratio between excess real-time traffic and other service classes, e.g., best-effort; (4) preserve the ordering of real-time packets, if required. Our approach is based on a combination of buffer management and scheduling mechanisms for both guaranteeing delay bounds, while allowing the transmission of excess traffic. We evaluate the “cost” of our scheme by measuring the processing overhead of an actual implementation, and we investigate its performance by means of simulations using video traffic traces.