Show simple item record

dc.contributor.advisorHigle, Julia L.en_US
dc.contributor.authorCameron, Grant Arthur, 1960-en_US
dc.creatorCameron, Grant Arthur, 1960-en_US
dc.date.accessioned2013-04-18T10:03:08Z
dc.date.available2013-04-18T10:03:08Z
dc.date.issued1998en_US
dc.identifier.urihttp://hdl.handle.net/10150/282772
dc.description.abstractDemand for broadband services such as fax, videotelephony, video conference and data transmission continues to explode as we move into the twenty-first century. The new broadband demand differs from voice traffic in that it varies rapidly with respect to the average length of time capacity is held by a customer. Hence, steady state models of network traffic are not valid in general, and may not provide approximations that are sufficiently accurate for network design. In addition, modern telecommunications networks incorporate advanced switching technology that can provide flexible routing of network traffic based on network load and projected demand. It is desireable to take advantage of this new flexibility to design reliable, yet low cost, networks. In this dissertation a multistage stochastic linear programming model for the design of broadband networks is presented, along with a specialized algorithm for solving the program. The algorithm is based on Network Recourse Decomposition (NRD) first introduced by Powell and Cheung. The solution method incorporates cost calculations that prove to be useful for both sizing and routing decisions.
dc.language.isoen_USen_US
dc.publisherThe University of Arizona.en_US
dc.rightsCopyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.en_US
dc.subjectEngineering, Electronics and Electrical.en_US
dc.subjectOperations Research.en_US
dc.titleA model and algorithm for sizing and routing DCS switched telecommunications networksen_US
dc.typetexten_US
dc.typeDissertation-Reproduction (electronic)en_US
thesis.degree.grantorUniversity of Arizonaen_US
thesis.degree.leveldoctoralen_US
dc.identifier.proquest9912071en_US
thesis.degree.disciplineGraduate Collegeen_US
thesis.degree.disciplineSystems and Industrial Engineeringen_US
thesis.degree.namePh.D.en_US
dc.identifier.bibrecord.b39115562en_US
refterms.dateFOA2018-09-05T21:33:47Z
html.description.abstractDemand for broadband services such as fax, videotelephony, video conference and data transmission continues to explode as we move into the twenty-first century. The new broadband demand differs from voice traffic in that it varies rapidly with respect to the average length of time capacity is held by a customer. Hence, steady state models of network traffic are not valid in general, and may not provide approximations that are sufficiently accurate for network design. In addition, modern telecommunications networks incorporate advanced switching technology that can provide flexible routing of network traffic based on network load and projected demand. It is desireable to take advantage of this new flexibility to design reliable, yet low cost, networks. In this dissertation a multistage stochastic linear programming model for the design of broadband networks is presented, along with a specialized algorithm for solving the program. The algorithm is based on Network Recourse Decomposition (NRD) first introduced by Powell and Cheung. The solution method incorporates cost calculations that prove to be useful for both sizing and routing decisions.


Files in this item

Thumbnail
Name:
azu_td_9912071_sip1_m.pdf
Size:
3.300Mb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record