Synthesis of a time dependent communication network
Stick, Marvin Earl
MetadataShow full item record
In this paper, an algorithm for the min-cost synthesis of a communication network, which is able to handle flows of all time periods, is given. The algorithm used is the dual simplex me t hod. The first part of the paper is devoted to the explanation of a general network and the methods of finding maximal flows. Then I restrict the discussion to a communication network; in particular, a time dependent communication network. Although the example in Chanter V of this paper is restricted to two distinct time periods, the theory preceding it allows us to discuss a communication network with infinitely many time periods. The only thing to he kept in mind is that each new time period involves much calculation in order to set up the proper constraint equations for it, so an example with more than two time periods would prove to be quite impractical if solved manually.
Thesis (M.A.)--Boston UniversityPLEASE NOTE: Boston University Libraries did not receive an Authorization To Manage form for this thesis or dissertation. It is therefore not openly accessible, though it may be available by request. If you are the author or principal advisor of this work and would like to request open access for it, please contact us at email@example.com. Thank you.