1 / 8

Using Multiple Interfaces for Serving High QoS Demands

Using Multiple Interfaces for Serving High QoS Demands. ECS256: Performance Evaluation Prof. Dipak Ghosal Atif Nazir Jonathan Wagoner December 14, 2007. Outline. Motivation Problem Description Scheduling Schemes Scheme Comparison Future Work. Motivation.

dillian
Download Presentation

Using Multiple Interfaces for Serving High QoS Demands

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Using Multiple Interfaces for Serving High QoS Demands ECS256: Performance Evaluation Prof. Dipak Ghosal Atif Nazir Jonathan Wagoner December 14, 2007

  2. Outline Motivation Problem Description Scheduling Schemes Scheme Comparison Future Work

  3. Motivation • Usage of the Internet over Television is becoming the primary source for media, news, and streaming media. Many of these and other high-bandwidth applications have QoS constraints. • Many mobile and other devices have more than one physical connection to a network. • In some cases, the speed of that physical connection is less than the speed of the network. • How can we use multiple physical interfaces to “switch up” or “switch down” traffic, on an opportunistic basis, to meet QoS demands?

  4. Problem Description • Two NICs, each with combined capacity 2µ. • One app. requests data from both NICs. • Want to maximize bandwidth exploitation. • How to schedule requests between NICs?

  5. Scheduling Schemes for Comparison • Case 1: One NIC with 2µ service rate • Case 2: Round-Robin Scheduling on two NICs with service rates µ1, µ2 s.t. µ1+ µ2 = 2µ

  6. Scheduling Schemes for Comparison • Case 3: Quasi-Round-Robin Scheduling on two NICs with service rates µ1, µ2 s.t. µ1+ µ2 = 2µ • Case 4: Minimal Scheduling on two NICs with µ1, µ2 s.t. µ1+ µ2 = 2µ, and µ1 >= µ2

  7. Best Case • Round-Robin • Quasi Round-Robin • Worst Case • X-Axis: Arrival Rate, λ • Y-Axis: Avg. Wait Time

  8. Future Work • Use different arrival and service rates than Poisson. • Use G/M/1/∞ queue for Worst-Case. • Simulations.

More Related