Fast queuing policies via convex relaxation Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/df65vb07x

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • Traditionally, networking protocol designs have placed much emphasis on point-to-point reliability and efficiency. With the recent rise of mobile and multimedia applications, other considerations such as power consumption and/or Quality of Service (QoS) are becoming increasingly important factors in designing network protocols. As such, we present a new flexible framework for designing robust network protocols under varying network conditions that attempts to integrates various given objectives while satisfying some pre-specified levels of Quality of Service. The proposed framework abstracts a network protocol as a queuing policy, and relies on the optimization methods of convex relaxation and the theory of mixing time for finding the fast queuing policies that drive the distribution of packets in a queue to a given target stationary distribution. It is argued that a target stationary distribution can be used to characterize various performance metrics of network flow. Thus, finding a fast queuing policy that produces a given target stationary distribution is vital in achieving some given objectives. In addition, we show how to augment the basic proposed framework in order to obtain a queuing policy that produces ε-approximation to the target distribution with even faster convergence time. This fast adaptation is especially useful for networking applications in fast-changing network conditions. Both theory and simulation results are presented to verify our framework.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Committee Member
Academic Affiliation
Non-Academic Affiliation
Keyword
Subject
Rights Statement
Peer Reviewed
Language
Replaces
Additional Information
  • description.provenance : Approved for entry into archive by Laura Wilson(laura.wilson@oregonstate.edu) on 2013-06-13T17:43:59Z (GMT) No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: bb87e2fb4674c76d0d2e9ed07fbb9c86 (MD5) thesis_ver_final.pdf: 417530 bytes, checksum: b77c8e70911ab252467cd69810f8748d (MD5)
  • description.provenance : Approved for entry into archive by Julie Kurtz(julie.kurtz@oregonstate.edu) on 2013-06-06T16:52:50Z (GMT) No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: bb87e2fb4674c76d0d2e9ed07fbb9c86 (MD5) thesis_ver_final.pdf: 417530 bytes, checksum: b77c8e70911ab252467cd69810f8748d (MD5)
  • description.provenance : Made available in DSpace on 2013-06-13T17:43:59Z (GMT). No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: bb87e2fb4674c76d0d2e9ed07fbb9c86 (MD5) thesis_ver_final.pdf: 417530 bytes, checksum: b77c8e70911ab252467cd69810f8748d (MD5) Previous issue date: 2013-05-20
  • description.provenance : Submitted by Duong Nguyen-Huu (nguyenhd@onid.orst.edu) on 2013-05-29T21:19:35Z No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: bb87e2fb4674c76d0d2e9ed07fbb9c86 (MD5) thesis_ver_final.pdf: 417530 bytes, checksum: b77c8e70911ab252467cd69810f8748d (MD5)

Relationships

In Administrative Set:
Last modified: 08/04/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items