Link Capacity Assignment in Dynamic Hierarchical Networks

Simple item page
dc.contributor.authorNance, Richard E.en
dc.contributor.authorMoose, Robert L., Jr.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:36:09Zen
dc.date.available2013-06-19T14:36:09Zen
dc.date.issued1987en
dc.description.abstractThe dynamic hierarchy, which is a generalization of the centralized, tree structured network, is introduced in this paper. First, a queueing network model of the dynamic hierarchy is formulated. Following the derivation of a network performance measure, probabilistic and heuristic assignment strategies are created. These strategies are compared through the use of analysis of variance procedures and preferred strategies are selected. It is found that a relatively simple heuristic strategy produces capacity assignments whose quality is comparable to that of the preferred probabilistic strategy.en
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000077/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000077/01/TR-87-30.pdfen
dc.identifier.trnumberTR-87-30en
dc.identifier.urihttp://hdl.handle.net/10919/20241en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titleLink Capacity Assignment in Dynamic Hierarchical Networksen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR-87-30.pdf
Size:
1.39 MB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science Technical Reports