Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network

Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics

All Dissertations

Theses/Dissertations

Algorithms

Publication Year

Articles 1 - 2 of 2

Full-Text Articles in Entire DC Network

Downstream Resource Allocation In Docsis 3.0 Channel Bonded Networks, Scott Moser Aug 2011

Downstream Resource Allocation In Docsis 3.0 Channel Bonded Networks, Scott Moser

All Dissertations

Modern broadband internet access cable systems follow the Data Over Cable System Interface Specification (DOCSIS) for data transfer between the individual cable modem (CM) and the Internet. The newest version of DOCSIS, version 3.0, provides an abstraction referred to as bonding groups to help manage bandwidth and to increase bandwidth to each user beyond that available within a single 6MHz. television channel. Channel bonding allows more than one channel to be used by a CM to provide a virtual channel of much greater bandwidth. This combining of channels into bonding groups, especially when channels overlap between more than one bonding …


Linear-Time Algorithms For Edge-Based Problems, Alan Jamieson Aug 2007

Linear-Time Algorithms For Edge-Based Problems, Alan Jamieson

All Dissertations

There is a dearth of algorithms that deal with edge-based problems in trees, specifically algorithms for edge sets that satisfy a particular parameter. The goal of this thesis is to create a methodology for designing algorithms for these edge-based problems. We will present a variant of the Wimer method [Wimer et al. 1985] [Wimer 1987] that can handle edge properties. We call this variant the Wimer edge variant. The thesis is divided into three sections, the first being a chapter devoted to defining and discussing the Wimer edge variant in depth, showing how to develop an algorithm using this variant, …